blob: 06ca54a576f770fb481ddaa8c126f22bd2b60ba1 (
plain)
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
|
/*
* Stack.h
*
* Created on: 24 Oct 2015
* Author: hieu
*/
#pragma once
#include <boost/unordered_map.hpp>
#include <deque>
#include "../Hypothesis.h"
#include "../../TypeDef.h"
#include "../../Vector.h"
#include "../../MemPool.h"
#include "../../Recycler.h"
#include "../../legacy/Util2.h"
namespace Moses2
{
class Manager;
namespace NSCubePruningCardinalStack
{
typedef Vector<const Hypothesis*> Hypotheses;
/////////////////////////////////////////////
class Stack
{
protected:
typedef std::unordered_set<const Hypothesis*,
UnorderedComparer<Hypothesis>,
UnorderedComparer<Hypothesis>
> _HCType;
public:
typedef std::pair<const Bitmap*, size_t> HypoCoverage;
typedef boost::unordered_map<HypoCoverage, Hypotheses*> SortedHypos;
Stack(const Manager &mgr);
virtual ~Stack();
size_t GetHypoSize() const;
_HCType &GetColl() {
return m_coll;
}
const _HCType &GetColl() const {
return m_coll;
}
void Add(const Hypothesis *hypo, Recycler<Hypothesis*> &hypoRecycle);
std::vector<const Hypothesis*> GetBestHypos(size_t num) const;
void Clear();
SortedHypos GetSortedAndPruneHypos(const Manager &mgr) const;
void SortAndPruneHypos(const Manager &mgr, Hypotheses &hypos) const;
protected:
const Manager &m_mgr;
_HCType m_coll;
};
}
}
|
