Note
Access to this page requires authorization. You can try signing in or changing directories.
Access to this page requires authorization. You can try changing directories.
This section describes a conceptual model of possible data organization that an implementation maintains in order to use this algorithm. The described organization is provided to facilitate the explanation of how the algorithm behaves. This document does not mandate that implementations adhere to this model as long as their external behavior is consistent with what is described in this document.
H3 Lookup Table: A table containing 256 entries of 32-bit, unsigned integers used in computing the H3 hash function. The entries to the table are indexed from 0 through 255. This table is constant (that is, the values in this table do not change during the execution of RDC).