thdltools/Jskad
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Fixes bug 624133, "Input freezes after impossible character". Try 'shsM' in

Browse source 
ACIP or 'ShSm' in Extended Wylie to see the new behavior.

We use a trie to store valid input sequences.  In the future, we could use
the same trie as a replacement for the more inefficient HashSets we use to
store characters, vowels, and punctuation.  For example, we'd use
'validInputSequences.put("K", new Pair("consonant", "k"))' when reading
in the ACIP keyboard's description of the first consonant of the Tibetan
alphabet in 'TibetanKeyboard.java'.

Note that the current trie implementation is only useful for 7- or 8-bit
transcription systems, and works best for tries with low average depth, which
describes a transcription system's trie very well.  If you used arbitrary
Unicode in your keyboard, you'd need a different trie implementation.

Improved the optional keyboard input mode status messages.
This commit is contained in:
dchandler 2002-11-02 18:44:24 +00:00
parent 92fd1bf0b6
commit de6ae79959
4 changed files with 183 additions and 38 deletions
Download patch file Download diff file Expand all files Collapse all files

26
source/org/thdl/util/Trie.java
View file

@ -81,6 +81,8 @@ Contributor(s): ______________________________________.
package org.thdl.util;
import org.thdl.util.ThdlDebug;
/**
* A digital search trie for 7-bit ASCII text. The API is a subset of
* java.util.Hashtable. The key must be a 7-bit ASCII string. The
@ -102,6 +104,9 @@ public class Trie
m_Root = new Node();
}
private static final boolean caseInsensitive = false;
/**
* Puts an object into the trie for lookup.
*
@ -120,7 +125,10 @@ public class Trie
for (int i = 0; i < len; i++)
{
Node nextNode = node.m_nextChar[Character.toUpperCase(key.charAt(i))];
Node nextNode
= node.m_nextChar[(caseInsensitive
? Character.toUpperCase(key.charAt(i))
: key.charAt(i))];
if (nextNode != null)
{
@ -132,7 +140,9 @@ public class Trie
{
Node newNode = new Node();
node.m_nextChar[Character.toUpperCase(key.charAt(i))] = newNode;
node.m_nextChar[(caseInsensitive
? Character.toUpperCase(key.charAt(i))
: key.charAt(i))] = newNode;
node.m_isLeaf = false;
node = newNode;
}
@ -165,13 +175,17 @@ public class Trie
{
try
{
node = node.m_nextChar[Character.toUpperCase(key.charAt(i))];
node = node.m_nextChar[(caseInsensitive
? Character.toUpperCase(key.charAt(i))
: key.charAt(i))];
}
catch (ArrayIndexOutOfBoundsException e)
{
// the key is not 7-bit ASCII so we won't find it here
node = null;
ThdlDebug.noteIffyCode();
}
if (node == null)
@ -204,13 +218,17 @@ public class Trie
{
try
{
node = node.m_nextChar[Character.toUpperCase(key.charAt(i))];
node = node.m_nextChar[(caseInsensitive
? Character.toUpperCase(key.charAt(i))
: key.charAt(i))];
}
catch (ArrayIndexOutOfBoundsException e)
{
// the key is not 7-bit ASCII so we won't find it here
node = null;
ThdlDebug.noteIffyCode();
}
if (node == null)