HomeSort by relevance Sort by last modified time
    Searched full:split_pos1 (Results 1 - 2 of 2) sorted by null

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
balanced_quicksort.h 286 RandomAccessIterator split_pos1, split_pos2; local
287 split_pos1 = __gnu_sequential::partition(begin, end - 1, pred);
291 _GLIBCXX_PARALLEL_ASSERT(begin <= split_pos1 && split_pos1 < end);
294 if (split_pos1 != pivot_pos)
295 std::swap(*split_pos1, *pivot_pos);
296 pivot_pos = split_pos1;
298 // In case all elements are equal, split_pos1 == 0.
299 if ((split_pos1 + 1 - begin) < (n >> 7)
300 || (end - split_pos1) < (n >> 7)
    [all...]
partition.h 368 RandomAccessIterator split_pos1, split_pos2; local
369 split_pos1 = begin + parallel_partition(begin, end - 1, pred,
375 if (split_pos1 != pivot_pos)
376 std::swap(*split_pos1, *pivot_pos);
377 pivot_pos = split_pos1;
379 // In case all elements are equal, split_pos1 == 0
380 if ((split_pos1 + 1 - begin) < (n >> 7)
381 || (end - split_pos1) < (n >> 7))
391 split_pos2 = __gnu_sequential::partition(split_pos1 + 1,
396 split_pos2 = split_pos1 + 1
    [all...]

Completed in 247 milliseconds