Lines Matching refs:visitor
228 ReenterNodeVisitor visitor; in TEST() local
229 graph.VisitNodeUsesFromStart(&visitor); in TEST()
231 CHECK_EQ(22, static_cast<int>(visitor.nodes_.size())); in TEST()
232 CHECK_EQ(24, static_cast<int>(visitor.edges_.size())); in TEST()
234 CHECK(n0->id() == visitor.nodes_[0]); in TEST()
235 CHECK(n0->id() == visitor.edges_[0].first); in TEST()
236 CHECK(n1->id() == visitor.edges_[0].second); in TEST()
237 CHECK(n1->id() == visitor.nodes_[1]); in TEST()
239 CHECK(-n1->id() == visitor.edges_[1].second); in TEST()
240 CHECK(-n0->id() == visitor.edges_[1].first); in TEST()
241 CHECK(n0->id() == visitor.edges_[2].first); in TEST()
242 CHECK(n2->id() == visitor.edges_[2].second); in TEST()
243 CHECK(n2->id() == visitor.nodes_[2]); in TEST()
244 CHECK(n2->id() == visitor.edges_[3].first); in TEST()
245 CHECK(n3->id() == visitor.edges_[3].second); in TEST()
246 CHECK(n3->id() == visitor.nodes_[3]); in TEST()
248 CHECK(n3->id() == visitor.edges_[4].first); in TEST()
249 CHECK(n0->id() == visitor.edges_[4].second); in TEST()
250 CHECK(n0->id() == visitor.nodes_[4]); in TEST()
251 CHECK(n0->id() == visitor.edges_[5].first); in TEST()
252 CHECK(n1->id() == visitor.edges_[5].second); in TEST()
253 CHECK(n1->id() == visitor.nodes_[5]); in TEST()
255 CHECK(-n1->id() == visitor.nodes_[6]); in TEST()
256 CHECK(-n1->id() == visitor.edges_[6].second); in TEST()
257 CHECK(-n0->id() == visitor.edges_[6].first); in TEST()
258 CHECK(n0->id() == visitor.edges_[7].first); in TEST()
259 CHECK(n2->id() == visitor.edges_[7].second); in TEST()
260 CHECK(n2->id() == visitor.nodes_[7]); in TEST()
261 CHECK(n2->id() == visitor.edges_[8].first); in TEST()
262 CHECK(n3->id() == visitor.edges_[8].second); in TEST()
263 CHECK(n3->id() == visitor.nodes_[8]); in TEST()
264 CHECK(n3->id() == visitor.edges_[9].first); in TEST()
265 CHECK(n0->id() == visitor.edges_[9].second); in TEST()
266 CHECK(n0->id() == visitor.nodes_[9]); in TEST()
268 CHECK(-n0->id() == visitor.edges_[10].second); in TEST()
269 CHECK(-n3->id() == visitor.edges_[10].first); in TEST()
270 CHECK(-n3->id() == visitor.nodes_[10]); in TEST()
271 CHECK(-n3->id() == visitor.edges_[11].second); in TEST()
272 CHECK(-n2->id() == visitor.edges_[11].first); in TEST()
273 CHECK(-n2->id() == visitor.nodes_[11]); in TEST()
274 CHECK(-n2->id() == visitor.edges_[12].second); in TEST()
275 CHECK(-n0->id() == visitor.edges_[12].first); in TEST()
276 CHECK(n0->id() == visitor.edges_[13].first); in TEST()
277 CHECK(n4->id() == visitor.edges_[13].second); in TEST()
278 CHECK(n4->id() == visitor.nodes_[12]); in TEST()
279 CHECK(n4->id() == visitor.edges_[14].first); in TEST()
280 CHECK(n5->id() == visitor.edges_[14].second); in TEST()
281 CHECK(n5->id() == visitor.nodes_[13]); in TEST()
282 CHECK(-n5->id() == visitor.nodes_[14]); in TEST()
283 CHECK(-n5->id() == visitor.edges_[15].second); in TEST()
284 CHECK(-n4->id() == visitor.edges_[15].first); in TEST()
285 CHECK(-n4->id() == visitor.nodes_[15]); in TEST()
286 CHECK(-n4->id() == visitor.edges_[16].second); in TEST()
287 CHECK(-n0->id() == visitor.edges_[16].first); in TEST()
288 CHECK(-n0->id() == visitor.nodes_[16]); in TEST()
289 CHECK(-n0->id() == visitor.edges_[17].second); in TEST()
290 CHECK(-n3->id() == visitor.edges_[17].first); in TEST()
291 CHECK(-n3->id() == visitor.nodes_[17]); in TEST()
292 CHECK(-n3->id() == visitor.edges_[18].second); in TEST()
293 CHECK(-n2->id() == visitor.edges_[18].first); in TEST()
294 CHECK(-n2->id() == visitor.nodes_[18]); in TEST()
295 CHECK(-n2->id() == visitor.edges_[19].second); in TEST()
296 CHECK(-n0->id() == visitor.edges_[19].first); in TEST()
298 CHECK(n0->id() == visitor.edges_[20].first); in TEST()
299 CHECK(n4->id() == visitor.edges_[20].second); in TEST()
300 CHECK(n4->id() == visitor.nodes_[19]); in TEST()
301 CHECK(n4->id() == visitor.edges_[21].first); in TEST()
302 CHECK(n5->id() == visitor.edges_[21].second); in TEST()
303 CHECK(-n5->id() == visitor.edges_[22].second); in TEST()
304 CHECK(-n4->id() == visitor.edges_[22].first); in TEST()
305 CHECK(-n4->id() == visitor.nodes_[20]); in TEST()
306 CHECK(-n4->id() == visitor.edges_[23].second); in TEST()
307 CHECK(-n0->id() == visitor.edges_[23].first); in TEST()
308 CHECK(-n0->id() == visitor.nodes_[21]); in TEST()