{"repository":{"description":"A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.","watchers":8,"stargazers":8,"forks":0,"fork":false,"size":424,"owner":"gereeter","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Haskell","created_at":"2013-10-31T20:46:58-07:00","pushed_at":"2013-12-13T05:05:39-08:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/gereeter/bounded-intmap/compare/312a1bfc74...08e6cb17bb"}