Find closest key further

The previous limit was checking d-1 and d+1, the new limit also tries
d-2 and d+2.
This commit is contained in:
Jules Aguillon 2022-05-08 16:56:34 +02:00
parent 82d3290c6a
commit 121a2ba76f

View File

@ -155,7 +155,7 @@ public final class Pointers implements Handler.Callback
if (direction == 0) if (direction == 0)
return _handler.modifyKey(ptr.key.key0, ptr.modifier_flags); return _handler.modifyKey(ptr.key.key0, ptr.modifier_flags);
KeyValue k; KeyValue k;
for (int i = 0; i > -2; i = (~i>>31) - i) for (int i = 0; i > -3; i = (~i>>31) - i)
{ {
int d = Math.floorMod(direction + i - 1, 8) + 1; int d = Math.floorMod(direction + i - 1, 8) + 1;
// Don't make the difference between a key that doesn't exist and a key // Don't make the difference between a key that doesn't exist and a key