optimize evdev mappings lookup

[nots1dd]

Just creating this issue instead of a direct PR as I am not sure how the contribution guide is for this repo.

The evdev mappings is using match which is not the most optimized way to lookup (BTree is O(logn)) using a HashMap would be better with faster insertion and deletion times (O(1)).

Let me know if I can contribute to this repository!

[lavafroth]

Hello! Yes, we could go either the hashmap route or use a perfect hash function, see the phf crate. I doubt that it's going to make any noticeable performance improvements but feel free to follow up with a PR. Thanks again for raising the issue!

[nots1dd]

Hello! Yes, we could go either the hashmap route or use a perfect hash function, see the phf crate.

I doubt that it's going to make any noticeable performance improvements but feel free to follow up with a PR.

Thanks again for raising the issue!

Yea I agree, for the size of the keymap currently it should be negligible, but it would make the codebase a bit better

And if this repository in the future has to account for other keymap formats / languages, the table will just get bigger in the future so I suppose it is better to optimize the mappings.

[lavafroth]

closed via #5