| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| balanced_quicksort.h | 295 _RAIter __split_pos1, __split_pos2; local
296 __split_pos1 = __gnu_sequential::partition(__begin, __end - 1,
301 _GLIBCXX_PARALLEL_ASSERT(__begin <= __split_pos1
302 && __split_pos1 < __end);
305 if (__split_pos1 != __pivot_pos)
306 std::iter_swap(__split_pos1, __pivot_pos);
307 __pivot_pos = __split_pos1;
309 // In case all elements are equal, __split_pos1 == 0.
310 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
311 || (__end - __split_pos1) < (__n >> 7)
[all...] |
| partition.h | 370 _RAIter __split_pos1, __split_pos2; local
371 __split_pos1 = __begin + __parallel_partition(__begin, __end - 1,
378 if (__split_pos1 != __pivot_pos)
379 std::iter_swap(__split_pos1, __pivot_pos);
380 __pivot_pos = __split_pos1;
382 // In case all elements are equal, __split_pos1 == 0
383 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
384 || (__end - __split_pos1) < (__n >> 7))
395 __split_pos2 = __gnu_sequential::partition(__split_pos1 + 1,
400 __split_pos2 = __split_pos1 + 1
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| balanced_quicksort.h | 295 _RAIter __split_pos1, __split_pos2; local
296 __split_pos1 = __gnu_sequential::partition(__begin, __end - 1,
301 _GLIBCXX_PARALLEL_ASSERT(__begin <= __split_pos1
302 && __split_pos1 < __end);
305 if (__split_pos1 != __pivot_pos)
306 std::iter_swap(__split_pos1, __pivot_pos);
307 __pivot_pos = __split_pos1;
309 // In case all elements are equal, __split_pos1 == 0.
310 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
311 || (__end - __split_pos1) < (__n >> 7)
[all...] |
| partition.h | 370 _RAIter __split_pos1, __split_pos2; local
371 __split_pos1 = __begin + __parallel_partition(__begin, __end - 1,
378 if (__split_pos1 != __pivot_pos)
379 std::iter_swap(__split_pos1, __pivot_pos);
380 __pivot_pos = __split_pos1;
382 // In case all elements are equal, __split_pos1 == 0
383 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
384 || (__end - __split_pos1) < (__n >> 7))
395 __split_pos2 = __gnu_sequential::partition(__split_pos1 + 1,
400 __split_pos2 = __split_pos1 + 1
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| balanced_quicksort.h | 295 _RAIter __split_pos1, __split_pos2; local
296 __split_pos1 = __gnu_sequential::partition(__begin, __end - 1,
301 _GLIBCXX_PARALLEL_ASSERT(__begin <= __split_pos1
302 && __split_pos1 < __end);
305 if (__split_pos1 != __pivot_pos)
306 std::iter_swap(__split_pos1, __pivot_pos);
307 __pivot_pos = __split_pos1;
309 // In case all elements are equal, __split_pos1 == 0.
310 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
311 || (__end - __split_pos1) < (__n >> 7)
[all...] |
| partition.h | 370 _RAIter __split_pos1, __split_pos2; local
371 __split_pos1 = __begin + __parallel_partition(__begin, __end - 1,
378 if (__split_pos1 != __pivot_pos)
379 std::iter_swap(__split_pos1, __pivot_pos);
380 __pivot_pos = __split_pos1;
382 // In case all elements are equal, __split_pos1 == 0
383 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
384 || (__end - __split_pos1) < (__n >> 7))
395 __split_pos2 = __gnu_sequential::partition(__split_pos1 + 1,
400 __split_pos2 = __split_pos1 + 1
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| balanced_quicksort.h | 295 _RAIter __split_pos1, __split_pos2; local
296 __split_pos1 = __gnu_sequential::partition(__begin, __end - 1,
301 _GLIBCXX_PARALLEL_ASSERT(__begin <= __split_pos1
302 && __split_pos1 < __end);
305 if (__split_pos1 != __pivot_pos)
306 std::iter_swap(__split_pos1, __pivot_pos);
307 __pivot_pos = __split_pos1;
309 // In case all elements are equal, __split_pos1 == 0.
310 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
311 || (__end - __split_pos1) < (__n >> 7)
[all...] |
| partition.h | 370 _RAIter __split_pos1, __split_pos2; local
371 __split_pos1 = __begin + __parallel_partition(__begin, __end - 1,
378 if (__split_pos1 != __pivot_pos)
379 std::iter_swap(__split_pos1, __pivot_pos);
380 __pivot_pos = __split_pos1;
382 // In case all elements are equal, __split_pos1 == 0
383 if ((__split_pos1 + 1 - __begin) < (__n >> 7)
384 || (__end - __split_pos1) < (__n >> 7))
395 __split_pos2 = __gnu_sequential::partition(__split_pos1 + 1,
400 __split_pos2 = __split_pos1 + 1
[all...] |
