Uses of Class
com.google.common.geometry.S2Iterator
-
Uses of S2Iterator in com.google.common.geometry
Fields in com.google.common.geometry declared as S2IteratorModifier and TypeFieldDescriptionprivate final S2Iterator
<S2ShapeIndex.Cell> S2ContainsPointQuery.it
private S2Iterator
<S2ShapeIndex.Cell> S2ShapeIndex.RangeIterator.it
private final S2Iterator
<S2ShapeIndex.Cell> S2ShapeIndexRegion.it
The iterator.private S2Iterator
<S2PointIndex.Entry<T>> S2ClosestPointQuery.iter
The iterator for the last-known state of the index.private final S2Iterator
<S2ShapeIndex.Cell> S2EdgeQuery.iter
The following vectors are temporary storage used while processing a query.Methods in com.google.common.geometry that return S2IteratorModifier and TypeMethodDescriptionS2Iterator.copy()
Returns a copy of this iterator, positioned as this iterator is.(package private) static <T extends S2Iterator.Entry>
S2Iterator<T> S2Iterator.copy
(S2Iterator<T> it) Creates a new iterator with the same entries and position asit
.(package private) static <T extends S2Iterator.Entry>
S2Iterator<T> Creates an iterator given a list of entries.(package private) static <T extends S2Iterator.Entry>
S2Iterator<T> Same ascreate(List)
, but acceptsseekFunction
, which is used as the implementation ofseek(S2CellId)
.S2PointIndex.iterator()
Returns a new iterator over the cells of this index, after sorting entries by cell ID if any modifications have been made since the last iterator was created.S2ShapeIndex.iterator()
Returns a new iterator over the cells of this index, positioned at the first cell in the index, after initializing any pending updates.S2ShapeIndexCoder.EncodedS2ShapeIndex.iterator()
Methods in com.google.common.geometry with parameters of type S2IteratorModifier and TypeMethodDescriptionprivate boolean
S2ClosestPointQuery.addCell
(S2CellId id, S2Iterator<S2PointIndex.Entry<T>> iter, boolean seek, S2ClosestPointQuery.Target target) Processes the cell atid
, adding the contents of the cell immediately, or if there are too many points, adding it to the queue to be subdivided.private boolean
S2Loop.boundaryApproxIntersects
(S2Iterator<S2ShapeIndex.Cell> it, S2Cell target) Returns true if the loop boundary intersects 'target'.private boolean
S2Polygon.boundaryApproxIntersects
(S2Iterator<S2ShapeIndex.Cell> it, S2Cell target) Returns true if the polygon boundary intersectstarget
.private boolean
S2Loop.contains
(S2Iterator<S2ShapeIndex.Cell> it, S2Point p) Given an iterator that is already positioned at the S2ShapeIndexCell containingp
, returns contains(p).private boolean
S2Polygon.contains
(S2Iterator<S2ShapeIndex.Cell> it, S2Point p) Given an iterator that is already positioned at the S2ShapeIndex.Cell containingp
, returncontains(p)
.(package private) static <T extends S2Iterator.Entry>
S2Iterator<T> S2Iterator.copy
(S2Iterator<T> it) Creates a new iterator with the same entries and position asit
.<T extends S2Iterator.Entry>
booleanS2Iterator.equalIterators
(S2Iterator<T> it) Returns true if these iterators have the same entries and position.void
S2Iterator.position
(S2Iterator<T> it) Set this iterator to the position given by the other iterator.