Trait

lspace.librarian.traversal.Traversal

CommonStepsHelper

Related Doc: package Traversal

Permalink

trait CommonStepsHelper[Start, ST[+Z] <: structure.ClassType[Z], End, ET[+Z] <: structure.ClassType[Z], Steps <: HList, Segments <: HList, Segments1 <: HList] extends BaseMod[Start, ST, End, ET, Steps, Segments, Segments1]

Linear Supertypes
BaseMod[Start, ST, End, ET, Steps, Segments, Segments1], AnyRef, Any
Known Subclasses
TraversalMod, WithEmptyTraversal
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CommonStepsHelper
  2. BaseMod
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract 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]], Segments1]]

    Permalink
    Attributes
    protected
    Definition Classes
    BaseMod

  2. abstract 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]], Segments1]]

    Permalink
    Attributes
    protected
    Definition Classes
    BaseMod

  3. abstract 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
    BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    BaseMod

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

    Permalink
    Attributes
    protected
    Definition Classes
    BaseMod

  6. abstract 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
    BaseMod

  7. abstract def et: ET[End]

    Permalink
    Definition Classes
    BaseMod

  8. abstract def st: ST[Start]

    Permalink
    Definition Classes
    BaseMod

Concrete 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(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

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

    Permalink

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. 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

  8. def clone(): AnyRef

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

  9. 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

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  16. 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

  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  19. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  20. 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

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

    Permalink
    Definition Classes
    AnyRef

  22. 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

  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. 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

  26. 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]], Segments1]]

    Permalink

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

    Permalink

    TODO: result of path is a List[ET0]

  28. 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

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

    Permalink

  30. 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

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

    Permalink
    Definition Classes
    AnyRef

  32. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  33. 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

  34. final def wait(): Unit

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

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

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

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

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

  37. 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

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

Inherited from AnyRef

Inherited from Any

Ungrouped