public enum Uniqueness extends Enum<Uniqueness> implements UniquenessFactory
| Enum Constant and Description | 
|---|
NODE_GLOBAL
A node cannot be traversed more than once. 
 | 
NODE_LEVEL
Entities on the same level are guaranteed to be unique. 
 | 
NODE_PATH
For each returned node there's a unique path from the start node to it. 
 | 
NODE_RECENT
This is like  
NODE_GLOBAL, but only guarantees
 uniqueness among the most recent visited nodes, with a configurable
 count. | 
NONE
No restriction (the user will have to manage it). 
 | 
RELATIONSHIP_GLOBAL
A relationship cannot be traversed more than once, whereas nodes can. 
 | 
RELATIONSHIP_LEVEL
Entities on the same level are guaranteed to be unique. 
 | 
RELATIONSHIP_PATH
For each returned node there's a (relationship wise) unique path from the
 start node to it. 
 | 
RELATIONSHIP_RECENT
Same as for  
NODE_RECENT, but for relationships. | 
| Modifier and Type | Method and Description | 
|---|---|
static Uniqueness | 
valueOf(String name)
Returns the enum constant of this type with the specified name. 
 | 
static Uniqueness[] | 
values()
Returns an array containing the constants of this enum type, in
the order they are declared. 
 | 
compareTo, equals, getDeclaringClass, hashCode, name, ordinal, toString, valueOfcreate, eagerStartBranchespublic static final Uniqueness NODE_GLOBAL
public static final Uniqueness NODE_PATH
public static final Uniqueness NODE_RECENT
NODE_GLOBAL, but only guarantees
 uniqueness among the most recent visited nodes, with a configurable
 count. Traversing a huge graph is quite memory intensive in that it keeps
 track of all the nodes it has visited. For huge graphs a traverser
 can hog all the memory in the JVM, causing OutOfMemoryError.
 Together with this Uniqueness you can supply a count, which is
 the number of most recent visited nodes. This can cause a node to be
 visited more than once, but scales infinitely.public static final Uniqueness NODE_LEVEL
public static final Uniqueness RELATIONSHIP_GLOBAL
public static final Uniqueness RELATIONSHIP_PATH
public static final Uniqueness RELATIONSHIP_RECENT
NODE_RECENT, but for relationships.public static final Uniqueness RELATIONSHIP_LEVEL
public static final Uniqueness NONE
public static Uniqueness[] values()
for (Uniqueness c : Uniqueness.values()) System.out.println(c);
public static Uniqueness valueOf(String name)
name - the name of the enum constant to be returned.IllegalArgumentException - if this enum type has no constant with the specified nameNullPointerException - if the argument is nullCopyright © 2002–2016 The Neo4j Graph Database Project. All rights reserved.