#include <quick_sort_algorithm.hh>
Inheritance diagram for mpcl::util::strategy::TQuickSortAlgorithm< TSequence >:
Public Types | |
typedef ISortAlgorithm< TSequence >::iterator | iterator |
Iterator for sequences. | |
typedef ISortAlgorithm< TSequence >::const_iterator | const_iterator |
Constant iterator for sequences. | |
typedef ISortAlgorithm< TSequence >::value_type | value_type |
Value type for sequences. | |
Public Methods | |
void | execute (TSequence &rtSOURCE_SEQUENCE) |
Protected Methods | |
virtual const_iterator | median (const TSequence &rktSOURCE_SEQUENCE) const |
virtual const_iterator | median (const_iterator ktBEGIN_ITER, const_iterator ktEND_ITER) const |
void | sort (iterator tBEGIN_ITER, iterator tEND_ITER) |
Requires:
TSequence::begin() TSequence::const_iterator TSequence::end() TSequence::insert() TSequence::iterator TSequence::size() TSequence::value_type
Definition at line 59 of file quick_sort_algorithm.hh.
|
Apply the quick-sort algorithm over the sequence of items rtSOURCE_SEQUENCE.
Implements mpcl::util::strategy::ISortAlgorithm< TSequence >. Definition at line 91 of file quick_sort_algorithm.hh. References mpcl::util::strategy::TQuickSortAlgorithm< TSequence >::sort(). |
|
Gets the element at median position into the sequence of items delimited by iterators.
Definition at line 124 of file quick_sort_algorithm.hh. |
|
Gets the element at median position into the sequence of items rktSOURCE_SEQUENCE.
Definition at line 112 of file quick_sort_algorithm.hh. Referenced by mpcl::util::strategy::TQuickSortAlgorithm< TSequence >::sort(). |
|
Makes the Quicksort (C. A. R. Hoare) method over the sequence between iterators.
Definition at line 142 of file quick_sort_algorithm.hh. References mpcl::util::strategy::TQuickSortAlgorithm< TSequence >::median(), and mpcl::util::strategy::ISortAlgorithm< TSequence >::swap(). Referenced by mpcl::util::strategy::TQuickSortAlgorithm< TSequence >::execute(). |