Trait

lspace.librarian.process.traversal.Traversal

CommonStepsHelper

Related Doc: package Traversal

Permalink

trait CommonStepsHelper[Start, ST[+Z] <: ClassType[Z], End, ET[+Z] <: 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 <: ClassType[_], ET <: 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 <: ClassType[_], ET <: 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 <: ClassType[_], ET <: 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

  9. abstract def target: Graph

    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], _ <: ClassType[_], _ <: HList], traversals: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: 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 clone(): AnyRef

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

  8. 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], Steps]], Segments]]

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  13. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    BaseMod

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

    Permalink
    Definition Classes
    BaseMod

  19. def is(predicate: P[End], predicates: P[_]*): Traversal[ST[Start], ET[End], ::[Segment[::[Is, Steps]], Segments]]

    Permalink

  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

  27. 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[Any], ::[Segment[::[Path, HNil]], Segments1]]

    Permalink

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

    Permalink

    TODO: result of path is a List[ET0]

  29. def project[A, AZ[+Z] <: ClassType[Z], B, BZ[+Z] <: ClassType[Z], C, CZ[+Z] <: ClassType[Z], D, DZ[+Z] <: ClassType[Z], ABCDZ <: ClassType[_]](by1: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], AZ[A], _ <: HList], by2: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], BZ[B], _ <: HList], by3: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], CZ[C], _ <: HList], by4: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], DZ[D], _ <: HList])(implicit listHelper: Aux[::[AZ[A], ::[BZ[B], ::[CZ[C], ::[DZ[D], HNil]]]], List, ABCDZ]): Traversal[ST[Start], Tuple4Type[A, B, C, D], ::[Segment[::[Project, Steps]], Segments]]

    Permalink

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

    Permalink

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

    Permalink

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

    Permalink

    traversal

    to be repeated

    until

    nonempty traversal is being repeated

    max

    number of times is being repeated

    collect

    result of each loop

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

    Permalink
    Definition Classes
    AnyRef

  34. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  35. 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], Steps]], Segments]]

    Permalink

  36. final def wait(): Unit

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

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

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

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

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

  39. def where(traversal: (Traversal[ET[End], ET[End], HNil]) ⇒ Traversal[ET[End], _ <: 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