URI uri
InetSocketAddress address
Iterator<E> traversers
Traverser.Admin<T> lastTraverser
String remoteStackTrace
Traversal.Admin<S,E> vertexFilter
Traversal.Admin<S,E> edgeFilter
Map<K,V> edgeLegality
boolean allowNoEdges
String key
BinaryOperator<T> reducer
boolean isTransient
boolean isBroadcast
String key
boolean isTransient
TraversalSideEffects sideEffects
Memory memory
ProgramPhase phase
Long count
Parameters parameters
PureTraversal<S,E> edgeTraversal
String clusterProperty
Parameters parameters
PureTraversal<S,E> edgeTraversal
String pageRankProperty
int times
double alpha
Parameters parameters
PureTraversal<S,E> edgeTraversal
String clusterProperty
int times
Parameters parameters
PureTraversal<S,E> targetVertexFilter
PureTraversal<S,E> edgeTraversal
PureTraversal<S,E> distanceTraversal
Number maxDistance
boolean includeEdges
PureTraversal<S,E> computerTraversal
Computer computer
boolean first
Computer computer
long bulk
RemoteTraversal<S,E> remoteTraversal
AtomicReference<V> traversalFuture
RemoteConnection remoteConnection
BiPredicate<T,U> biPredicate
Object value
Object originalValue
Element element
Traversal.Admin<S,E> bypassTraversal
Object end
Object s
long maxLoops
boolean allow
Traversal.Admin<S,E> localTraversal
boolean first
Traversal.Admin<S,E> optionalTraversal
Traversal.Admin<S,E> repeatTraversal
Traversal.Admin<S,E> untilTraversal
Traversal.Admin<S,E> emitTraversal
String loopName
boolean untilFirst
boolean emitFirst
Random random
double probability
CallbackRegistry<E extends Event> callbackRegistry
Parameters parameters
List<E> hasContainers
Traversal.Admin<S,E> notTraversal
long low
long high
AtomicLong counter
boolean bypass
long highRange
Traversal.Admin<S,E> probabilityTraversal
int amountToSample
Random random
AtomicLong startTime
long timeLimit
AtomicBoolean timedOut
Parameters parameters
Traversal.Admin<S,E> filterTraversal
String selectKey
boolean first
Parameters parameters
CallbackRegistry<E extends Event> callbackRegistry
Parameters parameters
CallbackRegistry<E extends Event> callbackRegistry
Parameters parameters
boolean first
CallbackRegistry<E extends Event> callbackRegistry
Parameters parameters
CallbackRegistry<E extends Event> callbackRegistry
Object constant
Parameters parameters
Parameters parameters
Direction direction
String[] propertyKeys
boolean onGraphComputer
Traverser.Admin<T> head
Iterator<E> iterator
boolean listFold
BiFunction<T,U,R> biFunction
Parameters parameters
Class<T> returnClass
Object[] ids
boolean isStart
boolean done
Traverser.Admin<T> head
Iterator<E> iterator
Traversal.Admin<S,E> keyTraversal
char state
Traversal.Admin<S,E> keyTraversal
Traversal.Admin<S,E> valueTraversal
Barrier<B> barrierStep
boolean resetBarrierForProfiling
BinaryOperator<T> barrierAggregator
Parameters parameters
Function<T,R> indexer
IndexStep.IndexerType indexerType
String loopName
List<E> matchTraversals
boolean first
Set<E> matchStartLabels
Set<E> matchEndLabels
Set<E> scopeKeys
ConnectiveStep.Connective connective
String computedStartLabel
MatchStep.MatchAlgorithm matchAlgorithm
Class<T> matchAlgorithmClass
Map<K,V> referencedLabelsMap
Set<E> dedups
Set<E> dedupLabels
Set<E> keepLabels
TraverserSet<S> standardAlgorithmBarrier
String equation
MathStep.TinkerExpression expression
TraversalRing<A,B> traversalRing
Set<E> keepLabels
long count
Number sum
int maxBarrierSize
TraverserSet<S> barrier
List<E> comparators
MultiComparator<C> multiComparator
long limit
Random random
long limit
MultiComparator<C> comparator
Random random
List<E> comparators
ChainedComparator<S,C extends Comparable> chainedComparator
Random random
List<E> projectKeys
TraversalRing<A,B> traversalRing
Parameters parameters
String[] propertyKeys
PropertyType returnType
String[] propertyKeys
PropertyType returnType
int tokens
Traversal.Admin<S,E> propertyTraversal
Parameters parameters
TraversalRing<A,B> traversalRing
long low
long high
Random random
int amountToSample
long limit
Traversal.Admin<S,E> flatMapTraversal
Traversal.Admin<S,E> mapTraversal
Pop pop
Traversal.Admin<S,E> keyTraversal
Traversal.Admin<S,E> selectTraversal
Set<E> keepLabels
TraversalRing<A,B> traversalRing
Set<E> keepLabels
Parameters parameters
String[] edgeLabels
Direction direction
Class<T> returnClass
Parameters parameters
VertexProperty.Cardinality cardinality
CallbackRegistry<E extends Event> callbackRegistry
Traversal.Admin<S,E> aggregateTraversal
String sideEffectKey
TraverserSet<S> barrier
Traversal.Admin<S,E> storeTraversal
String sideEffectKey
Traversal.Admin<S,E> keyTraversal
String sideEffectKey
char state
Traversal.Admin<S,E> keyTraversal
Traversal.Admin<S,E> valueTraversal
Barrier<B> barrierStep
boolean resetBarrierForProfiling
String sideEffectKey
Object[] injections
Parameters parameters
boolean first
String file
ReadWriting.Mode mode
String sideEffectKey
boolean onGraphComputer
Traversal.Admin<S,E> sackTraversal
BiFunction<T,U,R> sackFunction
Object start
boolean first
Graph subgraph
String sideEffectKey
Graph.Features.VertexFeatures parentGraphFeatures
boolean subgraphSupportsMetaProperties
Traversal.Admin<S,E> sideEffectTraversal
TraverserSet<S> traverserSet
int maxBarrierSize
boolean barrierConsumed
Function<T,R> elementFunction
Comparator<T> valueComparator
String propertyKey
Comparator<T> valueComparator
TraverserSet<S> traverserSet
Step<S,E> hostStep
Function<T,R> function
Comparator<T> comparator
ImmutablePath previousPath
Object currentObject
Set<E> currentLabels
Map<K,V> parameters
Set<E> referencedLabels
List<E> traversals
Parameters.set(TraversalParent, Object...)
because when the parameter map is large the cost of iterating it repeatedly on the
high number of calls to Parameters.getTraversals()
is great.MutableMetrics metrics
boolean onGraphComputer
Supplier<T> seedSupplier
seedSupplier
is null
then the default behavior is to generate the seed from the starts.
This supplier must be callable as a constant and not rely on state from the class. Prefer overriding
ReducingBarrierStep.generateSeedFromStarts()
otherwise.BinaryOperator<T> reducingBiOperator
boolean hasProcessedOnce
Object seed
boolean done
EventStrategy.EventQueue eventQueue
EventStrategy.Detachment detachment
EventStrategy.EventQueue eventQueue
Supplier<T> initialValue
UnaryOperator<T> splitOperator
BinaryOperator<T> mergeOperator
long seed
Traversal.Admin<S,E> vertexCriterion
Traversal.Admin<S,E> edgeCriterion
Traversal.Admin<S,E> vertexPropertyCriterion
boolean checkAdjacentVertices
String MARKER
TraversalSource traversalSource
Translator<S,T> translator
boolean assertBytecode
int standardBarrierSize
boolean throwException
boolean logWarning
Path path
Path path
long bulk
String future
Path path
Path path
Traverser.Admin<T> baseTraverser
List<E> projections
Object t
String label
short count
Traverser.Admin<T> lastTraverser
Step<S,E> finalEndStep
StepPosition stepPosition
List<E> steps
List<E> unmodifiableSteps
TraversalParent parent
TraversalSideEffects sideEffects
TraversalStrategies strategies
Set<E> requirements
boolean locked
boolean closed
Bytecode bytecode
Map<K,V> stepIndexedMetrics
ImmutableMetrics
indexed by their step identifier.long totalStepDuration
Map<K,V> positionIndexedMetrics
ImmutableMetrics
indexed by their step position.boolean finalized
long tempTime
boolean finalized
Traversal.Admin<S,E> pureTraversal
String alias
TraversalSourceFactory<T extends TraversalSource> factory
String script
String scriptEngine
Object[] bindings
int x
int y
int z
String parentId
Traversal.Admin<S,E> traversal
List<E> strategyTraversals
Traversal.Admin<S,E> traversal
TraversalStrategies traversalStrategies
Class<T> traversalSourceClass
ResponseMessage responseMessage
ResponseMessage responseMessage
String testField
DetachedVertex outVertex
DetachedVertex inVertex
Object value
ReferenceVertex inVertex
ReferenceVertex outVertex
ReferenceElement<E extends Element> element
String key
Object value
ReferenceVertex vertex
Object value
boolean normalize
boolean normalize
boolean normalize
Object a
Object[] array
int current
Copyright © 2013–2022 Apache Software Foundation. All rights reserved.