mosesdecoder/moses/DecodeGraph.h
2013-06-10 18:11:55 +01:00

94 lines
2.3 KiB
C++

// $Id$
// vim:tabstop=2
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#ifndef moses_DecodeGraph_h
#define moses_DecodeGraph_h
#include "util/check.hh"
#include <list>
#include <iterator>
#include "TypeDef.h"
namespace Moses
{
class DecodeStep;
//! list of DecodeSteps which factorizes the translation
class DecodeGraph
{
protected:
std::list<const DecodeStep*> m_steps;
size_t m_position;
size_t m_maxChartSpan;
public:
/**
* position: The position of this graph within the decode sequence.
**/
DecodeGraph(size_t position)
: m_position(position)
, m_maxChartSpan(NOT_FOUND) {
}
// for chart decoding
DecodeGraph(size_t position, size_t maxChartSpan)
: m_position(position)
, m_maxChartSpan(maxChartSpan) {
}
//! iterators
typedef std::list<const DecodeStep*>::iterator iterator;
typedef std::list<const DecodeStep*>::const_iterator const_iterator;
const_iterator begin() const {
return m_steps.begin();
}
const_iterator end() const {
return m_steps.end();
}
virtual ~DecodeGraph();
//! Add another decode step to the graph
void Add(const DecodeStep *decodeStep) {
m_steps.push_back(decodeStep);
}
size_t GetSize() const {
return m_steps.size();
}
size_t GetMaxChartSpan() const {
CHECK(m_maxChartSpan != NOT_FOUND);
return m_maxChartSpan;
}
size_t GetPosition() const {
return m_position;
}
};
}
#endif