{"repository":{"description":"An implementation of using the x-fast trie for fast predecessor search. Illustrated with an example of the problem of searching for the closest movie release meeting some arbitrary condition.","homepage":"www.borzov.ca/XLtrie","watchers":0,"stargazers":0,"forks":0,"fork":true,"size":3071,"owner":"theneva","private":false,"open_issues":0,"has_issues":false,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-12-08T07:44:55-08:00","pushed_at":"2013-12-08T07:54:23-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Martin Lehmann","company":"Aeream","blog":"http://twitter.com/theneva","location":"Oslo, Norway","email":"54669547a225ff20cba8b75a4adca540eef25858@nith.no"},"url":"https://github.com/theneva/XLtrie/compare/6abe174046...692ac4de94"}