I
- symbol class.public class SuffixTrieNode<I> extends Word<I>
SuffixTrie
.Constructor and Description |
---|
SuffixTrieNode()
Root constructor.
|
SuffixTrieNode(I symbol,
@PolyNull SuffixTrieNode<I> parent) |
Modifier and Type | Method and Description |
---|---|
void |
appendSuffix(List<? super I> symList) |
static <I> void |
appendSuffix(SuffixTrieNode<I> node,
List<? super I> symList) |
int |
depth() |
static <I> int |
depth(SuffixTrieNode<I> node) |
@Nullable SuffixTrieNode<I> |
getParent() |
Word<I> |
getSuffix() |
I |
getSymbol() |
I |
getSymbol(int index)
Return symbol that is at the specified position.
|
static <I> I |
getSymbol(SuffixTrieNode<I> node,
int index) |
boolean |
isRoot() |
net.automatalib.util.tries.SuffixTrieNode.Iterator<I> |
iterator() |
int |
length()
Retrieves the length of this word.
|
static <I> Word<I> |
toExplicitWord(SuffixTrieNode<I> node) |
append, asList, canonicalComparator, canonicalNext, collector, concat, concatInternal, epsilon, equals, firstSymbol, flatten, fromArray, fromCharSequence, fromLetter, fromList, fromString, fromSymbols, fromWords, fromWords, hashCode, isEmpty, isPrefixOf, isSuffixOf, lastSymbol, longestCommonPrefix, longestCommonSuffix, parallelStream, prefix, prefixes, prepend, print, size, spliterator, stream, subWord, subWord, subWordInternal, suffix, suffixes, toIntArray, transform, trimmed, upcast, writeToArray
toString
public SuffixTrieNode()
public SuffixTrieNode(I symbol, @PolyNull SuffixTrieNode<I> parent)
public static <I> Word<I> toExplicitWord(SuffixTrieNode<I> node)
public int depth()
public static <I> int depth(SuffixTrieNode<I> node)
public static <I> void appendSuffix(SuffixTrieNode<I> node, List<? super I> symList)
public I getSymbol()
public I getSymbol(int index)
Word
public static <I> I getSymbol(SuffixTrieNode<I> node, int index)
public @Nullable SuffixTrieNode<I> getParent()
@EnsuresNonNullIf(expression="parent", result=false) public boolean isRoot()
public int length()
Word
Copyright © 2020. All rights reserved.