Lines Matching refs:L1
70 simple_ilist<Node> L1, L2; in TEST() local
72 L1.push_back(A); in TEST()
73 L1.push_back(B); in TEST()
74 L1.swap(L2); in TEST()
75 EXPECT_TRUE(L1.empty()); in TEST()
76 EXPECT_EQ(0u, L1.size()); in TEST()
339 simple_ilist<Node> L1, L2; in TEST() local
343 L1.push_back(A); in TEST()
344 L1.push_back(D); in TEST()
351 L1.splice(--L1.end(), L2); in TEST()
353 EXPECT_EQ(4u, L1.size()); in TEST()
354 auto I = L1.begin(); in TEST()
359 EXPECT_EQ(L1.end(), I); in TEST()
363 simple_ilist<Node> L1, L2; in TEST() local
367 L1.push_back(A); in TEST()
368 L1.push_back(C); in TEST()
376 L1.splice(--L1.end(), L2, ++L2.begin()); in TEST()
377 auto I = L1.begin(); in TEST()
381 EXPECT_EQ(L1.end(), I); in TEST()
390 simple_ilist<Node> L1, L2; in TEST() local
394 L1.push_back(A); in TEST()
395 L1.push_back(D); in TEST()
404 L1.splice(--L1.end(), L2, ++L2.begin(), --L2.end()); in TEST()
405 auto I = L1.begin(); in TEST()
410 EXPECT_EQ(L1.end(), I); in TEST()
420 simple_ilist<Node> L1, L2; in TEST() local
424 L1.push_back(Ns[0]); in TEST()
425 L1.push_back(Ns[3]); in TEST()
426 L1.push_back(Ns[4]); in TEST()
427 L1.push_back(Ns[8]); in TEST()
438 EXPECT_EQ(4u, L1.size()); in TEST()
440 EXPECT_TRUE(llvm::is_sorted(L1)); 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
462 EXPECT_TRUE(L1.empty()); in TEST()
466 L1.push_back(Ns[0]); in TEST()
467 L1.push_back(Ns[3]); in TEST()
468 L1.push_back(Ns[4]); in TEST()
475 EXPECT_EQ(3u, L1.size()); in TEST()
477 EXPECT_TRUE(llvm::is_sorted(L1, makeFalse)); in TEST()
483 L1.merge(L2, makeFalse); in TEST()
485 EXPECT_FALSE(L1.empty()); in TEST()
486 EXPECT_TRUE(llvm::is_sorted(L1, makeFalse)); in TEST()
487 auto I = L1.begin(); in TEST()
493 EXPECT_EQ(L1.end(), I); in TEST()
496 L1.clear(); in TEST()
498 L2.merge(L1, makeFalse); in TEST()
499 EXPECT_TRUE(L1.empty()); in TEST()
513 simple_ilist<Node> L1, L2; in TEST() local
517 L1.push_back(Ns[0]); in TEST()
518 L1.push_back(Ns[1]); in TEST()
519 L1.push_back(Ns[2]); in TEST()
520 L1.push_back(Ns[3]); in TEST()
523 EXPECT_EQ(4u, L1.size()); in TEST()
525 EXPECT_TRUE(llvm::is_sorted(L1)); 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()
544 EXPECT_TRUE(L1.empty()); in TEST()
624 TaggedList1Type L1; in TEST() local
632 L1.push_back(Ns[I]); in TEST()
637 EXPECT_EQ(sizeof(Order1) / sizeof(int), L1.size()); in TEST()
638 auto I1 = L1.begin(); in TEST()
643 EXPECT_EQ(L1.end(), I1); in TEST()