Class

gremlin.scala.dsl

Steps

Related Doc: package dsl

Permalink

class Steps[EndDomain, EndGraph, Labels <: HList] extends StepsRoot

Linear Supertypes
StepsRoot, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Steps
  2. StepsRoot
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Steps(raw: GremlinScala[EndGraph])(implicit converter: Aux[EndDomain, EndGraph])

    Permalink

Type Members

  1. type EndDomain0 = EndDomain

    Permalink
    Definition Classes
    StepsStepsRoot
  2. type EndGraph0 = EndGraph

    Permalink
    Definition Classes
    StepsStepsRoot

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def and(andTraversals: (Steps[EndDomain, EndGraph, HNil]) ⇒ Steps[_, _, _]*): Steps[EndDomain, EndGraph, Labels]

    Permalink

    The and step is a filter with multiple and related filter traversals.

  5. def as[NewLabels <: HList](stepLabel: StepLabel[EndDomain])(implicit prependDomain: shapeless.ops.hlist.Prepend.Aux[Labels, ::[EndDomain, HNil], NewLabels]): Steps[EndDomain, EndGraph, NewLabels]

    Permalink
  6. def as[NewLabels <: HList](stepLabel: String)(implicit prependDomain: shapeless.ops.hlist.Prepend.Aux[Labels, ::[EndDomain, HNil], NewLabels]): Steps[EndDomain, EndGraph, NewLabels]

    Permalink
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def clone(): Steps[EndDomain, EndGraph, Labels]

    Permalink
    Definition Classes
    Steps → AnyRef
  9. implicit val converter: Aux[EndDomain, EndGraph]

    Permalink
  10. def count(): Long

    Permalink
  11. def dedup(): Steps[EndDomain, EndGraph, Labels]

    Permalink
  12. def emit(emitTraversal: (Steps[EndDomain, EndGraph, HNil]) ⇒ Steps[_, _, _]): Steps[EndDomain, EndGraph, Labels]

    Permalink

    Emit is used with the repeat step to emit the elements of the repeatTraversal after each iteration of the repeat loop.

    Emit is used with the repeat step to emit the elements of the repeatTraversal after each iteration of the repeat loop. The emitTraversal defines under which condition the elements are emitted.

  13. def emit(): Steps[EndDomain, EndGraph, Labels]

    Permalink

    Emit is used with the repeat step to emit the elements of the repeatTraversal after each iteration of the repeat loop.

  14. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  16. def exec(): Unit

    Permalink
  17. def filter(predicate: (Steps[EndDomain, EndGraph, Labels]) ⇒ Steps[_, _, _]): Steps[EndDomain, EndGraph, Labels]

    Permalink
  18. def filterNot(predicate: (Steps[EndDomain, EndGraph, Labels]) ⇒ Steps[_, _, _]): Steps[EndDomain, EndGraph, Labels]

    Permalink
  19. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def flatMap[NewSteps <: StepsRoot](fun: (EndDomain) ⇒ NewSteps)(implicit constr: Aux[flatMap.NewSteps.EndDomain0, Labels, flatMap.NewSteps.EndGraph0, NewSteps], newConverter: Converter[flatMap.NewSteps.EndDomain0]): NewSteps

    Permalink
  21. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  22. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  23. def head(): EndDomain

    Permalink
  24. def headOption(): Option[EndDomain]

    Permalink
  25. def isDefined: Boolean

    Permalink
  26. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  27. def iterate(): Unit

    Permalink
  28. def l: List[EndDomain]

    Permalink

    shortcut for toList

  29. def map[NewEndDomain, NewEndGraph, NewSteps <: StepsRoot](fun: (EndDomain) ⇒ NewEndDomain)(implicit newConverter: Aux[NewEndDomain, NewEndGraph], constr: Aux[NewEndDomain, Labels, NewEndGraph, NewSteps]): NewSteps

    Permalink
  30. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  31. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  33. def onRaw(fun: (GremlinScala[EndGraph]) ⇒ GremlinScala[EndGraph]): Steps[EndDomain, EndGraph, Labels]

    Permalink
  34. def or(orTraversals: (Steps[EndDomain, EndGraph, HNil]) ⇒ Steps[_, _, _]*): Steps[EndDomain, EndGraph, Labels]

    Permalink

    The or step is a filter with multiple or related filter traversals.

  35. def orderBy[A](fun: (EndDomain) ⇒ A): Steps[EndDomain, EndGraph, Labels]

    Permalink

    Step that orders nodes according to f.

  36. def p(): List[String]

    Permalink

    print the results to stdout

  37. val raw: GremlinScala[EndGraph]

    Permalink
    Definition Classes
    StepsStepsRoot
  38. def repeat[NewEndDomain >: EndDomain](repeatTraversal: (Steps[EndDomain, EndGraph, HNil]) ⇒ Steps[NewEndDomain, EndGraph, _])(implicit newConverter: Aux[NewEndDomain, EndGraph]): Steps[NewEndDomain, EndGraph, Labels]

    Permalink

    Repeat the given traversal.

    Repeat the given traversal. This step can be combined with the until and emit steps to provide a termination and emit criteria.

  39. def s(): Stream[EndDomain]

    Permalink

    Alias for toStream

  40. def select[StepLabelsTuple <: Product, StepLabels <: HList, H0, T0 <: HList, SelectedTypes <: HList, SelectedTypesTuple <: Product, SelectedGraphTypesTuple <: Product, LabelNames <: HList, Z](stepLabelsTuple: StepLabelsTuple)(implicit toHList: Aux[StepLabelsTuple, StepLabels], hasOne: Aux[StepLabels, H0, T0], hasTwo: IsHCons[T0], extractLabelType: Aux[StepLabels, SelectedTypes], tupler: shapeless.ops.hlist.Tupler.Aux[SelectedTypes, SelectedTypesTuple], conv: Aux[SelectedTypesTuple, SelectedGraphTypesTuple], stepLabelToString: Aux[GetLabelName.type, StepLabels, LabelNames], trav: Aux[LabelNames, List, String], folder: Aux[StepLabels, (HNil, Map[String, Any]), combineLabelWithValue.type, (SelectedTypes, Z)]): Steps[SelectedTypesTuple, SelectedGraphTypesTuple, Labels]

    Permalink
  41. def select[Label, LabelGraph](label: StepLabel[Label])(implicit conv1: Aux[Label, LabelGraph]): Steps[Label, LabelGraph, Labels]

    Permalink
  42. def select[LabelsGraph <: HList, LabelsGraphTuple, LabelsTuple]()(implicit conv1: Aux[Labels, LabelsGraph], tupler1: shapeless.ops.hlist.Tupler.Aux[LabelsGraph, LabelsGraphTuple], tupler2: shapeless.ops.hlist.Tupler.Aux[Labels, LabelsTuple], conv2: Aux[LabelsTuple, LabelsGraphTuple]): Steps[LabelsTuple, LabelsGraphTuple, Labels]

    Permalink
  43. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  44. def times(maxLoops: Int): Steps[EndDomain, EndGraph, Labels]

    Permalink

    Modifier for repeat steps.

    Modifier for repeat steps. Configure the amount of times the repeat traversal is executed.

  45. def toBuffer(): Buffer[EndDomain]

    Permalink

    Execute the traversal and convert it to a mutable buffer

  46. def toList(): List[EndDomain]

    Permalink
  47. def toSet(): Set[EndDomain]

    Permalink
  48. def toStream(): Stream[EndDomain]

    Permalink
  49. def toString(): String

    Permalink
    Definition Classes
    Steps → AnyRef → Any
  50. def until(untilTraversal: (Steps[EndDomain, EndGraph, HNil]) ⇒ Steps[_, _, _]): Steps[EndDomain, EndGraph, Labels]

    Permalink

    Termination criteria for a repeat step.

    Termination criteria for a repeat step. If used before the repeat step it as "while" characteristics. If used after the repeat step it as "do-while" characteristics

  51. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from StepsRoot

Inherited from AnyRef

Inherited from Any

Ungrouped