bpp-phyl
2.2.0
|
A very simple site iterator. More...
#include <Bpp/Phyl/Likelihood/AbstractTreeLikelihood.h>
Public Member Functions | |
SimpleSiteIterator (size_t nbSites, size_t offset=0) | |
size_t | next () throw (Exception) |
bool | hasNext () const |
Private Attributes | |
size_t | maxIndex_ |
size_t | index_ |
size_t | offset_ |
A very simple site iterator.
This iterator loops over a continuous range of sites. The ocnstructor takes as input the number of sites to iterate over, and optionally an offset argument, specifying the index of the first site.
Definition at line 109 of file AbstractTreeLikelihood.h.
|
inline |
Definition at line 118 of file AbstractTreeLikelihood.h.
|
inlinevirtual |
Implements bpp::TreeLikelihood::SiteIterator.
Definition at line 129 of file AbstractTreeLikelihood.h.
References index_, and maxIndex_.
Referenced by next().
|
inlinevirtual |
Implements bpp::TreeLikelihood::SiteIterator.
Definition at line 122 of file AbstractTreeLikelihood.h.
|
private |
Definition at line 114 of file AbstractTreeLikelihood.h.
|
private |
Definition at line 113 of file AbstractTreeLikelihood.h.
Referenced by hasNext().
|
private |
Definition at line 115 of file AbstractTreeLikelihood.h.
Referenced by next().