10 Reserve(initialCapacity);
13 void Reserve(
size_t const amount)
15 if (items.size() < amount) {
16 size_t const oldSize = items.size();
17 size_t const newSpace = amount - oldSize;
20 T * data = items.data();
22 assert(newSpace >= oldSize);
26 data + pos + newSpace);
32 void Push(T
const & item)
35 Reserve(std::max<size_t>(8, 2 * items.size()));
38 items.data()[pos] = item;
50 return items.size() - pos;
56 return items.data()[pos];
59 T
const & Peek()
const 62 return items.data()[pos];
Definition: DownwardStack.h:5