Home
last modified time | relevance | path

Searched refs:edges_ (Results 1 - 20 of 20) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree.h69 // instance see the documentation for `edges_`.
503 // `edges_` contains all edges starting from this instance.
510 CordRep* edges_[kMaxCapacity]; member in absl::cord_internal::CordRepBtree
536 return edges_[index]; in Edge()
540 return edges_[edge_type == kFront ? begin() : back()];
544 return {edges_ + begin(), size()};
552 return {edges_ + begin, static_cast<size_t>(end - begin)};
595 tree->edges_[0] = rep; in New()
605 tree->edges_[0] = front; in New()
606 tree->edges_[ in New()
[all...]
H A Dcord_rep_btree_navigator.cc145 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
163 subtree->edges_[subtree_end++] = right; in Read()
168 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read()
176 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read()
H A Dcord_rep_btree.cc445 CordRep::Unref(edges_[idx]); in SetEdge()
457 result.tree->edges_[idx] = edge; in SetEdge()
484 leaf->edges_[end++] = flat; in NewLeaf()
503 leaf->edges_[--begin] = flat; in NewLeaf()
522 edges_[fetch_add_end(1)] = flat; in AddData()
538 edges_[sub_fetch_begin(1)] = flat; in AddData()
679 sub->edges_[begin] = MakeSubstring(CordRep::Ref(edge), offset, len); in CopySuffix()
687 sub->edges_[begin] = nsub; in CopySuffix()
730 sub->edges_[end++] = MakeSubstring(CordRep::Ref(edge), 0, n); in CopyPrefix()
739 sub->edges_[en in CopyPrefix()
[all...]
H A Dcord_rep_btree_test.cc40 node->edges_[idx] = edge; in SetEdge()
43 node->edges_[node->fetch_add_end(1)] = edge; in AddEdge()
/third_party/ninja/src/
H A Ddyndep_parser_test.cc363 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
376 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
389 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
403 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
418 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
432 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
447 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
465 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
478 DyndepFile::iterator i = dyndep_file_.find(state_.edges_[0]); in TEST_F()
488 ASSERT_EQ(2u, state_.edges_ in TEST_F()
[all...]
H A Dstate.cc91 edge->id_ = edges_.size(); in AddEdge()
92 edges_.push_back(edge); in AddEdge()
167 for (vector<Edge*>::const_iterator e = edges_.begin(); in RootNodes()
168 e != edges_.end(); ++e) { in RootNodes()
176 if (!edges_.empty() && root_nodes.empty()) in RootNodes()
189 for (vector<Edge*>::iterator e = edges_.begin(); e != edges_.end(); ++e) { in Reset()
H A Dmanifest_parser_test.cc142 Edge* edge = state.edges_[0]; in TEST_F()
160 ASSERT_EQ(2u, state.edges_.size()); in TEST_F()
161 Edge* edge = state.edges_[0]; in TEST_F()
166 edge = state.edges_[1]; in TEST_F()
183 ASSERT_EQ(2u, state.edges_.size()); in TEST_F()
184 EXPECT_EQ("cmd baz a inner", state.edges_[0]->EvaluateCommand()); in TEST_F()
185 EXPECT_EQ("cmd bar b outer", state.edges_[1]->EvaluateCommand()); in TEST_F()
229 EXPECT_EQ("$dollarbar$baz$blah", state.edges_[0]->EvaluateCommand()); in TEST_F()
231 EXPECT_EQ("'$dollar'bar$baz$blah", state.edges_[0]->EvaluateCommand()); in TEST_F()
242 EXPECT_EQ(state.edges_[ in TEST_F()
[all...]
H A Dbuild_log_test.cc56 log1.RecordCommand(state_.edges_[0], 15, 18); in TEST_F()
57 log1.RecordCommand(state_.edges_[1], 20, 25); in TEST_F()
134 log1.RecordCommand(state_.edges_[0], 15, 18); in TEST_F()
135 log1.RecordCommand(state_.edges_[1], 20, 25); in TEST_F()
154 log2.RecordCommand(state_.edges_[0], 15, 18); in TEST_F()
155 log2.RecordCommand(state_.edges_[1], 20, 25); in TEST_F()
313 log.RecordCommand(state_.edges_[0], 21, 22); in TEST_F()
344 log1.RecordCommand(state_.edges_[0], 15, 18 + i); in TEST_F()
345 log1.RecordCommand(state_.edges_[1], 21, 22); in TEST_F()
H A Dclean.cc108 for (vector<Edge*>::iterator e = state_->edges_.begin(); in CleanAll()
109 e != state_->edges_.end(); ++e) { in CleanAll()
226 for (vector<Edge*>::iterator e = state_->edges_.begin(); in DoCleanRule()
227 e != state_->edges_.end(); ++e) { in DoCleanRule()
294 for (vector<Edge*>::iterator e = state_->edges_.begin(); in LoadDyndeps()
295 e != state_->edges_.end(); ++e) { in LoadDyndeps()
H A Dtest.cc114 for (vector<Edge*>::const_iterator e = state.edges_.begin(); in VerifyGraph()
115 e != state.edges_.end(); ++e) { in VerifyGraph()
132 // The union of all in- and out-edges of each nodes should be exactly edges_. in VerifyGraph()
141 set<const Edge*> edge_set(state.edges_.begin(), state.edges_.end()); in VerifyGraph()
H A Dmanifest_parser_perftest.cc74 for (size_t i = 0; i < state.edges_.size(); ++i) in LoadManifests()
75 optimization_guard += state.edges_[i]->EvaluateCommand().size(); in LoadManifests()
H A Dninja.cc297 for (Edge* edge : state_.edges_) { in ParsePreviousElapsedTimes()
500 for (vector<Edge*>::iterator e = state->edges_.begin(); in ToolTargetsSourceList()
501 e != state->edges_.end(); ++e) { in ToolTargetsSourceList()
515 for (vector<Edge*>::iterator e = state->edges_.begin(); in ToolTargetsList()
516 e != state->edges_.end(); ++e) { in ToolTargetsList()
535 for (vector<Edge*>::iterator e = state->edges_.begin(); in ToolTargetsList()
536 e != state->edges_.end(); ++e) { in ToolTargetsList()
984 for (vector<Edge*>::iterator e = state_.edges_.begin(); in ToolCompilationDatabase()
985 e != state_.edges_.end(); ++e) { in ToolCompilationDatabase()
H A Dclean_test.cc500 log1.RecordCommand(state.edges_[0], 15, 18); in TEST_F()
501 log1.RecordCommand(state.edges_[1], 20, 25); in TEST_F()
563 log1.RecordCommand(state.edges_[0], 15, 18); in TEST_F()
564 log1.RecordCommand(state.edges_[1], 20, 25); in TEST_F()
H A Dbuild_log_perftest.cc94 log.RecordCommand(state.edges_[i], in WriteTestData()
H A Dstate.h136 std::vector<Edge*> edges_; member
H A Dbuild_test.cc979 int orig_edges = state_.edges_.size(); in TEST_F()
983 Edge* edge = state_.edges_.back(); in TEST_F()
995 ASSERT_EQ(orig_edges + 1, (int)state_.edges_.size()); in TEST_F()
1052 Edge* edge = state_.edges_.back(); in TEST_F()
1167 int orig_edges = state_.edges_.size(); in TEST_F()
1184 ASSERT_EQ(orig_edges + 1, (int)state_.edges_.size()); in TEST_F()
1186 Edge* edge = state_.edges_.back(); in TEST_F()
2995 Edge* edge = state.edges_.back(); in TEST_F()
3003 ASSERT_EQ(1u, state.edges_.size()); in TEST_F()
3148 ASSERT_EQ(1u, state.edges_ in TEST_F()
[all...]
H A Dmanifest_parser.cc359 state_->edges_.pop_back(); in ParseEdge()
/third_party/node/src/
H A Dheap_utils.cc100 edges_[from].insert(std::make_pair(name, to));
169 for (const auto& edge_info : edges_) { in CreateObject()
208 std::unordered_map<Node*, std::set<std::pair<const char*, Node*>>> edges_; member in node::heap::JSGraph
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator.h233 std::deque<HeapGraphEdge>& edges() { return edges_; } in edges()
234 const std::deque<HeapGraphEdge>& edges() const { return edges_; } in edges()
272 std::deque<HeapGraphEdge> edges_; member in v8::internal::HeapSnapshot
H A Dheap-snapshot-generator.cc2415 edges_.push_back({from, to, name});
2419 const std::vector<Edge>& edges() { return edges_; } in edges()
2423 std::vector<Edge> edges_; member in v8::internal::EmbedderGraphImpl

Completed in 26 milliseconds