Searched refs:_Tp (Results 26 - 50 of 95) sorted by relevance

1234

/external/stlport/stlport/stl/
H A D_stack.h40 template <class _Tp, class _Sequence = deque<_Tp> >
42 # define _STLP_STACK_ARGS _Tp
43 template <class _Tp>
45 template <class _Tp, class _Sequence>
50 : public __stlport_class<stack<_Tp> >
52 : public __stlport_class<stack<_Tp, _Sequence> >
57 typedef deque<_Tp> _Sequence;
58 typedef stack<_Tp> _Self;
60 typedef stack<_Tp, _Sequenc
[all...]
H A D_vector.c39 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 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...]
H A Dtype_manips.h165 template <class _Tp>
166 char _STLP_CALL _IsCopyableFun(bool, _NoVolatilePointerShim, _Tp const*, _Tp*); // no implementation is required
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>
[all...]
H A D_numeric.h40 template <class _InputIterator, class _Tp>
42 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp _Init) {
49 template <class _InputIterator, class _Tp, class _BinaryOperation>
51 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp _Init,
59 template <class _InputIterator1, class _InputIterator2, class _Tp>
61 _Tp inner_product(_InputIterator1 __first1, _InputIterator1 __last1,
62 _InputIterator2 __first2, _Tp _Init) {
69 template <class _InputIterator1, class _InputIterator2, class _Tp,
[all...]
H A D_slist.c42 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_string_base.h40 template <class _Tp, class _Alloc>
42 typedef _String_base<_Tp, _Alloc> _Self;
44 _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
50 typedef _STLP_alloc_proxy<_Tp*, _Tp, allocator_type> _AllocProxy;
55 _Tp* _M_end_of_storage;
56 _Tp _M_static_buf[_DEFAULT_SIZE];
59 _Tp* _M_end_of_storage;
65 _Tp const* _M_Start() const { return _M_start_of_storage._M_data; }
66 _Tp* _M_Star
[all...]
H A D_alloc.h181 # 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_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 {}
129 _Tp* allocate(size_type __n, const void* = 0) {
135 _Tp* __re
[all...]
H A 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>(
[all...]
H A D_heap.c39 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_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; }
48 template <class _Tp>
49 struct greater : public binary_function<_Tp, _Tp, bool> {
50 bool operator()(const _Tp& __x, const _Tp
[all...]
H A D_deque.h83 template <class _Tp>
88 return (sizeof(_Tp) < blocksize ? (blocksize / sizeof(_Tp)) : 1);
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, _Trait
[all...]
H A D_stream_iterator.h65 # define __ISI_TMPL_HEADER_ARGUMENTS class _Tp, class _CharT, class _Traits, class _Dist
66 # define __ISI_TMPL_ARGUMENTS _Tp, _CharT, _Traits, _Dist
67 template <class _Tp,
70 class istream_iterator : public iterator<input_iterator_tag, _Tp , _Dist,
71 const _Tp*, const _Tp& > {
74 # define __ISI_TMPL_HEADER_ARGUMENTS class _Tp
75 # define __ISI_TMPL_ARGUMENTS _Tp
76 template <class _Tp>
77 class istream_iterator : public iterator<input_iterator_tag, _Tp , ptrdiff_
[all...]
H A Dboost_type_traits.h48 template <class _Tp> struct _IsRef {
49 enum { _Is = ::boost::is_reference<_Tp>::value };
53 template <class _Tp> struct _IsPtr {
54 enum { is_pointer = ::boost::is_pointer<_Tp>::value };
58 template <class _Tp> struct _IsIntegral {
59 enum { is_integral = ::boost::is_integral<_Tp>::value };
63 template <class _Tp> struct _IsRational {
64 enum { is_float = ::boost::is_float<_Tp>::value };
68 template <class _Tp>
70 enum { trivial_constructor = ::boost::has_trivial_constructor<_Tp>
[all...]
H A D_queue.h52 template <class _Tp, class _Sequence = deque<_Tp> >
54 # define _STLP_QUEUE_ARGS _Tp
55 template <class _Tp>
57 template <class _Tp, class _Sequence>
62 : public __stlport_class<queue<_Tp> >
64 : public __stlport_class<queue<_Tp, _Sequence> >
69 typedef deque<_Tp> _Sequence;
70 typedef queue<_Tp> _Self;
72 typedef queue<_Tp, _Sequenc
[all...]
/external/stlport/test/unit/
H A Dlimits_test.cpp63 template <class _Tp>
64 bool valid_sign_info(bool limit_is_signed, const _Tp &) {
65 return (limit_is_signed && _Tp(-1) < 0) ||
66 (!limit_is_signed && _Tp(-1) > 0);
69 template <class _Tp>
70 bool test_integral_limits_base(const _Tp &, bool unknown_sign = true, bool is_signed = true) {
71 typedef numeric_limits<_Tp> lim;
82 CHECK_COND(valid_sign_info(lim::is_signed, _Tp()));
87 template <class _Tp>
88 bool test_integral_limits(const _Tp
[all...]
H A Diota.h7 template <typename _It, typename _Tp>
8 void __iota(_It __first, _It __last, _Tp __val) {
/external/clang/test/CodeGenCXX/
H A Ddebug-info-use-after-free.cpp92 template < typename _Tp > struct new_allocator
94 typedef _Tp *pointer;
99 template < typename _Tp > struct allocator:new_allocator < _Tp > {
101 template < typename _Tp, typename _Alloc > struct _Vector_base {
102 typedef typename _Alloc::template rebind < _Tp >::other _Tp_alloc_type;
112 template < typename _Tp, typename _Alloc =
113 allocator < _Tp > >struct vector:_Vector_base < _Tp, _Alloc > { };
139 template < typename _Tp > clas
[all...]
/external/clang/test/Analysis/
H A Ddead-stores.cpp44 template<typename _Tp>
49 template<typename _Tp, typename _Number2> struct _Row_base {
50 _Row_base(const pencil<_Tp>& x) {}
52 template<typename _Tp, typename _Number2 = TestTemp::pencil<_Tp> >
53 class row : protected _Row_base<_Tp, _Number2> {
54 typedef _Row_base<_Tp, _Number2> _Base;
/external/stlport/stlport/stl/pointers/
H A 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...]
/external/clang/test/CXX/except/except.spec/
H A Dcanonical.cpp8 template <class _Tp> _Tp&& declval() noexcept;
10 template <class _Tp, class... _Args>
13 static const bool value = noexcept(_Tp(declval<_Args>()...));
/external/clang/test/SemaTemplate/
H A Ddeduction-crash.cpp64 template <class _Tp> struct remove_reference<_Tp&> ;
68 template <class _Tp, class _Up, int = __tuple_like<typename remove_reference<_Tp>::type>::value>
/external/clang/test/SemaCXX/
H A DPR9908.cpp3 template <class _Tp, class _Up>
6 typedef typename _Tp::template rebind<_Up>::other type;
/external/stlport/stlport/stl/debug/
H A D_vector.h37 #define _STLP_NON_DBG_VECTOR _STLP_PRIV _STLP_NON_DBG_NAME(vector) <_Tp, _Alloc>
42 template <class _Tp, class _Alloc>
43 inline _Tp*
45 { return (_Tp*)0; }
46 template <class _Tp, class _Alloc>
54 template <class _Tp, class _NcIt>
57 template <class _Tp, class _NcIt>
59 typedef _Nonconst_traits<_Tp> _BaseT;
60 typedef _Tp value_type;
61 typedef _Tp
[all...]

Completed in 357 milliseconds

1234