This vector implementation does is optimized for the case of having only a small number of elements, which are stored directly on the vector object rather than being allocated from the heap. If the capacity exceeds this small number, then a heap allocation is done. This should improve performance in a couple of cases where vectors typically store 1 element and rarely more than that. |
||
|---|---|---|
| .. | ||
| metalibs | ||
| src | ||
| CMakeLists.txt | ||