Home
last modified time | relevance | path

Searched refs:to_erase (Results 1 – 10 of 10) sorted by relevance

/third_party/boost/boost/intrusive/
Dlist.hpp319 node_ptr to_erase = node_traits::get_previous(this->get_root_node()); in pop_back_and_dispose() local
320 node_algorithms::unlink(to_erase); in pop_back_and_dispose()
323 node_algorithms::init(to_erase); in pop_back_and_dispose()
324 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_back_and_dispose()
352 node_ptr to_erase = node_traits::get_next(this->get_root_node()); in pop_front_and_dispose() local
353 node_algorithms::unlink(to_erase); in pop_front_and_dispose()
356 node_algorithms::init(to_erase); in pop_front_and_dispose()
357 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_front_and_dispose()
668 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
670 node_algorithms::unlink(to_erase); in erase_and_dispose()
[all …]
Dslist.hpp413 node_ptr to_erase(it.pointed_node()); in clear_and_dispose() local
416 node_algorithms::init(to_erase); in clear_and_dispose()
417 disposer(priv_value_traits().to_value_ptr(to_erase)); in clear_and_dispose()
492 node_ptr to_erase = node_traits::get_next(this->get_root_node()); in pop_front_and_dispose() local
496 node_algorithms::init(to_erase); in pop_front_and_dispose()
497 disposer(priv_value_traits().to_value_ptr(to_erase)); in pop_front_and_dispose()
1051 node_ptr to_erase(it.pointed_node()); in erase_after_and_dispose() local
1055 if(cache_last && (to_erase == this->get_last_node())){ in erase_after_and_dispose()
1059 node_algorithms::init(to_erase); in erase_after_and_dispose()
1060 disposer(priv_value_traits().to_value_ptr(to_erase)); in erase_after_and_dispose()
[all …]
Dtreap.hpp855 node_ptr to_erase(i.pointed_node()); in erase() local
856 …_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || !node_algorithms::unique(to_erase)); in erase()
858 (this->tree_type::header_ptr(), to_erase, this->prio_node_prio_comp(this->priv_pcomp())); in erase()
861 node_algorithms::init(to_erase); in erase()
927 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
929 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
Dsgtree.hpp623 node_ptr to_erase(i.pointed_node()); in erase() local
625 BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!node_algorithms::unique(to_erase)); in erase()
628 ( this->tree_type::header_ptr(), to_erase, (std::size_t)this->size() in erase()
633 node_algorithms::init(to_erase); in erase()
661 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
663 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
Dbstree.hpp1423 node_ptr to_erase(i.pointed_node()); in erase() local
1425 BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!node_algorithms::unique(to_erase)); in erase()
1426 node_algorithms::erase(this->header_ptr(), to_erase); in erase()
1429 node_algorithms::init(to_erase); in erase()
1498 node_ptr to_erase(i.pointed_node()); in erase_and_dispose() local
1500 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
/third_party/boost/libs/range/doc/reference/algorithm_ext/
Derase.qbk14 iterator_range<typename Container::iterator> to_erase);
19 `erase` the iterator range `to_erase` from the container `target`.
35 Linear. Proprotional to `distance(to_erase)`.
/third_party/boost/boost/range/algorithm_ext/
Derase.hpp28 iterator_range<BOOST_DEDUCED_TYPENAME Container::iterator> to_erase ) in erase() argument
31 on.erase( boost::begin(to_erase), boost::end(to_erase) ); in erase()
/third_party/boost/boost/container/
Dlist.hpp1431 size_type to_erase = len - new_size; in priv_try_shrink() local
1433 if(to_erase < len/2u){ in priv_try_shrink()
1435 while(to_erase--){ in priv_try_shrink()
1441 size_type to_skip = len - to_erase; in priv_try_shrink()
/third_party/abseil-cpp/absl/container/internal/
Dbtree.h761 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1555 const field_type to_erase,
1558 value_destroy_n(i, to_erase, alloc);
1560 const field_type src_i = i + to_erase;
1565 for (int j = 0; j < to_erase; ++j) {
1569 for (int j = i + to_erase + 1; j <= orig_finish; ++j) {
1570 set_child(j - to_erase, child(j));
1574 set_finish(orig_finish - to_erase);
2193 const size_type to_erase =
2195 begin.node->remove_values(begin.position, to_erase, mutable_allocator());
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
Dbtree.h837 void remove_values(field_type i, field_type to_erase, allocator_type *alloc);
1609 const field_type to_erase,
1612 value_destroy_n(i, to_erase, alloc);
1614 const field_type src_i = i + to_erase;
1619 for (int j = 0; j < to_erase; ++j) {
1623 for (int j = i + to_erase + 1; j <= orig_finish; ++j) {
1624 set_child(j - to_erase, child(j));
1628 set_finish(orig_finish - to_erase);
2245 const size_type to_erase =
2247 begin.node->remove_values(begin.position, to_erase, mutable_allocator());
[all …]