| /external/chromium/chrome/browser/accessibility/ |
| D | browser_accessibility.cc | 37 DCHECK_EQ(children_[old_acc->index_in_parent_], old_acc); in ReplaceChild()
39 old_acc = children_[old_acc->index_in_parent_]; in ReplaceChild()
40 children_[old_acc->index_in_parent_] = new_acc; in ReplaceChild()
72 children_.push_back(child); in AddChild()
78 for (size_t i = 0; i < children_.size(); i++) in DetachTree()
79 children_[i]->DetachTree(nodes); in DetachTree()
80 children_.clear(); in DetachTree()
102 DCHECK(child_index < children_.size()); in GetChild()
103 return children_[child_index]; in GetChild()
108 return parent_->children_[index_in_parent_ - 1]; in GetPreviousSibling()
[all …]
|
| /external/chromium_org/ui/base/models/ |
| D | tree_node_model.h | 83 children_.insert(children_.begin() + index, node); in Add()
90 std::find(children_.begin(), children_.end(), node); in Remove()
91 DCHECK(i != children_.end()); in Remove()
93 children_.weak_erase(i); in Remove()
99 for (size_t i = 0; i < children_.size(); ++i) in RemoveAll()
100 children_[i]->parent_ = NULL; in RemoveAll()
101 children_.weak_clear(); in RemoveAll()
120 int child_count() const { return static_cast<int>(children_.size()); } in child_count()
123 bool empty() const { return children_.empty(); } in empty()
129 for (size_t i = 0; i < children_.size(); ++i) in GetTotalNodeCount()
[all …]
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| D | taskparent.cc | 55 children_.reset(new ChildSet()); in Initialize()
60 children_->insert(child); in AddChild()
66 return task->parent_ == this && children_->find(task) != children_->end(); in IsChildTask()
71 for (ChildSet::iterator it = children_->begin(); in AllChildrenDone()
72 it != children_->end(); in AllChildrenDone()
85 if (children_->size() > 0) { in AbortAllChildren()
90 ChildSet copy = *children_; in AbortAllChildren()
109 children_->erase(child); in OnChildStopped()
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| D | taskparent.cc | 55 children_.reset(new ChildSet()); in Initialize()
60 children_->insert(child); in AddChild()
66 return task->parent_ == this && children_->find(task) != children_->end(); in IsChildTask()
71 for (ChildSet::iterator it = children_->begin(); in AllChildrenDone()
72 it != children_->end(); in AllChildrenDone()
85 if (children_->size() > 0) { in AbortAllChildren()
90 ChildSet copy = *children_; in AbortAllChildren()
109 children_->erase(child); in OnChildStopped()
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| D | merger.cc | 18 children_(new IteratorWrapper[n]), in MergingIterator()
23 children_[i].Set(children[i]); in MergingIterator()
28 delete[] children_; in ~MergingIterator()
37 children_[i].SeekToFirst(); in SeekToFirst()
45 children_[i].SeekToLast(); in SeekToLast()
53 children_[i].Seek(target); in Seek()
69 IteratorWrapper* child = &children_[i]; in Next()
95 IteratorWrapper* child = &children_[i]; in Prev()
127 status = children_[i].status(); in status()
143 IteratorWrapper* children_; member in leveldb::__anon0cbb868e0111::MergingIterator
[all …]
|
| /external/chromium/chrome/browser/history/ |
| D | query_parser.cc | 135 void AddChild(QueryNode* node) { children_.push_back(node); } in AddChild()
138 QueryNodeVector* children() { return &children_; } in children()
158 QueryNodeVector children_; member in QueryNodeList
162 for (QueryNodeVector::iterator node = children_.begin(); in ~QueryNodeList()
163 node != children_.end(); ++node) in ~QueryNodeList()
168 for (size_t i = 0; i < children_.size(); ++i) { in RemoveEmptySubnodes()
169 if (children_[i]->IsWord()) in RemoveEmptySubnodes()
172 QueryNodeList* list_node = static_cast<QueryNodeList*>(children_[i]); in RemoveEmptySubnodes()
175 children_.erase(children_.begin() + i); in RemoveEmptySubnodes()
183 for (size_t i = 0; i < children_.size(); ++i) in AppendWords()
[all …]
|
| /external/chromium_org/chrome/browser/resources/print_preview/ |
| D | component.js | 37 this.children_ = []; property in anonymousFunction0958517a0100.Component
76 this.children_.forEach(function(child) {
85 this.children_.forEach(function(child) {
126 this.children_.push(child);
134 var childIdx = this.children_.indexOf(child);
136 this.children_.splice(childIdx, 1);
148 while (this.children_.length > 0) {
149 this.removeChild(this.children_[0]);
|
| /external/chromium_org/ui/v2/src/ |
| D | view.cc | 158 while (!children_.empty()) { in ~View()
159 View* child = children_.front(); in ~View()
163 DCHECK(std::find(children_.begin(), children_.end(), child) == in ~View()
164 children_.end()); in ~View()
231 RemoveChildImpl(child, &child->parent_->children_); in AddChild()
232 children_.push_back(child); in AddChild()
239 RemoveChildImpl(child, &children_); in RemoveChild()
251 if (children_.size() <= 1 || child == children_.back()) in StackChildAtTop()
253 StackChildAbove(child, children_.back()); in StackChildAtTop()
257 if (children_.size() <= 1 || child == children_.front()) in StackChildAtBottom()
[all …]
|
| /external/chromium_org/content/browser/frame_host/ |
| D | frame_tree_node.cc | 43 children_.push_back(child.release()); in AddChild()
49 for (iter = children_.begin(); iter != children_.end(); ++iter) { in RemoveChild()
54 if (iter != children_.end()) in RemoveChild()
55 children_.erase(iter); in RemoveChild()
67 children_.clear(); in ResetForMainFrame()
|
| /external/chromium_org/ui/aura/ |
| D | window.cc | 464 for (Windows::const_iterator it = children_.begin(); in SetLayoutManager()
465 it != children_.end(); in SetLayoutManager()
527 if (children_.size() <= 1 || child == children_.back()) in StackChildAtTop()
529 StackChildAbove(child, children_.back()); in StackChildAtTop()
537 if (children_.size() <= 1 || child == children_.front()) in StackChildAtBottom()
539 StackChildBelow(child, children_.front()); in StackChildAtBottom()
556 DCHECK(std::find(children_.begin(), children_.end(), child) == in AddChild()
557 children_.end()); in AddChild()
570 children_.push_back(child); in AddChild()
636 for (i = children_.begin(); i != children_.end(); ++i) { in GetChildById()
[all …]
|
| /external/chromium_org/ui/compositor/ |
| D | layer.cc | 109 for (size_t i = 0; i < children_.size(); ++i) in ~Layer()
110 children_[i]->parent_ = NULL; in ~Layer()
141 children_.push_back(child); in Add()
150 std::find(children_.begin(), children_.end(), child); in Remove()
151 DCHECK(i != children_.end()); in Remove()
152 children_.erase(i); in Remove()
158 if (children_.size() <= 1 || child == children_.back()) in StackAtTop()
160 StackAbove(child, children_.back()); in StackAtTop()
168 if (children_.size() <= 1 || child == children_.front()) in StackAtBottom()
170 StackBelow(child, children_.front()); in StackAtBottom()
[all …]
|
| /external/chromium_org/chrome/browser/history/ |
| D | query_parser.cc | 164 QueryNodeVector* children() { return &children_; } in children()
185 QueryNodeVector children_; member in QueryNodeList
194 STLDeleteElements(&children_); in ~QueryNodeList()
198 children_.push_back(node); in AddChild()
202 for (size_t i = 0; i < children_.size(); ++i) { in RemoveEmptySubnodes()
203 if (children_[i]->IsWord()) in RemoveEmptySubnodes()
206 QueryNodeList* list_node = static_cast<QueryNodeList*>(children_[i]); in RemoveEmptySubnodes()
209 children_.erase(children_.begin() + i); in RemoveEmptySubnodes()
241 for (size_t i = 0; i < children_.size(); ++i) in AppendWords()
242 children_[i]->AppendWords(words); in AppendWords()
[all …]
|
| /external/chromium_org/ui/events/test/ |
| D | test_event_target.cc | 23 children_.push_back(child.release()); in AddChild()
29 ScopedVector<TestEventTarget>::iterator iter = std::find(children_.begin(), in RemoveChild()
30 children_.end(), in RemoveChild()
32 if (iter != children_.end()) { in RemoveChild()
33 children_.weak_erase(iter); in RemoveChild()
65 new EventTargetIteratorImpl<TestEventTarget>(children_.get())); in GetChildIterator()
|
| D | test_event_target.h | 30 TestEventTarget* child_at(int index) { return children_[index]; } in child_at()
31 size_t child_count() const { return children_.size(); } in child_count()
54 ScopedVector<TestEventTarget> children_; variable
|
| /external/chromium_org/ui/accessibility/ |
| D | ax_node.h | 24 int child_count() const { return static_cast<int>(children_.size()); } in child_count()
26 const std::vector<AXNode*>& children() const { return children_; } in children()
29 AXNode* ChildAtIndex(int index) const { return children_[index]; } in ChildAtIndex()
52 std::vector<AXNode*> children_; variable
|
| /external/chromium_org/media/mp4/ |
| D | box_reader.cc | 93 if (scanned_ && !children_.empty()) { in ~BoxReader()
94 for (ChildMap::iterator itr = children_.begin(); in ~BoxReader()
95 itr != children_.end(); ++itr) { in ~BoxReader()
176 children_.insert(std::pair<FourCC, BoxReader>(child.type(), child)); in ScanChildren()
188 ChildMap::iterator itr = children_.find(child_type); in ReadChild()
189 RCHECK(itr != children_.end()); in ReadChild()
192 children_.erase(itr); in ReadChild()
197 if (!children_.count(child->BoxType())) return true; in MaybeReadChild()
|
| /external/chromium_org/chrome/browser/ui/cocoa/content_settings/ |
| D | cookie_tree_node.mm | 22 children_.reset();
41 if (!children_.get()) {
43 children_.reset([[NSMutableArray alloc] initWithCapacity:childCount]);
48 [children_ addObject:childNode.get()];
51 return children_.get();
|
| /external/chromium/chrome/browser/ui/cocoa/content_settings/ |
| D | cookie_tree_node.mm | 22 children_.reset();
41 if (!children_.get()) {
43 children_.reset([[NSMutableArray alloc] initWithCapacity:childCount]);
48 [children_ addObject:childNode.get()];
51 return children_.get();
|
| /external/chromium_org/content/browser/accessibility/ |
| D | browser_accessibility.cc | 51 return PlatformIsLeaf() ? 0 : children_.size(); in PlatformChildCount()
57 for (size_t i = 0; i < children_.size(); ++i) in DetachTree()
58 children_[i]->DetachTree(nodes); in DetachTree()
59 children_.clear(); in DetachTree()
99 children.swap(children_); in SwapChildren()
125 DCHECK(child_index < children_.size()); in PlatformGetChild()
126 return children_[child_index]; in PlatformGetChild()
131 return parent_->children_[index_in_parent_ - 1]; in GetPreviousSibling()
139 index_in_parent_ < static_cast<int>(parent_->children_.size() - 1)) { in GetNextSibling()
140 return parent_->children_[index_in_parent_ + 1]; in GetNextSibling()
[all …]
|
| /external/chromium_org/third_party/libwebp/utils/ |
| D | huffman.h | 27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member
41 return (node->children_ == 0); in HuffmanTreeNodeIsLeaf()
47 return node + node->children_ + right_child; in HuffmanTreeNextNode()
|
| /external/webp/src/utils/ |
| D | huffman.h | 27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member
41 return (node->children_ == 0); in HuffmanTreeNodeIsLeaf()
47 return node + node->children_ + right_child; in HuffmanTreeNextNode()
|
| D | huffman.c | 27 node->children_ = -1; // means: 'unassigned so far' in TreeNodeInit()
31 return (node->children_ < 0); in NodeIsEmpty()
41 node->children_ = (int)(children - node); in AssignChildren()
134 node += node->children_ + ((code >> code_length) & 1); in TreeAddSymbol()
137 node->children_ = 0; // turn newly created node into a leaf. in TreeAddSymbol()
|
| /external/chromium_org/ppapi/proxy/ |
| D | raw_var_data.cc | 546 children_.push_back(element); in AddChild()
572 for (size_t i = 0; i < children_.size(); ++i) in PopulatePPVar()
573 array_var->elements().push_back(ScopedPPVar(graph[children_[i]])); in PopulatePPVar()
578 m->WriteUInt32(static_cast<uint32_t>(children_.size())); in Write()
579 for (size_t i = 0; i < children_.size(); ++i) in Write()
580 m->WriteUInt32(static_cast<uint32_t>(children_[i])); in Write()
593 children_.push_back(index); in Read()
607 children_.push_back(make_pair(key, value)); in AddChild()
632 for (size_t i = 0; i < children_.size(); ++i) { in PopulatePPVar()
633 bool success = dictionary_var->SetWithStringKey(children_[i].first, in PopulatePPVar()
[all …]
|
| /external/chromium_org/net/disk_cache/ |
| D | mem_entry_impl.cc | 101 if (children_.get()) { in InternalDoom()
103 children.swap(*children_); in InternalDoom()
111 DCHECK(children_->empty()); in InternalDoom()
266 return (children_.get() != NULL); in CouldBeSparse()
545 if (!children_.get()) { in InitSparseInfo()
550 children_.reset(new EntryMap()); in InitSparseInfo()
554 (*children_)[0] = this; in InitSparseInfo()
583 EntryMap::iterator i = children_->find(index); in OpenChild()
584 if (i != children_->end()) { in OpenChild()
589 (*children_)[index] = child; in OpenChild()
[all …]
|
| /external/chromium/net/disk_cache/ |
| D | mem_entry_impl.cc | 84 if (children_.get()) { in InternalDoom()
86 children.swap(*children_); in InternalDoom()
94 DCHECK(children_->empty()); in InternalDoom()
254 return (children_.get() != NULL); in CouldBeSparse()
536 if (!children_.get()) { in InitSparseInfo()
541 children_.reset(new EntryMap()); in InitSparseInfo()
545 (*children_)[0] = this; in InitSparseInfo()
576 EntryMap::iterator i = children_->find(index); in OpenChild()
577 if (i != children_->end()) { in OpenChild()
582 (*children_)[index] = child; in OpenChild()
[all …]
|