File size: 1,719 Bytes
158b61b |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 |
/*
* TargetPhrases.cpp
*
* Created on: 23 Oct 2015
* Author: hieu
*/
#include <cassert>
#include <boost/foreach.hpp>
#include "TargetPhrases.h"
#include "TargetPhraseImpl.h"
#include "../Phrase.h"
#include "../TargetPhrase.h"
using namespace std;
namespace Moses2
{
TargetPhrases::TargetPhrases(MemPool &pool, size_t size) :
m_coll(pool, size), m_currInd(0)
{
}
/*
TargetPhrases::TargetPhrases(MemPool &pool, const System &system, const TargetPhrases ©)
:m_coll(pool, copy.m_coll.size())
{
for (size_t i = 0; i < copy.m_coll.size(); ++i) {
const TargetPhrase *tpOrig = copy.m_coll[i];
assert(tpOrig);
const TargetPhrase *tpClone = new (pool.Allocate<TargetPhrase>()) TargetPhrase(pool, system, *tpOrig);
m_coll[i] = tpClone;
}
}
*/
TargetPhrases::~TargetPhrases()
{
// TODO Auto-generated destructor stub
}
std::string TargetPhrases::Debug(const System &system) const
{
stringstream out;
BOOST_FOREACH(const TargetPhraseImpl *tp, *this) {
out << tp->Debug(system);
out << endl;
}
return out.str();
}
void TargetPhrases::SortAndPrune(size_t tableLimit)
{
iterator iterMiddle;
iterMiddle =
(tableLimit == 0 || m_coll.size() < tableLimit) ?
m_coll.end() : m_coll.begin() + tableLimit;
std::partial_sort(m_coll.begin(), iterMiddle, m_coll.end(),
CompareScoreForPruning<TP>());
if (tableLimit && m_coll.size() > tableLimit) {
m_coll.resize(tableLimit);
}
//cerr << "TargetPhrases=" << GetSize() << endl;
}
/*
const TargetPhrases *TargetPhrases::Clone(MemPool &pool, const System &system) const
{
const TargetPhrases *ret = new (pool.Allocate<TargetPhrases>()) TargetPhrases(pool, system, *this);
return ret;
}
*/
}
|