Lines Matching refs:bits

41 table. Then they contain one or more fixed length `{key}`/`{value}` records of `{R}` bits sorted by
74 stored using only a subset of the bits needed to store a full S2 cell ID.
92 The `{prefix}` is computed by extracting the first `{X}` bits of the S2 cell ID. The `{prefix}` is
102 The `{suffix}`, the final `{Y}` bits of the search S2 cell ID, is used to seek for a record
130 It is important to keep the number of bits used in each suffix table entry to a
187 As with any packed table, each record in the packed table has a fixed width of `{R}` bits. The first
188 `{M}` bits of every record are used to store the (ordered) `{key}`.
190 The `{key}` for an entry contains only the `{suffix}` bits from the `{start S2 cell ID
194 The remaining (`{R-M}`) bits are used to store the ``{value}``. The ``{value}`` is further
202 bits from the S2 cell ID can be extracted. Since all data in the table is held at a single S2 level,
203 the suffix bits can be used to binary search the suffix table entries by looking for an entry
204 containing the suffix bits, i.e. by comparing the suffix bits against the `{key}` and `{key}` +