{"repository":{"owner":"ned14","created_at":"2010-06-11T17:31:25-07:00","homepage":"http://www.nedprod.com/programs/portable/nedtries/","open_issues":2,"has_downloads":true,"has_issues":true,"pushed_at":"2012-11-17T13:45:14-08:00","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.","watchers":113,"forks":2,"fork":false,"size":124,"has_wiki":true,"stargazers":113,"private":false,"language":"C"},"actor_attributes":{"email":"bef361c46d3d1fa291296f6d65d7f2ef6cbcf237@sysd.org","name":"Stanislaw Pusep","type":"User","blog":"https://coderwall.com/creaktive","company":"Buscapé","location":"São Paulo - Brazil"},"url":"https://github.com/ned14/nedtries"}