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
39 lines
1.3 KiB
C++
39 lines
1.3 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
|
|
***********************************************************************/
|
|
|
|
#include "HoleCollection.h"
|
|
|
|
#include <algorithm>
|
|
|
|
void HoleCollection::SortSourceHoles()
|
|
{
|
|
assert(m_sortedSourceHoles.size() == 0);
|
|
|
|
// add
|
|
HoleList::iterator iter;
|
|
for (iter = m_holes.begin(); iter != m_holes.end(); ++iter)
|
|
{
|
|
Hole &currHole = *iter;
|
|
m_sortedSourceHoles.push_back(&currHole);
|
|
}
|
|
|
|
// sort
|
|
std::sort(m_sortedSourceHoles.begin(), m_sortedSourceHoles.end(), HoleSourceOrderer());
|
|
}
|