Searched refs:child (Results 1 - 25 of 1135) sorted by relevance

1234567891011>>

/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
H A Dfix_itertools_imports.py20 for child in children[::2]:
21 if child.type == token.NAME:
22 member = child.value
23 name_node = child
24 elif child.type == token.STAR:
28 assert child.type == syms.import_as_name
29 name_node = child.children[0]
32 child.value = None
33 child.remove()
42 for child i
[all...]
H A Dfix_ws_comma.py27 for child in new.children:
28 if child in self.SEPS:
29 prefix = child.prefix
31 child.prefix = u""
35 prefix = child.prefix
37 child.prefix = u" "
H A Dfix_next.py86 for child in assign.children:
87 if child.type == token.EQUAL:
89 elif is_subtree(child, node):
H A Dfix_except.py83 for child in reversed(suite_stmts[:i]):
84 e_suite.insert_child(0, child)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
H A Dfix_itertools_imports.py20 for child in children[::2]:
21 if child.type == token.NAME:
22 member = child.value
23 name_node = child
24 elif child.type == token.STAR:
28 assert child.type == syms.import_as_name
29 name_node = child.children[0]
32 child.value = None
33 child.remove()
42 for child i
[all...]
H A Dfix_ws_comma.py27 for child in new.children:
28 if child in self.SEPS:
29 prefix = child.prefix
31 child.prefix = u""
35 prefix = child.prefix
37 child.prefix = u" "
H A Dfix_next.py86 for child in assign.children:
87 if child.type == token.EQUAL:
89 elif is_subtree(child, node):
H A Dfix_except.py83 for child in reversed(suite_stmts[:i]):
84 e_suite.insert_child(0, child)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/
H A Dsimple_paths.py85 child = next(children, None)
86 if child is None:
90 if child == target:
92 elif child not in visited:
93 visited.append(child)
94 stack.append(iter(G[child]))
96 if child == target or target in children:
109 child = next(children, None)
110 if child is None:
114 if child
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/json_graph/
H A Dtree.py62 for child in nbrs:
63 d = dict(id=child, **G.node[child])
64 c = add_children(child,G)
99 child = data['id']
100 graph.add_edge(parent, child)
103 add_children(child,grandchildren)
106 graph.add_node(child,attr_dict=nodedata)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/traversal/
H A Ddepth_first_search.py40 child = next(children)
41 if child not in visited:
42 yield parent,child
43 visited.add(child)
44 stack.append((child,iter(G[child])))
113 child = next(children)
114 if child in visited:
115 yield parent,child,{'dir':'nontree'}
117 yield parent,child,{'di
[all...]
H A Dbreadth_first_search.py29 child = next(children)
30 if child not in visited:
31 yield parent, child
32 visited.add(child)
33 queue.append((child, neighbors(child)))
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/components/
H A Dbiconnected.py384 child = next(children)
385 if grandparent == child:
387 if child in visited:
388 if discovery[child] <= discovery[parent]: # back edge
389 low[parent] = min(low[parent],discovery[child])
391 edge_stack.append((parent,child))
393 low[child] = discovery[child] = len(discovery)
394 visited.add(child)
395 stack.append((parent, child, ite
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/utils/
H A Drcm.py121 child = next(children)
122 if child not in visited:
123 yield child
124 visited.add(child)
126 nd = sorted(G.degree(G[child]).items(), key=itemgetter(1))
128 stack.append((child,children))
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/
H A Dbtm_utils.py98 for child in self.children:
99 for x in child.leaves():
127 for child in node.children:
128 if node.children.index(child)%2:
130 reduced = reduce_tree(child, new_node)
137 for child in node.children:
138 reduced = reduce_tree(child, new_node)
169 for child in node.children:
170 if child.type == syms.Details:
172 details_node = child
[all...]
H A Dfixer_util.py345 for child in node.children:
347 if child.type == syms.for_stmt:
348 if _find(name, child.children[1]):
349 return child
350 n = find_binding(name, make_suite(child.children[-1]), package)
352 elif child.type in (syms.if_stmt, syms.while_stmt):
353 n = find_binding(name, make_suite(child.children[-1]), package)
355 elif child.type == syms.try_stmt:
356 n = find_binding(name, make_suite(child.children[2]), package)
360 for i, kid in enumerate(child
[all...]
H A Dpytree.py192 for i, child in enumerate(self.parent.children):
193 if child is self:
209 for i, child in enumerate(self.parent.children):
210 if child is self:
216 for child in self.children:
217 for x in child.leaves():
251 child nodes, and an optional context keyword argument.
296 for child in self.children:
297 for node in child.post_order():
304 for child i
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/
H A Dbtm_utils.py98 for child in self.children:
99 for x in child.leaves():
127 for child in node.children:
128 if node.children.index(child)%2:
130 reduced = reduce_tree(child, new_node)
137 for child in node.children:
138 reduced = reduce_tree(child, new_node)
169 for child in node.children:
170 if child.type == syms.Details:
172 details_node = child
[all...]
H A Dfixer_util.py345 for child in node.children:
347 if child.type == syms.for_stmt:
348 if _find(name, child.children[1]):
349 return child
350 n = find_binding(name, make_suite(child.children[-1]), package)
352 elif child.type in (syms.if_stmt, syms.while_stmt):
353 n = find_binding(name, make_suite(child.children[-1]), package)
355 elif child.type == syms.try_stmt:
356 n = find_binding(name, make_suite(child.children[2]), package)
360 for i, kid in enumerate(child
[all...]
H A Dpytree.py192 for i, child in enumerate(self.parent.children):
193 if child is self:
209 for i, child in enumerate(self.parent.children):
210 if child is self:
216 for child in self.children:
217 for x in child.leaves():
251 child nodes, and an optional context keyword argument.
296 for child in self.children:
297 for node in child.post_order():
304 for child i
[all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
H A Dtree-dump.h81 #define dump_child(field, child) \
82 queue_and_dump_index (di, field, child, DUMP_NONE)
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
H A Dtest_signal.py67 def wait(self, child):
68 """Wait for child to finish, ignoring EINTR."""
71 child.wait()
94 child = ignoring_eintr(subprocess.Popen, ['kill', '-HUP', str(pid)])
95 if child:
96 self.wait(child)
106 del child
108 child = subprocess.Popen(['kill', '-USR1', str(pid)])
110 self.wait(child)
119 child
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
H A Dtest_signal.py67 def wait(self, child):
68 """Wait for child to finish, ignoring EINTR."""
71 child.wait()
94 child = ignoring_eintr(subprocess.Popen, ['kill', '-HUP', str(pid)])
95 if child:
96 self.wait(child)
106 del child
108 child = subprocess.Popen(['kill', '-USR1', str(pid)])
110 self.wait(child)
119 child
[all...]
/prebuilts/sdk/current/support/design/libs/
H A Dandroid-support-design.jarMETA-INF/ META-INF/MANIFEST.MF android/ android/support/ android/support/design/ android/support/design/internal/ ...
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
H A Dast.py144 for child in iter_child_nodes(node):
145 _fix(child, lineno, col_offset)
155 for child in walk(node):
156 if 'lineno' in child._attributes:
157 child.lineno = getattr(child, 'lineno', 0) + n
175 Yield all direct child nodes of *node*, that is, all fields that are nodes
277 Keep in mind that if the node you're operating on has child nodes you must
278 either transform the child nodes yourself or call the :meth:`generic_visit`

Completed in 570 milliseconds

1234567891011>>