| /external/libweave/src/notification/ |
| xml_node.h | 115 std::vector<std::unique_ptr<XmlNode>> children_; member in class:weave::final
|
| /external/opencv3/3rdparty/libwebp/utils/ |
| huffman.h | 27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon21916
41 return (node->children_ == 0);
47 return node + node->children_ + right_child;
|
| /external/webrtc/webrtc/base/ |
| taskparent.h | 55 scoped_ptr<ChildSet> children_; member in class:rtc::TaskParent
|
| /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/v8/src/compiler/ |
| loop-analysis.h | 39 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);
|
| /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
|
| heap-snapshot-generator.h | 165 List<HeapGraphEdge*>& children() { return children_; }
194 List<HeapGraphEdge*> children_; member in class:v8::internal::HeapSnapshot
|
| profile-generator.h | 177 HashMap 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...] |
| /art/runtime/ |
| profiler.h | 64 void AppendChild(StackTrieNode* child) { children_.insert(child); }
87 std::set<StackTrieNode*, StackTrieNodeComparator> children_; member in class:art::StackTrieNode
|
| /build/kati/ |
| dep.cc | 85 for (auto& p : children_)
95 auto p = children_.emplace(c, nullptr);
111 auto found = children_.find(name[0]);
112 if (found != children_.end()) {
119 for (const auto& c : children_)
126 unordered_map<char, RuleTrie*> children_; member in class:__anon1258::RuleTrie
|
| find.cc | 203 for (auto& p : children_) {
213 for (auto& child : children_) {
254 for (const auto& p : children_) {
270 for (const auto& p : children_) {
282 for (const auto& p : children_) {
298 children_.emplace(children_.end(), name, c);
302 vector<pair<string, DirentNode*>> children_; member in class:__anon1261::DirentDirNode
|
| /bionic/linker/ |
| linker.h | 395 soinfo_list_t children_; member in struct:soinfo
|
