Home
last modified time | relevance | path

Searched refs:r_val (Results 1 – 25 of 32) sorted by relevance

12

/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/
H A Dinsert_fn_imps.hpp52 insert(const_reference r_val) in insert() argument
55 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); in insert()
59 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(PB_DS_V2F(r_val));) in insert()
63 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_does_not_exist(PB_DS_V2F(r_val));) in insert()
65 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); in insert()
75 allocate_new_entry(const_reference r_val, false_type) in allocate_new_entry() argument
80 value_type(r_val); in allocate_new_entry()
83 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) in allocate_new_entry()
91 allocate_new_entry(const_reference r_val, true_type) in allocate_new_entry() argument
94 new (&p_l->m_value) value_type(r_val); in allocate_new_entry()
[all …]
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Dsynth_e_access_traits.hpp97 extract_key(const_reference r_val);
106 extract_key(const_reference r_val, true_type);
109 extract_key(const_reference r_val, false_type);
198 extract_key(const_reference r_val) in extract_key() argument
200 return (extract_key(r_val, s_set_ind)); in extract_key()
206 extract_key(const_reference r_val, true_type) in extract_key() argument
208 return (r_val); in extract_key()
214 extract_key(const_reference r_val, false_type) in extract_key() argument
216 return (r_val.first); in extract_key()
H A Dleaf.hpp111 pat_trie_leaf(const_reference r_val);
135 pat_trie_leaf(const_reference r_val) : in pat_trie_leaf() argument
136 PB_DS_BASE_C_DEC(pat_trie_leaf_node_type), m_value(r_val) in pat_trie_leaf()
159 const_reference r_val = value(); in assert_valid_imp() local
160 return std::make_pair(p_traits->begin(p_traits->extract_key(r_val)), in assert_valid_imp()
161 p_traits->end(p_traits->extract_key(r_val))); in assert_valid_imp()
H A Dinsert_join_fn_imps.hpp384 insert(const_reference r_val) in insert() argument
386 node_pointer p_lf = find_imp(PB_DS_V2F(r_val)); in insert()
388 …e_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_lf)->value()), PB_DS_V2F(r_val))) in insert()
390 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(PB_DS_V2F(r_val))); in insert()
395 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_does_not_exist(PB_DS_V2F(r_val))); in insert()
400 new (p_new_lf) leaf(r_val); in insert()
410 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) in insert()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Dentry_list_fn_imps.hpp63 get_entry(const_reference r_val, true_type) in get_entry() argument
69 new (&p_e->m_value) value_type(r_val); in get_entry()
76 get_entry(const_reference r_val, false_type) in get_entry() argument
83 new (&p_e->m_value) value_type(r_val); in get_entry()
H A Dinsert_no_store_hash_fn_imps.hpp51 insert_imp(const_reference r_val, false_type) in insert_imp() argument
54 const_key_reference r_key = PB_DS_V2F(r_val); in insert_imp()
74 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
H A Dinsert_store_hash_fn_imps.hpp51 insert_imp(const_reference r_val, true_type) in insert_imp() argument
54 const_key_reference key = PB_DS_V2F(r_val); in insert_imp()
75 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); in insert_imp()
H A Dcc_ht_map_.hpp283 insert(const_reference r_val) in insert() argument
284 { return insert_imp(r_val, traits_base::m_store_extra_indicator); } in insert()
439 insert_new_imp(const_reference r_val, size_type pos) in insert_new_imp() argument
442 pos = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val)); in insert_new_imp()
445 entry_pointer p_e = get_entry(r_val, traits_base::m_no_throw_copies_indicator); in insert_new_imp()
452 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) in insert_new_imp()
458 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair) in insert_new_imp() argument
462 r_pos_hash_pair = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val)); in insert_new_imp()
464 entry_pointer p_e = get_entry(r_val, traits_base::m_no_throw_copies_indicator); in insert_new_imp()
471 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) in insert_new_imp()
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp51 constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, in constructor_insert_new_imp() argument
55 entry_pointer p = get_entry(r_val, traits_base::s_no_throw_copies_indicator); in constructor_insert_new_imp()
H A Dconstructor_destructor_store_hash_fn_imps.hpp51 constructor_insert_new_imp(const_reference r_val, size_type pos, true_type) in constructor_insert_new_imp() argument
54 entry_pointer p = get_entry(r_val, traits_base::s_no_throw_copies_indicator); in constructor_insert_new_imp()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Dinsert_fn_imps.hpp50 get_new_node_for_insert(const_reference r_val) in get_new_node_for_insert() argument
52 return get_new_node_for_insert(r_val, s_no_throw_copies_ind); in get_new_node_for_insert()
58 get_new_node_for_insert(const_reference r_val, false_type) in get_new_node_for_insert() argument
66 typename node::value_type(r_val); in get_new_node_for_insert()
78 get_new_node_for_insert(const_reference r_val, true_type) in get_new_node_for_insert() argument
84 typename node::value_type(r_val); in get_new_node_for_insert()
H A Dleft_child_next_sibling_heap_.hpp250 get_new_node_for_insert(const_reference r_val);
320 get_new_node_for_insert(const_reference r_val, false_type);
323 get_new_node_for_insert(const_reference r_val, true_type);
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/
H A Dconstructor_destructor_store_hash_fn_imps.hpp51 constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, in constructor_insert_new_imp() argument
56 new (&p_e->m_value) mapped_value_type(r_val); in constructor_insert_new_imp()
57 p_e->m_hash = ranged_probe_fn_base::operator()(PB_DS_V2F(r_val)).second; in constructor_insert_new_imp()
H A Dinsert_no_store_hash_fn_imps.hpp102 insert_imp(const_reference r_val, false_type) in insert_imp() argument
104 const_key_reference r_key = PB_DS_V2F(r_val); in insert_imp()
115 return std::make_pair(insert_new_imp(r_val, pos), true); in insert_imp()
H A Dinsert_store_hash_fn_imps.hpp107 insert_imp(const_reference r_val, true_type) in insert_imp() argument
109 const_key_reference r_key = PB_DS_V2F(r_val); in insert_imp()
122 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); in insert_imp()
H A Dgp_ht_map_.hpp291 insert(const_reference r_val) in insert() argument
294 return insert_imp(r_val, traits_base::m_store_extra_indicator); in insert()
402 insert_new_imp(const_reference r_val, size_type pos) in insert_new_imp() argument
407 pos = find_ins_pos(PB_DS_V2F(r_val), in insert_new_imp()
413 new (&p_e->m_value) value_type(r_val); in insert_new_imp()
424 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair) in insert_new_imp() argument
430 r_pos_hash_pair = find_ins_pos(PB_DS_V2F(r_val), in insert_new_imp()
437 new (&p_e->m_value) value_type(r_val); in insert_new_imp()
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp51 constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, in constructor_insert_new_imp() argument
56 new (&p_e->m_value) mapped_value_type(r_val); in constructor_insert_new_imp()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/
H A Dbasic_tree_policy_base.hpp98 extract_key(const_reference r_val) in extract_key()
100 return (r_val.first); in extract_key()
155 extract_key(const_reference r_val) in extract_key()
157 return (r_val); in extract_key()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/
H A Dinsert_fn_imps.hpp50 push(const_reference r_val) in push() argument
54 insert_value(r_val, s_no_throw_copies_ind); in push()
76 insert_value(const_reference r_val, false_type) in insert_value() argument
84 new (p_new) value_type(r_val); in insert_value()
H A Dbinary_heap_.hpp212 push(const_reference r_val);
275 insert_value(const_reference r_val, false_type);
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dinsert_fn_imps.hpp181 get_new_node_for_leaf_insert(const_reference r_val, false_type) in get_new_node_for_leaf_insert() argument
189 typename node::value_type(r_val); in get_new_node_for_leaf_insert()
203 get_new_node_for_leaf_insert(const_reference r_val, true_type) in get_new_node_for_leaf_insert() argument
209 typename node::value_type(r_val); in get_new_node_for_leaf_insert()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dinsert_fn_imps.hpp50 push(const_reference r_val) in push() argument
58 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); in push()
63 if (base_type::m_p_max == NULL || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val)) in push()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dinsert_fn_imps.hpp50 push(const_reference r_val) in push() argument
54 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val); in push()
/openbsd/usr.bin/lex/
H A Dscanopt.c103 return s->options[i].r_val; in RVAL()
172 || options[s->optc].r_val || options[s->optc].desc) in scanopt_init()
650 s->options[i].r_val) nmatch--; in find_opt()
651 lastr_val = s->options[i].r_val; in find_opt()
789 return optp->r_val; in scanopt()
807 return optp->r_val; in scanopt()
814 return optp->r_val; in scanopt()
/openbsd/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dinsert_fn_imps.hpp50 push(const_reference r_val) in push() argument
54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); in push()

12