/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/ |
H A D | entry_list_fn_imps.hpp | 48 deallocate_links_in_list(entry_pointer p_e) argument 50 while (p_e != NULL) 52 entry_pointer p_dealloc_e = p_e; 54 p_e = p_e->m_p_next; 67 entry_pointer p_e = s_entry_allocator.allocate(1); local 71 new (&p_e->m_value) mapped_value_type(r_val); 73 return (p_e); 83 entry_pointer p_e = s_entry_allocator.allocate(1); local 85 cond_dealtor_t cond(p_e); 99 rels_entry(entry_pointer p_e) argument [all...] |
H A D | resize_store_hash_fn_imps.hpp | 49 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, int_to_type<true>) argument 53 PB_ASSOC_V2F(p_e->m_value), 54 p_e->m_hash); 56 entry_pointer const p_next_e = p_e->m_p_next; 58 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first]; 60 a_p_entries_resized[pos_hash_pair.first] = p_e;
|
H A D | resize_no_store_hash_fn_imps.hpp | 49 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, int_to_type<false>) argument 52 my_ranged_hash_fn_base::operator()(PB_ASSOC_V2F(p_e->m_value)); 54 entry_pointer const p_next_e = p_e->m_p_next; 56 p_e->m_p_next = a_p_entries_resized[hash_pos]; 58 a_p_entries_resized[hash_pos] = p_e;
|
H A D | debug_no_store_hash_fn_imps.hpp | 50 assert_entry_pointer_valid(const entry_pointer p_e, store_hash_false_indicator) const argument 52 my_map_debug_base::check_key_exists(p_e->m_value.first);
|
H A D | debug_store_hash_fn_imps.hpp | 50 assert_entry_pointer_valid(const entry_pointer p_e, store_hash_true_indicator) const argument 52 my_map_debug_base::check_key_exists(p_e->m_value.first); 55 my_ranged_hash_fn_base::operator()(p_e->m_value.first); 57 PB_ASSOC_DBG_ASSERT(p_e->m_hash == pos_hash_pair.second);
|
H A D | find_no_store_hash_fn_imps.hpp | 62 entry_pointer p_e = local 67 while (p_e != NULL&& 68 !my_hash_eq_fn_base::operator()(PB_ASSOC_V2F(p_e->m_value), r_key)) 72 p_e = p_e->m_p_next; 78 if (p_e == NULL) 84 return (&p_e->m_value);
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 52 entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator); local 56 p_e->m_p_next = m_a_p_entries[pos]; 58 p_e->m_hash = my_ranged_hash_fn_base::operator()((const_key_reference)(PB_ASSOC_V2F(p_e->m_value))).second; 60 m_a_p_entries[pos] = p_e;
|
H A D | insert_no_store_hash_fn_imps.hpp | 55 entry_pointer p_e = m_a_p_entries[pos]; local 59 while (p_e != NULL&& 60 !my_hash_eq_fn_base::operator()(p_e->m_value.first, r_key)) 64 p_e = p_e->m_p_next; 69 if (p_e != NULL) 73 return (p_e->m_value.second); 92 entry_pointer p_e = m_a_p_entries[pos]; local 96 while (p_e != NULL&& 98 PB_ASSOC_V2F(p_e 132 entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator); local [all...] |
H A D | find_store_hash_fn_imps.hpp | 63 entry_pointer p_e = m_a_p_entries[pos_hash_pair.first]; local 67 while (p_e != NULL&& 68 !my_hash_eq_fn_base::operator()(PB_ASSOC_V2F(p_e->m_value), 69 p_e->m_hash, 75 p_e = p_e->m_p_next; 81 if (p_e == NULL) 87 return (const_cast<pointer>(&p_e->m_value));
|
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 52 entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator); local 56 p_e->m_p_next = m_a_p_entries[pos]; 58 m_a_p_entries[pos] = p_e;
|
H A D | insert_store_hash_fn_imps.hpp | 55 entry_pointer p_e = m_a_p_entries[pos_hash_pair.first]; local 59 while (p_e != NULL&& 60 !my_hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second)) 64 p_e = p_e->m_p_next; 69 if (p_e != NULL) 73 return (p_e->m_value.second); 93 entry_pointer p_e = m_a_p_entries[pos_hash_pair.first]; local 97 while (p_e ! 139 entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator); local [all...] |
H A D | debug_fn_imps.hpp | 66 entry_pointer p_e = a_p_entries[pos]; local 68 while (p_e != NULL) 72 assert_entry_pointer_valid(p_e, my_traits_base::m_store_hash_indicator); 74 p_e = p_e->m_p_next;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | resize_store_hash_fn_imps.hpp | 45 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, true_type) argument 48 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash); 50 entry_pointer const p_next_e = p_e->m_p_next; 51 p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first]; 52 a_p_entries_resized[pos_hash_pair.first] = p_e;
|
H A D | entry_list_fn_imps.hpp | 44 deallocate_links_in_list(entry_pointer p_e) argument 46 while (p_e != NULL) 48 entry_pointer p_dealloc_e = p_e; 49 p_e = p_e->m_p_next; 60 entry_pointer p_e = s_entry_allocator.allocate(1); local 63 new (&p_e->m_value) value_type(r_val); 64 return p_e; 73 entry_pointer p_e = s_entry_allocator.allocate(1); local 74 cond_dealtor_t cond(p_e); 85 rels_entry(entry_pointer p_e) argument [all...] |
H A D | resize_no_store_hash_fn_imps.hpp | 45 resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, false_type) argument 48 ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value)); 50 entry_pointer const p_next_e = p_e->m_p_next; 51 p_e->m_p_next = a_p_entries_resized[hash_pos]; 52 a_p_entries_resized[hash_pos] = p_e;
|
H A D | debug_store_hash_fn_imps.hpp | 46 assert_entry_pointer_valid(const entry_pointer p_e, true_type) const argument 48 debug_base::check_key_exists(PB_DS_V2F(p_e->m_value)); 49 comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value)); 50 _GLIBCXX_DEBUG_ASSERT(p_e->m_hash == pos_hash_pair.second);
|
H A D | insert_store_hash_fn_imps.hpp | 50 entry_pointer p_e = m_entries[pos_hash_pair.first]; local 53 while (p_e != NULL && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), 54 p_e->m_hash, 58 p_e = p_e->m_p_next; 62 if (p_e != NULL) 65 return std::make_pair(&p_e->m_value, false);
|
H A D | debug_fn_imps.hpp | 60 entry_pointer p_e = a_p_entries[pos]; local 61 while (p_e != NULL) 64 assert_entry_pointer_valid(p_e, traits_base::m_store_extra_indicator); 65 p_e = p_e->m_p_next;
|
H A D | insert_no_store_hash_fn_imps.hpp | 50 entry_pointer p_e = m_entries[pos]; local 53 while (p_e != NULL && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), 57 p_e = p_e->m_p_next; 61 if (p_e != NULL) 64 return std::make_pair(&p_e->m_value, false);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 49 entry* const p_e = m_entries + pos; local 50 new (&p_e->m_value) mapped_value_type(r_val); 51 p_e->m_stat = valid_entry_status; 52 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(p_e->m_value.first);)
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 49 entry* const p_e = m_entries + pos; local 50 new (&p_e->m_value) mapped_value_type(r_val); 51 p_e->m_hash = ranged_probe_fn_base::operator()(PB_DS_V2F(r_val)).second; 52 p_e->m_stat = valid_entry_status; 53 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(p_e->m_value.first);)
|
H A D | erase_fn_imps.hpp | 44 erase_entry(entry_pointer p_e) argument 46 _GLIBCXX_DEBUG_ASSERT(p_e->m_stat = valid_entry_status); 47 _GLIBCXX_DEBUG_ONLY(debug_base::erase_existing(PB_DS_V2F(p_e->m_value));) 48 p_e->m_value.~value_type(); 49 p_e->m_stat = erased_entry_status; 61 entry_pointer p_e = &m_entries[pos]; local 62 if (p_e->m_stat == valid_entry_status) 63 erase_entry(p_e); 79 entry_pointer p_e = &m_entries[pos]; local 80 if (p_e [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/ |
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 53 entry* const p_e = m_a_entries + pos; local 55 new (&p_e->m_value) mapped_value_type(r_val); 57 p_e->m_stat = VALID_ENTRY_STATUS; 60 insert_new(p_e->m_value.first);)
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 53 entry* const p_e = m_a_entries + pos; local 55 new (&p_e->m_value) mapped_value_type(r_val); 57 p_e->m_hash = my_ranged_probe_fn_base::operator()( 60 p_e->m_stat = VALID_ENTRY_STATUS; 63 insert_new(p_e->m_value.first);)
|
H A D | erase_fn_imps.hpp | 48 erase_entry(entry_pointer p_e) argument 50 PB_ASSOC_DBG_ASSERT(p_e->m_stat = VALID_ENTRY_STATUS); 52 PB_ASSOC_DBG_ONLY(my_map_debug_base::erase_existing(p_e->m_value.first);) 54 p_e->m_value.~value_type(); 56 p_e->m_stat = ERASED_ENTRY_STATUS; 69 entry_pointer p_e =& m_a_entries[pos]; local 71 if (p_e->m_stat == VALID_ENTRY_STATUS) 72 erase_entry(p_e); 92 entry_pointer p_e =& m_a_entries[pos]; local 94 if (p_e [all...] |