-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathkbd-adjacency.cpp
170 lines (147 loc) · 5.12 KB
/
kbd-adjacency.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
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
160
161
162
163
164
165
166
167
168
169
170
#include <iostream>
#include <functional>
#include <map>
#include <vector>
#include <initializer_list>
#include <algorithm>
#include <cstring>
#include <locale>
#include <iterator>
#include <unordered_set>
//-----------------------------------------------------------------------------
namespace std {
const char*
begin(const char* s) {
return s;
}
const char*
end(const char* s) {
return begin(s) + std::str_len(s);
}
} // namespace std
//-----------------------------------------------------------------------------
typedef std::vector<char> char_v;
typedef std::map<char, char_v> adjacency_t;
template <class Range>
char_v
range_to_v(Range r) {
char_v v;
std::copy(std::begin(r), std::end(r), std::back_inserter(v));
return v;
}
template <class T>
std::vector<T>
range_to_v(std::initializer_list<T> il) {
std::vector<T> v;
std::copy(std::begin(il), std::end(il), std::back_inserter(v));
return v;
}
//-----------------------------------------------------------------------------
template <class Char, class Container>
typename std::enable_if<std::is_same<Char, typename Container::value_type>::value, std::basic_ostream<Char>&>::type
operator<<(std::basic_ostream<Char>& os, const Container& vc) {
std::copy(vc.begin(), vc.end(), std::ostream_iterator<Char>(std::cout, ""));
return os;
}
//-----------------------------------------------------------------------------
template <class Map>
void
dump_map(const Map& m) {
for(auto& kv : m) {
std::cout << "m['" << kv.first << "'] = \"" << kv.second << "\"" << std::endl;
}
}
//-----------------------------------------------------------------------------
template <class Char>
std::unordered_set<Char>
collect_chars(const std::map<Char, std::vector<Char>>& m) {
std::unordered_set<Char> r;
for(auto& kv : m) {
r.insert(kv.first);
for(auto& ch : kv.second) {
r.insert(ch);
}
}
/*for(auto& kv : m) {
r.insert(kv.first);
}*/
return r;
}
//-----------------------------------------------------------------------------
static adjacency_t
make_adjacency_matrix() {
adjacency_t m;
m['1'] = m['+'] = range_to_v("§°2\"qQ");
m['2'] = m['"'] = range_to_v("1+3*wWqQ");
m['3'] = m['*'] = range_to_v("2\"4çeE¿wW");
m['4'] = m['ç'] = range_to_v("3*5%rReE¿");
m['5'] = m['%'] = range_to_v("4ç6&tTrR");
m['6'] = m['&'] = range_to_v("5%7/zZtT");
m['7'] = m['/'] = range_to_v("6&8(uUzZ");
m['8'] = m['('] = range_to_v("7/9)iIuU");
m['9'] = m[')'] = range_to_v("8(0=oOiI");
m['0'] = m['='] = range_to_v("9)'?pPoO");
m['\''] = m['?'] = range_to_v("0=üèpP");
m['^'] = m['`'] = range_to_v("'?üè");
// m['"'] = m['!'] = range_to_v("'üè$£äà");
m['q'] = m['Q'] = range_to_v({'1', '2', 'w', 'W', 'A', 'a'});
m['w'] = m['W'] = range_to_v({'q', 'Q', '2', '3', 'e', 'E', 's', 'S', 'a', 'A'});
m['e'] = m['E'] = range_to_v({'q', 'Q', '2', '3', 'e', 'E', 's', 'S', 'a', 'A'});
m['r'] = m['R'] = range_to_v("eE45tTfFdD");
m['t'] = m['T'] = range_to_v("rR56zZgGfF");
m['z'] = m['Z'] = range_to_v("tT67uUhHgG");
m['u'] = m['U'] = range_to_v("zZ78iIjJhH");
m['i'] = m['I'] = range_to_v("uU89oOkKjJ");
m['o'] = m['O'] = range_to_v("iI90pPlLkK");
m['p'] = m['P'] = range_to_v("oO0'üèöélL");
m['ü'] = m['è'] = range_to_v("pP'äàöé");
/* m['a'] = m['A'] = range_to_v("qQwWsSyY<>"); */
m['a'] = m['A'] = range_to_v("qQwWsSyY");
m['s'] = m['S'] = range_to_v("aAwWeEdDxXyY");
m['d'] = m['D'] = range_to_v("sSeErRfFcCxX");
m['f'] = m['F'] = range_to_v("dDrRtTgGvVcC");
m['g'] = m['g'] = range_to_v("fFtTzZhHbBvV");
m['h'] = m['H'] = range_to_v("gGzZuUjJnNbB");
m['j'] = m['J'] = range_to_v("hHuUiIkKmMnN");
m['k'] = m['k'] = range_to_v("jJiIoOlL,;mM");
m['l'] = m['L'] = range_to_v("kKoOpPöé.:,;");
m['ö'] = m['é'] = range_to_v("lLpPüèäà-_.:");
m['ä'] = m['à'] = range_to_v("öéüè$£-_");
m['$'] = m['£'] = range_to_v("äà");
m['<'] = m['>'] = range_to_v("aAyY");
m['y'] = m['Y'] = range_to_v("<>aAsSxX");
m['x'] = m['X'] = range_to_v("yYsSdDcC ");
m['c'] = m['C'] = range_to_v("xXdDfFvV ");
m['v'] = m['V'] = range_to_v("cCfFgGbB ");
m['b'] = m['B'] = range_to_v("vVgGhHnN ");
m['n'] = m['N'] = range_to_v("bBhHjJmM ");
m['m'] = m['M'] = range_to_v("nNjJkK,; ");
m[','] = m[';'] = range_to_v("mMkKlL.: ");
m['.'] = m[':'] = range_to_v(",;lLöé-_");
m['-'] = m['_'] = range_to_v(".:öéäà");
return m;
};
using namespace std::placeholders;
template <typename CharT>
std::function<bool(CharT)>
make_predicate(const std::ctype<CharT>& ct, std::ctype_base::mask m) {
return std::bind((bool(std::ctype<CharT>::*)(std::ctype_base::mask, CharT) const) & std::ctype<CharT>::is, &ct, m, _1);
}
int
main() {
using std::copy;
using std::cout;
using std::ctype;
using std::endl;
using std::ostream_iterator;
adjacency_t m = make_adjacency_matrix();
std::locale lc("de_CH.iso88591");
const ctype<char>& ct = std::use_facet<ctype<char>>(lc);
dump_map(m);
auto cl = collect_chars(m);
for(auto mask : {ctype<char>::lower, ctype<char>::upper, ctype<char>::digit, ctype<char>::punct, ctype<char>::graph, ctype<char>::print}) {
copy_if(cl.begin(), cl.end(), ostream_iterator<char>(cout), make_predicate(ct, mask));
cout << endl;
}
return 0;
}