| /external/chromium_org/cc/trees/ |
| tree_synchronizer.cc | 28 OwnedLayerImplList& children = layer_impl->children();
29 for (OwnedLayerImplList::iterator it = children.begin();
30 it != children.end();
32 CollectExistingLayerImplRecursive(old_layers, children.take(it));
105 for (size_t i = 0; i < layer->children().size(); ++i) {
148 for (size_t i = 0; i < layer->children().size(); ++i) {
229 const OwnedLayerImplList& impl_children = layer_impl->children();
230 DCHECK_EQ(layer->children().size(), impl_children.size());
232 for (size_t i = 0; i < layer->children().size(); ++i)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_tuple_params.py | 29 stmt.children[0].type == token.STRING
55 if suite[0].children[1].type == token.INDENT:
57 indent = suite[0].children[1].value
81 for i, arg in enumerate(args.children):
91 # TODO(cwinter) get rid of this when children becomes a smart list
99 elif is_docstring(suite[0].children[start]):
105 suite[0].children[after:after] = new_lines
107 suite[0].children[i].prefix = indent
146 node = node.children[1]
152 return find_params(node.children[1]
[all...] |
| fix_raise.py | 55 # exc.children[1:-1] is the unparenthesized tuple
56 # exc.children[1].children[0] is the first element of the tuple
57 exc = exc.children[1].children[0].clone()
68 args = [c.clone() for c in val.children[1:-1]]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_tuple_params.py | 29 stmt.children[0].type == token.STRING
55 if suite[0].children[1].type == token.INDENT:
57 indent = suite[0].children[1].value
81 for i, arg in enumerate(args.children):
91 # TODO(cwinter) get rid of this when children becomes a smart list
99 elif is_docstring(suite[0].children[start]):
105 suite[0].children[after:after] = new_lines
107 suite[0].children[i].prefix = indent
146 node = node.children[1]
152 return find_params(node.children[1]
[all...] |
| fix_raise.py | 55 # exc.children[1:-1] is the unparenthesized tuple
56 # exc.children[1].children[0] is the first element of the tuple
57 exc = exc.children[1].children[0].clone()
68 args = [c.clone() for c in val.children[1:-1]]
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/descriptors/ |
| ElementDescriptor.java | 37 * an attributes list and a children list.
52 /** The list of allowed children */
69 * tooltip, SDK url, attributes list, children list and mandatory.
76 * @param children The list of allowed children. Can be null or empty.
84 ElementDescriptor[] children,
92 mChildren = children != null ? children : new ElementDescriptor[]{};
97 * tooltip, SDK url, attributes list, children list and mandatory.
104 * @param children The list of allowed children. Can be null or empty
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| BaseTree.as | 30 * actually have any user data. ANTLR v3 uses a list of children approach
32 * an empty node whose children represent the list. An empty, but
39 * as there are no fields other than the children list, which cannot
40 * be copied as the children are not considered part of this node.
52 /** Get the children internal List; note that if you directly mess with
55 public function get children():Array {
78 * Warning: if t has no children, but child does
79 * and child isNil then this routine moves children to t via
80 * t.children = child.children; i.e., without copying the array
[all...] |
| /external/chromium_org/ui/accessibility/ |
| ax_tree_serializer.h | 41 // For example, if node 1 has children 2, 3, 4, 5 and then child 2 is
43 // update nodes 1 and 6 (and any children of node 6 recursively). It will
154 std::vector<ClientTreeNode*> children; member in struct:ui::ClientTreeNode
313 for (size_t i = 0; i < client_lca->children.size(); ++i) {
314 client_id_map_.erase(client_lca->children[i]->id);
315 DeleteClientSubtree(client_lca->children[i]);
317 client_lca->children.clear();
330 for (size_t i = 0; i < client_node->children.size(); ++i) {
331 client_id_map_.erase(client_node->children[i]->id);
332 DeleteClientSubtree(client_node->children[i])
[all...] |
| /external/chromium/chrome/browser/ui/webui/options/ |
| cookies_view_handler.cc | 89 ListValue* children = new ListValue; local
91 children);
99 args.Append(children);
194 ListValue* children = new ListValue; local
196 children);
202 args.Append(children);
|
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| parsing.cc | 137 const std::vector<buzz::XmlElement*>& children) {
138 for (std::vector<buzz::XmlElement*>::const_iterator iter = children.begin();
139 iter != children.end();
154 std::vector<buzz::XmlElement*> children; local
158 children.push_back(new buzz::XmlElement(*child));
160 return children;
|
| /external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
| parsing.cc | 132 const std::vector<buzz::XmlElement*>& children) {
133 for (std::vector<buzz::XmlElement*>::const_iterator iter = children.begin();
134 iter != children.end();
149 std::vector<buzz::XmlElement*> children; local
153 children.push_back(new buzz::XmlElement(*child));
155 return children;
|
| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
| graph-view.js | 25 if ('children' in snapNode) {
27 if (!('children' in treeNode))
28 treeNode.children = {};
29 snapNode.children.forEach(function(child) {
30 if (!(child.id in treeNode.children))
31 treeNode.children[child.id] = {};
32 mergeCategoryTree(child, treeNode.children[child.id]);
40 if ('children' in node) {
41 Object.keys(node.children).forEach(function(id) {
42 getCategoriesMap(node.children[id], id, categories)
[all...] |
| /external/libvpx/libvpx/nestegg/halloc/src/ |
| halloc.c | 32 hlist_head_t children; /* 1 pointer */ member in struct:hblock
81 hlist_init(&p->children);
98 hlist_relink_head(&p->children);
138 hlist_add(&p->children, &b->siblings);
226 hlist_for_each(i, &p->children)
247 hlist_for_each_safe(i, tmp, &p->children)
|
| /packages/apps/Mms/src/com/android/mms/dom/smil/ |
| ElementParallelTimeContainerImpl.java | 88 NodeList children = getTimeChildren(); local
89 for (int i = 0; i < children.getLength(); ++i) {
90 ElementTime child = (ElementTime) children.item(i);
116 NodeList children = getTimeChildren(); local
117 int childrenLen = children.getLength();
121 ElementTime child = (ElementTime) children.item(i);
|
| /cts/tools/utils/ |
| rerun.py | 23 children = []
28 children.append(child)
29 return children
|
| /development/samples/ApiDemos/src/com/example/android/apis/view/ |
| ExpandableList3.java | 51 List<Map<String, String>> children = new ArrayList<Map<String, String>>(); local
54 children.add(curChildMap);
58 childData.add(children);
|
| /external/chromium/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_bar_gtk_unittest.cc | 93 // We should expect two children to the bookmark bar's toolbar.
94 GList* children = gtk_container_get_children( local
96 EXPECT_EQ(2U, g_list_length(children));
97 g_list_free(children);
|
| /external/chromium_org/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_bar_gtk_unittest.cc | 91 // We should expect two children to the bookmark bar's toolbar.
92 GList* children = gtk_container_get_children( local
94 EXPECT_EQ(2U, g_list_length(children));
95 g_list_free(children);
|
| /external/chromium_org/chrome/test/chromedriver/chrome/ |
| dom_tracker.cc | 94 const base::Value* children; local
95 if (dict->Get("children", &children))
96 return ProcessNodeList(children);
|
| /external/chromium_org/chrome/test/pyautolib/ |
| bookmark_model.py | 47 children = node.get('children', None)
48 if children:
50 [self.NodeCount(x) for x in children])
70 for child in node.get('children', []):
97 for child in node.get('children', []):
|
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| ScriptProfile.cpp | 76 RefPtr<TypeBuilder::Array<TypeBuilder::Profiler::CPUProfileNode> > children = TypeBuilder::Array<TypeBuilder::Profiler::CPUProfileNode>::create(); local
80 children->addItem(buildInspectorObjectFor(child));
91 .setChildren(children.release())
|
| /external/clang/bindings/python/examples/cindex/ |
| cindex-dump.py | 41 children = None
43 children = [get_info(c, depth+1)
54 'children' : children }
|
| /external/elfutils/tests/ |
| show-abbrev.c | 90 int children = dwarf_abbrevhaschildren (abbrev); local
91 if (children < 0)
99 printf ("abbrev[%llu]: code = %u, tag = %u, children = %d\n",
100 (unsigned long long int) offset, code, tag, children);
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| Item.java | 82 for (Iterator children = m_children.iterator (); children.hasNext (); )
84 value += ((IItem) children.next ()).getAggregate (type);
|
| /libcore/luni/src/test/java/libcore/xml/ |
| NodeTest.java | 84 NodeList children = node.getChildNodes(); local
85 for (int i = 0; i < children.getLength(); i++) {
86 traverse(children.item(i), sink);
|
