/external/chromium_org/third_party/webrtc/base/ |
H A D | taskparent.cc | 38 children_.reset(new ChildSet()); 43 children_->insert(child); 49 return task->parent_ == this && children_->find(task) != children_->end(); 54 for (ChildSet::iterator it = children_->begin(); 55 it != children_->end(); 68 if (children_->size() > 0) { 73 ChildSet copy = *children_; 92 children_->erase(child);
|
H A D | taskparent.h | 55 scoped_ptr<ChildSet> children_; member in class:rtc::TaskParent
|
/external/chromium_org/mojo/services/view_manager/ |
H A D | server_view.cc | 18 while (!children_.empty()) 19 children_.front()->parent()->Remove(children_.front()); 33 if (children_.size() == 1) 35 Reorder(child, children_.back(), ORDER_DIRECTION_ABOVE); 45 children_.push_back(child); 66 DCHECK_GT(children_.size(), 1u); 67 children_.erase(std::find(children_.begin(), children_ [all...] |
/external/chromium_org/chrome/browser/resources/print_preview/ |
H A D | component.js | 37 this.children_ = []; 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/accessibility/ |
H A D | ax_node.h | 24 int child_count() const { return static_cast<int>(children_.size()); } 26 const std::vector<AXNode*>& children() const { return children_; } 30 AXNode* ChildAtIndex(int index) const { return children_[index]; } 61 std::vector<AXNode*> children_; member in class:ui::AXNode
|
H A D | ax_node.cc | 31 children.swap(children_);
|
/external/chromium_org/content/browser/frame_host/ |
H A D | frame_tree_node.cc | 59 children_.push_back(child.release()); 65 for (iter = children_.begin(); iter != children_.end(); ++iter) { 70 if (iter != children_.end()) { 74 children_.weak_erase(iter); 89 ScopedVector<FrameTreeNode> old_children = children_.Pass();
|
H A D | frame_tree_node.h | 73 return children_.size(); 79 return children_[index]; 108 // must be declared before |children_| so that it gets deleted after them. 126 ScopedVector<FrameTreeNode> children_; member in class:content::FrameTreeNode
|
/external/chromium_org/ui/base/models/ |
H A D | tree_node_model.h | 83 children_.insert(children_.begin() + index, node); 90 std::find(children_.begin(), children_.end(), node); 91 DCHECK(i != children_.end()); 93 children_.weak_erase(i); 99 for (size_t i = 0; i < children_.size(); ++i) 100 children_[i]->parent_ = NULL; 101 children_.weak_clear(); 120 int child_count() const { return static_cast<int>(children_ 180 ScopedVector<NodeType> children_; member in class:ui::TreeNode [all...] |
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | merger.cc | 18 children_(new IteratorWrapper[n]), 23 children_[i].Set(children[i]); 28 delete[] children_; 37 children_[i].SeekToFirst(); 45 children_[i].SeekToLast(); 53 children_[i].Seek(target); 69 IteratorWrapper* child = &children_[i]; 95 IteratorWrapper* child = &children_[i]; 127 status = children_[i].status(); 143 IteratorWrapper* children_; member in class:leveldb::__anon12461::MergingIterator [all...] |
/external/chromium_org/third_party/libwebp/utils/ |
H A D | huffman.h | 28 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon13297 55 return node->children_; 61 return node + node->children_ + right_child;
|
/external/webp/src/utils/ |
H A D | huffman.h | 28 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon33394 55 return node->children_; 61 return node + node->children_ + right_child;
|
/external/chromium_org/ui/events/test/ |
H A D | test_event_target.cc | 26 children_.push_back(child.release()); 32 ScopedVector<TestEventTarget>::iterator iter = std::find(children_.begin(), 33 children_.end(), 35 if (iter != children_.end()) { 36 children_.weak_erase(iter); 68 new EventTargetIteratorImpl<TestEventTarget>(children_.get()));
|
H A D | test_event_target.h | 38 TestEventTarget* child_at(int index) { return children_[index]; } 39 size_t child_count() const { return children_.size(); } 69 ScopedVector<TestEventTarget> children_; member in class:ui::test::TestEventTarget
|
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.cc | 33 children_[kLeftChild] = NULL; 34 children_[kRightChild] = NULL; 47 delete children_[kLeftChild]; 48 delete children_[kRightChild]; 69 assert(!children_[kLeftChild]); 70 children_[kLeftChild] = 75 children_[kLeftChild]->set_max_parent_size(max_parent_size_); 76 children_[kLeftChild]->set_min_parent_size(min_parent_size_); 78 children_[kLeftChild]->set_packet_start(false); 82 assert(!children_[kRightChil [all...] |
H A D | vp8_partition_aggregator.h | 58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; } 59 PartitionTreeNode* right_child() const { return children_[kRightChild]; } 72 PartitionTreeNode* children_[2]; member in class:webrtc::PartitionTreeNode
|
/external/chromium_org/ui/gfx/geometry/ |
H A D | r_tree_base.cc | 106 for (Nodes::const_iterator i = children_.begin(); i != children_.end(); ++i) 111 for (Nodes::const_iterator i = children_.begin(); i != children_.end(); ++i) 117 DCHECK_LE(number_to_remove, children_.size()); 119 std::partial_sort(children_.begin(), 120 children_.begin() + number_to_remove, 121 children_.end(), 126 nodes->end(), children_.begin(), children_ [all...] |
/external/chromium_org/ui/v2/src/ |
H A D | view.cc | 158 while (!children_.empty()) { 159 View* child = children_.front(); 163 DCHECK(std::find(children_.begin(), children_.end(), child) == 164 children_.end()); 231 RemoveChildImpl(child, &child->parent_->children_); 232 children_.push_back(child); 239 RemoveChildImpl(child, &children_); 251 if (children_.size() <= 1 || child == children_ [all...] |
/external/chromium_org/ui/aura/ |
H A D | window.cc | 423 for (Windows::const_iterator it = children_.begin(); 424 it != children_.end(); 501 if (children_.size() <= 1 || child == children_.back()) 503 StackChildAbove(child, children_.back()); 511 if (children_.size() <= 1 || child == children_.front()) 513 StackChildBelow(child, children_.front()); 530 DCHECK(std::find(children_.begin(), children_ [all...] |
/external/chromium_org/components/query_parser/ |
H A D | query_parser.cc | 153 QueryNodeStarVector* children() { return &children_; } 173 QueryNodeStarVector children_; member in class:query_parser::QueryNodeList 182 STLDeleteElements(&children_); 186 children_.push_back(node); 190 for (size_t i = 0; i < children_.size(); ++i) { 191 if (children_[i]->IsWord()) 194 QueryNodeList* list_node = static_cast<QueryNodeList*>(children_[i]); 197 children_.erase(children_.begin() + i); 229 for (size_t i = 0; i < children_ [all...] |
/external/chromium_org/ui/compositor/ |
H A D | layer.cc | 122 for (size_t i = 0; i < children_.size(); ++i) 123 children_[i]->parent_ = NULL; 164 children_.push_back(child); 185 std::find(children_.begin(), children_.end(), child); 186 DCHECK(i != children_.end()); 187 children_.erase(i); 193 if (children_.size() <= 1 || child == children_.back()) 195 StackAbove(child, children_ [all...] |
/external/chromium_org/chrome/browser/ui/cocoa/content_settings/ |
H A D | cookie_tree_node.h | 13 base::scoped_nsobject<NSMutableArray> children_; variable
|
/external/chromium_org/media/formats/mp4/ |
H A D | box_reader.cc | 93 if (scanned_ && !children_.empty()) { 94 for (ChildMap::iterator itr = children_.begin(); 95 itr != children_.end(); ++itr) { 178 children_.insert(std::pair<FourCC, BoxReader>(child.type(), child)); 189 return children_.count(child->BoxType()) > 0; 196 ChildMap::iterator itr = children_.find(child_type); 197 RCHECK(itr != children_.end()); 200 children_.erase(itr); 205 if (!children_.count(child->BoxType())) return true;
|
/external/chromium_org/mojo/services/public/cpp/view_manager/lib/ |
H A D | view.cc | 200 while (!children_.empty()) { 201 View* child = children_.front(); 204 children_.erase(children_.begin()); 207 DCHECK(std::find(children_.begin(), children_.end(), child) == 208 children_.end()); 259 Reorder(parent_->children_.back(), ORDER_DIRECTION_ABOVE); 263 Reorder(parent_->children_.front(), ORDER_DIRECTION_BELOW); 290 Children::const_iterator it = children_ [all...] |
/external/chromium_org/ppapi/proxy/ |
H A D | raw_var_data.cc | 546 children_.push_back(element); 572 for (size_t i = 0; i < children_.size(); ++i) 573 array_var->elements().push_back(ScopedPPVar(graph[children_[i]])); 578 m->WriteUInt32(static_cast<uint32_t>(children_.size())); 579 for (size_t i = 0; i < children_.size(); ++i) 580 m->WriteUInt32(static_cast<uint32_t>(children_[i])); 593 children_.push_back(index); 607 children_.push_back(make_pair(key, value)); 632 for (size_t i = 0; i < children_.size(); ++i) { 633 bool success = dictionary_var->SetWithStringKey(children_[ [all...] |