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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
|
/* -*- 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 <sal/log.hxx>
#include <osl/diagnose.h>
#include <accel.hxx>
#define ACCELENTRY_NOTFOUND (sal_uInt16(0xFFFF))
static sal_uInt16 ImplAccelEntryGetIndex( const ImplAccelList* pList, sal_uInt16 nId,
sal_uInt16* pIndex = nullptr )
{
size_t nLow;
size_t nHigh;
size_t nMid;
size_t nCount = pList->size();
sal_uInt16 nCompareId;
// check if first key is larger then the key to compare
if ( !nCount || (nId < (*pList)[ 0 ]->mnId) )
{
if ( pIndex )
*pIndex = 0;
return ACCELENTRY_NOTFOUND;
}
// Binary search
nLow = 0;
nHigh = nCount-1;
do
{
nMid = (nLow + nHigh) / 2;
nCompareId = (*pList)[ nMid ]->mnId;
if ( nId < nCompareId )
nHigh = nMid-1;
else
{
if ( nId > nCompareId )
nLow = nMid + 1;
else
return static_cast<sal_uInt16>(nMid);
}
}
while ( nLow <= nHigh );
if ( pIndex )
{
if ( nId > nCompareId )
*pIndex = static_cast<sal_uInt16>(nMid+1);
else
*pIndex = static_cast<sal_uInt16>(nMid);
}
return ACCELENTRY_NOTFOUND;
}
static void ImplAccelEntryInsert( ImplAccelList* pList, std::unique_ptr<ImplAccelEntry> pEntry )
{
sal_uInt16 nInsIndex(0);
std::vector<ImplAccelEntry *>::size_type nIndex = ImplAccelEntryGetIndex( pList, pEntry->mnId, &nInsIndex );
if ( nIndex != ACCELENTRY_NOTFOUND )
{
do
{
nIndex++;
ImplAccelEntry* pTempEntry = nullptr;
if ( nIndex < pList->size() )
pTempEntry = (*pList)[ nIndex ].get();
if ( !pTempEntry || (pTempEntry->mnId != pEntry->mnId) )
break;
}
while ( nIndex < pList->size() );
if ( nIndex < pList->size() ) {
pList->insert( pList->begin() + nIndex, std::move(pEntry) );
} else {
pList->push_back( std::move(pEntry) );
}
}
else {
if ( nInsIndex < pList->size() ) {
pList->insert( pList->begin() + nInsIndex, std::move(pEntry) );
} else {
pList->push_back( std::move(pEntry) );
}
}
}
void Accelerator::ImplInit()
{
mnCurId = 0;
mpDel = nullptr;
}
ImplAccelEntry* Accelerator::ImplGetAccelData( const vcl::KeyCode& rKeyCode ) const
{
auto it = maKeyMap.find( rKeyCode.GetFullCode() );
if( it != maKeyMap.end() )
return it->second;
else
return nullptr;
}
void Accelerator::ImplCopyData( const Accelerator& rAccelData )
{
// copy table
for (const std::unique_ptr<ImplAccelEntry>& i : rAccelData.maIdList)
{
std::unique_ptr<ImplAccelEntry> pEntry(new ImplAccelEntry( *i ));
// sequence accelerator, then copy also
if ( pEntry->mpAccel )
{
pEntry->mpAccel = new Accelerator( *(pEntry->mpAccel) );
pEntry->mpAutoAccel = pEntry->mpAccel;
}
else
pEntry->mpAutoAccel = nullptr;
maKeyMap.insert( std::make_pair( pEntry->maKeyCode.GetFullCode(), pEntry.get() ) );
maIdList.push_back( std::move(pEntry) );
}
}
void Accelerator::ImplDeleteData()
{
// delete accelerator-entries using the id-table
for (const std::unique_ptr<ImplAccelEntry>& pEntry : maIdList) {
delete pEntry->mpAutoAccel;
}
maIdList.clear();
}
void Accelerator::ImplInsertAccel( sal_uInt16 nItemId, const vcl::KeyCode& rKeyCode,
bool bEnable, Accelerator* pAutoAccel )
{
SAL_WARN_IF( !nItemId, "vcl", "Accelerator::InsertItem(): ItemId == 0" );
if ( rKeyCode.IsFunction() )
{
sal_uInt16 nCode1;
sal_uInt16 nCode2;
sal_uInt16 nCode3;
sal_uInt16 nCode4;
ImplGetKeyCode( rKeyCode.GetFunction(), nCode1, nCode2, nCode3, nCode4 );
if ( nCode1 )
ImplInsertAccel( nItemId, vcl::KeyCode( nCode1, nCode1 ), bEnable, pAutoAccel );
if ( nCode2 )
{
if ( pAutoAccel )
pAutoAccel = new Accelerator( *pAutoAccel );
ImplInsertAccel( nItemId, vcl::KeyCode( nCode2, nCode2 ), bEnable, pAutoAccel );
if ( nCode3 )
{
if ( pAutoAccel )
pAutoAccel = new Accelerator( *pAutoAccel );
ImplInsertAccel( nItemId, vcl::KeyCode( nCode3, nCode3 ), bEnable, pAutoAccel );
}
}
return;
}
// fetch and fill new entries
std::unique_ptr<ImplAccelEntry> pEntry(new ImplAccelEntry);
pEntry->mnId = nItemId;
pEntry->maKeyCode = rKeyCode;
pEntry->mpAccel = pAutoAccel;
pEntry->mpAutoAccel = pAutoAccel;
pEntry->mbEnabled = bEnable;
// now into the tables
sal_uLong nCode = rKeyCode.GetFullCode();
if ( !nCode )
{
OSL_FAIL( "Accelerator::InsertItem(): KeyCode with KeyCode 0 not allowed" );
}
else if ( !maKeyMap.insert( std::make_pair( nCode, pEntry.get() ) ).second )
{
SAL_WARN( "vcl", "Accelerator::InsertItem(): KeyCode (Key: " << nCode << ") already exists" );
}
else
ImplAccelEntryInsert( &maIdList, std::move(pEntry) );
}
Accelerator::Accelerator()
{
ImplInit();
}
Accelerator::Accelerator(const Accelerator& rAccel)
{
ImplInit();
ImplCopyData(rAccel);
}
Accelerator::~Accelerator()
{
// inform AccelManager about deleting the Accelerator
if ( mpDel )
*mpDel = true;
ImplDeleteData();
}
void Accelerator::Activate()
{
maActivateHdl.Call( *this );
}
void Accelerator::Select()
{
maSelectHdl.Call( *this );
}
void Accelerator::InsertItem( sal_uInt16 nItemId, const vcl::KeyCode& rKeyCode )
{
ImplInsertAccel( nItemId, rKeyCode, true, nullptr );
}
sal_uInt16 Accelerator::GetItemCount() const
{
return static_cast<sal_uInt16>(maIdList.size());
}
sal_uInt16 Accelerator::GetItemId( sal_uInt16 nPos ) const
{
ImplAccelEntry* pEntry = ( nPos < maIdList.size() ) ? maIdList[ nPos ].get() : nullptr;
if ( pEntry )
return pEntry->mnId;
else
return 0;
}
Accelerator* Accelerator::GetAccel( sal_uInt16 nItemId ) const
{
sal_uInt16 nIndex = ImplAccelEntryGetIndex( &maIdList, nItemId );
if ( nIndex != ACCELENTRY_NOTFOUND )
return maIdList[ nIndex ]->mpAccel;
else
return nullptr;
}
Accelerator& Accelerator::operator=( const Accelerator& rAccel )
{
if(this == &rAccel)
return *this;
// assign new data
mnCurId = 0;
// delete and copy tables
ImplDeleteData();
maKeyMap.clear();
ImplCopyData(rAccel);
return *this;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
