/* This file is part of Jellyfish.
Jellyfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Jellyfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Jellyfish. If not, see .
*/
#ifndef __MER_ITERATOR_HPP__
#define __MER_ITERATOR_HPP__
#include
#include
namespace jellyfish {
template
class mer_iterator : public std::iterator {
typename SequencePool::job* job_;
const char* cseq_;
MerType m_; // mer
MerType rcm_; // reverse complement mer
unsigned int filled_;
const bool canonical_;
public:
typedef MerType mer_type;
typedef SequencePool sequence_parser_type;
mer_iterator(SequencePool& seq, bool canonical = false) :
job_(new typename SequencePool::job(seq)), cseq_(0), filled_(0), canonical_(canonical)
{
if(job_->is_empty()) {
delete job_;
job_ = 0;
} else {
cseq_ = (*job_)->start;
this->operator++();
}
}
mer_iterator() : job_(0), cseq_(0), filled_(0), canonical_(false) { }
// mer_iterator(const mer_iterator& rhs) : job_(rhs.job_), cseq_(rhs.cseq_), m_(rhs.m_), filled_(rhs.filled_) { }
~mer_iterator() {
delete job_;
}
bool operator==(const mer_iterator& rhs) const { return job_ == rhs.job_; }
bool operator!=(const mer_iterator& rhs) const { return job_ != rhs.job_; }
operator void*() const { return (void*)job_; }
const mer_type& operator*() const { return !canonical_ || m_ < rcm_ ? m_ : rcm_; }
const mer_type* operator->() const { return &this->operator*(); }
mer_iterator& operator++() {
while(true) {
while(cseq_ == (*job_)->end) {
job_->next();
if(job_->is_empty()) {
delete job_;
job_ = 0;
cseq_ = 0;
return *this;
}
cseq_ = (*job_)->start;
filled_ = 0;
}
do {
int code = m_.code(*cseq_++);
if(code >= 0) {
m_.shift_left(code);
if(canonical_)
rcm_.shift_right(rcm_.complement(code));
filled_ = std::min(filled_ + 1, mer_dna::k());
} else
filled_ = 0;
} while(filled_ < m_.k() && cseq_ < (*job_)->end);
if(filled_ >= m_.k())
break;
}
return *this;
}
mer_iterator operator++(int) {
mer_iterator res(*this);
++*this;
return res;
}
};
} // namespace jellyfish {
#endif /* __MER_ITERATOR_HPP__ */