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 >

Categories

Algorithms, Admin Templates

License

Boost Software License (BSL1.0)

Follow nedtries

nedtries Web Site

Other Useful Business Software
Build Securely on Azure with Proven Frameworks Icon
Build Securely on Azure with Proven Frameworks

Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
Download Now
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
Report inappropriate content