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
|
/* -*- 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 <accel.h>
#include <vcl/accel.hxx>
#include <accmgr.hxx>
#include <algorithm>
ImplAccelManager::~ImplAccelManager()
{
}
bool ImplAccelManager::InsertAccel( Accelerator* pAccel )
{
if ( !mpAccelList ) {
mpAccelList.reset( new std::vector< Accelerator* > );
} else {
for (Accelerator* i : *mpAccelList) {
if ( i == pAccel ) {
return false;
}
}
}
mpAccelList->insert( mpAccelList->begin(), pAccel );
return true;
}
void ImplAccelManager::RemoveAccel( Accelerator const * pAccel )
{
// do we have a list ?
if ( !mpAccelList )
return;
//e.g. #i90599#. Someone starts typing a sequence in a dialog, but doesn't
//end it, and then closes the dialog, deleting the accelerators. So if
//we're removing an accelerator that a sub-accelerator which is in the
//sequence list, throw away the entire sequence
if ( mpSequenceList ) {
for (sal_uInt16 i = 0; i < pAccel->GetItemCount(); ++i) {
Accelerator* pSubAccel = pAccel->GetAccel( pAccel->GetItemId(i) );
for (Accelerator* j : *mpSequenceList) {
if ( j == pSubAccel ) {
EndSequence();
i = pAccel->GetItemCount();
break;
}
}
}
}
// throw it away
auto it = std::find(mpAccelList->begin(), mpAccelList->end(), pAccel);
if (it != mpAccelList->end())
mpAccelList->erase( it );
}
void ImplAccelManager::EndSequence()
{
// are we in a list ?
if ( !mpSequenceList )
return;
for (Accelerator* pTempAccel : *mpSequenceList)
{
pTempAccel->mpDel = nullptr;
}
// delete sequence-list
mpSequenceList.reset();
}
bool ImplAccelManager::IsAccelKey( const vcl::KeyCode& rKeyCode )
{
Accelerator* pAccel;
// do we have accelerators ??
if ( !mpAccelList )
return false;
if ( mpAccelList->empty() )
return false;
// are we in a sequence ?
if ( mpSequenceList )
{
pAccel = mpSequenceList->empty() ? nullptr : (*mpSequenceList)[ 0 ];
// not found ?
if ( !pAccel )
{
// abort sequence
FlushAccel();
return false;
}
// can the entry be found ?
ImplAccelEntry* pEntry = pAccel->ImplGetAccelData( rKeyCode );
if ( pEntry )
{
Accelerator* pNextAccel = pEntry->mpAccel;
// is an accelerator coupled ?
if ( pNextAccel )
{
mpSequenceList->insert( mpSequenceList->begin(), pNextAccel );
// call Activate-Handler of the new one
pNextAccel->Activate();
return true;
}
else
{
// it is there already !
if ( pEntry->mbEnabled )
{
// stop sequence (first call deactivate-handler)
EndSequence();
// set accelerator of the actual item
// and call the handler
bool bDel = false;
pAccel->mnCurId = pEntry->mnId;
pAccel->mpDel = &bDel;
pAccel->Select();
// did the accelerator survive the call
if ( !bDel )
{
pAccel->mnCurId = 0;
pAccel->mpDel = nullptr;
}
return true;
}
else
{
// stop sequence as the accelerator was disabled
// transfer the key (to the system)
FlushAccel();
return false;
}
}
}
else
{
// wrong key => stop sequence
FlushAccel();
return false;
}
}
// step through the list of accelerators
for (Accelerator* i : *mpAccelList)
{
pAccel = i;
// is the entry contained ?
ImplAccelEntry* pEntry = pAccel->ImplGetAccelData( rKeyCode );
if ( pEntry )
{
Accelerator* pNextAccel = pEntry->mpAccel;
// is an accelerator assigned ?
if ( pNextAccel )
{
// create sequence list
mpSequenceList.reset( new std::vector< Accelerator* > );
mpSequenceList->insert( mpSequenceList->begin(), pAccel );
mpSequenceList->insert( mpSequenceList->begin(), pNextAccel );
// call activate-Handler of the new one
pNextAccel->Activate();
return true;
}
else
{
// already assigned !
if ( pEntry->mbEnabled )
{
// first call activate/deactivate-Handler
pAccel->Activate();
// define accelerator of the actual item
// and call the handler
bool bDel = false;
pAccel->mnCurId = pEntry->mnId;
pAccel->mpDel = &bDel;
pAccel->Select();
// if the accelerator did survive the call
if ( !bDel )
{
pAccel->mnCurId = 0;
pAccel->mpDel = nullptr;
}
return true;
}
else
return false;
}
}
}
return false;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
