HomeSort by: relevance | last modified time | path
    Searched defs:__first (Results 1 - 25 of 48) sorted by relevancy

1 2

  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
parallel_impl.h 29 __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first)
32 const _DifferenceType __n = __last - __first;
36 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) {
40 if (__comp(__i - __first, __extremum))
46 const _DifferenceType __k = __res - __first;
55 return __extremum != __initial_dist ? __first + __extremum : __last;
64 __parallel_or(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f)
67 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
parallel_impl.h 29 __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first)
32 const _DifferenceType __n = __last - __first;
36 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) {
40 if (__comp(__i - __first, __extremum))
46 const _DifferenceType __k = __res - __first;
55 return __extremum != __initial_dist ? __first + __extremum : __last;
64 __parallel_or(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f)
67 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
glue_algorithm_impl.h 27 any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
30 std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
39 all_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred)
41 return !std::any_of(std::forward<_ExecutionPolicy>(__exec), __first, __last, std::not_fn(__pred));
48 none_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
50 return !std::any_of(std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred);
57 for_each(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Function __f)
60 std::forward<_ExecutionPolicy>(__exec), __first, __last, __f, local
67 for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f)
70 std::forward<_ExecutionPolicy>(__exec), __first, __n, __f
    [all...]
glue_algorithm_impl.h 27 any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
30 std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
39 all_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred)
41 return !std::any_of(std::forward<_ExecutionPolicy>(__exec), __first, __last, std::not_fn(__pred));
48 none_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
50 return !std::any_of(std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred);
57 for_each(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Function __f)
60 std::forward<_ExecutionPolicy>(__exec), __first, __last, __f, local
67 for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f)
70 std::forward<_ExecutionPolicy>(__exec), __first, __n, __f
    [all...]
unseq_backend_simd.h 29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >= __block_size << 1
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
    [all...]
