public class MultiTrie2 extends MultiTrie
It stores words and their associated patch commands. The MultiTrie handles patch commands broken into their constituent parts, as a MultiTrie does, but the commands are delimited by the skip command.
Constructor and Description |
---|
MultiTrie2(boolean forward)
Constructor for the MultiTrie2 object
|
MultiTrie2(java.io.DataInput is)
Constructor for the MultiTrie object.
|
Modifier and Type | Method and Description |
---|---|
void |
add(java.lang.CharSequence key,
java.lang.CharSequence cmd)
Add an element to this structure consisting of the given key and patch
command.
|
java.lang.CharSequence[] |
decompose(java.lang.CharSequence cmd)
Break the given patch command into its constituent pieces.
|
java.lang.CharSequence |
getFully(java.lang.CharSequence key)
Return the element that is stored in a cell associated with the given key.
|
java.lang.CharSequence |
getLastOnPath(java.lang.CharSequence key)
Return the element that is stored as last on a path belonging to the given
key.
|
Trie |
reduce(Reduce by)
Remove empty rows from the given Trie and return the newly reduced Trie.
|
void |
store(java.io.DataOutput os)
Write this data structure to the given output stream.
|
getAll, getCells, getCellsPnt, getCellsVal
public MultiTrie2(java.io.DataInput is) throws java.io.IOException
is
- the input streamjava.io.IOException
- if an I/O error occurspublic MultiTrie2(boolean forward)
forward
- set to true if the elements should be read left to
rightpublic java.lang.CharSequence getFully(java.lang.CharSequence key)
public java.lang.CharSequence getLastOnPath(java.lang.CharSequence key)
getLastOnPath
in class MultiTrie
key
- the key associated with the desired elementpublic void store(java.io.DataOutput os) throws java.io.IOException
public void add(java.lang.CharSequence key, java.lang.CharSequence cmd)
This method will return without executing if the cmd parameter's length is 0.
public java.lang.CharSequence[] decompose(java.lang.CharSequence cmd)
cmd
- the patch commandCopyright © 2000–2019 The Apache Software Foundation. All rights reserved.