Lines Matching refs:Ns
421 Node Ns[10];
424 L1.push_back(Ns[0]);
425 L1.push_back(Ns[3]);
426 L1.push_back(Ns[4]);
427 L1.push_back(Ns[8]);
430 L2.push_back(Ns[1]);
431 L2.push_back(Ns[2]);
432 L2.push_back(Ns[5]);
433 L2.push_back(Ns[6]);
434 L2.push_back(Ns[7]);
435 L2.push_back(Ns[9]);
451 for (Node &N : Ns)
459 Node Ns[5];
466 L1.push_back(Ns[0]);
467 L1.push_back(Ns[3]);
468 L1.push_back(Ns[4]);
471 L2.push_back(Ns[1]);
472 L2.push_back(Ns[2]);
488 EXPECT_EQ(&Ns[0], &*I++);
489 EXPECT_EQ(&Ns[3], &*I++);
490 EXPECT_EQ(&Ns[4], &*I++);
491 EXPECT_EQ(&Ns[1], &*I++);
492 EXPECT_EQ(&Ns[2], &*I++);
503 EXPECT_EQ(&Ns[1], &*I++);
504 EXPECT_EQ(&Ns[2], &*I++);
505 EXPECT_EQ(&Ns[0], &*I++);
506 EXPECT_EQ(&Ns[3], &*I++);
507 EXPECT_EQ(&Ns[4], &*I++);
514 Node Ns[4];
517 L1.push_back(Ns[0]);
518 L1.push_back(Ns[1]);
519 L1.push_back(Ns[2]);
520 L1.push_back(Ns[3]);
535 for (Node &N : Ns)
550 Node Ns[10];
554 L.push_back(Ns[I]);
564 for (Node &N : Ns)
571 Node Ns[10];
574 auto partition = [&](const Node &N) { return &N >= &Ns[5]; };
581 L.push_back(Ns[I]);
592 EXPECT_EQ(&Ns[O], &*I++);
594 EXPECT_EQ(&Ns[O], &*I++);
628 DoubleNode Ns[10];
632 L1.push_back(Ns[I]);
634 L2.push_back(Ns[I]);
640 EXPECT_EQ(Ns[I].getIterator1(), I1);
641 EXPECT_EQ(&Ns[I], &*I1++);
648 EXPECT_EQ(Ns[I].getIterator2(), I2);
649 EXPECT_EQ(&Ns[I], &*I2++);
