reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
221 static void Profile(const T &X, FoldingSetNodeID &ID) { 224 static void Profile(T &X, FoldingSetNodeID &ID) { 232 static inline bool Equals(T &X, const FoldingSetNodeID &ID, unsigned IDHash, 240 static inline unsigned ComputeHash(T &X, FoldingSetNodeID &TempID); 250 : public DefaultFoldingSetTrait<T> {}; 369 FoldingSetTrait<T>::Profile(X, TempID); 375 FoldingSetTrait<T>::Profile(X, TempID); 410 using iterator = FoldingSetIterator<T>; 415 using const_iterator = FoldingSetIterator<const T>; 420 using bucket_iterator = FoldingSetBucketIterator<T>; 432 bool RemoveNode(T *N) { return FoldingSetBase::RemoveNode(N); } 437 T *GetOrInsertNode(T *N) { 437 T *GetOrInsertNode(T *N) { 444 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { 451 void InsertNode(T *N, void *InsertPos) { 457 void InsertNode(T *N) { 458 T *Inserted = GetOrInsertNode(N); 473 template <class T> class FoldingSet final : public FoldingSetImpl<T> { 474 using Super = FoldingSetImpl<T>; 480 T *TN = static_cast<T *>(N); 481 FoldingSetTrait<T>::Profile(*TN, ID); 488 T *TN = static_cast<T *>(N); 489 return FoldingSetTrait<T>::Equals(*TN, ID, IDHash, TempID); 495 T *TN = static_cast<T *>(N); 496 return FoldingSetTrait<T>::ComputeHash(*TN, TempID);unittests/ADT/FoldingSet.cpp
70 FoldingSet<TrivialPair> Trivial; 72 TrivialPair T(99, 42); 78 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos); 84 FoldingSet<TrivialPair> Trivial; 86 TrivialPair S(100, 42); 87 TrivialPair T(99, 42); 93 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos); 99 FoldingSet<TrivialPair> Trivial; 101 TrivialPair T(99, 42); 111 FoldingSet<TrivialPair> Trivial; 113 TrivialPair T(99, 42); 120 FoldingSet<TrivialPair> Trivial; 122 TrivialPair T(99, 42); 123 TrivialPair *N = Trivial.GetOrInsertNode(&T); 128 FoldingSet<TrivialPair> Trivial; 130 TrivialPair T(99, 42); 131 TrivialPair T2(99, 42); 133 TrivialPair *N = Trivial.GetOrInsertNode(&T2); 138 FoldingSet<TrivialPair> Trivial; 141 TrivialPair Finder(99, 42); 146 TrivialPair T(99, 42); 152 FoldingSet<TrivialPair> Trivial; 157 FoldingSet<TrivialPair> Trivial; 158 TrivialPair T(99, 42); 164 FoldingSet<TrivialPair> Trivial; 170 FoldingSet<TrivialPair> Trivial; 171 TrivialPair T(99, 42); 178 FoldingSet<TrivialPair> Trivial; 185 FoldingSet<TrivialPair> Trivial;utils/unittest/googletest/include/gtest/gtest-printers.h
407 T* p, ::std::ostream* os) { 416 if (IsTrue(ImplicitlyConvertible<T*, const void*>::value)) {utils/unittest/googletest/include/gtest/gtest.h
1475 T* rhs) {