45 erase_imp(key_const_reference r_key,
true_type)
47 const comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
49 resize_base::notify_erase_search_start();
50 for (i = 0; i < m_num_e; ++i)
52 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
54 entry*
const p_e = m_entries + pos;
59 resize_base::notify_erase_search_end();
65 if (hash_eq_fn_base::operator()(
PB_DS_V2F(p_e->m_value), p_e->m_hash,
66 r_key, pos_hash_pair.second))
68 resize_base::notify_erase_search_end();
70 do_resize_if_needed_no_throw();
80 resize_base::notify_erase_search_collision();
82 resize_base::notify_erase_search_end();
#define false
Definition: stdbool.h:35
#define _GLIBCXX_DEBUG_ASSERT(_Condition)
Definition: debug.h:61
#define PB_DS_CLASS_T_DEC
Definition: bin_search_tree_.hpp:67
return(unsigned int) __res
std::tr1::integral_constant< int, 1 > true_type
Definition: type_utils.hpp:70
valid_entry_status
Definition: gp_ht_map_.hpp:159
empty_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
#define PB_DS_CHECK_KEY_DOES_NOT_EXIST(_Key)
Definition: container_base_dispatch.hpp:58