{"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":440,"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-24T10:45:55-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Jonathan S","location":"SHA512: ae0fa3af71c32c4885b8b0dead0e949f3b3864f463e581266c9788fa1b8f1c87fde7187b78fc5deedf5748d3e6852d6a3f113d417d80e06838c8d381d57afa6a'","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/gereeter/bounded-intmap/compare/1d96d53879...fc1dd6668f"}