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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <editeng/LatinLookupTree.hxx>
#include <editeng/LatinTreeNode.hxx>
LatinLookupTree::LatinLookupTree(OUString sLanguage) :
LookupTree( sLanguage )
{
for ( sal_Unicode i = 0; i < 52; ++i )
{
m_pLeaves[i] = NULL;
}
}
LatinLookupTree::~LatinLookupTree()
{
freeMemory();
}
void LatinLookupTree::returnToRoot()
{
if ( m_pCurrent == m_pHead )
return;
// If there is no entry in this node or the tree that sprouts from it.
if ( m_pCurrent &&
m_pCurrent->m_pParent &&
!m_pCurrent->m_nChildren &&
!m_pCurrent->m_nKeyProbability )
{
m_pCurrent->m_pParent->childHasChanged( m_pCurrent, 0, true );
}
m_pCurrent = m_pHead;
}
void LatinLookupTree::gotoNode(OUString sNode)
{
returnToRoot();
// walk down the tree...
for ( int i = 0; i < sNode.getLength(); i++ )
{
m_pCurrent = m_pCurrent->advanceKey( sNode[i] );
}
}
void LatinLookupTree::advance(const sal_Unicode cKey)
{
m_pCurrent = m_pCurrent->advanceKey( cKey );
}
void LatinLookupTree::goBack()
{
if ( m_pCurrent->m_pParent ) // if we're not at the root
{
const Node* const pChild = m_pCurrent;
m_pCurrent = m_pCurrent->m_pParent; // set focus to parent
// if this is an unused tree leaf
if ( !pChild->m_nChildren && !pChild->m_nKeyProbability )
{
m_pCurrent->removeChild( m_pCurrent->getChildRef( pChild->m_cKey ) );
}
}
}
void LatinLookupTree::insert(OUString sKey, const int nProbability)
{
if ( !sKey.isEmpty() && nProbability > 0 )
{
insertKey( sKey, nProbability );
}
}
void LatinLookupTree::insert(const int nProbability)
{
if ( m_pCurrent == this )
return;
// change probability
int proba = m_pCurrent->m_nKeyProbability += nProbability;
// inform his parent
m_pCurrent->m_pParent->childHasChanged( m_pCurrent, proba );
}
void LatinLookupTree::remove(OUString sKey)
{
returnToRoot();
if ( !sKey.isEmpty() )
{
removeKey( sKey );
}
}
OUString LatinLookupTree::suggestAutoCompletion() const
{
if ( !m_pCurrent )
return OUString();
Node* pWalker = m_pCurrent;
int distance = 0, nTargetProbability = 0;
OUString sSuggestion;
while ( pWalker->m_pSuggest && ( distance < 2 ||
// Make sure the suggestion is at least 2 chars long.
nTargetProbability == pWalker->m_nHighestProbaInSubtree ) )
{
if ( distance < 2 )
nTargetProbability = pWalker->m_nHighestProbaInSubtree;
// follow the tree along the suggested route
pWalker = pWalker->m_pSuggest;
++distance;
sSuggestion += OUString(pWalker->m_cKey);
}
return sSuggestion;
}
void LatinLookupTree::clear()
{
freeMemory();
}
bool LatinLookupTree::isSeparatedlyHandled(const sal_Unicode cKey) const
{
return
( cKey >= 'a' && cKey <= 'z' )
|| ( cKey >= 'A' && cKey <= 'Z' );
}
Node*& LatinLookupTree::getChildRef(const sal_Unicode cKey, bool bCreatePlaceholder)
{
int pos = -1;
// determine position in array if possible
if ( cKey >= 'a' && cKey <= 'z' )
{
pos = cKey - our_nLowerCaseA;
}
else if ( cKey >= 'A' && cKey <= 'Z' )
{
pos = cKey - our_nUpperCaseA + 26;
}
if ( pos != -1 )
{
return m_pLeaves[pos];
}
else
{
for ( std::list<Node*>::iterator i = m_lChildren.begin(); i != m_lChildren.end(); ++i )
{
if ( (*i)->m_cKey == cKey )
{
return *i;
}
}
if ( bCreatePlaceholder )
{
// Create new entry in case there isn't one.
m_lChildren.push_back( NULL );
return *(--m_lChildren.end());
}
else
{
return our_pNodeNullPointer;
}
}
}
void LatinLookupTree::evaluateSeparateStorage(int& nSuggest, Node*& pSuggest) const
{
for ( sal_Unicode i = 0; i < 52; ++i )
{
if ( m_pLeaves[i] )
{
if ( m_pLeaves[i]->m_nHighestProbaInSubtree > nSuggest )
{
nSuggest = m_pLeaves[i]->m_nHighestProbaInSubtree;
pSuggest = m_pLeaves[i];
}
if ( m_pLeaves[i]->m_nKeyProbability > nSuggest )
{
nSuggest = m_pLeaves[i]->m_nKeyProbability;
pSuggest = m_pLeaves[i];
}
}
}
}
void LatinLookupTree::freeMemory()
{
// remove nodes from array
for ( sal_Unicode i = 0; i < 52; ++i )
{
if ( m_pLeaves[i] )
{
m_pLeaves[i]->freeMemory();
delete m_pLeaves[i];
m_pLeaves[i] = NULL;
}
}
// clear list
while ( m_lChildren.size() )
{
Node* pTmp = m_lChildren.front();
m_lChildren.pop_front();
delete pTmp;
}
}
Node* LatinLookupTree::newNode(Node* pParent, const sal_Unicode cKey, const int nProbability)
{
return new LatinTreeNode( this, pParent, cKey, nProbability );
}
const unsigned int LatinLookupTree::our_nLowerCaseA = 97;
const unsigned int LatinLookupTree::our_nUpperCaseA = 65;
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
