|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
AbstractGraphDatabase.getConfig()
() and AbstractGraphDatabase.getManagementBeans(Class)
() a.s.o.entity
for this transaction.
entity
for this transaction.
RelationshipType
to the Expander
.
RelationshipType
with a Direction
to the
Expander
.
entity
to the index.
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.
GlobalGraphOperations
for the given db
.
Evaluator
which only includes positions at depth
and prunes everything deeper than that.
BatchInserter
version of Index
.BatchInserterIndex
s 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.TraversalBranch
s 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
.
Iterable
s, making them look like they were
one big iterable.Iterator
s, making them look like they were
one big iterator.iterator
by looping
through it.
iterable
by looping through it.
Node
or Relationship
to index.
UniqueFactory.create(Map)
, creates a plain node.
BranchSelector
with startBranch
as the
first branch to base a decision on "where to go next".
CachingIterator.next()
/CachingIterator.previous()
.
Iterator.next()
).
Path
.
created
, but adding it to the index failed (due to being
added by another transaction concurrently).
UniqueFactory.delete(PropertyContainer)
.
UniqueFactory.delete(PropertyContainer)
.
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.
DiagnosticsExtractor
capable of
accepting
visitors
.DiagnosticsProvider
for
the specified phase
to the provided
log
.
phase
to the provided log
.
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
.
Evaluator
which looks at each Path
and includes those
where the Path.endNode()
is one of possibleEndNodes
.
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)
.
Evaluator
s useful during common traversals.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.
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 Node
s with the name indexName
.
Index
for Node
s with the name indexName
.
Index
for Relationship
s with the name indexName
.
Index
for Relationship
s with the name indexName
.
Evaluator
which only includes positions from depth
and deeper and never prunes anything.
Map
of key/value pairs.
Map
.
GlobalGraphOperations
instead.
index
.
DiagnosticsProvider
.
graph database
that owns this index.
GraphDatabaseService
that this Node
or
Relationship
belongs to.
AbstractGraphDatabase.getSingleManagementBean(Class)
and AbstractGraphDatabase.getManagementBeans(Class)
. Version 1.5 of Neo4j will be the last version to contain this method.
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.
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
.
GlobalGraphOperations.getAllNodes()
.graph database
of the referenced index.
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.
Node
s or
Relationship
s) for fast lookup and querying.Iterator
with additional IndexHits.size()
and IndexHits.close()
methods on it, used for iterating over index query results.Index
s.Index
s for Node
s
and Relationship
s.Node
or Relationship
created for being stored in the index.
UniqueFactory.initialize(PropertyContainer, Map)
, does nothing
for Relationships
.
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.Node
s and Relationship
s of this
path in order.
Path
s.
Iterator
representing the traversal of the graph.
Iterator
s and
Iterable
s.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.
Transaction.acquireWriteLock(PropertyContainer)
or
Transaction.acquireReadLock(PropertyContainer)
this lock
can be released manually using Lock.release()
.Iterator
.
Map
of key/value pairs where
keys are String
s and values are Object
s.
Map
of key/value pairs where
keys are String
s and values are Object
s.
Map
s.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 Node
s for the name
indexName
with the given config
.
Index
for Node
s for the name
indexName
with the given config
.
Node
indexes.
Node
.
Node
s.
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.
BranchOrderingPolicy
to use.
Map
s.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
.
PrefetchingIterator.hasNext()
method will look up the next object and
cache it with PrefetchingIterator.setPrefetchedNext(Object)
.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
.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 Path
s).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
interface with additional get/query methods
which
are specific to Relationship
s.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 Relationship
s for the name
indexName
with the given config
.
Index
for Relationship
s 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
.
Relationship
s.
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
.
RelationshipType
s, but
with all directions reversed (see Direction.reverse()
).
Service
, that compares keys
using case insensitive comparison instead of exact comparison.key
.
value
.
Path
.
Path
.
null
if no
element found.
null
if no
element found.
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 String
s.
Map
of key/value pairs where
both keys and values are String
s.
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.
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.
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.
handler
from the list of kernel event handlers.
handler
from the list of transaction event handlers.
entity
to the index.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |