| /third_party/boost/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 | 311 (node_ptr h, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal_upper_bound()
336 (node_ptr h, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal_lower_bound()
364 … (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp, NodePtrPriorityCompare pcomp) in insert_equal()
392 (node_ptr header, node_ptr pos, node_ptr new_node, NodePtrPriorityCompare pcomp) in insert_before()
418 static void push_back(node_ptr header, node_ptr new_node, NodePtrPriorityCompare pcomp) in push_back()
443 static void push_front(node_ptr header, node_ptr new_node, NodePtrPriorityCompare pcomp) in push_front()
569 (node_ptr header, node_ptr new_node, const insert_commit_data &commit_data) in insert_unique_commit()
637 (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 | 451 …OST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node()
472 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node()
1115 (node_ptr h, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal()
1141 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_upper_bound()
1167 (node_ptr h, node_ptr new_node, NodePtrCompare comp in insert_equal_lower_bound()
1194 (node_ptr header, node_ptr pos, node_ptr new_node in insert_before()
1220 (node_ptr header, node_ptr new_node in push_back()
1245 (node_ptr header, node_ptr new_node in push_front()
1696 (node_ptr header, node_ptr hint, node_ptr new_node, NodePtrCompare comp in insert_equal_check()
1725 …(node_ptr h, node_ptr new_node, NodePtrCompare comp, insert_commit_data & commit_data, std::size_t… in insert_equal_upper_bound_check()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | copy.hpp | 46 subtree_destroyer new_node(raw_new_node, m_allocators); in operator ()() local
73 subtree_destroyer new_node(raw_new_node, m_allocators); in operator ()() local
|
| /third_party/node/deps/cares/src/lib/ |
| D | ares_llist.c | 46 void ares__insert_in_list(struct list_node* new_node, in ares__insert_in_list()
|
| /third_party/cares/ |
| D | ares_llist.c | 46 void ares__insert_in_list(struct list_node* new_node, in ares__insert_in_list()
|
| /third_party/XKeyboardConfig/rules/ |
| D | xml2lst.pl | 141 sub new_node { subroutine
|
| /third_party/nghttp2/src/ |
| D | shrpx_router.cc | 57 void add_next_node(RNode *node, std::unique_ptr<RNode> new_node) { in add_next_node()
69 auto new_node = in add_node() local
134 auto new_node = std::make_unique<RNode>( in add_route() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 243 void SENodeSimplifyImpl::GatherAccumulatorsFromChildNodes(SENode* new_node, in GatherAccumulatorsFromChildNodes()
374 std::unique_ptr<SEAddNode> new_node{new SEAddNode(&analysis_)}; in FoldRecurrentAddExpressions() local
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 243 void SENodeSimplifyImpl::GatherAccumulatorsFromChildNodes(SENode* new_node, in GatherAccumulatorsFromChildNodes()
374 std::unique_ptr<SEAddNode> new_node{new SEAddNode(&analysis_)}; in FoldRecurrentAddExpressions() local
|
| /third_party/grpc/src/core/lib/security/credentials/alts/ |
| D | grpc_alts_credentials_client_options.cc | 98 target_service_account* new_node = in alts_client_options_copy() local
|
| /third_party/jerryscript/jerry-core/api/ |
| D | generate-bytecode.c | 283 dir_node *head, *curr, *end, *new_node; in walk_directory() local
423 dir_node *head, *curr, *end, *new_node; in walk_del_bytecode() local
|
| /third_party/python/Python/ |
| D | hamt.c | 846 PyHamtNode_Array *new_node = NULL; in hamt_node_bitmap_assoc() local
931 PyHamtNode_Bitmap *new_node = in hamt_node_bitmap_assoc() local
968 PyHamtNode **new_node) in hamt_node_bitmap_without()
1339 PyHamtNode_Collision *new_node; in hamt_node_collision_assoc() local
1419 PyHamtNode_Bitmap *new_node; in hamt_node_collision_assoc() local
1447 PyHamtNode **new_node) in hamt_node_collision_without()
1701 PyHamtNode_Array *new_node; in hamt_node_array_assoc() local
1774 PyHamtNode **new_node) in hamt_node_array_without()
2068 PyHamtNode **new_node) in hamt_node_without()
|
| /third_party/boost/boost/xpressive/detail/core/ |
| D | list.hpp | 117 node *new_node = new node(t); in push_front() local
128 node *new_node = new node(t); in push_back() local
|
| /third_party/uboot/u-boot-2020.01/fs/cbfs/ |
| D | cbfs.c | 83 u32 align, struct cbfs_cachenode *new_node, in file_cbfs_next_file()
135 struct cbfs_cachenode *new_node; in file_cbfs_fill_cache() local
|
| /third_party/boringssl/src/third_party/googletest/samples/ |
| D | sample3-inl.h | 116 QueueNode<E>* new_node = new QueueNode<E>(element); in Enqueue() local
|
| /third_party/googletest/googletest/samples/ |
| D | sample3-inl.h | 115 QueueNode<E>* new_node = new QueueNode<E>(element); in Enqueue() local
|
| /third_party/boost/boost/polygon/ |
| D | voronoi_builder.hpp | 239 key_type new_node(*it_first, *it_second); in init_beach_line_collinear_sites() local
458 key_type new_node(site_event, site_event); in insert_new_arc() local
|
| /third_party/boost/boost/spirit/home/x3/string/ |
| D | tst.hpp | 111 node* new_node(Char id) in new_node() function
|
| /third_party/boost/boost/spirit/home/qi/string/ |
| D | tst.hpp | 115 node* new_node(Char id) in new_node() function
|
| /third_party/cef/tools/yapf/yapf/yapflib/ |
| D | pytree_utils.py | 166 def _InsertNodeAt(new_node, target, after=False): argument
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 218 int new_node = next_node++; in TEST() local
321 int new_node = next_node++; in TEST() local
|