44 erase_entry(entry_pointer p_e)
48 p_e->m_value.~value_type();
51 resize_base::notify_erased(--m_num_used_e);
59 for (size_type pos = 0; pos < m_num_e; ++pos)
61 entry_pointer p_e = &m_entries[pos];
65 do_resize_if_needed_no_throw();
66 resize_base::notify_cleared();
70 template<
typename Pred>
71 inline typename PB_DS_CLASS_C_DEC::size_type
76 size_type num_ersd = 0;
77 for (size_type pos = 0; pos < m_num_e; ++pos)
79 entry_pointer p_e = &m_entries[pos];
81 if (pred(p_e->m_value))
88 do_resize_if_needed_no_throw();
96 erase(key_const_reference r_key)
97 {
return erase_imp(r_key, traits_base::m_store_extra_indicator); }
#define _GLIBCXX_DEBUG_ASSERT(_Condition)
Definition: debug.h:61
#define _GLIBCXX_DEBUG_ONLY(_Statement)
Definition: debug.h:63
#define PB_DS_CLASS_C_DEC
Definition: bin_search_tree_.hpp:71
#define PB_DS_CLASS_T_DEC
Definition: bin_search_tree_.hpp:67
return(unsigned int) __res
#define PB_DS_ASSERT_VALID(X)
Definition: binary_heap_.hpp:324
valid_entry_status
Definition: gp_ht_map_.hpp:159
erased_entry_status
Definition: gp_ht_map_.hpp:159
#define PB_DS_V2F(X)
Definition: container_base_dispatch.hpp:80