• Home
  • Raw
  • Download

Lines Matching refs:nodes_

28     nodes_.push_back(node);  in Pre()
31 std::vector<Node*> nodes_; member in PreNodeVisitor
39 nodes_.push_back(node); in Post()
42 std::vector<Node*> nodes_; member in PostNodeVisitor
52 CHECK_EQ(1, static_cast<int>(node_visitor.nodes_.size())); in TEST()
67 CHECK_EQ(5, static_cast<int>(node_visitor.nodes_.size())); in TEST()
68 CHECK(graph.start()->id() == node_visitor.nodes_[0]->id()); in TEST()
69 CHECK(n2->id() == node_visitor.nodes_[1]->id()); in TEST()
70 CHECK(n3->id() == node_visitor.nodes_[2]->id()); in TEST()
71 CHECK(n4->id() == node_visitor.nodes_[3]->id()); in TEST()
72 CHECK(n5->id() == node_visitor.nodes_[4]->id()); in TEST()
86 CHECK_EQ(5, static_cast<int>(node_visitor.nodes_.size())); in TEST()
87 CHECK(n5->id() == node_visitor.nodes_[0]->id()); in TEST()
88 CHECK(n4->id() == node_visitor.nodes_[1]->id()); in TEST()
89 CHECK(n2->id() == node_visitor.nodes_[2]->id()); in TEST()
90 CHECK(graph.start()->id() == node_visitor.nodes_[3]->id()); in TEST()
91 CHECK(n3->id() == node_visitor.nodes_[4]->id()); in TEST()
110 CHECK_EQ(8, static_cast<int>(node_visitor.nodes_.size())); in TEST()
111 CHECK(graph.end()->id() == node_visitor.nodes_[0]->id()); in TEST()
112 CHECK(n4->id() == node_visitor.nodes_[1]->id()); in TEST()
113 CHECK(n5->id() == node_visitor.nodes_[2]->id()); in TEST()
114 CHECK(n6->id() == node_visitor.nodes_[3]->id()); in TEST()
115 CHECK(n2->id() == node_visitor.nodes_[4]->id()); in TEST()
116 CHECK(n7->id() == node_visitor.nodes_[5]->id()); in TEST()
117 CHECK(n3->id() == node_visitor.nodes_[6]->id()); in TEST()
118 CHECK(graph.start()->id() == node_visitor.nodes_[7]->id()); in TEST()
141 CHECK_EQ(12, static_cast<int>(node_visitor.nodes_.size())); in TEST()
142 CHECK(graph.end()->id() == node_visitor.nodes_[0]->id()); in TEST()
143 CHECK(n4->id() == node_visitor.nodes_[1]->id()); in TEST()
144 CHECK(n8->id() == node_visitor.nodes_[2]->id()); in TEST()
145 CHECK(n10->id() == node_visitor.nodes_[3]->id()); in TEST()
146 CHECK(n11->id() == node_visitor.nodes_[4]->id()); in TEST()
147 CHECK(n9->id() == node_visitor.nodes_[5]->id()); in TEST()
148 CHECK(n5->id() == node_visitor.nodes_[6]->id()); in TEST()
149 CHECK(n2->id() == node_visitor.nodes_[7]->id()); in TEST()
150 CHECK(n6->id() == node_visitor.nodes_[8]->id()); in TEST()
151 CHECK(n7->id() == node_visitor.nodes_[9]->id()); in TEST()
152 CHECK(n3->id() == node_visitor.nodes_[10]->id()); in TEST()
153 CHECK(graph.start()->id() == node_visitor.nodes_[11]->id()); in TEST()
169 CHECK_EQ(3, static_cast<int>(node_visitor.nodes_.size())); in TEST()
170 CHECK(n0->id() == node_visitor.nodes_[0]->id()); in TEST()
171 CHECK(n1->id() == node_visitor.nodes_[1]->id()); in TEST()
172 CHECK(n2->id() == node_visitor.nodes_[2]->id()); in TEST()
178 printf("[%d] PRE NODE: %d\n", static_cast<int>(nodes_.size()), node->id()); in Pre()
179 nodes_.push_back(node->id()); in Pre()
180 int size = static_cast<int>(nodes_.size()); in Pre()
193 printf("[%d] POST NODE: %d\n", static_cast<int>(nodes_.size()), node->id()); in Post()
194 nodes_.push_back(-node->id()); in Post()
211 std::vector<int> nodes_; member
231 CHECK_EQ(22, static_cast<int>(visitor.nodes_.size())); in TEST()
234 CHECK(n0->id() == visitor.nodes_[0]); in TEST()
237 CHECK(n1->id() == visitor.nodes_[1]); in TEST()
243 CHECK(n2->id() == visitor.nodes_[2]); in TEST()
246 CHECK(n3->id() == visitor.nodes_[3]); in TEST()
250 CHECK(n0->id() == visitor.nodes_[4]); in TEST()
253 CHECK(n1->id() == visitor.nodes_[5]); in TEST()
255 CHECK(-n1->id() == visitor.nodes_[6]); in TEST()
260 CHECK(n2->id() == visitor.nodes_[7]); in TEST()
263 CHECK(n3->id() == visitor.nodes_[8]); in TEST()
266 CHECK(n0->id() == visitor.nodes_[9]); in TEST()
270 CHECK(-n3->id() == visitor.nodes_[10]); in TEST()
273 CHECK(-n2->id() == visitor.nodes_[11]); in TEST()
278 CHECK(n4->id() == visitor.nodes_[12]); in TEST()
281 CHECK(n5->id() == visitor.nodes_[13]); in TEST()
282 CHECK(-n5->id() == visitor.nodes_[14]); in TEST()
285 CHECK(-n4->id() == visitor.nodes_[15]); in TEST()
288 CHECK(-n0->id() == visitor.nodes_[16]); in TEST()
291 CHECK(-n3->id() == visitor.nodes_[17]); in TEST()
294 CHECK(-n2->id() == visitor.nodes_[18]); in TEST()
300 CHECK(n4->id() == visitor.nodes_[19]); in TEST()
305 CHECK(-n4->id() == visitor.nodes_[20]); in TEST()
308 CHECK(-n0->id() == visitor.nodes_[21]); in TEST()