Package | Description |
---|---|
org.neo4j.graphdb.traversal |
Traversal framework.
|
Modifier and Type | Class and Description |
---|---|
static class |
Evaluator.AsPathEvaluator<STATE>
Exposes an
Evaluator as a PathEvaluator . |
static class |
PathEvaluator.Adapter<STATE>
Adapter for
PathEvaluator . |
Modifier and Type | Method and Description |
---|---|
static <STATE> PathEvaluator<STATE> |
Evaluators.all() |
static <STATE> PathEvaluator<STATE> |
Evaluators.atDepth(int depth)
Returns an
Evaluator which only includes positions at depth
and prunes everything deeper than that. |
static <STATE> PathEvaluator<STATE> |
Evaluators.endNodeIs(Evaluation evaluationIfMatch,
Evaluation evaluationIfNoMatch,
Node... possibleEndNodes)
An
Evaluator which will return evaluationIfMatch if Path.endNode()
for a given path is any of nodes , else evaluationIfNoMatch . |
static <STATE> PathEvaluator<STATE> |
Evaluators.endNodeIsAtDepth(int depth,
Node... possibleEndNodes)
Returns
Evaluator 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 an
Evaluator which only includes positions from depth
and deeper and never prunes anything. |
static <STATE> PathEvaluator<STATE> |
Evaluators.includeIfAcceptedByAny(Evaluator... evaluators)
Whereas adding
Evaluator s to a TraversalDescription puts those
evaluators in AND-mode this can group many evaluators in OR-mode . |
static <STATE> PathEvaluator<STATE> |
Evaluators.includeIfAcceptedByAny(PathEvaluator... evaluators)
Whereas adding
Evaluator s to a TraversalDescription puts those
evaluators in AND-mode this can group many evaluators in OR-mode . |
static <STATE> PathEvaluator<STATE> |
Evaluators.includeIfContainsAll(Node... nodes)
Evaluator which decides to include a
Path if all the
nodes 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 an
Evaluator which includes positions down to depth
and prunes everything deeper than that. |
Modifier and Type | Method and Description |
---|---|
BidirectionalTraversalDescription |
BidirectionalTraversalDescription.collisionEvaluator(PathEvaluator collisionEvaluator)
Sets the
PathEvaluator to use for branch collisions. |
TraversalDescription |
TraversalDescription.evaluator(PathEvaluator evaluator)
Adds
evaluator to the list of evaluators which will control the
behavior of the traversal. |
static <STATE> PathEvaluator<STATE> |
Evaluators.includeIfAcceptedByAny(PathEvaluator... evaluators)
Whereas adding
Evaluator s to a TraversalDescription puts those
evaluators in AND-mode this can group many evaluators in OR-mode . |
Copyright © 2002–2017 The Neo4j Graph Database Project. All rights reserved.