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.

Project Activity

See All Activity >

License

Boost Software License (BSL1.0)

Follow nedtries

nedtries Web Site

Other Useful Business Software
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Try Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of nedtries!

Additional Project Details

Intended Audience

Developers

Programming Language

C, C++

Related Categories

C++ Algorithms, C++ Admin Templates, C Algorithms, C Admin Templates

Registered

2010-05-25