Searched refs:children (Results 1 - 25 of 965) sorted by relevance

1234567891011>>

/external/chromium_org/tools/grit/grit/tool/
H A Drc2grd_unittest.py121 result.children[2].children[2].children[0].attrs['desc'] == '')
123 result.children[2].children[2].children[0].children[0].attrs['name'] == 'USERNAME')
125 result.children[2].children[2].children[
[all...]
H A Dpostprocess_unittest.py42 result.children[2].children[2].children[0].attrs['name'] == 'SMART_STRING_1')
44 result.children[2].children[2].children[1].attrs['name'] == 'SMART_STRING_2')
53 messages = grdnode.children[2].children[2]
54 for node in messages.children:
/external/chromium-trace/trace-viewer/src/tcmalloc/
H A Dheap_test.js78 var childKeys = Object.keys(heap.children);
80 // Both methods exist as children.
85 var trace = heap.children['TestObject::TestMethod'];
89 assertEquals(1, Object.keys(trace.children).length);
90 assertNotNull(trace.children['(here)']);
93 trace = heap.children['TestObject2::TestMethod2'];
97 // Two children, "(here)" and another stack.
98 assertEquals(2, Object.keys(trace.children).length);
99 assertNotNull(trace.children['TestObject3::TestMethod3']);
100 assertNotNull(trace.children['(her
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DBaseTree.java34 * actually have any user data. ANTLR v3 uses a list of children approach
36 * an empty node whose children represent the list. An empty, but
40 protected List children; field in class:BaseTree
46 * as there are no fields other than the children list, which cannot
47 * be copied as the children are not considered part of this node.
53 if ( children==null || i>=children.size() ) {
56 return (Tree)children.get(i);
59 /** Get the children internal List; note that if you directly mess with
63 return children;
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextension_bookmarks_unittest.cc38 ListValue* children; local
39 tree->GetList(keys::kChildrenKey, &children);
40 ASSERT_EQ(3U, children->GetSize());
48 ListValue* children; local
49 tree->GetList(keys::kChildrenKey, &children);
50 ASSERT_EQ(1U, children->GetSize());
58 ListValue* children; local
59 tree->GetList(keys::kChildrenKey, &children);
60 ASSERT_EQ(4U, children->GetSize());
62 ASSERT_TRUE(children
73 ListValue* children; local
[all...]
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DBaseTree.js2 * actually have any user data. ANTLR v3 uses a list of children approach
4 * an empty node whose children represent the list. An empty, but
13 if ( !this.children || i>=this.children.length ) {
16 return this.children[i];
19 /** Get the children internal List; note that if you directly mess with
23 return this.children;
28 for (i = 0; this.children && i < this.children.length; i++) {
29 t = this.children[
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A DTopDownProfileDataGridTree.js34 var hasChildren = !!(profileNode.children && profileNode.children.length);
38 this._remainingChildren = profileNode.children;
44 var children = this._remainingChildren;
45 var childrenLength = children.length;
48 this.appendChild(new WebInspector.TopDownProfileDataGridNode(children[i], this.tree));
60 var children = this.children;
61 var index = this.children.length;
64 children[inde
[all...]
H A DProfileDataGridTree.js134 // If the grid node is collapsed, then don't sort children (save operation for later).
137 if (gridNode.children.length)
144 var children = gridNode.children;
145 var childCount = children.length;
148 children.sort(comparator);
151 children[childIndex]._recalculateSiblings(childIndex);
153 gridNodeGroups.push(children);
238 this._savedChildren = this.children.slice();
253 var children
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/scene/
H A DNode.java53 * node maintains a collection of children and handles merging said children
55 * allows for any number of children to be attached.
67 * This node's children.
69 protected SafeArrayList<Spatial> children = new SafeArrayList<Spatial>(Spatial.class); field in class:Node
79 * list for containing children.
91 * <code>getQuantity</code> returns the number of children this node
94 * @return the number of children this node maintains.
97 return children.size();
103 for (Spatial child : children
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DBaseTree.cs41 * actually have any user data. ANTLR v3 uses a list of children approach
43 * an empty node whose children represent the list. An empty, but
49 List<ITree> children; field in class:Antlr.Runtime.Tree.BaseTree
56 * as there are no fields other than the children list, which cannot
57 * be copied as the children are not considered part of this node.
64 * Get the children internal List; note that if you directly mess with
70 return children;
145 if (children == null || i >= children.Count)
148 return children[
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DAntlrRuntime_BaseTreeDebugView.cs54 ITree[] children = new ITree[_tree.Children.Count];
55 _tree.Children.CopyTo(children, 0);
56 return children;
/external/chromium_org/third_party/WebKit/Source/web/painting/
H A DContinuousPainter.cpp54 const Vector<GraphicsLayer*>& children = layer->children(); local
56 for (it = children.begin(); it != children.end(); ++it)
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DCompositeGrammarTree.java35 protected List<CompositeGrammarTree> children; field in class:CompositeGrammarTree
50 if ( children==null ) {
51 children = new ArrayList<CompositeGrammarTree>();
53 children.add(t);
62 for (int i = 0; r==null && children!=null && i < children.size(); i++) {
63 CompositeGrammarTree child = children.get(i);
93 for (int i = 0; n==null && children!=null && i < children.size(); i++) {
94 CompositeGrammarTree child = children
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3basetree.c75 tree->children = NULL;
101 if (tree->children != NULL)
103 cs = tree->children->size(tree->children);
106 t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i));
121 if ( tree->children == NULL
122 || i >= tree->children->size(tree->children))
126 return tree->children
[all...]
/external/chromium_org/sync/syncable/
H A Dparent_child_index.cc60 OrderedChildSet* children = NULL; local
63 children = i->second;
65 children = new OrderedChildSet();
66 parent_children_map_.insert(std::make_pair(parent_id, children));
69 return children->insert(entry).second;
80 OrderedChildSet* children = parent->second; local
81 OrderedChildSet::iterator j = children->find(e);
82 DCHECK(j != children->end());
84 children->erase(j);
85 if (children
98 const OrderedChildSet* children = parent->second; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DWrapContentsInDummySpanCommand.cpp44 Vector<RefPtr<Node> > children; local
46 children.append(child);
48 size_t size = children.size();
50 m_dummySpan->appendChild(children[i].release(), IGNORE_EXCEPTION);
69 Vector<RefPtr<Node> > children;
71 children.append(child);
73 size_t size = children.size();
75 m_element->appendChild(children[i].release(), IGNORE_EXCEPTION);
H A DRemoveNodePreservingChildrenCommand.cpp44 Vector<RefPtr<Node> > children; local
46 children.append(child);
48 size_t size = children.size();
50 RefPtr<Node> child = children[i].release();
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderMedia.h41 RenderObject* firstChild() const { ASSERT(children() == virtualChildren()); return children()->firstChild(); }
42 RenderObject* lastChild() const { ASSERT(children() == virtualChildren()); return children()->lastChild(); }
44 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::RenderMedia
45 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::RenderMedia
53 virtual RenderObjectChildList* virtualChildren() OVERRIDE FINAL { return children(); }
54 virtual const RenderObjectChildList* virtualChildren() const OVERRIDE FINAL { return children(); }
56 // FIXME: RenderMedia::layout makes assumptions about what children are allowed
/external/chromium_org/ui/compositor/test/
H A Dtest_layers.cc14 for (std::vector<Layer*>::const_iterator it = parent.children().begin();
15 it != parent.children().end(); ++it) {
/external/clang/bindings/python/tests/cindex/
H A Dutil.py42 children = []
44 children = source.get_children()
47 children = source.cursor.get_children()
49 for cursor in children:
53 # Recurse into children.
70 children = []
72 children = source.get_children()
75 children = source.cursor.get_children()
77 for cursor in children:
81 # Recurse into children
[all...]
/external/chromium/chrome/browser/resources/shared/js/cr/ui/
H A Dmenu.js29 // Decorate the children as menu items.
30 var children = this.children;
31 for (var i = 0, child; child = children[i]; i++) {
73 return this.children[this.selectedIndex];
76 var index = Array.prototype.indexOf.call(this.children, item);
91 var children = self.children;
92 var len = children.length;
100 item = children[
[all...]
/external/chromium-trace/trace-viewer/src/tracing/analysis/
H A Danalysis_results_test.js37 assertEquals('false_value', node.children[0].innerText);
38 assertEquals('false', node.children[1].innerText);
43 assertEquals('true_value', node.children[0].innerText);
44 assertEquals('true', node.children[1].innerText);
49 assertEquals('string_value', node.children[0].innerText);
50 assertEquals('"a string"', node.children[1].innerText);
55 assertEquals('number_value', node.children[0].innerText);
56 assertEquals('12345', node.children[1].innerText);
61 assertEquals('undefined', node.children[0].innerText);
62 assertEquals('', node.children[
[all...]
/external/chromium_org/third_party/WebKit/Source/bindings/scripts/
H A Didl_definitions_builder.py57 children = node.GetChildren()
58 for child in children:
99 children = node.GetChildren()
100 for child in children:
132 children = node.GetChildren()
133 for child in children:
149 children = node.GetChildren()
150 num_children = len(children)
152 raise ValueError('Expected 2 or 3 children, got %s' % num_children)
154 type_node = children[
[all...]
/external/chromium_org/chrome/browser/resources/
H A Dcertificate_viewer.js69 tree.detail = {payload: {}, children: {}};
93 for (var key in tree.detail.children) {
94 revealTree(tree.detail.children[key]);
116 treeItem.detail.children['root'] = root;
123 while (last.detail.children && last.detail.children[0])
124 last = last.detail.children[0];
138 children: {}
140 if (tree.children) {
141 for (var i = 0; i < tree.children
[all...]
/external/chromium_org/third_party/leveldatabase/src/table/
H A Dmerger.h14 // children[0,n-1]. Takes ownership of the child iterators and
22 const Comparator* comparator, Iterator** children, int n);

Completed in 872 milliseconds

1234567891011>>