Apr 19, 2024

Our custom hashmap allows iteration over duplicates. Any hash table must implement conflict lists for a given hash bucket. Our average list length is configured for ~1.5 conflicts. If a duplicate entry is created it naturally hides older entries (this is how we implement logical delete for reorg and progressive state changes during validation). However our primitives allow enumeration of the conflict list, so that any hash table can also be treated as a multimap. A simple iterator hides (steps over) non-matching conflicts, making the enumeration seamless.