Searched refs:children_ (Results 1 - 17 of 17) sorted by relevance

/external/webrtc/webrtc/base/
H A Dtaskparent.cc41 children_.reset(new ChildSet());
46 children_->insert(child);
52 return task->parent_ == this && children_->find(task) != children_->end();
57 for (ChildSet::iterator it = children_->begin();
58 it != children_->end();
71 if (children_->size() > 0) {
76 ChildSet copy = *children_;
95 children_->erase(child);
H A Dtaskparent.h55 scoped_ptr<ChildSet> children_; member in class:rtc::TaskParent
/external/opencv3/3rdparty/libwebp/utils/
H A Dhuffman.h27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon14969
41 return (node->children_ == 0);
47 return node + node->children_ + right_child;
H A Dhuffman.c27 node->children_ = -1; // means: 'unassigned so far'
31 return (node->children_ < 0);
41 node->children_ = (int)(children - node);
134 node += node->children_ + ((code >> code_length) & 1);
137 node->children_ = 0; // turn newly created node into a leaf.
/external/webrtc/webrtc/modules/rtp_rtcp/source/
H A Dvp8_partition_aggregator.cc34 children_[kLeftChild] = NULL;
35 children_[kRightChild] = NULL;
47 delete children_[kLeftChild];
48 delete children_[kRightChild];
68 assert(!children_[kLeftChild]);
69 children_[kLeftChild] =
72 children_[kLeftChild]->set_max_parent_size(max_parent_size_);
73 children_[kLeftChild]->set_min_parent_size(min_parent_size_);
75 children_[kLeftChild]->set_packet_start(false);
79 assert(!children_[kRightChil
[all...]
H A Dvp8_partition_aggregator.h58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; }
59 PartitionTreeNode* right_child() const { return children_[kRightChild]; }
73 PartitionTreeNode* children_[2]; member in class:webrtc::PartitionTreeNode
/external/libweave/src/notification/
H A Dxml_node.cc30 return children_;
67 for (const auto& child : children_) {
98 children_.push_back(std::move(child));
107 if (text_.empty() && children_.empty()) {
114 for (const auto& child : children_) {
H A Dxml_node.h115 std::vector<std::unique_ptr<XmlNode>> children_; member in class:weave::final
/external/v8/src/compiler/
H A Dloop-analysis.h39 const ZoneVector<Loop*>& children() const { return children_; }
52 children_(zone),
58 ZoneVector<Loop*> children_; member in class:v8::internal::compiler::LoopTree::Loop
130 parent->children_.push_back(child);
H A Dloop-analysis.cc407 for (LoopTree::Loop* child : loop->children_) SerializeLoop(child);
445 for (LoopTree::Loop* child : loop->children_) PrintLoop(child);
/external/v8/src/profiler/
H A Dallocation-tracker.cc25 for (int i = 0; i < children_.length(); i++) delete children_[i];
31 for (int i = 0; i < children_.length(); i++) {
32 AllocationTraceNode* node = children_[i];
44 children_.Add(child);
67 for (int i = 0; i < children_.length(); i++) {
68 children_[i]->Print(indent, tracker);
H A Dallocation-tracker.h39 Vector<AllocationTraceNode*> children() const { return children_.ToVector(); }
49 List<AllocationTraceNode*> children_; member in class:v8::internal::AllocationTraceNode
H A Dprofile-generator-inl.h37 children_(CodeEntriesMatch),
H A Dprofile-generator.cc153 HashMap::Entry* map_entry = children_.Lookup(entry, CodeEntryHash(entry));
161 children_.LookupOrInsert(entry, CodeEntryHash(entry));
232 for (HashMap::Entry* p = children_.Start();
234 p = children_.Next(p)) {
H A Dheap-snapshot-generator.h165 List<HeapGraphEdge*>& children() { return children_; }
194 List<HeapGraphEdge*> children_; member in class:v8::internal::HeapSnapshot
H A Dprofile-generator.h177 HashMap children_; member in class:v8::internal::ProfileNode
H A Dheap-snapshot-generator.cc343 GetMemoryUsedByList(children_) +

Completed in 905 milliseconds