Uses of Interface
org.apache.tinkerpop.gremlin.process.traversal.TraversalStrategy.OptimizationStrategy
Packages that use TraversalStrategy.OptimizationStrategy
Package
Description
-
Uses of TraversalStrategy.OptimizationStrategy in org.apache.tinkerpop.gremlin.process.computer.traversal.strategy.optimization
Classes in org.apache.tinkerpop.gremlin.process.computer.traversal.strategy.optimization that implement TraversalStrategy.OptimizationStrategyModifier and TypeClassDescriptionfinal classfinal classMethods in org.apache.tinkerpop.gremlin.process.computer.traversal.strategy.optimization that return types with arguments of type TraversalStrategy.OptimizationStrategyModifier and TypeMethodDescriptionSet<Class<? extends TraversalStrategy.OptimizationStrategy>>MessagePassingReductionStrategy.applyPrior() -
Uses of TraversalStrategy.OptimizationStrategy in org.apache.tinkerpop.gremlin.process.traversal
Methods in org.apache.tinkerpop.gremlin.process.traversal that return types with arguments of type TraversalStrategy.OptimizationStrategyModifier and TypeMethodDescriptiondefault Set<Class<? extends TraversalStrategy.OptimizationStrategy>>TraversalStrategy.OptimizationStrategy.applyPost()TheGValueReductionStrategyshould be the last TinkerPop optimnization strategy applied.TraversalStrategy.OptimizationStrategy.getTraversalCategory() -
Uses of TraversalStrategy.OptimizationStrategy in org.apache.tinkerpop.gremlin.process.traversal.strategy.optimization
Classes in org.apache.tinkerpop.gremlin.process.traversal.strategy.optimization that implement TraversalStrategy.OptimizationStrategyModifier and TypeClassDescriptionfinal classThis strategy looks for vertex- and value-emitting steps followed by aCountGlobalStepand replaces the pattern with an edge- or property-emitting step followed by aCountGlobalStep.final classThis strategy looks for standard traversals in by-modulators and replaces them with more optimized traversals (e.g.final classThis strategy optimizes any occurrence ofCountGlobalStepfollowed by anIsStep.final classThis strategy looks forRangeGlobalSteps that can be moved further left in the traversal and thus be applied earlier.final classFilterRankingStrategyreorders filter- and order-steps according to their rank.final classConverts placeholder steps that holdGValueobjects to their concrete implementations.final classIdentityRemovalStrategylooks forIdentityStepinstances and removes them.final classThis strategy looks for.outE().inV(),.inE().outV()and.bothE().otherV()and replaces these step sequences with.out(),.in()or.both()respectively.final classThis strategy analyzes filter-steps with child traversals that themselves are pure filters.final classLazyBarrierStrategyis an OLTP-only strategy that automatically inserts aNoOpBarrierStepafter everyFlatMapStepif neither path-tracking nor partial path-tracking is required, and the next step is not the traversal's last step or aBarrier.final classMatchWhereStrategywill fold any post-where()step that maintains a traversal constraint intomatch().final classOrderLimitStrategyis an OLAP strategy that folds aRangeGlobalStepinto a precedingOrderGlobalStep.final classPathProcessStrategyis an OLAP strategy that does its best to turn non-local children inwhere()andselect()into local children by inlining components of the non-local child.final classclassTakes an argument ofby()and wraps itCoalesceStepso that the result is either the initialTraversalargument ornull.final classRepeatUnrollStrategyis an OLTP-only strategy that unrolls anyRepeatStepif it uses a constant number of loops (times(x)) and doesn't emit intermittent elements.Methods in org.apache.tinkerpop.gremlin.process.traversal.strategy.optimization that return types with arguments of type TraversalStrategy.OptimizationStrategyModifier and TypeMethodDescriptionSet<Class<? extends TraversalStrategy.OptimizationStrategy>>GValueReductionStrategy.applyPost()No TinkerPop optimization strategy should be applied following this one.Set<Class<? extends TraversalStrategy.OptimizationStrategy>>IncidentToAdjacentStrategy.applyPost()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>InlineFilterStrategy.applyPost()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>MatchPredicateStrategy.applyPost()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>PathProcessorStrategy.applyPost()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>AdjacentToIncidentStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>ByModulatorOptimizationStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>FilterRankingStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>IncidentToAdjacentStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>InlineFilterStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>LazyBarrierStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>MatchPredicateStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>PathProcessorStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>PathRetractionStrategy.applyPrior()Set<Class<? extends TraversalStrategy.OptimizationStrategy>>ProductiveByStrategy.applyPrior()