#include <fast_sorted.h>
Additional Inherited Members | |
![]() | |
using | BlockType = BlockType |
using | ItemType = FastSortedItem< BlockType > |
![]() | |
constexpr bool | empty () const |
Returns whether this buckets contains any free blocks. | |
constexpr size_t | max_inner_size () const |
Returns the configured maximum inner size for blocks in this bucket. | |
constexpr void | set_max_inner_size (size_t max_inner_size) |
bool | Add (BlockType &block) |
BlockType * | RemoveAny () |
bool | Remove (BlockType &block) |
BlockType * | RemoveCompatible (Layout layout) |
void | Clear () |
Removes all blocks from this bucket. | |
constexpr BlockType * | GetBlockFromIterator (Iterator iter, Iterator last) |
constexpr BlockType * | GetBlockFromPrev (Iterator prev, Iterator last) |
![]() | |
static Iterator | FindPrevIf (Iterator before_first, Iterator last, Predicate predicate) |
static auto | MakeCanAllocPredicate (Layout layout) |
![]() | |
static ItemType & | GetItemFrom (BlockType &block) |
Like FastSortedBucket
, but ordered largest to smallest.
In particular, Remove()
will return the largest free block.