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
80
81
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 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
***********************************************************************/
#pragma once
#include "ChartCellLabel.h"
#include "NonTerminal.h"
#include <boost/functional/hash.hpp>
#include <boost/unordered_map.hpp>
#include <boost/version.hpp>
namespace Moses
{
class ChartHypothesisCollection;
/** @todo I have no idea what's in here
*/
class ChartCellLabelSet
{
private:
#if defined(BOOST_VERSION) && (BOOST_VERSION >= 104200)
typedef boost::unordered_map<Word, ChartCellLabel,
NonTerminalHasher, NonTerminalEqualityPred
> MapType;
#else
typedef std::map<Word, ChartCellLabel> MapType;
#endif
public:
typedef MapType::const_iterator const_iterator;
ChartCellLabelSet(const WordsRange &coverage) : m_coverage(coverage) {}
const_iterator begin() const { return m_map.begin(); }
const_iterator end() const { return m_map.end(); }
void AddWord(const Word &w)
{
m_map.insert(std::make_pair(w, ChartCellLabel(m_coverage, w)));
}
void AddConstituent(const Word &w, const ChartHypothesisCollection &coll)
{
const HypoList *stack = &(coll.GetSortedHypotheses());
m_map.insert(std::make_pair(w, ChartCellLabel(m_coverage, w, stack)));
}
bool Empty() const { return m_map.empty(); }
size_t GetSize() const { return m_map.size(); }
const ChartCellLabel *Find(const Word &w) const
{
MapType::const_iterator p = m_map.find(w);
return p == m_map.end() ? 0 : &(p->second);
}
private:
const WordsRange &m_coverage;
MapType m_map;
};
}
|
