vcl/source/window/mnemonicengine.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #include <vcl/mnemonicengine.hxx>
  21
  22 #include <vcl/i18nhelp.hxx>
  23 #include <vcl/svapp.hxx>
  24 #include <vcl/event.hxx>
  25
  26 namespace vcl
  27 {
  28     struct MnemonicEngine_Data
  29     {
  30         IMnemonicEntryList& rEntryList;
  31
  32         MnemonicEngine_Data( IMnemonicEntryList& _rEntryList )
  33             :rEntryList( _rEntryList )
  34         {
  35         }
  36     };
  37
  38     namespace
  39     {
  40         const void* lcl_getEntryForMnemonic( IMnemonicEntryList& _rEntryList, sal_Unicode _cMnemonic, bool& _rbAmbiguous )
  41         {
  42             _rbAmbiguous = false;
  43
  44             const vcl::I18nHelper& rI18nHelper = Application::GetSettings().GetUILocaleI18nHelper();
  45
  46             String sEntryText;
  47             const void* pSearchEntry = _rEntryList.FirstSearchEntry( sEntryText );
  48
  49             const void* pFirstFoundEntry = NULL;
  50             bool bCheckingAmbiguity = false;
  51             const void* pStartedWith = pSearchEntry;
  52             while ( pSearchEntry )
  53             {
  54                 if ( rI18nHelper.MatchMnemonic( sEntryText, _cMnemonic ) )
  55                 {
  56                     if ( bCheckingAmbiguity )
  57                     {
  58                         // that's the second (at least) entry with this mnemonic
  59                         _rbAmbiguous = true;
  60                         return pFirstFoundEntry;
  61                     }
  62
  63                     pFirstFoundEntry = pSearchEntry;
  64                     bCheckingAmbiguity = true;
  65                 }
  66
  67                 pSearchEntry = _rEntryList.NextSearchEntry( pSearchEntry, sEntryText );
  68                 if ( pSearchEntry == pStartedWith )
  69                     break;
  70             }
  71
  72             return pFirstFoundEntry;
  73         }
  74     }
  75
  76     MnemonicEngine::MnemonicEngine( IMnemonicEntryList& _rEntryList )
  77         :m_pData( new MnemonicEngine_Data( _rEntryList ) )
  78     {
  79     }
  80
  81     bool MnemonicEngine::HandleKeyEvent( const KeyEvent& _rKEvt )
  82     {
  83         sal_Bool bAccelKey = _rKEvt.GetKeyCode().IsMod2();
  84         if ( !bAccelKey )
  85             return false;
  86
  87         sal_Unicode cChar = _rKEvt.GetCharCode();
  88         bool bAmbiguous = false;
  89         const void* pEntry = lcl_getEntryForMnemonic( m_pData->rEntryList, cChar, bAmbiguous );
  90         if ( !pEntry )
  91             return false;
  92
  93         m_pData->rEntryList.SelectSearchEntry( pEntry );
  94         if ( !bAmbiguous )
  95             m_pData->rEntryList.ExecuteSearchEntry( pEntry );
  96
  97         // handled
  98         return true;
  99     }
 100
 101     MnemonicEngine::~MnemonicEngine()
 102     {
 103     }
 104
 105 } // namespace vcl
 106
 107 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */