{"repository":{"has_downloads":true,"has_issues":true,"created_at":"2010/06/11 17:31:25 -0700","forks":3,"description":"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.","has_wiki":true,"fork":false,"homepage":"http://www.nedprod.com/programs/portable/nedtries/","size":148,"private":false,"open_issues":3,"watchers":96,"owner":"ned14","pushed_at":"2012/03/13 04:35:28 -0700","language":"C++"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/ned14/nedtries/issues/5#issuecomment-4481507"}