diff options
| author | Corey Farwell <coreyf@rwell.org> | 2017-03-24 18:13:12 -0500 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2017-03-24 18:13:12 -0500 |
| commit | dd9e5892f4d5b678fd645807f8fee2770ec15438 (patch) | |
| tree | b53e461c36fca2109df84011a29eef0b781952e2 /src/rustllvm/RustWrapper.cpp | |
| parent | b561d2b5305998dbaec3ac8b8d4aa9a8c6e3330b (diff) | |
| parent | a033f1a8eeb55bdf93749a5d0c4d803bbe0d8dfc (diff) | |
| download | rust-dd9e5892f4d5b678fd645807f8fee2770ec15438.tar.gz rust-dd9e5892f4d5b678fd645807f8fee2770ec15438.zip | |
Rollup merge of #40739 - cuviper:hash-rev-drop, r=arthurprs
Simplify hash table drops This replaces the `std::collections::hash::table::RevMoveBuckets` iterator with a simpler `while` loop. This iterator was only used for dropping the remaining elements of a `RawTable`, so instead we can just loop through directly and drop them in place. This should be functionally equivalent to the former code, but a little easier to read. I was hoping it might have some performance benefit too, but it seems the optimizer was already good enough to see through the iterator -- the generated code is nearly the same. Maybe it will still help if an element type has more complicated drop code.
Diffstat (limited to 'src/rustllvm/RustWrapper.cpp')
0 files changed, 0 insertions, 0 deletions
