OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:children_
(Results
1 - 21
of
21
) sorted by null
/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/webp/src/utils/
huffman.h
25
int
children_
; // delta offset to both children (contiguous) or 0 if leaf.
member in struct:__anon16614
39
return (node->
children_
== 0);
45
return node + node->
children_
+ right_child;
huffman.c
25
node->
children_
= -1; // means: 'unassigned so far'
29
return (node->
children_
< 0);
39
node->
children_
= (int)(children - node);
132
node += node->
children_
+ ((code >> code_length) & 1);
135
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
browser_accessibility_win.cc
138
if (!target->
children_
.empty())
139
result = target->
children_
.front();
142
if (!target->
children_
.empty())
143
result = target->
children_
.back();
188
*child_count =
children_
.size();
819
*num_children =
children_
.size();
966
if (
children_
.size()) {
967
*node =
children_
[0]->toBrowserAccessibilityWin()->NewReference();
982
if (
children_
.size()) {
983
*node =
children_
[children_.size() - 1]->toBrowserAccessibilityWin()-
[
all
...]
accessibility_win_browsertest.cc
95
AccessibleCheckerVector
children_
;
member in class:__anon3237::AccessibleChecker
236
children_
.push_back(expected_child);
306
ASSERT_EQ(child_count,
children_
.size());
316
for (AccessibleCheckerVector::iterator child_checker =
children_
.begin();
317
child_checker !=
children_
.end();
/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/chrome/browser/extensions/
extension_menu_manager.h
113
const List& children() { return
children_
; }
116
int child_count() const { return
children_
.size(); }
188
List
children_
;
member in class:ExtensionMenuItem
extension_menu_manager.cc
38
STLDeleteElements(&
children_
);
43
for (List::iterator i =
children_
.begin(); i !=
children_
.end(); ++i) {
47
children_
.erase(i);
60
for (List::iterator i =
children_
.begin(); i !=
children_
.end(); ++i) {
66
STLDeleteElements(&
children_
);
91
children_
.push_back(item);
/external/v8/src/
global-handles.h
88
malloc(OFFSET_OF(ImplicitRefGroup,
children_
[length])));
91
CopyWords(group->
children_
, children, static_cast<int>(length));
101
Object**
children_
[1]; // Variable sized array.
member in class:v8::internal::ImplicitRefGroup
profile-generator-inl.h
77
children_
(CodeEntriesMatch) {
profile-generator.cc
218
children_
.Lookup(entry, CodeEntryHash(entry), false);
226
children_
.Lookup(entry, CodeEntryHash(entry), true);
257
for (HashMap::Entry* p =
children_
.Start();
259
p =
children_
.Next(p)) {
[
all
...]
profile-generator.h
171
HashMap
children_
;
member in class:v8::internal::ProfileNode
[
all
...]
mark-compact.cc
[
all
...]
/external/chromium/net/disk_cache/
mem_entry_impl.cc
84
if (
children_
.get()) {
86
children.swap(*
children_
);
94
DCHECK(
children_
->empty());
254
return (
children_
.get() != NULL);
536
if (!
children_
.get()) {
541
children_
.reset(new EntryMap());
545
(*
children_
)[0] = this;
576
EntryMap::iterator i =
children_
->find(index);
577
if (i !=
children_
->end()) {
582
(*
children_
)[index] = child
[
all
...]
mem_entry_impl.h
176
scoped_ptr<EntryMap>
children_
;
member in class:disk_cache::MemEntryImpl
/external/chromium/chrome/browser/ui/cocoa/bookmarks/
bookmark_editor_base_controller.h
120
NSMutableArray*
children_
;
variable
Completed in 874 milliseconds