HomeSort by relevance Sort by last modified time
    Searched defs:__n (Results 1 - 25 of 61) sorted by null

1 2 3

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
127 _GLIBCXX_DEBUG_ASSERT(__n >= 0);
128 while (__n--)
134 __advance(_BidirectionalIterator& __i, _Distance __n,
140 if (__n > 0)
141 while (__n--)
144 while (__n++
    [all...]
streambuf_iterator.h 348 const streamsize __n = __sb->egptr() - __sb->gptr(); local
349 if (__n > 1)
351 traits_type::copy(__result, __sb->gptr(), __n);
352 __sb->__safe_gbump(__n);
353 __result += __n;
385 streamsize __n = __sb->egptr() - __sb->gptr(); local
386 if (__n > 1)
389 __n, __val);
391 __n = __p - __sb->gptr();
392 __sb->__safe_gbump(__n);
    [all...]
valarray_after.h 257 _Expr<_Clos, _Tp>::shift(int __n) const
259 valarray<_Tp> __v = valarray<_Tp>(*this).shift(__n);
265 _Expr<_Clos, _Tp>::cshift(int __n) const
267 valarray<_Tp> __v = valarray<_Tp>(*this).cshift(__n);
292 size_t __n = _M_closure.size(); local
293 if (__n == 0)
297 _Tp __s = _M_closure[--__n];
298 while (__n != 0)
299 __s += _M_closure[--__n];
stl_bvector.h 168 difference_type __n = __i + _M_offset; local
169 _M_p += __n / int(_S_word_bit);
170 __n = __n % int(_S_word_bit);
171 if (__n < 0)
173 __n += int(_S_word_bit);
176 _M_offset = static_cast<unsigned int>(__n);
293 operator+(ptrdiff_t __n, const _Bit_iterator& __x)
294 { return __x + __n; }
379 operator+(ptrdiff_t __n, const _Bit_const_iterator& __x
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
127 _GLIBCXX_DEBUG_ASSERT(__n >= 0);
128 while (__n--)
134 __advance(_BidirectionalIterator& __i, _Distance __n,
140 if (__n > 0)
141 while (__n--)
144 while (__n++
    [all...]
streambuf_iterator.h 348 const streamsize __n = __sb->egptr() - __sb->gptr(); local
349 if (__n > 1)
351 traits_type::copy(__result, __sb->gptr(), __n);
352 __sb->__safe_gbump(__n);
353 __result += __n;
385 streamsize __n = __sb->egptr() - __sb->gptr(); local
386 if (__n > 1)
389 __n, __val);
391 __n = __p - __sb->gptr();
392 __sb->__safe_gbump(__n);
    [all...]
valarray_after.h 257 _Expr<_Clos, _Tp>::shift(int __n) const
259 valarray<_Tp> __v = valarray<_Tp>(*this).shift(__n);
265 _Expr<_Clos, _Tp>::cshift(int __n) const
267 valarray<_Tp> __v = valarray<_Tp>(*this).cshift(__n);
292 size_t __n = _M_closure.size(); local
293 if (__n == 0)
297 _Tp __s = _M_closure[--__n];
298 while (__n != 0)
299 __s += _M_closure[--__n];
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
quicksort.h 62 _DifferenceType __n = __end - __begin; local
63 __num_samples = std::min(__num_samples, __n);
72 (__s) * __n / __num_samples;
78 _ValueType& __pivot = __samples[__pivot_rank * __num_samples / __n];
115 _DifferenceType __n = __end - __begin, __pivot_rank; local
117 if (__n <= 1)
127 __pivot_rank = __n * __num_threads_left / __num_threads;
158 _GLIBCXX_CALL(__n)
164 _DifferenceType __n = __end - __begin; local
167 if (__num_threads > __n)
    [all...]
multiseq_selection.h 146 __nmax, __n, __r; local
195 __n = __l / 2;
206 if (__n < __ns[__i]) //__sequence long enough
207 __sample.push_back(std::make_pair(__S(__i)[__n], __i));
211 if (__n >= __ns[__i]) //__sequence too short, conceptual infinity
219 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
221 __a[__sample[__j].second] += __n + 1;
223 __b[__sample[__j].second] -= __n + 1;
226 while (__n > 0)
228 __n /= 2
    [all...]
partial_sum.h 82 * @param __n Length of sequence.
92 typename std::iterator_traits<_IIter>::difference_type __n)
102 std::min<_DifferenceType>(__get_max_threads(), __n - 1);
126 __equally_split(__n, __num_threads + 1, __borders);
131 __n / (1.0f + __s.partial_sum_dilation * __num_threads));
133 (__n - __first_part_length) / __num_threads;
135 __n - __num_threads * __chunk_length;
142 __borders[__num_threads + 1] = __n;
192 return __result + __n;
214 _DifferenceType __n = __end - __begin local
    [all...]
balanced_quicksort.h 115 _DifferenceType __n = __end - __begin; local
118 && !__comp(*(__begin + __n / 2),
122 || (!__comp(*__pivot_pos, *(__begin + __n / 2))
124 || (!__comp(*__pivot_pos, *(__begin + __n / 2))
129 && !__comp(*(__begin + __n / 2),
181 _DifferenceType __n = __end - __begin; local
183 if (__num_threads <= 1 || __n <= 1)
205 * __num_threads / __n));
278 _DifferenceType __n = __end - __begin; local
280 if (__n > __base_case_n
442 _DifferenceType __n = __end - __begin; local
    [all...]
multiway_mergesort.h 405 _DifferenceType __n = __end - __begin; local
407 if (__n <= 1)
411 if (__num_threads > __n)
412 __num_threads = static_cast<_ThreadIndex>(__n);
448 _DifferenceType __chunk_length = __n / __num_threads;
449 _DifferenceType __split = __n % __num_threads;
partition.h 63 _DifferenceType __n = __end - __begin; local
65 _GLIBCXX_CALL(__n)
70 _GLIBCXX_VOLATILE _DifferenceType __left = 0, __right = __n - 1,
71 __dist = __n,
92 (__s.partition_chunk_size, (double)__n
121 __thread_right = __n - 1;
316 if (__final_left < __n && !__pred(__begin[__final_left]))
351 _DifferenceType __n = __end - __begin; local
353 _RAIter __pivot_pos = __begin + __rng(__n);
383 if ((__split_pos1 + 1 - __begin) < (__n >> 7
    [all...]
random_shuffle.h 259 * @param __n Length of sequence.
267 <_RAIter>::difference_type __n,
275 _GLIBCXX_CALL(__n)
279 if (__num_threads > __n)
280 __num_threads = static_cast<_ThreadIndex>(__n);
289 std::max<_DifferenceType>(1, __n / (__s.L1_cache_size_lb
295 __num_bins = std::min<_DifferenceType>(__n, __num_bins_cache);
309 (std::max<_DifferenceType>(1, __n / (__s.L2_cache_size
315 (std::min(__n, static_cast<_DifferenceType>(__num_bins_cache)));
364 _DifferenceType __chunk_length = __n / __num_threads
417 _DifferenceType __n = __end - __begin; local
527 _DifferenceType __n = __end - __begin; local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
quicksort.h 62 _DifferenceType __n = __end - __begin; local
63 __num_samples = std::min(__num_samples, __n);
72 (__s) * __n / __num_samples;
78 _ValueType& __pivot = __samples[__pivot_rank * __num_samples / __n];
115 _DifferenceType __n = __end - __begin, __pivot_rank; local
117 if (__n <= 1)
127 __pivot_rank = __n * __num_threads_left / __num_threads;
158 _GLIBCXX_CALL(__n)
164 _DifferenceType __n = __end - __begin; local
167 if (__num_threads > __n)
    [all...]
multiseq_selection.h 146 __nmax, __n, __r; local
195 __n = __l / 2;
206 if (__n < __ns[__i]) //__sequence long enough
207 __sample.push_back(std::make_pair(__S(__i)[__n], __i));
211 if (__n >= __ns[__i]) //__sequence too short, conceptual infinity
219 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
221 __a[__sample[__j].second] += __n + 1;
223 __b[__sample[__j].second] -= __n + 1;
226 while (__n > 0)
228 __n /= 2
    [all...]
partial_sum.h 82 * @param __n Length of sequence.
92 typename std::iterator_traits<_IIter>::difference_type __n)
102 std::min<_DifferenceType>(__get_max_threads(), __n - 1);
126 __equally_split(__n, __num_threads + 1, __borders);
131 __n / (1.0f + __s.partial_sum_dilation * __num_threads));
133 (__n - __first_part_length) / __num_threads;
135 __n - __num_threads * __chunk_length;
142 __borders[__num_threads + 1] = __n;
192 return __result + __n;
214 _DifferenceType __n = __end - __begin local
    [all...]
balanced_quicksort.h 115 _DifferenceType __n = __end - __begin; local
118 && !__comp(*(__begin + __n / 2),
122 || (!__comp(*__pivot_pos, *(__begin + __n / 2))
124 || (!__comp(*__pivot_pos, *(__begin + __n / 2))
129 && !__comp(*(__begin + __n / 2),
181 _DifferenceType __n = __end - __begin; local
183 if (__num_threads <= 1 || __n <= 1)
205 * __num_threads / __n));
278 _DifferenceType __n = __end - __begin; local
280 if (__n > __base_case_n
442 _DifferenceType __n = __end - __begin; local
    [all...]
multiway_mergesort.h 405 _DifferenceType __n = __end - __begin; local
407 if (__n <= 1)
411 if (__num_threads > __n)
412 __num_threads = static_cast<_ThreadIndex>(__n);
448 _DifferenceType __chunk_length = __n / __num_threads;
449 _DifferenceType __split = __n % __num_threads;
partition.h 63 _DifferenceType __n = __end - __begin; local
65 _GLIBCXX_CALL(__n)
70 _GLIBCXX_VOLATILE _DifferenceType __left = 0, __right = __n - 1,
71 __dist = __n,
92 (__s.partition_chunk_size, (double)__n
121 __thread_right = __n - 1;
316 if (__final_left < __n && !__pred(__begin[__final_left]))
351 _DifferenceType __n = __end - __begin; local
353 _RAIter __pivot_pos = __begin + __rng(__n);
383 if ((__split_pos1 + 1 - __begin) < (__n >> 7
    [all...]
  /external/libcxx/src/
strstream.cpp 37 strstreambuf::__init(char* __gnext, streamsize __n, char* __pbeg)
39 if (__n == 0)
40 __n = static_cast<streamsize>(strlen(__gnext));
41 else if (__n < 0)
42 __n = INT_MAX;
44 setg(__gnext, __gnext, __gnext + __n);
48 setp(__pbeg, __pbeg + __n);
52 strstreambuf::strstreambuf(char* __gnext, streamsize __n, char* __pbeg)
58 __init(__gnext, __n, __pbeg);
61 strstreambuf::strstreambuf(const char* __gnext, streamsize __n)
67 __init(const_cast<char *>(__gnext), __n, nullptr); local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/src/
strstream.cpp 37 strstreambuf::__init(char* __gnext, streamsize __n, char* __pbeg)
39 if (__n == 0)
40 __n = static_cast<streamsize>(strlen(__gnext));
41 else if (__n < 0)
42 __n = INT_MAX;
44 setg(__gnext, __gnext, __gnext + __n);
48 setp(__pbeg, __pbeg + __n);
52 strstreambuf::strstreambuf(char* __gnext, streamsize __n, char* __pbeg)
58 __init(__gnext, __n, __pbeg);
61 strstreambuf::strstreambuf(const char* __gnext, streamsize __n)
67 __init(const_cast<char *>(__gnext), __n, nullptr); local
    [all...]
  /external/clang/test/Analysis/Inputs/
system-header-simulator-cxx.h 179 size_t __n = __last - __first; local
181 if (__n > 0)
182 memmove(__result, __first, __n * sizeof(_Up));
184 return __result + __n;
211 size_t __n = __last - __first; local
213 if (__n > 0)
215 __result -= __n;
216 memmove(__result, __first, __n * sizeof(_Up));
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/
sso_string_base.h 171 _M_set_length(size_type __n)
173 _M_length(__n);
174 traits_type::assign(_M_data()[__n], _CharT());
189 __sso_string_base(size_type __n, _CharT __c, const _Alloc& __a);
220 _M_erase(size_type __pos, size_type __n);
316 std::__throw_length_error(__N("__sso_string_base::_M_create"));
372 __sso_string_base(size_type __n, _CharT __c, const _Alloc& __a)
374 { _M_construct(__n, __c); }
440 std::__throw_logic_error(__N("__sso_string_base::"
466 _M_construct(size_type __n, _CharT __c
475 this->_S_assign(_M_data(), __n, __c); local
568 this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, __how_much); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
random.h 547 template<class _UIntType, int __w, int __n, int __m, int __r,
560 static const int state_size = __n;
996 if (!std::equal(__lhs._M_x[__i], __lhs._M_x[__i] + __n,
1065 static const int __n = (__w + 31) \/ 32; member in class:subtract_with_carry_01
    [all...]

Completed in 501 milliseconds

1 2 3