/third_party/boost/boost/intrusive/ |
D | list.hpp | 317 void pop_back_and_dispose(Disposer disposer) in pop_back_and_dispose() argument 324 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_back_and_dispose() 350 void pop_front_and_dispose(Disposer disposer) in pop_front_and_dispose() argument 357 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_front_and_dispose() 666 iterator erase_and_dispose(const_iterator i, Disposer disposer) in erase_and_dispose() argument 674 disposer(this->priv_value_traits().to_value_ptr(to_erase)); in erase_and_dispose() 680 iterator erase_and_dispose(iterator i, Disposer disposer) in erase_and_dispose() argument 681 { return this->erase_and_dispose(const_iterator(i), disposer); } in erase_and_dispose() 699 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) in erase_and_dispose() argument 708 disposer(priv_value_traits().to_value_ptr(to_erase)); in erase_and_dispose() [all …]
|
D | slist.hpp | 409 void clear_and_dispose(Disposer disposer) in clear_and_dispose() argument 417 disposer(priv_value_traits().to_value_ptr(to_erase)); in clear_and_dispose() 490 void pop_front_and_dispose(Disposer disposer) in pop_front_and_dispose() argument 497 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_front_and_dispose() 768 void clone_from(const slist_impl &src, Cloner cloner, Disposer disposer) in clone_from() argument 770 this->clear_and_dispose(disposer); in clone_from() 772 rollback(*this, disposer); in clone_from() 796 void clone_from(BOOST_RV_REF(slist_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 798 this->clear_and_dispose(disposer); in clone_from() 800 rollback(*this, disposer); in clone_from() [all …]
|
D | set.hpp | 196 void clone_from(const set_impl &src, Cloner cloner, Disposer disposer); 206 void clone_from(BOOST_RV_REF(set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 207 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 275 iterator erase_and_dispose(const_iterator i, Disposer disposer); 279 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 283 size_type erase_and_dispose(const key_type &key, Disposer disposer); 287 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 294 void clear_and_dispose(Disposer disposer); 551 BOOST_INTRUSIVE_FORCEINLINE void clone_from(const set &src, Cloner cloner, Disposer disposer) in clone_from() argument 552 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | bs_set.hpp | 193 void clone_from(const bs_set_impl &src, Cloner cloner, Disposer disposer); 203 void clone_from(BOOST_RV_REF(bs_set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 204 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 272 iterator erase_and_dispose(const_iterator i, Disposer disposer); 276 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 280 size_type erase_and_dispose(const key_type &key, Disposer disposer); 284 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 291 void clear_and_dispose(Disposer disposer); 548 BOOST_INTRUSIVE_FORCEINLINE void clone_from(const bs_set &src, Cloner cloner, Disposer disposer) in clone_from() argument 549 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | avl_set.hpp | 196 void clone_from(const avl_set_impl &src, Cloner cloner, Disposer disposer); 206 void clone_from(BOOST_RV_REF(avl_set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 207 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 275 iterator erase_and_dispose(const_iterator i, Disposer disposer); 279 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 283 size_type erase_and_dispose(const key_type &key, Disposer disposer); 287 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 294 void clear_and_dispose(Disposer disposer); 551 BOOST_INTRUSIVE_FORCEINLINE void clone_from(const avl_set &src, Cloner cloner, Disposer disposer) in clone_from() argument 552 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | unordered_set.hpp | 189 void clone_from(const unordered_set_impl &src, Cloner cloner, Disposer disposer); 199 …FORCEINLINE void clone_from(BOOST_RV_REF(unordered_set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 200 { table_type::clone_from(BOOST_MOVE_BASE(table_type, src), cloner, disposer); } in clone_from() 244 erase_and_dispose(const_iterator i, Disposer disposer); 248 void erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 252 size_type erase_and_dispose(const key_type &key, Disposer disposer); 256 …erase_and_dispose(const KeyType& key, KeyHasher hash_func, KeyEqual equal_func, Disposer disposer); 263 void clear_and_dispose(Disposer disposer); 528 …T_INTRUSIVE_FORCEINLINE void clone_from(const unordered_set &src, Cloner cloner, Disposer disposer) in clone_from() argument 529 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | treap.hpp | 395 void clone_from(const treap_impl &src, Cloner cloner, Disposer disposer) in clone_from() argument 397 tree_type::clone_from(src, cloner, disposer); in clone_from() 416 void clone_from(BOOST_RV_REF(treap_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 418 tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); in clone_from() 925 iterator erase_and_dispose(const_iterator i, Disposer disposer) in erase_and_dispose() argument 929 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose() 935 iterator erase_and_dispose(iterator i, Disposer disposer) in erase_and_dispose() argument 936 { return this->erase_and_dispose(const_iterator(i), disposer); } in erase_and_dispose() 952 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) in erase_and_dispose() argument 953 { size_type n; return private_erase(b, e, n, disposer); } in erase_and_dispose() [all …]
|
D | rbtree.hpp | 229 void clone_from(const rbtree_impl &src, Cloner cloner, Disposer disposer); 239 void clone_from(BOOST_RV_REF(rbtree_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 240 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 246 void clone_from(rbtree_impl &&src, Cloner cloner, Disposer disposer); 314 iterator erase_and_dispose(const_iterator i, Disposer disposer); 318 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 322 size_type erase_and_dispose(const key_type &key, Disposer disposer); 326 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 333 void clear_and_dispose(Disposer disposer); 564 BOOST_INTRUSIVE_FORCEINLINE void clone_from(const rbtree &src, Cloner cloner, Disposer disposer) in clone_from() argument [all …]
|
D | splay_set.hpp | 194 void clone_from(const splay_set_impl &src, Cloner cloner, Disposer disposer); 204 void clone_from(BOOST_RV_REF(splay_set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 205 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 273 iterator erase_and_dispose(const_iterator i, Disposer disposer); 277 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 281 size_type erase_and_dispose(const key_type &key, Disposer disposer); 285 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 292 void clear_and_dispose(Disposer disposer); 572 …BOOST_INTRUSIVE_FORCEINLINE void clone_from(const splay_set &src, Cloner cloner, Disposer disposer) in clone_from() argument 573 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | treap_set.hpp | 202 void clone_from(const treap_set_impl &src, Cloner cloner, Disposer disposer); 212 void clone_from(BOOST_RV_REF(treap_set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 213 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 306 iterator erase_and_dispose(const_iterator i, Disposer disposer); 310 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 314 size_type erase_and_dispose(const key_type &key, Disposer disposer); 318 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 325 void clear_and_dispose(Disposer disposer); 571 …BOOST_INTRUSIVE_FORCEINLINE void clone_from(const treap_set &src, Cloner cloner, Disposer disposer) in clone_from() argument 572 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | sg_set.hpp | 194 void clone_from(const sg_set_impl &src, Cloner cloner, Disposer disposer); 204 void clone_from(BOOST_RV_REF(sg_set_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 205 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 273 iterator erase_and_dispose(const_iterator i, Disposer disposer); 277 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 281 size_type erase_and_dispose(const key_type &key, Disposer disposer); 285 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 292 void clear_and_dispose(Disposer disposer); 560 BOOST_INTRUSIVE_FORCEINLINE void clone_from(const sg_set &src, Cloner cloner, Disposer disposer) in clone_from() argument 561 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | sgtree.hpp | 431 void clone_from(const sgtree_impl &src, Cloner cloner, Disposer disposer) in clone_from() argument 433 tree_type::clone_from(src, cloner, disposer); in clone_from() 440 void clone_from(BOOST_RV_REF(sgtree_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 442 tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); in clone_from() 659 iterator erase_and_dispose(const_iterator i, Disposer disposer) in erase_and_dispose() argument 663 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose() 669 iterator erase_and_dispose(iterator i, Disposer disposer) in erase_and_dispose() argument 670 { return this->erase_and_dispose(const_iterator(i), disposer); } in erase_and_dispose() 675 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) in erase_and_dispose() argument 676 { size_type n; return private_erase(b, e, n, disposer); } in erase_and_dispose() [all …]
|
D | avltree.hpp | 230 void clone_from(const avltree_impl &src, Cloner cloner, Disposer disposer); 240 void clone_from(BOOST_RV_REF(avltree_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 241 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 311 iterator erase_and_dispose(const_iterator i, Disposer disposer); 315 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 319 size_type erase_and_dispose(const key_type &key, Disposer disposer); 323 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 330 void clear_and_dispose(Disposer disposer); 561 BOOST_INTRUSIVE_FORCEINLINE void clone_from(const avltree &src, Cloner cloner, Disposer disposer) in clone_from() argument 562 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | splaytree.hpp | 225 void clone_from(const splaytree_impl &src, Cloner cloner, Disposer disposer); 235 void clone_from(BOOST_RV_REF(splaytree_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 236 { tree_type::clone_from(BOOST_MOVE_BASE(tree_type, src), cloner, disposer); } in clone_from() 306 iterator erase_and_dispose(const_iterator i, Disposer disposer); 310 iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); 314 size_type erase_and_dispose(const key_type &key, Disposer disposer); 318 size_type erase_and_dispose(const KeyType& key, KeyTypeKeyCompare comp, Disposer disposer); 325 void clear_and_dispose(Disposer disposer); 639 …BOOST_INTRUSIVE_FORCEINLINE void clone_from(const splaytree &src, Cloner cloner, Disposer disposer) in clone_from() argument 640 { Base::clone_from(src, cloner, disposer); } in clone_from() [all …]
|
D | bstree.hpp | 999 void clone_from(const bstree_impl &src, Cloner cloner, Disposer disposer) in clone_from() argument 1001 this->clear_and_dispose(disposer); in clone_from() 1004 rollback(*this, disposer); in clone_from() 1009 … ,detail::node_disposer<Disposer, value_traits, AlgoType>(disposer, &this->get_value_traits())); in clone_from() 1034 void clone_from(BOOST_RV_REF(bstree_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 1036 this->clear_and_dispose(disposer); in clone_from() 1039 rollback(*this, disposer); in clone_from() 1044 … ,detail::node_disposer<Disposer, value_traits, AlgoType>(disposer, &this->get_value_traits())); in clone_from() 1496 iterator erase_and_dispose(const_iterator i, Disposer disposer) in erase_and_dispose() argument 1500 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose() [all …]
|
D | hashtable.hpp | 1780 make_node_disposer(const Disposer &disposer) const in make_node_disposer() 1783 return return_t(disposer, &this->priv_value_traits()); in make_node_disposer() 2054 …_INTRUSIVE_FORCEINLINE void clone_from(const hashtable_impl &src, Cloner cloner, Disposer disposer) in clone_from() argument 2055 { this->priv_clone_from(src, cloner, disposer); } in clone_from() 2077 …IVE_FORCEINLINE void clone_from(BOOST_RV_REF(hashtable_impl) src, Cloner cloner, Disposer disposer) in clone_from() argument 2078 { this->priv_clone_from(static_cast<hashtable_impl&>(src), cloner, disposer); } in clone_from() 2356 erase_and_dispose(const_iterator i, Disposer disposer) in BOOST_INTRUSIVE_DOC1ST() 2361 …_bucket_pointer()[first_bucket_num], first_local_it, make_node_disposer(disposer), optimize_multik… in BOOST_INTRUSIVE_DOC1ST() 2379 void erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer) in erase_and_dispose() argument 2404 , make_node_disposer(disposer), optimize_multikey_t()); in erase_and_dispose() [all …]
|
D | bstree_algorithms.hpp | 610 static void clear_and_dispose(const node_ptr & header, Disposer disposer) in clear_and_dispose() argument 615 dispose_subtree(source_root, disposer); in clear_and_dispose() 1295 … (const const_node_ptr & source_header, node_ptr target_header, Cloner cloner, Disposer disposer) in clone() argument 1298 clear_and_dispose(target_header, disposer); in clone() 1303 (source_header, target_header, cloner, disposer, leftmost, rightmost); in clone() 1931 , Cloner cloner, Disposer disposer in clone_subtree() argument 1954 dispose_subtree_disposer<Disposer> rollback(disposer, target_sub_root); in clone_subtree() 2005 static void dispose_subtree(node_ptr x, Disposer disposer) in dispose_subtree() argument 2017 disposer(x); in dispose_subtree()
|
D | rbtree_algorithms.hpp | 319 (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer) in clone() argument 322 bstree_algo::clone(source_header, target_header, new_cloner, disposer); in clone() 328 static void clear_and_dispose(const node_ptr & header, Disposer disposer);
|
D | avltree_algorithms.hpp | 304 … (const const_node_ptr & source_header, node_ptr target_header, Cloner cloner, Disposer disposer) in clone() argument 307 bstree_algo::clone(source_header, target_header, new_cloner, disposer); in clone() 313 static void clear_and_dispose(const node_ptr & header, Disposer disposer);
|
D | sgtree_algorithms.hpp | 155 (const_node_ptr source_header, node_ptr target_header, Cloner cloner, Disposer disposer); 159 static void clear_and_dispose(node_ptr header, Disposer disposer);
|
/third_party/node/deps/npm/node_modules/bluebird/js/release/ |
D | using.js | 147 var disposer = resource; 149 resource._setDisposable(disposer); 201 Promise.prototype._setDisposable = function (disposer) { argument 203 this._disposer = disposer; 219 Promise.prototype.disposer = function (fn) { method in Promise
|
/third_party/boost/libs/log/src/ |
D | attribute_set_impl.hpp | 206 struct disposer struct 210 explicit disposer(node_allocator& alloc) : m_Allocator(alloc) in disposer() function 255 m_Nodes.clear_and_dispose(disposer(m_Allocator)); in ~implementation() 264 m_Nodes.clear_and_dispose(disposer(m_Allocator)); in clear() 344 m_Nodes.erase_and_dispose(m_Nodes.iterator_to(*p), disposer(m_Allocator)); in erase()
|
/third_party/flutter/engine/flutter/vulkan/ |
D | vulkan_handle.h | 24 VulkanHandle(Handle handle, Disposer disposer = nullptr) 25 : handle_(handle), disposer_(disposer) {} in handle_()
|
/third_party/boost/boost/heap/ |
D | skew_heap.hpp | 121 node_disposer<skew_heap_node, skew_heap_node, Alloc> disposer(alloc); in clear_subtree() local 122 dispose_child(children[0], disposer); in clear_subtree() 123 dispose_child(children[1], disposer); in clear_subtree() 127 void dispose_child(skew_heap_node * node, Disposer & disposer) in dispose_child() 130 disposer(node); in dispose_child()
|
/third_party/node/deps/npm/node_modules/cacache/lib/util/ |
D | tmp.js | 31 return BB.using(mktmpdir(cache, opts).disposer(rimraf), cb)
|