/external/chromium_org/content/browser/accessibility/ |
cross_platform_accessibility_browsertest.cc | 53 for (size_t i = 0; i < node.children.size(); i++) 54 RecursiveAssertUniqueIds(node.children[i], ids); 158 ASSERT_EQ(1U, tree.children.size()); 159 const AccessibilityNodeDataTreeNode& body = tree.children[0]; 166 // Check properties of the two children of the BODY element. 167 ASSERT_EQ(2U, body.children.size()); 169 const AccessibilityNodeDataTreeNode& button = body.children[0]; 185 const AccessibilityNodeDataTreeNode& checkbox = body.children[1]; 210 ASSERT_EQ(1U, tree.children.size()); 211 const AccessibilityNodeDataTreeNode& body = tree.children[0] [all...] |
/external/chromium_org/cc/trees/ |
layer_tree_host_unittest_picture.cc | 44 layer_tree_host()->root_layer()->children()[0]->RemoveFromParent(); 59 if (pending_root_impl->children().empty()) { 65 static_cast<FakePictureLayerImpl*>(pending_root_impl->children()[0]); 73 if (active_root_impl->children().empty()) { 80 static_cast<FakePictureLayerImpl*>(active_root_impl->children()[0]); 94 if (active_root_impl->children().empty()) { 98 static_cast<FakePictureLayerImpl*>(active_root_impl->children()[0]);
|
/external/chromium/chrome/browser/accessibility/ |
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[0] [all...] |
/external/chromium_org/third_party/WebKit/Source/bindings/scripts/unstable/ |
idl_definitions_builder.py | 60 children = node.GetChildren() 61 for child in children: 102 children = node.GetChildren() 103 for child in children: 131 children = node.GetChildren() 132 for child in children: 148 children = node.GetChildren() 149 num_children = len(children) 151 raise ValueError('Expected 2 or 3 children, got %s' % num_children) 153 type_node = children[0 [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
PKIXPolicyNode.java | 13 protected List children; field in class:PKIXPolicyNode 36 children = _children; 48 children.add(_child); 54 return children.iterator(); 84 return !children.isEmpty(); 94 children.remove(_child); 119 for(int i = 0; i < children.size(); i++) 121 _buf.append(((PKIXPolicyNode)children.get(i)).toString(_indent + " ")); 158 _iter = children.iterator();
|
/sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/model/ |
ViewsTreeModel.java | 37 return ((ViewNode) o).children.get(i); 41 return ((ViewNode) o).children.size(); 46 return node.children == null || node.children.size() == 0; 54 return ((ViewNode) parent).children.indexOf(child);
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
DOMStorageItemsView.js | 93 var children = rootNode.children; variable 97 for (var i = 0; i < children.length; ++i) { 98 var childNode = children[i]; 101 this.deleteButton.visible = (children.length > 1); 117 var children = rootNode.children; variable 122 for (var i = 0; i < children.length; ++i) 123 if (children[i].data.key === storageData.key) 127 rootNode.insertChild(childNode, children.length - 1) 140 var children = rootNode.children; variable 243 var children = rootNode.children; variable [all...] |
/external/chromium_org/tools/grit/grit/tool/ |
preprocess_unittest.py | 34 result.children[2].children[2].children[0].attrs['name'] == 'DUMMY_STRING_1')
|
/packages/apps/Launcher3/src/com/android/launcher3/ |
AppsCustomizeCellLayout.java | 57 ShortcutAndWidgetContainer children = getShortcutsAndWidgets(); local 58 int childCount = children.getChildCount(); 60 children.getChildAt(j).setOnKeyListener(null);
|
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
MockNodeList.java | 33 * Constructs a node list from a given children list. 35 * @param children The children list. Can be null. 37 public MockNodeList(MockXmlNode[] children) { 39 if (children != null) { 40 for (MockXmlNode n : children) {
|
/external/chromium/chrome/browser/extensions/ |
browser_action_test_util_gtk.cc | 23 GList* children = gtk_container_get_children(GTK_CONTAINER(toolbar)); local 25 static_cast<GtkWidget*>(g_list_nth(children, index)->data); 27 g_list_free(children); 40 GList* children = gtk_container_get_children(GTK_CONTAINER(toolbar)); local 41 count = g_list_length(children); 42 g_list_free(children);
|
/external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
bookmark_api_helpers_unittest.cc | 46 ASSERT_EQ(3U, tree->children->size()); 54 ASSERT_EQ(1U, tree->children->size()); 62 ASSERT_EQ(4U, tree->children->size()); 63 linked_ptr<BookmarkTreeNode> digg = tree->children->at(1); 73 ASSERT_EQ(2U, tree->children->size()); 74 linked_ptr<BookmarkTreeNode> inner_folder = tree->children->at(1);
|
/external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
AXARIAGrid.cpp | 65 unsigned rowCellCount = row->children().size(); 73 // otherwise add its children (the cells) as the grid's children. 77 m_children.append(row->children()); 105 // in case the render tree doesn't match the expected ARIA hierarchy, look at the children 109 // The children of this non-row will contain all non-ignored elements (recursing to find them). 111 AccessibilityChildrenVector children = child->children(); local 112 size_t length = children.size(); 114 addTableCellChild(children[i].get(), appendedRows, columnCount) [all...] |
/cts/tools/utils/ |
android_api_description_splitter.py | 104 children = []
107 children.append(child)
109 for child in children:
112 children.remove(child)
114 for child in children:
137 children = []
139 children.append(child)
141 for child in children:
|
/external/chromium_org/third_party/WebKit/Source/core/html/ |
HTMLTableRowElement.cpp | 117 RefPtr<HTMLCollection> children = cells(); local 118 int numCells = children ? children->length() : 0; 132 n = children->item(index); 140 RefPtr<HTMLCollection> children = cells(); local 141 int numCells = children ? children->length() : 0; 145 RefPtr<Node> cell = children->item(index);
|
HTMLTableSectionElement.cpp | 62 RefPtr<HTMLCollection> children = rows(); local 63 int numRows = children ? (int)children->length() : 0; 75 n = children->item(index); 84 RefPtr<HTMLCollection> children = rows(); local 85 int numRows = children ? (int)children->length() : 0; 89 RefPtr<Node> row = children->item(index);
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderFrameSet.h | 62 RenderObject* firstChild() const { ASSERT(children() == virtualChildren()); return children()->firstChild(); } 63 RenderObject* lastChild() const { ASSERT(children() == virtualChildren()); return children()->lastChild(); } 65 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::FINAL 66 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::FINAL 97 virtual RenderObjectChildList* virtualChildren() { return children(); } 98 virtual const RenderObjectChildList* virtualChildren() const { return children(); }
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
RenderSVGRoot.h | 45 RenderObject* firstChild() const { ASSERT(children() == virtualChildren()); return children()->firstChild(); } 46 RenderObject* lastChild() const { ASSERT(children() == virtualChildren()); return children()->lastChild(); } 48 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::FINAL 49 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::FINAL 67 virtual RenderObjectChildList* virtualChildren() { return children(); } 68 virtual const RenderObjectChildList* virtualChildren() const { return children(); }
|
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
InnerNodeImpl.java | 38 * (potentially) a number of children. 45 List<LeafNodeImpl> children = new ArrayList<LeafNodeImpl>(); field in class:InnerNodeImpl 52 return insertChildAt(newChild, children.size()); 58 for (NodeImpl node : children) { 66 return (!children.isEmpty() ? children.get(0) : null); 70 return (!children.isEmpty() ? children.get(children.size() - 1) : null); 74 if (parent == null || index + 1 >= parent.children.size()) [all...] |
/external/elfutils/tests/ |
run-show-abbrev.sh | 32 abbrev[0]: code = 1, tag = 17, children = 1 40 abbrev[19]: code = 2, tag = 46, children = 1 51 abbrev[44]: code = 3, tag = 46, children = 1 59 abbrev[63]: code = 4, tag = 24, children = 0 60 abbrev[68]: code = 5, tag = 46, children = 1 67 abbrev[85]: code = 6, tag = 36, children = 0 71 abbrev[96]: code = 7, tag = 52, children = 0 78 abbrev[0]: code = 1, tag = 17, children = 1 86 abbrev[19]: code = 2, tag = 46, children = 0 96 abbrev[42]: code = 3, tag = 36, children = [all...] |
/external/chromium_org/ui/views/corewm/ |
window_util.cc | 88 std::vector<ui::Layer*> children = layer->children(); local 89 for (std::vector<ui::Layer*>::const_iterator it = children.begin(); 90 it != children.end(); 106 std::vector<ui::Layer*> initial_layer_order = window->layer()->children(); 109 for (aura::Window::Windows::const_iterator it = window->children().begin(); 110 it != window->children().end(); 121 if (has_view_layers && !window->children().empty()) { 124 // intermingled. Reorder |old_layer|'s children based on the initial 129 old_layer->children().begin(), old_layer->children().end(), layer) [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
fixer_util.py | 125 children = [Leaf(token.NAME, u"from"), 129 imp = Node(syms.import_from, children) 139 if isinstance(node, Node) and node.children == [LParen(), RParen()]: 142 and len(node.children) == 3 143 and isinstance(node.children[0], Leaf) 144 and isinstance(node.children[1], Node) 145 and isinstance(node.children[2], Leaf) 146 and node.children[0].value == u"(" 147 and node.children[2].value == u")") 152 and len(node.children) > [all...] |
patcomp.py | 76 node = node.children[0] # Avoid unneeded recursion 79 # Skip the odd children since they are just '|' tokens 80 alts = [self.compile_node(ch) for ch in node.children[::2]] 87 units = [self.compile_node(ch) for ch in node.children] 94 pattern = self.compile_basic(node.children[1:]) 101 nodes = node.children 115 children = repeat.children 116 child = children[0] 124 assert children[-1].type == token.RBRAC [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
fixer_util.py | 125 children = [Leaf(token.NAME, u"from"), 129 imp = Node(syms.import_from, children) 139 if isinstance(node, Node) and node.children == [LParen(), RParen()]: 142 and len(node.children) == 3 143 and isinstance(node.children[0], Leaf) 144 and isinstance(node.children[1], Node) 145 and isinstance(node.children[2], Leaf) 146 and node.children[0].value == u"(" 147 and node.children[2].value == u")") 152 and len(node.children) > [all...] |
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
ShadowViewGroup.java | 21 private List<View> children = new ArrayList<View>(); field in class:ShadowViewGroup 32 for (View child : children) { 48 for (View child : children) { 66 children.add(child); 68 children.add(index, child); 92 if (children.get(i) == child) { 101 return children.size(); 106 if( index >= children.size() ){ return null; } 107 return children.get(index); 112 for (View child : children) { [all...] |