NodeSteps

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def aggregate[NewSteps](into: Buffer[EndDomain])(implicit constr: Aux[EndDomain, Vertex, NewSteps]): NewSteps

   

   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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def dedup[NewSteps]()(implicit constr: Aux[EndDomain, Vertex, NewSteps]): NewSteps

   

   Definition Classes

   Steps

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def filter[NewSteps](predicate: (NodeSteps.this.type) ⇒ Steps[_, _])(implicit constr: Aux[EndDomain, Vertex, NewSteps]): NewSteps

    

    Definition Classes

    Steps

11. def filterOnEnd[NewSteps](predicate: (EndDomain) ⇒ Boolean)(implicit constr: Aux[EndDomain, Vertex, NewSteps]): NewSteps

    

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. def flatMap[NewSteps <: StepsRoot](fun: (EndDomain) ⇒ NewSteps)(implicit constr: Aux[Steps.flatMap.NewSteps.EndDomain0, Steps.flatMap.NewSteps.EndGraph0, NewSteps], newConverter: Converter[Steps.flatMap.NewSteps.EndDomain0]): NewSteps

    

    Definition Classes

    Steps

14. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

15. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

16. def head(): EndDomain

    

    Definition Classes

    Steps

17. def headOption(): Option[EndDomain]

    

    Definition Classes

    Steps

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    Steps

20. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. def onRaw[NewSteps](fun: (GremlinScala[Vertex, HNil]) ⇒ GremlinScala[Vertex, HNil])(implicit constr: Aux[EndDomain, Vertex, NewSteps]): NewSteps

    

    Definition Classes

    Steps

24. val raw: GremlinScala[Vertex, HNil]

    

    Definition Classes

    NodeSteps → Steps → StepsRoot

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

    

    Definition Classes

    AnyRef

26. def toList(): List[EndDomain]

    

    Definition Classes

    Steps

27. def toSet(): Set[EndDomain]

    

    Definition Classes

    Steps

28. def toString(): String

    

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

30. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )