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