{"push_id":644330559,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ae2aa79939b234cd480f9fd23c6468028ba3cbef","before":"f91ea8178373ceb490d8c6433cc5d2f0a5c8468b","commits":[{"sha":"ae2aa79939b234cd480f9fd23c6468028ba3cbef","author":{"email":"6df417420528a97f3837019e1ae9508f197361b8@me.com","name":"Michele De Pascalis"},"message":"Changed Table implementation\n\nThis new implementation is 37% faster than the previous, allowing the\nDFA’s to be 21% faster (100k iterations in 0.360 seconds), while still\nretaining information about its keys.","distinct":true,"url":"https://api.github.com/repos/mikidep/SwiftAutomata/commits/ae2aa79939b234cd480f9fd23c6468028ba3cbef"}]}