Uses of Class
com.google.common.geometry.S2ShapeIndex.Cell
-
Uses of S2ShapeIndex.Cell in com.google.common.geometry
Subclasses of S2ShapeIndex.Cell in com.google.common.geometryModifier and TypeClassDescriptionprivate static final class
A specialization of Cell for the case of two clipped shapes.private static final class
A specialization of Cell for multiple shapes per cell.static class
S2ClippedShape represents the part of a shape that intersects an S2Cell.private static class
An S2ClippedShape for a shape that completely contains the cell (no edge intersections and containsCenter is true.)private static class
An S2ClippedShape containing a single range of contiguous edge IDs.private static class
An S2ClippedShape that contains the non-contiguous edges fromstart
toend
inedges
.private static class
An S2ClippedShape that contains a single edge from a given shape.private final class
A lazy implementation ofS2ShapeIndex.Cell
which decodes members on demand.Fields in com.google.common.geometry with type parameters of type S2ShapeIndex.CellModifier and TypeFieldDescriptionprivate final List
<S2ShapeIndex.Cell> S2Loop.LoopCrosser.bCells
private final List
<S2ShapeIndex.Cell> S2EdgeQuery.cells
Temporary list of cells that intersect the query edge AB.private List
<S2ShapeIndex.Cell> S2ShapeIndex.cells
Essentially a map from each non-overlapping cell id to the shapes that intersect that cell, clipped to include only the edges that intersect.private final List
<S2ShapeIndex.Cell> S2ShapeIndexCoder.EncodedS2ShapeIndex.decodedCells
The list ofS2ShapeIndex.Cell
s.private final S2Iterator
<S2ShapeIndex.Cell> S2ContainsPointQuery.it
private S2Iterator
<S2ShapeIndex.Cell> S2ShapeIndex.RangeIterator.it
private final S2Iterator
<S2ShapeIndex.Cell> S2ShapeIndexRegion.it
The iterator.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 S2ShapeIndex.CellModifier and TypeMethodDescriptionS2ShapeIndex.RangeIterator.cell()
(package private) static S2ShapeIndex.Cell
S2ShapeIndex.Cell.create
(int size, S2ShapeIndex.S2ClippedShape[] tempClippedShapes) Returns a Cell with a copy of the given shapes, specialized for the number of elements.Methods in com.google.common.geometry that return types with arguments of type S2ShapeIndex.CellModifier and TypeMethodDescriptionS2ShapeIndex.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 S2ShapeIndex.CellModifier and TypeMethodDescriptionprivate static void
S2ShapeIndexCoder.encodeCell
(S2ShapeIndex.Cell cell, com.google.common.collect.Multimap<S2Shape, Integer> shapeIds, OutputStream output) static boolean
S2ShapeUtil.equals
(S2ShapeIndex.Cell a, S2ShapeIndex.Cell b) Returns true if the index cells 'a' and 'b' contain identical contents.(package private) static boolean
S2ShapeUtil.findLoopCrossing
(List<S2Loop> loops, S2ShapeIndex.Cell cell, S2Error error) Returns true if any of the given loops crosses a different loop (including vertex crossings) or two loops share a common edge, and sets "error" to a human-readable error message.(package private) static boolean
S2ShapeUtil.findSelfIntersection
(List<S2Loop> loops, S2ShapeIndex.Cell cell, S2Error error) Returns true if any of the given loops has a self-intersection (including a duplicate vertex), and set "error" to a human-readable error message.Method parameters in com.google.common.geometry with type arguments of type S2ShapeIndex.CellModifier and TypeMethodDescriptionprivate 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) boolean
S2EdgeQuery.getCells
(S2Point a, R2Vector aVector, S2Point b, R2Vector bVector, S2PaddedCell root, List<S2ShapeIndex.Cell> cells) Adds all cells tocells
that might intersect the query edge froma
tob
and the cellroot
.boolean
S2EdgeQuery.getCells
(S2Point a, S2Point b, S2PaddedCell root, List<S2ShapeIndex.Cell> cells) Convenience method for callingS2EdgeQuery.getCells(S2Point, R2Vector, S2Point, R2Vector, S2PaddedCell, List)
.