static void |
SuffixTrees.print(SuffixTree suffixTree,
java.io.PrintStream printStream) |
Prints a character representation of the tree and its branches, starting from the root node.
|
protected static void |
SuffixTrees.print(SuffixTree suffixTree,
java.io.PrintStream printStream,
SuffixTree.Edge edge,
int level) |
Prints a character representation of the child edges of the given edge.
|
protected static void |
SuffixTrees.print(SuffixTree suffixTree,
java.io.PrintStream printStream,
SuffixTree.Node node,
int level) |
Prints a character representation of the given node.
|
boolean |
CharSequenceSuffixTrees.AbstractCharSequenceVisitor.visit(SuffixTree suffixTree,
CharSequenceSuffixTree.CharSequenceNode node,
CharSequenceSuffixTree.CharSequenceEdge parentEdge,
int length) |
|
abstract boolean |
CharSequenceSuffixTrees.AbstractCharSequenceVisitor.visit(SuffixTree suffixTree,
CharSequenceSuffixTree.CharSequenceNode node,
CharSequenceSuffixTree.CharSequenceEdge parentEdge,
java.lang.CharSequence charSequence) |
Visits the given node.
|
static <N extends SuffixTree.Node,E extends SuffixTree.Edge> boolean |
SuffixTrees.visit(SuffixTree suffixTree,
SuffixTrees.Visitor<N,E> visitor) |
Recursively visits all the nodes in a given suffix tree.
|
static <N extends SuffixTree.Node,E extends SuffixTree.Edge> boolean |
SuffixTrees.visit(SuffixTree suffixTree,
N node,
E parentEdge,
int length,
SuffixTrees.Visitor<N,E> visitor) |
Recursively visits a given node and all descendant nodes in a subtree of a suffix tree.
|
boolean |
SuffixTrees.Visitor.visit(SuffixTree suffixTree,
N node,
E parentEdge,
int length) |
Visits the given node.
|
static <N extends SuffixTree.Node,E extends SuffixTree.Edge> boolean |
SuffixTrees.visitChildren(SuffixTree suffixTree,
N node,
int length,
SuffixTrees.Visitor<N,E> visitor) |
Recursively visits all descendant nodes in a subtree of a suffix tree.
|