101     pointer mData           = mFixedStorage.data();
121     return mData == mFixedStorage.data();  in uses_fixed_storage()
200         delete[] mData;  in ~FastVector()
208     return mData[pos];  in at()
216     return mData[pos];  in at()
224     return mData[pos];
232     return mData[pos];
239     return mData;  in data()
245     return mData;  in data()
251     return mData;  in begin()
258     return mData;  in begin()
264     return mData + mSize;  in end()
271     return mData + mSize;  in end()
297     mData[mSize++] = value;  in push_back()
312     mData[mSize++] = std::move(T(std::forward<Args>(args)...));  in emplace_back()
326     return mData[0];  in front()
334     return mData[0];  in front()
341     return mData[mSize - 1];  in back()
349     return mData[mSize - 1];  in back()
357     pointer tempData = other.mData;  in swap()
359         other.mData = other.mFixedStorage.data();  in swap()
361         other.mData = mData;  in swap()
363         mData = mFixedStorage.data();  in swap()
365         mData = tempData;  in swap()
388         std::fill(mData + mSize, mData + count, value);  in resize()
401         mData[index++] = value;  in assign_from_initializer_list()
411         if (mData[index] == element)  in remove_and_permute()
413             mData[index] = std::move(mData[len]);  in remove_and_permute()
442             delete[] mData;  in ensure_capacity()
445         mData         = newData;  in ensure_capacity()
462         mData.push_back(Pair(key, value));  in insert()
467         for (size_t index = 0; index < mData.size(); ++index)  in contains()
469             if (mData[index].first == key)  in contains()
475     void clear() { mData.clear(); }  in clear()
479         for (size_t index = 0; index < mData.size(); ++index)  in get()
481             const Pair &item = mData[index];  in get()
491     bool empty() const { return mData.empty(); }  in empty()
492     size_t size() const { return mData.size(); }  in size()
495     FastVector<Pair, N> mData;
505     bool empty() const { return mData.empty(); }  in empty()
510         mData.push_back(value);  in insert()
515         for (T value : mData)  in contains()
523     void clear() { mData.clear(); }  in clear()
526     FastVector<T, N> mData;