nedtries
Description
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.
Categories
License
Update Notifications
User Ratings
User Reviews
Be the first to post a review of nedtries!