n/futokb
1
0
Fork 0
mirror of https://gitlab.futo.org/keyboard/latinime.git synced 2024-09-28 14:54:30 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Make digits and letters same class

Browse Source
This commit is contained in:
Aleksandras Kostarevas 2024-01-11 15:19:09 +02:00
parent 968b39af24
commit 2188a2b03a
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
java/src/org/futo/inputmethod/latin/RichInputConnection.java
View File

@ -1083,10 +1083,9 @@ public final class RichInputConnection implements PrivateCommandPerformer {
} }
private int getCharacterClass(char c) { private int getCharacterClass(char c) {
if(Character.isLetter(c) || c == '_') return 1; if(Character.isLetter(c) || c == '_' || Character.isDigit(c)) return 1;
else if(Character.isDigit(c)) return 2; else if(Character.isWhitespace(c)) return 2;
else if(Character.isWhitespace(c)) return 3; else return 3;
else return 4;
} }
/** /**
@ -1112,7 +1111,7 @@ public final class RichInputConnection implements PrivateCommandPerformer {
} }
// Find the last word boundary // Find the last word boundary
int charClass = getCharacterClass(charsBeforeCursor.charAt(i)); int charClass = i >= 0 ? getCharacterClass(charsBeforeCursor.charAt(i)) : -1;
while (i >= 0 && getCharacterClass(charsBeforeCursor.charAt(i)) == charClass) { while (i >= 0 && getCharacterClass(charsBeforeCursor.charAt(i)) == charClass) {
i--; i--;
steps--; steps--;
@ -1140,7 +1139,7 @@ public final class RichInputConnection implements PrivateCommandPerformer {
} }
// Find the first word boundary // Find the first word boundary
int charClass = getCharacterClass(charsAfterCursor.charAt(i)); int charClass = i < charsAfterCursor.length() ? getCharacterClass(charsAfterCursor.charAt(i)) : -1;
while (i < charsAfterCursor.length() && getCharacterClass(charsAfterCursor.charAt(i)) == charClass) { while (i < charsAfterCursor.length() && getCharacterClass(charsAfterCursor.charAt(i)) == charClass) {
i++; i++;
steps++; steps++;