HomeSort by: relevance | last modified time | path
    Searched refs:r_key (Results 1 - 25 of 50) sorted by relevancy

1 2

  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/
trie_string_access_traits_imp.hpp 58 begin(key_const_reference r_key)
60 return (begin_imp(r_key, s_rev_ind));
66 end(key_const_reference r_key)
68 return (end_imp(r_key, s_rev_ind));
74 begin_imp(key_const_reference r_key, detail::false_type)
76 return (r_key.begin());
82 begin_imp(key_const_reference r_key, detail::true_type)
84 return (r_key.rbegin());
90 end_imp(key_const_reference r_key, detail::false_type)
92 return (r_key.end())
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/
erase_no_store_hash_fn_imps.hpp 47 erase(key_const_reference r_key)
50 return erase_in_pos_imp(r_key, ranged_hash_fn_base::operator()(r_key));
56 erase_in_pos_imp(key_const_reference r_key, size_type pos)
64 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
69 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
72 PB_DS_CHECK_KEY_EXISTS(r_key)
85 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
90 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_next_e->m_value), r_key))
93 PB_DS_CHECK_KEY_EXISTS(r_key)
    [all...]
find_fn_imps.hpp 46 find(key_const_reference r_key)
49 return find_key_pointer(r_key, traits_base::m_store_extra_indicator);
55 find(key_const_reference r_key) const
58 return const_cast<PB_DS_CLASS_C_DEC& >(*this).find_key_pointer(r_key,
insert_no_store_hash_fn_imps.hpp 50 key_const_reference r_key = PB_DS_V2F(r_val); local
51 const size_type pos = ranged_hash_fn_base::operator()(r_key);
56 r_key))
65 PB_DS_CHECK_KEY_EXISTS(r_key)
69 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
erase_store_hash_fn_imps.hpp 47 erase_in_pos_imp(key_const_reference r_key, const comp_hash& r_pos_hash_pair)
55 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
61 r_key, r_pos_hash_pair.second))
64 PB_DS_CHECK_KEY_EXISTS(r_key)
77 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
83 p_next_e->m_hash, r_key,
87 PB_DS_CHECK_KEY_EXISTS(r_key)
cmp_fn_imps.hpp 63 key_const_reference r_key = key_const_reference(PB_DS_V2F(*it)); local
67 find_key_pointer(r_key, traits_base::m_store_extra_indicator);
constructor_destructor_no_store_hash_fn_imps.hpp 56 _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(r_key);)
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/
find_no_store_hash_fn_imps.hpp 47 find_key_pointer(key_const_reference r_key, false_type)
find_fn_imps.hpp 46 find(key_const_reference r_key)
49 return find_key_pointer(r_key, traits_base::m_store_extra_indicator);
55 find(key_const_reference r_key) const
58 return const_cast<PB_DS_CLASS_C_DEC&>(*this).find_key_pointer(r_key, traits_base::m_store_extra_indicator);
erase_no_store_hash_fn_imps.hpp 47 erase_imp(key_const_reference r_key, false_type)
50 size_type hash = ranged_probe_fn_base::operator()(r_key);
56 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
63 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
68 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
insert_no_store_hash_fn_imps.hpp 47 find_ins_pos(key_const_reference r_key, false_type)
49 size_type hash = ranged_probe_fn_base::operator()(r_key);
59 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
67 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
76 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
79 PB_DS_CHECK_KEY_EXISTS(r_key)
100 key_const_reference r_key = PB_DS_V2F(r_val); local
101 const size_type pos = find_ins_pos(r_key,
106 PB_DS_CHECK_KEY_EXISTS(r_key)
110 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
    [all...]
erase_store_hash_fn_imps.hpp 47 erase_imp(key_const_reference r_key, true_type)
49 const comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
62 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
68 r_key, pos_hash_pair.second))
insert_store_hash_fn_imps.hpp 47 find_ins_pos(key_const_reference r_key, true_type)
50 comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
61 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
69 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
82 r_key, pos_hash_pair.second))
85 PB_DS_CHECK_KEY_EXISTS(r_key)
105 key_const_reference r_key = PB_DS_V2F(r_val); local
106 comp_hash pos_hash_pair = find_ins_pos(r_key,
113 PB_DS_CHECK_KEY_EXISTS(r_key)
117 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
    [all...]
debug_store_hash_fn_imps.hpp 63 key_const_reference r_key = PB_DS_V2F(p_e->m_value); local
64 debug_base::check_key_exists(r_key, __file, __line);
66 const comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
resize_no_store_hash_fn_imps.hpp 50 key_const_reference r_key = PB_DS_V2F(p_e->m_value); local
51 size_type hash = ranged_probe_fn_base::operator()(r_key);
55 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
resize_store_hash_fn_imps.hpp 50 key_const_reference r_key = PB_DS_V2F(p_e->m_value); local
51 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash);
56 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
debug_no_store_hash_fn_imps.hpp 62 key_const_reference r_key = PB_DS_V2F(p_e->m_value); local
63 debug_base::check_key_exists(r_key, __file, __line);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
find_fn_imps.hpp 46 find(key_const_reference r_key)
48 node_pointer p_found = find_imp(r_key);
57 find(key_const_reference r_key) const
59 const node_pointer p_found = find_imp(r_key);
68 find_imp(key_const_reference r_key)
74 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
76 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
88 find_imp(key_const_reference r_key) const
93 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
95 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value))
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
find_fn_imps.hpp 46 lower_bound(key_const_reference r_key) const
52 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
65 lower_bound(key_const_reference r_key)
71 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
84 upper_bound(key_const_reference r_key) const
90 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
103 upper_bound(key_const_reference r_key)
109 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
122 find(key_const_reference r_key)
129 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/
find_fn_imps.hpp 46 find_imp(key_const_reference r_key) const
50 if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value)))
53 PB_DS_CHECK_KEY_EXISTS(r_key)
61 if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value)))
76 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
find_fn_imps.hpp 46 find(key_const_reference r_key)
49 node_pointer p_nd = find_imp(r_key);
53 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
57 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
59 PB_DS_CHECK_KEY_EXISTS(r_key)
63 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
70 find(key_const_reference r_key) const
74 node_const_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key);
78 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
82 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(p_nd)->value()), r_key))
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/
sample_probe_fn.hpp 63 /// Returns the i-th offset from the hash value of some key r_key.
65 operator()(key_const_reference r_key, size_type i) const;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/
debug_map_base.hpp 149 insert_new(key_const_reference r_key)
153 if (find(r_key) != m_keys.end())
155 std::cerr << "insert_new key already present " << r_key << std::endl;
161 m_keys.push_back(r_key);
165 std::cerr << "insert_new " << r_key << std::endl;
175 erase_existing(key_const_reference r_key)
178 iterator it = find(r_key);
181 std::cerr << "erase_existing" << r_key << std::endl;
201 check_key_exists(key_const_reference r_key,
205 if (find(r_key) == m_keys.end()
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/
split_join_fn_imps.hpp 46 split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other)
57 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(*begin())))
65 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(*(end() - 1))))
78 iterator it = upper_bound(r_key);
ov_tree_map_.hpp 257 operator[](key_const_reference r_key)
261 point_iterator it = lower_bound(r_key);
262 if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
264 PB_DS_CHECK_KEY_EXISTS(r_key)
268 return insert_new_val(it, std::make_pair(r_key, mapped_type()))->second;
270 insert(r_key);
279 key_const_reference r_key = PB_DS_V2F(r_value); local
280 point_iterator it = lower_bound(r_key);
282 if (it != end()&& !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it)))
285 PB_DS_CHECK_KEY_EXISTS(r_key)
    [all...]

Completed in 38 milliseconds

1 2