Object

lspace.librarian.traversal

ContainerSteps

Related Doc: package traversal

Permalink

object ContainerSteps extends Poly1

Linear Supertypes
Poly1, Poly, Serializable, Serializable, PolyApply, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ContainerSteps
  2. Poly1
  3. Poly
  4. Serializable
  5. Serializable
  6. PolyApply
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Case[A] = shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, HNil]]

    Permalink
    Definition Classes
    Poly1

  2. class CaseBuilder[A] extends AnyRef

    Permalink
    Definition Classes
    Poly1

  3. trait LowPriorityCaseBuilder extends AnyRef

    Permalink
    Definition Classes
    Poly

  4. type ProductCase[L <: HList] = shapeless.PolyDefns.Case[ContainerSteps.this.type, L]

    Permalink
    Definition Classes
    Poly

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

    Permalink
    Definition Classes
    Poly1

  5. def andThen(f: Poly): Compose[f.type, ContainerSteps.this.type]

    Permalink
    Definition Classes
    Poly

  6. def apply[R](implicit c: Aux[HNil, R]): R

    Permalink
    Definition Classes
    Poly

  7. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P, q: Q, r: R, s: S, t: T, u: U, v: V)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, ::[Q, ::[R, ::[S, ::[T, ::[U, ::[V, HNil]]]]]]]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  8. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P, q: Q, r: R, s: S, t: T, u: U)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, ::[Q, ::[R, ::[S, ::[T, ::[U, HNil]]]]]]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  9. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P, q: Q, r: R, s: S, t: T)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, ::[Q, ::[R, ::[S, ::[T, HNil]]]]]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  10. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P, q: Q, r: R, s: S)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, ::[Q, ::[R, ::[S, HNil]]]]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  11. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P, q: Q, r: R)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, ::[Q, ::[R, HNil]]]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  12. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P, q: Q)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, ::[Q, HNil]]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  13. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O, p: P)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, ::[P, HNil]]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  14. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N, O](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N, o: O)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, ::[O, HNil]]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  15. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M, N](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M, n: N)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, ::[N, HNil]]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  16. def apply[A, B, C, D, E, F, G, H, I, J, K, L, M](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L, m: M)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, ::[M, HNil]]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  17. def apply[A, B, C, D, E, F, G, H, I, J, K, L](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K, l: L)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, ::[L, HNil]]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  18. def apply[A, B, C, D, E, F, G, H, I, J, K](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J, k: K)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, ::[K, HNil]]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  19. def apply[A, B, C, D, E, F, G, H, I, J](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I, j: J)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, ::[J, HNil]]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  20. def apply[A, B, C, D, E, F, G, H, I](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H, i: I)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, ::[I, HNil]]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  21. def apply[A, B, C, D, E, F, G, H](a: A, b: B, c: C, d: D, e: E, f: F, g: G, h: H)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, ::[H, HNil]]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  22. def apply[A, B, C, D, E, F, G](a: A, b: B, c: C, d: D, e: E, f: F, g: G)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, ::[G, HNil]]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  23. def apply[A, B, C, D, E, F](a: A, b: B, c: C, d: D, e: E, f: F)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, ::[F, HNil]]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  24. def apply[A, B, C, D, E](a: A, b: B, c: C, d: D, e: E)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, ::[E, HNil]]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  25. def apply[A, B, C, D](a: A, b: B, c: C, d: D)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, ::[D, HNil]]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  26. def apply[A, B, C](a: A, b: B, c: C)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, ::[C, HNil]]]]): Result

    Permalink
    Definition Classes
    PolyApply

  27. def apply[A, B](a: A, b: B)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, ::[B, HNil]]]): Result

    Permalink
    Definition Classes
    PolyApply

  28. def apply[A](a: A)(implicit cse: shapeless.PolyDefns.Case[ContainerSteps.this.type, ::[A, HNil]]): Result

    Permalink
    Definition Classes
    PolyApply

  29. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  30. def at[A]: CaseBuilder[A]

    Permalink
    Definition Classes
    Poly1

  31. def caseAt[L <: HList](implicit c: ProductCase[L]): ProductCase[L]

    Permalink
    Definition Classes
    Poly

  32. def clone(): AnyRef

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

  33. def compose(f: Poly): Compose[ContainerSteps.this.type, f.type]

    Permalink
    Definition Classes
    Poly

  34. implicit def count: Case[Count] { type Result = lspace.librarian.traversal.step.Count }

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  36. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  37. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  39. implicit def group[T <: structure.ClassType[_], Segments <: HList, Tv <: structure.ClassType[_], SegmentsV <: HList]: Case[Group[T, Segments, Tv, SegmentsV]] { type Result = lspace.librarian.traversal.step.Group[T,Segments,Tv,SegmentsV] }

    Permalink

  40. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  41. implicit def head: Case[Head] { type Result = lspace.librarian.traversal.step.Head }

    Permalink

  42. implicit def inemap: Case[InEMap] { type Result = lspace.librarian.traversal.step.InEMap }

    Permalink

  43. implicit def inmap: Case[InMap] { type Result = lspace.librarian.traversal.step.InMap }

    Permalink

  44. implicit def is: Case[Is] { type Result = lspace.librarian.traversal.step.Is }

    Permalink

  45. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  46. implicit def last: Case[Last] { type Result = lspace.librarian.traversal.step.Last }

    Permalink

  47. implicit def max: Case[Max] { type Result = lspace.librarian.traversal.step.Max }

    Permalink

  48. implicit def mean: Case[Mean] { type Result = lspace.librarian.traversal.step.Mean }

    Permalink

  49. implicit def min: Case[Min] { type Result = lspace.librarian.traversal.step.Min }

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  51. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  52. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  53. implicit def outemap: Case[OutEMap] { type Result = lspace.librarian.traversal.step.OutEMap }

    Permalink

  54. implicit def outmap: Case[OutMap] { type Result = lspace.librarian.traversal.step.OutMap }

    Permalink

  55. implicit def path[ET <: structure.ClassType[_], Segments <: HList]: Case[Path[ET, Segments]] { type Result = lspace.librarian.traversal.step.Path[ET,Segments] }

    Permalink

  56. implicit def project[Traversals <: HList]: Case[Project[Traversals]] { type Result = lspace.librarian.traversal.step.Project[Traversals] }

    Permalink

  57. def rotateLeft[N <: Nat]: RotateLeft[ContainerSteps.this.type, N]

    Permalink
    Definition Classes
    Poly

  58. def rotateRight[N <: Nat]: RotateRight[ContainerSteps.this.type, N]

    Permalink
    Definition Classes
    Poly

  59. implicit def sum: Case[Sum] { type Result = lspace.librarian.traversal.step.Sum }

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  61. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  62. def use[T, L <: HList, R](t: T)(implicit cb: ContainerSteps.CaseBuilder[T, L, R]): Aux[L, R]

    Permalink
    Definition Classes
    Poly

  63. final def wait(): Unit

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

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

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

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

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

Inherited from Poly1

Inherited from Poly

Inherited from Serializable

Inherited from Serializable

Inherited from PolyApply

Inherited from AnyRef

Inherited from Any

Ungrouped