Illustration drawn by RepoMasters from the repo’s ID and its language color. Credits
AlphaUncommon

ned14/nedtries

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

Archived: this repository is read-only

Owner
ned14 (personal account)
Stars
Stars: 276
Forks
Forks: 18
Language
C++
License
None
Created
2010
Tier
Alpha (250 to 699 ★) What this tier means
View on GitHub

More repos by ned14

All 6 repos by ned14

Nearby in C++

All C++ repos