-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmodkeys.hpp
159 lines (137 loc) · 6.64 KB
/
modkeys.hpp
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
/*
The MIT License (MIT)
Copyright (c) 2024 sigma-axis
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#pragma once
#include <cstdint>
#include <cstring>
#include <concepts>
#include <utility>
////////////////////////////////
// Combinations of modifier keys.
////////////////////////////////
struct modkeys {
enum class key : uint8_t {
none = 0,
ctrl = 1 << 0,
shift = 1 << 1,
alt = 1 << 2,
};
using enum key;
constexpr modkeys() : val{} {}
constexpr modkeys(key val) : val{ val } {}
constexpr operator key const& () const { return val; }
constexpr operator key& () { return val; }
constexpr modkeys(bool ctrl, bool shift, bool alt) : val{ from_bools(ctrl, shift, alt) } {}
constexpr modkeys(char const* str, modkeys def) : val{ (parse(str, def), def) } {}
// flag testing functions.
template<std::convertible_to<modkeys>... TArgs>
constexpr bool has_flags_all(TArgs... flags) const {
if constexpr (sizeof...(TArgs) > 0) return val >= (flags | ...);
else return true;
}
template<std::convertible_to<modkeys>... TArgs>
constexpr bool has_flags_any(TArgs... flags) const {
if constexpr (sizeof...(TArgs) > 0) return (val & (flags | ...)) != none;
else return val != none;
}
// an alias of has_flags_any().
template<std::convertible_to<modkeys>... TArgs>
constexpr bool has_flags(TArgs... flags) const { return has_flags_any(flags...); }
// string convertions.
/// <param name="ret">keeps original value unless true is returned.</param>
static constexpr bool parse(char const* str, modkeys& ret);
// returns canonical names for each state of flags.
constexpr char const* canon_name() const;
private:
key val = none;
static constexpr key from_bools(bool ctrl, bool shift, bool alt);
// parsing from strings.
static constexpr bool parse_one(char const* str, key& ret)
{
constexpr auto tolower = [](char c) -> char {
// https://blog.yimmo.org/posts/faster-tolower-in-c.html
// needs to shift one more bit than the reference;
// c = '\xc1' would fail otherwise.
return c ^ ((((0x40 - c) ^ (0x5a - c)) >> 3) & 0x20);
};
// case-insensitve truncated string comparison.
constexpr auto comp = []<size_t N>(char const* s1, char const(&s2)[N]) {
for (size_t i = 0; i < N - 1; i++) {
if (tolower(s1[i]) != s2[i]) return false;
}
return true;
};
if (str[0] == '\0' || comp(str, "none")) ret = none;
else if (comp(str, "ctrl" )) ret = ctrl;
else if (comp(str, "shift")) ret = shift;
else if (comp(str, "alt" )) ret = alt;
else return false;
return true;
}
};
// bitwise operators.
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static modkeys operator&(L l, R r) { return static_cast<modkeys::key>(std::to_underlying(static_cast<modkeys::key>(l)) & std::to_underlying(static_cast<modkeys::key>(r))); }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static modkeys operator|(L l, R r) { return static_cast<modkeys::key>(std::to_underlying(static_cast<modkeys::key>(l)) | std::to_underlying(static_cast<modkeys::key>(r))); }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static modkeys operator^(L l, R r) { return static_cast<modkeys::key>(std::to_underlying(static_cast<modkeys::key>(l)) ^ std::to_underlying(static_cast<modkeys::key>(r))); }
template<std::convertible_to<modkeys::key> K>
constexpr static modkeys operator~(K k) { return static_cast<modkeys::key>(~std::to_underlying(static_cast<modkeys::key>(k))); }
// comparison operators represent the inclusion of sets, regarding modkeys as a set of flags.
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static bool operator<=(L l, R r) { return (l & ~r) == modkeys::none; }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static bool operator<(L l, R r) { return (l != r) && (l <= r); }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static bool operator>=(L l, R r) { return r <= l; }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
constexpr static bool operator>(L l, R r) { return r < l; }
// bitwise assignment operators.
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
requires(std::convertible_to<modkeys::key, L>)
constexpr static L& operator&=(L& l, R r) { return l = static_cast<L>(l & r); }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
requires(std::convertible_to<modkeys::key, L>)
constexpr static L& operator|=(L& l, R r) { return l = static_cast<L>(l | r); }
template<std::convertible_to<modkeys::key> L, std::convertible_to<modkeys::key> R>
requires(std::convertible_to<modkeys::key, L>)
constexpr static L& operator^=(L& l, R r) { return l = static_cast<L>(l ^ r); }
inline constexpr modkeys::key modkeys::from_bools(bool ctrl, bool shift, bool alt)
{
auto ret = none;
if (ctrl) ret |= key::ctrl;
if (shift) ret |= key::shift;
if (alt) ret |= key::alt;
return ret;
}
inline constexpr bool modkeys::parse(char const* str, modkeys& ret)
{
if (str == nullptr) return false;
key val = none;
for (auto p = str - 1; p != nullptr; p = std::strpbrk(p, "+-*/|&:;,")) {
while (*++p == ' ');
if (key k; parse_one(p, k)) val |= k;
else return false;
}
ret = val;
return true;
}
inline constexpr char const* modkeys::canon_name() const
{
switch (val) {
case none: return "none";
case ctrl: return "ctrl";
case shift: return "shift";
case alt: return "alt";
case ctrl | shift: return "ctrl+shift";
case ctrl | alt: return "ctrl+alt";
case shift | alt: return "shift+alt";
case ctrl | shift | alt: return "ctrl+shift+alt";
}
return "";
}