43 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
45 insert_imp(const_reference r_val,
true_type)
48 key_const_reference key =
PB_DS_V2F(r_val);
49 comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(key);
50 entry_pointer p_e = m_entries[pos_hash_pair.first];
51 resize_base::notify_insert_search_start();
53 while (p_e != 0 && !hash_eq_fn_base::operator()(
PB_DS_V2F(p_e->m_value),
55 key, pos_hash_pair.second))
57 resize_base::notify_insert_search_collision();
61 resize_base::notify_insert_search_end();
69 return std::make_pair(insert_new_imp(r_val, pos_hash_pair),
true);
#define false
Definition: stdbool.h:35
#define true
Definition: stdbool.h:34
#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
#define PB_DS_CHECK_KEY_EXISTS(_Key)
Definition: container_base_dispatch.hpp:55
#define PB_DS_ASSERT_VALID(X)
Definition: binary_heap_.hpp:324
#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