reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
69 return V.empty(); 86 return V.back(); 93 auto InsertResult = M.insert({X, V.size()}); 96 V.push_back(X); 101 assert(V[Index] == X && "Value not actually at index in map!"); 102 if (Index != (ptrdiff_t)(V.size() - 1)) { 104 V[Index] = T(); 105 Index = (ptrdiff_t)V.size(); 106 V.push_back(X); 121 ptrdiff_t StartIndex = V.size(); 122 V.insert(V.end(), std::begin(Input), std::end(Input)); 122 V.insert(V.end(), std::begin(Input), std::end(Input)); 124 for (ptrdiff_t i = V.size() - 1; i >= StartIndex; --i) { 125 auto InsertResult = M.insert({V[i], i}); 133 V[Index] = T(); 140 V[i] = T(); 150 V.pop_back(); 151 } while (!V.empty() && V.back() == T()); 151 } while (!V.empty() && V.back() == T()); 168 assert(V[I->second] == X && "Value not actually at index in map!"); 169 if (I->second == (ptrdiff_t)(V.size() - 1)) { 171 V.pop_back(); 172 } while (!V.empty() && V.back() == T()); 172 } while (!V.empty() && V.back() == T()); 174 V[I->second] = T(); 196 remove_if(V, TestAndEraseFromMap<UnaryPredicate>(P, M)); 197 if (E == V.end()) 199 for (auto I = V.begin(); I != E; ++I) 201 M[*I] = I - V.begin(); 202 V.erase(E, V.end()); 202 V.erase(E, V.end()); 214 V.clear();