All Classes Interface Summary Class Summary Enum Summary
| Class |
Description |
| BigPoint |
A point consisting of BigDecimal coordinates.
|
| EncodedInts |
Utilities for encoding and decoding integers.
|
| InputStreams |
Utilities for handling InputStreams.
|
| LittleEndianInput |
Simple utility for reading little endian primitives from a stream.
|
| LittleEndianOutput |
Simple utility for writing little endian primitives to a stream.
|
| Matrix3x3 |
A simple 3x3 matrix.
|
| ParametrizedS2Point |
An S2Point that also has a parameter associated with it, which corresponds to a time-like order
on the points.
|
| Platform |
Contains utility methods which require different GWT client and server implementations.
|
| PrimitiveArrays |
A set of interfaces for describing primitive arrays.
|
| PrimitiveArrays.Bytes |
An array of bytes.
|
| PrimitiveArrays.Cursor |
A cursor storing a position and a limit.
|
| PrimitiveArrays.Longs |
An array of longs.
|
| R1Interval |
An R1Interval represents a closed, bounded interval on the real line.
|
| R1Interval.Endpoint |
Designates which end of the interval to work with.
|
| R2Rect |
An R2Rect represents a closed axis-aligned rectangle in the (x,y) plane.
|
| R2Rect.Axis |
Valid axes.
|
| R2Vector |
R2Vector represents a vector in the two-dimensional space.
|
| Real |
This class provides portable support for several exact arithmetic operations on double values,
without loss of precision.
|
| S1Angle |
|
| S1Angle.Builder |
|
| S1ChordAngle |
S1ChordAngle represents the angle subtended by a chord (i.e., the straight 3D Cartesian line
segment connecting two points on the unit sphere).
|
| S1Interval |
An S1Interval represents a closed interval on a unit circle (also known as a 1-dimensional
sphere).
|
| S2 |
|
| S2.Metric |
Defines an area or a length cell metric.
|
| S2AreaCentroid |
The area of an interior, i.e.
|
| S2Cap |
S2Cap represents a disc-shaped region defined by a center and radius.
|
| S2Cell |
An S2Cell is an S2Region object that represents a cell.
|
| S2Cell.DoubleBinaryOperator |
|
| S2CellId |
An S2CellId is a 64-bit unsigned integer that uniquely identifies a cell in the S2 cell
decomposition.
|
| S2CellIdVector |
A list of S2CellIds, and specialized methods for directly operating on the encoded form. |
| S2CellIdVectorCoder |
An encoder/decoder of Lists.
|
| S2CellIndex |
A collection of (cellId, label) pairs.
|
| S2CellIndex.CellNode |
Represents a node in the (cellId, label) tree.
|
| S2CellIndex.CellVisitor |
A function that is called with each (cellId, label) pair to be visited.
|
| S2CellIndex.Delta |
To build the cell tree and leaf cell ranges, we maintain a stack of (cellId, label) pairs that
contain the current leaf cell.
|
| S2CellIndex.Labels |
|
| S2CellIndex.RangeNode |
A range of leaf S2CellIds, from the level 30 leaf cell of this range to the next range.
|
| S2CellUnion |
An S2CellUnion is a region consisting of cells of various sizes.
|
| S2ClosestPointQuery<T> |
Given a set of points stored in an S2PointIndex, S2ClosestPointQuery provides methods that find
the closest point(s) to a given query point.
|
| S2ClosestPointQuery.ChordComparable |
A type that is comparable on distance only.
|
| S2ClosestPointQuery.EdgeTarget |
An edge query, used to find the closest points to a query edge.
|
| S2ClosestPointQuery.PointTarget |
A point query, used to find the closest points to a query point.
|
| S2ClosestPointQuery.QueueEntry |
A queued cell waiting to be processed by the current query, ordered by distance to any point in
the cell in ascending order.
|
| S2ClosestPointQuery.Result<T> |
A query result paired with the distance to the query target.
|
| S2ClosestPointQuery.Target |
A kind of query target.
|
| S2Coder<T> |
An interface for encoding and decoding values.
|
| S2ContainsPointQuery |
A query for whether one or more shapes in an S2ShapeIndex contain a given S2Point. |
| S2ContainsPointQuery.EdgeVisitor |
A visitor that receives each edge that has some query point p as an endpoint.
|
| S2ContainsPointQuery.Options |
The options for building an S2ContainsPointQuery.
|
| S2ContainsPointQuery.S2VertexModel |
A rule for whether shapes are considered to contain their vertices.
|
| S2ContainsPointQuery.ShapeVisitor |
A visitor that receives each shape that contains a query point, returning true to continue
receiving shapes or false to terminate early.
|
| S2ContainsVertexQuery |
This class determines whether a polygon contains one of its vertices given the edges incident to
that vertex.
|
| S2ConvexHullQuery |
S2ConvexHullQuery builds the convex hull of any collection of points, polylines, loops, and
polygons.
|
| S2ConvexHullQuery.OrderedCcwAround |
A comparator for sorting points in CCW around a central point "center".
|
| S2Edge |
An abstract directed edge from one S2Point to another S2Point.
|
| S2EdgeIndex |
|
| S2EdgeIndex.DataEdgeIterator |
An iterator on data edges that may cross a query edge (a,b).
|
| S2EdgeQuery |
S2EdgeQuery is used to find edges or shapes that are crossed by an edge.
|
| S2EdgeQuery.CrossingFilter |
An Edges implementation that filters edges of a shape to those that intersect the edge AB or
have an endpoint on either A or B.
|
| S2EdgeQuery.Edges |
An iterator over the sorted unique edge IDs of a shape that may intersect some query edge.
|
| S2EdgeQuery.MergedEdges |
An Edges implementation optimized for merging edges from multiple S2ClippedShapes
already in sorted order.
|
| S2EdgeQuery.ShapeEdges |
An Edges that contains all the edges of a shape with the given number of edges.
|
| S2EdgeQuery.SimpleEdges |
An Edges implementation that includes all the edges of a clipped shape.
|
| S2EdgeQuery.Stepper |
Tracks the current edge index within a clipped shape.
|
| S2EdgeUtil |
This class contains various utility functions related to edges.
|
| S2EdgeUtil.CloserResult |
|
| S2EdgeUtil.ClosestPoint |
Used to denote which point should be used when finding distances/points.
|
| S2EdgeUtil.EdgeCrosser |
Used to efficiently test a fixed edge AB against an edge chain.
|
| S2EdgeUtil.FaceSegment |
FaceSegment represents an edge AB clipped to an S2 cube face.
|
| S2EdgeUtil.LongitudePruner |
The purpose of this class is to find edges that intersect a given longitude interval.
|
| S2EdgeUtil.RectBounder |
This class computes a bounding rectangle that contains all edges defined by a vertex chain v0,
v1, v2, ...
|
| S2EdgeUtil.ResultError |
Encapsulation of a mutable error value.
|
| S2EdgeUtil.WedgeContains |
Returns true if wedge A contains wedge B.
|
| S2EdgeUtil.WedgeContainsOrCrosses |
|
| S2EdgeUtil.WedgeContainsOrIntersects |
|
| S2EdgeUtil.WedgeIntersects |
Returns true if wedge A intersects wedge B.
|
| S2EdgeUtil.WedgeProcessor |
Wedge processors are used to determine the local relationship between two polygons that share a
common vertex.
|
| S2EdgeUtil.WedgeRelation |
Spatial containment relationships between a wedge A to another wedge B.
|
| S2EdgeUtil.XYZPruner |
The purpose of this class is to find edges that intersect a given XYZ bounding box.
|
| S2Error |
An error code and text string describing the first error encountered during a validation process.
|
| S2Error.Code |
|
| S2FractalBuilder |
A simple class that generates "Koch snowflake" fractals (see Wikipedia for an introduction).
|
| S2Iterator<T extends S2Iterator.Entry> |
A random access iterator that provides low-level access to entries sorted by cell ID.
|
| S2Iterator.Entry |
An interface to provide the cell ID for an element in a sorted list.
|
| S2LatLng |
This class represents a point on the unit sphere as a pair of latitude-longitude coordinates.
|
| S2LatLngRect |
S2LatLngRect represents a latitude-longitude rectangle.
|
| S2LatLngRect.Builder |
This class is a builder for S2LatLngRect instances.
|
| S2LatLngRectBase |
|
| S2LaxPolygonShape |
A region defined by a collection of zero or more closed loops.
|
| S2LaxPolygonShape.Coder |
|
| S2LaxPolygonShape.MultiArray |
A multi polygon with points referenced from an array.
|
| S2LaxPolygonShape.MultiList |
A multi polygon with vertices referenced from a List, and cumulative edges
referenced from an PrimitiveArrays.Longs. |
| S2LaxPolygonShape.MultiPacked |
A multi polygon with vertex coordinates stored in a double[].
|
| S2LaxPolygonShape.MultiSnapped |
A multi polygon with vertices at cell ID centers stored in a long[].
|
| S2LaxPolygonShape.SimpleArray |
A simple polygon with points referenced from an array.
|
| S2LaxPolygonShape.SimpleList |
A simple polygon with vertices referenced from a List.
|
| S2LaxPolygonShape.SimplePacked |
A simple polygon with vertex coordinates stored in a double[].
|
| S2LaxPolygonShape.SimpleSnapped |
A simple polygon with vertices at cell ID centers stored in a long[].
|
| S2LaxPolylineShape |
S2LaxPolylineShape represents a polyline.
|
| S2LaxPolylineShape.Coder |
|
| S2LaxPolylineShape.MultiArray |
A multi polyline storing references to previously allocated S2Point instances.
|
| S2LaxPolylineShape.MultiPacked |
A multi polyline storing xyz coordinates in a single packed 'double' array.
|
| S2LaxPolylineShape.MultiSnapped |
A multi polyline storing cell IDs in a single 'long' array.
|
| S2LaxPolylineShape.SimpleArray |
A polyline storing references to previously allocated S2Point instances.
|
| S2LaxPolylineShape.SimpleList |
A polyline storing S2Points in a List. |
| S2LaxPolylineShape.SimplePacked |
A polyline storing xyz coordinates in a single packed 'double' array.
|
| S2LaxPolylineShape.SimpleSnapped |
A polyline storing cell IDs in a single 'long' array.
|
| S2Loop |
An S2Loop represents a simple spherical polygon.
|
| S2Loop.CompareBoundaryRelation |
Loop relation for compareBoundary().
|
| S2Loop.CompressedEncodingProperties |
|
| S2Loop.CompressedEncodingProperties.Property |
|
| S2Loop.ContainsRelation |
Loop relation for contains().
|
| S2Loop.IntersectsRelation |
Loop relation for intersects().
|
| S2Loop.LoopCrosser |
LoopCrosser is a helper class for determining whether two loops cross.
|
| S2Loop.LoopOffsets |
Offsets into two loops at which a boundary distance comparison will start.
|
| S2Loop.LoopRelation |
A relation between two loops (e.g.
|
| S2PaddedCell |
S2PaddedCell represents an S2Cell whose (u,v)-range has been expanded on all sides by a given
amount of "padding".
|
| S2Point |
An S2Point represents a point on the unit sphere as a 3D vector.
|
| S2Point.Builder |
|
| S2Point.Shape |
An S2Shape representing a list of S2Points.
|
| S2Point.Shape.Coder |
|
| S2PointCompression |
|
| S2PointCompression.FaceRunCoder |
|
| S2PointCompression.FaceRunCoder.FaceRun |
|
| S2PointCompression.NthDerivativeCoder |
|
| S2PointIndex<Data> |
S2PointIndex maintains an index of points sorted by leaf S2CellId.
|
| S2PointIndex.Entry<Data> |
An S2Iterator-compatible pair of S2Point with associated client data of a given type.
|
| S2PointRegion |
An S2PointRegion is a region that contains a single point.
|
| S2PointVectorCoder |
An encoder/decoder of Lists.
|
| S2PointVectorCoder.Base |
|
| S2PointVectorCoder.ByteArrayOutput |
A thin wrapper over ByteArrayOutputStream which allows the last written byte to be
removed.
|
| S2PointVectorCoder.CellPoint |
Represents a point that can be encoded as an S2CellId center. |
| S2PointVectorCoder.Format |
Controls whether to optimize for speed or size when encoding points.
|
| S2PointVectorCoder.MutableBlockCode |
|
| S2Polygon |
An S2Polygon is an S2Region object that represents a polygon.
|
| S2Polygon.EdgeClipper |
EdgeClipper finds all the intersections of a given edge with the edges contained in an
S2ShapeIndex.
|
| S2Polygon.LoopVertexIndexPair |
|
| S2Polygon.S2LoopSequenceIndex |
|
| S2Polygon.S2PolygonIndex |
|
| S2PolygonBuilder |
This is a simple class for assembling polygons out of edges.
|
| S2PolygonBuilder.Options |
|
| S2PolygonBuilder.Options.Builder |
|
| S2Polyline |
An S2Polyline represents a sequence of zero or more vertices connected by straight edges
(geodesics).
|
| S2Predicates |
A collection of geometric predicates core to the robustness of the S2 library.
|
| S2Predicates.CompareDistance |
A set of tests to compare the distance XY and a previously computed distance.
|
| S2Predicates.CompareDistances |
A set of tests to determine which of two points is closer to a reference point.
|
| S2Predicates.CompareEdgeDirections |
A test to compare whether two edges are closer to proceeding in the same direction or in
opposite directions around the sphere, essentially signum((AxB)x(CxD)).
|
| S2Predicates.CompareEdgeDistance |
A test to compare the distance from point X to edge A with a previously computed distance.
|
| S2Predicates.EdgeCircumcenterSign |
A predicate for whether an edge PQ passes to the left, to the right, or through the center of
the circumcircle of triangle ABC.
|
| S2Predicates.Excluded |
Given two sites A and B that form the center of caps of radius 'r', this indicates which sites
are irrelevant to the Voronoi diagram relative to an edge PQ.
|
| S2Predicates.Sign |
Tests of whether three points represent a left turn (+1), right turn (-1), or neither (0).
|
| S2Predicates.VoronoiSiteExclusion |
A test for which (if any) of two Voronoi sites within R of an edge PQ are covered by the other.
|
| S2Projections |
This class specifies the coordinate systems and transforms used to project points from the sphere
to the unit cube to an S2CellId. |
| S2Projections.FaceSiTi |
A [face, si, ti] position.
|
| S2Projections.UvTransform |
A transform from 3D cartesian coordinates to the 2D coordinates of a face.
|
| S2Projections.XyzTransform |
A transform from 2D cartesian coordinates of a face to 3D directional vectors.
|
| S2Region |
An S2Region represents a two-dimensional region over the unit sphere.
|
| S2RegionCoverer |
An S2RegionCoverer is a class that allows arbitrary regions to be approximated as unions of cells
(S2CellUnion).
|
| S2RegionCoverer.Builder |
|
| S2RegionCoverer.Candidate |
|
| S2RegionCoverer.QueueEntriesComparator |
We define our own comparison function on QueueEntries in order to make the results
deterministic.
|
| S2RegionCoverer.QueueEntry |
|
| S2RegionIntersection |
An S2RegionIntersection represents an intersection of overlapping regions.
|
| S2RegionUnion |
An S2RegionUnion represents a union of possibly overlapping regions.
|
| S2Shape |
S2Shape is an abstract base class that defines a shape.
|
| S2Shape.MutableEdge |
A simple receiver for the endpoints of an edge.
|
| S2Shape.ReferencePoint |
A point with a known containment relationship.
|
| S2ShapeAspect |
|
| S2ShapeAspect.ChainAspect |
A provider of the 'edgeId' ranges for each chain, allowing alternate chain representations.
|
| S2ShapeAspect.ChainAspect.Multi |
A sequence of chains, represented as an array of the first 'edgeId' for each chain.
|
| S2ShapeAspect.ChainAspect.Multi.Array |
An array of S2Point references for multiple chains.
|
| S2ShapeAspect.ChainAspect.Multi.Packed |
Packed coordinates for multiple chains.
|
| S2ShapeAspect.ChainAspect.Multi.Snapped |
Snapped cell centers for multiple chains.
|
| S2ShapeAspect.ChainAspect.Simple |
A single non-empty chain.
|
| S2ShapeAspect.ChainAspect.Simple.Array |
A simple chain of S2Point references.
|
| S2ShapeAspect.ChainAspect.Simple.Packed |
A simple chain of packed coordinates.
|
| S2ShapeAspect.ChainAspect.Simple.Snapped |
A simple chain of packed cell centers.
|
| S2ShapeAspect.EdgeAspect |
A provider of the 'vertexId' for the start and end of each 'edgeId' or 'chainId'/'edgeOffset',
allowing alternate edge/vertex mappings.
|
| S2ShapeAspect.EdgeAspect.Closed |
Chains are closed, that is, there is an implicit edge between the ends of each chain.
|
| S2ShapeAspect.EdgeAspect.Open |
Chains are open, that is, there is no implicit edge between the ends of each chain.
|
| S2ShapeAspect.Mixed |
A full S2Shape that mixes together each aspect.
|
| S2ShapeAspect.TopoAspect |
How world positions are classified as exterior, interior, or on the boundary of the object.
|
| S2ShapeAspect.VertexAspect |
A provider of S2Point given a 'vertexId', allowing alternate storage options.
|
| S2ShapeIndex |
|
| S2ShapeIndex.Cell |
This class contains the set of clipped shapes within a particular index cell, sorted in
increasing order of shape id.
|
| S2ShapeIndex.Cell.BinaryCell |
A specialization of Cell for the case of two clipped shapes.
|
| S2ShapeIndex.Cell.MultiCell |
A specialization of Cell for multiple shapes per cell.
|
| S2ShapeIndex.CellRelation |
The possible relationships between a "target" cell and the cells of the S2ShapeIndex.
|
| S2ShapeIndex.ClippedEdge |
ClippedEdge represents the portion of a FaceEdge that has been clipped to an S2Cell.
|
| S2ShapeIndex.EdgeAllocator |
This class provides temporary storage for new ClippedEdges that are created during indexing.
|
| S2ShapeIndex.FaceEdge |
FaceEdge stores temporary edge data while the index is being updated.
|
| S2ShapeIndex.Options |
Options that affect construction of the S2ShapeIndex.
|
| S2ShapeIndex.RangeIterator |
RangeIterator is a wrapper over CellIterator that is specialized for merging shape indices.
|
| S2ShapeIndex.S2ClippedShape |
S2ClippedShape represents the part of a shape that intersects an S2Cell.
|
| S2ShapeIndex.S2ClippedShape.Contained |
An S2ClippedShape for a shape that completely contains the cell (no edge intersections and
containsCenter is true.)
|
| S2ShapeIndex.S2ClippedShape.EdgeRange |
An S2ClippedShape containing a single range of contiguous edge IDs.
|
| S2ShapeIndex.S2ClippedShape.ManyEdges |
An S2ClippedShape that contains the non-contiguous edges from start to end in
edges.
|
| S2ShapeIndex.S2ClippedShape.OneEdge |
An S2ClippedShape that contains a single edge from a given shape.
|
| S2ShapeIndex.ShardedList<T> |
A more complex append-only RandomAccess List that allocates space in shards of 256 elements
each, avoiding reallocation as the list grows, and avoiding single allocations larger than 2KB.
|
| S2ShapeIndex.SimpleList<T> |
A simple append-only RandomAccess List similar to (but about 10% faster than) ArrayList.
|
| S2ShapeIndexCoder |
|
| S2ShapeIndexCoder.EncodedS2ShapeIndex |
|
| S2ShapeIndexMeasures |
Defines various angle and area measures for S2ShapeIndex objects. |
| S2ShapeIndexRegion |
This class wraps an S2ShapeIndex object with the additional methods needed to implement the
S2Region API, in order to allow S2RegionCoverer to compute S2CellId coverings of arbitrary
collections of geometry.
|
| S2ShapeMeasures |
Defines various angle and area measures for S2Shape objects. |
| S2ShapeMeasures.BiConsumer<T,U> |
A consumer which accepts two arguments.
|
| S2ShapeMeasures.IntFunction<T> |
A function which accepts an int.
|
| S2ShapeMeasures.LoopOrder |
Represents a cyclic ordering of the loop vertices, starting at the index "first" and proceeding
in direction "dir" (either +1 or -1).
|
| S2ShapeMeasures.LoopOrderComparator |
|
| S2ShapeMeasures.MutableDouble |
Wraps a mutable primitive double.
|
| S2ShapeUtil |
Utilities for working with S2Shape.
|
| S2ShapeUtil.AreaCentroidMeasure |
A collector of both combined area and centroid values.
|
| S2ShapeUtil.AreaMeasure |
A collector of the steradian area.
|
| S2ShapeUtil.CentroidMeasure |
A collector of the center of mass.
|
| S2ShapeUtil.IntPredicate |
A filter of indexes.
|
| S2ShapeUtil.S2EdgeVectorShape |
S2EdgeVectorShape is an S2Shape representing a set of unrelated edges.
|
| S2ShapeUtil.TriangleConsumer |
A consumer of triangles.
|
| S2TaggedShapeCoder |
An encoder/decoder of tagged S2Shapes. |
| S2TaggedShapeCoder.Builder |
|
| S2TextFormat |
S2TextFormat contains a collection of functions for converting geometry to and from a human-
readable format.
|
| S2TextFormat.ParseEntry |
|
| UintVectorCoder |
|
| VectorCoder<T> |
An encoder/decoder of Lists.
|