mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2025-01-08 20:46:59 +03:00
70 lines
1.4 KiB
C++
70 lines
1.4 KiB
C++
/*
|
|
* HypothesisColl.h
|
|
*
|
|
* Created on: 26 Feb 2016
|
|
* Author: hieu
|
|
*/
|
|
#pragma once
|
|
#include <boost/unordered_set.hpp>
|
|
#include "HypothesisBase.h"
|
|
#include "MemPool.h"
|
|
#include "Recycler.h"
|
|
#include "legacy/Util2.h"
|
|
|
|
namespace Moses2 {
|
|
|
|
class ManagerBase;
|
|
|
|
typedef Array<const HypothesisBase*> Hypotheses;
|
|
|
|
class HypothesisColl
|
|
{
|
|
public:
|
|
typedef boost::unordered_set<const HypothesisBase*,
|
|
UnorderedComparer<HypothesisBase>,
|
|
UnorderedComparer<HypothesisBase>,
|
|
MemPoolAllocator<const HypothesisBase*>
|
|
> _HCType;
|
|
|
|
typedef _HCType::iterator iterator;
|
|
typedef _HCType::const_iterator const_iterator;
|
|
//! iterators
|
|
const_iterator begin() const {
|
|
return m_coll.begin();
|
|
}
|
|
const_iterator end() const {
|
|
return m_coll.end();
|
|
}
|
|
|
|
HypothesisColl(const ManagerBase &mgr);
|
|
|
|
StackAdd Add(const HypothesisBase *hypo);
|
|
|
|
_HCType &GetColl()
|
|
{ return m_coll; }
|
|
|
|
const _HCType &GetColl() const
|
|
{ return m_coll; }
|
|
|
|
size_t GetSize() const
|
|
{ return m_coll.size(); }
|
|
|
|
void Clear();
|
|
|
|
Hypotheses &GetSortedAndPruneHypos(const ManagerBase &mgr) const;
|
|
|
|
// for normal pb decoding
|
|
std::vector<const HypothesisBase*> GetBestHyposAndPrune(size_t num, Recycler<HypothesisBase*> &recycler) const;
|
|
std::vector<const HypothesisBase*> GetBestHypos(size_t num) const;
|
|
|
|
protected:
|
|
_HCType m_coll;
|
|
mutable Hypotheses *m_sortedHypos;
|
|
|
|
void SortAndPruneHypos(const ManagerBase &mgr) const;
|
|
|
|
};
|
|
|
|
} /* namespace Moses2 */
|
|
|