about summary refs log tree commit diff
path: root/src/test/debuginfo/enum-thinlto.rs
diff options
context:
space:
mode:
authorNiko Matsakis <niko@alum.mit.edu>2018-07-23 21:06:04 +0300
committerNiko Matsakis <niko@alum.mit.edu>2018-07-25 06:38:21 +0300
commit9ba4d33e4345b14c78fcbdf72959d4a0232e46f4 (patch)
tree687407d3e4e543f104fa4a71738872d5ea11d907 /src/test/debuginfo/enum-thinlto.rs
parent4fce59f0fda5db8c2ef3b58ddce8e1ed670d813d (diff)
downloadrust-9ba4d33e4345b14c78fcbdf72959d4a0232e46f4.tar.gz
rust-9ba4d33e4345b14c78fcbdf72959d4a0232e46f4.zip
rewrite the "constraint graph search" to use a BFS instead of a DFS
This way we find the shortest path without having to sort etc
Diffstat (limited to 'src/test/debuginfo/enum-thinlto.rs')
0 files changed, 0 insertions, 0 deletions