blob: 5b552bd53e49779c1d7c77bfcf280798bde141de (
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
|
// $Id$
/***********************************************************************
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
***********************************************************************/
#include "PhraseDictionaryNode.h"
#include "TargetPhrase.h"
#include "PhraseDictionaryMemory.h"
namespace Moses
{
PhraseDictionaryNode::~PhraseDictionaryNode()
{
delete m_targetPhraseCollection;
}
void PhraseDictionaryNode::Sort(size_t tableLimit)
{
// recusively sort
NodeMap::iterator iter;
for (iter = m_map.begin() ; iter != m_map.end() ; ++iter) {
iter->second.Sort(tableLimit);
}
// sort TargetPhraseCollection in this node
if (m_targetPhraseCollection != NULL)
m_targetPhraseCollection->NthElement(tableLimit);
}
PhraseDictionaryNode *PhraseDictionaryNode::GetOrCreateChild(const Word &word)
{
NodeMap::iterator iter = m_map.find(word);
if (iter != m_map.end())
return &iter->second; // found it
// can't find node. create a new 1
return &(m_map[word] = PhraseDictionaryNode());
}
const PhraseDictionaryNode *PhraseDictionaryNode::GetChild(const Word &word) const
{
NodeMap::const_iterator iter = m_map.find(word);
if (iter != m_map.end())
return &iter->second; // found it
// don't return anything
return NULL;
}
}
|
