{"push_id":752462655,"size":3,"distinct_size":3,"ref":"refs/heads/cmn/index-hashmap","head":"d8510686958aad324d40c7b9661e5805d965e113","before":"0d982c402d215b35ebfeec9c4cf1e496b7d7a4ad","commits":[{"sha":"232d87220ffa6c4bdba67bfcaf94be87c9560383","author":{"email":"eecb638c0e60875b4a70118790d5be43bb59c2d6@dwim.me","name":"Carlos Martín Nieto"},"message":"Introduce a hashmap for index entries\n\nThis takes into account not just the path but also the stage. We could\nuse the path alone and let them collide, but we need to a new type\nbecause of equality, so let's go all in.","distinct":true,"url":"https://api.github.com/repos/PKRoma/libgit2/commits/232d87220ffa6c4bdba67bfcaf94be87c9560383"},{"sha":"db372a696bf119cc93099bbd55f94dfe6c9c04a7","author":{"email":"eecb638c0e60875b4a70118790d5be43bb59c2d6@dwim.me","name":"Carlos Martín Nieto"},"message":"index: use a hashmap to speed up path-based lookups\n\nWe still need to insert the entries into a sorted vector due to the\nsorted nature of the index, so insertion should still be just as\nslow. But lookups can now happen in O(1). There are still a few places\nwhere we could make more use of the hashmap to search for collisions but\nthis commit represents a baseline.","distinct":true,"url":"https://api.github.com/repos/PKRoma/libgit2/commits/db372a696bf119cc93099bbd55f94dfe6c9c04a7"},{"sha":"d8510686958aad324d40c7b9661e5805d965e113","author":{"email":"eecb638c0e60875b4a70118790d5be43bb59c2d6@dwim.me","name":"Carlos Martín Nieto"},"message":"fixup","distinct":true,"url":"https://api.github.com/repos/PKRoma/libgit2/commits/d8510686958aad324d40c7b9661e5805d965e113"}]}