Home
last modified time | relevance | path

Searched refs:_Tp (Results 1 – 25 of 97) sorted by relevance

1234

/external/stlport/stlport/stl/
D_iterator_base.h57 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 >::va…
87 # define _STLP_DISTANCE_TYPE(_It, _Tp) (_STLP_TYPENAME _STLP_STD::iterator_traits< _Tp >::di…
90 # define _STLP_ITERATOR_CATEGORY(_It, _Tp) _STLP_STD::iterator_traits< _Tp >::iterator_categor…
[all …]
D_function_base.h64 template <class _Tp>
65 struct equal_to : public binary_function<_Tp, _Tp, bool> {
66 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x == __y; } in operator()
69 template <class _Tp>
70 struct less : public binary_function<_Tp,_Tp,bool>
76 , public __stlport_class<less<_Tp> >
79 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x < __y; } in operator()
82 void _M_swap_workaround(less<_Tp>& __x) {} in _M_swap_workaround()
87 template <class _Tp>
88 struct __type_traits<less<_Tp> > {
[all …]
D_valarray.h47 template <class _Tp> class valarray;
51 template <class _Tp> class slice_array;
52 template <class _Tp> class gslice_array;
53 template <class _Tp> class mask_array;
54 template <class _Tp> class indirect_array;
63 template <class _Tp>
65 _Tp* _M_first;
74 _M_first = __STATIC_CAST(_Tp*, __stl_new(__n * sizeof(_Tp))); in _M_allocate()
90 template <class _Tp>
91 class valarray : private _Valarray_base<_Tp>
[all …]
D_function_adaptors.h64 template<class _Result, class _Tp>
65 class _Mem_fun0_ptr : public unary_function<_Tp*, _Result> {
67 typedef _Result (_Tp::*__fun_type) ();
71 _Result operator ()(_Tp* __p) const { return (__p->*_M_f)(); } in operator()
77 template<class _Result, class _Tp, class _Arg>
78 class _Mem_fun1_ptr : public binary_function<_Tp*,_Arg,_Result> {
80 typedef _Result (_Tp::*__fun_type) (_Arg);
84 _Result operator ()(_Tp* __p, _Arg __x) const { return (__p->*_M_f)(__x); } in operator()
90 template<class _Result, class _Tp>
91 class _Const_mem_fun0_ptr : public unary_function<const _Tp*,_Result> {
[all …]
D_complex.c43 template <class _Tp>
44 void complex<_Tp>::_div(const _Tp& __z1_r, const _Tp& __z1_i, in _div()
45 const _Tp& __z2_r, const _Tp& __z2_i, in _div()
46 _Tp& __res_r, _Tp& __res_i) { in _div()
47 _Tp __ar = __z2_r >= 0 ? __z2_r : -__z2_r; in _div()
48 _Tp __ai = __z2_i >= 0 ? __z2_i : -__z2_i; in _div()
51 _Tp __ratio = __z2_r / __z2_i; in _div()
52 _Tp __denom = __z2_i * (1 + __ratio * __ratio); in _div()
57 _Tp __ratio = __z2_i / __z2_r; in _div()
58 _Tp __denom = __z2_r * (1 + __ratio * __ratio); in _div()
[all …]
D_construct.h55 template <class _Tp>
56 inline void __destroy_aux(_Tp* __pointer, const __false_type& /*_Trivial_destructor*/) in __destroy_aux()
57 { __pointer->~_Tp(); } in __destroy_aux()
59 template <class _Tp>
60 inline void __destroy_aux(_Tp*, const __true_type& /*_Trivial_destructor*/) {} in __destroy_aux() argument
62 template <class _Tp>
63 inline void _Destroy(_Tp* __pointer) { in _Destroy()
64 typedef typename __type_traits<_Tp>::has_trivial_destructor _Trivial_destructor; in _Destroy()
67 memset(__REINTERPRET_CAST(char*, __pointer), _STLP_SHRED_BYTE, sizeof(_Tp)); in _Destroy()
71 template <class _Tp>
[all …]
D_iterator_old.h53 template <class _BidirectionalIterator, class _Tp,
54 _STLP_DFL_TMPL_PARAM(_Reference, _Tp& ),
58 _STLP_DFL_TMPL_PARAM(_Pointer, _Tp*),
65 typedef reverse_bidirectional_iterator<_BidirectionalIterator, _Tp,
72 typedef _Tp value_type;
77 typedef _Tp* pointer;
113 template <class _BidirectionalIterator, class _Tp, class __Reference,
116 iterator_category(const reverse_bidirectional_iterator<_BidirectionalIterator, _Tp, Reference__, _D… in iterator_category() argument
118 template <class _BidirectionalIterator, class _Tp, class __Reference,
120 inline _Tp* _STLP_CALL
[all …]
D_tempbuf.h47 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) { in get_temporary_buffer()
55 return __get_temporary_buffer(__len, (_Tp*) 0); in get_temporary_buffer()
64 template <class _Tp>
65 inline pair<_Tp*, ptrdiff_t> _STLP_CALL
66 get_temporary_buffer(ptrdiff_t __len, _Tp*) { in get_temporary_buffer() argument
67 return __get_temporary_buffer(__len, (_Tp*) 0); in get_temporary_buffer()
[all …]
Dtype_traits.h79 template <class _Tp> struct _IsIntegral
129 template <class _Tp> struct _IsRational
144 template <class _Tp> struct __type_traits;
171 template <class _Tp>
199 template <class _Tp>
207 static _Tp& __null_rep();
214 template <class _Tp>
215 struct __type_traits : __type_traits_aux<typename _IsPtr<_Tp>::_Ret> {};
219 template <class _Tp> struct _IsPtr {
223 template <class _Tp>
[all …]
D_valarray.c35 template <class _Tp>
36 _Valarray_bool valarray<_Tp>:: operator!() const {
44 template <class _Tp>
45 valarray<_Tp>& valarray<_Tp>::operator=(const slice_array<_Tp>& __x) {
55 template <class _Tp>
56 valarray<_Tp> valarray<_Tp>::operator[](slice __slice) const {
57 valarray<_Tp> __tmp(__slice.size(), _NoInit());
86 template <class _Tp>
87 valarray<_Tp>& valarray<_Tp>::operator=(const gslice_array<_Tp>& __x) {
97 template <class _Tp>
[all …]
D_complex.h35 template <class _Tp>
37 typedef _Tp value_type;
38 typedef complex<_Tp> _Self;
617 template <class _Tp>
618 inline complex<_Tp> _STLP_CALL operator+(const complex<_Tp>& __z)
621 template <class _Tp>
622 inline complex<_Tp> _STLP_CALL operator-(const complex<_Tp>& __z)
623 { return complex<_Tp>(-__z._M_re, -__z._M_im); }
627 template <class _Tp>
628 inline complex<_Tp> _STLP_CALL operator+(const _Tp& __x, const complex<_Tp>& __z)
[all …]
D_auto_ptr.h31 template <class _Tp>
35 _Tp* const _M_p;
37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { } in auto_ptr_ref()
39 _Tp* release() const { _M_r.__set(__STATIC_CAST(void*, 0)); return _M_p; } in release()
43 typedef auto_ptr_ref<_Tp> _Self;
47 template<class _Tp>
50 typedef _Tp element_type;
51 typedef auto_ptr<_Tp> _Self;
53 _Tp* release() _STLP_NOTHROW { in release()
54 _Tp* __px = this->get(); in release()
[all …]
Dtype_manips.h165 template <class _Tp>
166 char _STLP_CALL _IsCopyableFun(bool, _NoVolatilePointerShim, _Tp const*, _Tp*); // no implementatio…
178 template <class _Tp> struct _IsUnQual;
215 template <class _Tp>
216 struct _AreSameTypes<_Tp, _Tp> {
239 template<class _Tp>
240 struct _UnConstPtr { typedef _Tp _Type; };
242 template<class _Tp>
243 struct _UnConstPtr<_Tp*> { typedef _Tp _Type; };
245 template<class _Tp>
[all …]
D_pthread_alloc.h96 template <class _Tp>
97 class pthread_allocator : public __stlport_class<pthread_allocator<_Tp> > {
102 typedef _Tp* pointer;
103 typedef const _Tp* const_pointer;
104 typedef _Tp& reference;
105 typedef const _Tp& const_reference;
106 typedef _Tp value_type;
115 pthread_allocator(const pthread_allocator<_Tp>& a) _STLP_NOTHROW {} in pthread_allocator()
129 _Tp* allocate(size_type __n, const void* = 0) {
135 _Tp* __ret = __REINTERPRET_CAST(value_type*, _S_Alloc::allocate(__buf_size));
[all …]
D_function.h43 template <class _Tp>
44 struct not_equal_to : public binary_function<_Tp, _Tp, bool> {
45 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x != __y; } in operator()
48 template <class _Tp>
49 struct greater : public binary_function<_Tp, _Tp, bool> {
50 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x > __y; } in operator()
53 template <class _Tp>
54 struct greater_equal : public binary_function<_Tp, _Tp, bool> {
55 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x >= __y; } in operator()
58 template <class _Tp>
[all …]
D_vector.c39 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()
56 # define __iterator__ _Tp*
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()
[all …]
D_numeric.h40 template <class _InputIterator, class _Tp>
42 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp _Init) { in accumulate()
49 template <class _InputIterator, class _Tp, class _BinaryOperation>
51 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp _Init, in accumulate()
59 template <class _InputIterator1, class _InputIterator2, class _Tp>
61 _Tp inner_product(_InputIterator1 __first1, _InputIterator1 __last1, in inner_product()
62 _InputIterator2 __first2, _Tp _Init) { in inner_product()
69 template <class _InputIterator1, class _InputIterator2, class _Tp,
72 _Tp inner_product(_InputIterator1 __first1, _InputIterator1 __last1, in inner_product()
73 _InputIterator2 __first2, _Tp _Init, in inner_product()
[all …]
D_move_construct_fwk.h34 template <class _Tp>
37 explicit __move_source (_Tp &_src) : _M_data(_src) in __move_source()
40 _Tp& get() const in get()
43 _Tp &_M_data;
46 typedef __move_source<_Tp> _Self;
51 template <class _Tp>
61 typedef typename _IsSTLportClass<_Tp>::_Ret implemented;
70 typedef __type_traits<_Tp>::has_trivial_destructor _TpMoveComplete;
73 typedef typename __type_traits<_Tp>::has_trivial_destructor complete;
85 template <class _Tp>
[all …]
D_deque.h83 template <class _Tp>
88 return (sizeof(_Tp) < blocksize ? (blocksize / sizeof(_Tp)) : 1); in _S_buffer_size()
93 typedef _Tp value_type;
99 typedef _Deque_iterator_base< _Tp > _Self;
161 template <class _Tp, class _Traits>
162 struct _Deque_iterator : public _Deque_iterator_base< _Tp> {
164 typedef _Tp value_type;
171 typedef _Deque_iterator_base< _Tp > _Base;
172 typedef _Deque_iterator<_Tp, _Traits> _Self;
174 typedef _Deque_iterator<_Tp, _NonConstTraits> iterator;
[all …]
D_alloc.h181 # define _STLP_CONVERT_ALLOCATOR(__a, _Tp) __stl_alloc_create(__a,(_Tp*)0) argument
183 # define _STLP_CONVERT_ALLOCATOR(__a, _Tp) __a argument
188 # define _STLP_CONVERT_ALLOCATOR(__a, _Tp) __stl_alloc_create(__a,(_Tp*)0) argument
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)); } in create_allocator()
269 template <class _Tp>
274 : public __stlport_class<allocator<_Tp> >
277 typedef _Tp value_type;
278 typedef _Tp* pointer;
[all …]
/external/stlport/stlport/
Dtype_traits43 template <class _Tp>
58 static const bool __value = sizeof(__test<_Tp>(0)) == sizeof(__select_types::__t1);
64 template <class _Tp>
65 const bool __instance<_Tp>::__value = sizeof(__instance<_Tp>::__test<_Tp>(0)) == sizeof(__select_ty…
129 template <class _Tp, _Tp __v>
132 static const _Tp value = __v;
135 typedef _Tp value_type;
136 typedef integral_constant<_Tp, __v> type;
144 template <typename _Tp>
146 public integral_constant<bool, __uoc_aux<_Tp>::__value>
[all …]
/external/stlport/src/
Dcomplex.cpp83 template <class _Tp>
84 static void _divT(const _Tp& __z1_r, const _Tp& __z1_i, in _divT()
85 const _Tp& __z2_r, const _Tp& __z2_i, in _divT()
86 _Tp& __res_r, _Tp& __res_i) { in _divT()
87 _Tp __ar = __z2_r >= 0 ? __z2_r : -__z2_r; in _divT()
88 _Tp __ai = __z2_i >= 0 ? __z2_i : -__z2_i; in _divT()
91 _Tp __ratio = __z2_r / __z2_i; in _divT()
92 _Tp __denom = __z2_i * (1 + __ratio * __ratio); in _divT()
97 _Tp __ratio = __z2_i / __z2_r; in _divT()
98 _Tp __denom = __z2_r * (1 + __ratio * __ratio); in _divT()
[all …]
Dcomplex_trig.cpp67 template <class _Tp>
68 static complex<_Tp> sinT(const complex<_Tp>& z) { in sinT()
69 return complex<_Tp>(::sin(z._M_re) * ::cosh(z._M_im), in sinT()
86 template <class _Tp>
87 static complex<_Tp> cosT(const complex<_Tp>& z) { in cosT()
88 return complex<_Tp>(::cos(z._M_re) * ::cosh(z._M_im), in cosT()
105 template <class _Tp>
106 static complex<_Tp> tanT(const complex<_Tp>& z, const _Tp& Tp_limit) { in tanT()
107 _Tp re2 = 2.f * z._M_re; in tanT()
108 _Tp im2 = 2.f * z._M_im; in tanT()
[all …]
/external/stlport/test/unit/
Dlimits_test.cpp63 template <class _Tp>
64 bool valid_sign_info(bool limit_is_signed, const _Tp &) { in valid_sign_info() argument
65 return (limit_is_signed && _Tp(-1) < 0) || in valid_sign_info()
66 (!limit_is_signed && _Tp(-1) > 0); in valid_sign_info()
69 template <class _Tp>
70 bool test_integral_limits_base(const _Tp &, bool unknown_sign = true, bool is_signed = true) { in test_integral_limits_base() argument
71 typedef numeric_limits<_Tp> lim; in test_integral_limits_base()
82 CHECK_COND(valid_sign_info(lim::is_signed, _Tp())); in test_integral_limits_base()
87 template <class _Tp>
88 bool test_integral_limits(const _Tp &val, bool unknown_sign = true, bool is_signed = true) { in test_integral_limits()
[all …]
/external/stlport/stlport/stl/pointers/
D_tools.h30 template <class _Tp> struct less;
53 template <class _Tp>
54 char _UseVoidPtrStorageType(const __false_type& /*POD*/, const _Tp&);
58 template <class _Tp>
59 char _UseConstVoidPtrStorageType(const __false_type& /*POD*/, const _Tp&);
63 template <class _Tp>
64 char _UseVolatileVoidPtrStorageType(const __false_type& /*POD*/, const _Tp&);
68 template <class _Tp>
69 char _UseConstVolatileVoidPtrStorageType(const __false_type& /*POD*/, const _Tp&);
82 template <class _Tp>
[all …]

1234