| /third_party/boost/boost/container/ |
| D | slist.hpp | 503 this->erase_after(prev, end_n); in assign()
966 iterator erase_after(const_iterator prev_p) in erase_after() function in boost::container::slist
982 iterator erase_after(const_iterator before_first, const_iterator last) in erase_after() function in boost::container::slist
1457 { return iterator(this->erase_after(previous(p))); } in erase()
1468 { return iterator(this->erase_after(previous(first), last)); } in erase()
1628 this->erase_after(last_pos, const_iterator(end_n)); in priv_try_shrink()
|
| /third_party/skia/src/gpu/ |
| D | GrClientMappedBufferManager.cpp | 59 fClientHeldBuffers.erase_after(prev); in remove()
|
| /third_party/boost/boost/intrusive/ |
| D | slist.hpp | 913 iterator erase_after(const_iterator prev) in erase_after() function in boost::intrusive::slist_impl
929 iterator erase_after(const_iterator before_f, const_iterator l) in erase_after() function in boost::intrusive::slist_impl
961 iterator erase_after(const_iterator before_f, const_iterator l, size_type n) in erase_after() function in boost::intrusive::slist_impl
965 return this->erase_after(before_f, l); in erase_after()
996 { return this->erase_after(this->previous(i)); } in erase()
1013 { return this->erase_after(this->previous(f), l); } in erase()
1030 { return this->erase_after(this->previous(f), l, n); } in erase()
1637 this->erase_after( const_iterator(bbeg, this->priv_value_traits_ptr()) in remove_if()
|
| D | hashtable.hpp | 785 b.erase_after(sbefore_first, slast); in priv_erase_from_single_bucket()
799 b.erase_after(sbefore_first, slast); in priv_erase_from_single_bucket()
|
| /third_party/boost/boost/container/detail/ |
| D | node_pool_impl.hpp | 125 m_freelist.erase_after( m_freelist.before_begin() in allocate_nodes()
175 it = m_blocklist.erase_after(bit); in deallocate_free_blocks()
|
| D | multiallocation_chain.hpp | 144 void erase_after(iterator before_b, iterator e, size_type n) in erase_after() function in boost::container::dtl::basic_multiallocation_chain
145 { slist_impl_.erase_after(before_b, e, n); } in erase_after()
|
| D | adaptive_node_pool_impl.hpp | 787 free_nodes.erase_after(it_bbeg, it_end, num_elems); in priv_allocate_nodes()
858 nodes.erase_after(itbb, itf, splice_node_count); in priv_deallocate_nodes()
|
| /third_party/gn/src/base/containers/ |
| D | flat_tree.h | 459 iterator erase_after;
462 erase_after = std::unique(first, last, comparator);
465 erase_after = LastUnique(first, last, comparator);
468 erase(erase_after, last);
|
| /third_party/boost/libs/intrusive/test/ |
| D | slist_test.cpp | 246 testlist.erase_after (i); in test_insert()
|
| /third_party/boost/libs/container/doc/ |
| D | container.qbk | 490 ["['Slist provides the member functions insert_after and erase_after, which are constant time opera…
491 always use insert_after and erase_after whenever possible. If you find that insert_after and erase_…
|