/external/webkit/Source/WebKit/mac/Misc/ |
H A D | MailQuirksUserScript.js | 34 var children = []; 36 children.push(child); 37 return children; 46 var children = childrenBefore(document, document.documentElement); 47 children = children.concat(childrenBefore(document.documentElement, document.body)); 49 for (var i = children.length - 1; i >= 0; i--) { 50 var child = children[i];
|
/external/webkit/Source/WebKit2/WebProcess/InjectedBundle/ |
H A D | InjectedBundleBackForwardListItem.cpp | 35 PassRefPtr<ImmutableArray> InjectedBundleBackForwardListItem::children() const function in class:WebKit::InjectedBundleBackForwardListItem 37 const HistoryItemVector& children = m_item->children(); local 38 size_t size = children.size(); 41 vector[i] = InjectedBundleBackForwardListItem::create(children[i]);
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | BaseTree.java | 34 * 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 D | extension_bookmarks_unittest.cc | 38 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 D | BaseTree.js | 2 * 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/jmonkeyengine/engine/src/core/com/jme3/scene/ |
H A D | Node.java | 53 * 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/webkit/Source/WebCore/inspector/front-end/ |
H A D | TopDownProfileDataGridTree.js | 28 var hasChildren = (profileNode.children && profileNode.children.length); 32 this._remainingChildren = profileNode.children; 38 var children = this._remainingChildren; 39 var childrenLength = children.length; 42 this.appendChild(new WebInspector.TopDownProfileDataGridNode(this.profileView, children[i], this.tree)); 54 var children = this.children; 55 var index = this.children.length; 58 children[inde [all...] |
H A D | ProfileDataGridTree.js | 132 // If the grid node is collapsed, then don't sort children (save operation for later). 135 if (gridNode.children.length) 142 var children = gridNode.children; 143 var childCount = children.length; 146 children.sort(comparator); 149 children[childIndex]._recalculateSiblings(childIndex); 151 gridNodeGroups.push(children); 236 this._savedChildren = this.children.slice(); 252 var children [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | BaseTree.cs | 41 * 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 D | AntlrRuntime_BaseTreeDebugView.cs | 54 ITree[] children = new ITree[_tree.Children.Count]; 55 _tree.Children.CopyTo(children, 0); 56 return children;
|
/external/webkit/Source/WebCore/editing/ |
H A D | RemoveNodePreservingChildrenCommand.cpp | 43 Vector<RefPtr<Node> > children; local 45 children.append(child); 47 size_t size = children.size(); 49 RefPtr<Node> child = children[i].release();
|
H A D | WrapContentsInDummySpanCommand.cpp | 43 Vector<RefPtr<Node> > children; local 45 children.append(child); 49 size_t size = children.size(); 51 m_dummySpan->appendChild(children[i].release(), ec); 70 Vector<RefPtr<Node> > children; 72 children.append(child); 76 size_t size = children.size(); 78 m_element->appendChild(children[i].release(), ec);
|
H A D | MergeIdenticalElementsCommand.cpp | 52 Vector<RefPtr<Node> > children; local 54 children.append(child); 56 size_t size = children.size(); 58 m_element2->insertBefore(children[i].release(), m_atChild.get(), ec); 80 Vector<RefPtr<Node> > children; 82 children.append(child); 84 size_t size = children.size(); 86 m_element1->appendChild(children[i].release(), ec);
|
H A D | SplitElementCommand.cpp | 50 Vector<RefPtr<Node> > children; 52 children.append(node); 67 size_t size = children.size(); 69 m_element1->appendChild(children[i], ec); 84 Vector<RefPtr<Node> > children; 86 children.append(node); 92 size_t size = children.size(); 94 m_element2->insertBefore(children[i].get(), refChild.get(), ec);
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | CompositeGrammarTree.java | 35 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 D | antlr3basetree.c | 75 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/clang/bindings/python/tests/cindex/ |
H A D | util.py | 42 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 D | menu.js | 29 // 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/webkit/Source/WebCore/bindings/js/ |
H A D | JSScriptProfileNodeCustom.cpp | 51 JSValue JSScriptProfileNode::children(ExecState* exec) const function in class:WebCore::JSScriptProfileNode 53 const ProfileNodesList& children = impl()->children(); local 56 ProfileNodesList::const_iterator end = children.end(); 57 for (ProfileNodesList::const_iterator iter = children.begin(); iter != end; ++iter)
|
/external/doclava/res/assets/templates/ |
H A D | yaml_navtree.cs | 3 # walk the children pages and print them nested below the parent 4 page: the node to insert a label, link and check for children 6 with nesting children on recursion. 7 isRoot: treat this node as if it has children and insert a section node. 13 if:subcount(page.children) || isRoot ?> 16 each:child = page.children?> 19 if:subcount(child.children) ?> 30 pages as children beneath the package summary.
|
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderMedia.h | 43 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::RenderMedia 44 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::RenderMedia 52 virtual RenderObjectChildList* virtualChildren() { return children(); } 53 virtual const RenderObjectChildList* virtualChildren() const { return children(); }
|
/external/webkit/Source/WebKit/mac/WebView/ |
H A D | WebRenderNode.h | 35 NSArray *children; variable 43 - (NSArray *)children;
|
/external/junit/src/org/junit/runners/model/ |
H A D | RunnerBuilder.java | 75 * {@code children}. Care is taken to avoid infinite recursion: 79 public List<Runner> runners(Class<?> parent, Class<?>[] children) argument 84 return runners(children); 90 public List<Runner> runners(Class<?> parent, List<Class<?>> children) argument 92 return runners(parent, children.toArray(new Class<?>[0])); 95 private List<Runner> runners(Class<?>[] children) { argument 97 for (Class<?> each : children) {
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/db/ |
H A D | AbstractResults.java | 24 * Each results gives access to specific children depending on model. 41 List children; field in class:AbstractResults 47 this.children = new ArrayList(); 53 this.children = new ArrayList(); 63 int size = this.children.size(); 65 Object results = this.children.get(i); 67 this.children.add(i, child); 72 this.children.add(child); 105 * Return an array built on the current results children list. 107 * @return An array of the children lis [all...] |
/external/chromium/chrome/browser/accessibility/ |
H A D | renderer_accessibility_browsertest.cc | 52 for (size_t i = 0; i < node.children.size(); i++) 53 RecursiveAssertUniqueIds(node.children[i], ids); 119 ASSERT_EQ(1U, tree.children.size()); 120 const WebAccessibility& body = tree.children[0]; 125 // Check properties of the two children of the BODY element. 126 ASSERT_EQ(2U, body.children.size()); 128 const WebAccessibility& button = body.children[0]; 141 const WebAccessibility& checkbox = body.children[1]; 168 ASSERT_EQ(1U, tree.children.size()); 169 const WebAccessibility& body = tree.children[ [all...] |