|
Neo4j | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
entity for this transaction.
entity for this transaction.
RelationshipType to the Expander.
RelationshipType with a Direction to the
Expander.
entity to the index.
timestamp.
entity to the index.
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.
Iterator for iterating over the lines of a text file.
Set from an Iterable.
Set from an array of items.
PathFinder which uses the A* algorithm to find the
cheapest path between two nodes.
PathFinder which uses the A* algorithm to find the
cheapest path between two nodes.
GlobalGraphOperations for the given db.
Evaluator which only includes positions at depth
and prunes everything deeper than that.
GraphDatabaseService that does not support deletions and
transactions.
GraphDatabaseService that does not support deletions and
transactions.
GraphDatabaseService that does not support deletions and
transactions.
GraphDatabaseService that does not support deletions and
transactions.
BatchInserterIndex as of
version 1.7BatchInserter version of Index.BatchInserterIndexProvider
as of version 1.7.BatchInserterIndexs from a certain index provider.BranchSelector instances with a starting point to base
the first decision on.TraversalBranch during a
traversal.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.
Path alone to see if it follows the uniqueness contract
provided by this UniquenessFilter.
Collection, making it look (and function) like a collection
holding another type of items.Evaluator to use for branch collisions.
PathEvaluator to use for branch collisions.
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.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".
SideSelector given the start/end
BranchSelectors and an optional maxDepth.
UniquenessFilter optionally with a parameter
to it, otherwise null if no parameter should be handed to it.
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()).
PatternGroup.
Path.
DependencyResolver which will select the first available candidate by default
for DependencyResolver.Adapter.resolveDependency(Class).TraversalDescription.order(BranchOrderingPolicy)
where a "preorder depth first" selector is used.
GraphDatabaseSettings.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.
PathFinder which uses the Dijkstra algorithm to find
the cheapest path between two nodes.
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
RelationshipType.GraphDatabaseService that is used to embed Neo4j
in an application.GraphDatabaseFactory
EmbeddedGraphDatabase.Expander which, if not modified, will expand
all relationships when asked to expand a Node.
PathExpander which, if not modified, will expand
all relationships when asked to expand a Node.
Evaluator which will return evaluationIfMatch if Path.endNode()
for a given path is any of nodes, else evaluationIfNoMatch.
Paths by the property value of each path's end node.
Paths by the relationship count returned for its end node
by the supplied expander.
TraversalDescription of this bidirectional
traversal.
java.lang.Object.
branch coming from either the start side or the
end side.
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.
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.
TraversalBranch whether or not to include it in the
result and whether or not to continue further down this branch or not.
Evaluator.evaluate(org.neo4j.graphdb.Path).evaluator to the list of evaluators which will control the
behaviour of the traversal.
evaluator to the list of evaluators which will control the
behaviour of the traversal.
Evaluator as a PathEvaluator.Evaluators useful during common traversals.valueToMatch.
valueToMatch.
anyOfTheseToMatch.
Query, use this class.indexName.
indexName.
Path, most commonly from the
Path.endNode().
Node.
PathExpander as the expander of relationships,
discarding all previous calls to
TraversalDescription.relationships(RelationshipType) and
TraversalDescription.relationships(RelationshipType, Direction) or any other expand method.
PathExpander as the expander of relationships,
discarding all previous calls to
TraversalDescription.relationships(RelationshipType) and
TraversalDescription.relationships(RelationshipType, Direction) or any other expand method.
PathExpander as the expander of relationships,
discarding all previous calls to
TraversalDescription.relationships(RelationshipType) and
TraversalDescription.relationships(RelationshipType, Direction) or any other expand method.
RelationshipExpander as the expander of relationships,
discarding all previous calls to
TraversalDescription.relationships(RelationshipType) and
TraversalDescription.relationships(RelationshipType, Direction) or any other expand method.
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.
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.
OnlineBackup.backup(String) instead.
OnlineBackup.backup(String, boolean) instead
OnlineBackup.backup(String, Config, boolean) instead.
GraphDatabaseSettingsResourceBundleMap of key/value pairs.
Map.
GlobalGraphOperations instead.
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().
graph database that owns this index.
GraphDatabaseService that this Node or
Relationship belongs to.
PatternGroup of this pattern node.
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.
relationships connected
to the node with supplied id.
GlobalGraphOperations instead.
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.
GlobalGraphOperations.getAllNodes().GraphDatabaseServices that allows for setting and loading
configuration.GraphDatabaseService.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.
Evaluators to a TraversalDescription puts those
evaluators in AND-mode this can group many evaluators in OR-mode.
Evaluators to a TraversalDescription puts those
evaluators in AND-mode this can group many evaluators in OR-mode.
Path if all the
nodes exist in it.
Evaluator which only includes positions between
depths minDepth and maxDepth.
OnlineBackup.backup(String) instead.
OnlineBackup.backup(String, boolean) instead.
OnlineBackup.backup(String) instead.
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)
TraversalBranches in a traversal.TraversalBranch, the relationship iterator,
Evaluation etc.
Path.
InitialStateFactory which always returns the supplied initialState.
InitialStateFactory.AsInitialBranchState instead, which has got
InitialStateFactory.AsInitialBranchState.reverse() as well.InitialStateFactory in a InitialBranchStateBatchInserter given a store directory.
BatchInserter given a store directory.
BatchInserter given a store directory.
BatchInserter given a store directory.
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.
iterator with associated resources that must be managed.
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.
IndexProvider objects based on Service.load(java.lang.Class) static
method.Iterable, or rather
Iterators spawned from it.Iterable which can limit the number
of items returned from iterators it spawns.
Iterator.source
and if limit items have been returned the next PrefetchingIterator.hasNext()
will return false.
IndexProvider objects based on a provided list.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 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.
Transaction.acquireWriteLock(PropertyContainer) or
Transaction.acquireReadLock(PropertyContainer) this lock
can be released manually using Lock.release().Iterator.
BatchInserter version of the Lucene-based indexes.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.
start side is assigned the
sideDescription and the end side
is assigned the same description, although
reversed.
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.
IllegalStateException being thrown.
InitialStateFactory which returns null as state.
node has a property with name
propertyName.
BatchInserterIndex for Nodes for the name
indexName with the given config.
Index for Nodes for the name
indexName with the given config.
BatchInserterIndex 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().
Evaluation for the given includes and
continues.
Evaluation for the given continues, meaning
whether or not to continue further down a TraversalBranch in the
traversal.
Evaluation for the given includes, meaning
whether or not to include a TraversalBranch in the traversal
result or not.
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.
PathEvaluator.RelationshipExpander which expands relationships
of all types and directions.
PathExpander which expands relationships
of all types in the given direction.
PathExpander which is set to expand
relationships with type and direction.
PathExpander which is set to expand
relationships with type in any direction.
PathExpander which is set to expand
relationships with two different types and directions.
PathExpander which is set to expand
relationships with multiple types and directions.
Path, using
the given builder.
PatternGroup with a
blank label.
PatternGroup with the
specified label.
PatternGroup with a
blank label.
PatternGroup with the
specified label.
PrefetchingIterator.hasNext() method will look up the next object and
cache it with PrefetchingIterator.setPrefetchedNext(Object).TraversalBranchs according to breadth first
pattern, the most natural ordering in a breadth first search, see
http://en.wikipedia.org/wiki/Breadth-first_searchPatternNode to the
specified PrintStream.
ProgressIndicator.SimpleProgress instead.ProgressIndicator that can report the total progress for
multiple sources.ProgressIndicator for multiple sources.
ProgressIndicator that can report the progress for a single
source.ProgressIndicator for a single source.
nodes and
relationships.TraversalBranch.next(PathExpander, TraversalContext) is guaranteed to return
null.
position.
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.
PathExpander. A RelationshipExpander
can still be wrapped via StandardExpander.toPathExpander(RelationshipExpander)
to act like a PathExpander.relationship has a
property with name propertyName.
BatchInserterIndex for Relationships for the name
indexName with the given config.
Index for Relationships for the name
indexName with the given config.
BatchInserterIndex 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).
property from the node with id
id, if present.
property from the relationship with id
id, if present.
Iterable whose iterators have associated resources
that need to be released.TraversalDescription and
Traversal and the new traversal framework's equivalent
Predicate.Evaluators.includeWhereEndNodeIs(Node...)
Evaluators.includeWhereLastRelationshipTypeIs(RelationshipType, RelationshipType...)
Direction.INCOMING if this equals
Direction.OUTGOING, Direction.OUTGOING if this equals Direction.INCOMING or
Direction.BOTH if this equals Direction.BOTH.
TraversalDescription, although reversed in
how it traverses the graph.
ServerPlugin as the name for the extension.
Service, that compares keys
using case insensitive comparison instead of exact comparison.Node or
Relationship.
key.
GraphDatabaseSetting
instead
IndexProvider iterable source.
propertyName of node with id
node to the value propertyValue.
value.
propertyName of relationship with id
relationship to the value propertyValue.
TraversalBranch state for upcoming children of that
branch.
GraphDatabaseSettings.Path.length() as possible) between two nodes.
Path.length() as possible) between two nodes.
Path.length() as possible) between two nodes.
Path.length() as possible) between two nodes.
SideSelectors.Path.
Path.
null if no
element found.
null if no
element found.
TraversalDescription.sort(Comparator).NumericRangeQuery, see QueryContext.numericRange(String, Number, Number),
Otherwise an IllegalStateException will be thrown.
TraversalDescription of this bidirectional
traversal.
TraversalDescription and
Traversal and the new traversal framework's equivalent
Evaluator.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.
ProgressIndicator that reports progress by
printing to the provided stream.
ProgressIndicator that reports progress by
printing to the provided stream.
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.
TransactionEventHandlerTraversal.description() when using static imports.
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.TraversalBranches which they need to
move further and report their progress.Node. Also because of the introduction of a new
traversal framework. The new way of doing traversals is by
creating a new TraversalDescription from
Traversal.traversal(), add rules and behaviors to it
and then calling
TraversalDescription.traverse(Node...)
Node. Also because of the introduction of a new traversal
framework. The new way of doing traversals is by creating a
new TraversalDescription from
Traversal.traversal(), add rules and
behaviours to it and then calling
TraversalDescription.traverse(Node...)
Node. Also because of the introduction of a new traversal
framework. The new way of doing traversals is by creating a
new TraversalDescription from
Traversal.traversal(), add rules and
behaviours to it and then calling
TraversalDescription.traverse(Node...)
start and end node with all
applied rules and behavior in this traversal description.
start and end nodes with all
applied rules and behavior in this traversal description.
Node. Also because of the introduction of a new traversal framework
and the usage of it. The new way of doing traversals is by creating a
new TraversalDescription from
Traversal.description(), add rules and
behaviours to it and then calling
TraversalDescription.traverse(Node...).UniqueFactory for Node.UniqueFactory for nodes.
UniqueFactory for nodes.
UniqueFactory for Relationship.UniqueFactory for relationships.
UniqueFactory for relationships.
UniquenessFactory for creating the
UniquenessFilter to use.
UniquenessFactory for creating the
UniquenessFilter to use.
UniquenessFilter filters, it can supply the
created UniquenessFilter with an optional parameter which is
up to the filter itself to validate and make sense of.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 | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||