• Home
  • Raw
  • Download

Lines Matching refs:Trivial

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