Lines Matching refs:first
77 [&](const VVT &VV) { return VV.first == u; })); in graphVertexTester()
82 EXPECT_EQ(1u, V.count(VVT.first)); in graphVertexTester()
83 EXPECT_EQ(VA[VVT.first], VVT.second.VA); in graphVertexTester()
100 EXPECT_EQ(VA[u.first] * VA[u.second] * ((u.first > u.second) ? 2 : 1), in graphEdgeTester()
102 auto Pred = [&](const EVT &EV) { return EV.first == u; }; in graphEdgeTester()
109 EXPECT_EQ(1u, E.count(EV.first)); in graphEdgeTester()
110 EXPECT_EQ(VA[EV.first.first] * VA[EV.first.second] * in graphEdgeTester()
111 ((EV.first.first > EV.first.second) ? 2 : 1), in graphEdgeTester()
113 const auto &IE = G.inEdges(EV.first.second); in graphEdgeTester()
114 const auto &OE = G.outEdges(EV.first.first); in graphEdgeTester()
121 G.inEdges(EV.first.second).begin(), G.inEdges(EV.first.second).end(), in graphEdgeTester()
122 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
123 EXPECT_NE(G.inEdges(EV.first.second).end(), It); in graphEdgeTester()
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(), in graphEdgeTester()
128 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
129 EXPECT_EQ(G.inEdges(EV.first.first).end(), It); in graphEdgeTester()
133 std::find_if(G.outEdges(EV.first.second).begin(), in graphEdgeTester()
134 G.outEdges(EV.first.second).end(), in graphEdgeTester()
135 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
136 EXPECT_EQ(G.outEdges(EV.first.second).end(), It); in graphEdgeTester()
140 G.outEdges(EV.first.first).begin(), G.outEdges(EV.first.first).end(), in graphEdgeTester()
141 [&](const EVT &EVI) { return EVI.first == EV.first; }); in graphEdgeTester()
142 EXPECT_NE(G.outEdges(EV.first.first).end(), It); in graphEdgeTester()
218 EXPECT_EQ(0u, G.vertices().begin()->first); in TEST()
245 EXPECT_EQ(EI(0u, 0u), G.edges().begin()->first); in TEST()
250 EXPECT_EQ(EI(0u, 0u), G.outEdges(0u).begin()->first); in TEST()
256 EXPECT_EQ(EI(0u, 0u), G.inEdges(0u).begin()->first); in TEST()