moses-smt/mosesdecoder
1
1
Fork 0
mirror of https://github.com/moses-smt/mosesdecoder.git synced 2025-01-05 02:22:21 +03:00
Code Issues Packages Projects Releases Wiki Activity

return asap

Browse Source
This commit is contained in:
Hieu Hoang 2015-12-31 13:48:34 +00:00
parent 0915dbd472
commit d79d227418
1 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
contrib/other-builds/moses2/Search/CubePruning/Stack.cpp
View File

@ -26,14 +26,12 @@ MiniStack::MiniStack(const Manager &mgr)
StackAdd MiniStack::Add(const Hypothesis *hypo)
{
StackAdd ret;
std::pair<MiniStack::_HCType::iterator, bool> addRet = m_coll.insert(hypo);
// CHECK RECOMBINATION
if (addRet.second) {
// equiv hypo doesn't exists
ret.added = true;
ret.toBeDeleted = NULL;
return StackAdd(true, NULL);
}
else {
const Hypothesis *hypoExisting = *addRet.first;
@ -43,17 +41,15 @@ StackAdd MiniStack::Add(const Hypothesis *hypo)
const Hypothesis *&hypoExisting2 = const_cast<const Hypothesis *&>(hypoExisting1);
hypoExisting2 = hypo;
ret.added = true;
ret.toBeDeleted = const_cast<Hypothesis*>(hypoExisting);
return StackAdd(true, const_cast<Hypothesis*>(hypoExisting));
}
else {
// already storing the best hypo. discard incoming hypo
ret.added = false;
ret.toBeDeleted = const_cast<Hypothesis*>(hypo);
return StackAdd(false, const_cast<Hypothesis*>(hypo));
}
}
return ret;
assert(false);
}
CubeEdge::Hypotheses &MiniStack::GetSortedAndPruneHypos(const Manager &mgr) const