/external/chromium_org/content/browser/web_contents/ |
frame_tree_node.cc | 22 children_.push_back(child); 28 for (iter = children_.begin(); iter != children_.end(); ++iter) { 33 if (iter != children_.end()) 34 children_.erase(iter);
|
frame_tree_node.h | 39 return children_.size(); 43 return children_[index]; 63 ScopedVector<FrameTreeNode> children_; member in class:content::FrameTreeNode
|
/external/chromium/third_party/libjingle/source/talk/base/ |
taskparent.cc | 55 children_.reset(new ChildSet()); 60 children_->insert(child); 66 return task->parent_ == this && children_->find(task) != children_->end(); 71 for (ChildSet::iterator it = children_->begin(); 72 it != children_->end(); 85 if (children_->size() > 0) { 90 ChildSet copy = *children_; 109 children_->erase(child);
|
taskparent.h | 82 scoped_ptr<ChildSet> children_; member in class:talk_base::TaskParent
|
/external/chromium_org/third_party/libjingle/source/talk/base/ |
taskparent.cc | 55 children_.reset(new ChildSet()); 60 children_->insert(child); 66 return task->parent_ == this && children_->find(task) != children_->end(); 71 for (ChildSet::iterator it = children_->begin(); 72 it != children_->end(); 85 if (children_->size() > 0) { 90 ChildSet copy = *children_; 109 children_->erase(child);
|
taskparent.h | 72 scoped_ptr<ChildSet> children_; member in class:talk_base::TaskParent
|
/external/chromium_org/third_party/libwebp/utils/ |
huffman.h | 27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon14031 41 return (node->children_ == 0); 47 return node + node->children_ + right_child;
|
huffman.c | 27 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/webp/src/utils/ |
huffman.h | 27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon30397 41 return (node->children_ == 0); 47 return node + node->children_ + right_child;
|
huffman.c | 27 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/chromium/chrome/browser/accessibility/ |
browser_accessibility.cc | 37 DCHECK_EQ(children_[old_acc->index_in_parent_], old_acc); 39 old_acc = children_[old_acc->index_in_parent_]; 40 children_[old_acc->index_in_parent_] = new_acc; 72 children_.push_back(child); 78 for (size_t i = 0; i < children_.size(); i++) 79 children_[i]->DetachTree(nodes); 80 children_.clear(); 102 DCHECK(child_index < children_.size()); 103 return children_[child_index]; 108 return parent_->children_[index_in_parent_ - 1] [all...] |
browser_accessibility.h | 81 uint32 child_count() const { return children_.size(); } 140 return children_; 198 std::vector<BrowserAccessibility*> children_; member in class:BrowserAccessibility
|
browser_accessibility_cocoa.h | 24 scoped_nsobject<NSMutableArray> children_; variable
|
/external/chromium_org/ui/base/models/ |
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_.size()); 180 ScopedVector<NodeType> children_; member in class:ui::TreeNode [all...] |
/external/chromium_org/third_party/leveldatabase/src/table/ |
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::__anon13675::MergingIterator [all...] |
/external/chromium_org/content/browser/accessibility/ |
browser_accessibility.cc | 48 for (size_t i = 0; i < children_.size(); i++) 49 children_[i]->DetachTree(nodes); 50 children_.clear(); 92 children.swap(children_); 117 DCHECK(child_index < children_.size()); 118 return children_[child_index]; 123 return parent_->children_[index_in_parent_ - 1]; 131 index_in_parent_ < static_cast<int>(parent_->children_.size() - 1)) { 132 return parent_->children_[index_in_parent_ + 1]; 193 for (int i = children_.size() - 1; i >= 0; --i) [all...] |
/external/chromium/chrome/browser/history/ |
query_parser.cc | 135 void AddChild(QueryNode* node) { children_.push_back(node); } 138 QueryNodeVector* children() { return &children_; } 158 QueryNodeVector children_; member in class:QueryNodeList 162 for (QueryNodeVector::iterator node = children_.begin(); 163 node != children_.end(); ++node) 168 for (size_t i = 0; i < children_.size(); ++i) { 169 if (children_[i]->IsWord()) 172 QueryNodeList* list_node = static_cast<QueryNodeList*>(children_[i]); 175 children_.erase(children_.begin() + i) [all...] |
/external/chromium/chrome/browser/ui/cocoa/content_settings/ |
cookie_tree_node.h | 13 scoped_nsobject<NSMutableArray> children_; variable
|
/external/chromium_org/chrome/browser/history/ |
query_parser.cc | 164 QueryNodeVector* children() { return &children_; } 185 QueryNodeVector children_; member in class:QueryNodeList 194 STLDeleteElements(&children_); 198 children_.push_back(node); 202 for (size_t i = 0; i < children_.size(); ++i) { 203 if (children_[i]->IsWord()) 206 QueryNodeList* list_node = static_cast<QueryNodeList*>(children_[i]); 209 children_.erase(children_.begin() + i); 241 for (size_t i = 0; i < children_.size(); ++i [all...] |
/external/chromium_org/ui/aura/ |
window.cc | 81 while (!children_.empty()) { 82 Window* child = children_[0]; 85 // Deleting the child so remove it from out children_ list. 86 DCHECK(std::find(children_.begin(), children_.end(), child) == 87 children_.end()); 305 for (Windows::const_iterator it = children_.begin(); 306 it != children_.end(); 360 if (children_.size() <= 1 || child == children_.back() [all...] |
/external/chromium_org/chrome/browser/ui/cocoa/content_settings/ |
cookie_tree_node.h | 13 base::scoped_nsobject<NSMutableArray> children_; variable
|
/external/chromium_org/ui/compositor/ |
layer.cc | 109 for (size_t i = 0; i < children_.size(); ++i) 110 children_[i]->parent_ = NULL; 141 children_.push_back(child); 150 std::find(children_.begin(), children_.end(), child); 151 DCHECK(i != children_.end()); 152 children_.erase(i); 158 if (children_.size() <= 1 || child == children_.back()) 160 StackAbove(child, children_.back()) [all...] |
/external/chromium_org/media/mp4/ |
box_reader.cc | 93 if (scanned_ && !children_.empty()) { 94 for (ChildMap::iterator itr = children_.begin(); 95 itr != children_.end(); ++itr) { 176 children_.insert(std::pair<FourCC, BoxReader>(child.type(), child)); 188 ChildMap::iterator itr = children_.find(child_type); 189 RCHECK(itr != children_.end()); 192 children_.erase(itr); 197 if (!children_.count(child->BoxType())) return true;
|
box_reader.h | 160 ChildMap children_; member in class:media::mp4::BoxReader 178 ChildMap::iterator start_itr = children_.lower_bound(child_type); 179 ChildMap::iterator end_itr = children_.upper_bound(child_type); 186 children_.erase(start_itr, end_itr);
|
/external/chromium_org/ppapi/proxy/ |
raw_var_data.cc | 543 children_.push_back(element); 569 for (size_t i = 0; i < children_.size(); ++i) 570 array_var->elements().push_back(ScopedPPVar(graph[children_[i]])); 575 m->WriteUInt32(static_cast<uint32_t>(children_.size())); 576 for (size_t i = 0; i < children_.size(); ++i) 577 m->WriteUInt32(static_cast<uint32_t>(children_[i])); 590 children_.push_back(index); 604 children_.push_back(make_pair(key, value)); 629 for (size_t i = 0; i < children_.size(); ++i) { 630 bool success = dictionary_var->SetWithStringKey(children_[i].first [all...] |