/external/webrtc/webrtc/base/ |
taskparent.h | 55 scoped_ptr<ChildSet> children_; member in class:rtc::TaskParent
|
/frameworks/base/tools/aapt2/ |
DominatorTree.h | 65 return children_; 76 std::vector<std::unique_ptr<Node>> children_; member in class:aapt::DominatorTree::Node
|
/frameworks/native/services/vr/performanced/ |
cpu_set.h | 54 std::vector<std::unique_ptr<CpuSet>> children_; member in class:android::dvr::CpuSet
|
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
vp8_partition_aggregator.h | 58 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/protobuf/src/google/protobuf/util/internal/ |
default_value_objectwriter.h | 141 for (int i = 0; i < children_.size(); ++i) { 142 delete children_[i]; 147 void AddChild(Node* child) { children_.push_back(child); } 173 int number_of_children() const { return children_.size(); } 191 // Calls WriteTo() on every child in children_. 205 std::vector<Node*> children_; member in class:google::protobuf::util::converter::DefaultValueObjectWriter::Node
|
/external/v8/src/compiler/ |
loop-analysis.h | 40 const ZoneVector<Loop*>& children() const { return children_; } 54 children_(zone), 61 ZoneVector<Loop*> children_; member in class:v8::internal::compiler::LoopTree::Loop 142 parent->children_.push_back(child);
|
/external/v8/src/profiler/ |
allocation-tracker.h | 39 Vector<AllocationTraceNode*> children() const { return children_.ToVector(); } 49 List<AllocationTraceNode*> children_; member in class:v8::internal::AllocationTraceNode
|
sampling-heap-profiler.h | 83 for (auto child : children_) { 110 std::map<FunctionId, AllocationNode*> children_; member in class:v8::internal::SamplingHeapProfiler::AllocationNode
|
heap-snapshot-generator.h | 167 std::deque<HeapGraphEdge*>& children() { return children_; } 196 std::deque<HeapGraphEdge*> children_; member in class:v8::internal::HeapSnapshot
|
profile-generator.h | 214 base::CustomMatcherHashMap children_; member in class:v8::internal::ProfileNode
|
/toolchain/binutils/binutils-2.25/gold/ |
arm-reloc-property.h | 170 : is_leaf_(true), name_(name), children_() 177 : is_leaf_(false), name_(), children_() 180 this->children_.push_back(*p); 185 for(size_t i = 0; i <this->children_.size(); ++i) 186 delete this->children_[i]; 207 return this->children_.size(); 214 gold_assert(!this->is_leaf_ && i < this->children_.size()); 215 return this->children_[i]; 233 for(size_t i = 0; i <this->children_.size(); ++i) 234 s = s + " " + this->children_[i]->s_expression() 244 Tree_node_vector children_; member in class:gold::Arm_reloc_property::Tree_node [all...] |
/bionic/linker/ |
linker_soinfo.h | 298 soinfo_list_t children_; member in struct:soinfo
|
/build/kati/ |
dep.cc | 86 for (auto& p : children_) 96 auto p = children_.emplace(c, nullptr); 112 auto found = children_.find(name[0]); 113 if (found != children_.end()) { 120 for (const auto& c : children_) 127 unordered_map<char, RuleTrie*> children_; member in class:__anon1404::RuleTrie
|
find.cc | 245 for (auto& p : children_) { 255 for (auto& child : children_) { 295 for (const auto& p : children_) { 324 for (const auto& p : children_) { 336 for (const auto& p : children_) { 352 children_.emplace(children_.end(), name, c); 356 vector<pair<string, DirentNode*>> children_; member in class:__anon1407::DirentDirNode
|