{"push_id":1479874305,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"a0f99ae3ffbe9496713db7622516bfa5418a56a7","before":"9f3488fe847a19686c466401545a0dd2bd191f8a","commits":[{"sha":"8a3a1bf469afa4f78c4b6aaab2e891c881b8d7e0","author":{"name":"James Abley","email":"c503b0d2f671411aa821d93af4ef8240e4284b4d@gmail.com"},"message":"Format output\n\nThought about doing tests, or adding assertThat implementation. Punting\nfor now.","distinct":true,"url":"https://api.github.com/repos/jabley/mciij/commits/8a3a1bf469afa4f78c4b6aaab2e891c881b8d7e0"},{"sha":"40e892beb32cb1026559645801a11bb9ccbe1e0e","author":{"name":"James Abley","email":"c503b0d2f671411aa821d93af4ef8240e4284b4d@gmail.com"},"message":"Clean up member and lookup\n\nReading Chris Okasaki's book Purely Functional Data Structures showed me\nthat this implementation is complete and doesn't need the\nIllegalStateExceptions.","distinct":true,"url":"https://api.github.com/repos/jabley/mciij/commits/40e892beb32cb1026559645801a11bb9ccbe1e0e"},{"sha":"a0f99ae3ffbe9496713db7622516bfa5418a56a7","author":{"name":"James Abley","email":"c503b0d2f671411aa821d93af4ef8240e4284b4d@gmail.com"},"message":"Exercise 1.1 part d\n\nBased on my research of Sedgewick [1] and Okasaki [2], I think a\nred-black tree is a good data structure for a balanced search tree for\nsymbol tables.\n\nFor extra credit, I implemented a persistent red-black tree, based on my\nreading of the Haskell version [3] (can’t quite understand the Standard\nML one yet).\n\nThis change shows that the height of the tree is reduced to 4 in both\npreviously pathological cases.\n\n[1] https://www.amazon.co.uk/gp/product/B004P8J1NA/\n[2] https://www.amazon.co.uk/gp/product/B00AKE1V04/\n[3] https://wiki.rice.edu/confluence/download/attachments/2761212/Okasaki-Red-Black.pdf","distinct":true,"url":"https://api.github.com/repos/jabley/mciij/commits/a0f99ae3ffbe9496713db7622516bfa5418a56a7"}]}
{"actor":{"display_login":"jabley"}}