Projects / nedtries

nedtries

nedtries is a portable in-place bitwise binary Fredkin trie algorithm that allows for near constant time insertions, deletions, finds, closest fit finds, and iteration. It is approximately 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables. It provides implementations as C macros, C++ templates, and as a C++ STL compatible associative container.

Tags
Licenses
Operating Systems
Implementation

Recent releases

  •  09 Jul 2012 20:30

    Release Notes: This release fixes three major bugs since 1.01 RC1: the STL iterators were improperly implemented, there was memory corruption on 64 bit C++ STL container emulation usage, and "nearest find" did a close find, not a nearest find.

    •  19 Jun 2011 18:13

      Release Notes: Almost entirely very small bugfixes, documentation fixes, and benchmarking fixes. nedtries works very well for many people.

      •  18 Jun 2010 21:35

        Release Notes: First release.

        Screenshot

        Project Spotlight

        OpenStack4j

        A Fluent OpenStack client API for Java.

        Screenshot

        Project Spotlight

        TurnKey TWiki Appliance

        A TWiki appliance that is easy to use and lightweight.