Project Description RSS Review this project

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.

Download

windows Windows nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)
mac Mac nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)
linux Linux nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)
bsd BSD nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)
solaris Solaris nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)

Review
Your rating
Review this project