Searched refs:r_val (Results 1 - 25 of 31) sorted by relevance

12

/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/
H A Dinsert_fn_imps.hpp46 insert(const_reference r_val) argument
49 entry_pointer p_l = find_imp(PB_DS_V2F(r_val));
53 PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_val))
57 PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_val))
59 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator);
69 allocate_new_entry(const_reference r_val, false_type) argument
74 value_type(r_val);
77 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_val));)
85 allocate_new_entry(const_reference r_val, true_type) argument
88 new (&p_l->m_value) value_type(r_val);
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/regression/trait/priority_queue/
H A Dtrait.hpp67 native_value(const_reference r_val) argument
68 { return native_value_type(r_val); }
71 cmp(const_reference r_val, const native_value_type& r_native_val) argument
72 { return val_to_string(r_val) == r_native_val; }
75 val_to_string(const_reference r_val) argument
76 { return std::string(r_val); }
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/
H A Dconstructor_destructor_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
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;
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
50 new (&p_e->m_value) mapped_value_type(r_val);
H A Dinsert_no_store_hash_fn_imps.hpp96 insert_imp(const_reference r_val, false_type) argument
98 key_const_reference r_key = PB_DS_V2F(r_val);
109 return std::make_pair(insert_new_imp(r_val, pos), true);
H A Dinsert_store_hash_fn_imps.hpp101 insert_imp(const_reference r_val, true_type) argument
103 key_const_reference r_key = PB_DS_V2F(r_val);
116 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
49 entry_pointer p = get_entry(r_val, traits_base::s_no_throw_copies_indicator);
H A Dinsert_no_store_hash_fn_imps.hpp45 insert_imp(const_reference r_val, false_type) argument
48 key_const_reference r_key = PB_DS_V2F(r_val);
68 return std::make_pair(insert_new_imp(r_val, pos), true);
H A Dentry_list_fn_imps.hpp57 get_entry(const_reference r_val, true_type) argument
63 new (&p_e->m_value) value_type(r_val);
70 get_entry(const_reference r_val, false_type) argument
77 new (&p_e->m_value) value_type(r_val);
H A Dconstructor_destructor_store_hash_fn_imps.hpp45 constructor_insert_new_imp(const_reference r_val, size_type pos, true_type) argument
48 entry_pointer p = get_entry(r_val, traits_base::s_no_throw_copies_indicator);
H A Dinsert_store_hash_fn_imps.hpp45 insert_imp(const_reference r_val, true_type) argument
48 key_const_reference key = PB_DS_V2F(r_val);
69 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
H A Dcc_ht_map_.hpp310 insert(const_reference r_val) argument
311 { return insert_imp(r_val, traits_base::m_store_extra_indicator); }
471 insert_new_imp(const_reference r_val, size_type pos) argument
474 pos = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val));
477 entry_pointer p_e = get_entry(r_val,
485 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_val));)
491 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair) argument
495 r_pos_hash_pair = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val));
497 entry_pointer p_e = get_entry(r_val,
505 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_val));)
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/native_type/
H A Dnative_hash_multimap.hpp85 insert(const_reference r_val) argument
88 eq_range_t f = base_type::equal_range(r_val.first);
93 if (it->second == r_val.second)
97 base_type::insert(r_val);
101 find(const_reference r_val) argument
104 eq_range_t f = base_type::equal_range(r_val.first);
109 if (it->second == r_val.second)
117 find(const_reference r_val) const
120 eq_range_t f = base_type::equal_range(r_val.first);
125 if (it->second == r_val
[all...]
H A Dnative_multimap.hpp80 insert(const_reference r_val) argument
83 eq_range_t f = base_type::equal_range(r_val.first);
88 if (it->second == r_val.second)
92 base_type::insert(r_val);
96 find(const_reference r_val) argument
99 eq_range_t f = base_type::equal_range(r_val.first);
104 if (it->second == r_val.second)
113 find(const_reference r_val) const
116 eq_range_t f = base_type::equal_range(r_val.first);
121 if (it->second == r_val
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/regression/trait/assoc/
H A Dnative_type_trait.hpp108 extract_key(typename type::const_reference r_val) argument
110 return (r_val.first);
114 native_value(typename _Alloc::template rebind< std::pair<Key_Type, basic_type> >::other::const_reference r_val) argument
117 native_key_type<Key_Type, _Alloc>::native_key(r_val.first),
118 std::string(r_val.second)));
134 extract_key(typename type::const_reference r_val) argument
136 return (r_val);
141 Key_Type>::other::const_reference r_val)
144 r_val));
140 native_value(typename _Alloc::template rebind< Key_Type>::other::const_reference r_val) argument
H A Dtype_trait.hpp71 extract_key(const_reference r_val) argument
72 { return extract_key_imp(r_val); }
100 extract_key_imp(basic_type_const_reference r_val) argument
101 { return r_val; }
104 extract_key_imp(pair_type_const_reference r_val) argument
105 { return r_val.first; }
H A Dtrait.hpp153 extract_key(const_reference r_val) argument
154 { return type_traits_base::extract_key(r_val); }
161 native_value(const_reference r_val) argument
162 { return native_type_traits_base::native_value(r_val); }
165 extract_native_key(const native_value_type& r_val) argument
166 { return native_type_traits_base::extract_key(r_val); }
169 cmp(const_reference r_val, const native_value_type& r_native_val) argument
170 { return val_to_string(r_val) == native_val_to_string(r_native_val); }
173 val_to_string(const_reference r_val) argument
174 { return to_string(r_val); }
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/pb_ds/example/
H A Derase_if.cc60 operator()(const pair<const int, char>& r_val)
61 { return r_val.first >= m_b&& r_val.first < m_e; }
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/branch_policy/
H A Dbranch_policy.hpp72 extract_key(const_reference r_val) argument
73 { return r_val.first; }
103 extract_key(const_reference r_val) argument
104 { return r_val; }
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Dinsert_fn_imps.hpp44 get_new_node_for_insert(const_reference r_val) argument
46 return get_new_node_for_insert(r_val, s_no_throw_copies_ind);
52 get_new_node_for_insert(const_reference r_val, false_type) argument
60 typename node::value_type(r_val);
72 get_new_node_for_insert(const_reference r_val, true_type) argument
78 typename node::value_type(r_val);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dinsert_fn_imps.hpp44 push(const_reference r_val) argument
47 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dsynth_access_traits.hpp189 extract_key(const_reference r_val) argument
190 { return extract_key(r_val, s_set_ind); }
195 extract_key(const_reference r_val, true_type) argument
196 { return r_val; }
201 extract_key(const_reference r_val, false_type) argument
202 { return r_val.first; }
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/
H A Dinsert_fn_imps.hpp44 push(const_reference r_val) argument
47 insert_value(r_val, s_no_throw_copies_ind);
65 insert_value(const_reference r_val, false_type) argument
70 new (p_new) value_type(r_val);
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dinsert_fn_imps.hpp44 push(const_reference r_val) argument
52 node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
57 if (base_type::m_p_max == 0 || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val))
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp153 get_new_node_for_leaf_insert(const_reference r_val, false_type) argument
159 typename node::value_type(r_val);
170 get_new_node_for_leaf_insert(const_reference r_val, true_type) argument
175 typename node::value_type(r_val);

Completed in 1049 milliseconds

12