Click here to Skip to main content
15,799,019 members
Articles / Programming Languages / C++

A New Implementation for a Fast Hash Table

Rate me:
Please Sign up or sign in to vote.
5.00/5 (3 votes)
2 Aug 2020MIT9 min read 11K   195   11  
A merge of ordered array and hash table
A data structure that looks like an ordered array and behaves like a hash table. Any value can be accessed by its index or by its name. It preserves the elements' order and uses two memory blocks. Therefore, it has an initial size, and collisions do not cause new allocations. When resized, it drops deleted items and resets its hash base.


Daily Counts


Weekly Counts


This article, along with any associated source code and files, is licensed under The MIT License

Comments and Discussions