{"push_id":636750915,"size":7,"distinct_size":0,"ref":"refs/heads/tmp","head":"77213d1b28b307401d2bbb143168418bf7e6794c","before":"efa6a46a8eceb4ab792d5ec8e28cf3baaaa96491","commits":[{"sha":"966e53d8b6272a324c6be3460ae6bf52e47202fe","author":{"email":"4cc33a8ae3d9bb448f90bf63a1d4018698b1fb94@alum.mit.edu","name":"Niko Matsakis"},"message":"Add librustc_data_structures crate","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/966e53d8b6272a324c6be3460ae6bf52e47202fe"},{"sha":"52c34625866f6e23fd0de484282f326da6a100e3","author":{"email":"4cc33a8ae3d9bb448f90bf63a1d4018698b1fb94@alum.mit.edu","name":"Niko Matsakis"},"message":"Use the newer snapshot_vec, which has a simplified delegate\ninterface since in practice no delegates had any state.","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/52c34625866f6e23fd0de484282f326da6a100e3"},{"sha":"7ab0d1ab675a07a5bb1eae4d41a2e1cbccae113d","author":{"email":"4cc33a8ae3d9bb448f90bf63a1d4018698b1fb94@alum.mit.edu","name":"Niko Matsakis"},"message":"Port to using the newer graph, which offers iterators instead of the\nolder `each` method, but is otherwise identical.","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/7ab0d1ab675a07a5bb1eae4d41a2e1cbccae113d"},{"sha":"416f388c6f567dfd2c009a36907447c9646100e5","author":{"email":"4cc33a8ae3d9bb448f90bf63a1d4018698b1fb94@alum.mit.edu","name":"Niko Matsakis"},"message":"Port to use the new Unify code, which has no UnifyValue trait\nbut is otherwise mostly the same.","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/416f388c6f567dfd2c009a36907447c9646100e5"},{"sha":"65ccffd22451d7d9aee762874afcb1fda0a4a4f0","author":{"email":"4cc33a8ae3d9bb448f90bf63a1d4018698b1fb94@alum.mit.edu","name":"Niko Matsakis"},"message":"Add licenses.","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/65ccffd22451d7d9aee762874afcb1fda0a4a4f0"},{"sha":"e47fb489c10f2d86216c3a75ad6cbde3742e9f0c","author":{"email":"4cc33a8ae3d9bb448f90bf63a1d4018698b1fb94@alum.mit.edu","name":"Niko Matsakis"},"message":"Address nits","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/e47fb489c10f2d86216c3a75ad6cbde3742e9f0c"},{"sha":"77213d1b28b307401d2bbb143168418bf7e6794c","author":{"email":"3a2c29237f73c7cf88424b80e427b1884f346b35@rust-lang.org","name":"bors"},"message":"Auto merge of #24209 - nikomatsakis:refactor-unification, r=nrc\n\nI'm on a quest to slowly refactor a lot of the inference code. A first step for that is moving the \"pure data structures\" out so as to simplify what's left. This PR moves `snapshot_vec`, `graph`, and `unify` into their own crate (`librustc_data_structures`). They can then be unit-tested, benchmarked, etc more easily. As a benefit, I improved the performance of unification slightly on the benchmark I added vs the original code.\r\n\r\nr? @nrc","distinct":false,"url":"https://api.github.com/repos/rust-lang/rust/commits/77213d1b28b307401d2bbb143168418bf7e6794c"}]}