Ignore:
Timestamp:
Oct 23, 2014, 4:33:47 PM (7 years ago)
Author:
Peter
Message:

closes #806

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/yat/omic/Pileup.h

    r3334 r3335  
    2828#include "yat/utility/yat_assert.h"
    2929
     30#include <boost/iterator/iterator_traits.hpp>
     31#include <boost/concept/assert.hpp>
    3032#include <boost/shared_ptr.hpp>
    3133
     
    3840
    3941  /**
     42     Pileup takes a range of BamReads and pile them up on the current
     43     position. User can investigate the pile of reads at current
     44     (locus) position via begin() and end(), which provide access to
     45     reads at current position. The position can be incremented and in
     46     that way the user can investigate each position of the genome.
     47
    4048     \since new in yat 0.13
     49
     50     Type Requirments:
     51     - \c Iterator is a \input_iterator
     52     - \c value_type is convertible to BamRead
    4153   */
    4254  template<typename Iterator>
     
    178190       each Entry that has an insertion. Otherwise increment to next
    179191       position and update each Entry accordingly.
     192
     193       If the position is not covered by any read, the Pileup
     194       fastforward to next covered locus.
    180195     */
    181196    void increment(void);
     
    225240    : bam_(first), bam_end_(last), pos_(0), tid_(0), skip_ref_(0)
    226241  {
     242    BOOST_CONCEPT_ASSERT((boost::InputIterator<Iterator>));
     243    using boost::Convertible;
     244    typedef typename boost::iterator_value<Iterator>::type value_type;
     245    BOOST_CONCEPT_ASSERT((Convertible<value_type, BamRead>));
    227246    increment();
    228247  }
Note: See TracChangeset for help on using the changeset viewer.