Class

lspace.librarian.traversal.Traversal

WithEmptyTraversal

Related Doc: package Traversal

Permalink

implicit class WithEmptyTraversal[Start, ST[+Z] <: ClassType[Z], End, ET[+Z] <: ClassType[Z]] extends TModHNil[Start, ST, End, ET] with FilterStepsHelper[Start, ST, End, ET, HNil, HNil, HNil] with CommonStepsHelper[Start, ST, End, ET, HNil, HNil, HNil] with ClipStepsHelper[Start, ST, End, ET, HNil, HNil, HNil] with MoveStepsHelper[Start, ST, End, ET, HNil, HNil, HNil] with MoveMapStepsHelper[Start, ST, End, ET, HNil, HNil, HNil]

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

Instance Constructors

  1. new WithEmptyTraversal(_traversal: Traversal[ST[Start], ET[End], HNil])

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

  11. val _traversal: Traversal[ST[Start], ET[End], HNil]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    WithEmptyTraversal → TModHNil

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

    Permalink
    Attributes
    protected
    Definition Classes
    TModHNil → BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    TModHNil → BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    TModHNil → BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    TModHNil → BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    TModHNil → BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    TModHNil → BaseMod

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

    Permalink
    Definition Classes
    CommonStepsHelper

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

    Permalink
    Definition Classes
    CommonStepsHelper

  20. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  21. def clone(): AnyRef

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

  22. def coalesce[ET0 <: ClassType[_], End1, ET1 <: 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], HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

  23. def coin(p: Double): Traversal[ST[Start], ET[End], ::[Segment[::[Coin, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  24. def count(): Traversal[ST[Start], LongType[Long], ::[Segment[::[Count, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

  25. def dedup(): Traversal[ST[Start], ET[End], ::[Segment[::[Dedup, HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

  26. def drop(): Traversal[ST[Start], ET[End], ::[Segment[::[Drop, HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

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

    Permalink
    Definition Classes
    AnyRef

  28. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  29. def et: ET[End]

    Permalink
    Definition Classes
    WithEmptyTraversal → BaseMod

  30. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  32. def group[AZ <: ClassType[_], KeySegments <: HList](by: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], AZ, KeySegments]): Traversal[ST[Start], ET[End], ::[Segment[::[Group[AZ, KeySegments], HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

  35. def hasId(ids: Set[Long]): Traversal[ST[Start], ET[End], ::[Segment[::[HasId, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

  37. def hasIri(iris: Set[String]): Traversal[ST[Start], ET[End], ::[Segment[::[HasIri, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink

    has at least one of the provided iris

    has at least one of the provided iris

    Definition Classes
    FilterStepsHelper

  39. def hasLabel[A](implicit cls: ClassTypeable[A]): Traversal[ST[Start], CT, ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  40. def hasLabel[T <: DataType[_], End1, ET1 <: ClassType[_]](label: T)(implicit et: Aux[T, End1, ET1]): Traversal[ST[Start], ET1, ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  41. def hasLabel(label: Property): Traversal[ST[Start], EdgeURLType[Edge[Any, Any]], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  42. def hasLabel(label: Ontology): Traversal[ST[Start], NodeURLType[Node], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink

    has at least one of the provided labels

    has at least one of the provided labels

    Definition Classes
    FilterStepsHelper

  43. def hasLabels[T, ET0[+Z] <: ClassType[Z], End1, ET1 <: 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, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

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

    Permalink
    Definition Classes
    FilterStepsHelper

  48. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  49. def head(): Traversal[ST[Start], ET[End], ::[Segment[::[Head, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    BaseMod

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

  59. def inEMap(key: Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  60. def inEMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  61. def inEMap(keys: List[Property]): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  62. def inEMap(key: String, keys: String*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  63. def inMap(key: Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  64. def inMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  65. def inMap(keys: List[Property]): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  66. def inMap(key: String, keys: String*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[InMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

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

    Permalink
    Definition Classes
    BaseMod

  68. def is(predicate: logic.predicate.P[End]): Traversal[ST[Start], ET[End], ::[Segment[::[Is, HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

  69. def isColor: Traversal[ST[Start], ColorType[Any], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  70. def isDuration: Traversal[ST[Start], DurationType, ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  71. def isGeo: Traversal[ST[Start], GeometricType[Geometry], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  72. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  73. def isNumber: Traversal[ST[Start], NumericType[AnyVal], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  74. def isQuantity: Traversal[ST[Start], QuantityType[Any], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  75. def isTemporal: Traversal[ST[Start], CalendarType[Any], ::[Segment[::[HasLabel, HNil]], HNil]]

    Permalink
    Definition Classes
    FilterStepsHelper

  76. def last(): Traversal[ST[Start], ET[End], ::[Segment[::[Last, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

  77. def limit(max: Int): Traversal[ST[Start], ET[End], ::[Segment[::[Limit, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    CommonStepsHelper

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

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    AnyRef

  82. def noTimeLimit(): Traversal[ST[Start], ET[End], ::[Segment[::[TimeLimit, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    CommonStepsHelper

  84. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  85. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    CommonStepsHelper

  87. def order[CT <: 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, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

  89. def out[V, End1, ET1 <: ClassType[End1]](key: TypedProperty[V])(implicit et: Aux[V, End1, ET1]): Traversal[ST[Start], (MoveStepsHelper.out.et)#CT, ::[Segment[::[HasLabel, ::[Out, HNil]]], HNil]]

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

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

    Permalink
    Definition Classes
    MoveStepsHelper

  98. def outEMap(key: Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  99. def outEMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  100. def outEMap(keys: List[Property]): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  101. def outEMap(key: String, keys: String*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutEMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  102. def outMap(key: Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  103. def outMap(f: (default.type) ⇒ Property, ff: (default.type) ⇒ Property*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  104. def outMap(keys: List[Property]): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

  105. def outMap(key: String, keys: String*): Traversal[ST[Start], ClassType[Any], ::[Segment[::[OutMap, HNil]], HNil]]

    Permalink
    Definition Classes
    MoveMapStepsHelper

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

    Permalink
    Definition Classes
    CommonStepsHelper

  107. def path: Traversal[ST[Start], ClassType[Nothing], ::[Segment[::[Path[ClassType[Any], HNil], HNil]], HNil]]

    Permalink

    TODO: result of path is a List[ET0]

    TODO: result of path is a List[ET0]

    Definition Classes
    CommonStepsHelper

  108. def project[A, AZ[+Z] <: ClassType[Z], B, BZ[+Z] <: ClassType[Z], C, CZ[+Z] <: ClassType[Z], ABCZ <: ClassType[_], Steps1 <: HList, Steps2 <: HList, Steps3 <: HList](by1: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], AZ[A], Steps1], by2: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], BZ[B], Steps2], by3: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CZ[C], Steps3])(implicit listHelper: Aux[::[AZ[A], ::[BZ[B], ::[CZ[C], HNil]]], List, ABCZ]): Traversal[ST[Start], ClassType[Nothing], ::[Segment[::[Project[::[Traversal[ET[End], AZ[A], Steps1], ::[Traversal[ET[End], BZ[B], Steps2], ::[Traversal[ET[End], CZ[C], Steps3], HNil]]]], HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

  109. def project[A, AZ[+Z] <: ClassType[Z], B, BZ[+Z] <: ClassType[Z], ABZ <: ClassType[_], Steps1 <: HList, Steps2 <: HList](by1: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], AZ[A], Steps1], by2: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], BZ[B], Steps2])(implicit listHelper: Aux[::[AZ[A], ::[BZ[B], HNil]], List, ABZ]): Traversal[ST[Start], ClassType[Nothing], ::[Segment[::[Project[::[Traversal[ET[End], AZ[A], Steps1], ::[Traversal[ET[End], BZ[B], Steps2], HNil]]], HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

  110. def range(low: Int, high: Int): Traversal[ST[Start], ET[End], ::[Segment[::[Range, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

  111. def repeat[ET0 <: 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, _ <: ClassType[_], _ <: HList] = null): Traversal[ST[Start], ET0, ::[Segment[::[Repeat[ET0], HNil]], HNil]]

    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

  112. def st: ST[Start]

    Permalink
    Definition Classes
    WithEmptyTraversal → BaseMod

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

    Permalink
    Definition Classes
    AnyRef

  114. def tail(max: Int): Traversal[ST[Start], ET[End], ::[Segment[::[Tail, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

  115. def timeLimit(time: Time): Traversal[ST[Start], ET[End], ::[Segment[::[TimeLimit, HNil]], HNil]]

    Permalink
    Definition Classes
    ClipStepsHelper

  116. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  117. def union[ET0 <: ClassType[_], End1, ET1 <: 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], HNil]], HNil]]

    Permalink
    Definition Classes
    CommonStepsHelper

  118. final def wait(): Unit

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

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

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

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

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

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

    Permalink
    Definition Classes
    CommonStepsHelper

Inherited from MoveMapStepsHelper[Start, ST, End, ET, HNil, HNil, HNil]

Inherited from MoveStepsHelper[Start, ST, End, ET, HNil, HNil, HNil]

Inherited from ClipStepsHelper[Start, ST, End, ET, HNil, HNil, HNil]

Inherited from CommonStepsHelper[Start, ST, End, ET, HNil, HNil, HNil]

Inherited from FilterStepsHelper[Start, ST, End, ET, HNil, HNil, HNil]

Inherited from TModHNil[Start, ST, End, ET]

Inherited from BaseMod[Start, ST, End, ET, HNil, HNil, HNil]

Inherited from AnyRef

Inherited from Any

Ungrouped