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 classA specialization of Cell for the case of two clipped shapes.private static final classA specialization of Cell for multiple shapes per cell.static classS2ClippedShape represents the part of a shape that intersects an S2Cell.private static classAn S2ClippedShape for a shape that completely contains the cell (no edge intersections and containsCenter is true.)private static classAn S2ClippedShape containing a single range of contiguous edge IDs.private static classAn S2ClippedShape that contains the non-contiguous edges fromstarttoendinedges.private static classAn S2ClippedShape that contains a single edge from a given shape.private final classA lazy implementation ofS2ShapeIndex.Cellwhich 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.bCellsprivate final List<S2ShapeIndex.Cell> S2EdgeQuery.cellsTemporary list of cells that intersect the query edge AB.private List<S2ShapeIndex.Cell> S2ShapeIndex.cellsEssentially 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.decodedCellsThe list ofS2ShapeIndex.Cells.private final S2Iterator<S2ShapeIndex.Cell> S2ContainsPointQuery.itprivate S2Iterator<S2ShapeIndex.Cell> S2ShapeIndex.RangeIterator.itprivate final S2Iterator<S2ShapeIndex.Cell> S2ShapeIndexRegion.itThe iterator.private final S2Iterator<S2ShapeIndex.Cell> S2EdgeQuery.iterThe 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.CellS2ShapeIndex.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 voidS2ShapeIndexCoder.encodeCell(S2ShapeIndex.Cell cell, com.google.common.collect.Multimap<S2Shape, Integer> shapeIds, OutputStream output) static booleanS2ShapeUtil.equals(S2ShapeIndex.Cell a, S2ShapeIndex.Cell b) Returns true if the index cells 'a' and 'b' contain identical contents.(package private) static booleanS2ShapeUtil.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 booleanS2ShapeUtil.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 booleanS2Loop.boundaryApproxIntersects(S2Iterator<S2ShapeIndex.Cell> it, S2Cell target) Returns true if the loop boundary intersects 'target'.private booleanS2Polygon.boundaryApproxIntersects(S2Iterator<S2ShapeIndex.Cell> it, S2Cell target) Returns true if the polygon boundary intersectstarget.private booleanS2Loop.contains(S2Iterator<S2ShapeIndex.Cell> it, S2Point p) Given an iterator that is already positioned at the S2ShapeIndexCell containingp, returns contains(p).private booleanS2Polygon.contains(S2Iterator<S2ShapeIndex.Cell> it, S2Point p) Given an iterator that is already positioned at the S2ShapeIndex.Cell containingp, returncontains(p).(package private) booleanS2EdgeQuery.getCells(S2Point a, R2Vector aVector, S2Point b, R2Vector bVector, S2PaddedCell root, List<S2ShapeIndex.Cell> cells) Adds all cells tocellsthat might intersect the query edge fromatoband the cellroot.booleanS2EdgeQuery.getCells(S2Point a, S2Point b, S2PaddedCell root, List<S2ShapeIndex.Cell> cells) Convenience method for callingS2EdgeQuery.getCells(S2Point, R2Vector, S2Point, R2Vector, S2PaddedCell, List).