The implicit supremum comes with a performance cost.
Deriving from RandomAccessIterator is not possible since RandomAccessIterator need not be a class.
Definition at line 90 of file multiway_merge.h.
__gnu_parallel::guarded_iterator< RandomAccessIterator, Comparator >::guarded_iterator | ( | RandomAccessIterator | begin, | |
RandomAccessIterator | end, | |||
Comparator & | comp | |||
) | [inline] |
Constructor. Sets iterator to beginning of sequence.
begin | Begin iterator of sequence. | |
end | End iterator of sequence. | |
comp | Comparator provided for associated overloaded compare operators. |
Definition at line 108 of file multiway_merge.h.
__gnu_parallel::guarded_iterator< RandomAccessIterator, Comparator >::operator RandomAccessIterator | ( | ) | [inline] |
Convert to wrapped iterator.
Definition at line 130 of file multiway_merge.h.
std::iterator_traits<RandomAccessIterator>::value_type& __gnu_parallel::guarded_iterator< RandomAccessIterator, Comparator >::operator* | ( | ) | [inline] |
guarded_iterator<RandomAccessIterator, Comparator>& __gnu_parallel::guarded_iterator< RandomAccessIterator, Comparator >::operator++ | ( | ) | [inline] |