Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 410 Bytes

File metadata and controls

6 lines (5 loc) · 410 Bytes

Hash Array Mapped Trie (HAMT)

A Hash Array Mapped Trie (HAMT) is a High-Performance Data Structure used to Implement Associative Arrays (Maps or Sets). It Combines the Speed of a Hash Table with the Structural Advantages of a Trie (Prefix Tree)