blob: 95ae48b0e18374f7a8674e06ab3e6b245ec42845 (
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
// $Id$
// vim:tabstop=2
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 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
***********************************************************************/
#ifndef moses_PhraseDictionaryNode_h
#define moses_PhraseDictionaryNode_h
#include <map>
#include <vector>
#include <iterator>
#include "Word.h"
#include "TargetPhraseCollection.h"
namespace Moses
{
class PhraseDictionaryMemory;
class PhraseDictionaryFeature;
/** One node of the PhraseDictionaryMemory structure
*/
class PhraseDictionaryNode
{
typedef std::map<Word, PhraseDictionaryNode> NodeMap;
// only these classes are allowed to instantiate this class
friend class PhraseDictionaryMemory;
friend class std::map<Word, PhraseDictionaryNode>;
protected:
NodeMap m_map;
TargetPhraseCollection *m_targetPhraseCollection;
PhraseDictionaryNode()
:m_targetPhraseCollection(NULL)
{}
public:
~PhraseDictionaryNode();
void Sort(size_t tableLimit);
PhraseDictionaryNode *GetOrCreateChild(const Word &word);
const PhraseDictionaryNode *GetChild(const Word &word) const;
const TargetPhraseCollection *GetTargetPhraseCollection() const {
return m_targetPhraseCollection;
}
TargetPhraseCollection *CreateTargetPhraseCollection() {
if (m_targetPhraseCollection == NULL)
m_targetPhraseCollection = new TargetPhraseCollection();
return m_targetPhraseCollection;
}
// iterators
typedef NodeMap::iterator iterator;
typedef NodeMap::const_iterator const_iterator;
const_iterator begin() const {
return m_map.begin();
}
const_iterator end() const {
return m_map.end();
}
iterator begin() {
return m_map.begin();
}
iterator end() {
return m_map.end();
}
};
}
#endif
|