Lines Matching refs:L
18 bool operator<(const Node &L, const Node &R) { return &L < &R; } in operator <() argument
25 simple_ilist<Node> L; in TEST() local
26 EXPECT_EQ(L.begin(), L.end()); in TEST()
27 EXPECT_TRUE(L.empty()); in TEST()
28 EXPECT_EQ(0u, L.size()); in TEST()
32 simple_ilist<Node> L; in TEST() local
34 L.push_front(B); in TEST()
35 L.push_front(A); in TEST()
36 EXPECT_EQ(&A, &L.front()); in TEST()
37 EXPECT_EQ(&B, &L.back()); in TEST()
38 EXPECT_FALSE(L.empty()); in TEST()
39 EXPECT_EQ(2u, L.size()); in TEST()
42 L.pop_front(); in TEST()
43 EXPECT_EQ(&B, &L.front()); in TEST()
46 L.pop_front(); in TEST()
47 EXPECT_TRUE(L.empty()); in TEST()
51 simple_ilist<Node> L; in TEST() local
53 L.push_back(A); in TEST()
54 L.push_back(B); in TEST()
55 EXPECT_EQ(&A, &L.front()); in TEST()
56 EXPECT_EQ(&B, &L.back()); in TEST()
57 EXPECT_FALSE(L.empty()); in TEST()
58 EXPECT_EQ(2u, L.size()); in TEST()
61 L.pop_back(); in TEST()
62 EXPECT_EQ(&A, &L.back()); in TEST()
65 L.pop_back(); in TEST()
66 EXPECT_TRUE(L.empty()); in TEST()
84 simple_ilist<Node> L; in TEST() local
86 L.insert(L.end(), A); in TEST()
87 L.insert(L.end(), B); in TEST()
88 EXPECT_EQ(&A, &L.front()); in TEST()
89 EXPECT_EQ(&B, &L.back()); in TEST()
90 EXPECT_FALSE(L.empty()); in TEST()
91 EXPECT_EQ(2u, L.size()); in TEST()
95 simple_ilist<Node> L; in TEST() local
97 L.insert(L.begin(), B); in TEST()
98 L.insert(L.begin(), A); in TEST()
99 EXPECT_EQ(&A, &L.front()); in TEST()
100 EXPECT_EQ(&B, &L.back()); in TEST()
101 EXPECT_FALSE(L.empty()); in TEST()
102 EXPECT_EQ(2u, L.size()); in TEST()
106 simple_ilist<Node> L; in TEST() local
108 L.push_back(A); in TEST()
109 L.push_back(B); in TEST()
110 L.push_back(C); in TEST()
111 EXPECT_EQ(&A, &L.front()); in TEST()
112 EXPECT_EQ(&B, &*++L.begin()); in TEST()
113 EXPECT_EQ(&C, &L.back()); in TEST()
114 EXPECT_EQ(3u, L.size()); in TEST()
116 L.remove(B); in TEST()
117 EXPECT_EQ(&A, &L.front()); in TEST()
118 EXPECT_EQ(&C, &L.back()); in TEST()
119 EXPECT_EQ(2u, L.size()); in TEST()
121 L.remove(A); in TEST()
122 EXPECT_EQ(&C, &L.front()); in TEST()
123 EXPECT_EQ(1u, L.size()); in TEST()
125 L.remove(C); in TEST()
126 EXPECT_TRUE(L.empty()); in TEST()
130 simple_ilist<Node> L; in TEST() local
133 L.push_back(A); in TEST()
134 L.push_back(*B); in TEST()
135 L.push_back(C); in TEST()
136 EXPECT_EQ(&A, &L.front()); in TEST()
137 EXPECT_EQ(B, &*++L.begin()); in TEST()
138 EXPECT_EQ(&C, &L.back()); in TEST()
139 EXPECT_EQ(3u, L.size()); in TEST()
141 L.removeAndDispose(*B, deleteNode()); in TEST()
142 EXPECT_EQ(&A, &L.front()); in TEST()
143 EXPECT_EQ(&C, &L.back()); in TEST()
144 EXPECT_EQ(2u, L.size()); in TEST()
148 simple_ilist<Node> L; in TEST() local
150 L.push_back(A); in TEST()
151 L.push_back(B); in TEST()
152 L.push_back(C); in TEST()
153 EXPECT_EQ(&A, &L.front()); in TEST()
154 EXPECT_EQ(&B, &*++L.begin()); in TEST()
155 EXPECT_EQ(&C, &L.back()); in TEST()
156 EXPECT_EQ(3u, L.size()); in TEST()
158 L.removeAndDispose(B, doNothing); in TEST()
159 EXPECT_EQ(&A, &L.front()); in TEST()
160 EXPECT_EQ(&C, &L.back()); in TEST()
161 EXPECT_EQ(2u, L.size()); in TEST()
165 simple_ilist<Node> L; in TEST() local
167 L.push_back(A); in TEST()
168 L.push_back(B); in TEST()
169 L.push_back(C); in TEST()
170 EXPECT_EQ(&A, &L.front()); in TEST()
171 EXPECT_EQ(&B, &*++L.begin()); in TEST()
172 EXPECT_EQ(&C, &L.back()); in TEST()
173 EXPECT_EQ(3u, L.size()); in TEST()
175 EXPECT_EQ(C.getIterator(), L.erase(B.getIterator())); in TEST()
176 EXPECT_EQ(&A, &L.front()); in TEST()
177 EXPECT_EQ(&C, &L.back()); in TEST()
178 EXPECT_EQ(2u, L.size()); in TEST()
182 simple_ilist<Node> L; in TEST() local
184 L.push_back(A); in TEST()
185 L.push_back(B); in TEST()
186 L.push_back(C); in TEST()
188 auto ReverseIter = L.rbegin(); in TEST()
195 EXPECT_EQ(L.rend(), ReverseIter); in TEST()
199 simple_ilist<Node> L; in TEST() local
202 L.push_back(A); in TEST()
203 L.push_back(*B); in TEST()
204 L.push_back(C); in TEST()
205 EXPECT_EQ(&A, &L.front()); in TEST()
206 EXPECT_EQ(B, &*++L.begin()); in TEST()
207 EXPECT_EQ(&C, &L.back()); in TEST()
208 EXPECT_EQ(3u, L.size()); in TEST()
210 L.eraseAndDispose(B->getIterator(), deleteNode()); in TEST()
211 EXPECT_EQ(&A, &L.front()); in TEST()
212 EXPECT_EQ(&C, &L.back()); in TEST()
213 EXPECT_EQ(2u, L.size()); in TEST()
217 simple_ilist<Node> L; in TEST() local
219 L.push_back(A); in TEST()
220 L.push_back(B); in TEST()
221 L.push_back(C); in TEST()
222 EXPECT_EQ(&A, &L.front()); in TEST()
223 EXPECT_EQ(&B, &*++L.begin()); in TEST()
224 EXPECT_EQ(&C, &L.back()); in TEST()
225 EXPECT_EQ(3u, L.size()); in TEST()
227 L.eraseAndDispose(B.getIterator(), doNothing); in TEST()
228 EXPECT_EQ(&A, &L.front()); in TEST()
229 EXPECT_EQ(&C, &L.back()); in TEST()
230 EXPECT_EQ(2u, L.size()); in TEST()
234 simple_ilist<Node> L; in TEST() local
236 L.push_back(A); in TEST()
237 L.push_back(B); in TEST()
238 L.push_back(C); in TEST()
239 L.push_back(D); in TEST()
240 L.push_back(E); in TEST()
241 auto I = L.begin(); in TEST()
247 EXPECT_EQ(L.end(), I); in TEST()
248 EXPECT_EQ(5u, L.size()); in TEST()
251 EXPECT_EQ(E.getIterator(), L.erase(B.getIterator(), E.getIterator())); in TEST()
252 EXPECT_EQ(&A, &L.front()); in TEST()
253 EXPECT_EQ(&E, &L.back()); in TEST()
254 EXPECT_EQ(2u, L.size()); in TEST()
258 simple_ilist<Node> L; in TEST() local
260 L.push_back(A); in TEST()
261 L.push_back(*B); in TEST()
262 L.push_back(*C); in TEST()
263 L.push_back(*D); in TEST()
264 L.push_back(E); in TEST()
265 auto I = L.begin(); in TEST()
271 EXPECT_EQ(L.end(), I); in TEST()
272 EXPECT_EQ(5u, L.size()); in TEST()
276 L.eraseAndDispose(B->getIterator(), E.getIterator(), deleteNode())); in TEST()
277 EXPECT_EQ(&A, &L.front()); in TEST()
278 EXPECT_EQ(&E, &L.back()); in TEST()
279 EXPECT_EQ(2u, L.size()); in TEST()
283 simple_ilist<Node> L; in TEST() local
285 L.push_back(A); in TEST()
286 L.push_back(B); in TEST()
287 L.push_back(C); in TEST()
288 L.push_back(D); in TEST()
289 L.push_back(E); in TEST()
290 auto I = L.begin(); in TEST()
296 EXPECT_EQ(L.end(), I); in TEST()
297 EXPECT_EQ(5u, L.size()); in TEST()
301 L.eraseAndDispose(B.getIterator(), E.getIterator(), doNothing)); in TEST()
302 EXPECT_EQ(&A, &L.front()); in TEST()
303 EXPECT_EQ(&E, &L.back()); in TEST()
304 EXPECT_EQ(2u, L.size()); in TEST()
308 simple_ilist<Node> L; in TEST() local
310 L.push_back(A); in TEST()
311 L.push_back(B); in TEST()
312 L.clear(); in TEST()
313 EXPECT_TRUE(L.empty()); in TEST()
314 EXPECT_EQ(0u, L.size()); in TEST()
318 simple_ilist<Node> L; in TEST() local
321 L.push_back(*A); in TEST()
322 L.push_back(*B); in TEST()
323 L.clearAndDispose(deleteNode()); in TEST()
324 EXPECT_TRUE(L.empty()); in TEST()
325 EXPECT_EQ(0u, L.size()); in TEST()
329 simple_ilist<Node> L; in TEST() local
331 L.push_back(A); in TEST()
332 L.push_back(B); in TEST()
333 L.clearAndDispose(doNothing); in TEST()
334 EXPECT_TRUE(L.empty()); in TEST()
335 EXPECT_EQ(0u, L.size()); in TEST()
549 simple_ilist<Node> L; in TEST() local
554 L.push_back(Ns[I]); in TEST()
557 EXPECT_EQ(10u, L.size()); in TEST()
558 EXPECT_FALSE(llvm::is_sorted(L)); in TEST()
561 L.sort(); in TEST()
562 EXPECT_TRUE(llvm::is_sorted(L)); in TEST()
563 auto I = L.begin(); in TEST()
566 EXPECT_EQ(L.end(), I); in TEST()
570 simple_ilist<Node> L; in TEST() local
575 auto compare = [&](const Node &L, const Node &R) { in TEST() argument
576 return partition(L) < partition(R); in TEST()
581 L.push_back(Ns[I]); in TEST()
584 EXPECT_EQ(10u, L.size()); in TEST()
585 EXPECT_FALSE(llvm::is_sorted(L, compare)); in TEST()
588 L.sort(compare); in TEST()
589 EXPECT_TRUE(llvm::is_sorted(L, compare)); in TEST()
590 auto I = L.begin(); in TEST()
595 EXPECT_EQ(L.end(), I); in TEST()
599 simple_ilist<Node> L; in TEST() local
600 L.sort(); in TEST()