| /external/antlr/runtime/Ruby/test/unit/ |
| D | test-trees.rb | 689 new_children = @adaptor.create_flat_list
690 new_children.add_child new_node( new_token 99, :text => 'x' )
691 new_children.add_child new_node( new_token 99, :text => 'y' )
693 t.replace_children(0, 0, new_children)
704 new_children = @adaptor.create_flat_list
705 new_children.add_child new_node( new_token 99, :text => 'x' )
706 new_children.add_child new_node( new_token 99, :text => 'y' )
708 t.replace_children(2, 2, new_children)
719 new_children = @adaptor.create_flat_list
720 new_children.add_child new_node( new_token 99, :text => 'x' )
[all …]
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| D | decision-tree-resource.cc | 54 std::vector<int32>* new_children) { in SplitNode() argument
60 new_children->push_back(newid); in SplitNode()
67 new_children->push_back(newid); in SplitNode()
|
| D | fertile-stats-resource.cc | 48 const std::vector<int32>& new_children) { in Allocate() argument
50 for (const int32 child : new_children) { in Allocate()
|
| D | fertile-stats-resource.h | 74 void Allocate(int32 parent_depth, const std::vector<int32>& new_children);
|
| D | decision-tree-resource.h | 71 std::vector<int32>* new_children);
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 464 std::vector<SENode*> new_children{}; in EliminateZeroCoefficientRecurrents() local
473 new_children.push_back(child->AsSERecurrentNode()->GetOffset()); in EliminateZeroCoefficientRecurrents()
476 new_children.push_back(child); in EliminateZeroCoefficientRecurrents()
479 new_children.push_back(child); in EliminateZeroCoefficientRecurrents()
487 for (SENode* child : new_children) { in EliminateZeroCoefficientRecurrents()
|
| D | scalar_analysis.cpp | 415 std::vector<SENode*> new_children; in UpdateChildNode() local
418 new_children.push_back(new_child); in UpdateChildNode()
420 new_children.push_back(child); in UpdateChildNode()
425 for (SENode* child : new_children) { in UpdateChildNode()
447 std::vector<SENode*> new_children; in BuildGraphWithoutRecurrentTerm() local
452 new_children.push_back(recurrent->GetOffset()); in BuildGraphWithoutRecurrentTerm()
454 new_children.push_back(itr); in BuildGraphWithoutRecurrentTerm()
459 for (SENode* child : new_children) { in BuildGraphWithoutRecurrentTerm()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 464 std::vector<SENode*> new_children{}; in EliminateZeroCoefficientRecurrents() local
473 new_children.push_back(child->AsSERecurrentNode()->GetOffset()); in EliminateZeroCoefficientRecurrents()
476 new_children.push_back(child); in EliminateZeroCoefficientRecurrents()
479 new_children.push_back(child); in EliminateZeroCoefficientRecurrents()
487 for (SENode* child : new_children) { in EliminateZeroCoefficientRecurrents()
|
| D | scalar_analysis.cpp | 415 std::vector<SENode*> new_children; in UpdateChildNode() local
418 new_children.push_back(new_child); in UpdateChildNode()
420 new_children.push_back(child); in UpdateChildNode()
425 for (SENode* child : new_children) { in UpdateChildNode()
447 std::vector<SENode*> new_children; in BuildGraphWithoutRecurrentTerm() local
452 new_children.push_back(recurrent->GetOffset()); in BuildGraphWithoutRecurrentTerm()
454 new_children.push_back(itr); in BuildGraphWithoutRecurrentTerm()
459 for (SENode* child : new_children) { in BuildGraphWithoutRecurrentTerm()
|
| /external/protobuf/src/google/protobuf/util/internal/ |
| D | default_value_objectwriter.cc | 294 std::vector<Node*> new_children; in PopulateChildren() local
322 new_children.push_back(children_[found->second]); in PopulateChildren()
370 new_children.push_back(child.release()); in PopulateChildren()
377 new_children.insert(new_children.begin(), children_[i]); in PopulateChildren()
380 children_.swap(new_children); in PopulateChildren()
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/ |
| D | stats_ops.cc | 399 std::vector<int32> new_children; in Compute() local
400 tree_resource->SplitNode(node, best.get(), &new_children); in Compute()
401 fertile_stats_resource->Allocate(parent_depth, new_children); in Compute()
|
| /external/autotest/frontend/afe/ |
| D | models.py | 2016 new_children = set(host_queue_entries)
2017 while new_children:
2018 children.update(new_children)
2019 new_child_ids = [hqe.job_id for hqe in new_children]
2020 new_children = HostQueueEntry.objects.filter(
2024 new_children = set(new_children) - children
|
| /external/antlr/runtime/Ruby/lib/antlr3/ |
| D | tree.rb | 380 new_children = new_tree.flat_list? ? new_tree : [ new_tree ]
381 self[ start .. stop ] = new_children
|