|
1d5ae226
|
2014-01-11T00:26:58
|
|
makekeys: mark keysym_names as static
Signed-off-by: Ran Benita <ran234@gmail.com>
|
|
0628b9b2
|
2014-01-01T13:01:12
|
|
makekeys: Add a gcc pragma to ignore -Woverlength-strings
|
|
|
eef3ab23
|
2013-07-17T18:56:03
|
|
makekeys: Put a comment describing the origin of the file
|
|
|
68c61e7f
|
2013-07-17T18:07:31
|
|
ks_tables: Put all keysym names in one giant block
This makes the file take two segments instead of potentially many, causing
relocation issues.
|
|
|
938a2c37
|
2013-07-17T17:49:10
|
|
makekeys: Move all of the table generation to Python
This makes it easier to run the Python script manually.
|
|
|
870913c2
|
2013-07-17T17:44:07
|
|
makekeys: Remove some semis
Python doesn't have these
|
|
7b3bd11f
|
2012-10-16T16:05:34
|
|
Add xkb_keysym_from_name() flags argument for case-insensitive search
This adds a flags argument to xkb_keysym_from_name() so we can perform a
case-insensitive search. This should really be supported as many keysyms
have really weird capitalization-rules.
However, as this may produce conflicts, users must be warned to only use
this for fallback paths or error-recovery. This is also the reason why the
internal XKB parsers still use the case-sensitive search.
This also adds some test-cases so the expected results are really
produced. The binary-size does _not_ change with this patch. However,
case-sensitive search may be slightly slower with this patch. But this is
barely measurable.
[ran: use bool instead of int for icase, add a recommendation to the
doc, and test a couple "thorny" cases.]
Signed-off-by: David Herrmann <dh.herrmann@googlemail.com>
|
|
|
5fff637e
|
2012-10-16T16:05:33
|
|
makekeys: replace helper with python script and binary search
This removes the complicated and undocumented hash-table creation-helper
and replaces it with an autogenerated sorted array. The search uses simple
bsearch() now.
We also tried using gperf but it turned out to generate way to big
hashtables and when reducing the size it isn't really faster than
bsearch() anymore.
There are no users complaining about the speed of keysym lookups and we
have no benchmarks that tell that we are horribly slow. Hence, we can
safely use the simpler approach and drop all that old code.
Signed-off-by: Ran Benita <ran234@gmail.com>
Signed-off-by: David Herrmann <dh.herrmann@googlemail.com>
|