diff options
| author | Niko Matsakis <niko@alum.mit.edu> | 2019-10-08 19:26:57 -0400 |
|---|---|---|
| committer | Niko Matsakis <niko@alum.mit.edu> | 2020-02-06 15:58:00 -0500 |
| commit | 534f044425d019518b9f7936cbe5955f18157e0a (patch) | |
| tree | e6ec1fc2a4c336baede1083c714dc26d3bde529b /src/test/codegen/src-hash-algorithm/src-hash-algorithm-sha1.rs | |
| parent | b52414fedebe9774bf8a5339eb5042a2fa3dc9a3 (diff) | |
| download | rust-534f044425d019518b9f7936cbe5955f18157e0a.tar.gz rust-534f044425d019518b9f7936cbe5955f18157e0a.zip | |
index ReEmpty by universe
We now make `'empty` indexed by a universe index, resulting
in a region lattice like this:
```
static ----------+-----...------+ (greatest)
| | |
early-bound and | |
free regions | |
| | |
scope regions | |
| | |
empty(root) placeholder(U1) |
| / |
| / placeholder(Un)
empty(U1) -- /
| /
... /
| /
empty(Un) -------- (smallest)
```
Therefore, `exists<A> { forall<B> { B: A } }` is now unprovable,
because A must be at least Empty(U1) and B is placeholder(U2), and hence
the two regions are unrelated.
Diffstat (limited to 'src/test/codegen/src-hash-algorithm/src-hash-algorithm-sha1.rs')
0 files changed, 0 insertions, 0 deletions