diff options
| author | bors <bors@rust-lang.org> | 2015-10-09 17:07:48 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2015-10-09 17:07:48 +0000 |
| commit | e3376d8a134e52e1638eff37ed3c0d602a0483d7 (patch) | |
| tree | 1390044e7b57975c0babed7cc3cce104545d2b4f /src/libstd/sys/unix/stack_overflow.rs | |
| parent | 3034541129d6f64b2c2cf1df6542a7e98bf0d3c7 (diff) | |
| parent | 098a7a07ee6d11cf6d2b9d18918f26be95ee2f66 (diff) | |
| download | rust-e3376d8a134e52e1638eff37ed3c0d602a0483d7.tar.gz rust-e3376d8a134e52e1638eff37ed3c0d602a0483d7.zip | |
Auto merge of #28929 - pnkfelix:expand-legal-cycles-test, r=alexcrichton
Major revision to the dropck_legal_cycles test.
1. Added big comment block explaining the test framework.
2. Added tests exericising Rc and Arc. This was inspired by a comment
from eefriedman on PR #28861.
3. Made the cycle-detection not issue false-positives on acyclic dags.
Doing this efficiently required revising the framework; instead of
visiting all children (i.e. doing a traversal), now each test is
responsible for supplying the path that will act as a witness to
the cycle.
Luckily for me, all of the pre-existing tests worked with a trivial
path built from "always tke your first left", but new tests I added
did require other input paths (i.e., "first turn right, then left".
(The path representation is a bit-string and its branches are
n-ary, not word phrases and binary branches as you might think
from the outline above.)
cc PR #27185
Diffstat (limited to 'src/libstd/sys/unix/stack_overflow.rs')
0 files changed, 0 insertions, 0 deletions
