0c8bdbafd5
We now keep track of a lower bound as to when the list should scale itself back down. When increasing the list size, we double the current, with the lower bound set to 1/4 of the current size, not allowing it to go any smaller than the block size. These combined allow us to do very cheap tests to see if an operation requires a resize at all, and minimize how often the list actually needs to be resized, since the difference in upper and lower bounds prevents bouncing back and forth between a size in the case of adding/removing an item while close to a boundary. All in all this should make BList noticably more scalable when doing large numbers of add/remove operations. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@25946 a95241bf-73f2-0310-859d-f6bbb57e9c96 |
||
|---|---|---|
| .. | ||
| Archivable.h | ||
| Autolock.h | ||
| Beep.h | ||
| BlockCache.h | ||
| BufferIO.h | ||
| ByteOrder.h | ||
| ClassInfo.h | ||
| DataIO.h | ||
| Debug.h | ||
| Errors.h | ||
| Flattenable.h | ||
| List.h | ||
| Locker.h | ||
| parsedate.h | ||
| StopWatch.h | ||
| String.h | ||
| SupportDefs.h | ||
| TLS.h | ||
| TypeConstants.h | ||
| UTF8.h | ||