blob: fce1a76df1ff73083de4b16638c1863432c2a627 (
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/* -*- 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 <vcl/mnemonicengine.hxx>
#include <vcl/i18nhelp.hxx>
#include <vcl/svapp.hxx>
#include <vcl/event.hxx>
namespace vcl
{
struct MnemonicEngine_Data
{
IMnemonicEntryList& rEntryList;
MnemonicEngine_Data( IMnemonicEntryList& _rEntryList )
:rEntryList( _rEntryList )
{
}
};
namespace
{
const void* lcl_getEntryForMnemonic( IMnemonicEntryList& _rEntryList, sal_Unicode _cMnemonic, bool& _rbAmbiguous )
{
_rbAmbiguous = false;
const vcl::I18nHelper& rI18nHelper = Application::GetSettings().GetUILocaleI18nHelper();
OUString sEntryText;
const void* pSearchEntry = _rEntryList.FirstSearchEntry( sEntryText );
const void* pFirstFoundEntry = NULL;
bool bCheckingAmbiguity = false;
const void* pStartedWith = pSearchEntry;
while ( pSearchEntry )
{
if ( rI18nHelper.MatchMnemonic( sEntryText, _cMnemonic ) )
{
if ( bCheckingAmbiguity )
{
// that's the second (at least) entry with this mnemonic
_rbAmbiguous = true;
return pFirstFoundEntry;
}
pFirstFoundEntry = pSearchEntry;
bCheckingAmbiguity = true;
}
pSearchEntry = _rEntryList.NextSearchEntry( pSearchEntry, sEntryText );
if ( pSearchEntry == pStartedWith )
break;
}
return pFirstFoundEntry;
}
}
MnemonicEngine::MnemonicEngine( IMnemonicEntryList& _rEntryList )
:m_pData( new MnemonicEngine_Data( _rEntryList ) )
{
}
bool MnemonicEngine::HandleKeyEvent( const KeyEvent& _rKEvt )
{
sal_Bool bAccelKey = _rKEvt.GetKeyCode().IsMod2();
if ( !bAccelKey )
return false;
sal_Unicode cChar = _rKEvt.GetCharCode();
bool bAmbiguous = false;
const void* pEntry = lcl_getEntryForMnemonic( m_pData->rEntryList, cChar, bAmbiguous );
if ( !pEntry )
return false;
m_pData->rEntryList.SelectSearchEntry( pEntry );
if ( !bAmbiguous )
m_pData->rEntryList.ExecuteSearchEntry( pEntry );
// handled
return true;
}
MnemonicEngine::~MnemonicEngine()
{
}
} // namespace vcl
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
