Lines Matching refs:range
65 …t pseudo_median_of_nine( const RandomAccessIterator& array, const quick_sort_range& range ) const { in pseudo_median_of_nine() argument
66 std::size_t offset = range.size / 8u; in pseudo_median_of_nine()
70 median_of_three(array, offset * 6, offset * 7, range.size - 1)); in pseudo_median_of_nine()
74 std::size_t split_range( quick_sort_range& range ) { in split_range() argument
75 RandomAccessIterator array = range.begin; in split_range()
76 RandomAccessIterator first_element = range.begin; in split_range()
77 std::size_t m = pseudo_median_of_nine(array, range); in split_range()
81 std::size_t j = range.size; in split_range()
105 std::size_t new_range_size = range.size - i; in split_range()
106 range.size = j; in split_range()
126 quick_sort_range( quick_sort_range& range, split ) in quick_sort_range() argument
127 : comp(range.comp) in quick_sort_range()
128 , size(split_range(range)) in quick_sort_range()
131 , begin(range.begin + range.size + 1) {} in quick_sort_range()
148 void operator()( const blocked_range<RandomAccessIterator>& range ) const { in operator()
149 RandomAccessIterator my_end = range.end(); in operator()
153 for( RandomAccessIterator k = range.begin(); k != my_end; ++k, ++i ) { in operator()
169 void operator()( const quick_sort_range<RandomAccessIterator,Compare>& range ) const { in operator()
170 std::sort(range.begin, range.begin + range.size, range.comp); in operator()