-
Notifications
You must be signed in to change notification settings - Fork 8
/
Keys.cpp
65 lines (58 loc) · 1.47 KB
/
Keys.cpp
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
/*
* This file is part of hid_mapper.
*
* hid_mapper 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 3 of the License, or
* (at your option) any later version.
*
* hid_mapper 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 hid_mapper. If not, see <http://www.gnu.org/licenses/>.
*
* Author: Thibault Kummer <[email protected]>
* Sylvain Leroux <[email protected]>
*/
#include <Keys.h>
#include <keys_definition.h>
#include <string.h>
int Keys::Lookup(const char *key_name)
{
int cmp,begin,middle,end;
begin = 0;
end = keys_array_size-1;
do
{
middle = (end+begin)/2;
cmp = strcmp(keys_char[middle],key_name);
if(cmp==0)
return keys_int[middle];
if(cmp<0)
begin=middle+1;
else
end=middle-1;
}while(begin<=end);
return -1;
}
const char* Keys::ReverseLookup(int key_int)
{
// linear search...
for(int i = 0; i < keys_array_size; ++i)
{
if (keys_int[i] == key_int)
return keys_char[i];
}
return NULL;
}
int Keys::GetMaxKey(void)
{
int max = keys_int[0];
for(int i=1;i<keys_array_size;i++)
if(keys_int[i]>max)
max = keys_int[i];
return max;
}