| /haiku-buildtools/gcc/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 != 0)
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, argument
49 debug_base::check_key_exists(PB_DS_V2F(p_e->m_value), __file, __line);
50 comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value));
51 PB_DS_DEBUG_VERIFY(p_e->m_hash == pos_hash_pair.second);
|
| H A D | insert_no_store_hash_fn_imps.hpp | 50 entry_pointer p_e = m_entries[pos]; local
53 while (p_e != 0 && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value),
57 p_e = p_e->m_p_next;
61 if (p_e != 0)
64 return std::make_pair(&p_e->m_value, false);
|
| 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 != 0 && !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 != 0)
65 return std::make_pair(&p_e->m_value, false);
|
| H A D | erase_store_hash_fn_imps.hpp | 48 entry_pointer p_e = m_entries[r_pos_hash_pair.first]; local
50 if (p_e == 0)
58 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
71 entry_pointer p_next_e = p_e->m_p_next;
86 erase_entry_pointer(p_e->m_p_next);
92 p_e = p_next_e;
|
| H A D | erase_no_store_hash_fn_imps.hpp | 57 entry_pointer p_e = m_entries[pos]; local
59 if (p_e == 0)
67 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
79 entry_pointer p_next_e = p_e->m_p_next;
92 erase_entry_pointer(p_e->m_p_next);
98 p_e = p_next_e;
|
| H A D | erase_fn_imps.hpp | 48 entry_pointer p_e = r_p_e; local
50 rels_entry(p_e);
72 entry_pointer p_e = m_entries[pos]; local
73 while (p_e != 0 && p_e->m_p_next != 0)
75 if (pred(p_e->m_p_next->m_value))
78 erase_entry_pointer(p_e->m_p_next);
81 p_e = p_e->m_p_next;
|
| H A D | debug_fn_imps.hpp | 61 entry_pointer p_e = a_p_entries[pos]; local
62 while (p_e != 0)
65 assert_entry_pointer_valid(p_e, traits_base::m_store_extra_indicator,
67 p_e = p_e->m_p_next;
|
| H A D | cc_ht_map_.hpp | 415 entry_pointer p_e = m_entries[pos]; local
418 while (p_e != 0
419 && !hash_eq_fn_base::operator()(p_e->m_value.first, r_key))
422 p_e = p_e->m_p_next;
426 if (p_e != 0)
429 return (p_e->m_value.second);
441 entry_pointer p_e = m_entries[pos_hash_pair.first]; local
443 while (p_e != 0 &&
444 !hash_eq_fn_base::operator()(p_e
477 entry_pointer p_e = get_entry(r_val, local
497 entry_pointer p_e = get_entry(r_val, local
513 entry_pointer p_e = m_entries[ranged_hash_fn_base::operator()(r_key)]; local
537 entry_pointer p_e = m_entries[pos_hash_pair.first]; local
[all...] |
| H A D | cond_key_dtor_entry_dealtor.hpp | 54 cond_dealtor(entry_allocator* p_a, entry* p_e) argument
55 : m_p_a(p_a), m_p_e(p_e), m_key_destruct(false),
|
| H A D | resize_fn_imps.hpp | 119 entry_pointer p_e = m_entries[pos]; local
120 while (p_e != 0)
121 p_e = resize_imp_no_exceptions_reassign_pointer(p_e, a_p_entries_resized, traits_base::m_store_extra_indicator);
|
| /haiku-buildtools/gcc/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...] |
| H A D | debug_no_store_hash_fn_imps.hpp | 52 const_entry_pointer p_e = &a_entries[pos]; local
53 switch(p_e->m_stat)
60 key_const_reference r_key = PB_DS_V2F(p_e->m_value);
|
| H A D | debug_store_hash_fn_imps.hpp | 53 const_entry_pointer p_e =& a_entries[pos]; local
54 switch(p_e->m_stat)
61 key_const_reference r_key = PB_DS_V2F(p_e->m_value);
66 PB_DS_DEBUG_VERIFY(p_e->m_hash == pos_hash_pair.second);
|
| H A D | erase_no_store_hash_fn_imps.hpp | 55 entry* const p_e = m_entries + pos; local
56 switch(p_e->m_stat)
66 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
69 erase_entry(p_e);
|
| H A D | resize_store_hash_fn_imps.hpp | 45 resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, argument
48 key_const_reference r_key = PB_DS_V2F(p_e->m_value);
49 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash);
59 new (&p_new_e->m_value) value_type(p_e->m_value);
|
| H A D | erase_store_hash_fn_imps.hpp | 54 entry* const p_e = m_entries + pos; local
55 switch(p_e->m_stat)
65 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
69 erase_entry(p_e);
|
| H A D | resize_no_store_hash_fn_imps.hpp | 45 resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, argument
48 key_const_reference r_key = PB_DS_V2F(p_e->m_value);
58 new (&p_new_e->m_value) value_type(p_e->m_value);
|
| H A D | insert_store_hash_fn_imps.hpp | 61 entry* const p_e = m_entries + pos; local
62 switch(p_e->m_stat)
79 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
108 entry_pointer p_e =& m_entries[pos_hash_pair.first]; local
109 if (p_e->m_stat == valid_entry_status)
112 return std::make_pair(&p_e->m_value, false);
|
| H A D | gp_ht_map_.hpp | 446 entry* const p_e = m_entries + pos; local
447 new (&p_e->m_value) value_type(r_val);
448 p_e->m_stat = valid_entry_status;
451 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(p_e->m_value));)
453 return &p_e->m_value;
469 entry* const p_e = m_entries + r_pos_hash_pair.first; local
470 new (&p_e->m_value) value_type(r_val);
471 p_e->m_hash = r_pos_hash_pair.second;
472 p_e->m_stat = valid_entry_status;
476 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(p_e
490 entry_pointer p_e = &m_entries[pos]; local
527 entry* const p_e = m_entries + pos; local
571 entry* const p_e = m_entries + pos; local
627 const_entry_pointer p_e =& m_entries[r_pos]; local
642 const_entry_pointer p_e = &m_entries[r_pos]; local
657 entry_pointer p_e = &m_entries[r_pos]; local
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/ |
| H A D | cond_dealtor.hpp | 58 cond_dealtor(entry_pointer p_e) argument
59 : m_p_e(p_e), m_no_action_destructor(false) { }
|