Searched refs:TrivialPair (Results 1 – 2 of 2) sorted by relevance
/external/llvm/unittests/ADT/ |
D | FoldingSet.cpp | 38 struct TrivialPair : public FoldingSetNode { struct 41 TrivialPair(unsigned K, unsigned V) : FoldingSetNode(), Key(K), Value(V) {} in TrivialPair() function 50 FoldingSet<TrivialPair> Trivial; in TEST() 52 TrivialPair T(99, 42); in TEST() 58 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos); in TEST() 64 FoldingSet<TrivialPair> Trivial; in TEST() 66 TrivialPair S(100, 42); in TEST() 67 TrivialPair T(99, 42); in TEST() 73 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos); in TEST() 79 FoldingSet<TrivialPair> Trivial; in TEST() [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
D | FoldingSet.cpp | 59 struct TrivialPair : public FoldingSetNode { struct 62 TrivialPair(unsigned K, unsigned V) : FoldingSetNode(), Key(K), Value(V) {} in TrivialPair() argument 71 FoldingSet<TrivialPair> Trivial; in TEST() 73 TrivialPair T(99, 42); in TEST() 79 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos); in TEST() 85 FoldingSet<TrivialPair> Trivial; in TEST() 87 TrivialPair S(100, 42); in TEST() 88 TrivialPair T(99, 42); in TEST() 94 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos); in TEST() 100 FoldingSet<TrivialPair> Trivial; in TEST() [all …]
|