Lib.rs

StashMap

On 64-bit architectures, every entry would require 24 bytes of memory which is needed for quick access, so 4096 entries would usually require ~98KB of memory.

struct DataStructure<'a> {
    data_slots: [Data; 32],
    index: StashMap<&'a str, u8, 4096>, // Efficient O(1) mapping from string keys to indices in the data_slots array
}

The bigger the address space, the less likely it is to encounter collisions (e.g. a call becoming O(2) or O(3) instead of O(1)), but it also consumes more memory.