payload: {"push_id":4253973937,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c20b98bffddebc46d05eb9caf99495b988f95303","before":"fd466f68aa1e4613367a0fa90cf882685f89b062","commits":[{"sha":"c20b98bffddebc46d05eb9caf99495b988f95303","author":{"name":"Jim Posen","email":"1cae4836da7734bb5847d986ada56e4a43f50e52@gmail.com"},"message":"Implement a pre-order iterator over trie nodes. (#33)\n\n* Implement a pre-order iterator over trie nodes.\r\n\r\n* Refactor to keep track of whether iterator nodes are inline or not.\r\n\r\n* TrieDBNodeIterator returns the node hash if not inline.\r\n\r\n* Convert spaces to tabs.\r\n\r\n* Tests for iterating over incomplete database.\r\n\r\n* Avoid unnecessary rehashing.","distinct":true,"url":"https://api.github.com/repos/paritytech/trie/commits/c20b98bffddebc46d05eb9caf99495b988f95303"}]}
other: {"actor":{"display_login":"jimpo"}}