Lines Matching full:buckets
775 Typical hash tables have a header, buckets, and each bucket points to the
783 | BUCKETS |
788 The BUCKETS are an array of offsets to DATA for each hash:
793 | 0x00001000 | BUCKETS[0]
794 | 0x00002000 | BUCKETS[1]
795 | 0x00002200 | BUCKETS[2]
796 | 0x000034f0 | BUCKETS[3]
798 | 0xXXXXXXXX | BUCKETS[n_buckets]
839 differently: a header, buckets, an array of all unique 32 bit hash values,
848 | BUCKETS |
857 The ``BUCKETS`` in the name tables are an index into the ``HASHES`` array. By
862 table with "``n_buckets``" buckets, and "``n_hashes``" unique 32 bit hash
863 values, we can clarify the contents of the ``BUCKETS``, ``HASHES`` and
877 | BUCKETS | uint32_t[n_buckets] // 32 bit hash indexes
894 | 0 | BUCKETS[0]
895 | 2 | BUCKETS[1]
896 | 5 | BUCKETS[2]
897 | 6 | BUCKETS[3]
899 | ... | BUCKETS[n_buckets]
907 | 0x12345678 | HASHES[6] hash for BUCKETS[3]
908 | 0x29273623 | HASHES[7] hash for BUCKETS[3]
909 | 0x82638293 | HASHES[8] hash for BUCKETS[3]
923 | 0x000034f0 | OFFSETS[6] offset for BUCKETS[3]
924 | 0x00003500 | OFFSETS[7] offset for BUCKETS[3]
925 | 0x00003550 | OFFSETS[8] offset for BUCKETS[3]
974 would hash "``printf``" and find it matches ``BUCKETS[3]`` by taking the 32 bit
975 hash value and modulo it by ``n_buckets``. ``BUCKETS[3]`` contains "6" which
978 ``BUCKETS[3]``. We do this by verifying that each subsequent hash value modulo
980 memory for ``BUCKETS[3]``, and then compare a few consecutive 32 bit hashes
990 Empty buckets are designated by using an invalid hash index of ``UINT32_MAX``.
1013 uint32_t bucket_count; // The number of buckets in this hash table
1015 uint32_t header_data_len; // The bytes to skip to get to the hash indexes (buckets) for correct alignment
1037 ``bucket_count`` is a 32 bit unsigned integer that represents how many buckets
1038 are in the ``BUCKETS`` array. ``hashes_count`` is the number of unique 32 bit
1047 The header is followed by the buckets, hashes, offsets, and hash value data.
1053 uint32_t buckets[Header.bucket_count]; // An array of hash indexes into the "hashes[]" array below
1058 ``buckets`` is an array of 32 bit indexes into the ``hashes`` array. The
