|
Class Summary |
| AnyPredicate |
The 'null' predicate, it asserts nothing. |
| AtLeast |
Asserts the existence of at least one edge
that has a given label and targets a node that satisfies a given predicate. |
| Bool |
Asserts that a leaf as a boolean value that satisfies a given constraint. |
| Calendar |
Asserts that a leaf has a calendar value that satisfies a given constraint. |
| CutTreePredicate |
A TreePredicate in which CutTreePredicate.prune(Node) removes all the edges of matching nodes, not only those that are not required for matching. |
| Date |
Asserts that a leaf has a date value that satisfies a given constraint. |
| EdgePredicate |
An implementation of Predicate for Edges. |
| EdgePredicate.Range |
|
| LeafPredicate<T,C extends Constraint<? super T>> |
Abstract implementation of Predicate for predicates that apply to Leafs. |
| Many |
Asserts the existence of zero or more edges
that have a given label and target nodes that satisfy a given predicate. |
| Num |
Asserts that a leaf as a numeric value that satisfies a given constraint. |
| One |
Asserts the existence of a single edge
that has a given label and targets a node that satisfies a given predicate. |
| Only |
Asserts the existence of zero or more edges
that have a given label and target nodes that satisfy a given predicate. |
| Opt |
Asserts the existence of at most one edge
that has a given label and targets a node that satisfies a given predicate. |
| Predicates |
|
| RID |
Asserts that a leaf has a RID value that satisfies a given constraint. |
| Text |
Asserts that a leaf has a text value that satisfies a given constraint. |
| TreePredicate |
An implementation of Predicate for InnerNodes. |