/libcore/luni/src/test/java/tests/api/java/lang/ |
ProcessTest.java | 29 ArrayList<Process> children = new ArrayList<Process>(); local 32 children.add(Runtime.getRuntime().exec(new String[] { "/system/bin/does-not-exist" }, null, null)); 37 assertEquals(0, children.size());
|
/packages/experimental/LoaderApp/src/com/android/loaderapp/model/ |
EntityDiff.java | 92 // Build lookup maps for children on both sides 96 // Walk through "before" children looking for deletes and updates 119 // Walk through remaining "after" children, which are inserts 139 final ArrayList<NamedContentValues> children = entity.getSubValues(); local 141 children.size()); 142 for (NamedContentValues child : children) {
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/command/ |
check.py | 27 def system_message(self, level, message, *children, **kwargs): 28 self.messages.append((level, message, children, kwargs)) 31 *children, **kwargs)
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/command/ |
check.py | 27 def system_message(self, level, message, *children, **kwargs): 28 self.messages.append((level, message, children, kwargs)) 31 *children, **kwargs)
|
/external/chromium/chrome/browser/bookmarks/ |
bookmark_node_data_unittest.cc | 69 EXPECT_EQ(0, drag_data.elements[0].children.size()); 154 // Tests reading/writing a folder with children. 179 ASSERT_EQ(1, read_data.elements[0].children.size()); 181 read_data.elements[0].children[0]; 222 ASSERT_EQ(1, read_data.elements[0].children.size()); 227 EXPECT_EQ(1, read_folder.children.size()); 232 EXPECT_EQ(0, read_url.children.size());
|
/external/chromium_org/net/tools/testserver/ |
minica.py | 78 names.children.append( 87 names.children.append( 96 names.children.append( 184 extensions.children.append( 195 extensions.children.append( 207 extensions.children.append(
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
CompositeGrammar.java | 208 List<CompositeGrammarTree> children = t.children; local 209 if ( children==null ) { 213 for (int i = 0; children!=null && i < children.size(); i++) { 214 CompositeGrammarTree child = (CompositeGrammarTree) children.get(i); 423 if ( p.children!=null ) { 424 for (CompositeGrammarTree delegate : p.children) { 445 if ( p.children!=null ) { 446 for (CompositeGrammarTree delegate : p.children) { [all...] |
/external/chromium/chrome/browser/extensions/ |
extension_bookmark_manager_api.cc | 91 ListValue* children = new ListValue(); local 93 AddNodeToList(children, *node.GetChild(i)); 94 dict->Set(keys::kChildrenKey, children); 111 ListValue* children = new ListValue(); local 112 for (size_t i = 0; i < element.children.size(); ++i) 113 AddElementToList(children, element.children[i]); 114 dict->Set(keys::kChildrenKey, children);
|
/external/chromium_org/chrome/browser/resources/quota_internals/ |
event_handler.js | 190 treeViewObject.detail = {payload: {}, children: {}}; 203 var storageObject = treeViewObject.detail.children[type]; 207 detail: {payload: {}, children: {}} 210 treeViewObject.detail.children[type] = storageObject; 225 var hostObject = storageObject.detail.children[host]; 229 detail: {payload: {}, children: {}} 232 storageObject.detail.children[host] = hostObject; 248 var originObject = hostObject.detail.children[origin]; 252 detail: {payload: {}, children: {}} 255 hostObject.detail.children[origin] = originObject [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderRubyBase.cpp | 64 // This function removes all children that are before (!) beforeChild 90 // The standard and easy case: move the children into the target base 100 toBase->children()->appendChildNode(toBase, toBlock); 103 // Move our inline children into the target block we determined above. 125 anonBlockHere->moveAllChildrenTo(anonBlockThere, anonBlockThere->children()); 129 // Move all remaining children normally.
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
resourcesPanel.css | 226 .children.small .resource-sidebar-tree-item .icon { 250 .children.small .resource-sidebar-tree-item.resources-type-image .icon { 255 .children.small .resources-type-image .image-resource-icon-preview { 268 .children.small .resource-sidebar-tree-item.resources-type-document .icon { 276 .children.small .resource-sidebar-tree-item.resources-type-stylesheet .icon { 287 .children.small .resource-sidebar-tree-item.resources-type-image .icon { 296 .children.small .resource-sidebar-tree-item.resources-type-font .icon { 304 .children.small .resource-sidebar-tree-item.resources-type-script .icon { 312 .children.small .resource-sidebar-tree-item.resources-type-xhr .icon {
|
/external/chromium_org/tools/grit/grit/node/ |
misc.py | 76 """A node whose children should be considered to be at the same level as 99 children = self.children 101 if any(isinstance(node, (ThenNode, ElseNode)) for node in children): 102 if (len(children) != 2 or not isinstance(children[0], ThenNode) or 103 not isinstance(children[1], ElseNode)): 111 return self.children[0 if cond else 1].ActiveChildren() 113 # Equivalent to having all children inside <then> with an empty <else> 226 except for nodes that are children of <if> nodes [all...] |
/external/chromium_org/ui/compositor/ |
debug_utils.cc | 89 for (size_t i = 0, count = layer->children().size(); i < count; ++i) { 91 layer->children()[i], indent + 3, mouse_location, out);
|
/external/elfutils/libelf/ |
common.h | 116 /* Acquire lock for the descriptor and all children. */ 125 Elf *child = elf->state.ar.children; 136 /* Release own lock and those of the children. */ 143 Elf *child = elf->state.ar.children;
|
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/util/ |
DebugShapeFactory.java | 71 List<ChildCollisionShape> children = shape.getChildren(); local 73 for (Iterator<ChildCollisionShape> it = children.iterator(); it.hasNext();) {
|
/external/linux-tools-perf/util/ |
callchain.h | 27 struct list_head children; member in struct:callchain_node 30 struct rb_root rb_root; /* sorted tree of children */ 83 INIT_LIST_HEAD(&root->node.children);
|
/frameworks/base/tools/preload/ |
Proc.java | 44 final List<Proc> children = new ArrayList<Proc>(); field in class:Proc 159 for (Proc child : children) {
|
/hardware/samsung_slsi/exynos5/mobicore/common/MobiCore/inc/ |
mcContainer.h | 175 spChild_t children; member in struct:__anon35285 186 mcUuidChild_t children; member in struct:__anon35286
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
fix_next.py | 86 for child in assign.children: 103 return any(is_subtree(c, node) for c in root.children)
|
fix_print.py | 47 assert node.children[0] == Name(u"print") 48 args = node.children[1:]
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
fix_next.py | 86 for child in assign.children: 103 return any(is_subtree(c, node) for c in root.children)
|
fix_print.py | 47 assert node.children[0] == Name(u"print") 48 args = node.children[1:]
|
/external/clang/include/clang/AST/ |
Stmt.h | 55 // references to children (to be compatible with StmtIterator). 400 /// Child Iterators: All subclasses must implement 'children' 409 child_range children(); 410 const_child_range children() const { function in class:clang::Stmt 411 return const_cast<Stmt*>(this)->children(); 414 child_iterator child_begin() { return children().first; } 415 child_iterator child_end() { return children().second; } 417 const_child_iterator child_begin() const { return children().first; } 418 const_child_iterator child_end() const { return children().second; } 479 child_range children() { function in class:clang::DeclStmt 533 child_range children() { return child_range(); } function in class:clang::NullStmt 612 child_range children() { function in class:clang::CompoundStmt 616 const_child_range children() const { function in class:clang::CompoundStmt 718 child_range children() { function in class:clang::CaseStmt 750 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::DefaultStmt 786 child_range children() { return child_range(&SubStmt, &SubStmt+1); } function in class:clang::LabelStmt 834 child_range children() { return child_range(&SubStmt, &SubStmt + 1); } function in class:clang::AttributedStmt 901 child_range children() { function in class:clang::IfStmt 993 child_range children() { function in class:clang::SwitchStmt 1053 child_range children() { function in class:clang::WhileStmt 1101 child_range children() { function in class:clang::DoStmt 1174 child_range children() { function in class:clang::ForStmt 1208 child_range children() { return child_range(); } function in class:clang::GotoStmt 1251 child_range children() { return child_range(&Target, &Target+1); } function in class:clang::IndirectGotoStmt 1276 child_range children() { return child_range(); } function in class:clang::ContinueStmt 1300 child_range children() { return child_range(); } function in class:clang::BreakStmt 1354 child_range children() { function in class:clang::ReturnStmt 1490 child_range children() { function in class:clang::AsmStmt 1769 child_range children() { function in class:clang::MSAsmStmt 1808 child_range children() { function in class:clang::SEHExceptStmt 1842 child_range children() { function in class:clang::SEHFinallyStmt 1893 child_range children() { function in class:clang::SEHTryStmt [all...] |
/external/v8/test/cctest/ |
test-cpu-profiler.cc | 172 profile->top_down()->root()->children(); 176 top_down_root_children->last()->children(); 180 top_down_bbb_children->last()->children(); 184 top_down_stub_children->last()->children(); 188 profile->bottom_up()->root()->children(); 197 bottom_up_root_children[0]->children(); 201 bottom_up_root_children[1]->children(); 204 bottom_up_root_children[2]->children(); 208 bottom_up_ddd_children->last()->children(); 259 while (node->children()->length() > 0) [all...] |
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
profiler.js | 100 if ('children' in model) 101 return model.children.reduce(function(previous, current) { 156 * Remove children of figured node and reparse whole tree. 195 children: [] 229 model.children.push(child); 244 model.children.push(retVal.model); 255 retVal.model.children.push({ 272 model.children.push(retVal.model); 275 retVal.model.children.push({ 311 if ('children' in model) [all...] |