{"repository":{"description":"A binary search tree implementation in Haskell.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":200,"owner":"solvip","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Haskell","created_at":"2013-04-05T13:13:02-07:00","pushed_at":"2013-04-05T17:40:24-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Sölvi Páll Ásgeirsson","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/solvip/haskell-bst/compare/0d89b6db2a...37d3c1ad2f"}