Home
last modified time | relevance | path

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

/llvm-project-15.0.7/libcxx/include/experimental/
H A Dunordered_map62 template <class _Key, class _Value,
63 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
64 using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred,
65 polymorphic_allocator<pair<const _Key, _Value>>>;
67 template <class _Key, class _Value,
68 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
69 using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred,
70 polymorphic_allocator<pair<const _Key, _Value>>>;
H A Dmap48 template <class _Key, class _Value, class _Compare = less<_Key>>
49 using map = _VSTD::map<_Key, _Value, _Compare,
50 polymorphic_allocator<pair<const _Key, _Value>>>;
52 template <class _Key, class _Value, class _Compare = less<_Key>>
53 using multimap = _VSTD::multimap<_Key, _Value, _Compare,
54 polymorphic_allocator<pair<const _Key, _Value>>>;
H A Dfunctional126 template<class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/> class _B…
129 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
130 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
132 typedef _Key key_type;
135 std::unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table;
158 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
159 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
162 typedef _Key key_type;
/llvm-project-15.0.7/libcxx/include/
H A Dunordered_map579 size_t operator()(const _Key& __x) const
615 size_t operator()(const _Key& __x) const
815 template <class _Key, class _Tp>
899 template <class _Key, class _Tp>
1026 template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>,
1566 template<class _Key, class _Tp, class _Hash = hash<remove_const_t<_Key>>,
1603 -> unordered_map<remove_const_t<_Key>, _Tp,
1604 hash<remove_const_t<_Key>>,
1610 -> unordered_map<remove_const_t<_Key>, _Tp,
1916 template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>,
[all …]
H A Dset515 template <class _Key, class _Compare = less<_Key>,
938 template<class _Key, class _Compare = less<_Key>,
943 -> set<_Key, _Compare, _Allocator>;
952 template<class _Key, class _Allocator,
954 set(initializer_list<_Key>, _Allocator)
955 -> set<_Key, less<_Key>, _Allocator>;
1032 swap(set<_Key, _Compare, _Allocator>& __x,
1048 template <class _Key, class _Compare = less<_Key>,
1470 template<class _Key, class _Compare = less<_Key>,
1484 template<class _Key, class _Allocator,
[all …]
H A Dmap574 template <class _Key, class _CP, class _Compare,
731 template <class _Key, class _Tp>
813 template <class _Key, class _Tp>
841 template <class _Key, class _Tp>
844 typedef _Key const __key_type;
969 template <class _Key, class _Tp, class _Compare = less<_Key>,
1560 template<class _Key, class _Tp, class _Compare = less<remove_const_t<_Key>>,
1577 -> map<remove_const_t<_Key>, _Tp, less<remove_const_t<_Key>>, _Allocator>;
1745 template <class _Key, class _Tp, class _Compare = less<_Key>,
2226 template<class _Key, class _Tp, class _Compare = less<remove_const_t<_Key>>,
[all …]
H A D__tree1963 template <class _Key>
2013 template <class _Key>
2437 template <class _Key>
2449 template <class _Key>
2461 template <class _Key>
2472 template <class _Key>
2483 template <class _Key>
2503 template <class _Key>
2528 template <class _Key>
2548 template <class _Key>
[all …]
H A D__hash_table2302 template <class _Key>
2329 template <class _Key>
2428 template <class _Key>
2440 template <class _Key>
2510 template <class _Key>
2519 template <class _Key>
2538 template <class _Key>
2542 const _Key& __k)
2552 template <class _Key>
2566 template <class _Key>
[all …]
H A Dtype_traits774 template <class _ValTy, class _Key,
777 : conditional<_IsSame<_RawValTy, _Key>::value, __extract_key_self_tag,
780 template <class _Pair, class _Key, class _First, class _Second>
781 struct __can_extract_key<_Pair, _Key, pair<_First, _Second> >
782 : conditional<_IsSame<typename remove_const<_First>::type, _Key>::value,
787 // and _ValTy == _Key.
788 template <class _ValTy, class _Key, class _ContainerValueTy,
791 : integral_constant<bool, _IsSame<_RawValTy, _Key>::value> {};
794 // because _Key == _ContainerValueTy
795 template <class _ValTy, class _Key, class _RawValTy>
[all …]
/llvm-project-15.0.7/libcxx/include/ext/
H A Dhash_map470 template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>,
615 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
623 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
633 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
641 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
652 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
662 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
710 swap(hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
711 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
744 template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>,
[all …]
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A 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,
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h35 template <class _Key,
43 template <class _Key,
47 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
50 using key_type = _Key;
53 unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table_;
72 template <class _Key,
76 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
79 using key_type = _Key;
H A Dhash.h657 template <class _Key, class _Hash>
661 __invokable_r<size_t, _Hash, _Key const&>::value
664 template <class _Key, class _Hash = hash<_Key> >
666 __check_hash_requirements<_Key, _Hash>::value &&
/llvm-project-15.0.7/clang/test/Modules/Inputs/PR27739/
H A Dmap15 template <typename _Key, typename _Tp> struct map {
16 _Tp operator[](_Key p1) {
/llvm-project-15.0.7/clang/test/Modules/Inputs/PR20399/
H A Dstl_map.h7 template <typename _Key>
/llvm-project-15.0.7/clang/test/Modules/
H A Dinherited_arg.cppm20 template <class _Key, class _Tp,
21 class _Alloc = allocator<pair<const _Key, _Tp> > >
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dlibstdcxx_map_base_hack.cpp11 template <typename _Key, typename _Value, typename _Ex, bool __unique,
/llvm-project-15.0.7/libcxx/test/support/
H A Dcontainer_test_types.h440 template <class _Key, class _Value, class _Less, class _Alloc>
442 template <class _Key, class _Value, class _Less, class _Alloc>
448 template <class _Key, class _Value, class _Hash, class _Equals, class _Alloc>
450 template <class _Key, class _Value, class _Hash, class _Equals, class _Alloc>
/llvm-project-15.0.7/clang/test/CodeGen/
H A D2008-03-24-BitField-And-Alloca.c30 typedef union _Key { union
/llvm-project-15.0.7/clang/www/
H A Dlibstdc++4.4-clang0x.patch395 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
397 - swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&& __t)
399 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)
533 _Hashtable<_Key, _Value, _Allocator, _ExtractKey, _Equal,