unseq_backend_simd.h 29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >= __block_size << 1
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/
simd_fixed_size.h 87 // Precondition: _Np must match the number of elements in __first (recursively)
387 auto&& __first = __gen(__tuple_element_meta<_Tp, _Abi0, _Offset>()); local
389 return {__first};
391 return {__first,
401 auto&& __first local
404 return {__first};
407 __first,
502 auto&& __first = [&](auto... __args) constexpr _GLIBCXX_SIMD_ALWAYS_INLINE_LAMBDA {
518 return {__first};
520 return {__first,
    [all...]
simd_fixed_size.h 87 // Precondition: _Np must match the number of elements in __first (recursively)
387 auto&& __first = __gen(__tuple_element_meta<_Tp, _Abi0, _Offset>()); local
389 return {__first};
391 return {__first,
401 auto&& __first local
404 return {__first};
407 __first,
502 auto&& __first = [&](auto... __args) constexpr _GLIBCXX_SIMD_ALWAYS_INLINE_LAMBDA {
518 return {__first};
520 return {__first,
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
unseq_backend_simd.h 29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >= __block_size << 1
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
    [all...]
unseq_backend_simd.h 29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >= __block_size << 1
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/experimental/bits/
simd_fixed_size.h 87 // Precondition: _Np must match the number of elements in __first (recursively)
387 auto&& __first = __gen(__tuple_element_meta<_Tp, _Abi0, _Offset>()); local
389 return {__first};
391 return {__first,
401 auto&& __first local
404 return {__first};
407 __first,
502 auto&& __first = [&](auto... __args) constexpr _GLIBCXX_SIMD_ALWAYS_INLINE_LAMBDA {
518 return {__first};
520 return {__first,
    [all...]
simd_fixed_size.h 87 // Precondition: _Np must match the number of elements in __first (recursively)
387 auto&& __first = __gen(__tuple_element_meta<_Tp, _Abi0, _Offset>()); local
389 return {__first};
391 return {__first,
401 auto&& __first local
404 return {__first};
407 __first,
502 auto&& __first = [&](auto... __args) constexpr _GLIBCXX_SIMD_ALWAYS_INLINE_LAMBDA {
518 return {__first};
520 return {__first,
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/
mt_allocator.cc 314 _Block_record* __first = __bin._M_first[__thread_id]; local
315 _Block_record* __tmp = __first;
325 __bin._M_first[0] = __first;
mt_allocator.cc 314 _Block_record* __first = __bin._M_first[__thread_id]; local
315 _Block_record* __tmp = __first;
325 __bin._M_first[0] = __first;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/
mt_allocator.cc 314 _Block_record* __first = __bin._M_first[__thread_id]; local
315 _Block_record* __tmp = __first;
325 __bin._M_first[0] = __first;
mt_allocator.cc 314 _Block_record* __first = __bin._M_first[__thread_id]; local
315 _Block_record* __tmp = __first;
325 __bin._M_first[0] = __first;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
fs_path.h 260 __string_from_range(_InputIterator __first, _InputIterator __last)
269 if (auto __len = __last - __first) [[__likely__]]
270 return basic_string_view<_EcharT>(&*__first, __len);
276 return basic_string<__unified_u8_t<_EcharT>>(__first, __last);
336 path(_InputIterator __first, _InputIterator __last, format = auto_format)
337 : _M_pathname(_S_convert(__detail::__string_from_range(__first, __last)))
350 path(_InputIterator __first, _InputIterator __last, const locale& __loc,
352 : _M_pathname(_S_convert_loc(__first, __last, __loc))
376 assign(_InputIterator __first, _InputIterator __last)
377 { return *this = path(__first, __last);
1138 const char* __first = __u8str.data(); local
1188 const value_type* __first = _M_pathname.data(); local
    [all...]
locale_conv.h 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
66 auto __next = __first;
84 __count = __next - __first;
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
100 __count = __next - __first;
107 __str_codecvt_in(const char* __first, const char* __last,
118 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state,
125 __str_codecvt_in(const char* __first, const char* __last
579 _Elem* const __first = this->pbase(); local
    [all...]
fs_path.h 260 __string_from_range(_InputIterator __first, _InputIterator __last)
269 if (auto __len = __last - __first) [[__likely__]]
270 return basic_string_view<_EcharT>(&*__first, __len);
276 return basic_string<__unified_u8_t<_EcharT>>(__first, __last);
336 path(_InputIterator __first, _InputIterator __last, format = auto_format)
337 : _M_pathname(_S_convert(__detail::__string_from_range(__first, __last)))
350 path(_InputIterator __first, _InputIterator __last, const locale& __loc,
352 : _M_pathname(_S_convert_loc(__first, __last, __loc))
376 assign(_InputIterator __first, _InputIterator __last)
377 { return *this = path(__first, __last);
1138 const char* __first = __u8str.data(); local
1188 const value_type* __first = _M_pathname.data(); local
    [all...]
locale_conv.h 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
66 auto __next = __first;
84 __count = __next - __first;
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
100 __count = __next - __first;
107 __str_codecvt_in(const char* __first, const char* __last,
118 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state,
125 __str_codecvt_in(const char* __first, const char* __last
579 _Elem* const __first = this->pbase(); local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
fs_path.h 260 __string_from_range(_InputIterator __first, _InputIterator __last)
269 if (auto __len = __last - __first) [[__likely__]]
270 return basic_string_view<_EcharT>(&*__first, __len);
276 return basic_string<__unified_u8_t<_EcharT>>(__first, __last);
336 path(_InputIterator __first, _InputIterator __last, format = auto_format)
337 : _M_pathname(_S_convert(__detail::__string_from_range(__first, __last)))
350 path(_InputIterator __first, _InputIterator __last, const locale& __loc,
352 : _M_pathname(_S_convert_loc(__first, __last, __loc))
376 assign(_InputIterator __first, _InputIterator __last)
377 { return *this = path(__first, __last);
1143 const char* __first = __u8str.data(); local
1193 const value_type* __first = _M_pathname.data(); local
    [all...]
locale_conv.h 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
66 auto __next = __first;
84 __count = __next - __first;
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
100 __count = __next - __first;
107 __str_codecvt_in(const char* __first, const char* __last,
118 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state,
125 __str_codecvt_in(const char* __first, const char* __last
579 _Elem* const __first = this->pbase(); local
    [all...]
fs_path.h 260 __string_from_range(_InputIterator __first, _InputIterator __last)
269 if (auto __len = __last - __first) [[__likely__]]
270 return basic_string_view<_EcharT>(&*__first, __len);
276 return basic_string<__unified_u8_t<_EcharT>>(__first, __last);
336 path(_InputIterator __first, _InputIterator __last, format = auto_format)
337 : _M_pathname(_S_convert(__detail::__string_from_range(__first, __last)))
350 path(_InputIterator __first, _InputIterator __last, const locale& __loc,
352 : _M_pathname(_S_convert_loc(__first, __last, __loc))
376 assign(_InputIterator __first, _InputIterator __last)
377 { return *this = path(__first, __last);
1143 const char* __first = __u8str.data(); local
1193 const value_type* __first = _M_pathname.data(); local
    [all...]
locale_conv.h 54 __do_str_codecvt(const _InChar* __first, const _InChar* __last,
58 if (__first == __last)
66 auto __next = __first;
84 __count = __next - __first;
94 __outstr.assign(__first, __last);
95 __count = __last - __first;
100 __count = __next - __first;
107 __str_codecvt_in(const char* __first, const char* __last,
118 return __do_str_codecvt(__first, __last, __outstr, __cvt, __state,
125 __str_codecvt_in(const char* __first, const char* __last
579 _Elem* const __first = this->pbase(); local
    [all...]
  /src/external/apache2/llvm/dist/libcxx/include/__memory/
shared_ptr.h 343 typename _CompressedPair::_Base1* __first = _CompressedPair::__get_first_base(__as_pair); variable
344 _Alloc *__alloc = reinterpret_cast<_Alloc*>(__first);

Completed in 159 milliseconds

1 2