| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2018-02-27 | Make TransitiveRelation thread safe. Avoid locking by using get_mut in some ↵ | John Kåre Alsaker | -10/+10 | |
| cases. | ||||
| 2017-12-04 | transtive_relation: fix typo in comment for `parents` | Niko Matsakis | -1/+1 | |
| 2017-12-04 | extend TransitiveRelation with `parents` function | Niko Matsakis | -2/+128 | |
| 2017-12-04 | rename `greater_than` to `reachable_from` | Niko Matsakis | -2/+3 | |
| 2017-11-02 | add/fix various comments to `BitMatrix` | Niko Matsakis | -2/+2 | |
| Notably, the (hitherto unused) `less_than` method was not at all what it purported to be. It in fact computes the opposite. | ||||
| 2017-09-24 | Point at parameter type on E0301 | Esteban Küber | -3/+3 | |
| On "the parameter type `T` may not live long enough" error, point to the parameter type suggesting lifetime bindings: ``` error[E0310]: the parameter type `T` may not live long enough --> $DIR/lifetime-doesnt-live-long-enough.rs:28:5 | 27 | struct Foo<T> { | - help: consider adding an explicit lifetime bound `T: 'static`... 28 | foo: &'static T | ^^^^^^^^^^^^^^^ | note: ...so that the reference type `&'static T` does not outlive the data it points at --> $DIR/lifetime-doesnt-live-long-enough.rs:28:5 | 28 | foo: &'static T | ^^^^^^^^^^^^^^^ ``` | ||||
| 2017-05-03 | factor variances into a proper query | Niko Matsakis | -0/+14 | |
| There are now two queries: crate and item. The crate one computes the variance of all items in the crate; it is sort of an implementation detail, and not meant to be used. The item one reads from the crate one, synthesizing correct deps in lieu of the red-green algorithm. At the same time, remove the `variance_computed` flag, which was a horrible hack used to force invariance early on (e.g. when type-checking constants). This is only needed because of trait applications, and traits are always invariant anyway. Therefore, we now change to take advantage of the query system: - When asked to compute variances for a trait, just return a vector saying 'all invariant'. - Remove the corresponding "inferreds" from traits, and tweak the constraint generation code to understand that traits are always inferred. | ||||
| 2017-05-03 | make transitive relation use a hash map | Niko Matsakis | -27/+42 | |
| 2017-04-30 | intern CodeExtents | Niko Matsakis | -0/+21 | |
| Make a `CodeExtent<'tcx>` be something allocated in an arena instead of an index into the `RegionMaps`. | ||||
| 2017-04-12 | ICH: Hash everything that gets encoded into crate metadata. | Michael Woerister | -0/+46 | |
| 2017-02-28 | move the `FreeRegionMap` into `TypeckTables` | Niko Matsakis | -2/+31 | |
| 2016-08-09 | generalize BitMatrix to be NxM and not just NxN | Niko Matsakis | -1/+2 | |
| 2016-03-05 | apply rustfmt to librustc_data_structures, correcting ↵ | Niko Matsakis | -55/+63 | |
| rust-lang-nursery/rustfmt#836 | ||||
| 2015-08-23 | Fix panic in docs for librustc_data_structures | Manish Goregaokar | -1/+1 | |
| 2015-08-21 | move the reverse into the iterator | Niko Matsakis | -2/+2 | |
| 2015-08-21 | missed one reference to "best" | Niko Matsakis | -4/+5 | |
| 2015-08-21 | rename `best_upper_bound` to `postdom_upper_bound` | Niko Matsakis | -8/+8 | |
| 2015-08-21 | remove use of swap_remove and compress the list as we go instead | Niko Matsakis | -13/+12 | |
| 2015-08-21 | nits from pnkfelix | Niko Matsakis | -22/+45 | |
| 2015-08-21 | add final test case, correct one of the others (both versions produced | Niko Matsakis | -4/+22 | |
| same result) | ||||
| 2015-08-21 | add test cases suggested by pnkfelix | Niko Matsakis | -0/+82 | |
| 2015-08-21 | clarify diagonal arrows | Niko Matsakis | -0/+3 | |
| 2015-08-18 | implement transitive relation type that can compute transitive | Niko Matsakis | -0/+463 | |
| closures, upper bounds, and other fun things | ||||
