| Constructor and Description |
|---|
S2LatLngRect(R1Interval lat,
S1Interval lng) |
S2LatLngRect(S2LatLng lo,
S2LatLng hi) |
public S2LatLngRect(R1Interval lat, S1Interval lng)
public static S2LatLngRect empty()
public static S2LatLngRect full()
public static R1Interval fullLat()
public static S1Interval fullLng()
public static S2LatLngRect fromCenterSize(S2LatLng center, S2LatLng size)
public static S2LatLngRect fromPoint(S2LatLng p)
public static S2LatLngRect fromPointPair(S2LatLng p1, S2LatLng p2)
public static S2LatLngRect fromEdge(S2Point a, S2Point b)
public boolean isValid()
public S1Angle latLo()
public S1Angle latHi()
public S1Angle lngLo()
public S1Angle lngHi()
public R1Interval lat()
public S1Interval lng()
public S2LatLng lo()
public S2LatLng hi()
public boolean isEmpty()
public boolean isFull()
public boolean isInverted()
public S2LatLng getVertex(int k)
public S2LatLng getCenter()
public S1Angle getDistance(S2LatLngRect other)
public S2LatLng getSize()
public boolean contains(S2LatLng ll)
public boolean interiorContains(S2Point p)
public boolean interiorContains(S2LatLng ll)
public boolean contains(S2LatLngRect other)
public boolean interiorContains(S2LatLngRect other)
public boolean intersects(S2LatLngRect other)
public boolean intersects(S2Cell cell)
public boolean interiorIntersects(S2LatLngRect other)
public S2LatLngRect addPoint(S2Point p)
public S2LatLngRect addPoint(S2LatLng ll)
public S2LatLngRect expanded(S2LatLng margin)
public S2LatLngRect union(S2LatLngRect other)
public S2LatLngRect intersection(S2LatLngRect other)
public S2LatLngRect convolveWithCap(S1Angle angle)
public double area()
public boolean equals(Object that)
public boolean approxEquals(S2LatLngRect other, double maxError)
public boolean approxEquals(S2LatLngRect other)
public int hashCode()
public S2Region clone()
public S2Cap getCapBound()
public S2LatLngRect getRectBound()
public boolean contains(S2Cell cell)
public boolean mayIntersect(S2Cell cell)
public boolean contains(S2Point p)
public String toString()
Copyright © 2017. All rights reserved.