summaryrefslogtreecommitdiff
path: root/src/input/inputactionsortfunctor.h
blob: 6884f9c11d780cf2884993cd0f99f59e4334bf5a (plain) (blame)
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
/*
 *  The ManaPlus Client
 *  Copyright (C) 2012-2016  The ManaPlus Developers
 *
 *  This file is part of The ManaPlus Client.
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef INPUT_INPUTACTIONSORTFUNCTOR_H
#define INPUT_INPUTACTIONSORTFUNCTOR_H

#include "logger.h"

#include "input/inputactiondata.h"

#include "localconsts.h"

class InputActionSortFunctor final
{
    public:
        bool operator() (const InputActionT key1,
                         const InputActionT key2) const
        {
            const size_t k1 = CAST_SIZE(key1);
            const size_t k2 = CAST_SIZE(key2);
            if (k1 >= CAST_SIZE(InputAction::TOTAL))
            {
                logger->log("broken key1: %ld", static_cast<long>(k1));
                return false;
            }
            if (k2 >= CAST_SIZE(InputAction::TOTAL))
            {
                logger->log("broken key2: %ld", static_cast<long>(k2));
                return false;
            }
            return keys[k1].priority >= keys[k2].priority;
        }

        const InputActionData *keys A_NONNULLPOINTER;
};

#endif  // INPUT_INPUTACTIONSORTFUNCTOR_H