| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2020-08-30 | mv compiler to compiler/ | mark | -1851/+0 | |
| 2020-07-03 | Rollup merge of #73984 - pierwill:pierwill-tarjan, r=jonas-schievink | Manish Goregaokar | -4/+6 | |
| Edit docs for rustc_data_structures::graph::scc - Add newline to provide concise module summary - Add wikipedia link - Italicize O notation | ||||
| 2020-07-03 | Edit docs for rustc_data_structures::graph::scc | pierwill | -4/+6 | |
| - Add newline to provide concise module summary - Add wikipedia link - Italicize O notation | ||||
| 2020-07-02 | Standardize bibliographic citations in rustc API docs | pierwill | -5/+6 | |
| 2020-04-21 | sccs are computed in dependency order | Niko Matsakis | -0/+5 | |
| We don't need the `scc_dependency_order` vector, `all_sccs` is already in dependency order. | ||||
| 2020-04-09 | Use tri-color search for unconditional recursion lint | Dylan MacKenzie | -3/+10 | |
| 2020-04-05 | Stop importing int/float modules in librustc_* | Linus Färnstrand | -1/+0 | |
| 2020-03-20 | remove redundant returns (clippy::needless_return) | Matthias Krüger | -2/+2 | |
| 2020-03-12 | remove lifetimes that can be elided (clippy::needless_lifetimes) | Matthias Krüger | -2/+2 | |
| 2020-03-06 | fix various typos | Matthias Krüger | -1/+1 | |
| 2019-12-26 | Convert collapsed to shortcut reference links | Matthew Kraai | -5/+5 | |
| 2019-12-22 | Format the world | Mark Rousskov | -222/+107 | |
| 2019-12-02 | Undo minor changes that weren't needed, fix one lifetime typo | Paul Daniel Faria | -0/+1 | |
| 2019-12-02 | Account for new maybe_sideeffect helper that requires predecessors | Paul Daniel Faria | -34/+3 | |
| 2019-12-02 | Move predecessor cache outside of Body, use wrapper types to manage Cache ↵ | Paul Daniel Faria | -11/+42 | |
| and Body (WIP, amend this commit) | ||||
| 2019-10-23 | Rollup merge of #65648 - nnethercote:rm-intersect_opt, r=nikomatsakis | Mazdak Farrokhzad | -21/+6 | |
| Eliminate `intersect_opt`. Its fourth argument is always `Some(pred)`, so the pattern matching is unnecessary. This commit inlines and removes it. r? @nikomatsakis | ||||
| 2019-10-21 | Remove many unnecessary trait derivations. | Nicholas Nethercote | -2/+2 | |
| 2019-10-21 | Eliminate `intersect_opt`. | Nicholas Nethercote | -21/+6 | |
| Its fourth argument is always `Some(pred)`, so the pattern matching is unnecessary. This commit inlines and removes it. | ||||
| 2019-10-01 | Fix clippy warnings | Yuki Okushi | -2/+2 | |
| 2019-09-29 | remove indexed_vec re-export from rustc_data_structures | csmoe | -5/+5 | |
| 2019-09-29 | remove bit_set re-export from rustc_data_structures | csmoe | -2/+2 | |
| 2019-09-23 | Add cycle detection for graphs | Dylan MacKenzie | -1/+224 | |
| 2019-08-02 | Remove some more `cfg(test)`s | Vadim Petrochenkov | -9/+4 | |
| 2019-08-02 | librustc_data_structures: Unconfigure tests during normal build | Vadim Petrochenkov | -10/+9 | |
| 2019-07-28 | Deny `unused_lifetimes` through rustbuild | Vadim Petrochenkov | -0/+2 | |
| 2019-07-03 | Add missing lifetime specifier | Jeremy Stucki | -1/+1 | |
| 2019-07-03 | Remove needless lifetimes | Jeremy Stucki | -3/+3 | |
| 2019-07-03 | Remove needless lifetimes | Jeremy Stucki | -14/+14 | |
| 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 | -1/+49 | |
| 2019-07-02 | introduce a `VecGraph` abstraction that cheaply stores graphs | Niko Matsakis | -1/+184 | |
| This is perhaps better than the linked list approach I was using before. Lower memory overhead, Theta(N+E) storage. Does require a sort. =) | ||||
| 2019-07-02 | implement the graph traits for SCC | Niko Matsakis | -1/+26 | |
| 2019-04-09 | Kill dead code dominator code. | Edd Barrett | -47/+0 | |
| 2019-02-10 | rustc: doc comments | Alexander Regueiro | -3/+3 | |
| 2019-02-09 | librustc_data_structures => 2018 | Taiki Endo | -26/+22 | |
| 2018-12-25 | Remove licenses | Mark Rousskov | -110/+0 | |
| 2018-11-13 | fix various typos in doc comments | Andy Russell | -1/+1 | |
| 2018-09-18 | Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs. | Nicholas Nethercote | -4/+4 | |
| Currently we have two files implementing bitsets (and 2D bit matrices). This commit combines them into one, taking the best features from each. This involves renaming a lot of things. The high level changes are as follows. - bitvec.rs --> bit_set.rs - indexed_set.rs --> (removed) - BitArray + IdxSet --> BitSet (merged, see below) - BitVector --> GrowableBitSet - {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet - BitMatrix --> BitMatrix - SparseBitMatrix --> SparseBitMatrix The changes within the bitset types themselves are as follows. ``` OLD OLD NEW BitArray<C> IdxSet<T> BitSet<T> -------- ------ ------ grow - grow new - (remove) new_empty new_empty new_empty new_filled new_filled new_filled - to_hybrid to_hybrid clear clear clear set_up_to set_up_to set_up_to clear_above - clear_above count - count contains(T) contains(&T) contains(T) contains_all - superset is_empty - is_empty insert(T) add(&T) insert(T) insert_all - insert_all() remove(T) remove(&T) remove(T) words words words words_mut words_mut words_mut - overwrite overwrite merge union union - subtract subtract - intersect intersect iter iter iter ``` In general, when choosing names I went with: - names that are more obvious (e.g. `BitSet` over `IdxSet`). - names that are more like the Rust libraries (e.g. `T` over `C`, `insert` over `add`); - names that are more set-like (e.g. `union` over `merge`, `superset` over `contains_all`, `domain_size` over `num_bits`). Also, using `T` for index arguments seems more sensible than `&T` -- even though the latter is standard in Rust collection types -- because indices are always copyable. It also results in fewer `&` and `*` sigils in practice. | ||||
| 2018-08-28 | Use FxHash{Map,Set} instead of the default Hash{Map,Set} everywhere in rustc. | Eduard-Mihai Burtescu | -5/+5 | |
| 2018-08-27 | micro-optimize dominator code | Niko Matsakis | -2/+2 | |
| 2018-08-18 | Use the new Entry::or_default method where possible. | Eduard-Mihai Burtescu | -4/+4 | |
| 2018-08-09 | A few cleanups for rustc_data_structures | ljedrz | -5/+6 | |
| 2018-08-01 | Split out growth functionality into BitVector type | Mark Rousskov | -4/+4 | |
| 2018-07-25 | parameterize `BitVector` and `BitMatrix` by their index types | Niko Matsakis | -1/+1 | |
| 2018-07-13 | nit: fix `all_sccs` comment | Niko Matsakis | -1/+1 | |
| 2018-07-13 | nit: tweak comment order | Niko Matsakis | -21/+23 | |
| 2018-07-13 | nit: improve SCC comments | Niko Matsakis | -4/+19 | |
| 2018-07-13 | nit: clarify "keep it around" comment | Niko Matsakis | -2/+2 | |
