| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/ |
| D | fix_metaclass.py | 32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children):
[all …]
|
| D | fix_itertools_imports.py | 16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children and children[-1].type == token.COMMA:
49 children.pop().remove()
52 if (not (imports.children or getattr(imports, 'value', None)) or
|
| D | fix_except.py | 33 if n.children[0].value == u'except':
54 if len(except_clause.children) == 4:
55 (E, comma, N) = except_clause.children[1:4]
70 suite_stmts = e_suite.children
92 children = [c.clone() for c in node.children[:3]] + try_cleanup + tail
93 return pytree.Node(node.type, children)
|
| D | 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):
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])
155 return [find_params(c) for c in node.children if c.type != token.COMMA]
|
| D | fix_set_literal.py | 39 literal.extend(n.clone() for n in items.children)
47 if len(maker.children) == 4:
48 n = maker.children[2]
50 maker.children[-1].prefix = n.prefix
|
| D | fix_import.py | 29 yield "".join([ch.value for ch in node.children])
31 pending.append(node.children[0])
33 pending.extend(node.children[::-2])
62 imp = imp.children[0]
|
| D | fix_urllib.py | 126 as_name = member.children[2].value
127 member_name = member.children[0].value
143 kids = [Name(name.children[0].value, prefix=prefix),
144 name.children[1].clone(),
145 name.children[2].clone()]
|
| D | fix_raise.py | 57 exc = exc.children[1].children[0].clone()
68 args = [c.clone() for c in val.children[1:-1]]
|
| D | fix_map.py | 79 args.children[0].type == token.NAME and \
80 args.children[0].value == "None":
|
| D | fix_execfile.py | 32 execfile_paren = node.children[-1].children[-1].clone()
|
| D | fix_exitfunc.py | 59 names = self.sys_import.children[1]
65 position = containing_stmt.children.index(self.sys_import)
|
| D | fix_print.py | 47 assert node.children[0] == Name(u"print")
48 args = node.children[1:]
|
| D | fix_next.py | 86 for child in assign.children:
103 return any(is_subtree(c, node) for c in root.children)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/ |
| D | btm_utils.py | 24 self.children = []
42 if len(node.alternatives) == len(node.children):
56 if len(node.group) == len(node.children):
98 for child in self.children:
101 if not self.children:
116 node = node.children[0]
120 if len(node.children) <= 2:
122 new_node = reduce_tree(node.children[0], parent)
127 for child in node.children:
128 if node.children.index(child)%2:
[all …]
|
| D | 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) > 1
[all …]
|
| D | pytree.py | 46 children = () # Tuple of subnodes variable in Base
140 for ch in self.parent.children:
142 assert not found, (self.parent.children, self, new)
148 assert found, (self.children, self, new)
150 self.parent.children = l_children
159 if not node.children:
161 node = node.children[0]
175 for i, node in enumerate(self.parent.children):
178 del self.parent.children[i]
192 for i, child in enumerate(self.parent.children):
[all …]
|
| D | patcomp.py | 76 node = node.children[0] # Avoid unneeded recursion
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.RBRACE
125 assert len(children) in (3, 5)
126 min = max = self.get_int(children[1])
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/ |
| D | ast.py | 154 children = []
155 children.append(self.test)
156 children.append(self.fail)
157 return tuple(children)
176 children = []
177 children.extend(flatten(self.nodes))
178 children.append(self.expr)
179 return tuple(children)
290 children = []
291 children.append(self.node)
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| D | _elementtree.c | 226 PyObject* *children; member
276 self->extra->children = self->extra->_children; in element_new_extra()
289 Py_DECREF(self->extra->children[i]); in element_dealloc_extra()
291 if (self->extra->children != self->extra->_children) in element_dealloc_extra()
292 PyObject_Free(self->extra->children); in element_dealloc_extra()
321 self->extra->children = self->extra->_children; in element_new()
343 PyObject* *children; in element_resize() local
362 if (self->extra->children != self->extra->_children) { in element_resize()
367 children = PyObject_Realloc(self->extra->children, in element_resize()
369 if (!children) in element_resize()
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/tests/ |
| D | test_util.py | 20 tree = tree.children[0]
84 children = []
87 children.append(arg)
88 children.append(Comma())
89 children.pop()
90 return Call(Name(name), children, prefix)
112 for child in node.children:
592 self.assertEqual(fi(node.children[0].children[4].children[2]), u" ")
594 self.assertEqual(fi(node.children[0].children[4].children[4]), u" ")
|
| D | test_parser.py | 30 self.assertEqual(t.children[0].children[0].type, syms.print_stmt)
31 self.assertEqual(t.children[1].children[0].type, syms.print_stmt)
|
| D | test_pytree.py | 100 self.assertEqual(n1.children, [l1, l2])
162 self.assertEqual(n1.children, [l1, l2, l3])
163 self.assertTrue(isinstance(n1.children, list))
167 self.assertEqual(n1.children, [l1, l2new, l3])
168 self.assertTrue(isinstance(n1.children, list))
179 self.assertTrue(isinstance(n1.children, list))
267 self.assertEqual(n2.children, [])
276 self.assertEqual(n1.children, [])
300 self.assertEqual(n1.children, [l2])
307 self.assertEqual(n2.children, [n1])
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| D | inspect.py | 705 def walktree(classes, children, parent): argument
711 if c in children:
712 results.append(walktree(children[c], children, c))
724 children = {}
729 if not parent in children:
730 children[parent] = []
731 if c not in children[parent]:
732 children[parent].append(c)
736 for parent in children:
739 return walktree(roots, children, None)
|
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Universal/SectionExtractionDxe/ |
| D | SectionExtractionDxe.uni | 5 // where each stream contains a linked list of children, which may be leaves or
23 …ed list of section streams, where each stream contains a linked list of children, which may be lea…
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| D | symtable.py | 87 return bool(self._table.children)
113 for st in self._table.children
118 for st in self._table.children]
166 for st in self._table.children:
|