Uses of Interface
org.neo4j.graphdb.traversal.PathEvaluator
-
Uses of PathEvaluator in org.neo4j.graphdb.traversal
Modifier and TypeClassDescriptionstatic class
Evaluator.AsPathEvaluator<STATE>
Exposes anEvaluator
as aPathEvaluator
.static class
PathEvaluator.Adapter<STATE>
Adapter forPathEvaluator
.Modifier and TypeMethodDescriptionstatic <STATE> PathEvaluator<STATE>
Evaluators.all()
static <STATE> PathEvaluator<STATE>
Evaluators.atDepth
(int depth) Returns anEvaluator
which only includes positions atdepth
and prunes everything deeper than that.static <STATE> PathEvaluator<STATE>
Evaluators.endNodeIs
(Evaluation evaluationIfMatch, Evaluation evaluationIfNoMatch, Node... possibleEndNodes) AnEvaluator
which will returnevaluationIfMatch
ifPath.endNode()
for a given path is any ofnodes
, elseevaluationIfNoMatch
.static <STATE> PathEvaluator<STATE>
Evaluators.endNodeIsAtDepth
(int depth, Node... possibleEndNodes) ReturnsEvaluator
s for paths with the specified depth and with an end node from the list of possibleEndNodes.static PathEvaluator
Evaluators.excludeStartPosition()
static <STATE> PathEvaluator<STATE>
Evaluators.fromDepth
(int depth) Returns anEvaluator
which only includes positions fromdepth
and deeper and never prunes anything.static <STATE> PathEvaluator<STATE>
Evaluators.includeIfAcceptedByAny
(Evaluator... evaluators) Whereas addingEvaluator
s to aTraversalDescription
puts those evaluators inAND-mode
this can group many evaluators inOR-mode
.static <STATE> PathEvaluator<STATE>
Evaluators.includeIfAcceptedByAny
(PathEvaluator... evaluators) Whereas addingEvaluator
s to aTraversalDescription
puts those evaluators inAND-mode
this can group many evaluators inOR-mode
.static <STATE> PathEvaluator<STATE>
Evaluators.includeIfContainsAll
(Node... nodes) Evaluator which decides to include aPath
if all thenodes
exist in it.static <STATE> PathEvaluator<STATE>
Evaluators.includeWhereEndNodeIs
(Node... nodes) Include paths with the specified end nodes.static <STATE> PathEvaluator<STATE>
Evaluators.includeWhereLastRelationshipTypeIs
(RelationshipType type, RelationshipType... orAnyOfTheseTypes) static <STATE> PathEvaluator<STATE>
Evaluators.includingDepths
(int minDepth, int maxDepth) static <STATE> PathEvaluator<STATE>
Evaluators.lastRelationshipTypeIs
(Evaluation evaluationIfMatch, Evaluation evaluationIfNoMatch, RelationshipType type, RelationshipType... orAnyOfTheseTypes) static <STATE> PathEvaluator<STATE>
Evaluators.pruneWhereEndNodeIs
(Node... nodes) static <STATE> PathEvaluator<STATE>
Evaluators.pruneWhereLastRelationshipTypeIs
(RelationshipType type, RelationshipType... orAnyOfTheseTypes) static <STATE> PathEvaluator<STATE>
Evaluators.toDepth
(int depth) Returns anEvaluator
which includes positions down todepth
and prunes everything deeper than that.Modifier and TypeMethodDescriptionBidirectionalTraversalDescription.collisionEvaluator
(PathEvaluator collisionEvaluator) Sets thePathEvaluator
to use for branch collisions.TraversalDescription.evaluator
(PathEvaluator evaluator) Addsevaluator
to the list of evaluators which will control the behavior of the traversal.static <STATE> PathEvaluator<STATE>
Evaluators.includeIfAcceptedByAny
(PathEvaluator... evaluators) Whereas addingEvaluator
s to aTraversalDescription
puts those evaluators inAND-mode
this can group many evaluators inOR-mode
.