{"repository":{"description":"Compute the cartesian product of two array-like objects. i.e., every possible pairing of their elements.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":88,"owner":"dwcook","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"JavaScript","created_at":"2013-01-12T00:10:29-08:00","pushed_at":"2013-07-31T23:15:53-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Danny Cook","blog":"http://dwcook.github.io/","location":"Maryland, United States","email":"9880b1725faeee3a1bde3d46871bc397acf44351@gmail.com"},"url":"https://github.com/dwcook/cartesian-product/tree/0.0.1"}