Decide on best sort-order

[urob]

For now sequences are looked up in the order provided by the user. According to my testing, this beats the the original PR's performance, mainly due to how we filter down and track the state of candidate sequences between key presses.

Nevertheless, it may be worthwhile creating a sorted pointer array in data during initialization.

• Sort by sequence length for small performance boost
• Reverse-sort identical keycodes by modifiers so if both LS(A) and A are specified we first test for the former
• Sort by usage page and keycodes and abort lookup if we exceed the current press? This speeds up termination on failed lookups but is otherwise somewhat arbitrary