| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| algorithmfwd.h | 198 template<typename _FIter, typename _Tp>
200 binary_search(_FIter, _FIter, const _Tp&);
202 template<typename _FIter, typename _Tp, typename _Compare>
204 binary_search(_FIter, _FIter, const _Tp&, _Compare);
227 template<typename _FIter, typename _Tp>
229 equal_range(_FIter, _FIter, const _Tp&);
231 template<typename _FIter, typename _Tp, typename _Compare>
233 equal_range(_FIter, _FIter, const _Tp&, _Compare);
235 template<typename _FIter, typename _Tp>
237 fill(_FIter, _FIter, const _Tp&)
[all...] |
| move.h | 43 template<typename _Tp>
46 typedef _Tp type;
49 template<typename _Tp>
50 inline _Tp&&
51 forward(typename std::identity<_Tp>::type&& __t)
54 template<typename _Tp>
55 inline typename std::remove_reference<_Tp>::type&&
56 move(_Tp&& __t)
61 #define _GLIBCXX_MOVE(_Tp) std::move(_Tp)
[all...] |
| valarray_before.h | 64 template<typename _Tp>
65 _Tp operator()(const _Tp& __t) const
71 template<typename _Tp>
72 _Tp operator()(const _Tp& __t) const
78 template<typename _Tp>
79 _Tp operator()(const _Tp& __t) const
85 template<typename _Tp>
[all...] |
| /external/stlport/stlport/stl/ |
| _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,
77 _Distance __topIndex, _Tp __val, _Compare __comp)
90 class _Distance, class _Tp>
94 _Distance*, _Tp*)
97 _Tp(*(__last - 1)), __comp)
[all...] |
| _numeric.c | 37 template <class _InputIterator, class _OutputIterator, class _Tp,
41 _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) {
46 _Tp __val = *__first;
54 template <class _InputIterator, class _OutputIterator, class _Tp,
58 _OutputIterator __result, _Tp*,
63 _Tp __val = *__first;
65 _Tp __tmp = *__first;
73 template <class _Tp, class _Integer, class _MonoidOperation>
74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr)
[all...] |
| _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 __ai = __z2_i >= 0 ? __z2_i : -__z2_i
[all...] |
| _slist.c | 42 template <class _Tp, class _Alloc>
44 _Slist_base<_Tp,_Alloc>::_M_erase_after(_Slist_node_base* __before_first,
69 template <class _Tp, class _Alloc>
70 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x) {
90 template <class _Tp, class _Alloc>
91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
105 template <class _Tp, class _Alloc
[all...] |
| _list.c | 65 template <class _Tp, class _Alloc>
66 void _List_base<_Tp,_Alloc>::clear() {
94 template <class _Tp, class _Alloc>
95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
106 template <class _Tp, class _Alloc>
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
123 template <class _Tp, class _Alloc
[all...] |
| _vector.c | 39 template <class _Tp, class _Alloc>
40 void _Vector_base<_Tp,_Alloc>::_M_throw_length_error() const
43 template <class _Tp, class _Alloc>
44 void _Vector_base<_Tp, _Alloc>::_M_throw_out_of_range() const
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) {
80 template <class _Tp, class _Alloc>
81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*DO NOT USE!! (…)
[all...] |
| _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)
[all...] |
| _deque.c | 39 template <class _Tp, class _Alloc >
40 _Deque_base<_Tp,_Alloc >::~_Deque_base() {
47 template <class _Tp, class _Alloc >
48 void _Deque_base<_Tp,_Alloc>::_M_initialize_map(size_t __num_elements) {
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 >
69 void _Deque_base<_Tp,_Alloc>::_M_create_nodes(_Tp** __nstart,
70 _Tp** __nfinish)
[all...] |
| _string.c | 110 template <class _InputIter, class _CharT, class _Tp, class _Traits>
113 _Tp* __pt, _Traits* __traits) {
114 typedef typename _IsIntegral<_Tp>::_Ret _IsIntegral;
598 template <class _Tp, class _Alloc>
599 void _String_base<_Tp,_Alloc>::_M_throw_length_error() const
602 template <class _Tp, class _Alloc>
603 void _String_base<_Tp, _Alloc>::_M_throw_out_of_range() const
606 template <class _Tp, class _Alloc>
607 void _String_base<_Tp, _Alloc>::_M_allocate_block(size_t __n) {
|
| _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>
82 const _Tp&
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _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,
77 _Distance __topIndex, _Tp __val, _Compare __comp)
90 class _Distance, class _Tp>
94 _Distance*, _Tp*)
97 _Tp(*(__last - 1)), __comp)
[all...] |
| _numeric.c | 37 template <class _InputIterator, class _OutputIterator, class _Tp,
41 _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) {
46 _Tp __val = *__first;
54 template <class _InputIterator, class _OutputIterator, class _Tp,
58 _OutputIterator __result, _Tp*,
63 _Tp __val = *__first;
65 _Tp __tmp = *__first;
73 template <class _Tp, class _Integer, class _MonoidOperation>
74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr)
[all...] |
| _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 __ai = __z2_i >= 0 ? __z2_i : -__z2_i
[all...] |
| _slist.c | 42 template <class _Tp, class _Alloc>
44 _Slist_base<_Tp,_Alloc>::_M_erase_after(_Slist_node_base* __before_first,
69 template <class _Tp, class _Alloc>
70 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x) {
90 template <class _Tp, class _Alloc>
91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
105 template <class _Tp, class _Alloc
[all...] |
| _list.c | 65 template <class _Tp, class _Alloc>
66 void _List_base<_Tp,_Alloc>::clear() {
94 template <class _Tp, class _Alloc>
95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
106 template <class _Tp, class _Alloc>
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
123 template <class _Tp, class _Alloc
[all...] |
| _vector.c | 39 template <class _Tp, class _Alloc>
40 void _Vector_base<_Tp,_Alloc>::_M_throw_length_error() const
43 template <class _Tp, class _Alloc>
44 void _Vector_base<_Tp, _Alloc>::_M_throw_out_of_range() const
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) {
80 template <class _Tp, class _Alloc>
81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*DO NOT USE!! (…)
[all...] |
| _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)
[all...] |
| _deque.c | 39 template <class _Tp, class _Alloc >
40 _Deque_base<_Tp,_Alloc >::~_Deque_base() {
47 template <class _Tp, class _Alloc >
48 void _Deque_base<_Tp,_Alloc>::_M_initialize_map(size_t __num_elements) {
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 >
69 void _Deque_base<_Tp,_Alloc>::_M_create_nodes(_Tp** __nstart,
70 _Tp** __nfinish)
[all...] |
| _string.c | 110 template <class _InputIter, class _CharT, class _Tp, class _Traits>
113 _Tp* __pt, _Traits* __traits) {
114 typedef typename _IsIntegral<_Tp>::_Ret _IsIntegral;
598 template <class _Tp, class _Alloc>
599 void _String_base<_Tp,_Alloc>::_M_throw_length_error() const
602 template <class _Tp, class _Alloc>
603 void _String_base<_Tp, _Alloc>::_M_throw_out_of_range() const
606 template <class _Tp, class _Alloc>
607 void _String_base<_Tp, _Alloc>::_M_allocate_block(size_t __n) {
|
| _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>
82 const _Tp&
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/ |
| shared_ptr.h | 92 template<typename _Tp>
96 typedef _Tp* argument_type;
97 void operator()(_Tp* __p) const { delete __p; }
113 typedef typename std::tr1::remove_pointer<_Ptr>::type _Tp;
114 _M_pi = new _Sp_counted_base_impl<_Ptr, _Sp_deleter<_Tp>, _Lp>(
115 __p, _Sp_deleter<_Tp>());
138 // Special case for auto_ptr<_Tp> to provide the strong guarantee.
139 template<typename _Tp>
141 __shared_count(std::auto_ptr<_Tp>& __r)
142 : _M_pi(new _Sp_counted_base_impl<_Tp*,
[all...] |
