yat
0.20.3pre
|
#include <yat/omic/BamPairIterator2.h>
Public Member Functions | |
BamPairIterator2 (void) | |
default constructor | |
BamPairIterator2 (Base begin, Base end) | |
BamPairIterator2::pointer | operator-> (void) const |
Friends | |
class | boost::iterator_core_access |
Type Requirments:
Base
is a Readable IteratorBase
is a Single Pass Iteratorvalue_type
is BamReadThis iterator works on a sorted range [begin, end) and provides a covenient way to access the pairs rather than the reads individually. The pairs are iterated such that they appear sorted with respect to first()
.
If read pairs with large isize (tlen) are included the iterator will consumer a lot of memory because iterator does store virtually all reads in the underlying range between the current first()
and its mate, second()
.
Note that BamPairIterator2 is a single-pass iterator, i.e., once it is incremented the behaviour of its copies is undefined.
|
explicit |
Creates an iterator that will work on [begin, end).
[begin, end
) must be sorted or behaviour is undefined.
|
inline |
This is workaround implementation of operator-> when implementation in base class (boost) does not compile. This implementation may be slow, so when using old boost it often prefereble to use operator*.