HomeSort by relevance Sort by last modified time
    Searched refs:__d (Results 76 - 100 of 315) sorted by null

1 2 34 5 6 7 8 91011>>

  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
random_shuffle.h 130 _DRSSorterPU<_RAIter, _RandomNumberGenerator>* __d = &__pus[__iam]; local
131 _DRandomShufflingGlobalData<_RAIter>* __sd = __d->_M_sd;
139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads];
146 _RandomNumber __rng(__d->_M_seed);
165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now
170 + __d->_M_num_threads + 1,
177 for (_BinIndex __s = 0; __s < __d->_M_bins_begin; ++__s)
178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads];
182 for (_BinIndex __s = __d->_M_bins_begin; __s < __d->__bins_end; ++__s
    [all...]
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
random_shuffle.h 130 _DRSSorterPU<_RAIter, _RandomNumberGenerator>* __d = &__pus[__iam]; local
131 _DRandomShufflingGlobalData<_RAIter>* __sd = __d->_M_sd;
139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads];
146 _RandomNumber __rng(__d->_M_seed);
165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now
170 + __d->_M_num_threads + 1,
177 for (_BinIndex __s = 0; __s < __d->_M_bins_begin; ++__s)
178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads];
182 for (_BinIndex __s = __d->_M_bins_begin; __s < __d->__bins_end; ++__s
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
random_shuffle.h 130 _DRSSorterPU<_RAIter, _RandomNumberGenerator>* __d = &__pus[__iam]; local
131 _DRandomShufflingGlobalData<_RAIter>* __sd = __d->_M_sd;
139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads];
146 _RandomNumber __rng(__d->_M_seed);
165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now
170 + __d->_M_num_threads + 1,
177 for (_BinIndex __s = 0; __s < __d->_M_bins_begin; ++__s)
178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads];
182 for (_BinIndex __s = __d->_M_bins_begin; __s < __d->__bins_end; ++__s
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
random_shuffle.h 130 _DRSSorterPU<_RAIter, _RandomNumberGenerator>* __d = &__pus[__iam]; local
131 _DRandomShufflingGlobalData<_RAIter>* __sd = __d->_M_sd;
139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads];
146 _RandomNumber __rng(__d->_M_seed);
165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now
170 + __d->_M_num_threads + 1,
177 for (_BinIndex __s = 0; __s < __d->_M_bins_begin; ++__s)
178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads];
182 for (_BinIndex __s = __d->_M_bins_begin; __s < __d->__bins_end; ++__s
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
atomic_base.h 681 _M_type_size(ptrdiff_t __d) const { return __d * sizeof(_PTp); }
684 _M_type_size(ptrdiff_t __d) const volatile { return __d * sizeof(_PTp); }
753 operator+=(ptrdiff_t __d) noexcept
754 { return __atomic_add_fetch(&_M_p, _M_type_size(__d),
758 operator+=(ptrdiff_t __d) volatile noexcept
759 { return __atomic_add_fetch(&_M_p, _M_type_size(__d),
763 operator-=(ptrdiff_t __d) noexcept
764 { return __atomic_sub_fetch(&_M_p, _M_type_size(__d),
    [all...]
slice_array.h 69 * @param __d Number of elements in slice.
72 slice(size_t __o, size_t __d, size_t __s);
94 slice::slice(size_t __o, size_t __d, size_t __s)
95 : _M_off(__o), _M_sz(__d), _M_st(__s) {}
shared_ptr.h 117 * and the deleter @a __d.
119 * @param __d A deleter.
121 * @throw std::bad_alloc, in which case @a __d(__p) is called.
126 * __shared_ptr will release __p by calling __d(__p)
129 shared_ptr(_Tp1* __p, _Deleter __d)
130 : __shared_ptr<_Tp>(__p, __d) { }
134 * and the deleter @a __d.
136 * @param __d A deleter.
138 * @throw std::bad_alloc, in which case @a __d(__p) is called.
143 * The last owner will call __d(__p
    [all...]
stl_iterator_base_funcs.h 176 typename iterator_traits<_InputIterator>::difference_type __d = __n; local
177 std::__advance(__i, __d, std::__iterator_category(__i));
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
atomic_base.h 681 _M_type_size(ptrdiff_t __d) const { return __d * sizeof(_PTp); }
684 _M_type_size(ptrdiff_t __d) const volatile { return __d * sizeof(_PTp); }
753 operator+=(ptrdiff_t __d) noexcept
754 { return __atomic_add_fetch(&_M_p, _M_type_size(__d),
758 operator+=(ptrdiff_t __d) volatile noexcept
759 { return __atomic_add_fetch(&_M_p, _M_type_size(__d),
763 operator-=(ptrdiff_t __d) noexcept
764 { return __atomic_sub_fetch(&_M_p, _M_type_size(__d),
    [all...]
slice_array.h 69 * @param __d Number of elements in slice.
72 slice(size_t __o, size_t __d, size_t __s);
94 slice::slice(size_t __o, size_t __d, size_t __s)
95 : _M_off(__o), _M_sz(__d), _M_st(__s) {}
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
slice_array.h 69 * @param __d Number of elements in slice.
72 slice(size_t __o, size_t __d, size_t __s);
94 slice::slice(size_t __o, size_t __d, size_t __s)
95 : _M_off(__o), _M_sz(__d), _M_st(__s) {}
shared_ptr.h 117 * and the deleter @a __d.
119 * @param __d A deleter.
121 * @throw std::bad_alloc, in which case @a __d(__p) is called.
126 * __shared_ptr will release __p by calling __d(__p)
129 shared_ptr(_Tp1* __p, _Deleter __d)
130 : __shared_ptr<_Tp>(__p, __d) { }
134 * and the deleter @a __d.
136 * @param __d A deleter.
138 * @throw std::bad_alloc, in which case @a __d(__p) is called.
143 * The last owner will call __d(__p
    [all...]
stl_iterator_base_funcs.h 176 typename iterator_traits<_InputIterator>::difference_type __d = __n; local
177 std::__advance(__i, __d, std::__iterator_category(__i));
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
slice_array.h 69 * @param __d Number of elements in slice.
72 slice(size_t __o, size_t __d, size_t __s);
94 slice::slice(size_t __o, size_t __d, size_t __s)
95 : _M_off(__o), _M_sz(__d), _M_st(__s) {}
shared_ptr.h 117 * and the deleter @a __d.
119 * @param __d A deleter.
121 * @throw std::bad_alloc, in which case @a __d(__p) is called.
126 * __shared_ptr will release __p by calling __d(__p)
129 shared_ptr(_Tp1* __p, _Deleter __d)
130 : __shared_ptr<_Tp>(__p, __d) { }
134 * and the deleter @a __d.
136 * @param __d A deleter.
138 * @throw std::bad_alloc, in which case @a __d(__p) is called.
143 * The last owner will call __d(__p
    [all...]
stl_iterator_base_funcs.h 176 typename iterator_traits<_InputIterator>::difference_type __d = __n; local
177 std::__advance(__i, __d, std::__iterator_category(__i));
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
slice_array.h 69 * @param __d Number of elements in slice.
72 slice(size_t __o, size_t __d, size_t __s);
94 slice::slice(size_t __o, size_t __d, size_t __s)
95 : _M_off(__o), _M_sz(__d), _M_st(__s) {}
shared_ptr.h 117 * and the deleter @a __d.
119 * @param __d A deleter.
121 * @throw std::bad_alloc, in which case @a __d(__p) is called.
126 * __shared_ptr will release __p by calling __d(__p)
129 shared_ptr(_Tp1* __p, _Deleter __d)
130 : __shared_ptr<_Tp>(__p, __d) { }
134 * and the deleter @a __d.
136 * @param __d A deleter.
138 * @throw std::bad_alloc, in which case @a __d(__p) is called.
143 * The last owner will call __d(__p
    [all...]
stl_iterator_base_funcs.h 176 typename iterator_traits<_InputIterator>::difference_type __d = __n; local
177 std::__advance(__i, __d, std::__iterator_category(__i));
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
slice_array.h 69 * @param __d Number of elements in slice.
72 slice(size_t __o, size_t __d, size_t __s);
94 slice::slice(size_t __o, size_t __d, size_t __s)
95 : _M_off(__o), _M_sz(__d), _M_st(__s) {}
shared_ptr.h 117 * and the deleter @a __d.
119 * @param __d A deleter.
121 * @throw std::bad_alloc, in which case @a __d(__p) is called.
126 * __shared_ptr will release __p by calling __d(__p)
129 shared_ptr(_Tp1* __p, _Deleter __d)
130 : __shared_ptr<_Tp>(__p, __d) { }
134 * and the deleter @a __d.
136 * @param __d A deleter.
138 * @throw std::bad_alloc, in which case @a __d(__p) is called.
143 * The last owner will call __d(__p
    [all...]
stl_iterator_base_funcs.h 176 typename iterator_traits<_InputIterator>::difference_type __d = __n; local
177 std::__advance(__i, __d, std::__iterator_category(__i));
  /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/
_uninitialized.h 66 _OutputIter __result, const input_iterator_tag &, _Distance* __d)
67 { return __ucopy(__first, __last, __result, __d); }
72 _OutputIter __result, const forward_iterator_tag &, _Distance* __d)
73 { return __ucopy(__first, __last, __result, __d); }
77 _OutputIter __result, const bidirectional_iterator_tag &, _Distance* __d)
78 { return __ucopy(__first, __last, __result, __d); }
229 const _Tp& __x, const input_iterator_tag &, _Distance* __d)
230 { __ufill(__first, __last, __x, __d); }
235 const _Tp& __x, const forward_iterator_tag &, _Distance* __d)
236 { __ufill(__first, __last, __x, __d); }
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/
_uninitialized.h 66 _OutputIter __result, const input_iterator_tag &, _Distance* __d)
67 { return __ucopy(__first, __last, __result, __d); }
72 _OutputIter __result, const forward_iterator_tag &, _Distance* __d)
73 { return __ucopy(__first, __last, __result, __d); }
77 _OutputIter __result, const bidirectional_iterator_tag &, _Distance* __d)
78 { return __ucopy(__first, __last, __result, __d); }
229 const _Tp& __x, const input_iterator_tag &, _Distance* __d)
230 { __ufill(__first, __last, __x, __d); }
235 const _Tp& __x, const forward_iterator_tag &, _Distance* __d)
236 { __ufill(__first, __last, __x, __d); }
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/
_uninitialized.h 66 _OutputIter __result, const input_iterator_tag &, _Distance* __d)
67 { return __ucopy(__first, __last, __result, __d); }
72 _OutputIter __result, const forward_iterator_tag &, _Distance* __d)
73 { return __ucopy(__first, __last, __result, __d); }
77 _OutputIter __result, const bidirectional_iterator_tag &, _Distance* __d)
78 { return __ucopy(__first, __last, __result, __d); }
229 const _Tp& __x, const input_iterator_tag &, _Distance* __d)
230 { __ufill(__first, __last, __x, __d); }
235 const _Tp& __x, const forward_iterator_tag &, _Distance* __d)
236 { __ufill(__first, __last, __x, __d); }
    [all...]

Completed in 766 milliseconds

1 2 34 5 6 7 8 91011>>