Uses of Interface
org.parboiled.trees.GraphNode
-
Packages that use GraphNode Package Description org.parboiled org.parboiled.matchers org.parboiled.trees -
-
Uses of GraphNode in org.parboiled
Subinterfaces of GraphNode in org.parboiled Modifier and Type Interface Description interface
Node<V>
Represents a node in the parse tree created during a parsing run. -
Uses of GraphNode in org.parboiled.matchers
Subinterfaces of GraphNode in org.parboiled.matchers Modifier and Type Interface Description interface
Matcher
A Matcher instance is responsible for "executing" a specific Rule instance, i.e.Classes in org.parboiled.matchers that implement GraphNode Modifier and Type Class Description class
AbstractMatcher
Abstract base class of most regularMatcher
s.class
ActionMatcher
class
AnyMatcher
AMatcher
matching any single character except EOI.class
AnyOfMatcher
AMatcher
matching a single character out of a givenCharacters
set.class
CharIgnoreCaseMatcher
AMatcher
matching a single character case-independently.class
CharMatcher
AMatcher
matching a single given character.class
CharRangeMatcher
AMatcher
matching a single character out of a given range of characters.class
CustomMatcher
Base class of custom matcher implementations.class
EmptyMatcher
AMatcher
that always successfully matches nothing.class
FirstOfMatcher
AMatcher
trying all of its submatchers in sequence and succeeding when the first submatcher succeeds.class
FirstOfStringsMatcher
A specialized FirstOfMatcher that handles FirstOf(string, string, ...) rules much faster that the regular FirstOfMatcher.class
MemoMismatchesMatcher
Special wrapping matcher that performs memoization of the last mismatch of the wrapped sub rule.class
NothingMatcher
AMatcher
that never matches anything.class
OneOrMoreMatcher
AMatcher
that repeatedly tries its submatcher against the input.class
OptionalMatcher
AMatcher
that tries its submatcher once against the input and always succeeds.class
ProxyMatcher
class
SequenceMatcher
AMatcher
that executes all of its submatchers in sequence and only succeeds if all submatchers succeed.class
StringMatcher
ASequenceMatcher
specialization for sequences of CharMatchers.class
TestMatcher
A specialMatcher
not actually matching any input but rather trying its submatcher against the current input position.class
TestNotMatcher
A specialMatcher
not actually matching any input but rather trying its submatcher against the current input position.class
VarFramingMatcher
Special wrapping matcher that manages the creation and destruction of execution frames for a number of action vars.class
ZeroOrMoreMatcher
AMatcher
that repeatedly tries its submatcher against the input. -
Uses of GraphNode in org.parboiled.trees
Classes in org.parboiled.trees with type parameters of type GraphNode Modifier and Type Interface Description interface
GraphNode<T extends GraphNode<T>>
A node in a directed graph (that may have cycles).class
ImmutableGraphNode<T extends GraphNode<T>>
A simple, immutableGraphNode
implementation.Subinterfaces of GraphNode in org.parboiled.trees Modifier and Type Interface Description interface
BinaryTreeNode<T extends BinaryTreeNode<T>>
ATreeNode
specialization with only two child nodes, left and right.interface
MutableBinaryTreeNode<T extends MutableBinaryTreeNode<T>>
AMutableTreeNode
specialization also satisfying theBinaryTreeNode
interface and providing mutability methods.interface
MutableTreeNode<T extends MutableTreeNode<T>>
ATreeNode
specialiation that allow for mutability of the tree structure.interface
TreeNode<T extends TreeNode<T>>
A specialization of aGraphNode
that contains a reference to its parent, thereby making the graph a tree (since each node can now have only one parent node).Classes in org.parboiled.trees that implement GraphNode Modifier and Type Class Description class
ImmutableBinaryTreeNode<T extends BinaryTreeNode<T>>
A simple immutable implementation of theBinaryTreeNode
interface.class
ImmutableGraphNode<T extends GraphNode<T>>
A simple, immutableGraphNode
implementation.class
ImmutableTreeNode<T extends TreeNode<T>>
AnImmutableGraphNode
specialization representing a tree node with a parent field linking back to the nodes (only) parent.class
MutableBinaryTreeNodeImpl<T extends MutableBinaryTreeNode<T>>
A simpleMutableBinaryTreeNode
implementation based on theMutableTreeNodeImpl
.class
MutableTreeNodeImpl<T extends MutableTreeNode<T>>
A base implementation of theMutableTreeNode
.Methods in org.parboiled.trees with type parameters of type GraphNode Modifier and Type Method Description static <T extends GraphNode<T>,C extends java.util.Collection<T>>
CGraphUtils. collectAllNodes(T node, C collection)
Collects all nodes from the graph reachable from the given node in the given collection.static <T extends GraphNode<T>>
intGraphUtils. countAllDistinct(T node)
Counts all distinct nodes in the graph reachable from the given node.static <T extends GraphNode<T>>
TGraphUtils. getFirstChild(T node)
Returns the first child node of the given node or null if node is null or does not have any children.static <T extends GraphNode<T>>
TGraphUtils. getLastChild(T node)
Returns the last child node of the given node or null if node is null or does not have any children.static <T extends GraphNode<T>>
java.lang.StringGraphUtils. printTree(T node, Formatter<T> formatter)
Creates a string representation of the graph reachable from the given node using the given formatter.static <T extends GraphNode<T>>
java.lang.StringGraphUtils. printTree(T node, Formatter<T> formatter, Predicate<T> nodeFilter, Predicate<T> subTreeFilter)
Creates a string representation of the graph reachable from the given node using the given formatter.Methods in org.parboiled.trees with parameters of type GraphNode Modifier and Type Method Description static boolean
GraphUtils. hasChildren(GraphNode<?> node)
Returns true if this node is not null and has at least one child node.
-