So each key pressed to type a sentence in the editor has to go through the keybinding search?

AFAICT yes.

Couldn't it be implemented as a jump table? So it would take constant time to locate the correct response?

There are 2^21 Unicode code points multiplied by 2^(the number of modifiers), so no.

A hash table might possibly be a solution, just "somebody" has to do it and make sure all the special cases in this are covered.

—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub, or unsubscribe.
Triage notifications on the go with GitHub Mobile for iOS or Android.