70   simple_ilist<Node> L1, L2;  in TEST()  local
74   L1.swap(L2);  in TEST()
77   EXPECT_EQ(&A, &L2.front());  in TEST()
78   EXPECT_EQ(&B, &L2.back());  in TEST()
79   EXPECT_FALSE(L2.empty());  in TEST()
80   EXPECT_EQ(2u, L2.size());  in TEST()
339   simple_ilist<Node> L1, L2;  in TEST()  local
347   L2.push_back(B);  in TEST()
348   L2.push_back(C);  in TEST()
351   L1.splice(--L1.end(), L2);  in TEST()
352   EXPECT_TRUE(L2.empty());  in TEST()
363   simple_ilist<Node> L1, L2;  in TEST()  local
371   L2.push_back(D);  in TEST()
372   L2.push_back(B);  in TEST()
373   L2.push_back(E);  in TEST()
376   L1.splice(--L1.end(), L2, ++L2.begin());  in TEST()
383   I = L2.begin();  in TEST()
386   EXPECT_EQ(L2.end(), I);  in TEST()
390   simple_ilist<Node> L1, L2;  in TEST()  local
398   L2.push_back(E);  in TEST()
399   L2.push_back(B);  in TEST()
400   L2.push_back(C);  in TEST()
401   L2.push_back(F);  in TEST()
404   L1.splice(--L1.end(), L2, ++L2.begin(), --L2.end());  in TEST()
412   I = L2.begin();  in TEST()
415   EXPECT_EQ(L2.end(), I);  in TEST()
420     simple_ilist<Node> L1, L2;  in TEST()  local
430     L2.push_back(Ns[1]);  in TEST()
431     L2.push_back(Ns[2]);  in TEST()
432     L2.push_back(Ns[5]);  in TEST()
433     L2.push_back(Ns[6]);  in TEST()
434     L2.push_back(Ns[7]);  in TEST()
435     L2.push_back(Ns[9]);  in TEST()
439     EXPECT_EQ(6u, L2.size());  in TEST()
441     EXPECT_TRUE(llvm::is_sorted(L2));  in TEST()
444     auto &LHS = IsL1LHS ? L1 : L2;  in TEST()
445     auto &RHS = IsL1LHS ? L2 : L1;  in TEST()
458   simple_ilist<Node> L1, L2;  in TEST()  local
463     EXPECT_TRUE(L2.empty());  in TEST()
471     L2.push_back(Ns[1]);  in TEST()
472     L2.push_back(Ns[2]);  in TEST()
476     EXPECT_EQ(2u, L2.size());  in TEST()
478     EXPECT_TRUE(llvm::is_sorted(L2, makeFalse));  in TEST()
483   L1.merge(L2, makeFalse);  in TEST()
484   EXPECT_TRUE(L2.empty());  in TEST()
498   L2.merge(L1, makeFalse);  in TEST()
500   EXPECT_FALSE(L2.empty());  in TEST()
501   EXPECT_TRUE(llvm::is_sorted(L2, makeFalse));  in TEST()
502   I = L2.begin();  in TEST()
508   EXPECT_EQ(L2.end(), I);  in TEST()
513     simple_ilist<Node> L1, L2;  in TEST()  local
524     EXPECT_TRUE(L2.empty());  in TEST()
528     auto &LHS = IsL1LHS ? L1 : L2;  in TEST()
529     auto &RHS = IsL1LHS ? L2 : L1;  in TEST()
542   simple_ilist<Node> L1, L2;  in TEST()  local
543   L1.merge(L2);  in TEST()
545   EXPECT_TRUE(L2.empty());  in TEST()
625   TaggedList2Type L2;  in TEST()  local
634     L2.push_back(Ns[I]);  in TEST()
645   EXPECT_EQ(sizeof(Order2) / sizeof(int), L2.size());  in TEST()
646   auto I2 = L2.begin();  in TEST()
651   EXPECT_EQ(L2.end(), I2);  in TEST()