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
Stop vibe-debugging. Icon
Stop vibe-debugging.

Plug Claude into your app's actual errors.

AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
Free 30 days.
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