Class

lspace.librarian.traversal.Traversal

TraversalMod

Related Doc: package Traversal

Permalink

implicit class TraversalMod[Start, ST[+Z] <: structure.ClassType[Z], End, ET[+Z] <: structure.ClassType[Z], Steps <: HList, Segments <: HList] extends TMod[Start, ST, End, ET, Steps, Segments] with FilterStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]] with CommonStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]] with ClipStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]] with MoveStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]] with MoveMapStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Linear Supertypes
MoveMapStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]], MoveStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]], ClipStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]], CommonStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]], FilterStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]], TMod[Start, ST, End, ET, Steps, Segments], BaseMod[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TraversalMod
  2. MoveMapStepsHelper
  3. MoveStepsHelper
  4. ClipStepsHelper
  5. CommonStepsHelper
  6. FilterStepsHelper
  7. TMod
  8. BaseMod
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TraversalMod(_traversal: Traversal[ST[Start], ET[End], ::[Segment[Steps], Segments]])

    Permalink

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 E[S, E](resource: structure.Edge[S, E]*)(implicit arg0: DefaultsToAny[S], arg1: DefaultsToAny[E]): Traversal[ST[Start], EdgeURLType[structure.Edge[S, E]], ::[Segment[::[E, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  5. def E: Traversal[ST[Start], EdgeURLType[structure.Edge[Any, Any]], ::[Segment[::[E, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  6. def G(graph: structure.Graph*): Traversal[ST[Start], GraphType[structure.Graph], ::[Segment[::[G, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  7. def N(resource: structure.Node, resources: structure.Node*): Traversal[ST[Start], NodeURLType[structure.Node], ::[Segment[::[N, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  8. def N(): Traversal[ST[Start], NodeURLType[structure.Node], ::[Segment[::[N, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  9. def V[T, OutC, Out <: structure.ClassType[OutC]](value: T, values: T*)(implicit cls: Aux[T, OutC, Out]): Traversal[ST[Start], Out, ::[Segment[::[V, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  10. def V(): Traversal[ST[Start], datatype.DataType[Any], ::[Segment[::[V, HNil]], ::[Segment[Steps], Segments]]]

    Permalink

  11. val _traversal: Traversal[ST[Start], ET[End], ::[Segment[Steps], Segments]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversalMod → TMod

  12. def add[S <: ResourceStep, ST <: structure.ClassType[_], ET <: structure.ClassType[_]](step: S, st: ST, et: ET)(implicit ev: <:<[S, ResourceStep]): Traversal[ST, ET, ::[Segment[::[S, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Attributes
    protected
    Definition Classes
    TMod → BaseMod

  13. def add[S <: MoveStep, ST <: structure.ClassType[_], ET <: structure.ClassType[_]](step: S, st: ST, et: ET)(implicit ev: <:<[S, MoveStep]): Traversal[ST, ET, ::[Segment[::[S, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Attributes
    protected
    Definition Classes
    TMod → BaseMod

  14. def add[S <: Step, ST <: structure.ClassType[_], ET <: structure.ClassType[_]](step: S, st: ST, et: ET)(implicit ev: <:!<[S, MoveStep], ev2: <:!<[S, ResourceStep]): Traversal[ST, ET, ::[Segment[::[S, Steps]], Segments]]

    Permalink
    Attributes
    protected
    Definition Classes
    TMod → BaseMod

  15. def add[S <: ResourceStep](step: S)(implicit ev: <:<[S, ResourceStep]): Traversal[ST[Start], ET[End], ::[Segment[::[S, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Attributes
    protected
    Definition Classes
    TMod → BaseMod

  16. def add[S <: MoveStep](step: S)(implicit ev: <:<[S, MoveStep]): Traversal[ST[Start], ET[End], ::[Segment[::[S, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Attributes
    protected
    Definition Classes
    TMod → BaseMod

  17. def add[S <: Step](step: S)(implicit ev: <:!<[S, MoveStep], ev2: <:!<[S, ResourceStep]): Traversal[ST[Start], ET[End], ::[Segment[::[S, Steps]], Segments]]

    Permalink
    Attributes
    protected
    Definition Classes
    TMod → BaseMod

  18. def and(traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList], traversals: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList]*): Traversal[ST[Start], ET[End], ::[Segment[::[And, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  19. def as[S <: String](name: () ⇒ S): Traversal[ST[Start], ET[End], ::[Segment[::[As[End, S], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  20. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  21. def choose[ET0 <: structure.ClassType[_], End1, ET1 <: structure.ClassType[End1], Steps1 <: HList, Steps2 <: HList, Labels1 <: HList, Labels2 <: HList](by: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList], right: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, Steps1], left: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, Steps2])(implicit f1: Aux[Steps1, LabelSteps.type, Labels1], f2: Aux[Steps2, LabelSteps.type, Labels2], ev2: =:=[Labels1, Labels2], et0: Aux[ET0, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[Choose[ET[End], ET0], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  22. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  23. def coalesce[ET0 <: structure.ClassType[_], End1, ET1 <: structure.ClassType[End1], Steps1 <: HList, Steps2 <: HList, Labels1 <: HList, Labels2 <: HList](traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, Steps1], traversals: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, Steps2]*)(implicit f1: Aux[Steps1, LabelSteps.type, Labels1], f2: Aux[Steps2, LabelSteps.type, Labels2], ev2: =:=[Labels1, Labels2], et0: Aux[ET0, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[Coalesce[ET[End], ET0], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  24. def coin(p: Double): Traversal[ST[Start], ET[End], ::[Segment[::[Coin, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  25. def constant[T, T0, TT0 <: structure.ClassType[_]](p: T)(implicit ct: Aux[T, T0, TT0]): Traversal[ST[Start], TT0, ::[Segment[::[Constant[T, T0, TT0], HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    FilterStepsHelper

  26. def count(): Traversal[ST[Start], LongType[Long], ::[Segment[::[Count, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  27. def dedup(): Traversal[ST[Start], ET[End], ::[Segment[::[Dedup, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  28. def drop(): Traversal[ST[Start], ET[End], ::[Segment[::[Drop, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

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

    Permalink
    Definition Classes
    AnyRef

  30. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  31. def et: ET[End]

    Permalink
    Definition Classes
    TraversalMod → BaseMod

  32. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Permalink
    Definition Classes
    AnyRef → Any

  34. def group[CK <: structure.ClassType[_], KeySegments <: HList, KSteps <: HList, KContainers <: HList, KOut, CKOut <: structure.ClassType[_]](by: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CK, KeySegments])(implicit flatK: Aux[SegmentMapper.type, KeySegments, KSteps], fK: Aux[KSteps, ContainerSteps.type, KContainers], outK: Aux[CK, KContainers, KOut, CKOut]): Traversal[ST[Start], TupleType[(KOut, List[End])], ::[Segment[::[Group[CK, KeySegments, ET[End], HNil], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  35. def has[L, T](label: L, value: logic.predicate.P[T])(implicit arg0: PropertyLabel[L]): Traversal[ST[Start], ET[End], ::[Segment[::[Has, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  36. def has[L](label: L)(implicit arg0: PropertyLabel[L]): Traversal[ST[Start], ET[End], ::[Segment[::[Has, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  37. def hasId(ids: Set[Long]): Traversal[ST[Start], ET[End], ::[Segment[::[HasId, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  38. def hasId(id: Long, ids: Long*): Traversal[ST[Start], ET[End], ::[Segment[::[HasId, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  39. def hasIri(iris: Set[String]): Traversal[ST[Start], ET[End], ::[Segment[::[HasIri, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  40. def hasIri(iri: String, uris: String*): Traversal[ST[Start], ET[End], ::[Segment[::[HasIri, Steps]], Segments]]

    Permalink

    has at least one of the provided iris

    has at least one of the provided iris

    Definition Classes
    FilterStepsHelper

  41. def hasLabel[A](implicit cls: ClassTypeable[A]): Traversal[ST[Start], CT, ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  42. def hasLabel[T <: datatype.DataType[_], End1, ET1 <: structure.ClassType[_]](label: T)(implicit et: Aux[T, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  43. def hasLabel(label: structure.Property): Traversal[ST[Start], EdgeURLType[structure.Edge[Any, Any]], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  44. def hasLabel(label: structure.Ontology): Traversal[ST[Start], NodeURLType[structure.Node], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink

    has at least one of the provided labels

    has at least one of the provided labels

    Definition Classes
    FilterStepsHelper

  45. def hasLabels[T, ET0[+Z] <: structure.ClassType[Z], End1, ET1 <: structure.ClassType[_]](label0: ET0[T], label1: ET0[T], label2: ET0[T], label3: ET0[T])(implicit et: Aux[ET0[T], End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  46. def hasLabels[T, ET0[+Z] <: structure.ClassType[Z], End1, ET1 <: structure.ClassType[_]](label0: ET0[T], label1: ET0[T], label2: ET0[T])(implicit et: Aux[ET0[T], End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  47. def hasLabels[ET0 <: structure.ClassType[_], End1, ET1 <: structure.ClassType[_]](label0: ET0, label1: ET0)(implicit et: Aux[ET0, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  48. def hasNot[L, T](label: L, value: logic.predicate.P[T])(implicit arg0: PropertyLabel[L]): Traversal[ST[Start], ET[End], ::[Segment[::[HasNot, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  49. def hasNot[L](label: L)(implicit arg0: PropertyLabel[L]): Traversal[ST[Start], ET[End], ::[Segment[::[HasNot, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  50. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  51. def head(): Traversal[ST[Start], ET[End], ::[Segment[::[Head, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  52. def id: Traversal[ST[Start], LongType[Long], ::[Segment[::[Id.type, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  53. def in(key: structure.Property*): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[In, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  54. def in(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[In, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  55. def in(keys: List[structure.Property]): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[In, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  56. def in(key: String, keys: String*): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[In, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  57. def inE(key: structure.Property*): Traversal[ST[Start], EdgeURLType[structure.Edge[Any, End]], ::[Segment[::[InE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  58. def inE(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], EdgeURLType[structure.Edge[Any, End]], ::[Segment[::[InE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  59. def inE(keys: List[structure.Property]): Traversal[ST[Start], EdgeURLType[structure.Edge[Any, End]], ::[Segment[::[InE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  60. def inE(key: String, keys: String*): Traversal[ST[Start], EdgeURLType[structure.Edge[Any, End]], ::[Segment[::[InE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  61. def inEMap(key: structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[Any, End]]], ::[Segment[::[InEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  62. def inEMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[Any, End]]], ::[Segment[::[InEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  63. def inEMap(keys: List[structure.Property]): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[Any, End]]], ::[Segment[::[InEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  64. def inEMap(key: String, keys: String*): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[Any, End]]], ::[Segment[::[InEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  65. def inMap(key: structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[InMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  66. def inMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[InMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  67. def inMap(keys: List[structure.Property]): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[InMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  68. def inMap(key: String, keys: String*): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[InMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  69. def iri: Traversal[ST[Start], (defaultString)#CT, ::[Segment[::[HasLabel, ::[Out, HNil]]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  70. def is(predicate: logic.predicate.P[End]): Traversal[ST[Start], ET[End], ::[Segment[::[Is, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  71. def isColor: Traversal[ST[Start], ColorType[Any], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  72. def isDuration: Traversal[ST[Start], DurationType, ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  73. def isGeo: Traversal[ST[Start], GeometricType[Geometry], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  74. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  75. def isNumber: Traversal[ST[Start], NumericType[AnyVal], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  76. def isQuantity: Traversal[ST[Start], QuantityType[Any], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  77. def isTemporal: Traversal[ST[Start], CalendarType[Any], ::[Segment[::[HasLabel, Steps]], Segments]]

    Permalink
    Definition Classes
    FilterStepsHelper

  78. def last(): Traversal[ST[Start], ET[End], ::[Segment[::[Last, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  79. def limit(max: Int): Traversal[ST[Start], ET[End], ::[Segment[::[Limit, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  80. def local[ET0 <: structure.ClassType[_], Labels1 <: HList](traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, _ <: HList]): Traversal[ST[Start], ET0, ::[Segment[::[Local[ET[End], ET0], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  81. def max[CT <: datatype.DataType[_]](by: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CT, _ <: HList])(implicit arg0: Orderable[CT]): Traversal[ST[Start], CT, ::[Segment[::[Max, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  82. def min[CT <: datatype.DataType[_]](by: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CT, _ <: HList])(implicit arg0: Orderable[CT]): Traversal[ST[Start], CT, ::[Segment[::[Min, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    AnyRef

  84. def noTimeLimit(): Traversal[ST[Start], ET[End], ::[Segment[::[TimeLimit, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  85. def not(traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList]): Traversal[ST[Start], ET[End], ::[Segment[::[Not, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  86. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  87. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  88. def or(traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList], traversals: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList]*): Traversal[ST[Start], ET[End], ::[Segment[::[Or, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  89. def order[CT <: datatype.DataType[_]](by: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CT, _ <: HList], increasing: Boolean = true)(implicit arg0: Orderable[CT]): Traversal[ST[Start], CT, ::[Segment[::[Order, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  90. def out[V, End1, ET1 <: structure.ClassType[End1]](key: structure.TypedProperty[V])(implicit et: Aux[V, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[HasLabel, ::[Out, HNil]]], ::[Segment[Steps], Segments]]]

    Permalink

  91. def out[V, End1, ET1 <: structure.ClassType[End1]](key: structure.TypedProperty[V], p: logic.predicate.P[V])(implicit et: Aux[V, End1, ET1]): Traversal[ST[Start], structure.ClassType[End1], ::[Segment[::[Is, ::[HasLabel, ::[Out, HNil]]]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  92. def out(key: structure.Property*): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[Out, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  93. def out(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[Out, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  94. def out(keys: List[structure.Property]): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[Out, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  95. def out(key: String, keys: String*): Traversal[ST[Start], structure.ClassType[Any], ::[Segment[::[Out, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  96. def outE(key: structure.Property*): Traversal[ST[Start], EdgeURLType[structure.Edge[End, Any]], ::[Segment[::[OutE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  97. def outE(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], EdgeURLType[structure.Edge[End, Any]], ::[Segment[::[OutE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  98. def outE(keys: List[structure.Property]): Traversal[ST[Start], EdgeURLType[structure.Edge[End, Any]], ::[Segment[::[OutE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  99. def outE(key: String, keys: String*): Traversal[ST[Start], EdgeURLType[structure.Edge[End, Any]], ::[Segment[::[OutE, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveStepsHelper

  100. def outEMap(key: structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[End, Any]]], ::[Segment[::[OutEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  101. def outEMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[End, Any]]], ::[Segment[::[OutEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  102. def outEMap(keys: List[structure.Property]): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[End, Any]]], ::[Segment[::[OutEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  103. def outEMap(key: String, keys: String*): Traversal[ST[Start], MapType[structure.Property, List[structure.Edge[End, Any]]], ::[Segment[::[OutEMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  104. def outMap(key: structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[OutMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  105. def outMap(f: (default.type) ⇒ structure.Property, ff: (default.type) ⇒ structure.Property*): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[OutMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  106. def outMap(keys: List[structure.Property]): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[OutMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  107. def outMap(key: String, keys: String*): Traversal[ST[Start], MapType[structure.Property, List[Any]], ::[Segment[::[OutMap, HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  108. def path[ET0 <: structure.ClassType[_], End1, ET1 <: structure.ClassType[End1], Steps0 <: HList](traversal: (Traversal[ET[End], structure.ClassType[Any], HNil]) ⇒ Traversal[ET[End], ET0, Steps0])(implicit et0: Aux[ET0, End1, ET1]): Traversal[ST[Start], structure.ClassType[Nothing], ::[Segment[::[Path[ET0, Steps0], HNil]], ::[Segment[Steps], Segments]]]

    Permalink
    Definition Classes
    CommonStepsHelper

  109. def path: Traversal[ST[Start], structure.ClassType[Nothing], ::[Segment[::[Path[structure.ClassType[Any], HNil], HNil]], ::[Segment[Steps], Segments]]]

    Permalink

    TODO: result of path is a List[ET0]

    TODO: result of path is a List[ET0]

    Definition Classes
    CommonStepsHelper

  110. def project[CP <: structure.ClassType[_], PSegments <: HList, PSteps <: HList, PContainers <: HList, POut, CPOut <: structure.ClassType[_]](by1: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CP, PSegments])(implicit flat: Aux[SegmentMapper.type, PSegments, PSteps], f: Aux[PSteps, ContainerSteps.type, PContainers], out: Aux[CP, PContainers, POut, CPOut]): Traversal[ST[Start], TupleType[POut], ::[Segment[::[Project[::[Traversal[ET[End], CP, PSegments], HNil]], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  111. def project(): Traversal[ST[Start], TupleType[End], ::[Segment[::[Project[::[Traversal[ET[End], ET[End], HNil], HNil]], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  112. def range(low: Int, high: Int): Traversal[ST[Start], ET[End], ::[Segment[::[Range, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  113. def repeat[ET0 <: structure.ClassType[_]](traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, _ <: HList], max: Int = 0, collect: Boolean = false, noloop: Boolean = false)(implicit until: (Traversal[ET0, ET0, HNil]) ⇒ Traversal[ET0, _ <: structure.ClassType[_], _ <: HList] = null): Traversal[ST[Start], ET0, ::[Segment[::[Repeat[ET0], Steps]], Segments]]

    Permalink

    traversal

    to be repeated

    max

    number of times is being repeated

    collect

    result of each loop

    until

    nonempty traversal is being repeated

    Definition Classes
    CommonStepsHelper

  114. def st: ST[Start]

    Permalink
    Definition Classes
    TraversalMod → BaseMod

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

    Permalink
    Definition Classes
    AnyRef

  116. def tail(max: Int): Traversal[ST[Start], ET[End], ::[Segment[::[Tail, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  117. def timeLimit(time: Time): Traversal[ST[Start], ET[End], ::[Segment[::[TimeLimit, Steps]], Segments]]

    Permalink
    Definition Classes
    ClipStepsHelper

  118. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  119. def union[ET0 <: structure.ClassType[_], End1, ET1 <: structure.ClassType[End1], Steps1 <: HList, Steps2 <: HList, Labels1 <: HList, Labels2 <: HList](traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, Steps1], traversals: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], ET0, Steps2]*)(implicit f1: Aux[Steps1, LabelSteps.type, Labels1], f2: Aux[Steps2, LabelSteps.type, Labels2], ev2: =:=[Labels1, Labels2], et0: Aux[ET0, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[Union[ET[End], ET0], Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

  120. final def wait(): Unit

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

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

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

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

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

  123. def where(traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: structure.ClassType[_], _ <: HList]): Traversal[ST[Start], ET[End], ::[Segment[::[Where, Steps]], Segments]]

    Permalink
    Definition Classes
    CommonStepsHelper

Inherited from MoveMapStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Inherited from MoveStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Inherited from ClipStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Inherited from CommonStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Inherited from FilterStepsHelper[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Inherited from TMod[Start, ST, End, ET, Steps, Segments]

Inherited from BaseMod[Start, ST, End, ET, Steps, Segments, ::[Segment[Steps], Segments]]

Inherited from AnyRef

Inherited from Any

Ungrouped