Skip to content

WillKirkmanM/hash-array-mapped-trie

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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)

About

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)

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages