mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2025-01-08 12:36:35 +03:00
580acce9e2
programs: `extract' for the phrase-based model and `extract-rules' for tree-based models. They could be combined into a single program, but they're probably sufficiently different that it isn't worthwhile. git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@3129 1f5c12ca-751b-0410-a591-d2e778427230
85 lines
2.5 KiB
C++
85 lines
2.5 KiB
C++
/***********************************************************************
|
|
Moses - factored phrase-based language decoder
|
|
Copyright (C) 2010 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
|
|
***********************************************************************/
|
|
|
|
#pragma once
|
|
#ifndef HOLECOLLECTION_H_INCLUDED_
|
|
#define HOLECOLLECTION_H_INCLUDED_
|
|
|
|
#include <vector>
|
|
|
|
#include "Hole.h"
|
|
|
|
class HoleCollection
|
|
{
|
|
protected:
|
|
HoleList m_holes;
|
|
std::vector<Hole*> m_sortedSourceHoles;
|
|
|
|
public:
|
|
HoleCollection()
|
|
{}
|
|
|
|
HoleCollection(const HoleCollection ©)
|
|
: m_holes(copy.m_holes)
|
|
{} // don't copy sorted target holes. messes up sorting fn
|
|
|
|
const HoleList &GetHoles() const
|
|
{ return m_holes; }
|
|
|
|
HoleList &GetHoles()
|
|
{ return m_holes; }
|
|
|
|
std::vector<Hole*> &GetSortedSourceHoles()
|
|
{ return m_sortedSourceHoles; }
|
|
|
|
void Add(int startT, int endT, int startS, int endS)
|
|
{
|
|
m_holes.push_back(Hole(startS, endS, startT, endT));
|
|
}
|
|
|
|
bool OverlapSource(const Hole &sourceHole) const
|
|
{
|
|
HoleList::const_iterator iter;
|
|
for (iter = m_holes.begin(); iter != m_holes.end(); ++iter)
|
|
{
|
|
const Hole &currHole = *iter;
|
|
if (currHole.Overlap(sourceHole, 0))
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool ConsecSource(const Hole &sourceHole) const
|
|
{
|
|
HoleList::const_iterator iter;
|
|
for (iter = m_holes.begin(); iter != m_holes.end(); ++iter)
|
|
{
|
|
const Hole &currHole = *iter;
|
|
if (currHole.Neighbor(sourceHole, 0))
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void SortSourceHoles();
|
|
|
|
};
|
|
|
|
#endif
|