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 in Free Credit Towards Top Cloud Services Icon
$300 in Free Credit Towards Top Cloud Services

Build VMs, containers, AI, databases, storage—all in one place.

Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
Get Started
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