| /haiku/headers/cpp/std/ |
| H A D | valarray_array.h | 68 _Tp* __restrict__ __b) in __valarray_copy() argument
69 { memcpy (__b, __a, __n * sizeof(_Tp)); } in __valarray_copy()
75 _Tp* __restrict__ __b) in __valarray_copy() argument
76 { for (size_t __i=0; __i<__n; ++__i, ++__b, __a += __s) *__b = *__a; } in __valarray_copy()
81 __valarray_copy (const _Tp* __restrict__ __a, _Tp* __restrict__ __b, in __valarray_copy() argument
83 { for (size_t __i=0; __i<__n; ++__i, ++__a, __b+=__s) *__b = *__a; } in __valarray_copy()
90 _Tp* __restrict__ __b, size_t __n) in __valarray_copy() argument
91 { for (size_t __j=0; __j<__n; ++__j, ++__b, ++__i) *__b = __a[*__i]; } in __valarray_copy()
97 _Tp* __restrict__ __b, const size_t* __restrict__ __i) in __valarray_copy() argument
98 { for (size_t __j=0; __j<__n; ++__j, ++__a, ++__i) __b[*__i] = *__a; } in __valarray_copy()
[all …]
|
| H A D | valarray_array.tcc | 54 __valarray_copy (_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b, size_t __n) in __valarray_copy() argument
58 for (_Tp* __q=__b._M_data; __q<__b._M_data+__n; ++__q, ++__ok, ++__p) { in __valarray_copy()
69 __valarray_copy (_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<bool> __m) in __valarray_copy() argument
71 _Tp* __q (__b._M_data); in __valarray_copy()
|
| /haiku/headers/cpp/ |
| H A D | stl_algobase.h | 64 inline void __iter_swap(_ForwardIter1 __a, _ForwardIter2 __b, _Tp*) { in __iter_swap() argument
66 *__a = *__b; in __iter_swap()
67 *__b = __tmp; in __iter_swap()
71 inline void iter_swap(_ForwardIter1 __a, _ForwardIter2 __b) { in iter_swap() argument
72 __iter_swap(__a, __b, __VALUE_TYPE(__a)); in iter_swap()
76 inline void swap(_Tp& __a, _Tp& __b) { in swap() argument
78 __a = __b; in swap()
79 __b = __tmp; in swap()
91 inline const _Tp& min(const _Tp& __a, const _Tp& __b) { in min() argument
92 return __b < __a ? __b : __a; in min()
[all …]
|
| H A D | stl_pair.h | 44 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {} in pair()
|
| H A D | stl_rope.h | 387 _Rope_RopeRep(_Tag __t, int __d, bool __b, size_t __size, in _Rope_RopeRep()
390 _M_tag(__t), _M_depth(__d), _M_is_balanced(__b), _M_c_string(0) in _Rope_RopeRep()
695 _Rope_RopeSubstring(_Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s, in _Rope_RopeSubstring()
697 : _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a), _M_base(__b) in _Rope_RopeSubstring()
701 __stl_assert(__s + __l <= __b->_M_size); in _Rope_RopeSubstring()
790 _Rope_char_ref_proxy <_CharT, __Alloc > __b) { in swap()
792 __a = __b; in swap()
793 __b = __tmp; in swap()
804 _Rope_char_ref_proxy <_CharT, __Alloc > __b) { \
806 __a = __b; \
[all …]
|
| H A D | stl_algo.h | 45 inline const _Tp& __median(const _Tp& __a, const _Tp& __b, const _Tp& __c) { in __median() argument
46 if (__a < __b) in __median()
47 if (__b < __c) in __median()
48 return __b; in __median()
55 else if (__b < __c) in __median()
58 return __b; in __median()
63 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) { in __median() argument
64 if (__comp(__a, __b)) in __median()
65 if (__comp(__b, __c)) in __median()
66 return __b; in __median()
[all …]
|
| H A D | bitset | 583 reference( bitset& __b, size_t __pos ) {
584 _M_wp = &__b._M_getword(__pos);
|