bpp-phyl3  3.0.0
bpp::TreeLikelihoodInterface::BranchIterator Class Referenceabstract

An iterator over a set of branches, specified by their node ids. More...

#include <Bpp/Phyl/Legacy/Likelihood/TreeLikelihood.h>

+ Inheritance diagram for bpp::TreeLikelihoodInterface::BranchIterator:

Public Member Functions

virtual ~BranchIterator ()
 
virtual int next ()=0
 
virtual bool hasNext () const =0
 

Detailed Description

An iterator over a set of branches, specified by their node ids.

Definition at line 35 of file TreeLikelihood.h.

Constructor & Destructor Documentation

◆ ~BranchIterator()

virtual bpp::TreeLikelihoodInterface::BranchIterator::~BranchIterator ( )
inlinevirtual

Definition at line 38 of file TreeLikelihood.h.

Member Function Documentation

◆ hasNext()

virtual bool bpp::TreeLikelihoodInterface::BranchIterator::hasNext ( ) const
pure virtual
Returns
True if there is at least another node in the set.

Implemented in bpp::AbstractTreeLikelihood::SimpleBranchIterator.

◆ next()

virtual int bpp::TreeLikelihoodInterface::BranchIterator::next ( )
pure virtual
Returns
The id of the next node in the set.

Implemented in bpp::AbstractTreeLikelihood::SimpleBranchIterator.


The documentation for this class was generated from the following file: