| Modifier and Type | Class and Description |
|---|---|
| public static class | |
| private static class | |
| private class | TextTrieMap.Node
Inner class representing a text node in the trie. |
| public static class | |
| public static interface |
| Modifier and Type | Field and Description |
|---|---|
| pack-priv boolean | |
| private TextTrieMap |
| Access | Constructor and Description |
|---|---|
| public | TextTrieMap(boolean
true to use simple case insensitive match ignoreCase)Constructs a TextTrieMap object. |
| Modifier and Type | Method and Description |
|---|---|
| public void | |
| public void | |
| private void | find(CharSequence text, int offset, TextTrieMap.
|
| private synchronized void | find(TextTrieMap<V>.
|
| public Iterator | |
| public Iterator | Returns: An iterator of the objects associated with the longest prefix matching matching key, or null if no matching entry is found.The text to be matched with prefixes. text, int The start index of of the text start)Gets an iterator of the objects associated with the longest prefix matching string key starting at the specified position. |
| public Iterator | |
| public TextTrieMap | put(CharSequence
The text. text, V The value object associated with the text. val)Adds the text key and its associated object in this object. |
| public void | |
| private static char[] | |
| private static char[] | |
| private static char[] |
| _ignoreCase | back to summary |
|---|---|
| pack-priv boolean _ignoreCase | |
| _root | back to summary |
|---|---|
| private TextTrieMap<V>. | |
| TextTrieMap | back to summary |
|---|---|
| public TextTrieMap(boolean ignoreCase) Constructs a TextTrieMap object.
| |
| find | back to summary |
|---|---|
| public void find(CharSequence text, TextTrieMap. | |
| find | back to summary |
|---|---|
| public void find(CharSequence text, int offset, TextTrieMap. | |
| find | back to summary |
|---|---|
| private void find(CharSequence text, int offset, TextTrieMap. | |
| find | back to summary |
|---|---|
| private synchronized void find(TextTrieMap<V>. | |
| get | back to summary |
|---|---|
| public Iterator Gets an iterator of the objects associated with the longest prefix matching string key. | |
| get | back to summary |
|---|---|
| public Iterator Gets an iterator of the objects associated with the longest prefix matching string key starting at the specified position.
| |
| get | back to summary |
|---|---|
| public Iterator | |
| put | back to summary |
|---|---|
| public TextTrieMap Adds the text key and its associated object in this object.
| |
| putLeadCodePoints | back to summary |
|---|---|
| public void putLeadCodePoints(UnicodeSet output) | |
| subArray | back to summary |
|---|---|
| private static char[] subArray(char[] array, int start) | |
| subArray | back to summary |
|---|---|
| private static char[] subArray(char[] array, int start, int limit) | |
| toCharArray | back to summary |
|---|---|
| private static char[] toCharArray(CharSequence text) | |
| Modifier and Type | Field and Description |
|---|---|
| private boolean | |
| private int | |
| private Character | |
| private int | |
| private CharSequence |
| Access | Constructor and Description |
|---|---|
| pack-priv |
| Modifier and Type | Method and Description |
|---|---|
| public boolean | |
| public Character | |
| public int | |
| public int | |
| public void | remove()
Overrides default java. |
| _ignoreCase | back to summary |
|---|---|
| private boolean _ignoreCase | |
| _nextIdx | back to summary |
|---|---|
| private int _nextIdx | |
| _remainingChar | back to summary |
|---|---|
| private Character _remainingChar | |
| _startIdx | back to summary |
|---|---|
| private int _startIdx | |
| _text | back to summary |
|---|---|
| private CharSequence _text | |
| CharIterator | back to summary |
|---|---|
| pack-priv CharIterator(CharSequence text, int offset, boolean ignoreCase) | |
| hasNext | back to summary |
|---|---|
| public boolean hasNext() Implements java. Doc from java. Returns
| |
| next | back to summary |
|---|---|
| public Character next() Implements java. Doc from java. Returns the next element in the iteration. | |
| nextIndex | back to summary |
|---|---|
| public int nextIndex() | |
| processedLength | back to summary |
|---|---|
| public int processedLength() | |
| remove | back to summary |
|---|---|
| public void remove() Overrides default java. Doc from java. Removes from the underlying collection the last element returned
by this iterator (optional operation). This method can be called
only once per call to The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.
The behavior of an iterator is unspecified if this method is called
after a call to the
| |
| Access | Constructor and Description |
|---|---|
| private |
| Modifier and Type | Method and Description |
|---|---|
| public Iterator | |
| public int | |
| public boolean | handlePrefixMatch(int
Matched key's length matchLength, Iterator<V> An iterator of the objects associated with the matched key values)Implements com. |
| length | back to summary |
|---|---|
| private int length | |
| matches | back to summary |
|---|---|
| private Iterator<V> matches | |
| LongestMatchHandler | back to summary |
|---|---|
| private LongestMatchHandler() | |
| getMatches | back to summary |
|---|---|
| public Iterator | |
| getMatchLength | back to summary |
|---|---|
| public int getMatchLength() | |
| handlePrefixMatch | back to summary |
|---|---|
| public boolean handlePrefixMatch(int matchLength, Iterator<V> values) Implements com. Doc from com. Handles a prefix key match | |
| Modifier and Type | Field and Description |
|---|---|
| private List | |
| private char[] | |
| private List |
| Access | Constructor and Description |
|---|---|
| private | |
| private |
| Modifier and Type | Method and Description |
|---|---|
| public void | |
| private void | |
| private List | |
| public int | |
| public TextTrieMap | |
| private int | |
| private boolean | |
| public void | |
| private void | |
| public Iterator |
| _children | back to summary |
|---|---|
| private List<TextTrieMap<V>. | |
| _text | back to summary |
|---|---|
| private char[] _text | |
| _values | back to summary |
|---|---|
| private List<V> _values | |
| Node | back to summary |
|---|---|
| private Node() | |
| Node | back to summary |
|---|---|
| private Node(char[] text, List<V> values, List<TextTrieMap<V>. | |
| add | back to summary |
|---|---|
| public void add(TextTrieMap. | |
| add | back to summary |
|---|---|
| private void add(char[] text, int offset, V value) | |
| addValue | back to summary |
|---|---|
| private List | |
| charCount | back to summary |
|---|---|
| public int charCount() | |
| findMatch | back to summary |
|---|---|
| public TextTrieMap | |
| lenMatches | back to summary |
|---|---|
| private int lenMatches(char[] text, int offset) | |
| matchFollowing | back to summary |
|---|---|
| private boolean matchFollowing(TextTrieMap. | |
| putLeadCodePoints | back to summary |
|---|---|
| public void putLeadCodePoints(UnicodeSet output) | |
| split | back to summary |
|---|---|
| private void split(int offset) | |
| values | back to summary |
|---|---|
| public Iterator | |
| Modifier and Type | Field and Description |
|---|---|
| public int | |
| public boolean |
| Access | Constructor and Description |
|---|---|
| public |
| matchLength | back to summary |
|---|---|
| public int matchLength | |
| partialMatch | back to summary |
|---|---|
| public boolean partialMatch | |
| Output | back to summary |
|---|---|
| public Output() | |
| Modifier and Type | Method and Description |
|---|---|
| public boolean | Returns: Return true to continue the search in the trie, false to quit.Matched key's length matchLength, Iterator<V> An iterator of the objects associated with the matched key values)Handles a prefix key match |
| handlePrefixMatch | back to summary |
|---|---|
| public boolean handlePrefixMatch(int matchLength, Iterator<V> values) Handles a prefix key match
| |