diff options
| author | Niko Matsakis <niko@alum.mit.edu> | 2019-06-11 13:40:24 -0400 |
|---|---|---|
| committer | Niko Matsakis <niko@alum.mit.edu> | 2019-07-02 12:15:20 -0400 |
| commit | 4c91bb9571ffbc7ddad52cc98552f5b19b0d44d7 (patch) | |
| tree | 0776bef9d5fa38af8bd84c743a80e766003b4f03 /src/librustc_data_structures/graph/iterate | |
| parent | 4e85665e08059a3cd96600b7972f7dcd1f62b871 (diff) | |
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/librustc_data_structures/graph/iterate')
0 files changed, 0 insertions, 0 deletions