Lines Matching refs:u3
41 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
50 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
53 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
54 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
55 ASSERT_TRUE(u2 == u3->next); in TEST_F()
56 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
60 ASSERT_TRUE(head == u3); in TEST_F()
66 ASSERT_TRUE(u3 == u1->prev); in TEST_F()
69 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
70 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
71 ASSERT_TRUE(u1 == u3->next); in TEST_F()
72 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
80 ASSERT_TRUE(head == u3); in TEST_F()
88 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
97 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
100 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
101 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
102 ASSERT_TRUE(u2 == u3->next); in TEST_F()
103 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
107 ASSERT_TRUE(head == u3); in TEST_F()
118 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
121 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
122 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
123 ASSERT_TRUE(u2 == u3->next); in TEST_F()
124 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
127 ASSERT_TRUE(head == u3); in TEST_F()
135 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
144 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
147 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
148 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
149 ASSERT_TRUE(u2 == u3->next); in TEST_F()
150 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
154 ASSERT_TRUE(head == u3); in TEST_F()
156 graph.erase(*u3); in TEST_F()
158 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
159 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
160 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
161 ASSERT_TRUE(NULL == u3->next); in TEST_F()
182 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
185 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
186 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
189 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
190 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
194 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == a3); in TEST_F()
202 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
206 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3); in TEST_F()
210 ASSERT_TRUE(u1 == a3->source && u3 == a3->target); in TEST_F()
214 ASSERT_TRUE(u3->first_in == a3 && u3->first_out == NULL); in TEST_F()
222 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
225 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
226 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
231 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
237 ASSERT_TRUE(u3->first_in == NULL && u3->first_out == a3); in TEST_F()
248 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
251 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
252 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
256 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
257 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
274 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
277 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
278 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
283 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
289 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == NULL); in TEST_F()
300 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
304 graph.addArc(*u1, *u3); in TEST_F()
309 ASSERT_TRUE(u3->first_in == NULL); in TEST_F()