/external/stlport/stlport/stl/ |
H A D | _tempbuf.c | 35 template <class _Tp> 36 pair<_Tp*, ptrdiff_t> _STLP_CALL 37 __get_temporary_buffer(ptrdiff_t __len, _Tp*) 39 if (__len > ptrdiff_t(INT_MAX / sizeof(_Tp))) 40 __len = INT_MAX / sizeof(_Tp); 43 _Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp)); 45 return pair<_Tp*, ptrdiff_t>(__tmp, __len); 49 return pair<_Tp*, ptrdiff_ [all...] |
H A D | _carray.h | 35 template <class _Tp, size_t _Nb> 37 _CArray (const _Tp& __val) { 39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); 44 _Destroy_Range(__REINTERPRET_CAST(_Tp*, _M_data + 0), 45 __REINTERPRET_CAST(_Tp*, _M_data + _Nb * sizeof(_Tp))); 48 _Tp& operator [] (size_t __i) { 50 return *__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)); [all...] |
H A D | _function_base.h | 64 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; } 69 template <class _Tp> 70 struct less : public binary_function<_Tp,_Tp,bool> 76 , public __stlport_class<less<_Tp> > 79 bool operator()(const _Tp [all...] |
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 | _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 | _raw_storage_iter.h | 39 template <class _ForwardIterator, class _Tp> 54 raw_storage_iterator<_ForwardIterator, _Tp>& operator*() { return *this; } 55 raw_storage_iterator<_ForwardIterator, _Tp>& operator=(const _Tp& __element) { 59 raw_storage_iterator<_ForwardIterator, _Tp>& operator++() { 63 raw_storage_iterator<_ForwardIterator, _Tp> operator++(int) { 64 raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this; 71 template <class _ForwardIterator, class _Tp> 72 inline output_iterator_tag iterator_category(const raw_storage_iterator<_ForwardIterator, _Tp>&) { return output_iterator_tag(); }
|
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 | _construct.h | 55 template <class _Tp> 56 inline void __destroy_aux(_Tp* __pointer, const __false_type& /*_Trivial_destructor*/) 57 { __pointer->~_Tp(); } 59 template <class _Tp> 60 inline void __destroy_aux(_Tp*, const __true_type& /*_Trivial_destructor*/) {} 62 template <class _Tp> 63 inline void _Destroy(_Tp* __pointer) { 64 typedef typename __type_traits<_Tp>::has_trivial_destructor _Trivial_destructor; 67 memset(__REINTERPRET_CAST(char*, __pointer), _STLP_SHRED_BYTE, sizeof(_Tp)); 71 template <class _Tp> [all...] |
H A D | _valarray.h | 47 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))); 90 template <class _Tp> [all...] |
H A D | _move_construct_fwk.h | 34 template <class _Tp> 37 explicit __move_source (_Tp &_src) : _M_data(_src) 40 _Tp& get() const 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; 82 * in such a case will be __invalid_source<_Tp> t [all...] |
H A D | _function_adaptors.h | 64 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)(); } 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); } 90 template<class _Result, class _Tp> 91 class _Const_mem_fun0_ptr : public unary_function<const _Tp*,_Resul [all...] |
H A D | _iterator_old.h | 53 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__, _Distance>&) 118 template <class _BidirectionalIterator, class _Tp, class __Reference, 120 inline _Tp* _STLP_CAL [all...] |
H A D | _auto_ptr.h | 31 template <class _Tp> 35 _Tp* const _M_p; 37 auto_ptr_ref(__ptr_base& __r, _Tp* __p) : _M_r(__r), _M_p(__p) { } 39 _Tp* release() const { _M_r.__set(__STATIC_CAST(void*, 0)); return _M_p; } 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 { 54 _Tp* __p [all...] |
H A D | _valarray.c | 35 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> __tm [all...] |
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...] |
/external/clang/test/CodeGenCXX/ |
H A D | atomic.cpp | 4 template<typename _Tp> struct Ptr { 10 template<typename _Tp> inline void Ptr<_Tp>::f() {
|
H A D | 2007-09-10-RecursiveTypeResolution.cpp | 28 template < typename _Tp > struct allocator 30 typedef _Tp *pointer; 33 typename _Tp > inline void find (_InputIterator __last, 34 const _Tp & __val) 41 template < typename _Tp, typename _Alloc> struct _Vector_base 45 _Tp *_M_start; 50 template < typename _Tp, typename _Alloc = std::allocator < _Tp > > 51 class vector:protected _Vector_base < _Tp,_Alloc > 55 vector < _Tp, _Allo [all...] |
H A D | thunk-use-after-free.cpp | 5 template < typename _Tp > struct new_allocator 7 typedef _Tp *pointer; 12 template < typename _Tp > struct allocator:new_allocator < _Tp > { 14 template < typename _Tp, typename _Alloc > struct _Vector_base { 15 typedef typename _Alloc::template rebind < _Tp >::other _Tp_alloc_type; 25 template < typename _Tp, typename _Alloc = 26 allocator < _Tp > >struct vector:_Vector_base < _Tp, _Alloc > { };
|
/external/clang/test/PCH/ |
H A D | cxx-variadic-templates.h | 2 template<typename _Tp> 7 shared_ptr<_Tp> 11 template<class _Tp> 13 shared_ptr<_Tp> 14 shared_ptr<_Tp>::allocate_shared(const _Alloc& __a, _Args&& ...__args) 16 shared_ptr<_Tp> __r;
|
H A D | cxx-traits.h | 3 template<typename _Tp> 8 template<typename _Tp>
|
/external/stlport/test/unit/ |
H A D | math_aux.h | 18 template <class _Tp> 19 bool are_equals(_Tp val, _Tp ref) { 21 return (ref - val) <= __STD numeric_limits<_Tp>::epsilon(); 24 return (val - ref) <= __STD numeric_limits<_Tp>::epsilon();
|
/external/clang/test/CXX/expr/expr.post/expr.static.cast/ |
H A D | p9-0x.cpp | 22 template <class _Tp> inline _Tp* addressof(_Tp& __x) { 23 return (_Tp*)&(char&)__x;
|
/external/stlport/src/ |
H A D | complex.cpp | 83 template <class _Tp> 84 static void _divT(const _Tp& __z1_r, const _Tp& __z1_i, 85 const _Tp& __z2_r, const _Tp& __z2_i, 86 _Tp& __res_r, _Tp& __res_i) { 87 _Tp __ar = __z2_r >= 0 ? __z2_r : -__z2_r; 88 _Tp __ai = __z2_i >= 0 ? __z2_i : -__z2_i; 91 _Tp __rati [all...] |
H A D | complex_trig.cpp | 67 template <class _Tp> 68 static complex<_Tp> sinT(const complex<_Tp>& z) { 69 return complex<_Tp>(::sin(z._M_re) * ::cosh(z._M_im), 86 template <class _Tp> 87 static complex<_Tp> cosT(const complex<_Tp>& z) { 88 return complex<_Tp>(::cos(z._M_re) * ::cosh(z._M_im), 105 template <class _Tp> 106 static complex<_Tp> tan [all...] |
/external/clang/test/SemaCXX/ |
H A D | PR9902.cpp | 3 template <class _Tp, class _Up, bool = false> 8 template <template <class, class...> class _Alloc, class _Tp, class ..._Args, 10 struct __allocator_traits_rebind<_Alloc<_Tp, _Args...>, _Up, false>
|