okdo / nedtries Goto Github PK
View Code? Open in Web Editor NEWThis project forked from 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.
Home Page: http://www.nedprod.com/programs/portable/nedtries/