Lines Matching refs:Trivial
50 FoldingSet<TrivialPair> Trivial;
53 Trivial.InsertNode(&T);
58 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos);
64 FoldingSet<TrivialPair> Trivial;
68 Trivial.InsertNode(&T);
73 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos);
79 FoldingSet<TrivialPair> Trivial;
82 Trivial.InsertNode(&T);
83 EXPECT_EQ(Trivial.size(), 1U);
85 bool WasThere = Trivial.RemoveNode(&T);
87 EXPECT_EQ(0U, Trivial.size());
91 FoldingSet<TrivialPair> Trivial;
94 bool WasThere = Trivial.RemoveNode(&T);
96 EXPECT_EQ(0U, Trivial.size());
100 FoldingSet<TrivialPair> Trivial;
103 TrivialPair *N = Trivial.GetOrInsertNode(&T);
108 FoldingSet<TrivialPair> Trivial;
112 Trivial.InsertNode(&T);
113 TrivialPair *N = Trivial.GetOrInsertNode(&T2);
118 FoldingSet<TrivialPair> Trivial;
124 Trivial.FindNodeOrInsertPos(ID, InsertPos);
127 Trivial.InsertNode(&T, InsertPos);
128 EXPECT_EQ(1U, Trivial.size());
132 FoldingSet<TrivialPair> Trivial;
133 EXPECT_TRUE(Trivial.empty());
137 FoldingSet<TrivialPair> Trivial;
139 Trivial.InsertNode(&T);
140 EXPECT_FALSE(Trivial.empty());
144 FoldingSet<TrivialPair> Trivial;
145 Trivial.clear();
146 EXPECT_TRUE(Trivial.empty());
150 FoldingSet<TrivialPair> Trivial;
152 Trivial.InsertNode(&T);
153 Trivial.clear();
154 EXPECT_TRUE(Trivial.empty());
158 FoldingSet<TrivialPair> Trivial;
159 auto OldCapacity = Trivial.capacity();
160 Trivial.reserve(OldCapacity + 1);
161 EXPECT_GE(Trivial.capacity(), OldCapacity + 1);
165 FoldingSet<TrivialPair> Trivial;
166 auto OldCapacity = Trivial.capacity();
167 Trivial.reserve(OldCapacity - 1);
168 EXPECT_EQ(Trivial.capacity(), OldCapacity);
