Class

gremlin.scala.dsl

NodeSteps

Related Doc: package dsl

Permalink

class NodeSteps[EndDomain <: DomainRoot, Labels <: HList] extends Steps[EndDomain, Vertex, Labels]

Linear Supertypes
Steps[EndDomain, Vertex, Labels], StepsRoot, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSteps
  2. Steps
  3. StepsRoot
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeSteps(raw: GremlinScala[Vertex, _])(implicit marshaller: Marshallable[EndDomain])

    Permalink

Type Members

  1. type EndDomain0 = EndDomain

    Permalink
    Definition Classes
    StepsStepsRoot
  2. type EndGraph0 = Vertex

    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 aggregate[NewSteps](into: Buffer[EndDomain])(implicit constr: Aux[EndDomain, Labels, Vertex, NewSteps]): NewSteps

    Permalink

    Aggregate all objects at this point into the given collection, e.g.

    Aggregate all objects at this point into the given collection, e.g. mutable.ArrayBuffer.empty[EndDomain] Uses eager evaluation (as opposed to store() which lazily fills a collection)

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

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

    Permalink
    Definition Classes
    Steps
  7. final def asInstanceOf[T0]: T0

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

    Permalink
    Definition Classes
    Steps → AnyRef
  9. def dedup[NewSteps](implicit constr: Aux[EndDomain, Labels, Vertex, NewSteps]): NewSteps

    Permalink
    Definition Classes
    Steps
  10. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  12. def filter[NewSteps](predicate: (NodeSteps.this.type) ⇒ Steps[_, _, _])(implicit constr: Aux[EndDomain, Labels, Vertex, NewSteps]): NewSteps

    Permalink
    Definition Classes
    Steps
  13. def filterNot[NewSteps](predicate: (NodeSteps.this.type) ⇒ Steps[_, _, _])(implicit constr: Aux[EndDomain, Labels, Vertex, NewSteps]): NewSteps

    Permalink
    Definition Classes
    Steps
  14. def filterOnEnd[NewSteps](predicate: (EndDomain) ⇒ Boolean)(implicit constr: Aux[EndDomain, Labels, Vertex, NewSteps]): NewSteps

    Permalink
  15. def finalize(): Unit

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

    Permalink
    Definition Classes
    Steps
  17. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Steps
  20. def headOption(): Option[EndDomain]

    Permalink
    Definition Classes
    Steps
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. def map[NewEndDomain, NewEndGraph, NewSteps <: StepsRoot](fun: (EndDomain) ⇒ NewEndDomain)(implicit newConverter: Aux[NewEndDomain, NewEndGraph], constr: Aux[NewEndDomain, Labels, NewEndGraph, NewSteps]): NewSteps

    Permalink
    Definition Classes
    Steps
  23. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  26. def onRaw[NewSteps](fun: (GremlinScala[Vertex, _]) ⇒ GremlinScala[Vertex, _])(implicit constr: Aux[EndDomain, Labels, Vertex, NewSteps]): NewSteps

    Permalink
    Definition Classes
    Steps
  27. val raw: GremlinScala[Vertex, _]

    Permalink
    Definition Classes
    NodeStepsStepsStepsRoot
  28. 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
    Definition Classes
    Steps
  29. def select[Label, LabelGraph](label: StepLabel[Label])(implicit conv1: Aux[Label, LabelGraph]): Steps[Label, LabelGraph, Labels]

    Permalink
    Definition Classes
    Steps
  30. 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
    Definition Classes
    Steps
  31. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  32. def toList(): List[EndDomain]

    Permalink
    Definition Classes
    Steps
  33. def toSet(): Set[EndDomain]

    Permalink
    Definition Classes
    Steps
  34. def toString(): String

    Permalink
    Definition Classes
    Steps → AnyRef → Any
  35. final def wait(): Unit

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

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

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

Inherited from Steps[EndDomain, Vertex, Labels]

Inherited from StepsRoot

Inherited from AnyRef

Inherited from Any

Ungrouped