5.3. Flat hash table

The FLAT_HASH_TABLE module implements a flat (open addressing) hash table. It stores all entries in a single contiguous array, providing cache-friendly access patterns and good performance for small to medium-sized tables.

All functions and symbols are in “flat_hash_table” module, use require to get access to it.

require daslib/flat_hash_table

Example:

require daslib/flat_hash_table public

    typedef IntMap = TFlatHashTable<int; string>

    [export]
    def main() {
        var m <- IntMap()
        m[1] = "one"
        m[2] = "two"
        m[3] = "three"
        print("length = {m.data_length}\n")
        print("m[2] = {m[2]}\n")
        m.clear()
        print("after clear: {m.data_length}\n")
    }
    // output:
    // length = 3
    // m[2] = two
    // after clear: 0

5.3.1. Type macros

flat_hash_table.type macro TFlatHashTable

Arguments:

• ValueType (Type)

• hashFunctionName (String = “hash”)