Lines Matching defs:l2
29 std::list<int> l2(a2, a2+1);
30 l1.splice(l1.end(), l2, l2.begin());
33 assert(l2.size() == 0);
34 assert(distance(l2.begin(), l2.end()) == 0);
40 std::list<int> l2(a2, a2+2);
41 l1.splice(l1.end(), l2, l2.begin());
44 assert(l2.size() == 1);
45 assert(distance(l2.begin(), l2.end()) == 1);
48 i = l2.begin();
53 std::list<int> l2(a2, a2+2);
54 l1.splice(l1.end(), l2, next(l2.begin()));
57 assert(l2.size() == 1);
58 assert(distance(l2.begin(), l2.end()) == 1);
61 i = l2.begin();
66 std::list<int> l2(a2, a2+3);
67 l1.splice(l1.end(), l2, l2.begin());
70 assert(l2.size() == 2);
71 assert(distance(l2.begin(), l2.end()) == 2);
74 i = l2.begin();
81 std::list<int> l2(a2, a2+3);
82 l1.splice(l1.end(), l2, next(l2.begin()));
85 assert(l2.size() == 2);
86 assert(distance(l2.begin(), l2.end()) == 2);
89 i = l2.begin();
96 std::list<int> l2(a2, a2+3);
97 l1.splice(l1.end(), l2, next(l2.begin(), 2));
100 assert(l2.size() == 2);
101 assert(distance(l2.begin(), l2.end()) == 2);
104 i = l2.begin();
119 std::list<int> l2(a2, a2+1);
120 l1.splice(l1.begin(), l2, l2.begin());
123 assert(l2.size() == 0);
124 assert(distance(l2.begin(), l2.end()) == 0);
132 std::list<int> l2(a2, a2+1);
133 l1.splice(next(l1.begin()), l2, l2.begin());
136 assert(l2.size() == 0);
137 assert(distance(l2.begin(), l2.end()) == 0);
194 std::list<int, min_allocator<int>> l2(a2, a2+1);
195 l1.splice(l1.end(), l2, l2.begin());
198 assert(l2.size() == 0);
199 assert(distance(l2.begin(), l2.end()) == 0);
205 std::list<int, min_allocator<int>> l2(a2, a2+2);
206 l1.splice(l1.end(), l2, l2.begin());
209 assert(l2.size() == 1);
210 assert(distance(l2.begin(), l2.end()) == 1);
213 i = l2.begin();
218 std::list<int, min_allocator<int>> l2(a2, a2+2);
219 l1.splice(l1.end(), l2, next(l2.begin()));
222 assert(l2.size() == 1);
223 assert(distance(l2.begin(), l2.end()) == 1);
226 i = l2.begin();
231 std::list<int, min_allocator<int>> l2(a2, a2+3);
232 l1.splice(l1.end(), l2, l2.begin());
235 assert(l2.size() == 2);
236 assert(distance(l2.begin(), l2.end()) == 2);
239 i = l2.begin();
246 std::list<int, min_allocator<int>> l2(a2, a2+3);
247 l1.splice(l1.end(), l2, next(l2.begin()));
250 assert(l2.size() == 2);
251 assert(distance(l2.begin(), l2.end()) == 2);
254 i = l2.begin();
261 std::list<int, min_allocator<int>> l2(a2, a2+3);
262 l1.splice(l1.end(), l2, next(l2.begin(), 2));
265 assert(l2.size() == 2);
266 assert(distance(l2.begin(), l2.end()) == 2);
269 i = l2.begin();
284 std::list<int, min_allocator<int>> l2(a2, a2+1);
285 l1.splice(l1.begin(), l2, l2.begin());
288 assert(l2.size() == 0);
289 assert(distance(l2.begin(), l2.end()) == 0);
297 std::list<int, min_allocator<int>> l2(a2, a2+1);
298 l1.splice(next(l1.begin()), l2, l2.begin());
301 assert(l2.size() == 0);
302 assert(distance(l2.begin(), l2.end()) == 0);
