| /third_party/cef/libcef_dll/wrapper/ |
| D | cef_xml_object.cc | 276 DCHECK(children_.empty()); in SetValue()
277 if (!children_.empty()) in SetValue()
343 return !children_.empty(); in HasChildren()
348 return children_.size(); in GetChildCount()
355 ObjectVector::const_iterator it = children_.begin(); in HasChild()
356 for (; it != children_.end(); ++it) { in HasChild()
375 children_.push_back(child); in AddChild()
384 ObjectVector::iterator it = children_.begin(); in RemoveChild()
385 for (; it != children_.end(); ++it) { in RemoveChild()
387 children_.erase(it); in RemoveChild()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | scalar_analysis_nodes.h | 76 auto position = std::find_if_not(children_.begin(), children_.end(), in AddChild()
80 children_.insert(position, child); in AddChild()
99 inline SENode* GetChild(size_t index) { return children_[index]; } in GetChild()
100 inline const SENode* GetChild(size_t index) const { return children_[index]; } in GetChild()
107 iterator begin() { return children_.begin(); } in begin()
108 iterator end() { return children_.end(); } in end()
111 const_iterator begin() const { return children_.cbegin(); } in begin()
112 const_iterator end() const { return children_.cend(); } in end()
113 const_iterator cbegin() { return children_.cbegin(); } in cbegin()
114 const_iterator cend() { return children_.cend(); } in cend()
[all …]
|
| D | dominator_tree.h | 36 children_({}), in DominatorTreeNode()
50 iterator begin() { return children_.begin(); } in begin()
51 iterator end() { return children_.end(); } in end()
54 const_iterator cbegin() const { return children_.begin(); } in cbegin()
55 const_iterator cend() const { return children_.end(); } in cend()
81 std::vector<DominatorTreeNode*> children_; member
|
| D | loop_unswitch_pass.cpp | 218 loop_merge_dtn->children_.push_back(if_merge_block_dtn); in PerformUnswitch()
219 loop_merge_dtn->parent_->children_.push_back(loop_merge_dtn); in PerformUnswitch()
220 if_merge_block_dtn->parent_->children_.erase(std::find( in PerformUnswitch()
221 if_merge_block_dtn->parent_->children_.begin(), in PerformUnswitch()
222 if_merge_block_dtn->parent_->children_.end(), if_merge_block_dtn)); in PerformUnswitch()
272 if_block_dtn->children_.size() == 1 && in PerformUnswitch()
275 loop_pre_header_dtn->children_.push_back(if_block_dtn->children_[0]); in PerformUnswitch()
276 if_block_dtn->children_.clear(); in PerformUnswitch()
277 if_block_dtn->children_.push_back(loop_pre_header_dtn); in PerformUnswitch()
|
| D | redundancy_elimination.cpp | 53 for (auto dominated_bb : bb->children_) { in EliminateRedundanciesFrom()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | scalar_analysis_nodes.h | 76 auto position = std::find_if_not(children_.begin(), children_.end(), in AddChild()
80 children_.insert(position, child); in AddChild()
99 inline SENode* GetChild(size_t index) { return children_[index]; } in GetChild()
100 inline const SENode* GetChild(size_t index) const { return children_[index]; } in GetChild()
107 iterator begin() { return children_.begin(); } in begin()
108 iterator end() { return children_.end(); } in end()
111 const_iterator begin() const { return children_.cbegin(); } in begin()
112 const_iterator end() const { return children_.cend(); } in end()
113 const_iterator cbegin() { return children_.cbegin(); } in cbegin()
114 const_iterator cend() { return children_.cend(); } in cend()
[all …]
|
| D | dominator_tree.h | 36 children_({}), in DominatorTreeNode()
50 iterator begin() { return children_.begin(); } in begin()
51 iterator end() { return children_.end(); } in end()
54 const_iterator cbegin() const { return children_.begin(); } in cbegin()
55 const_iterator cend() const { return children_.end(); } in cend()
81 std::vector<DominatorTreeNode*> children_; member
|
| D | loop_unswitch_pass.cpp | 218 loop_merge_dtn->children_.push_back(if_merge_block_dtn); in PerformUnswitch()
219 loop_merge_dtn->parent_->children_.push_back(loop_merge_dtn); in PerformUnswitch()
220 if_merge_block_dtn->parent_->children_.erase(std::find( in PerformUnswitch()
221 if_merge_block_dtn->parent_->children_.begin(), in PerformUnswitch()
222 if_merge_block_dtn->parent_->children_.end(), if_merge_block_dtn)); in PerformUnswitch()
272 if_block_dtn->children_.size() == 1 && in PerformUnswitch()
275 loop_pre_header_dtn->children_.push_back(if_block_dtn->children_[0]); in PerformUnswitch()
276 if_block_dtn->children_.clear(); in PerformUnswitch()
277 if_block_dtn->children_.push_back(loop_pre_header_dtn); in PerformUnswitch()
|
| D | redundancy_elimination.cpp | 53 for (auto dominated_bb : bb->children_) { in EliminateRedundanciesFrom()
|
| /third_party/spirv-tools/source/opt/ |
| D | scalar_analysis_nodes.h | 76 auto position = std::find_if_not(children_.begin(), children_.end(), in AddChild()
80 children_.insert(position, child); in AddChild()
99 inline SENode* GetChild(size_t index) { return children_[index]; } in GetChild()
100 inline const SENode* GetChild(size_t index) const { return children_[index]; } in GetChild()
107 iterator begin() { return children_.begin(); } in begin()
108 iterator end() { return children_.end(); } in end()
111 const_iterator begin() const { return children_.cbegin(); } in begin()
112 const_iterator end() const { return children_.cend(); } in end()
113 const_iterator cbegin() { return children_.cbegin(); } in cbegin()
114 const_iterator cend() { return children_.cend(); } in cend()
[all …]
|
| D | dominator_tree.h | 36 children_({}), in DominatorTreeNode()
50 iterator begin() { return children_.begin(); } in begin()
51 iterator end() { return children_.end(); } in end()
54 const_iterator cbegin() const { return children_.begin(); } in cbegin()
55 const_iterator cend() const { return children_.end(); } in cend()
81 std::vector<DominatorTreeNode*> children_; member
|
| D | loop_unswitch_pass.cpp | 218 loop_merge_dtn->children_.push_back(if_merge_block_dtn); in PerformUnswitch()
219 loop_merge_dtn->parent_->children_.push_back(loop_merge_dtn); in PerformUnswitch()
220 if_merge_block_dtn->parent_->children_.erase(std::find( in PerformUnswitch()
221 if_merge_block_dtn->parent_->children_.begin(), in PerformUnswitch()
222 if_merge_block_dtn->parent_->children_.end(), if_merge_block_dtn)); in PerformUnswitch()
272 if_block_dtn->children_.size() == 1 && in PerformUnswitch()
275 loop_pre_header_dtn->children_.push_back(if_block_dtn->children_[0]); in PerformUnswitch()
276 if_block_dtn->children_.clear(); in PerformUnswitch()
277 if_block_dtn->children_.push_back(loop_pre_header_dtn); in PerformUnswitch()
|
| D | redundancy_elimination.cpp | 53 for (auto dominated_bb : bb->children_) { in EliminateRedundanciesFrom()
|
| D | dominator_tree.cpp | 343 second->children_.push_back(first); in InitializeTree()
358 auto getSucc = [](const DominatorTreeNode* node) { return &node->children_; }; in ResetDFNumbering()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| D | equivalence_relation.h | 100 children_[representative2].push_back(representative1); in MakeEquivalent()
120 children_[pointer_to_value] = std::vector<const T*>(); in Register()
152 for (auto child : children_[item]) { in GetEquivalenceClass()
207 children_[result].push_back(current); in Find()
209 std::find(children_[next].begin(), children_[next].end(), current); in Find()
210 assert(child_iterator != children_[next].end() && in Find()
213 children_[next].erase(child_iterator); in Find()
234 mutable std::unordered_map<const T*, std::vector<const T*>> children_; variable
|
| /third_party/spirv-tools/source/fuzz/ |
| D | equivalence_relation.h | 100 children_[representative2].push_back(representative1); in MakeEquivalent()
120 children_[pointer_to_value] = std::vector<const T*>(); in Register()
152 for (auto child : children_[item]) { in GetEquivalenceClass()
207 children_[result].push_back(current); in Find()
209 std::find(children_[next].begin(), children_[next].end(), current); in Find()
210 assert(child_iterator != children_[next].end() && in Find()
213 children_[next].erase(child_iterator); in Find()
234 mutable std::unordered_map<const T*, std::vector<const T*>> children_; variable
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | equivalence_relation.h | 100 children_[representative2].push_back(representative1); in MakeEquivalent()
120 children_[pointer_to_value] = std::vector<const T*>(); in Register()
152 for (auto child : children_[item]) { in GetEquivalenceClass()
207 children_[result].push_back(current); in Find()
209 std::find(children_[next].begin(), children_[next].end(), current); in Find()
210 assert(child_iterator != children_[next].end() && in Find()
213 children_[next].erase(child_iterator); in Find()
234 mutable std::unordered_map<const T*, std::vector<const T*>> children_; variable
|
| /third_party/typescript/tests/baselines/reference/ |
| D | conditionalTypeRelaxingConstraintAssignability.js | 16 private children_: Relax<C>,
45 function Elem(children_) { argument
46 this.children_ = children_;
|
| D | conditionalTypeRelaxingConstraintAssignability.types | 30 private children_: Relax<C>,
31 >children_ : Relax<C>
|
| D | conditionalTypeRelaxingConstraintAssignability.symbols | 43 private children_: Relax<C>,
44 >children_ : Symbol(Elem.children_, Decl(conditionalTypeRelaxingConstraintAssignability.ts, 13, 14))
|
| /third_party/protobuf/src/google/protobuf/util/internal/ |
| D | default_value_objectwriter.cc | 223 for (int i = 0; i < children_.size(); ++i) { in FindChild()
224 Node* child = children_[i]; in FindChild()
268 for (int i = 0; i < children_.size(); ++i) { in WriteChildren()
269 Node* child = children_[i]; in WriteChildren()
317 for (int i = 0; i < children_.size(); ++i) { in PopulateChildren()
318 InsertIfNotPresent(&orig_children_map, children_[i]->name_, i); in PopulateChildren()
340 new_children.push_back(children_[found->second]); in PopulateChildren()
341 children_[found->second] = nullptr; in PopulateChildren()
394 for (int i = 0; i < children_.size(); ++i) { in PopulateChildren()
395 if (children_[i] == nullptr) { in PopulateChildren()
[all …]
|
| D | default_value_objectwriter.h | 156 for (int i = 0; i < children_.size(); ++i) { in ~Node()
157 delete children_[i]; in ~Node() local
162 void AddChild(Node* child) { children_.push_back(child); } in AddChild()
188 int number_of_children() const { return children_.size(); } in number_of_children()
220 std::vector<Node*> children_; variable
|
| /third_party/node/src/inspector/ |
| D | worker_inspector.cc | 85 children_.erase(session_id); in WorkerFinished()
93 children_.emplace(session_id, info); in WorkerStarted()
115 for (const auto& worker : children_) { in SetAutoAttach()
|
| /third_party/gn/src/gn/ |
| D | xcode_object.cc | 592 for (const auto& child : children_) { in AddSourceFile()
610 for (const auto& child : children_) { in AddSourceFile()
645 for (const auto& child : children_) { in Visit()
652 for (const auto& child : children_) { in Visit()
662 PrintProperty(out, rules, "children", children_); in Print()
678 auto iter = std::lower_bound(children_.begin(), children_.end(), child, in AddChildImpl()
680 children_.insert(iter, std::move(child)); in AddChildImpl()
682 children_.push_back(std::move(child)); in AddChildImpl()
|
| /third_party/typescript/tests/cases/compiler/ |
| D | conditionalTypeRelaxingConstraintAssignability.ts | 16 private children_: Relax<C>, property in Elem
|