The table tracks deleted slots: probing hands a tombstone back instead of walking past it, the load factor counts tombstones as well as entries, and a rehash also runs when the live entries become sparse. The tests cover reinsert after erase and the growth policy. |
||
|---|---|---|
| .. | ||
| Buffer.hpp | ||
| Buffer2D.hpp | ||
| ContainersCommon.hpp | ||
| IntervalTree.hpp | ||
| LinearRingBuffer.hpp | ||
| liniar_ring.hpp | ||
| List.hpp | ||
| Map.hpp | ||
| RingBufferByte.hpp | ||
| Tree.hpp | ||