Pinned Repositories
cpp-btree
Modern C++ B-tree containers
linux
Linux kernel source tree
nedtries
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.
boost_unordered
Standalone version of the boost::unordered library
jmbnyc's Repositories
jmbnyc/cpp-btree
Modern C++ B-tree containers
jmbnyc/linux
Linux kernel source tree
jmbnyc/nedtries
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.