| Modifier and Type | Class and Description |
|---|---|
| public static class | DictionaryBreakEngine.DequeI
A deque-like structure holding raw ints. |
| pack-priv static class |
| Modifier and Type | Field and Description |
|---|---|
| pack-priv UnicodeSet |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| pack-priv abstract int | Returns: The number of breaks foundA UText representing the text text, int The start of the range of dictionary characters rangeStart, int The end of the range of dictionary characters rangeEnd, DictionaryBreakEngine.Output of break positions. Positions are pushed.
Pre-existing contents of the output stack are unaltered. foundBreaks,Divide up a range of known dictionary characters handled by this break engine. |
| public int | findBreaks(CharacterIterator
The text to break over. The iterator is left at
the end of the run of characters which the engine has handled. text, int The index of the beginning of the range startPos, int The index of the possible end of our range. It is possible,
however, that the range ends earlier endPos, DictionaryBreakEngine.A data structure to receive the break positions. foundBreaks,Implements com. |
| public boolean | handles(int
A Unicode codepoint value c)Implements com. |
| pack-priv void |
| fSet | back to summary |
|---|---|
| pack-priv UnicodeSet fSet | |
| DictionaryBreakEngine | back to summary |
|---|---|
| public DictionaryBreakEngine() Constructor | |
| divideUpDictionaryRange | back to summary |
|---|---|
| pack-priv abstract int divideUpDictionaryRange(CharacterIterator text, int rangeStart, int rangeEnd, DictionaryBreakEngine. Divide up a range of known dictionary characters handled by this break engine.
| |
| findBreaks | back to summary |
|---|---|
| public int findBreaks(CharacterIterator text, int startPos, int endPos, DictionaryBreakEngine. Implements com. Doc from com. Implements the actual breaking logic. Find any breaks within a run in the supplied text.
| |
| handles | back to summary |
|---|---|
| public boolean handles(int c) Implements com.
| |
| setCharacters | back to summary |
|---|---|
| pack-priv void setCharacters(UnicodeSet set) | |
| Modifier and Type | Field and Description |
|---|---|
| private int[] | |
| private int | |
| private int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public Object | |
| pack-priv boolean | |
| public int | |
| private void | |
| public boolean | |
| public void | |
| public int | |
| pack-priv int | |
| pack-priv int | |
| public int | |
| public void | |
| public void | |
| public int |
| data | back to summary |
|---|---|
| private int[] data | |
| firstIdx | back to summary |
|---|---|
| private int firstIdx | |
| lastIdx | back to summary |
|---|---|
| private int lastIdx | |
| DequeI | back to summary |
|---|---|
| public DequeI() | |
| clone | back to summary |
|---|---|
| public Object clone() throws CloneNotSupportedException Overrides java. Doc from java. Creates and returns a copy of this object. The precise meaning
of "copy" may depend on the class of the object. The general
intent is that, for any object will be true, and that the expression:x.clone() != x will bex.clone().getClass() == x.getClass() true, but these are not absolute requirements.
While it is typically the case that:
will bex.clone().equals(x) true, this is not an absolute requirement.
By convention, the returned object should be obtained by calling
By convention, the object returned by this method should be independent
of this object (which is being cloned). To achieve this independence,
it may be necessary to modify one or more fields of the object returned
by
| |
| contains | back to summary |
|---|---|
| pack-priv boolean contains(int v) | |
| elementAt | back to summary |
|---|---|
| public int elementAt(int i) | |
| grow | back to summary |
|---|---|
| private void grow() | |
| isEmpty | back to summary |
|---|---|
| public boolean isEmpty() | |
| offer | back to summary |
|---|---|
| public void offer(int v) | |
| peek | back to summary |
|---|---|
| public int peek() | |
| peekLast | back to summary |
|---|---|
| pack-priv int peekLast() | |
| pollLast | back to summary |
|---|---|
| pack-priv int pollLast() | |
| pop | back to summary |
|---|---|
| public int pop() | |
| push | back to summary |
|---|---|
| public void push(int v) | |
| removeAllElements | back to summary |
|---|---|
| public void removeAllElements() | |
| size | back to summary |
|---|---|
| public int size() | |
| Modifier and Type | Field and Description |
|---|---|
| private int[] | |
| private int | |
| private int[] | |
| private int | |
| private int | |
| private static final int | |
| private int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public int | |
| public boolean | |
| public int | |
| public int | |
| public void |
| count | back to summary |
|---|---|
| private int[] count | |
| current | back to summary |
|---|---|
| private int current | |
| lengths | back to summary |
|---|---|
| private int[] lengths | |
| mark | back to summary |
|---|---|
| private int mark | |
| offset | back to summary |
|---|---|
| private int offset | |
| POSSIBLE_WORD_LIST_MAX | back to summary |
|---|---|
| private static final int POSSIBLE_WORD_LIST_MAX | |
| prefix | back to summary |
|---|---|
| private int prefix | |
| PossibleWord | back to summary |
|---|---|
| public PossibleWord() | |
| acceptMarked | back to summary |
|---|---|
| public int acceptMarked(CharacterIterator fIter) | |
| backUp | back to summary |
|---|---|
| public boolean backUp(CharacterIterator fIter) | |
| candidates | back to summary |
|---|---|
| public int candidates(CharacterIterator fIter, DictionaryMatcher dict, int rangeEnd) | |
| longestPrefix | back to summary |
|---|---|
| public int longestPrefix() | |
| markCurrent | back to summary |
|---|---|
| public void markCurrent() | |