/external/stlport/stlport/stl/ |
D | _string_operators.h | 27 template <class _CharT, class _Traits, class _Alloc> 28 inline basic_string<_CharT,_Traits,_Alloc> _STLP_CALL 29 operator+(const basic_string<_CharT,_Traits,_Alloc>& __s, 30 const basic_string<_CharT,_Traits,_Alloc>& __y) { 31 typedef basic_string<_CharT,_Traits,_Alloc> _Str; 44 template <class _CharT, class _Traits, class _Alloc> 45 inline basic_string<_CharT,_Traits,_Alloc> _STLP_CALL 47 const basic_string<_CharT,_Traits,_Alloc>& __y) { 49 typedef basic_string<_CharT,_Traits,_Alloc> _Str; 62 template <class _CharT, class _Traits, class _Alloc> [all …]
|
D | _rope.h | 91 template<class _CharT, _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_CharT>) > class rope; 92 template<class _CharT, class _Alloc> struct _Rope_RopeConcatenation; 93 template<class _CharT, class _Alloc> struct _Rope_RopeRep; 94 template<class _CharT, class _Alloc> struct _Rope_RopeLeaf; 95 template<class _CharT, class _Alloc> struct _Rope_RopeFunction; 96 template<class _CharT, class _Alloc> struct _Rope_RopeSubstring; 97 template<class _CharT, class _Alloc> class _Rope_iterator; 98 template<class _CharT, class _Alloc> class _Rope_const_iterator; 99 template<class _CharT, class _Alloc> class _Rope_char_ref_proxy; 100 template<class _CharT, class _Alloc> class _Rope_char_ptr_proxy; [all …]
|
D | _sstream.c | 31 # define __BSB_int_type__ _STLP_TYPENAME_ON_RETURN_TYPE basic_stringbuf<_CharT, _Traits, _Alloc>::… 32 # define __BSB_pos_type__ _STLP_TYPENAME_ON_RETURN_TYPE basic_stringbuf<_CharT, _Traits, _Alloc>::… 43 template <class _CharT, class _Traits, class _Alloc> 44 basic_stringbuf<_CharT, _Traits, _Alloc> 49 template <class _CharT, class _Traits, class _Alloc> 50 basic_stringbuf<_CharT, _Traits, _Alloc> 51 ::basic_stringbuf(const basic_string<_CharT, _Traits, _Alloc>& __s, ios_base::openmode __mode) in basic_stringbuf() 57 template <class _CharT, class _Traits, class _Alloc> 58 basic_stringbuf<_CharT, _Traits, _Alloc>::~basic_stringbuf() in ~basic_stringbuf() 62 template <class _CharT, class _Traits, class _Alloc> [all …]
|
D | _rope.c | 53 # define __allocator__ _Alloc 58 template<class _CharT, class _Alloc> 59 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos) in _Rope_iterator() 60 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos), in _Rope_iterator() 63 template<class _CharT, class _Alloc> 64 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos): in _Rope_iterator() 65 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos), in _Rope_iterator() 70 _Rope_iterator_base<_CharT, _Alloc>* __x = this; in _Rope_iterator() 75 template<class _CharT, class _Alloc> 76 void _Rope_RopeRep<_CharT, _Alloc>::_M_free_c_string() { in _M_free_c_string() [all …]
|
D | _slist.c | 42 template <class _Tp, class _Alloc> 44 _Slist_base<_Tp,_Alloc>::_M_erase_after(_Slist_node_base* __before_first, in _M_erase_after() 69 template <class _Tp, class _Alloc> 70 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x) { 90 template <class _Tp, class _Alloc> 91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { in _M_fill_assign() 105 template <class _Tp, class _Alloc> 106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) { in resize() 118 template <class _Tp, class _Alloc> 119 void slist<_Tp,_Alloc>::remove(const _Tp& __val) { in remove() [all …]
|
D | _string.c | 50 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE basic_string<_CharT,_Traits,_Alloc>::size_type 157 template <class _CharT, class _Traits, class _Alloc> 158 void basic_string<_CharT,_Traits,_Alloc>::reserve(size_type __res_arg) { in reserve() 169 template <class _CharT, class _Traits, class _Alloc> 170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { in _M_reserve() 178 template <class _CharT, class _Traits, class _Alloc> 179 basic_string<_CharT,_Traits,_Alloc>& 180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { in append() 194 template <class _CharT, class _Traits, class _Alloc> 195 basic_string<_CharT, _Traits, _Alloc>& [all …]
|
D | _list.c | 65 template <class _Tp, class _Alloc> 66 void _List_base<_Tp,_Alloc>::clear() { in clear() 94 template <class _Tp, class _Alloc> 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) { in resize() 106 template <class _Tp, class _Alloc> 107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) { 123 template <class _Tp, class _Alloc> 124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { in _M_fill_assign() 138 template <class _Tp, class _Alloc, class _Predicate> 139 void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred) { in _S_remove_if() [all …]
|
D | _vector.c | 39 template <class _Tp, class _Alloc> 40 void _Vector_base<_Tp,_Alloc>::_M_throw_length_error() const in _M_throw_length_error() 43 template <class _Tp, class _Alloc> 44 void _Vector_base<_Tp, _Alloc>::_M_throw_out_of_range() const in _M_throw_out_of_range() 58 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE vector<_Tp, _Alloc>::iterator 61 template <class _Tp, class _Alloc> 62 void vector<_Tp, _Alloc>::reserve(size_type __n) { in reserve() 80 template <class _Tp, class _Alloc> 81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type&… in _M_insert_overflow_aux() 107 template <class _Tp, class _Alloc> [all …]
|
D | _string_io.h | 33 template <class _CharT, class _Traits, class _Alloc> 36 const basic_string<_CharT,_Traits,_Alloc>& __s); 40 template <class _CharT, class _Traits, class _Alloc, class _Left, class _Right, class _StorageDir> 43 … const _STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir>& __sum) { 44 basic_string<_CharT, _Traits, _Alloc> __tmp(__sum); 50 template <class _CharT, class _Traits, class _Alloc> 53 basic_string<_CharT,_Traits,_Alloc>& __s); 55 template <class _CharT, class _Traits, class _Alloc> 58 basic_string<_CharT,_Traits,_Alloc>& __s, 63 template <class _CharT, class _Traits, class _Alloc> [all …]
|
D | _string_sum.h | 62 template <class _CharT, class _Traits, class _Alloc> 65 typedef basic_string<_CharT, _Traits, _Alloc> _BString; 83 template <class _CharT, class _Traits, class _Alloc, 88 typedef basic_string<_CharT, _Traits, _Alloc> _BString; 94 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDirection> _Self; 123 …typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __bstr_wrapper<_CharT, _Traits, _Alloc>, __on_l… 126 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __cstr_wrapper<_CharT>, __on_left> _CStrOnLeft; 129 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __char_wrapper<_CharT>, __on_left> _CharOnLeft; 258 …_BString& _M_get_storage(__bstr_sum<_CharT, _Traits, _Alloc, _Lhs, _Rhs, _StorageDir> const& __re… in _M_get_storage() argument 263 …_BString& _M_get_storage(__bstr_sum<_CharT, _Traits, _Alloc, _Lhs, _Rhs, _StorageDir> const& __re… in _M_get_storage() argument [all …]
|
D | _sstream.h | 54 template <class _CharT, class _Traits, class _Alloc> 64 typedef basic_stringbuf<_CharT, _Traits, _Alloc> _Self; 65 typedef basic_string<_CharT, _Traits, _Alloc> _String; 116 template <class _CharT, class _Traits, class _Alloc> 127 typedef basic_string<_CharT, _Traits, _Alloc> _String; 128 typedef basic_stringbuf<_CharT, _Traits, _Alloc> _Buf; 138 basic_stringbuf<_CharT, _Traits, _Alloc>* rdbuf() const in rdbuf() 145 basic_stringbuf<_CharT, _Traits, _Alloc> _M_buf; 159 template <class _CharT, class _Traits, class _Alloc> 170 typedef basic_string<_CharT, _Traits, _Alloc> _String; [all …]
|
D | _deque.c | 39 template <class _Tp, class _Alloc > 40 _Deque_base<_Tp,_Alloc >::~_Deque_base() { in ~_Deque_base() 47 template <class _Tp, class _Alloc > 48 void _Deque_base<_Tp,_Alloc>::_M_initialize_map(size_t __num_elements) { in _M_initialize_map() 68 template <class _Tp, class _Alloc > 69 void _Deque_base<_Tp,_Alloc>::_M_create_nodes(_Tp** __nstart, in _M_create_nodes() 79 template <class _Tp, class _Alloc > 80 void _Deque_base<_Tp,_Alloc>::_M_destroy_nodes(_Tp** __nstart, in _M_destroy_nodes() 102 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE deque<_Tp, _Alloc>::iterator 105 template <class _Tp, class _Alloc > [all …]
|
D | _list.h | 173 template <class _Tp, class _Alloc> 176 _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) 179 typedef _List_base<_Tp, _Alloc> _Self; 180 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _Node_allocator_type; 183 typedef _Alloc allocator_type; 227 template <class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Tp>) > 235 template <class _Tp, class _Alloc, class _Predicate> 236 void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred); 238 template <class _Tp, class _Alloc, class _BinaryPredicate> 239 void _S_unique(list<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred); [all …]
|
D | _slist.h | 147 template <class _Tp, class _Alloc> 151 typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type; 152 typedef _Slist_base<_Tp, _Alloc> _Self; 157 _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) 158 typedef _Alloc allocator_type; 197 template <class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Tp>) > 205 template <class _Tp, class _Alloc, class _BinaryPredicate> 206 void _Slist_unique(slist<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred); 208 template <class _Tp, class _Alloc, class _StrictWeakOrdering> 209 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x, [all …]
|
D | _unordered_set.h | 36 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) > in _STLP_CREATE_HASH_ITERATOR_TRAITS() 39 : public __stlport_class<unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> > in _STLP_CREATE_HASH_ITERATOR_TRAITS() 42 typedef unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> _Self; in _STLP_CREATE_HASH_ITERATOR_TRAITS() 47 _UnorderedSetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> _Ht; in _STLP_CREATE_HASH_ITERATOR_TRAITS() 186 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) > in _STLP_CREATE_HASH_ITERATOR_TRAITS() 189 : public __stlport_class<unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > in _STLP_CREATE_HASH_ITERATOR_TRAITS() 192 typedef unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> _Self; in _STLP_CREATE_HASH_ITERATOR_TRAITS() 197 _UnorderedMultisetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> _Ht; in _STLP_CREATE_HASH_ITERATOR_TRAITS() 327 #define _STLP_TEMPLATE_HEADER template <class _Value, class _HashFcn, class _EqualKey, class _Alloc> 328 #define _STLP_TEMPLATE_CONTAINER unordered_set<_Value,_HashFcn,_EqualKey,_Alloc> [all …]
|
/external/clang/test/SemaCXX/ |
D | crashes.cpp | 4 template<typename _Alloc> class allocator; 7 typename _Alloc = allocator<_CharT> > 9 template<typename _CharT, typename _Traits, typename _Alloc> 10 const typename basic_string<_CharT, _Traits, _Alloc>::size_type 11 basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_max_size // expected-error{{no member named '_Rep' … 192 template<class _Alloc> class allocator {}; 197 template<typename _CharT, typename _Traits, typename _Alloc> struct basic_string { 198 struct _Alloc_hider : _Alloc {}; 200 …utIterator> basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a = _Alloc()); 201 … static _CharT* _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterat… [all …]
|
/external/libcxx/include/ |
D | forward_list | 221 template<class _Tp, class _Alloc> class _LIBCPP_TYPE_VIS_ONLY forward_list; 358 template <class _Tp, class _Alloc> 363 typedef _Alloc allocator_type; 493 template <class _Tp, class _Alloc> 495 __forward_list_base<_Tp, _Alloc>::__forward_list_base(__forward_list_base&& __x) 502 template <class _Tp, class _Alloc> 504 __forward_list_base<_Tp, _Alloc>::__forward_list_base(__forward_list_base&& __x, 517 template <class _Tp, class _Alloc> 518 __forward_list_base<_Tp, _Alloc>::~__forward_list_base() 523 template <class _Tp, class _Alloc> [all …]
|
D | __functional_03 | 311 template<class _FD, class _Alloc, class _FB> class __func; 313 template<class _Fp, class _Alloc, class _Rp> 314 class __func<_Fp, _Alloc, _Rp()> 317 __compressed_pair<_Fp, _Alloc> __f_; 320 explicit __func(_Fp __f, _Alloc __a) : __f_(_VSTD::move(__f), _VSTD::move(__a)) {} 332 template<class _Fp, class _Alloc, class _Rp> 334 __func<_Fp, _Alloc, _Rp()>::__clone() const 336 typedef typename _Alloc::template rebind<__func>::other _Ap; 340 ::new (__hold.get()) __func(__f_.first(), _Alloc(__a)); 344 template<class _Fp, class _Alloc, class _Rp> [all …]
|
D | __hash_table | 87 template <class _Tp, class _Hash, class _Equal, class _Alloc> class __hash_table; 91 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> 674 template <class _Alloc> 677 typedef _Alloc allocator_type; 724 template <class _Alloc> class __hash_map_node_destructor; 726 template <class _Alloc> 729 typedef _Alloc allocator_type; 762 template <class _Tp, class _Hash, class _Equal, class _Alloc> 769 typedef _Alloc allocator_type; 1167 template <class _Tp, class _Hash, class _Equal, class _Alloc> [all …]
|
D | queue | 237 template <class _Alloc> 239 explicit queue(const _Alloc& __a, 241 _Alloc>::value>::type* = 0) 243 template <class _Alloc> 245 queue(const queue& __q, const _Alloc& __a, 247 _Alloc>::value>::type* = 0) 249 template <class _Alloc> 251 queue(const container_type& __c, const _Alloc& __a, 253 _Alloc>::value>::type* = 0) 256 template <class _Alloc> [all …]
|
D | list | 230 template <class _Tp, class _Alloc> class _LIBCPP_TYPE_VIS_ONLY list; 231 template <class _Tp, class _Alloc> class __list_imp; 504 template <class _Tp, class _Alloc> 511 typedef _Alloc allocator_type; 670 template <class _Tp, class _Alloc> 673 __list_imp<_Tp, _Alloc>::__unlink_nodes(__node_pointer __f, __node_pointer __l) 680 template <class _Tp, class _Alloc> 682 __list_imp<_Tp, _Alloc>::__list_imp() 688 template <class _Tp, class _Alloc> 690 __list_imp<_Tp, _Alloc>::__list_imp(const allocator_type& __a) [all …]
|
D | unordered_set | 335 class _Alloc = allocator<_Value> > 344 typedef _Alloc allocator_type; 619 template <class _Value, class _Hash, class _Pred, class _Alloc> 620 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n, 630 template <class _Value, class _Hash, class _Pred, class _Alloc> 631 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n, 641 template <class _Value, class _Hash, class _Pred, class _Alloc> 643 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set( 652 template <class _Value, class _Hash, class _Pred, class _Alloc> 654 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set( [all …]
|
D | unordered_map | 468 template <class _Alloc> 471 typedef _Alloc allocator_type; 710 class _Alloc = allocator<pair<const _Key, _Tp> > > 719 typedef _Alloc allocator_type; 1053 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> 1054 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map( 1064 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> 1065 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map( 1076 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> 1078 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map( [all …]
|
/external/clang/test/CodeGenCXX/ |
D | lpad-linetable.cpp | 22 template<typename _Tp, typename _Alloc> 25 typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; 30 typedef _Alloc allocator_type; 37 template<typename _Tp, typename _Alloc = std::allocator<_Tp> > 39 : protected _Vector_base<_Tp, _Alloc> 41 typedef _Vector_base<_Tp, _Alloc> _Base; 45 typedef _Alloc allocator_type;
|
/external/libcxx/include/ext/ |
D | hash_set | 214 class _Alloc = allocator<_Value> > 223 typedef _Alloc allocator_type; 330 template <class _Value, class _Hash, class _Pred, class _Alloc> 331 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n, 338 template <class _Value, class _Hash, class _Pred, class _Alloc> 339 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n, 346 template <class _Value, class _Hash, class _Pred, class _Alloc> 348 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set( 355 template <class _Value, class _Hash, class _Pred, class _Alloc> 357 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set( [all …]
|