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
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start 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