Lines Matching refs:Ns
421 Node Ns[10]; 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()
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()
451 for (Node &N : Ns) in TEST()
459 Node Ns[5]; in TEST() local
466 L1.push_back(Ns[0]); in TEST()
467 L1.push_back(Ns[3]); in TEST()
468 L1.push_back(Ns[4]); in TEST()
471 L2.push_back(Ns[1]); in TEST()
472 L2.push_back(Ns[2]); in TEST()
488 EXPECT_EQ(&Ns[0], &*I++); in TEST()
489 EXPECT_EQ(&Ns[3], &*I++); in TEST()
490 EXPECT_EQ(&Ns[4], &*I++); in TEST()
491 EXPECT_EQ(&Ns[1], &*I++); in TEST()
492 EXPECT_EQ(&Ns[2], &*I++); in TEST()
503 EXPECT_EQ(&Ns[1], &*I++); in TEST()
504 EXPECT_EQ(&Ns[2], &*I++); in TEST()
505 EXPECT_EQ(&Ns[0], &*I++); in TEST()
506 EXPECT_EQ(&Ns[3], &*I++); in TEST()
507 EXPECT_EQ(&Ns[4], &*I++); in TEST()
514 Node Ns[4]; 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()
535 for (Node &N : Ns) in TEST()
550 Node Ns[10]; in TEST() local
554 L.push_back(Ns[I]); in TEST()
564 for (Node &N : Ns) in TEST()
571 Node Ns[10]; in TEST() local
574 auto partition = [&](const Node &N) { return &N >= &Ns[5]; }; in TEST()
581 L.push_back(Ns[I]); in TEST()
592 EXPECT_EQ(&Ns[O], &*I++); in TEST()
594 EXPECT_EQ(&Ns[O], &*I++); in TEST()
628 DoubleNode Ns[10]; in TEST() local
632 L1.push_back(Ns[I]); in TEST()
634 L2.push_back(Ns[I]); in TEST()
640 EXPECT_EQ(Ns[I].getIterator1(), I1); in TEST()
641 EXPECT_EQ(&Ns[I], &*I1++); in TEST()
648 EXPECT_EQ(Ns[I].getIterator2(), I2); in TEST()
649 EXPECT_EQ(&Ns[I], &*I2++); in TEST()