60 …std::size_t median_of_three( const RandomAccessIterator& array, std::size_t l, std::size_t m, std:…  in median_of_three()  argument
61 …return comp(array[l], array[m]) ? ( comp(array[m], array[r]) ? m : ( comp(array[l], array[r]) ? r …  in median_of_three()
62 …                         : ( comp(array[r], array[m]) ? m : ( comp(array[r], array[l]) ? r : l ) );  in median_of_three()
65 …std::size_t pseudo_median_of_nine( const RandomAccessIterator& array, const quick_sort_range& rang…  in pseudo_median_of_nine()  argument
67         return median_of_three(array,  in pseudo_median_of_nine()
68                                median_of_three(array, 0 , offset, offset * 2),  in pseudo_median_of_nine()
69                                median_of_three(array, offset * 3, offset * 4, offset * 5),  in pseudo_median_of_nine()
70                                median_of_three(array, offset * 6, offset * 7, range.size - 1));  in pseudo_median_of_nine()
75         RandomAccessIterator array = range.begin;  in split_range()  local
77         std::size_t m = pseudo_median_of_nine(array, range);  in split_range()
78         if( m != 0 ) std::iter_swap(array, array + m);  in split_range()
89             } while( comp(*first_element, array[j]) );  in split_range()
94             } while( comp(array[i], *first_element) );  in split_range()
96             std::iter_swap(array + i, array + j);  in split_range()
100         std::iter_swap(array + j, first_element);  in split_range()