Home
last modified time | relevance | path

Searched refs:new_child (Results 1 – 22 of 22) sorted by relevance

/external/antlr/runtime/Ruby/test/unit/
Dtest-trees.rb628 new_child = new_node( new_token 5 )
631 t.replace_children(0, 0, new_child)
640 new_child = new_node( new_token 99, :text => 'c' )
641 t.replace_children(0,0,new_child)
653 new_child = new_node( new_token 99, :text => 'x' )
654 t.replace_children(1, 1, new_child)
665 new_child = new_node( new_token 99, :text => 'x' )
666 t.replace_children(0, 0, new_child)
677 new_child = new_node( new_token 99, :text => 'x' )
678 t.replace_children(2, 2, new_child)
[all …]
/external/ltp/testcases/kernel/device-drivers/acpi/
Dltp_acpi_cmds.c147 acpi_handle new_child; in acpi_traverse() local
154 parent, child, &new_child); in acpi_traverse()
172 status = acpi_get_object_info(new_child, &dev_info); in acpi_traverse()
176 get_sysfs_path(new_child); in acpi_traverse()
178 get_crs_object(new_child); in acpi_traverse()
189 if (ACPI_SUCCESS(get_str_object(new_child))) { in acpi_traverse()
194 start_parent = new_child; in acpi_traverse()
202 parent = new_child; in acpi_traverse()
/external/dtc/
Dlivetree.c140 struct node *new_child, *old_child; in merge_nodes() local
187 new_child = new_node->children; in merge_nodes()
188 new_node->children = new_child->next_sibling; in merge_nodes()
189 new_child->parent = NULL; in merge_nodes()
190 new_child->next_sibling = NULL; in merge_nodes()
192 if (new_child->deleted) { in merge_nodes()
193 delete_node_by_name(old_node, new_child->name); in merge_nodes()
194 free(new_child); in merge_nodes()
200 if (streq(old_child->name, new_child->name)) { in merge_nodes()
201 merge_nodes(old_child, new_child); in merge_nodes()
[all …]
/external/u-boot/scripts/dtc/
Dlivetree.c140 struct node *new_child, *old_child; in merge_nodes() local
187 new_child = new_node->children; in merge_nodes()
188 new_node->children = new_child->next_sibling; in merge_nodes()
189 new_child->parent = NULL; in merge_nodes()
190 new_child->next_sibling = NULL; in merge_nodes()
192 if (new_child->deleted) { in merge_nodes()
193 delete_node_by_name(old_node, new_child->name); in merge_nodes()
194 free(new_child); in merge_nodes()
200 if (streq(old_child->name, new_child->name)) { in merge_nodes()
201 merge_nodes(old_child, new_child); in merge_nodes()
[all …]
/external/protobuf/python/
Dstubout.py109 def Set(self, parent, child_name, new_child): argument
126 setattr(parent, child_name, new_child)
/external/tensorflow/tensorflow/python/platform/
Dgoogletest.py233 def Set(self, parent, child_name, new_child): argument
257 setattr(parent, child_name, new_child)
/external/tensorflow/tensorflow/tools/api/golden/v1/
Dtensorflow.test.-stub-out-for-testing.pbtxt10 …argspec: "args=[\'self\', \'parent\', \'child_name\', \'new_child\'], varargs=None, keywords=None,…
/external/python/cpython3/Modules/
Dparsermodule.c939 node* new_child = CHILD(root, i - 1); in build_node_children() local
941 if (new_child != build_node_children(elem, new_child, line_num)) { in build_node_children()
/external/webrtc/webrtc/libjingle/xmllite/
Dxmlelement.h196 void InsertChildAfter(XmlChild* predecessor, XmlChild* new_child);
/external/deqp-deps/SPIRV-Tools/source/opt/
Dscalar_analysis.h120 SENode* UpdateChildNode(SENode* parent, SENode* child, SENode* new_child);
Dscalar_analysis.cpp411 SENode* new_child) { in UpdateChildNode() argument
418 new_children.push_back(new_child); in UpdateChildNode()
Dloop_dependence.cpp1440 SENode* new_child = scalar_evolution_.SimplifyExpression( in PropagateConstraints() local
1453 constraint->GetLoop(), prime_recurrent->GetOffset(), new_child); in PropagateConstraints()
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dscalar_analysis.h120 SENode* UpdateChildNode(SENode* parent, SENode* child, SENode* new_child);
Dscalar_analysis.cpp411 SENode* new_child) { in UpdateChildNode() argument
418 new_children.push_back(new_child); in UpdateChildNode()
Dloop_dependence.cpp1440 SENode* new_child = scalar_evolution_.SimplifyExpression( in PropagateConstraints() local
1453 constraint->GetLoop(), prime_recurrent->GetOffset(), new_child); in PropagateConstraints()
/external/python/cpython3/Doc/library/
Dcollections.rst80 .. method:: new_child(m=None)
85 specified, an empty dict is used, so that a call to ``d.new_child()``
131 :meth:`~collections.ChainMap.new_child` method and the
175 d = c.new_child() # Create nested child context
176 e = c.new_child() # Child of c, independent from d
/external/python/cpython3/Lib/test/
Dtest_collections.py61 d = c.new_child()
110 f = d.new_child()
186 d = c.new_child(m)
205 d = c.new_child(m)
/external/python/cpython2/Modules/
Dparsermodule.c856 node* new_child = CHILD(root, i - 1); in build_node_children() local
858 if (new_child != build_node_children(elem, new_child, line_num)) { in build_node_children()
/external/python/cpython3/Lib/collections/
D__init__.py950 def new_child(self, m=None): # like Django's Context.push() member in ChainMap
/external/python/cpython3/Lib/unittest/
Dcase.py529 params_map = parent.params.new_child(params)
/external/python/cpython3/Doc/whatsnew/
D3.4.rst664 The :meth:`.ChainMap.new_child` method now accepts an *m* argument specifying
/external/python/cpython3/Misc/
DHISTORY4524 - Issue #16613: Add *m* argument to ``collections.Chainmap.new_child`` to