Class S2CellId
- All Implemented Interfaces:
Serializable
,Comparable<S2CellId>
id = [face][face_pos]
face: a 3-bit number (range 0..5) encoding the cube face.
face_pos: a 61-bit number encoding the position of the center of this cell along the Hilbert curve over this face (see the Wiki pages for details).
Sequentially increasing cell ids follow a continuous space-filling curve over the entire sphere. They have the following properties:
- The id of a cell at level k consists of a 3-bit face number followed by k bit pairs that recursively select one of the four children of each cell. The next bit is always 1, and all other bits are 0. Therefore, the level of a cell is determined by the position of its lowest-numbered bit that is turned on (for a cell at level k, this position is 2 * (MAX_LEVEL - k).)
- The id of a parent cell is at the midpoint of the range of ids spanned by its children (or by its descendants at any level).
Leaf cells are often used to represent points on the unit sphere, and this class provides methods for converting directly between these two representations. For cells that represent 2D regions rather than discrete point, it is better to use the S2Cell class.
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionstatic final int
static final S2CellId[]
private static final int
private final long
The id of the cell.private static final double
The change in ST coordinates for each unit change in IJ coordinates.private static final int
private static final long
private static final int
private static final int
private static final int[]
private static final int
private static final int[]
private static final com.google.common.base.CharMatcher
Matches literal '0' characters.static final int
static final int
static final long
private static final S2CellId
static final int
private static final long
static final int
private static final S2CellId
private static final int
private static final int
private static final long
private static final long
This is the offset required to wrap around from the beginning of the Hilbert curve to the end or vice versa; see nextWrap() and prevWrap(). -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionadvance
(long steps) This method advances or retreats the indicated number of steps along the Hilbert curve at the current level, and returns the new position.advanceWrap
(long steps) This method advances or retreats the indicated number of steps along the Hilbert curve at the current level, and returns the new position.static S2CellId
begin
(int level) Returns the first cell in an ordered traversal along the Hilbert curve at a given level (across all 6 faces of the cube).child
(int position) Returns the immediate child of this cell at the given traversal order position (in the range 0 to 3).Returns the first child in a traversal of the children of this cell, in Hilbert curve order.childBegin
(int level) Returns the first cell in a traversal of children a given level deeper than this cell, in Hilbert curve order.private static long
childBeginAsLong
(long id) private static long
childBeginAsLong
(long id, int level) childEnd()
Returns the first cell after a traversal of the children of this cell in Hilbert curve order.childEnd
(int level) Returns the first cell after the last child in a traversal of children a given level deeper than this cell, in Hilbert curve order.private static long
childEndAsLong
(long id) private static long
childEndAsLong
(long id, int level) int
childPosition
(int level) Return the child position (0..3) of this cell's ancestor at the given level, relative to its parent.children()
childrenAtLevel
(int level) int
boolean
Return true if the given cell is contained within this one.static S2CellId
end
(int level) Returns the first cell after an ordered traversal along the Hilbert curve at a given level (across all 6 faces of the cube).boolean
int
face()
Which cube face this cell belongs to, in the range 0..5.(package private) static S2CellId
fromDebugString
(String str) Returns a cell id decoded from a simple debug format.static S2CellId
fromFace
(int face) Returns the cell corresponding to a given S2 cube face.private static long
fromFaceAsLong
(int face) static S2CellId
fromFaceIJ
(int face, int i, int j) Return a leaf cell given its cube face (range 0..5) and i- and j-coordinates (see s2.h).static S2CellId
fromFaceIJSame
(int face, int i, int j, boolean sameFace) Public helper function that calls FromFaceIJ if sameFace is true, or FromFaceIJWrap if sameFace is false.private static S2CellId
fromFaceIJWrap
(int face, int i, int j) Given a face and a point (i,j) where either i or j is outside the valid range [0..MAX_SIZE-1], this function first determines which neighboring face "contains" (i,j), and then returns the leaf cell on that face which is adjacent to the given face and whose distance from (i,j) is minimal.static S2CellId
fromFacePosLevel
(int face, long pos, int level) Returns a cell given its face (range 0..5), Hilbert curve position within that face (an unsigned integer withPOS_BITS
bits), and level (range 0..MAX_LEVEL).private static long
fromFacePosLevelAsLong
(int face, long pos, int level) static S2CellId
fromLatLng
(S2LatLng ll) Return the leaf cell containing the given S2LatLng.static S2CellId
Return the leaf cell containing the given point (a direction vector, not necessarily unit length).static S2CellId
Decodes the cell id from a compact text string suitable for display or indexing.private static S2CellId
fromTokenImpl
(String token, boolean implicitZeroes) Returns the cell id for the given token, which will be implicitly zero-right-padded to length 16 if 'implicitZeroes' is true.void
getAllNeighbors
(int nbrLevel, List<S2CellId> output) Append all neighbors of this cell at the given level to "output".Returns the bounds of this cell in (s,t)-space.Returns the bounds of this cell in (u,v)-space.(package private) long
Returns the (si, ti) coordinates of the center of the cell.Returns the center of the cell in (s,t) coordinates.Returns the center of the cell in (u,v) coordinates.int
getCommonAncestorLevel
(S2CellId other) Returns the level of the "lowest common ancestor" of this cell and "other".void
getEdgeNeighbors
(S2CellId[] neighbors) Return the four cells that are adjacent across the cell's four edges.int
getI()
Returns the "i" coordinate of this S2 cell ID.(package private) static int
getI
(long ijo) Returns the "i" coordinate from bits 33-63 in the givenijo
primitive long returned bytoIJOrientation()
.int
getJ()
Returns the "j" coordinate of this S2 cell ID.(package private) static int
getJ
(long ijo) Returns the "j" coordinate from bits 2-32 in the givenijo
primitive long returned bytoIJOrientation()
.int
Returns the orientation of this S2 cell ID.(package private) static int
getOrientation
(long ijo) Returns the orientation from bits 0-1 in the givenijo
primitive long returned bytoIJOrientation()
.(package private) static int
getSi
(long center) Returns the "si" coordinate from bits 32-63 in the givencenter
primitive long returned bygetCenterSiTi()
.int
AsgetSizeIJ(int)
, using the level of this cell.static int
getSizeIJ
(int level) Returns the edge length of cells at the given level in (i,j)-space.double
AsgetSizeST(int)
, using the level of this cell.static double
getSizeST
(int level) Returns the edge length of cells at the given level in (s,t)-space.(package private) static int
getTi
(long center) Returns the "ti" coordinate from bits 0-31 in the givencenter
primitive long returned bygetCenterSiTi()
.void
getVertexNeighbors
(int level, Collection<S2CellId> output) Return the neighbors of closest vertex to this cell at the given level, by appending them to "output".boolean
boolean
int
hashCode()
long
id()
The 64-bit unique identifier for this cell.(package private) static R2Rect
ijLevelToBoundUv
(int i, int j, int level) Returns the bound in (u,v)-space for the cell at the given level containing the leaf cell with the given (i,j)-coordinates.private static void
initLookupCell
(int level, int i, int j, int origOrientation, int pos, int orientation) boolean
intersects
(S2CellId other) Return true if the given cell intersects this one.boolean
isFace()
Return true if this is a top-level face cell (more efficient than checking whether level() == 0).boolean
isLeaf()
Return true if this is a leaf cell (more efficient than checking whether level() == MAX_LEVEL).boolean
isValid()
Return true if id() represents a valid cell.boolean
boolean
int
level()
Return the subdivision level of the cell (range 0..MAX_LEVEL).private static final int
lookupBits
(int i, int j, int k, int bits) long
Returns the lowest-numbered bit that is on for this cell id, which is equal to1L << (2 * (MAX_LEVEL - level))
.private static long
lowestOnBit
(long id) static long
lowestOnBitForLevel
(int level) Return the lowest-numbered bit that is on for cells at the given level.private static final int
maskBits
(int bits) next()
Return the next cell at the same level along the Hilbert curve.nextWrap()
Like next(), but wraps around from the last face to the first and vice versa.static S2CellId
none()
The default constructor returns an invalid cell id.parent()
parent
(int level) Return the cell at the previous level or at the given level (which must be less than or equal to the current level).private static long
parentAsLong
(long id) private static long
parentAsLong
(long id, int level) long
pos()
The position of the cell center along the Hilbert curve over this face, in the range 0..(2**kPosBits-1).prev()
Return the previous cell at the same level along the Hilbert curve.prevWrap()
Like prev(), but wraps around from the last face to the first and vice versa.rangeMax()
Returns the end of the range of cell ids that are contained within this cell (including itself.) The range is *inclusive* (i.e.private static long
rangeMaxAsLong
(long id) rangeMin()
Returns the start of the range of cell ids that are contained within this cell (including itself.) The range is *inclusive* (i.e.private static long
rangeMinAsLong
(long id) static S2CellId
sentinel()
Returns an invalid cell id guaranteed to be larger than any valid cell id.private static void
setAxisRange
(int ij, int cellSize, R1Interval interval) (package private) long
Returns the (i, j) coordinates for the leaf cell corresponding to this cell id, and the orientation the i- and j-axes follow at that level.toLatLng()
Return the S2LatLng corresponding to the center of the given cell.toLoop
(int level) Returns a loop along the boundary of this cell, with vertices at intersections with the cell grid atlevel
.toPoint()
Return the direction vector corresponding to the center of the given cell.toString()
toToken()
Encodes the cell id to compact text strings suitable for display or indexing.static boolean
unsignedLongGreaterOrEquals
(long x1, long x2) Returns true if x1 >= x2, when both values are treated as unsigned.static boolean
unsignedLongGreaterThan
(long x1, long x2) Returns true if x1 > x2, when both values are treated as unsigned.static boolean
unsignedLongLessOrEquals
(long x1, long x2) Returns true if x1 invalid input: '<'= x2, when both values are treated as unsigned.static boolean
unsignedLongLessThan
(long x1, long x2) Returns true if x1 invalid input: '<' x2, when both values are treated as unsigned.private static final long
updateBits
(long sb, int k, int bits)
-
Field Details
-
FACE_BITS
public static final int FACE_BITS- See Also:
-
NUM_FACES
public static final int NUM_FACES- See Also:
-
MAX_LEVEL
public static final int MAX_LEVEL- See Also:
-
POS_BITS
public static final int POS_BITS- See Also:
-
MAX_SIZE
public static final int MAX_SIZE- See Also:
-
IJ_TO_ST
private static final double IJ_TO_STThe change in ST coordinates for each unit change in IJ coordinates.- See Also:
-
MAX_UNSIGNED
public static final long MAX_UNSIGNED- See Also:
-
I_SHIFT
private static final int I_SHIFT- See Also:
-
J_SHIFT
private static final int J_SHIFT- See Also:
-
J_MASK
private static final long J_MASK- See Also:
-
ORIENTATION_MASK
private static final long ORIENTATION_MASK- See Also:
-
SI_SHIFT
private static final int SI_SHIFT- See Also:
-
TI_MASK
private static final long TI_MASK- See Also:
-
LOOKUP_BITS
private static final int LOOKUP_BITS- See Also:
-
SWAP_MASK
private static final int SWAP_MASK- See Also:
-
INVERT_MASK
private static final int INVERT_MASK- See Also:
-
LOOKUP_MASK
private static final int LOOKUP_MASK- See Also:
-
LOOKUP_POS
private static final int[] LOOKUP_POS -
LOOKUP_IJ
private static final int[] LOOKUP_IJ -
NONE
-
SENTINEL
-
WRAP_OFFSET
private static final long WRAP_OFFSETThis is the offset required to wrap around from the beginning of the Hilbert curve to the end or vice versa; see nextWrap() and prevWrap().- See Also:
-
FACE_CELLS
-
id
private final long idThe id of the cell. -
MATCHES_ZERO
private static final com.google.common.base.CharMatcher MATCHES_ZEROMatches literal '0' characters.
-
-
Constructor Details
-
S2CellId
public S2CellId(long id) -
S2CellId
public S2CellId()
-
-
Method Details
-
none
The default constructor returns an invalid cell id. -
sentinel
Returns an invalid cell id guaranteed to be larger than any valid cell id. Useful for creating indexes. -
fromFace
Returns the cell corresponding to a given S2 cube face. -
fromFacePosLevel
Returns a cell given its face (range 0..5), Hilbert curve position within that face (an unsigned integer withPOS_BITS
bits), and level (range 0..MAX_LEVEL). The given position will be modified to correspond to the Hilbert curve position at the center of the returned cell. This is a static function rather than a constructor in order to indicate what the arguments represent. -
fromPoint
Return the leaf cell containing the given point (a direction vector, not necessarily unit length). -
fromLatLng
Return the leaf cell containing the given S2LatLng. -
getCenterUV
Returns the center of the cell in (u,v) coordinates. Note that the center of the cell is defined as the point at which it is recursively subdivided into four children; in general, it is not at the midpoint of the (u,v) rectangle covered by the cell. -
getCenterST
Returns the center of the cell in (s,t) coordinates. -
getBoundST
Returns the bounds of this cell in (s,t)-space. -
getBoundUV
Returns the bounds of this cell in (u,v)-space. -
toPoint
-
toPointRaw
Return the direction vector corresponding to the center of the given cell. The vector returned by toPointRaw is not necessarily unit length. -
toLoop
Returns a loop along the boundary of this cell, with vertices at intersections with the cell grid atlevel
. Equivalent to the union of new S2Polygon(new S2Cell(child)), for each child inchildrenAtLevel(int)
for the given level, but radically faster. -
getCenterSiTi
long getCenterSiTi()Returns the (si, ti) coordinates of the center of the cell. The returned long packs the values into one long, such that bits 32-63 contain si, and bits 0-31 contain ti.Note that although (si, ti) coordinates span the range [0,2**31] in general, the cell center coordinates are always in the range [1,2**31-1] and therefore can be represented using a signed 32-bit integer.
Use
getSi(long)
andgetTi(long)
to extract integer values for si and ti, respectively. -
getSi
static int getSi(long center) Returns the "si" coordinate from bits 32-63 in the givencenter
primitive long returned bygetCenterSiTi()
. -
getTi
static int getTi(long center) Returns the "ti" coordinate from bits 0-31 in the givencenter
primitive long returned bygetCenterSiTi()
. -
toLatLng
Return the S2LatLng corresponding to the center of the given cell. -
id
public long id()The 64-bit unique identifier for this cell. -
isValid
public boolean isValid()Return true if id() represents a valid cell. -
face
public int face()Which cube face this cell belongs to, in the range 0..5. -
pos
public long pos()The position of the cell center along the Hilbert curve over this face, in the range 0..(2**kPosBits-1). -
level
public int level()Return the subdivision level of the cell (range 0..MAX_LEVEL). -
getSizeIJ
public int getSizeIJ()AsgetSizeIJ(int)
, using the level of this cell. -
getSizeST
public double getSizeST()AsgetSizeST(int)
, using the level of this cell. -
getSizeIJ
public static int getSizeIJ(int level) Returns the edge length of cells at the given level in (i,j)-space. -
getSizeST
public static double getSizeST(int level) Returns the edge length of cells at the given level in (s,t)-space. -
isLeaf
public boolean isLeaf()Return true if this is a leaf cell (more efficient than checking whether level() == MAX_LEVEL). -
isFace
public boolean isFace()Return true if this is a top-level face cell (more efficient than checking whether level() == 0). -
childPosition
public int childPosition(int level) Return the child position (0..3) of this cell's ancestor at the given level, relative to its parent. The argument should be in the range 1..MAX_LEVEL. For example, childPosition(1) returns the position of this cell's level-1 ancestor within its top-level face cell. -
rangeMin
Returns the start of the range of cell ids that are contained within this cell (including itself.) The range is *inclusive* (i.e. test using >= and invalid input: '<'=) and the return values of both this method andrangeMax()
are valid leaf cell ids. -
rangeMax
Returns the end of the range of cell ids that are contained within this cell (including itself.) The range is *inclusive* (i.e. test using >= and invalid input: '<'=) and the return values of both this method andrangeMin()
are valid leaf cell ids.Note that because the range max is inclusive, care should be taken to iterate accordingly, for example:
for (S2CellId min = x.rangeMin(); min.compareTo(x.rangeMax()) invalid input: '<'= 0; min = min.next()) {...}
If you need to convert the range to a semi-open interval [min, limit), for example to use a key-value store that only supports semi-open range queries, then do not attempt to define "limit" as rangeMax.next(). The problem is that leaf S2CellIds are 2 units apart, so the semi-open interval [min, limit) includes an additional value (rangeMax.id() + 1) which happens to be a valid S2CellId about one-third of the time and is never contained by this cell. (It always corresponds to a cell ID larger than this ID). You can define "limit" asrangeMax.id() + 1
if necessary; this is not always a valid S2CellId but can still be used with fromToken/toToken. You may also convert rangeMax() to the key space of your key- value store and define "limit" as the next larger key.Note that sentinel().rangeMin(), sentinel.rangeMax(), and sentinel() are all equal.
- See Also:
-
contains
Return true if the given cell is contained within this one. -
intersects
Return true if the given cell intersects this one. -
parent
-
parent
Return the cell at the previous level or at the given level (which must be less than or equal to the current level). -
child
Returns the immediate child of this cell at the given traversal order position (in the range 0 to 3). Results are undefined if this is a leaf cell. -
children
-
childrenAtLevel
-
childBegin
Returns the first child in a traversal of the children of this cell, in Hilbert curve order. -
childBegin
Returns the first cell in a traversal of children a given level deeper than this cell, in Hilbert curve order. Requires that the given level be greater or equal to this cell level. -
childEnd
Returns the first cell after a traversal of the children of this cell in Hilbert curve order. This cell can be invalid. -
childEnd
Returns the first cell after the last child in a traversal of children a given level deeper than this cell, in Hilbert curve order. This cell can be invalid. -
next
Return the next cell at the same level along the Hilbert curve. Works correctly when advancing from one face to the next, but does *not* wrap around from the last face to the first or vice versa. -
prev
Return the previous cell at the same level along the Hilbert curve. Works correctly when advancing from one face to the next, but does *not* wrap around from the last face to the first or vice versa. -
nextWrap
Like next(), but wraps around from the last face to the first and vice versa. Should *not* be used for iteration in conjunction with childBegin(), childEnd(), Begin(), or End(). -
prevWrap
Like prev(), but wraps around from the last face to the first and vice versa. Should *not* be used for iteration in conjunction with childBegin(), childEnd(), Begin(), or End(). -
begin
Returns the first cell in an ordered traversal along the Hilbert curve at a given level (across all 6 faces of the cube). -
end
Returns the first cell after an ordered traversal along the Hilbert curve at a given level (across all 6 faces of the cube). The end value is exclusive, and is not a valid cell id. -
advance
This method advances or retreats the indicated number of steps along the Hilbert curve at the current level, and returns the new position. The position never advances pastend(int)
or beforebegin(int)
, and remains at the current level. -
advanceWrap
This method advances or retreats the indicated number of steps along the Hilbert curve at the current level, and returns the new position. The position wraps between the first and last faces as necessary. The input must be a valid cell id. -
getCommonAncestorLevel
Returns the level of the "lowest common ancestor" of this cell and "other". Note that because of the way that cell levels are numbered, this is actually the *highest* level of any shared ancestor. Returns -1 if the two cells do not have any common ancestor (i.e., they are from different faces). -
fromToken
Decodes the cell id from a compact text string suitable for display or indexing. Cells at lower levels (i.e. larger cells) are encoded into fewer characters. The maximum token length is 16.- Parameters:
token
- the token to decode- Returns:
- the S2CellId for that token
- Throws:
NumberFormatException
- if the token is not formatted correctly
-
fromTokenImpl
Returns the cell id for the given token, which will be implicitly zero-right-padded to length 16 if 'implicitZeroes' is true. -
toToken
Encodes the cell id to compact text strings suitable for display or indexing. Cells at lower levels (i.e. larger cells) are encoded into fewer characters. The maximum token length is 16.Simple implementation: convert the id to hex and strip trailing zeros. We could use base-32 or base-64, but assuming the cells used for indexing regions are at least 100 meters across (level 16 or less), the savings would be at most 3 bytes (9 bytes hex vs. 6 bytes base-64).
- Returns:
- the encoded cell id
-
toTokenOld
-
getEdgeNeighbors
Return the four cells that are adjacent across the cell's four edges. Neighbors are returned in the order defined by S2Cell::GetEdge. All neighbors are guaranteed to be distinct.Requires that this cell is valid.
-
getVertexNeighbors
Return the neighbors of closest vertex to this cell at the given level, by appending them to "output". Normally there are four neighbors, but the closest vertex may only have three neighbors if it is one of the 8 cube vertices.Requires that level invalid input: '<' this.level(), so that we can determine which vertex is closest (in particular, level == MAX_LEVEL is not allowed). Also requires that this cell is valid.
-
getAllNeighbors
Append all neighbors of this cell at the given level to "output". Two cells X and Y are neighbors if their boundaries intersect but their interiors do not. In particular, two cells that intersect at a single point are neighbors.Requires that nbrLevel >= this->level(). Note that for cells adjacent to a face vertex, the same neighbor may be appended more than once. Also requires that this cell is valid.
-
fromFaceIJ
Return a leaf cell given its cube face (range 0..5) and i- and j-coordinates (see s2.h). -
lookupBits
private static final int lookupBits(int i, int j, int k, int bits) -
updateBits
private static final long updateBits(long sb, int k, int bits) -
maskBits
private static final int maskBits(int bits) -
toIJOrientation
long toIJOrientation()Returns the (i, j) coordinates for the leaf cell corresponding to this cell id, and the orientation the i- and j-axes follow at that level. The returned long packs the values into one long, such that bits 33-63 contain i, bits 2-32 contain j, and bits 0-1 contain the orientation.Since cells are represented by the Hilbert curve position at the center of the cell, the returned (i, j) for non-leaf cells will be a leaf cell adjacent to the cell center.
Use
getI(long)
,getJ(long)
, andgetOrientation(long)
to extract integer values for i, j, and orientation, respectively. -
getI
public int getI()Returns the "i" coordinate of this S2 cell ID. -
getI
static int getI(long ijo) Returns the "i" coordinate from bits 33-63 in the givenijo
primitive long returned bytoIJOrientation()
. -
getJ
public int getJ()Returns the "j" coordinate of this S2 cell ID. -
getJ
static int getJ(long ijo) Returns the "j" coordinate from bits 2-32 in the givenijo
primitive long returned bytoIJOrientation()
. -
getOrientation
public int getOrientation()Returns the orientation of this S2 cell ID. -
getOrientation
static int getOrientation(long ijo) Returns the orientation from bits 0-1 in the givenijo
primitive long returned bytoIJOrientation()
. -
lowestOnBit
public long lowestOnBit()Returns the lowest-numbered bit that is on for this cell id, which is equal to1L << (2 * (MAX_LEVEL - level))
. So for example, a.lsb() invalid input: '<'= b.lsb() if and only if a.level() >= b.level(), but the first test is more efficient. -
lowestOnBitForLevel
public static long lowestOnBitForLevel(int level) Return the lowest-numbered bit that is on for cells at the given level. -
ijLevelToBoundUv
Returns the bound in (u,v)-space for the cell at the given level containing the leaf cell with the given (i,j)-coordinates. -
setAxisRange
-
fromFaceIJWrap
Given a face and a point (i,j) where either i or j is outside the valid range [0..MAX_SIZE-1], this function first determines which neighboring face "contains" (i,j), and then returns the leaf cell on that face which is adjacent to the given face and whose distance from (i,j) is minimal. -
fromFaceIJSame
Public helper function that calls FromFaceIJ if sameFace is true, or FromFaceIJWrap if sameFace is false. -
equals
-
unsignedLongLessThan
public static boolean unsignedLongLessThan(long x1, long x2) Returns true if x1 invalid input: '<' x2, when both values are treated as unsigned. -
unsignedLongLessOrEquals
public static boolean unsignedLongLessOrEquals(long x1, long x2) Returns true if x1 invalid input: '<'= x2, when both values are treated as unsigned. -
unsignedLongGreaterThan
public static boolean unsignedLongGreaterThan(long x1, long x2) Returns true if x1 > x2, when both values are treated as unsigned. -
unsignedLongGreaterOrEquals
public static boolean unsignedLongGreaterOrEquals(long x1, long x2) Returns true if x1 >= x2, when both values are treated as unsigned. -
lessThan
-
greaterThan
-
lessOrEquals
-
greaterOrEquals
-
hashCode
public int hashCode() -
toString
-
initLookupCell
private static void initLookupCell(int level, int i, int j, int origOrientation, int pos, int orientation) -
compareTo
- Specified by:
compareTo
in interfaceComparable<S2CellId>
-
fromFaceAsLong
private static long fromFaceAsLong(int face) -
childBeginAsLong
private static long childBeginAsLong(long id) -
childBeginAsLong
private static long childBeginAsLong(long id, int level) -
childEndAsLong
private static long childEndAsLong(long id) -
childEndAsLong
private static long childEndAsLong(long id, int level) -
rangeMinAsLong
private static long rangeMinAsLong(long id) -
rangeMaxAsLong
private static long rangeMaxAsLong(long id) -
lowestOnBit
private static long lowestOnBit(long id) -
parentAsLong
private static long parentAsLong(long id) -
parentAsLong
private static long parentAsLong(long id, int level) -
fromFacePosLevelAsLong
private static long fromFacePosLevelAsLong(int face, long pos, int level) -
fromDebugString
Returns a cell id decoded from a simple debug format. This function is reasonably efficient, but is only intended for use in tests; no promises are made about the durability of the encoding over time.
-