|
Neo4j Community | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
PatternElement label and property key.AbstractGraphDatabase.getConfig()() and AbstractGraphDatabase.getManagementBeans(Class)() a.s.o.PatternNode and PatternRelationship.RelationshipType to the Expander.
RelationshipType with a Direction to the
Expander.
entity to the index.
entity to the index.
timestamp.
Node filter.
Relationship filter.
Expander.addRelationshipFilter(Predicate) instead
iterator to collection.
iterator to collection.
iterator as an Iterable.
Iterable for iterating over the lines of a text file.
Iterator for iterating over the lines of a text file.
PathFinder which uses the A* algorithm to find the
cheapest path between two nodes.
Evaluator which only includes positions at depth
and prunes everything deeper than that.
BatchInserter version of Index.BatchInserterIndexs from a certain index provider.BranchSelector instances with a starting point to base
the first decision on.TraversalDescription.order(BranchOrderingPolicy)
where a "preorder breadth first" selector is used.
Iterator which lazily fetches and caches items from the
underlying iterator when items are requested.source as its underlying
Iterator to get items lazily from.
branch is unique, and hence can be
visited in this traversal.
Collection, making it look (and function) like a collection
holding another type of items.TraversalBranchs with a common
head node in order to obtain an
TraversalBranch representing a path from the start node of the
source TraversalBranch to the start node of the
target TraversalBranch.
Iterables, making them look like they were
one big iterable.Iterators, making them look like they were
one big iterator.CostEvaluator and EstimateEvaluator.ValueMatchers.iterator by looping
through it.
iterable by looping through it.
BranchSelector with startBranch as the
first branch to base a decision on "where to go next".
PatternRelationship from this node,
to the specified other node.
PatternRelationship between this node and the
specified other node, with the specified direction.
PatternRelationship of the specified
RelationshipType from this node to the specified other node.
PatternRelationship of the specified
RelationshipType between this node and the specified other node,
with the specified direction.
PatternRelationship from this node,
to the specified other node.
PatternRelationship between this node and the
specified other node, with the specified direction.
PatternRelationship of the specified
RelationshipType from this node to the specified other node.
PatternRelationship of the specified
RelationshipType between this node and the specified other node,
with the specified direction.
CachingIterator.next()/CachingIterator.previous().
Iterator.next()).
Query-objectsPatternGroup.
Path.
TraversalDescription.order(BranchOrderingPolicy)
where a "preorder depth first" selector is used.
TraversalDescription with default value for
everything so that it's OK to call
TraversalDescription.traverse(org.neo4j.graphdb.Node) without
modification.
PathFinder which uses the Dijkstra algorithm to find
the cheapest path between two nodes.
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
RelationshipType.GraphDatabaseService that is used to embed Neo4j
in an application.GraphDatabaseService with a store located in
storeDir, which will be created if it doesn't already exist.
GraphDatabaseService
with a set of configuration parameters.
EmbeddedGraphDatabase.GraphDatabaseService with a store located in
storeDir.
GraphDatabaseService
with a set of configuration parameters.
Expander which, if not modified, will expand
all relationships when asked to expand a Node.
java.lang.Object.
Path and returns an Evaluation containing
information about whether or not to include it in the traversal result,
i.e return it from the Traverser.
Evaluator.evaluate(org.neo4j.graphdb.Path).TraversalDescription.filter(Predicate) and
TraversalDescription.prune(PruneEvaluator).
Evaluators useful during common traversals.valueToMatch.
valueToMatch.
anyOfTheseToMatch.
Query and returns an iterable that contains the result set
Query and returns an iterable that contains the result set
Query and returns an iterable that contains the result set
Query, use this class.indexName.
indexName.
RelationshipExpander as the expander of relationships,
discarding all previous calls to
TraversalDescription.relationships(RelationshipType) and
TraversalDescription.relationships(RelationshipType, Direction).
RelationshipExpander interface
that makes it possible to build customized versions of an Expander.RelationshipExpander wrapped as an Expander.
RelationshipExpander which expands relationships
of all types and directions.
RelationshipExpander which expands relationships
of all types in the given direction.
RelationshipExpander which is set to expand
relationships with type and direction.
RelationshipExpander which is set to expand
relationships with type in any direction.
RelationshipExpander which is set to expand
relationships with two different types and directions.
RelationshipExpander which is set to expand
relationships with multiple types and directions.
Transaction.finish() is called.
Evaluator. Use
TraversalDescription.evaluator(Evaluator) instead which combines
TraversalDescription.filter(Predicate) and TraversalDescription.prune(PruneEvaluator). The supplied
Predicate will be wrapped by an Evaluator internally.
FilterExpressions with AND or OR.FilterExpressions which are ANDed or ORed together.PatternNode with a certain label.start and end nodes.
start and end
nodes.
Transaction.success() or Transaction.failure() has been previously invoked.
null if no
element found.
null if no
element found.
BatchInserterIndex.get(String, Object),
BatchInserterIndex.query(String, Object) and BatchInserterIndex.query(Object) so that they
are guaranteed to return correct results.
Index for Nodes with the name indexName.
Index for Nodes with the name indexName.
Index for Relationships with the name indexName.
Index for Relationships with the name indexName.
Evaluator which only includes positions from depth
and deeper and never prunes anything.
Map of key/value pairs.
Map.
PatternRelationships associated with this pattern node.
Node or Relationship currently associated with
this pattern object.
index.
ValueContext.indexNumeric() has been called.
PatternGroup.addFilter(FilterExpression).
PatternRelationship corresponding to the matching
Relationship.
Relationship traversed to get to the Node
returned from PatternElement.getNode().
GraphDatabaseService that this Node or
Relationship belongs to.
PatternGroup of this pattern node.
AbstractGraphDatabase.getSingleManagementBean(Class) and AbstractGraphDatabase.getManagementBeans(Class)
. Version 1.5 of Neo4j will be the last version to contain this method.
PatternMatcher.
Node which is just one part of the whole
match.
PatternNode that this pattern relationship relates, that
is not the specified node.
PatternNode corresponding to the matching
Node.
PropertyContainer.getPropertyKeys() in combination
with PropertyContainer.getProperty(String).
types
that are attached to this node, regardless of direction.
types
that are attached to this node and have the given direction.
OUTGOING or
INCOMING relationships from this node.
PatternRelationships associated
with this pattern node.
null
if no specific resource is associated with this handler or if it isn't
desirable to expose it.
null
if there was none.
null.
true if this context is set to prioritize speed over
the inclusion of transactional state in the results.
RelationshipType a relationship must have in order to
match this pattern relationship.
java.lang.Object.
CachingIterator.next() will be able to return
an item or not.
PrefetchingIterator.next() will remember it and won't
try to fetch it again.
CachingIterator.previous() will be able to
return an item or not.
true if this property container has a property
accessible through the given key, false otherwise.
true if there are any relationships attached to this
node, false otherwise.
true if there are any relationships of any of the
types in types attached to this node (regardless of
direction), false otherwise.
true if there are any relationships of any of the
types in types attached to this node (for the given
direction), false otherwise.
true if there are any relationships in the given
direction attached to this node, false otherwise.
true if there are any relationships of the given
relationship type and direction attached to this node, false
otherwise.
Evaluator which only includes positions between
depths minDepth and maxDepth.
IndexManager paired with this graph database service
and is the entry point for managing indexes coupled with this database.
Nodes or
Relationships) for fast lookup and querying.Iterator with additional IndexHits.size() and IndexHits.close()
methods on it, used for iterating over index query results.Indexs.Indexs for Nodes
and Relationships.Index.add(PropertyContainer, String, Object)
node is deleted in this transaction.
relationship is deleted in this
transaction.
true if the current position is the start node,
false otherwise.
type.
Iterable so that it returns items of another type.Nodes and Relationships of this
path in order.
Paths.
Iterator representing the traversal of the graph.
Iterators and
Iterables.Iterator so that it returns items of another type.KernelEventHandler.ExecutionOrder.BEFORE,
KernelEventHandler.ExecutionOrder.AFTER another handler, or if it
KernelEventHandler.ExecutionOrder.DOESNT_MATTER.null if no
element found.
null if no
element found.
Relationship in this path.
Evaluator which compares the type of the last relationship
in a Path to a given set of relationship types (one or more).If the type of
the last relationship in a path is of one of the given types then
evaluationIfMatch will be returned, otherwise
evaluationIfNoMatch will be returned.
Map from a Reader assuming strings as keys
and values.
Map from an InputStream assuming strings as keys
and values.
Map from a File assuming strings as keys
and values.
Map.
Map.
Map from a Reader assuming strings as keys
and values.
Map from an InputStream assuming strings as keys
and values.
Map from a File assuming strings as keys
and values.
Map of key/value pairs where
keys are Strings and values are Objects.
Map of key/value pairs where
keys are Strings and values are Objects.
Maps.PatternNode
where the given PatternNode starts matching at the given
Node.
PatternNode
where the given PatternNode starts matching at the given
Node.
PatternNode
where the given PatternNode starts matching at the given
Node.
PatternNode
where the given PatternNode starts matching at the given
Node.
PatternNode
where the given PatternNode starts matching at the given
Node.
PatternNode
where the given PatternNode starts matching at the given
Node.
valueGetter and returns whether or not
there was a match.
value to see if it matches an expected value.
rules.
CachingIterator.position().
PrefetchingIterator.hasNext() to try to fetch the next item and returns it
if found, otherwise it throws a NoSuchElementException.
Iterator instance which exposes the current page
as its own iterator, which fetches items lazily from the underlying
iterator.
BatchInserterIndex for Nodes for the name
indexName with the given config.
Index for Nodes for the name
indexName with the given config.
Node indexes.
Node.
Nodes.
PruneEvaluator, does not prune any parts of the
traversal.
true if the current position is anywhere except on
the start node, false if it is on the start node.
QueryContext with a query for numeric ranges, that is
values that have been indexed using ValueContext.indexNumeric().
QueryContext with a query for numeric ranges, that is
values that have been indexed using ValueContext.indexNumeric().
BranchOrderingPolicy to use.
GraphAlgoFactory.Maps.QueryContext and
ValueContext which is part of the
public API for an Index backed by Lucene.CachingIterator which can more easily divide the items
into pages, where optionally each page can be seen as its own
Iterator instance for convenience using PagingIterator.nextPage().source as its underlying
Iterator to lazily get items from.
TraversalBranch.
Path, using
the given builder.
PatternMatcher.Node.PatternGroup with a
blank label.
PatternGroup with the
specified label.
PatternGroup with a
blank label.
PatternGroup with the
specified label.
Relationship.PrefetchingIterator.hasNext() method will look up the next object and
cache it with PrefetchingIterator.setPrefetchedNext(Object).PatternNode to the
specified PrintStream.
nodes and
relationships.Evaluator. Use
TraversalDescription.evaluator(Evaluator) instead which combines
TraversalDescription.filter(Predicate) and TraversalDescription.prune(PruneEvaluator). The supplied
PruneEvaluator will be wrapped by an Evaluator internally.
position.
Evaluator. The equivalent
is Evaluators.toDepth(int).
Evaluator which combines
PruneEvaluator and filtering (Predicate of Paths).key and
query object, which can be a query string or an implementation-specific
query object.
key and
query object, which can be a query string or an implementation-specific
query object.
key and
query object, which can be a query string or an implementation-specific
query object.
ReadableIndex.query(Object) and ReadableIndex.query(String, Object).ReadableIndex interface with additional get/query methods
which
are specific to Relationships.String property matches the specified regular
expression pattern.
handler as a handler for kernel events which
are generated from different places in the lifecycle of the kernel.
handler as a handler for transaction events which
are generated from different places in the lifecycle of each
transaction.
BatchInserterIndex for Relationships for the name
indexName with the given config.
Index for Relationships for the name
indexName with the given config.
Relationship indexes.
Relationship.
type to the list of relationship types to traverse.
type to the list of relationship types to traverse in
the given direction.
Relationships.
RelationshipType from the Expander.
entity from the index.
entity where key is key
from the index.
Index.add(PropertyContainer, String, Object).
Evaluator. The equivalent
is Evaluators.all().
Evaluator. The equivalent
is Evaluators.excludeStartPosition().
Direction.INCOMING if this equals
Direction.OUTGOING, Direction.OUTGOING if this equals Direction.INCOMING or
Direction.BOTH if this equals Direction.BOTH.
RelationshipTypes, but
with all directions reversed (see Direction.reverse()).
Service, that compares keys
using case insensitive comparison instead of exact comparison.Node or
Relationship.
key.
value.
Path.length() as possible) between two nodes.
Path.length() as possible) between two nodes.
Path.
Path.
null if no
element found.
null if no
element found.
NumericRangeQuery, see QueryContext.numericRange(String, Number, Number),
Otherwise an IllegalStateException will be thrown.
config into file in a standard java
Properties format.
config into stream in a standard java
Properties format.
config into writer in a standard java
Properties format.
config into file in a standard java
Properties format.
config into stream in a standard java
Properties format.
config into writer in a standard java
Properties format.
Map of key/value pairs where
both keys and values are Strings.
Map of key/value pairs where
both keys and values are Strings.
Transaction.finish() unless Transaction.failure()
has or will be invoked before then.
Evaluator which includes positions down to depth
and prunes everything deeper than that.
IndexSearcher.search(org.apache.lucene.search.Query, int),
alternatively IndexSearcher.search(org.apache.lucene.search.Query, org.apache.lucene.search.Filter, int, Sort)
where only the top numberOfTopHits hits are returned.
Traversal.PathDescriptor used in common toString()
representations in classes implementing Path.Path.position and a RelationshipExpander with a
traversal context, for example parent and an iterator of relationships to go
next.startNode based on all the rules and behavior
in this description.
UniquenessFactory for creating the
UniquenessFilter to use.
UniquenessFactory for creating the
UniquenessFilter to use.
handler from the list of kernel event handlers.
handler from the list of transaction event handlers.
entity to the index.
Path that has an associated weight.
|
Neo4j Community | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||