Home
last modified time | relevance | path

Searched refs:_Key (Results 1 – 25 of 35) sorted by relevance

12

/external/libcxx/include/experimental/
Dunordered_map53 template <class _Key, class _Value,
54 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
55 using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred,
56 polymorphic_allocator<pair<const _Key, _Value>>>;
58 template <class _Key, class _Value,
59 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
60 using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred,
61 polymorphic_allocator<pair<const _Key, _Value>>>;
Dmap47 template <class _Key, class _Value, class _Compare = less<_Key>>
48 using map = _VSTD::map<_Key, _Value, _Compare,
49 polymorphic_allocator<pair<const _Key, _Value>>>;
51 template <class _Key, class _Value, class _Compare = less<_Key>>
52 using multimap = _VSTD::multimap<_Key, _Value, _Compare,
53 polymorphic_allocator<pair<const _Key, _Value>>>;
Dfunctional145 template<class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/> class _B…
148 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
149 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
152 typedef _Key key_type;
155 std::unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table;
178 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
179 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
182 typedef _Key key_type;
/external/llvm-project/libcxx/include/experimental/
Dunordered_map52 template <class _Key, class _Value,
53 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
54 using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred,
55 polymorphic_allocator<pair<const _Key, _Value>>>;
57 template <class _Key, class _Value,
58 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
59 using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred,
60 polymorphic_allocator<pair<const _Key, _Value>>>;
Dmap46 template <class _Key, class _Value, class _Compare = less<_Key>>
47 using map = _VSTD::map<_Key, _Value, _Compare,
48 polymorphic_allocator<pair<const _Key, _Value>>>;
50 template <class _Key, class _Value, class _Compare = less<_Key>>
51 using multimap = _VSTD::multimap<_Key, _Value, _Compare,
52 polymorphic_allocator<pair<const _Key, _Value>>>;
Dfunctional143 template<class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/> class _B…
146 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
147 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
150 typedef _Key key_type;
153 std::unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table;
176 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
177 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
180 typedef _Key key_type;
/external/llvm-project/libcxx/include/
Dunordered_map450 template <class _Key, class _Cp, class _Hash, class _Pred,
470 size_t operator()(const _Key& __x) const
486 template <class _Key, class _Cp, class _Hash, class _Pred>
487 class __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, false>
505 size_t operator()(const _Key& __x) const
521 template <class _Key, class _Cp, class _Hash, class _Pred, bool __b>
524 swap(__unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __x,
525 __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __y)
531 template <class _Key, class _Cp, class _Pred, class _Hash,
551 bool operator()(const _Cp& __x, const _Key& __y) const
[all …]
Dset440 template <class _Key, class _Compare, class _Allocator>
443 template <class _Key, class _Compare = less<_Key>,
444 class _Allocator = allocator<_Key> >
449 typedef _Key key_type;
604 static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
862 template<class _Key, class _Compare = less<_Key>,
863 class _Allocator = allocator<_Key>,
866 set(initializer_list<_Key>, _Compare = _Compare(), _Allocator = _Allocator())
867 -> set<_Key, _Compare, _Allocator>;
875 template<class _Key, class _Allocator,
[all …]
Dmap497 template <class _Key, class _CP, class _Compare,
517 bool operator()(const _CP& __x, const _Key& __y) const
520 bool operator()(const _Key& __x, const _CP& __y) const
544 template <class _Key, class _CP, class _Compare>
545 class __map_value_compare<_Key, _CP, _Compare, false>
565 bool operator()(const _CP& __x, const _Key& __y) const
568 bool operator()(const _Key& __x, const _CP& __y) const
592 template <class _Key, class _CP, class _Compare, bool __b>
595 swap(__map_value_compare<_Key, _CP, _Compare, __b>& __x,
596 __map_value_compare<_Key, _CP, _Compare, __b>& __y)
[all …]
D__tree46 template <class _Key, class _Value>
539 template <class _Key, class _Value>
540 struct __is_tree_value_type_imp<__value_type<_Key, _Value> > : true_type {};
573 template <class _Key, class _Tp>
574 struct __tree_key_value_types<__value_type<_Key, _Tp> > {
575 typedef _Key key_type;
577 typedef __value_type<_Key, _Tp> __node_value_type;
578 typedef pair<const _Key, _Tp> __container_value_type;
1140 template <class _Key, class ..._Args>
1142 __emplace_unique_key_args(_Key const&, _Args&&... __args);
[all …]
D__hash_table34 template <class _Key, class _Tp>
40 template <class _Key, class _Value>
41 struct __is_hash_value_type_imp<__hash_value_type<_Key, _Value> > : true_type {};
162 template <class _Key, class _Tp>
163 struct __hash_key_value_types<__hash_value_type<_Key, _Tp> > {
164 typedef _Key key_type;
166 typedef __hash_value_type<_Key, _Tp> __node_value_type;
167 typedef pair<const _Key, _Tp> __container_value_type;
869 template <class _Key, class _Hash, class _Equal>
872 static_assert(__check_hash_requirements<_Key, _Hash>::value,
[all …]
/external/libcxx/include/
Dunordered_map423 template <class _Key, class _Cp, class _Hash,
443 size_t operator()(const _Key& __x) const
453 template <class _Key, class _Cp, class _Hash>
454 class __unordered_map_hasher<_Key, _Cp, _Hash, false>
472 size_t operator()(const _Key& __x) const
482 template <class _Key, class _Cp, class _Hash, bool __b>
485 swap(__unordered_map_hasher<_Key, _Cp, _Hash, __b>& __x,
486 __unordered_map_hasher<_Key, _Cp, _Hash, __b>& __y)
492 template <class _Key, class _Cp, class _Pred,
512 bool operator()(const _Cp& __x, const _Key& __y) const
[all …]
Dset437 template <class _Key, class _Compare, class _Allocator>
440 template <class _Key, class _Compare = less<_Key>,
441 class _Allocator = allocator<_Key> >
446 typedef _Key key_type;
454 static_assert(sizeof(__diagnose_non_const_comparator<_Key, _Compare>()), "");
842 template <class _Key, class _Compare, class _Allocator>
843 set<_Key, _Compare, _Allocator>::set(set&& __s, const allocator_type& __a)
856 template <class _Key, class _Compare, class _Allocator>
859 operator==(const set<_Key, _Compare, _Allocator>& __x,
860 const set<_Key, _Compare, _Allocator>& __y)
[all …]
Dmap496 template <class _Key, class _CP, class _Compare,
516 bool operator()(const _CP& __x, const _Key& __y) const
519 bool operator()(const _Key& __x, const _CP& __y) const
543 template <class _Key, class _CP, class _Compare>
544 class __map_value_compare<_Key, _CP, _Compare, false>
564 bool operator()(const _CP& __x, const _Key& __y) const
567 bool operator()(const _Key& __x, const _CP& __y) const
591 template <class _Key, class _CP, class _Compare, bool __b>
594 swap(__map_value_compare<_Key, _CP, _Compare, __b>& __x,
595 __map_value_compare<_Key, _CP, _Compare, __b>& __y)
[all …]
D__tree40 template <class _Key, class _Value>
534 template <class _Key, class _Value>
535 struct __is_tree_value_type_imp<__value_type<_Key, _Value>> : true_type {};
571 template <class _Key, class _Tp>
572 struct __tree_key_value_types<__value_type<_Key, _Tp> > {
573 typedef _Key key_type;
575 typedef __value_type<_Key, _Tp> __node_value_type;
576 typedef pair<const _Key, _Tp> __container_value_type;
1141 template <class _Key, class ..._Args>
1143 __emplace_unique_key_args(_Key const&, _Args&&... __args);
[all …]
D__hash_table35 template <class _Key, class _Tp>
42 template <class _Key, class _Value>
43 struct __is_hash_value_type_imp<__hash_value_type<_Key, _Value>> : true_type {};
167 template <class _Key, class _Tp>
168 struct __hash_key_value_types<__hash_value_type<_Key, _Tp> > {
169 typedef _Key key_type;
171 typedef __hash_value_type<_Key, _Tp> __node_value_type;
172 typedef pair<const _Key, _Tp> __container_value_type;
865 template <class _Key, class _Hash, class _Equal>
868 static_assert(__check_hash_requirements<_Key, _Hash>::value,
[all …]
/external/libcxx/include/ext/
Dhash_map463 template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>,
464 class _Alloc = allocator<pair<const _Key, _Tp> > >
469 typedef _Key key_type;
606 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
607 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
614 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
615 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
623 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
625 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
632 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
[all …]
/external/llvm-project/libcxx/include/ext/
Dhash_map464 template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>,
465 class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
470 typedef _Key key_type;
608 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
609 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
616 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
617 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
625 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
627 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
633 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
[all …]
/external/llvm-project/clang/test/CodeGenCXX/
Ddebug-info-use-after-free.cpp205 template < class _Key, class _Tp, class _HashFn =
206 hash < _Key >, class _EqualKey = equal_to < _Key >, class _Alloc =
211 _Key,
213 _Key,
217 _Key,
/external/clang/test/CodeGenCXX/
Ddebug-info-use-after-free.cpp203 template < class _Key, class _Tp, class _HashFn =
204 hash < _Key >, class _EqualKey = equal_to < _Key >, class _Alloc =
209 _Key,
211 _Key,
215 _Key,
/external/clang/test/Modules/Inputs/PR27739/
Dmap15 template <typename _Key, typename _Tp> struct map {
16 _Tp operator[](_Key p1) {
/external/llvm-project/clang/test/Modules/Inputs/PR27739/
Dmap15 template <typename _Key, typename _Tp> struct map {
16 _Tp operator[](_Key p1) {
/external/llvm-project/clang/test/Modules/Inputs/PR20399/
Dstl_map.h7 template <typename _Key>
/external/clang/test/Modules/Inputs/PR20399/
Dstl_map.h7 template <typename _Key>
/external/clang/test/SemaCXX/
Dlibstdcxx_map_base_hack.cpp10 template<typename _Key, typename _Value, typename _Ex, bool __unique,

12