{"repository":{"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.","owner":"ned14","has_downloads":true,"created_at":"2010-06-11T17:31:25-07:00","watchers":108,"stargazers":108,"has_issues":true,"has_wiki":true,"pushed_at":"2012-08-27T09:16:23-07:00","forks":2,"fork":false,"size":148,"open_issues":2,"homepage":"http://www.nedprod.com/programs/portable/nedtries/","private":false,"language":"C"},"actor_attributes":{"company":"University of California, Berkeley","email":"248ab303ce4621a021774f9b0c59b076bcd0c2b9@icir.org","name":"Matthias Vallentin","blog":"http://matthias.vallentin.net","location":"Berkeley, CA","type":"User"},"url":"https://github.com/ned14/nedtries"}