|
| template<class Iterator , class Rng > |
| void | shark::shuffle (Iterator begin, Iterator end, Rng &rng) |
| | random_shuffle algorithm which stops after acquiring the random subsequence for [begin,middle) More...
|
| |
| template<class RandomAccessIterator , class Rng > |
| void | shark::partial_shuffle (RandomAccessIterator begin, RandomAccessIterator middle, RandomAccessIterator end, Rng &rng) |
| | random_shuffle algorithm which stops after acquiring the random subsequence for [begin,middle) More...
|
| |
| template<class RandomAccessIterator > |
| void | shark::partial_shuffle (RandomAccessIterator begin, RandomAccessIterator middle, RandomAccessIterator end) |
| | random_shuffle algorithm which stops after acquiring the random subsequence for [begin,middle) More...
|
| |
| template<class Range > |
| boost::range_iterator< Range >::type | shark::median_element (Range &range) |
| | Returns the iterator to the median element. after this call, the range is partially ordered. More...
|
| |
| template<class Range > |
| boost::range_iterator< Range >::type | shark::median_element (Range const &rangeAdaptor) |
| |
| template<class Range > |
| boost::range_iterator< Range >::type | shark::partitionEqually (Range &range) |
| | Partitions a range in two parts as equal in size as possible. More...
|
| |
| template<class Range > |
| boost::range_iterator< Range >::type | shark::partitionEqually (Range const &rangeAdaptor) |
| | Partitions a range in two parts as equal in size as possible and returns it's result. More...
|
| |