reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
57 return std::move(Vector); 60 size_type size() const { return Vector.size(); } 66 Vector.reserve(NumEntries); 69 iterator begin() { return Vector.begin(); } 70 const_iterator begin() const { return Vector.begin(); } 71 iterator end() { return Vector.end(); } 72 const_iterator end() const { return Vector.end(); } 74 reverse_iterator rbegin() { return Vector.rbegin(); } 75 const_reverse_iterator rbegin() const { return Vector.rbegin(); } 76 reverse_iterator rend() { return Vector.rend(); } 77 const_reverse_iterator rend() const { return Vector.rend(); } 80 return Vector.empty(); 83 std::pair<KeyT, ValueT> &front() { return Vector.front(); } 84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } 85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } 86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } 90 Vector.clear(); 95 std::swap(Vector, RHS.Vector); 95 std::swap(Vector, RHS.Vector); 103 Vector.push_back(std::make_pair(Key, ValueT())); 104 I = Vector.size() - 1; 106 return Vector[I].second; 114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; 122 Vector.push_back(std::make_pair(KV.first, KV.second)); 123 I = Vector.size() - 1; 135 Vector.push_back(std::move(KV)); 136 I = Vector.size() - 1; 149 return Pos == Map.end()? Vector.end() : 150 (Vector.begin() + Pos->second); 155 return Pos == Map.end()? Vector.end() : 156 (Vector.begin() + Pos->second); 161 typename MapType::iterator Pos = Map.find(Vector.back().first); 163 Vector.pop_back(); 175 auto Next = Vector.erase(Iterator); 176 if (Next == Vector.end()) 180 size_t Index = Next - Vector.begin(); 210 auto O = Vector.begin(); 211 for (auto I = O, E = Vector.end(); I != E; ++I) { 221 Map[O->first] = O - Vector.begin(); 226 Vector.erase(O, Vector.end()); 226 Vector.erase(O, Vector.end());