| Modifier and Type | Class and Description | 
|---|---|
| class  | ComputerResultStep<S> | 
| class  | ConnectedComponentVertexProgramStep | 
| class  | PageRankVertexProgramStep | 
| class  | PeerPressureVertexProgramStep | 
| class  | ProgramVertexProgramStep | 
| class  | ShortestPathVertexProgramStep | 
| class  | TraversalVertexProgramStep | 
| class  | VertexProgramStep | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | RemoteStep<S,E>Sends a  Traversalto aRemoteConnectionand iterates back the results. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | BranchStep<S,E,M> | 
| class  | ChooseStep<S,E,M>A step which offers a choice of two or more Traversals to take. | 
| class  | LocalStep<S,E> | 
| class  | OptionalStep<S> | 
| class  | RepeatStep<S> | 
| static class  | RepeatStep.RepeatEndStep<S> | 
| class  | UnionStep<S,E> | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AndStep<S> | 
| class  | ClassFilterStep<S,T> | 
| class  | CoinStep<S> | 
| class  | ConnectiveStep<S> | 
| class  | DedupGlobalStep<S> | 
| class  | DropStep<S> | 
| class  | FilterStep<S> | 
| class  | HasStep<S extends Element> | 
| class  | IsStep<S> | 
| class  | LambdaFilterStep<S> | 
| class  | NoneStep<S> | 
| class  | NotStep<S> | 
| class  | OrStep<S> | 
| class  | PathFilterStep<S> | 
| class  | RangeGlobalStep<S> | 
| class  | SampleGlobalStep<S> | 
| class  | TailGlobalStep<S> | 
| class  | TimeLimitStep<S> | 
| class  | TraversalFilterStep<S> | 
| class  | WherePredicateStep<S> | 
| class  | WhereTraversalStep<S> | 
| static class  | WhereTraversalStep.WhereEndStep | 
| static class  | WhereTraversalStep.WhereStartStep<S> | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AddEdgeStartStep | 
| class  | AddEdgeStep<S> | 
| class  | AddVertexStartStep | 
| class  | AddVertexStep<S> | 
| class  | CallStep<S,E>Reference implementation for service calls via the  ServiceRegistryandServiceAPIs. | 
| class  | CoalesceStep<S,E> | 
| class  | ConstantStep<S,E> | 
| class  | CountGlobalStep<S> | 
| class  | CountLocalStep<S> | 
| class  | DedupLocalStep<E,S extends Iterable<E>> | 
| class  | EdgeOtherVertexStep | 
| class  | EdgeVertexStep | 
| class  | ElementMapStep<K,E>Converts a  Elementto aMap. | 
| class  | ElementStep<P extends Property,E extends Element>Traverse from a Property to its Element. | 
| class  | FlatMapStep<S,E> | 
| class  | FoldStep<S,E> | 
| class  | GraphStep<S,E extends Element> | 
| class  | GroupCountStep<S,E> | 
| class  | GroupStep<S,K,V> | 
| class  | HasNextStep<S> | 
| class  | IdStep<S extends Element> | 
| class  | IndexStep<S,E> | 
| class  | LabelStep<S extends Element> | 
| class  | LambdaCollectingBarrierStep<S> | 
| class  | LambdaFlatMapStep<S,E> | 
| class  | LambdaMapStep<S,E> | 
| class  | LoopsStep<S> | 
| class  | MapStep<S,E> | 
| class  | MatchStep<S,E> | 
| static class  | MatchStep.MatchEndStep | 
| static class  | MatchStep.MatchStartStep | 
| class  | MathStep<S> | 
| class  | MaxGlobalStep<S extends Comparable> | 
| class  | MaxLocalStep<E extends Comparable,S extends Iterable<E>> | 
| class  | MeanGlobalStep<S extends Number,E extends Number> | 
| class  | MeanLocalStep<E extends Number,S extends Iterable<E>> | 
| class  | MergeEdgeStep<S>Implementation for the  mergeE()step covering both the start step version and the one used mid-traversal. | 
| class  | MergeVertexStep<S>Implementation for the  mergeV()step covering both the start step version and the one used mid-traversal. | 
| class  | MinGlobalStep<S extends Comparable> | 
| class  | MinLocalStep<E extends Comparable,S extends Iterable<E>> | 
| class  | NoOpBarrierStep<S> | 
| class  | OrderGlobalStep<S,C extends Comparable> | 
| class  | OrderLocalStep<S,C extends Comparable> | 
| class  | PathStep<S> | 
| static class  | ProfileTest.MockStepProfileStrategy callback test. | 
| class  | ProjectStep<S,E> | 
| class  | PropertiesStep<E> | 
| class  | PropertyKeyStep | 
| class  | PropertyMapStep<K,E> | 
| class  | PropertyValueStep<E> | 
| class  | RangeLocalStep<S> | 
| class  | SackStep<S,E> | 
| class  | SampleLocalStep<S> | 
| class  | ScalarMapStep<S,E> | 
| class  | SelectOneStep<S,E> | 
| class  | SelectStep<S,E> | 
| class  | SumGlobalStep<S extends Number> | 
| class  | SumLocalStep<E extends Number,S extends Iterable<E>> | 
| class  | TailLocalStep<S> | 
| class  | TraversalFlatMapStep<S,E> | 
| class  | TraversalMapStep<S,E> | 
| class  | TraversalSelectStep<S,E> | 
| class  | TreeStep<S> | 
| class  | UnfoldStep<S,E> | 
| class  | VertexStep<E extends Element> | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AddPropertyStep<S extends Element> | 
| class  | AggregateGlobalStep<S> | 
| class  | AggregateLocalStep<S> | 
| class  | FailStep<S>Triggers an immediate failure of the traversal by throwing a  RuntimeException. | 
| class  | GroupCountSideEffectStep<S,E> | 
| class  | GroupSideEffectStep<S,K,V> | 
| class  | IdentityStep<S> | 
| class  | InjectStep<S> | 
| class  | IoStep<S>Handles read and write operations into the  Graph. | 
| class  | LambdaSideEffectStep<S> | 
| class  | ProfileSideEffectStep<S> | 
| class  | SackValueStep<S,A,B> | 
| class  | SideEffectCapStep<S,E> | 
| class  | SideEffectStep<S> | 
| class  | StartStep<S> | 
| class  | SubgraphStepA side-effect step that produces an edge induced subgraph. | 
| class  | TraversalSideEffectStep<S> | 
| class  | TreeSideEffectStep<S> | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | CollectingBarrierStep<S> | 
| class  | ComputerAwareStep<S,E> | 
| static class  | ComputerAwareStep.EndStep<S> | 
| class  | ProfileStep<S> | 
| class  | ReducingBarrierStep<S,E> | 
| class  | RequirementsStep<S> | 
| class  | SupplyingBarrierStep<S,E> | 
| Modifier and Type | Method and Description | 
|---|---|
| AbstractStep<S,E> | AbstractStep. clone() | 
| Modifier and Type | Class and Description | 
|---|---|
| static class  | ReferenceElementStrategy.ReferenceElementStep<S,E> | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | TinkerCountGlobalStep<S extends Element> | 
| class  | TinkerMergeEdgeStep<S>Optimizes  mergeE()searches by attempting to use an index where possible. | 
| class  | TinkerMergeVertexStep<S>Optimizes  mergeV()searches by attempting to use an index where possible. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | TinkerGraphStep<S,E extends Element> | 
Copyright © 2013–2022 Apache Software Foundation. All rights reserved.