...ouch this was insidious: the STL implementation for list does not return a pointer to the element just allocated, but rather retrieves and dereferences the back() / front() iterator after returning from emplace_back|front() ...which in case of re-entrant allocations is something wildly different than the initial allocation. Thus a *cheap* and dirty placeholder implementation just using a STL container is not possible, and we need at least to code up likewise cheesy placeholder implementation by hand. - separate allocation and ctor all - use an inline buffer in the STL container - explicitly handle ctor failures to discard allocation - NOT THREADSAFE and likely WASTFUL in terms of performance ==> MockSupport_test now back to GREEN after complete refactoring |
||
|---|---|---|
| .. | ||
| application | ||
| steam | ||
| vault | ||
| DIR_INFO | ||