Lines Matching refs:u3
46 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
55 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
58 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
59 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
60 ASSERT_TRUE(u2 == u3->next); in TEST_F()
61 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
65 ASSERT_TRUE(head == u3); in TEST_F()
71 ASSERT_TRUE(u3 == u1->prev); in TEST_F()
74 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
75 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
76 ASSERT_TRUE(u1 == u3->next); in TEST_F()
77 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
85 ASSERT_TRUE(head == u3); in TEST_F()
94 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
103 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
106 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
107 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
108 ASSERT_TRUE(u2 == u3->next); in TEST_F()
109 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
113 ASSERT_TRUE(head == u3); in TEST_F()
124 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
127 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
128 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
129 ASSERT_TRUE(u2 == u3->next); in TEST_F()
130 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
133 ASSERT_TRUE(head == u3); in TEST_F()
142 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
151 ASSERT_TRUE(u3 == u2->prev); in TEST_F()
154 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
155 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
156 ASSERT_TRUE(u2 == u3->next); in TEST_F()
157 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
161 ASSERT_TRUE(head == u3); in TEST_F()
163 graph.erase(*u3); in TEST_F()
165 ASSERT_TRUE(NULL == u3->first_in); in TEST_F()
166 ASSERT_TRUE(NULL == u3->first_out); in TEST_F()
167 ASSERT_TRUE(NULL == u3->prev); in TEST_F()
168 ASSERT_TRUE(NULL == u3->next); in TEST_F()
191 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
194 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
195 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
198 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
199 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
203 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == a3); in TEST_F()
212 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
216 ListDigraph::Arc* a3 = graph.addArc(*u1, *u3); in TEST_F()
220 ASSERT_TRUE(u1 == a3->source && u3 == a3->target); in TEST_F()
224 ASSERT_TRUE(u3->first_in == a3 && u3->first_out == NULL); in TEST_F()
233 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
236 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
237 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
242 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
248 ASSERT_TRUE(u3->first_in == NULL && u3->first_out == a3); in TEST_F()
261 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
264 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
265 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
269 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
270 ASSERT_TRUE(u3 == a3->source && u1 == a3->target); in TEST_F()
288 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
291 ListDigraph::Arc* a2 = graph.addArc(*u2, *u3); in TEST_F()
292 ListDigraph::Arc* a3 = graph.addArc(*u3, *u1); in TEST_F()
297 ASSERT_TRUE(u2 == a2->source && u3 == a2->target); in TEST_F()
303 ASSERT_TRUE(u3->first_in == a2 && u3->first_out == NULL); in TEST_F()
315 ListDigraph::Node* u3 = graph.addNode(); in TEST_F() local
319 graph.addArc(*u1, *u3); in TEST_F()
324 ASSERT_TRUE(u3->first_in == NULL); in TEST_F()