/external/libcxx/include/experimental/ |
D | unordered_map | 53 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>>>;
|
D | map | 47 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>>>;
|
D | functional | 145 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/libcxx/include/ |
D | unordered_map | 423 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 …]
|
D | set | 437 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 …]
|
D | map | 496 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 | __tree | 40 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_table | 35 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 …]
|
D | utility | 1594 template <class _Key, class _Hash> 1598 __invokable_r<size_t, _Hash, _Key const&>::value 1601 template <class _Key, class _Hash = std::hash<_Key> > 1603 __check_hash_requirements<_Key, _Hash>::value &&
|
D | type_traits | 4788 template <class _ValTy, class _Key, 4791 : conditional<is_same<_RawValTy, _Key>::value, __extract_key_self_tag, 4794 template <class _Pair, class _Key, class _First, class _Second> 4795 struct __can_extract_key<_Pair, _Key, pair<_First, _Second>> 4796 : conditional<is_same<typename remove_const<_First>::type, _Key>::value, 4800 // It returns true if _Key != _ContainerValueTy (the container is a map not a set) 4801 // and _ValTy == _Key. 4802 template <class _ValTy, class _Key, class _ContainerValueTy, 4805 : integral_constant<bool, is_same<_RawValTy, _Key>::value> {}; 4808 // because _Key == _ContainerValueTy [all …]
|
/external/libcxx/include/ext/ |
D | hash_map | 463 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/clang/test/CodeGenCXX/ |
D | debug-info-use-after-free.cpp | 203 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/ |
D | map | 15 template <typename _Key, typename _Tp> struct map { 16 _Tp operator[](_Key p1) {
|
/external/libcxx/test/support/ |
D | container_test_types.h | 441 template <class _Key, class _Value, class _Less, class _Alloc> 443 template <class _Key, class _Value, class _Less, class _Alloc> 449 template <class _Key, class _Value, class _Hash, class _Equals, class _Alloc> 451 template <class _Key, class _Value, class _Hash, class _Equals, class _Alloc>
|
/external/clang/test/Modules/Inputs/PR20399/ |
D | stl_map.h | 7 template <typename _Key>
|
/external/clang/test/SemaCXX/ |
D | libstdcxx_map_base_hack.cpp | 10 template<typename _Key, typename _Value, typename _Ex, bool __unique,
|
/external/clang/test/CodeGen/ |
D | 2008-03-24-BitField-And-Alloca.c | 30 typedef union _Key { union
|
/external/clang/www/ |
D | libstdc++4.4-clang0x.patch | 395 _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,
|