{"push_id":586266999,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4d36ff668d98388fb9ad9a9a13e6fca9f6e7900b","before":"a9c14e2cf1e8d103c26a6a81a5618f59b01e7565","commits":[{"sha":"4d36ff668d98388fb9ad9a9a13e6fca9f6e7900b","author":{"email":"3b534acb8027bc6bf0cbf63700cea25bf88c6794@gmail.com","name":"KSouthwood"},"message":"Second draft of pset6's speller.\n\nImplemented the load, size and unload functions in dictionary.c using a linked list. Also added a variable for keeping track of how many words get loaded into memory.\n\nBeen a lot of work getting the compilation correct with writing the linked list routines in it's own source file as opposed to changing dictionary.c all the time. This was done since I plan on writing a version that uses a trie to compare the speed of each approach.\n\nLearning is the goal here, though, after all so it's all good.","distinct":true,"url":"https://api.github.com/repos/KSouthwood/CS50x2015/commits/4d36ff668d98388fb9ad9a9a13e6fca9f6e7900b"}]}