| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| valarray_array.h | 99 // Turn a raw-memory into an array of _Tp filled with __t
108 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
111 new(__b++) _Tp(__t);
119 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
122 *__b++ = __t;
129 const _Tp __t)
131 _Array_init_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __t);
218 // Fill a plain array __a[<__n>] with __t
221 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
224 *__a++ = __t;
380 _Value_type __t = __a[__i]; local
396 _Value_type __t = __a[__i]; local
[all...] |
| boost_concept_check.h | 233 void __aux_require_boolean_expr(const _Tp& __t) {
234 bool __x _IsUnused = __t;
462 *__i++ = __t; // require postincrement and assignment
465 _ValueT __t;
725 __c _IsUnused(__n, __t),
728 __c.insert(__p, __t);
729 __c.insert(__p, __n, __t);
742 typename _Sequence::value_type __t;
754 __c.push_front(__t);
758 typename _FrontInsertionSequence::value_type __t;
[all...] |
| valarray_after.h | 354 const typename _Dom::value_type& __t) \
359 return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \
366 operator _Op(const typename _Dom::value_type& __t, \
372 return _Expr<_Closure, _Value>(_Closure(__t, __v())); \
499 const typename _Dom::value_type& __t) \
503 return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \
510 _Fun(const typename _Dom::value_type& __t, \
515 return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \
528 _Fun(const valarray<_Tp>& __v, const _Tp& __t) \
531 return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| valarray_array.h | 101 // Turn a raw-memory into an array of _Tp filled with __t
110 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
113 new(__b++) _Tp(__t);
121 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
124 *__b++ = __t;
130 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
132 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
216 // Fill a plain array __a[<__n>] with __t
219 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
222 *__a++ = __t;
377 _Value_type __t = __a[__i]; local
393 _Value_type __t = __a[__i]; local
[all...] |
| boost_concept_check.h | 236 void __aux_require_boolean_expr(const _Tp& __t) {
237 bool __x _IsUnused = __t;
465 *__i++ = __t; // require postincrement and assignment
468 _ValueT __t;
728 __c _IsUnused(__n, __t),
731 __c.insert(__p, __t);
732 __c.insert(__p, __n, __t);
745 typename _Sequence::value_type __t;
757 __c.push_front(__t);
761 typename _FrontInsertionSequence::value_type __t;
[all...] |
| valarray_after.h | 356 const typename _Dom::value_type& __t) \
361 return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \
368 operator _Op(const typename _Dom::value_type& __t, \
374 return _Expr<_Closure, _Value>(_Closure(__t, __v())); \
501 const typename _Dom::value_type& __t) \
505 return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \
512 _Fun(const typename _Dom::value_type& __t, \
517 return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \
530 _Fun(const valarray<_Tp>& __v, const _Tp& __t) \
533 return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| valarray_array.h | 101 // Turn a raw-memory into an array of _Tp filled with __t
110 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
113 new(__b++) _Tp(__t);
121 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
124 *__b++ = __t;
130 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
132 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
216 // Fill a plain array __a[<__n>] with __t
219 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
222 *__a++ = __t;
377 _Value_type __t = __a[__i]; local
393 _Value_type __t = __a[__i]; local
[all...] |
| boost_concept_check.h | 236 void __aux_require_boolean_expr(const _Tp& __t) {
237 bool __x _IsUnused = __t;
465 *__i++ = __t; // require postincrement and assignment
468 _ValueT __t;
728 __c _IsUnused(__n, __t),
731 __c.insert(__p, __t);
732 __c.insert(__p, __n, __t);
745 typename _Sequence::value_type __t;
757 __c.push_front(__t);
761 typename _FrontInsertionSequence::value_type __t;
[all...] |
| valarray_after.h | 356 const typename _Dom::value_type& __t) \
361 return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \
368 operator _Op(const typename _Dom::value_type& __t, \
374 return _Expr<_Closure, _Value>(_Closure(__t, __v())); \
501 const typename _Dom::value_type& __t) \
505 return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \
512 _Fun(const typename _Dom::value_type& __t, \
517 return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \
530 _Fun(const valarray<_Tp>& __v, const _Tp& __t) \
533 return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| valarray_array.h | 99 // Turn a raw-memory into an array of _Tp filled with __t
108 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
111 new(__b++) _Tp(__t);
119 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
122 *__b++ = __t;
129 const _Tp __t)
131 _Array_init_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __t);
218 // Fill a plain array __a[<__n>] with __t
221 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
224 *__a++ = __t;
380 _Value_type __t = __a[__i]; local
396 _Value_type __t = __a[__i]; local
[all...] |
| boost_concept_check.h | 233 void __aux_require_boolean_expr(const _Tp& __t) {
234 bool __x _IsUnused = __t;
462 *__i++ = __t; // require postincrement and assignment
465 _ValueT __t;
725 __c _IsUnused(__n, __t),
728 __c.insert(__p, __t);
729 __c.insert(__p, __n, __t);
742 typename _Sequence::value_type __t;
754 __c.push_front(__t);
758 typename _FrontInsertionSequence::value_type __t;
[all...] |
| valarray_after.h | 354 const typename _Dom::value_type& __t) \
359 return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \
366 operator _Op(const typename _Dom::value_type& __t, \
372 return _Expr<_Closure, _Value>(_Closure(__t, __v())); \
499 const typename _Dom::value_type& __t) \
503 return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \
510 _Fun(const typename _Dom::value_type& __t, \
515 return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \
528 _Fun(const valarray<_Tp>& __v, const _Tp& __t) \
531 return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| valarray_array.h | 99 // Turn a raw-memory into an array of _Tp filled with __t
108 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
111 new(__b++) _Tp(__t);
119 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
122 *__b++ = __t;
129 const _Tp __t)
131 _Array_init_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __t);
218 // Fill a plain array __a[<__n>] with __t
221 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
224 *__a++ = __t;
380 _Value_type __t = __a[__i]; local
396 _Value_type __t = __a[__i]; local
[all...] |
| boost_concept_check.h | 233 void __aux_require_boolean_expr(const _Tp& __t) {
234 bool __x _IsUnused = __t;
462 *__i++ = __t; // require postincrement and assignment
465 _ValueT __t;
725 __c _IsUnused(__n, __t),
728 __c.insert(__p, __t);
729 __c.insert(__p, __n, __t);
742 typename _Sequence::value_type __t;
754 __c.push_front(__t);
758 typename _FrontInsertionSequence::value_type __t;
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| valarray_array.h | 99 // Turn a raw-memory into an array of _Tp filled with __t
108 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
111 new(__b++) _Tp(__t);
119 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
122 *__b++ = __t;
129 const _Tp __t)
131 _Array_init_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __t);
218 // Fill a plain array __a[<__n>] with __t
221 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
224 *__a++ = __t;
380 _Value_type __t = __a[__i]; local
396 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| valarray_array.h | 99 // Turn a raw-memory into an array of _Tp filled with __t
108 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
111 new(__b++) _Tp(__t);
119 _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t)
122 *__b++ = __t;
129 const _Tp __t)
131 _Array_init_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __t);
218 // Fill a plain array __a[<__n>] with __t
221 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
224 *__a++ = __t;
380 _Value_type __t = __a[__i]; local
396 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| valarray_array.h | 101 // Turn a raw-memory into an array of _Tp filled with __t
110 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
113 new(__b++) _Tp(__t);
121 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
124 *__b++ = __t;
130 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
132 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
216 // Fill a plain array __a[<__n>] with __t
219 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
222 *__a++ = __t;
377 _Value_type __t = __a[__i]; local
393 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| valarray_array.h | 101 // Turn a raw-memory into an array of _Tp filled with __t
110 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
113 new(__b++) _Tp(__t);
121 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
124 *__b++ = __t;
130 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
132 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
216 // Fill a plain array __a[<__n>] with __t
219 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
222 *__a++ = __t;
377 _Value_type __t = __a[__i]; local
393 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| valarray_array.h | 101 // Turn a raw-memory into an array of _Tp filled with __t
110 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
113 new(__b++) _Tp(__t);
121 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
124 *__b++ = __t;
130 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
132 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
216 // Fill a plain array __a[<__n>] with __t
219 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
222 *__a++ = __t;
377 _Value_type __t = __a[__i]; local
393 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| valarray_array.h | 101 // Turn a raw-memory into an array of _Tp filled with __t
110 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
113 new(__b++) _Tp(__t);
121 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
124 *__b++ = __t;
130 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
132 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
216 // Fill a plain array __a[<__n>] with __t
219 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
222 *__a++ = __t;
377 _Value_type __t = __a[__i]; local
393 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| valarray_array.h | 99 // Turn a raw-memory into an array of _Tp filled with __t
108 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
111 new(__b++) _Tp(__t);
119 _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
122 *__b++ = __t;
128 __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
130 _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
214 // Fill a plain array __a[<__n>] with __t
217 __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
220 *__a++ = __t;
375 _Value_type __t = __a[__i]; local
391 _Value_type __t = __a[__i]; local
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| tree.h | 675 ({ __typeof (T) const __t = (T); \
676 if (TREE_CODE (__t) != (CODE)) \
677 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
679 __t; })
682 ({ __typeof (T) const __t = (T); \
683 if (TREE_CODE (__t) == (CODE)) \
684 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 __t; })
689 ({ __typeof (T) const __t = (T); \
690 if (TREE_CODE (__t) != (CODE1)
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree.h | 675 ({ __typeof (T) const __t = (T); \
676 if (TREE_CODE (__t) != (CODE)) \
677 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
679 __t; })
682 ({ __typeof (T) const __t = (T); \
683 if (TREE_CODE (__t) == (CODE)) \
684 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 __t; })
689 ({ __typeof (T) const __t = (T); \
690 if (TREE_CODE (__t) != (CODE1)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| tree.h | 675 ({ __typeof (T) const __t = (T); \
676 if (TREE_CODE (__t) != (CODE)) \
677 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
679 __t; })
682 ({ __typeof (T) const __t = (T); \
683 if (TREE_CODE (__t) == (CODE)) \
684 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 __t; })
689 ({ __typeof (T) const __t = (T); \
690 if (TREE_CODE (__t) != (CODE1)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree.h | 675 ({ __typeof (T) const __t = (T); \
676 if (TREE_CODE (__t) != (CODE)) \
677 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
679 __t; })
682 ({ __typeof (T) const __t = (T); \
683 if (TREE_CODE (__t) == (CODE)) \
684 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 __t; })
689 ({ __typeof (T) const __t = (T); \
690 if (TREE_CODE (__t) != (CODE1)
[all...] |
