Age | Commit message (Collapse) | Author |
|
|
|
|
|
Add a separate template wrapper for filtered iteration
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
std::vector::[push|emplace]_back()
|
|
|
|
|
|
|
|
90c920601c84975acb694f3673e2beb08b013753)
|
|
they register in static vectors.
|
|
Eagle_rainbow)
|
|
others were still regular inline), but make sure inline is always a 'forced' inline (I am looking at you MSVC)
|
|
destructor
|
|
|
|
|
|
|
|
PoolItem::CanAllocateItem() before actually allocating it
|
|
more likely to be updated [n].
|
|
"non-placement deallocation function [is] selected for placement delete", or in other words delete(void *, size_t) is 'magic'.
We implemented these delete(void *, size_t) operator functions because MSVC warned that "no matching operator delete found; memory will not be freed if initialization throws an exception" for new(size_t, size_t).
This disables MSVC warning about this because we do not use exceptions in the (constructors that use the) overridden allocation functions, as such they will never be called; delete(void *) remains necessary though.
|
|
pools, that is instead of 'free' push the unused items in a linked list and use them on 'malloc'. Also add the concept of zeroing, or actually not zeroing, on new for pool items.
|
|
|
|
|
|
item from the pool
|
|
|