| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2020-08-30 | mv compiler to compiler/ | mark | -149/+0 | |
| 2020-03-12 | remove lifetimes that can be elided (clippy::needless_lifetimes) | Matthias Krüger | -1/+1 | |
| 2020-03-06 | fix various typos | Matthias Krüger | -1/+1 | |
| 2019-12-22 | Format the world | Mark Rousskov | -19/+4 | |
| 2019-09-29 | remove indexed_vec re-export from rustc_data_structures | csmoe | -1/+1 | |
| 2019-08-02 | librustc_data_structures: Unconfigure tests during normal build | Vadim Petrochenkov | -1/+1 | |
| 2019-07-02 | more centril nits | Niko Matsakis | -1/+1 | |
| 2019-07-02 | address nits by mattewjasper | Niko Matsakis | -2/+1 | |
| 2019-07-02 | pacify the mercilous tidy | Niko Matsakis | -1/+0 | |
| long lines, trailing newlines | ||||
| 2019-07-02 | add a `depth_first_search` helper function | Niko Matsakis | -0/+7 | |
| 2019-07-02 | introduce a `VecGraph` abstraction that cheaply stores graphs | Niko Matsakis | -0/+159 | |
| This is perhaps better than the linked list approach I was using before. Lower memory overhead, Theta(N+E) storage. Does require a sort. =) | ||||
 |
index : rust | |
| https://github.com/rust-lang/rust |
| about summary refs log tree commit diff |