about summary refs log tree commit diff
path: root/src/test/ui/thinlto
diff options
context:
space:
mode:
authorNiko Matsakis <niko@alum.mit.edu>2019-06-11 13:40:24 -0400
committerNiko Matsakis <niko@alum.mit.edu>2019-07-02 12:15:20 -0400
commit4c91bb9571ffbc7ddad52cc98552f5b19b0d44d7 (patch)
tree0776bef9d5fa38af8bd84c743a80e766003b4f03 /src/test/ui/thinlto
parent4e85665e08059a3cd96600b7972f7dcd1f62b871 (diff)
downloadrust-4c91bb9571ffbc7ddad52cc98552f5b19b0d44d7.tar.gz
rust-4c91bb9571ffbc7ddad52cc98552f5b19b0d44d7.zip
introduce a `VecGraph` abstraction that cheaply stores graphs
This is perhaps better than the linked list approach I was using
before. Lower memory overhead, Theta(N+E) storage. Does require a
sort. =)
Diffstat (limited to 'src/test/ui/thinlto')
0 files changed, 0 insertions, 0 deletions