/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | constructor_destructor_fn_imps.hpp | 64 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 65 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 75 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 76 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 87 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 88 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) 90 std::fill(m_entries, m_entries + m_num_e, (entry_pointer)NULL); 92 ranged_hash_fn_base::notify_resized(m_num_e); 102 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 103 m_entries(s_entry_pointer_allocator.allocate(m_num_e)) [all...] |
H A D | resize_fn_imps.hpp | 48 resize_imp(resize_base::get_new_size(m_num_e, m_num_used_e)); 68 resize_imp(resize_base::get_new_size(m_num_e, m_num_used_e)); 82 if (new_size == m_num_e) 85 const size_type old_size = m_num_e; 95 m_num_e = new_size; 114 std::fill(a_p_entries_resized, a_p_entries_resized + m_num_e, 124 m_num_e = new_size;
|
H A D | trace_fn_imps.hpp | 48 std::cerr << static_cast<unsigned long>(m_num_e) << " " 51 for (size_type i = 0; i < m_num_e; ++i)
|
H A D | debug_fn_imps.hpp | 58 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 94 for (size_type pos = 0; pos < m_num_e; ++pos)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | resize_fn_imps.hpp | 48 resize_imp(resize_base::get_new_size(m_num_e, m_num_used_e)); 68 resize_imp(resize_base::get_new_size(m_num_e, m_num_used_e)); 82 typename Allocator::group_adjustor adjust(m_num_e); 85 if (new_size == m_num_e) 89 const size_type old_size = m_num_e; 96 m_num_e = new_size; 98 for (size_type i = 0; i < m_num_e; ++i) 108 m_num_e = old_size;
|
H A D | trace_fn_imps.hpp | 48 std::cerr << static_cast<unsigned long>(m_num_e) << " " << 51 for (size_type i = 0; i < m_num_e; ++i)
|
H A D | constructor_destructor_fn_imps.hpp | 60 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 61 m_entries(s_entry_allocator.allocate(m_num_e)) 71 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 72 m_entries(s_entry_allocator.allocate(m_num_e)) 83 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 84 m_entries(s_entry_allocator.allocate(m_num_e)) 97 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 98 m_entries(s_entry_allocator.allocate(m_num_e)) 111 m_num_e(resize_base::get_nearest_larger_size(1)), m_num_used_e(0), 112 m_entries(s_entry_allocator.allocate(m_num_e)) [all...] |
H A D | insert_no_store_hash_fn_imps.hpp | 53 size_type ins_pos = m_num_e; 55 for (i = 0; i < m_num_e; ++i) 58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e); 66 return (ins_pos == m_num_e) ? pos : ins_pos; 70 if (ins_pos == m_num_e) 88 if (ins_pos == m_num_e)
|
H A D | insert_store_hash_fn_imps.hpp | 55 size_type ins_pos = m_num_e; 57 for (i = 0; i < m_num_e; ++i) 69 return ((ins_pos == m_num_e) ? 75 if (ins_pos == m_num_e) 93 if (ins_pos == m_num_e) 107 _GLIBCXX_DEBUG_ASSERT(pos_hash_pair.first < m_num_e);
|
H A D | debug_no_store_hash_fn_imps.hpp | 49 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | debug_store_hash_fn_imps.hpp | 50 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | resize_no_store_hash_fn_imps.hpp | 51 for (i = 0; i < m_num_e; ++i)
|
H A D | resize_store_hash_fn_imps.hpp | 52 for (i = 0; i < m_num_e; ++i)
|
H A D | erase_fn_imps.hpp | 59 for (size_type pos = 0; pos < m_num_e; ++pos) 77 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | erase_no_store_hash_fn_imps.hpp | 52 for (i = 0; i < m_num_e; ++i)
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/ |
H A D | resize_fn_imps.hpp | 54 do_resize(my_resize_base::get_new_size(m_num_e, m_num_used_e)); 71 do_resize(my_resize_base::get_new_size(m_num_e, m_num_used_e)); 86 throw_prob_adjustor adjust(m_num_e); 91 const size_type old_size = m_num_e; 110 m_num_e = new_size; 112 for (size_type i = 0; i < m_num_e; ++i) 123 m_num_e = old_size;
|
H A D | constructor_destructor_fn_imps.hpp | 66 m_num_e(Resize_Policy::get_init_size()), 80 m_num_e(Resize_Policy::get_init_size()), 95 m_num_e(Resize_Policy::get_init_size()), 111 m_num_e(Resize_Policy::get_init_size()), 127 m_num_e(Resize_Policy::get_init_size()), 144 m_num_e(Resize_Policy::get_init_size()), 159 r_other.m_num_e)), 160 m_num_e(r_other.m_num_e), 167 for (size_type i = 0; i < m_num_e; [all...] |
H A D | debug_no_store_hash_fn_imps.hpp | 54 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | iterator_fn_imps.hpp | 104 for (++r_pos; r_pos < m_num_e; ++r_pos) 127 for (++r_pos; r_pos < m_num_e; ++r_pos) 147 for (r_pos = 0; r_pos < m_num_e; ++r_pos) 167 for (r_pos = 0; r_pos < m_num_e; ++r_pos)
|
H A D | insert_no_store_hash_fn_imps.hpp | 58 size_type ins_pos = m_num_e; 62 for (i = 0; i < m_num_e; ++i) 78 return ((ins_pos == m_num_e)? pos : ins_pos); 82 if (ins_pos == m_num_e) 105 if (ins_pos == m_num_e)
|
H A D | debug_store_hash_fn_imps.hpp | 54 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | resize_no_store_hash_fn_imps.hpp | 57 for (i = 0; i < m_num_e; ++i)
|
H A D | erase_fn_imps.hpp | 67 for (size_type pos = 0; pos < m_num_e; ++pos) 90 for (size_type pos = 0; pos < m_num_e; ++pos)
|
H A D | insert_store_hash_fn_imps.hpp | 60 size_type ins_pos = m_num_e; 64 for (i = 0; i < m_num_e; ++i) 80 return ((ins_pos == m_num_e)? 86 if (ins_pos == m_num_e) 112 if (ins_pos == m_num_e)
|