{"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.","homepage":"http://www.nedprod.com/programs/portable/nedtries/","watchers":119,"stargazers":119,"forks":2,"fork":false,"size":124,"owner":"ned14","private":false,"open_issues":2,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2010-06-11T17:31:25-07:00","pushed_at":"2012-11-17T13:45:14-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Vasil Velichkov","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/ned14/nedtries"}