diff options
author | Hieu Hoang <hieuhoang@gmail.com> | 2012-11-12 23:56:18 +0400 |
---|---|---|
committer | Hieu Hoang <hieuhoang@gmail.com> | 2012-11-12 23:56:18 +0400 |
commit | 5e3ef23cef6101d2c098eb3445f562e8f595655b (patch) | |
tree | b8c332b6fa82bae84ea4910967a10ba1b08a7107 /moses/TargetPhraseCollection.cpp | |
parent | 8c785cff2b1be3cccd76ea9026f71b649762dfc3 (diff) |
move moses/src/* to moses/
Diffstat (limited to 'moses/TargetPhraseCollection.cpp')
-rw-r--r-- | moses/TargetPhraseCollection.cpp | 79 |
1 files changed, 79 insertions, 0 deletions
diff --git a/moses/TargetPhraseCollection.cpp b/moses/TargetPhraseCollection.cpp new file mode 100644 index 000000000..38570f8d5 --- /dev/null +++ b/moses/TargetPhraseCollection.cpp @@ -0,0 +1,79 @@ +// $Id$ + +/*********************************************************************** +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 +***********************************************************************/ + +#include <algorithm> +#include "TargetPhraseCollection.h" + +using namespace std; + +namespace Moses +{ +// helper for sort +struct CompareTargetPhrase { + bool operator() (const TargetPhrase *a, const TargetPhrase *b) { + return a->GetFutureScore() > b->GetFutureScore(); + } +}; + +void TargetPhraseCollection::NthElement(size_t tableLimit) +{ + vector<TargetPhrase*>::iterator + iterMiddle = (tableLimit == 0 || m_collection.size() < tableLimit) ?m_collection.end() : m_collection.begin() + tableLimit; + + //std::sort(m_collection.begin(), m_collection.end(), CompareTargetPhrase()); + std::nth_element(m_collection.begin(), iterMiddle, m_collection.end(), CompareTargetPhrase()); +} + +void TargetPhraseCollection::Prune(bool adhereTableLimit, size_t tableLimit) +{ + NthElement(tableLimit); + + if (adhereTableLimit && m_collection.size() > tableLimit) { + for (size_t ind = tableLimit; ind < m_collection.size(); ++ind) { + TargetPhrase *targetPhrase = m_collection[ind]; + delete targetPhrase; + } + m_collection.erase(m_collection.begin() + tableLimit, m_collection.end()); + } +} + +void TargetPhraseCollection::Sort(bool adhereTableLimit, size_t tableLimit) +{ + std::vector<TargetPhrase*>::iterator iterMiddle; + iterMiddle = (tableLimit == 0 || m_collection.size() < tableLimit) + ? m_collection.end() + : m_collection.begin()+tableLimit; + + std::partial_sort(m_collection.begin(), iterMiddle, m_collection.end(), + CompareTargetPhrase()); + + if (adhereTableLimit && m_collection.size() > tableLimit) { + for (size_t i = tableLimit; i < m_collection.size(); ++i) { + TargetPhrase *targetPhrase = m_collection[i]; + delete targetPhrase; + } + m_collection.erase(m_collection.begin()+tableLimit, m_collection.end()); + } +} + +} + + |