/external/stlport/stlport/stl/ |
H A D | _numeric.c | 37 template <class _InputIterator, class _OutputIterator, class _Tp, variable 41 _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) { 46 _Tp __val = *__first; 54 template <class _InputIterator, class _OutputIterator, class _Tp, variable 58 _OutputIterator __result, _Tp*, 63 _Tp __val = *__first; 65 _Tp __tmp = *__first; 73 template <class _Tp, class _Integer, class _MonoidOperation> variable 74 _Tp __power(_Tp __ [all...] |
H A D | _complex.c | 43 template <class _Tp> 44 void complex<_Tp>::_div(const _Tp& __z1_r, const _Tp& __z1_i, 45 const _Tp& __z2_r, const _Tp& __z2_i, 46 _Tp& __res_r, _Tp& __res_i) { 47 _Tp __ar = __z2_r >= 0 ? __z2_r : -__z2_r; 48 _Tp __a 90 template <class _Tp, class _CharT, class _Traits> variable 105 template <class _Tp, class _CharT, class _Traits> variable [all...] |
H A D | _heap.c | 39 template <class _RandomAccessIterator, class _Distance, class _Tp> 43 _Distance __holeIndex, _Distance __topIndex, _Tp __val) 54 template <class _RandomAccessIterator, class _Distance, class _Tp> 57 _RandomAccessIterator __last, _Distance*, _Tp*) 60 _Tp(*(__last - 1))); 72 template <class _RandomAccessIterator, class _Distance, class _Tp, variable 77 _Distance __topIndex, _Tp __val, _Compare __comp) 90 class _Distance, class _Tp> 94 _Distance*, _Tp*) 97 _Tp(*(__las 144 class _Tp, class _Compare> variable 169 template <class _RandomAccessIterator, class _Tp, class _Compare> variable 187 template <class _RandomAccessIterator, class _Tp, class _Distance> variable 213 class _Tp, class _Distance> variable [all...] |
H A D | _iostream_string.h | 83 template <class _Tp> 84 inline _STLP_PRIV __iostring_allocator<_Tp>& _STLP_CALL 85 __stl_alloc_rebind(_STLP_PRIV __iostring_allocator<_Tp>& __a, const _Tp*) argument 87 template <class _Tp> 88 inline _STLP_PRIV __iostring_allocator<_Tp> _STLP_CALL 89 __stl_alloc_create(const _STLP_PRIV __iostring_allocator<_Tp>&, const _Tp*) argument 90 { return _STLP_PRIV __iostring_allocator<_Tp>(); }
|
H A D | _tempbuf.h | 47 template <class _Tp> 48 pair<_Tp*, ptrdiff_t> _STLP_CALL 49 __get_temporary_buffer(ptrdiff_t __len, _Tp*); 53 template <class _Tp> 54 inline pair<_Tp*, ptrdiff_t> _STLP_CALL get_temporary_buffer(ptrdiff_t __len) { 55 return __get_temporary_buffer(__len, (_Tp*) 0); 64 template <class _Tp> 65 inline pair<_Tp*, ptrdiff_t> _STLP_CALL 66 get_temporary_buffer(ptrdiff_t __len, _Tp*) { 67 return __get_temporary_buffer(__len, (_Tp*) 100 _M_initialize_buffer(const _Tp&, const __true_type&) argument [all...] |
H A D | _list.c | 65 template <class _Tp, class _Alloc> variable 66 void _List_base<_Tp,_Alloc>::clear() { variable 94 template <class _Tp, class _Alloc> variable 95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) { variable 106 template <class _Tp, class _Alloc> variable 107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) { variable 123 template <class _Tp, clas 124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { variable 138 template <class _Tp, class _Alloc, class _Predicate> variable 140 typedef typename list<_Tp, _Alloc>::iterator _Literator; typedef 151 template <class _Tp, class _Alloc, class _BinaryPredicate> variable 153 typedef typename list<_Tp, _Alloc>::iterator _Literator; typedef 167 template <class _Tp, class _Alloc, class _StrictWeakOrdering> variable 170 typedef typename list<_Tp, _Alloc>::iterator _Literator; typedef 205 template <class _Tp, class _Alloc, class _StrictWeakOrdering> variable 214 _STLP_PRIV _CArray<list<_Tp, _Alloc>, NB> __counter(__carry); local [all...] |
H A D | _slist.c | 42 template <class _Tp, class _Alloc> variable 44 _Slist_base<_Tp,_Alloc>::_M_erase_after(_Slist_node_base* __before_first, variable 69 template <class _Tp, class _Alloc> variable 70 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x) { variable 90 template <class _Tp, class _Alloc> 91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { variable 105 template <class _Tp, clas variable 106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) { variable 118 template <class _Tp, class _Alloc> variable 119 void slist<_Tp,_Alloc>::remove(const _Tp& __val) { variable 133 template <class _Tp, class _Alloc, class _BinaryPredicate> variable 136 typename slist<_Tp, _Alloc>::iterator __ite(__that.begin()); local 147 template <class _Tp, class _Alloc, class _StrictWeakOrdering> variable 153 typename slist<_Tp, _Alloc>::iterator __ite(__that.before_begin()); local 167 typename slist<_Tp, _Alloc>::iterator __i1(__that.before_begin()), __i2(__x.begin()); local 183 template <class _Tp, class _Alloc, class _StrictWeakOrdering> variable 190 _STLP_PRIV _CArray<slist<_Tp, _Alloc>, NB> __counter(__carry); local [all...] |
H A D | _uninitialized.h | 217 template <class _ForwardIter, class _Tp, class _Distance> 218 inline void __ufill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, _Distance*) { 227 template <class _ForwardIter, class _Tp, class _Distance> 229 const _Tp& __x, const input_iterator_tag &, _Distance* __d) 233 template <class _ForwardIter, class _Tp, class _Distance> 235 const _Tp& __x, const forward_iterator_tag &, _Distance* __d) 238 template <class _ForwardIter, class _Tp, class _Distance> 240 const _Tp& __x, const bidirectional_iterator_tag &, _Distance* __d) 244 template <class _ForwardIter, class _Tp, class _Distance> 246 const _Tp 341 __uinit_aux(_ForwardIter __first, _Size __n, const _Tp&, const __true_type& ) argument [all...] |
H A D | _vector.c | 39 template <class _Tp, class _Alloc> variable 40 void _Vector_base<_Tp,_Alloc>::_M_throw_length_error() const variable 43 template <class _Tp, class _Alloc> variable 44 void _Vector_base<_Tp, _Alloc>::_M_throw_out_of_range() const variable 56 # define __iterator__ _Tp* 58 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE vector<_Tp, _Alloc>::iterator 61 template <class _Tp, class _Alloc> variable 62 void vector<_Tp, _Alloc>::reserve(size_type __n) { variable 80 template <class _Tp, class _Alloc> variable 81 void vector<_Tp, _Allo variable 107 template <class _Tp, class _Alloc> variable 108 void vector<_Tp, _Alloc>::_M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, variable 121 template <class _Tp, class _Alloc> variable 122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, variable 139 template <class _Tp, class _Alloc> variable 140 void vector<_Tp, _Alloc>::_M_fill_insert_aux (iterator __pos, size_type __n, variable 165 template <class _Tp, class _Alloc> variable 166 void vector<_Tp, _Alloc>::_M_fill_insert(iterator __pos, variable 181 template <class _Tp, class _Alloc> variable 182 vector<_Tp, _Alloc>& vector<_Tp, _Alloc>::operator = (const vector<_Tp, _Alloc>& __x) { variable 210 void vector<_Tp, _Alloc>::_M_fill_assign(size_t __n, const _Tp& __val) { variable 212 vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator()); local 221 template <class _Tp, class _Alloc> variable 223 vector<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) { variable [all...] |
H A D | _algobase.c | 111 template <class _RandomAccessIter, class _Tp> 113 const _Tp& __val, 194 template <class _InputIter, class _Tp> 196 const _Tp& __val, 220 template <class _InputIter, class _Tp> 221 _InputIter find(_InputIter __first, _InputIter __last, const _Tp& __val) { 271 template <class _Tp> 291 template <class _Tp> 292 inline bool __stlp_eq(_Tp, _Tp) 452 template <class _ForwardIter, class _Tp, class _Compare1, class _Compare2, class _Distance> variable [all...] |
H A D | _iterator_base.h | 57 template <class _Category, class _Tp, _STLP_DFL_TMPL_PARAM(_Distance,ptrdiff_t), 58 _STLP_DFL_TMPL_PARAM(_Pointer,_Tp*), _STLP_DFL_TMPL_PARAM(_Reference,_Tp&) > 61 typedef _Tp value_type; 78 # define _STLP_ITERATOR_CATEGORY(_It, _Tp) _STLP_STD::iterator_category(_It) 79 # define _STLP_DISTANCE_TYPE(_It, _Tp) _STLP_STD::distance_type(_It) 80 # define _STLP_VALUE_TYPE(_It, _Tp) _STLP_STD::value_type(_It) 83 # define _STLP_IS_REF_TYPE_REAL_REF(_It, _Tp) __false_type() 86 # define _STLP_VALUE_TYPE(_It, _Tp) (_STLP_TYPENAME _STLP_STD::iterator_traits< _Tp > 211 __iterator_category(const _Tp*, const __true_type&) argument 223 __distance_type(const _Tp*, const __true_type&) argument 235 __value_type(const _Tp*, const __true_type&) argument [all...] |
H A D | _deque.c | 39 template <class _Tp, class _Alloc > variable 40 _Deque_base<_Tp,_Alloc >::~_Deque_base() { variable 47 template <class _Tp, class _Alloc > variable 48 void _Deque_base<_Tp,_Alloc>::_M_initialize_map(size_t __num_elements) { variable 54 _Tp** __nstart = _M_map._M_data + (_M_map_size._M_data - __num_nodes) / 2; 55 _Tp** __nfinish = __nstart + __num_nodes; 68 template <class _Tp, class _Alloc > variable 69 void _Deque_base<_Tp,_Alloc>::_M_create_nodes(_Tp** __nstart, variable 70 _Tp** __nfinis 79 template <class _Tp, class _Alloc > variable 80 void _Deque_base<_Tp,_Alloc>::_M_destroy_nodes(_Tp** __nstart, variable 105 template <class _Tp, class _Alloc > variable 106 deque<_Tp, _Alloc >& variable 107 deque<_Tp, _Alloc >::operator= (const deque<_Tp, _Alloc >& __x) { variable 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, variable 149 template <class _Tp, class _Alloc > variable 150 void deque<_Tp, _Alloc>::insert(iterator __pos, variable 177 template <class _Tp, class _Alloc > variable 178 void deque<_Tp,_Alloc>::insert(iterator __pos, variable 207 template <class _Tp, class _Alloc > variable 208 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __pos, variable 242 template <class _Tp, class _Alloc > variable 243 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __pos, variable 259 template <class _Tp, class _Alloc > variable 260 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __first, iterator __last, variable 323 template <class _Tp, class _Alloc > variable 324 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __first, iterator __last, variable 345 template <class _Tp, class _Alloc > variable 346 void deque<_Tp,_Alloc>::clear() { variable 367 template <class _Tp, class _Alloc > variable 368 void deque<_Tp,_Alloc>::_M_fill_initialize(const value_type& __val, variable 381 template <class _Tp, class _Alloc > variable 382 void deque<_Tp,_Alloc>::_M_push_back_aux_v(const value_type& __t) { variable 396 template <class _Tp, class _Alloc > variable 397 void deque<_Tp,_Alloc>::_M_push_back_aux() { variable 411 template <class _Tp, class _Alloc > variable 412 void deque<_Tp,_Alloc>::_M_push_front_aux_v(const value_type& __t) { variable 427 template <class _Tp, class _Alloc > variable 428 void deque<_Tp,_Alloc>::_M_push_front_aux() { variable 442 template <class _Tp, class _Alloc > variable 443 void deque<_Tp,_Alloc>::_M_pop_back_aux() { variable 452 template <class _Tp, class _Alloc > variable 453 void deque<_Tp,_Alloc>::_M_pop_front_aux() { variable 463 template <class _Tp, class _Alloc > variable 464 __iterator__ deque<_Tp,_Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, variable 505 template <class _Tp, class _Alloc > variable 506 __iterator__ deque<_Tp,_Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, variable 561 template <class _Tp, class _Alloc > variable 562 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, variable 600 template <class _Tp, class _Alloc > variable 601 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, variable 653 template <class _Tp, class _Alloc > variable 654 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, variable 692 template <class _Tp, class _Alloc > variable 693 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, variable 744 template <class _Tp, class _Alloc > variable 745 void deque<_Tp,_Alloc>::_M_new_elements_at_front(size_type __new_elems) { variable 758 template <class _Tp, class _Alloc > variable 759 void deque<_Tp,_Alloc>::_M_new_elements_at_back(size_type __new_elems) { variable 772 template <class _Tp, class _Alloc > variable 773 void deque<_Tp,_Alloc>::_M_reallocate_map(size_type __nodes_to_add, variable [all...] |
H A D | _string.c | 110 template <class _InputIter, class _CharT, class _Tp, class _Traits> variable 113 _Tp* __pt, _Traits* __traits) { 114 typedef typename _IsIntegral<_Tp>::_Ret _IsIntegral; 598 template <class _Tp, class _Alloc> variable 599 void _String_base<_Tp,_Alloc>::_M_throw_length_error() const variable 602 template <class _Tp, class _Alloc> variable 603 void _String_base<_Tp, _Alloc>::_M_throw_out_of_range() const variable 606 template <class _Tp, class _Alloc> variable 607 void _String_base<_Tp, _Alloc>::_M_allocate_block(size_t __n) { variable
|
H A D | _alloc.h | 181 # define _STLP_CONVERT_ALLOCATOR(__a, _Tp) __stl_alloc_create(__a,(_Tp*)0) 183 # define _STLP_CONVERT_ALLOCATOR(__a, _Tp) __a 188 # define _STLP_CONVERT_ALLOCATOR(__a, _Tp) __stl_alloc_create(__a,(_Tp*)0) 196 template <class _Tp, class _Allocator> 200 typedef typename _Allocator::_STLP_TEMPLATE rebind<_Tp> _Rebind_type; 203 { return allocator_type(_STLP_CONVERT_ALLOCATOR(__a, _Tp)); } 247 template <class _Tp> 249 typedef _Tp* pointe 453 __stl_alloc_create(const _Alloc& __a, const _Tp*) argument [all...] |
H A D | _slist.h | 58 template <class _Tp> 61 _Tp _M_data; 79 template <class _Tp, class _Traits> 89 typedef _Slist_iterator<_Tp, _Traits> _Self; 91 typedef _Slist_iterator<_Tp, _NonConstTraits> iterator; 93 typedef _Slist_iterator<_Tp, _ConstTraits> const_iterator; 126 template <class _Tp, class _Traits> 127 struct __type_traits<_STLP_PRIV _Slist_iterator<_Tp, _Traits> > { 139 template <class _Tp, class _Traits> 140 inline _Tp* _STLP_CAL 250 _M_create_node(const value_type& __x = _Tp()) argument 440 push_front(const value_type& __x = _Tp()) argument 469 _M_insert_after(_Node_base* __pos, const value_type& __x = _Tp()) argument 601 insert_after(iterator __pos, const value_type& __x = _Tp()) argument 635 insert(iterator __pos, const value_type& __x = _Tp()) argument [all...] |
H A D | _algo.c | 58 template <class _Tp> 62 const _Tp& __median(const _Tp& __a, const _Tp& __b, const _Tp& __c) { 78 template <class _Tp, class _Compare> variable 82 const _Tp& 83 __median(const _Tp& __a, const _Tp& __b, const _Tp 152 template <class _RandomAccessIter, class _Integer, class _Tp, variable 218 template <class _ForwardIter, class _Integer, class _Tp, variable 259 template <class _ForwardIter, class _Integer, class _Tp, class _BinaryPred> variable 808 template <class _ForwardIter, class _Predicate, class _Tp, class _Distance> variable 882 template <class _RandomAccessIter, class _Tp, class _Compare> variable 906 template <class _RandomAccessIter, class _Tp, class _Compare> variable 920 template <class _RandomAccessIter, class _Tp, class _Compare> variable 934 template <class _RandomAccessIter, class _Tp, class _Compare> variable 943 template <class _RandomAccessIter, class _Tp, class _Compare> variable 948 __unguarded_linear_insert<_RandomAccessIter, _Tp, _Compare>(__i, *__i, __comp); local 969 template <class _RandomAccessIter, class _Tp, class _Size, class _Compare> variable 1181 template <class _RandomAccessIter, class _Tp, class _Distance, class _Compare> variable 1219 template <class _RandomAccessIter, class _Tp, class _Compare> variable 1313 template <class _RandomAccessIter, class _Tp, class _Compare> variable 1354 template <class _ForwardIter, class _Tp, variable 1378 template <class _ForwardIter, class _Tp, variable 1532 template <class _BidirectionalIter, class _Tp, variable [all...] |
/external/stlport/test/unit/ |
H A D | mvctor_declaration_test.cpp | 48 template <class _Tp> 49 static bool is_movable(const _Tp&) { argument 50 typedef typename __move_traits<_Tp>::implemented _MovableTp; 54 template <class _Tp> 55 static bool is_move_complete(const _Tp&) { argument 56 typedef __move_traits<_Tp> _TpMoveTraits; 63 # if defined (__DMC__) // slist<_Tp,_Alloc>::remove error
|
/external/stlport/stlport/stl/debug/ |
H A D | _list.h | 41 #define _STLP_NON_DBG_LIST _STLP_PRIV _STLP_NON_DBG_NAME(list) <_Tp, _Alloc> 46 template <class _Tp, class _Alloc> 47 inline _Tp* 49 { return (_Tp*)0; } 50 template <class _Tp, class _Alloc> 56 template <class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Tp>) > 63 , public __stlport_class<list<_Tp, _Alloc> > 67 typedef list<_Tp, _Alloc> _Self; 95 explicit list(size_type __n, const _Tp argument 206 insert(iterator __pos, const _Tp& __x = _Tp()) argument 289 resize(size_type __new_size, const _Tp& __x = _Tp()) argument [all...] |
H A D | _slist.h | 34 #define _STLP_NON_DBG_SLIST _STLP_PRIV _STLP_NON_DBG_NAME(slist) <_Tp, _Alloc> 39 template <class _Tp, class _Alloc> 40 inline _Tp* 42 { return (_Tp*)0; } 44 template <class _Tp, class _Alloc> 72 template <class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Tp>) > 79 , public __stlport_class<slist<_Tp, _Alloc> > 84 typedef slist<_Tp,_Alloc> _Self; 111 explicit slist(size_type __n, const value_type& __x = _Tp(), argument 238 insert_after(iterator __pos, const value_type& __x = _Tp()) argument 329 insert(iterator __pos, const value_type& __x = _Tp()) argument 382 resize(size_type __new_size, const value_type& __x = _Tp()) argument [all...] |