| /external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/ |
| D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
365 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound()
375 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound()
385 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal()
394 (node_ptr header, node_ptr pos, node_ptr new_node) in insert_before()
402 static void push_back(node_ptr header, node_ptr new_node) in push_back()
409 static void push_front(node_ptr header, node_ptr new_node) in push_front()
|
| D | treap_algorithms.hpp | 309 (node_ptr h, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal_upper_bound()
334 (node_ptr h, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal_lower_bound()
362 … (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal()
390 (node_ptr header, node_ptr pos, node_ptr new_node, NodePtrPriorityCompare pcomp) in insert_before()
416 static void push_back(node_ptr header, node_ptr new_node, NodePtrPriorityCompare pcomp) in push_back()
441 static void push_front(node_ptr header, node_ptr new_node, NodePtrPriorityCompare pcomp) in push_front()
567 (node_ptr header, node_ptr new_node, const insert_commit_data &commit_data) in insert_unique_commit()
635 (node_ptr h, node_ptr new_node, NodePtrPriorityCompare pcomp, insert_commit_data &commit_data) in rebalance_check_and_commit()
|
| D | avltree_algorithms.hpp | 206 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
214 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
350 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound()
360 (node_ptr h, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound()
370 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal()
379 (node_ptr header, node_ptr pos, node_ptr new_node) in insert_before()
387 static void push_back(node_ptr header, node_ptr new_node) in push_back()
394 static void push_front(node_ptr header, node_ptr new_node) in push_front()
|
| D | sgtree_algorithms.hpp | 196 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_upper_bound()
208 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_lower_bound()
220 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal()
232 (node_ptr header, node_ptr pos, node_ptr new_node in insert_before()
243 static void push_back(node_ptr header, node_ptr new_node in push_back()
253 static void push_front(node_ptr header, node_ptr new_node in push_front()
|
| D | splaytree_algorithms.hpp | 433 (node_ptr header, node_ptr new_node, NodePtrCompare comp) in insert_equal_upper_bound()
443 (node_ptr header, node_ptr new_node, NodePtrCompare comp) in insert_equal_lower_bound()
453 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp) in insert_equal()
462 (node_ptr header, node_ptr pos, node_ptr new_node) in insert_before()
471 static void push_back(node_ptr header, node_ptr new_node) in push_back()
479 static void push_front(node_ptr header, node_ptr new_node) in push_front()
|
| D | bstree_algorithms.hpp | 449 …OST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
470 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
1114 (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal()
1140 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_upper_bound()
1166 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_lower_bound()
1193 (node_ptr header, node_ptr pos, node_ptr new_node in insert_before()
1219 (node_ptr header, node_ptr new_node in push_back()
1244 (node_ptr header, node_ptr new_node in push_front()
1695 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal_check()
1724 …(node_ptr h, node_ptr new_node, NodePtrCompare comp, insert_commit_data & commit_data, std::size_t… in insert_equal_upper_bound_check()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | graph_view_internal.h | 795 inline void UpdateName(NewNode<GraphViewT>* new_node, absl::string_view name) { in UpdateName() argument
805 inline void UpdateOp(NewNode<GraphViewT>* new_node, absl::string_view op) { in UpdateOp()
815 inline void UpdateDevice(NewNode<GraphViewT>* new_node, in UpdateDevice()
827 inline void AddOrUpdateRegularFanin(NewNode<GraphViewT>* new_node, int index, in AddOrUpdateRegularFanin()
841 inline void RemoveRegularFanin(NewNode<GraphViewT>* new_node, int index) { in RemoveRegularFanin()
853 inline void AddControllingFanin(NewNode<GraphViewT>* new_node, in AddControllingFanin()
860 inline void RemoveControllingFanin(NewNode<GraphViewT>* new_node, in RemoveControllingFanin()
867 inline void AddOrUpdateAttribute(NewNode<GraphViewT>* new_node, in AddOrUpdateAttribute()
876 inline void RemoveAttribute(NewNode<GraphViewT>* new_node, in RemoveAttribute()
884 NewNode<GraphViewT>* new_node, in IsWellFormed()
|
| D | graph_view_internal_test.cc | 869 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
886 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
903 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
920 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
962 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
991 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
1021 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
1048 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
1070 MutationNewNodeForTest new_node(&graph_view, {}); in TEST() local
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | map_and_batch_fusion.cc | 44 NodeDef new_node; in MakeMapAndBatchNode() local
130 auto* new_node = in OptimizeAndCollectStats() local
|
| /external/tensorflow/tensorflow/tools/graph_transforms/ |
| D | inline_partitionedcall.cc | 111 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in InlinePartitionedCall() local
128 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in InlinePartitionedCall() local
|
| D | remove_device.cc | 34 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in RemoveDevice() local
|
| D | remove_control_dependencies.cc | 31 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in RemoveControlDependencies() local
|
| D | remove_attribute.cc | 54 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in RemoveAttribute() local
|
| D | set_device.cc | 34 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in SetDevice() local
|
| D | rename_op.cc | 45 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in RenameOp() local
|
| D | rename_attribute.cc | 52 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in RenameAttribute() local
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | graph_optimizer_stage.cc | 79 NodeDef* new_node = ctx.optimized_graph->add_node(); in AddCopyNode() local
92 NodeDef* new_node = ctx.optimized_graph->add_node(); in AddEmptyNode() local
|
| D | model_pruner.cc | 147 bool add_as_control, NodeDef* new_node, in ForwardInputsInternal()
181 NodeDef* new_node, in ForwardInputs()
284 NodeDef* new_node = graph->add_node(); in NewIdentityFromIdentityN() local
516 NodeDef* new_node = optimized_graph->add_node(); in Optimize() local
|
| D | auto_parallel.cc | 210 auto new_node = graph->add_node(); in AddSharedNodes() local
224 auto new_node = graph->add_node(); in AddOneReplica() local
|
| /external/antlr/runtime/Ruby/test/unit/ |
| D | test-trees.rb | 306 def new_node(token) method in TestTreeNodeStream
450 def new_node(token) method in TestCommonTreeNodeStream
786 def new_node(token) method in TestCommonTree
|
| /external/toolchain-utils/binary_search_tool/full_bisect_test/ |
| D | build.c | 5 new_node (int value) in new_node() function
|
| D | stack.c | 21 struct stack_struct *new_node = (struct stack_struct *) malloc (sizeof (struct stack_struct *)); in push() local
|
| /external/dynamic_depth/internal/xmpmeta/xml/ |
| D | serializer_impl.cc | 69 xmlNodePtr new_node = in CreateSerializer() local
95 xmlNodePtr new_node = in CreateItemSerializer() local
|
| /external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/src/lib/ |
| D | ares_llist.c | 46 void ares__insert_in_list(struct list_node* new_node, in ares__insert_in_list()
|
| /external/cronet/base/sampling_heap_profiler/ |
| D | lock_free_address_hash_set.cc | 48 Node* new_node = new Node(key, bucket.load(std::memory_order_relaxed)); in Insert() local
|