Searched refs:_Tp (Results 1 - 25 of 34) sorted by relevance

12

/haiku/headers/cpp/std/
H A Dstd_valarray.h72 template<class _Clos, typename _Tp> class _Expr;
94 template<class _Tp> struct _Unary_plus;
95 template<class _Tp> struct _Bitwise_and;
96 template<class _Tp> struct _Bitwise_or;
97 template<class _Tp> struct _Bitwise_xor;
98 template<class _Tp> struct _Bitwise_not;
99 template<class _Tp> struct _Shift_left;
100 template<class _Tp> struct _Shift_right;
102 template<class _Tp> class valarray; // An array of type _Tp
[all...]
H A Dindirect_array.h37 template <class _Tp> class indirect_array
40 typedef _Tp value_type;
42 void operator= (const valarray<_Tp>&) const;
43 void operator*= (const valarray<_Tp>&) const;
44 void operator/= (const valarray<_Tp>&) const;
45 void operator%= (const valarray<_Tp>&) const;
46 void operator+= (const valarray<_Tp>&) const;
47 void operator-= (const valarray<_Tp>&) const;
48 void operator^= (const valarray<_Tp>&) const;
49 void operator&= (const valarray<_Tp>
[all...]
H A Dgslice_array.h37 template<typename _Tp> class gslice_array
40 typedef _Tp value_type;
42 void operator= (const valarray<_Tp>&) const;
43 void operator*= (const valarray<_Tp>&) const;
44 void operator/= (const valarray<_Tp>&) const;
45 void operator%= (const valarray<_Tp>&) const;
46 void operator+= (const valarray<_Tp>&) const;
47 void operator-= (const valarray<_Tp>&) const;
48 void operator^= (const valarray<_Tp>&) const;
49 void operator&= (const valarray<_Tp>
[all...]
H A Dvalarray_array.h45 template<typename _Tp>
47 __valarray_fill (_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
51 template<typename _Tp>
53 __valarray_fill (_Tp* __restrict__ __a, size_t __n,
54 size_t __s, const _Tp& __t)
58 template<typename _Tp>
60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i,
61 size_t __n, const _Tp& __t)
65 template<typename _Tp>
[all...]
H A Dvalarray_meta.h78 template<typename _Tp>
79 struct _UnFunClos<_ValArray,_Tp> : _UnFunBase<valarray<_Tp> > {
80 typedef _UnFunBase<valarray<_Tp> > _Base;
83 _UnFunClos (const valarray<_Tp>& __v, _Tp __f(_Tp))
153 typedef value_type _Tp; typedef in struct:_BinFunClos
156 _Tp __f(_Tp, _T
174 typedef typename _Dom::value_type _Tp; typedef in struct:_BinFunClos
186 typedef typename _Dom::value_type _Tp; typedef in struct:_BinFunClos
198 typedef typename _Dom::value_type _Tp; typedef in struct:_BinFunClos
202 _BinFunClos(const _Dom& __e, const _Tp& __t, _Tp __f (_Tp, _Tp)) argument
209 typedef typename _Dom::value_type _Tp; typedef in struct:_BinFunClos
213 _BinFunClos(const _Tp& __t, const _Dom& __e, _Tp __f (_Tp, _Tp)) argument
234 _BinFunClos(const _Tp& __t, const valarray<_Tp>& __v, _Tp __f (_Tp, _Tp)) argument
264 typedef value_type _Tp; typedef in struct:_ValFunClos
266 _ValFunClos(const _Dom& __e, _Tp __f (_Tp)) argument
284 typedef value_type _Tp; typedef in struct:_RefFunClos
286 _RefFunClos(const _Dom& __e, _Tp __f (const _Tp&)) argument
296 _RefFunClos(const valarray<_Tp>& __v, _Tp __f(const _Tp&)) argument
437 typedef typename _Dom::value_type _Tp; typedef in struct:_BinClos
448 typedef typename _Dom::value_type _Tp; typedef in struct:_BinClos
459 typedef typename _Dom::value_type _Tp; typedef in struct:_BinClos
469 typedef typename _Dom::value_type _Tp; typedef in struct:_BinClos
[all...]
/haiku/headers/cpp/
H A Dstl_relops.h36 template <class _Tp>
37 inline bool operator!=(const _Tp& __x, const _Tp& __y) {
41 template <class _Tp>
42 inline bool operator>(const _Tp& __x, const _Tp& __y) {
46 template <class _Tp>
47 inline bool operator<=(const _Tp& __x, const _Tp& __y) {
51 template <class _Tp>
[all...]
H A Dstl_tempbuf.h37 template <class _Tp>
38 pair<_Tp*, ptrdiff_t>
39 __get_temporary_buffer(ptrdiff_t __len, _Tp*)
41 if (__len > ptrdiff_t(INT_MAX / sizeof(_Tp)))
42 __len = INT_MAX / sizeof(_Tp);
45 _Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp));
47 return pair<_Tp*, ptrdiff_t>(__tmp, __len);
51 return pair<_Tp*, ptrdiff_
100 _M_initialize_buffer(const _Tp&, __true_type) argument
[all...]
H A Dstl_function.h49 template <class _Tp>
50 struct plus : public binary_function<_Tp,_Tp,_Tp> {
51 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; }
54 template <class _Tp>
55 struct minus : public binary_function<_Tp,_Tp,_T
565 mem_fun_t(void (_Tp::*__pf)()) argument
583 mem_fun_ref_t(void (_Tp::*__pf)()) argument
601 mem_fun1_t(void (_Tp::*__pf)(_Arg)) argument
621 mem_fun1_ref_t(void (_Tp::*__pf)(_Arg)) argument
[all...]
H A Dstl_stack.h37 template <class _Tp, class _Sequence = deque<_Tp> >
39 template <class _Tp, class _Sequence>
65 template <class _Tp, class _Seq>
66 bool operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
71 template <class _Tp, class _Seq>
72 bool operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
79 template <class _Tp, clas
[all...]
H A Dstl_raw_storage_iter.h36 template <class _ForwardIterator, class _Tp>
49 raw_storage_iterator& operator=(const _Tp& __element) {
53 raw_storage_iterator<_ForwardIterator, _Tp>& operator++() {
57 raw_storage_iterator<_ForwardIterator, _Tp> operator++(int) {
58 raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this;
66 template <class _ForwardIterator, class _Tp>
68 iterator_category(const raw_storage_iterator<_ForwardIterator, _Tp>&)
H A Dstl_numeric.h37 template <class _InputIterator, class _Tp>
38 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
45 template <class _InputIterator, class _Tp, class _BinaryOperation>
46 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp __init,
54 template <class _InputIterator1, class _InputIterator2, class _Tp>
55 _Tp inner_product(_InputIterator1 __first1, _InputIterator1 __last1,
56 _InputIterator2 __first2, _Tp __init)
63 template <class _InputIterator1, class _InputIterator2, class _Tp,
[all...]
H A Dmemory30 template <class _Tp> class auto_ptr {
32 _Tp* _M_ptr;
35 typedef _Tp element_type;
36 explicit auto_ptr(_Tp* __p = 0) __STL_NOTHROW : _M_ptr(__p) {}
57 _Tp& operator*() const __STL_NOTHROW {
60 _Tp* operator->() const __STL_NOTHROW {
63 _Tp* get() const __STL_NOTHROW {
66 _Tp* release() __STL_NOTHROW {
67 _Tp* __tmp = _M_ptr;
71 void reset(_Tp* __
[all...]
H A Dstl_list.h41 template <class _Tp>
46 _Tp _M_data;
49 template<class _Tp, class _Ref, class _Ptr>
51 typedef _List_iterator<_Tp,_Tp&,_Tp*> iterator;
52 typedef _List_iterator<_Tp,const _Tp&,const _Tp*> const_iterator;
53 typedef _List_iterator<_Tp,_Re
[all...]
H A Dstl_iterator.h47 template <class _Tp, class _Distance> struct input_iterator {
49 typedef _Tp value_type;
51 typedef _Tp* pointer;
52 typedef _Tp& reference;
63 template <class _Tp, class _Distance> struct forward_iterator {
65 typedef _Tp value_type;
67 typedef _Tp* pointer;
68 typedef _Tp& reference;
72 template <class _Tp, class _Distance> struct bidirectional_iterator {
74 typedef _Tp value_typ
201 iterator_category(const _Tp*) argument
221 value_type(const _Tp*) argument
250 distance_type(const _Tp*) argument
[all...]
H A Dstl_deque.h98 template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
100 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator;
101 typedef _Deque_iterator<_Tp,const _Tp&,const _Tp*,__bufsiz> const_iterator;
103 _S_buffer_size() { return __deque_buf_size(__bufsiz, sizeof(_Tp)); }
105 template <class _Tp, class _Ref, class _Ptr>
107 typedef _Deque_iterator<_Tp, _T
[all...]
H A Dstl_slist.h97 template <class _Tp>
100 _Tp _M_data;
122 template <class _Tp, class _Ref, class _Ptr>
125 typedef _Slist_iterator<_Tp, _Tp&, _Tp*> iterator;
126 typedef _Slist_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;
127 typedef _Slist_iterator<_Tp, _Re
[all...]
H A Dstl_algobase.h63 template <class _ForwardIter1, class _ForwardIter2, class _Tp>
64 inline void __iter_swap(_ForwardIter1 __a, _ForwardIter2 __b, _Tp*) {
65 _Tp __tmp = *__a;
75 template <class _Tp>
76 inline void swap(_Tp& __a, _Tp& __b) {
77 _Tp __tmp = __a;
90 template <class _Tp>
91 inline const _Tp& min(const _Tp
184 typedef typename iterator_traits<_InputIter>::value_type _Tp; typedef
[all...]
H A Dstl_construct.h41 template <class _Tp>
42 inline void destroy(_Tp* __pointer) {
43 __pointer->~_Tp();
67 template <class _ForwardIterator, class _Tp>
69 __destroy(_ForwardIterator __first, _ForwardIterator __last, _Tp*)
71 typedef typename __type_traits<_Tp>::has_trivial_destructor
H A Dstl_queue.h37 template <class _Tp, class _Sequence = deque<_Tp> >
39 template <class _Tp, class _Sequence>
67 template <class _Tp, class _Sequence>
69 operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
74 template <class _Tp, class _Sequence>
76 operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
83 template <class _Tp, clas
[all...]
H A Dstl_heap.h41 template <class _RandomAccessIterator, class _Distance, class _Tp>
44 _Distance __holeIndex, _Distance __topIndex, _Tp __value)
55 template <class _RandomAccessIterator, class _Distance, class _Tp>
58 _RandomAccessIterator __last, _Distance*, _Tp*)
61 _Tp(*(__last - 1)));
72 template <class _RandomAccessIterator, class _Distance, class _Tp,
76 _Distance __topIndex, _Tp __value, _Compare __comp)
88 class _Distance, class _Tp>
92 _Distance*, _Tp*)
95 _Tp(*(__las
[all...]
H A Dstl_vector.h52 template <class _Tp, class _Allocator, bool _IsStatic>
55 typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type
65 _Tp* _M_start;
66 _Tp* _M_finish;
67 _Tp* _M_end_of_storage;
69 _Tp* _M_allocate(size_t __n)
71 void _M_deallocate(_Tp* __p, size_t __n)
77 template <class _Tp, class _Allocator>
78 class _Vector_alloc_base<_Tp, _Allocator, true> {
80 typedef typename _Alloc_traits<_Tp, _Allocato
[all...]
H A Dstl_alloc.h227 template<class _Tp, class _Alloc>
231 static _Tp* allocate(size_t __n)
232 { return 0 == __n ? 0 : (_Tp*) _Alloc::allocate(__n * sizeof (_Tp)); }
233 static _Tp* allocate(void)
234 { return (_Tp*) _Alloc::allocate(sizeof (_Tp)); }
235 static void deallocate(_Tp* __p, size_t __n)
236 { if (0 != __n) _Alloc::deallocate(__p, __n * sizeof (_Tp)); }
237 static void deallocate(_Tp* __
[all...]
H A Dstl_map.h42 template <class _Key, class _Tp, class _Compare = less<_Key>,
43 class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
45 template <class _Key, class _Tp, class _Compare,
46 class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
54 typedef _Tp data_type;
55 typedef _Tp mapped_type;
56 typedef pair<const _Key, _Tp> value_type;
61 friend class map<_Key,_Tp,_Compare,_Alloc>;
125 map(const map<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {}
126 map<_Key,_Tp,_Compar
[all...]
H A Dstl_uninitialized.h65 template <class _InputIter, class _ForwardIter, class _Tp>
68 _ForwardIter __result, _Tp*)
70 typedef typename __type_traits<_Tp>::is_POD_type _Is_POD;
143 template <class _ForwardIter, class _Tp>
146 const _Tp& __x, __true_type)
151 template <class _ForwardIter, class _Tp>
154 const _Tp& __x, __false_type)
164 template <class _ForwardIter, class _Tp, class _Tp1>
166 _ForwardIter __last, const _Tp& __x, _Tp1*)
173 template <class _ForwardIter, class _Tp>
[all...]
H A Dstl_multimap.h42 template <class _Key, class _Tp, class _Compare = less<_Key>,
43 class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
45 template <class _Key, class _Tp, class _Compare,
46 class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
54 typedef _Tp data_type;
55 typedef _Tp mapped_type;
56 typedef pair<const _Key, _Tp> value_type;
60 friend class multimap<_Key,_Tp,_Compare,_Alloc>;
123 multimap(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) { }
124 multimap<_Key,_Tp,_Compar
[all...]

Completed in 144 milliseconds

12