Reranker Framework (ReFr)
Reranking framework for structure prediction and discriminative language modeling
|
An interface specifying iteration over CandidateSet instances, using Java-style semantics (sorry, die-hard C++ iterator fans). More...
#include <candidate-set-iterator.H>
Public Member Functions | |
virtual | ~CandidateSetIterator () |
virtual bool | HasNext () const =0 |
Returns whether this iterator contains another CandidateSet. More... | |
virtual CandidateSet & | Next ()=0 |
Returns the next CandidateSet. More... | |
virtual void | Reset ()=0 |
Resets this iterator back to the beginning of its backing collection. More... | |
An interface specifying iteration over CandidateSet instances, using Java-style semantics (sorry, die-hard C++ iterator fans).
Unlike Java or C++ iterators, implementations of this interface are always assumed to have some way of returning to the beginning of their underlying collection of CandidateSet instances; this is required by the Reset method.
Definition at line 58 of file candidate-set-iterator.H.
|
inlinevirtual |
Definition at line 60 of file candidate-set-iterator.H.
|
pure virtual |
Returns whether this iterator contains another CandidateSet.
Implemented in reranker::MultiFileCandidateSetIterator, and reranker::CollectionCandidateSetIterator< Collection >.
|
pure virtual |
Returns the next CandidateSet.
Implemented in reranker::MultiFileCandidateSetIterator, and reranker::CollectionCandidateSetIterator< Collection >.
|
pure virtual |
Resets this iterator back to the beginning of its backing collection.
Implemented in reranker::MultiFileCandidateSetIterator, and reranker::CollectionCandidateSetIterator< Collection >.