/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | insert_fn_imps.hpp | 52 insert(const_reference r_val) argument 55 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); 59 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(PB_DS_V2F(r_val));) 63 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_does_not_exist(PB_DS_V2F(r_val));) 65 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 75 allocate_new_entry(const_reference r_val, false_type) argument 80 value_type(r_val); 83 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) 91 allocate_new_entry(const_reference r_val, true_type) argument 94 new (&p_l->m_value) value_type(r_val); [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | constructor_destructor_store_hash_fn_imps.hpp | 51 constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, argument 56 new (&p_e->m_value) mapped_value_type(r_val); 57 p_e->m_hash = ranged_probe_fn_base::operator()(PB_DS_V2F(r_val)).second;
|
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 51 constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, argument 56 new (&p_e->m_value) mapped_value_type(r_val);
|
H A D | insert_no_store_hash_fn_imps.hpp | 102 insert_imp(const_reference r_val, false_type) argument 104 const_key_reference r_key = PB_DS_V2F(r_val); 115 return std::make_pair(insert_new_imp(r_val, pos), true);
|
H A D | insert_store_hash_fn_imps.hpp | 107 insert_imp(const_reference r_val, true_type) argument 109 const_key_reference r_key = PB_DS_V2F(r_val); 122 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
|
H A D | gp_ht_map_.hpp | 291 insert(const_reference r_val) argument 294 return insert_imp(r_val, traits_base::m_store_extra_indicator); 402 insert_new_imp(const_reference r_val, size_type pos) argument 407 pos = find_ins_pos(PB_DS_V2F(r_val), 413 new (&p_e->m_value) value_type(r_val); 424 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair) argument 430 r_pos_hash_pair = find_ins_pos(PB_DS_V2F(r_val), 437 new (&p_e->m_value) value_type(r_val);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | constructor_destructor_no_store_hash_fn_imps.hpp | 51 constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, argument 55 entry_pointer p = get_entry(r_val, traits_base::s_no_throw_copies_indicator);
|
H A D | entry_list_fn_imps.hpp | 63 get_entry(const_reference r_val, true_type) argument 69 new (&p_e->m_value) value_type(r_val); 76 get_entry(const_reference r_val, false_type) argument 83 new (&p_e->m_value) value_type(r_val);
|
H A D | constructor_destructor_store_hash_fn_imps.hpp | 51 constructor_insert_new_imp(const_reference r_val, size_type pos, true_type) argument 54 entry_pointer p = get_entry(r_val, traits_base::s_no_throw_copies_indicator);
|
H A D | insert_no_store_hash_fn_imps.hpp | 51 insert_imp(const_reference r_val, false_type) argument 54 const_key_reference r_key = PB_DS_V2F(r_val); 74 return std::make_pair(insert_new_imp(r_val, pos), true);
|
H A D | insert_store_hash_fn_imps.hpp | 51 insert_imp(const_reference r_val, true_type) argument 54 const_key_reference key = PB_DS_V2F(r_val); 75 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
|
H A D | cc_ht_map_.hpp | 283 insert(const_reference r_val) argument 284 { return insert_imp(r_val, traits_base::m_store_extra_indicator); } 439 insert_new_imp(const_reference r_val, size_type pos) argument 442 pos = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val)); 445 entry_pointer p_e = get_entry(r_val, traits_base::m_no_throw_copies_indicator); 452 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) 458 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair) argument 462 r_pos_hash_pair = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val)); 464 entry_pointer p_e = get_entry(r_val, traits_base::m_no_throw_copies_indicator); 471 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));) [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | leaf.hpp | 111 pat_trie_leaf(const_reference r_val); 135 pat_trie_leaf(const_reference r_val) : argument 136 PB_DS_BASE_C_DEC(pat_trie_leaf_node_type), m_value(r_val) 159 const_reference r_val = value(); local 160 return std::make_pair(p_traits->begin(p_traits->extract_key(r_val)), 161 p_traits->end(p_traits->extract_key(r_val)));
|
H A D | synth_e_access_traits.hpp | 97 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) argument 200 return (extract_key(r_val, s_set_ind)); 206 extract_key(const_reference r_val, true_type) argument 208 return (r_val); 214 extract_key(const_reference r_val, false_type) argument 216 return (r_val.first);
|
H A D | insert_join_fn_imps.hpp | 384 insert(const_reference r_val) argument 386 node_pointer p_lf = find_imp(PB_DS_V2F(r_val)); 388 synth_e_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_lf)->value()), PB_DS_V2F(r_val))) 390 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(PB_DS_V2F(r_val))); 395 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_does_not_exist(PB_DS_V2F(r_val))); 400 new (p_new_lf) leaf(r_val); 410 _GLIBCXX_DEBUG_ONLY(map_debug_base::insert_new(PB_DS_V2F(r_val));)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | insert_fn_imps.hpp | 50 get_new_node_for_insert(const_reference r_val) argument 52 return get_new_node_for_insert(r_val, s_no_throw_copies_ind); 58 get_new_node_for_insert(const_reference r_val, false_type) argument 66 typename node::value_type(r_val); 78 get_new_node_for_insert(const_reference r_val, true_type) argument 84 typename node::value_type(r_val);
|
H A D | left_child_next_sibling_heap_.hpp | 250 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);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/basic_tree_policy/ |
H A D | basic_tree_policy_base.hpp | 98 extract_key(const_reference r_val) argument 100 return (r_val.first); 155 extract_key(const_reference r_val) argument 157 return (r_val);
|
/freebsd-11-stable/contrib/flex/ |
H A D | scanopt.h | 70 int r_val; /* Value to be returned by scanopt_ex(). */ 69 int r_val; /* Value to be returned by scanopt_ex(). */ member in struct:optspec_t
|
H A D | scanopt.c | 110 return s->options[i].r_val; 186 || options[s->optc].r_val || options[s->optc].desc) 266 usg_elem *byr_val = NULL; /* option indices sorted by r_val */ 296 /* Sort by r_val and string. Yes, this is O(n*n), but n is small. */ 685 s->options[i].r_val) nmatch--; 686 lastr_val = s->options[i].r_val; 828 return optp->r_val; 846 return optp->r_val; 853 return optp->r_val;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | insert_fn_imps.hpp | 50 push(const_reference r_val) argument 54 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | insert_fn_imps.hpp | 50 push(const_reference r_val) argument 58 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 63 if (base_type::m_p_max == NULL || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val))
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | insert_fn_imps.hpp | 181 get_new_node_for_leaf_insert(const_reference r_val, false_type) argument 189 typename node::value_type(r_val); 203 get_new_node_for_leaf_insert(const_reference r_val, true_type) argument 209 typename node::value_type(r_val);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | insert_fn_imps.hpp | 50 push(const_reference r_val) argument 54 insert_value(r_val, s_no_throw_copies_ind); 76 insert_value(const_reference r_val, false_type) argument 84 new (p_new) value_type(r_val);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 50 push(const_reference r_val) argument 54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
|