Packages

object TypeF extends TypeFInstances with Serializable

Linear Supertypes
Serializable, Serializable, TypeFInstances, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TypeF
  2. Serializable
  3. Serializable
  4. TypeFInstances
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final case class Arr[J, A](elementsOrLub: \/[IList[A], A]) extends TypeF[J, A] with Product with Serializable
  2. final case class Bottom[J, A]() extends TypeF[J, A] with Product with Serializable
  3. final case class Const[J, A](ejson: J) extends TypeF[J, A] with Product with Serializable
  4. final case class Map[J, A](known: IMap[J, A], unknown: slamdata.Predef.Option[(A, A)]) extends TypeF[J, A] with Product with Serializable
  5. final case class Simple[J, A](simpleType: SimpleType) extends TypeF[J, A] with Product with Serializable
  6. final case class Top[J, A]() extends TypeF[J, A] with Product with Serializable
  7. final case class Union[J, A](fst: A, snd: A, rest: IList[A]) extends TypeF[J, A] with Product with Serializable

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def arr[J, A]: Prism[TypeF[J, A], \/[IList[A], A]]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def bottom[J, A]: Prism[TypeF[J, A], slamdata.Predef.Unit]
  7. def boundedDistributiveLattice[J, T](implicit arg0: Order[J], TR: Aux[T, [β$20$]TypeF[J, β$20$]], TC: Aux[T, [β$21$]TypeF[J, β$21$]], JR: Aux[J, EJson], JC: Aux[J, EJson]): BoundedDistributiveLattice[T]
    Definition Classes
    TypeFInstances
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  9. def const[J, A]: Prism[TypeF[J, A], J]
  10. def coproduct[J, A]: Prism[TypeF[J, A], (A, A)]
  11. implicit def encodeEJsonK[A](implicit A: EncodeEJson[A]): EncodeEJsonK[[β$26$]TypeF[A, β$26$]]
    Definition Classes
    TypeFInstances
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. def glbƒ[J, T](implicit arg0: Order[J], TR: Aux[T, [β$5$]TypeF[J, β$5$]], TC: Aux[T, [β$6$]TypeF[J, β$6$]], JR: Aux[J, EJson]): GCoalgebra[[β$7$]\/[T, β$7$], [β$8$]TypeF[J, β$8$], (T, T)]

    Unfold a pair of types into their greatest lower-bound.

  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def leaf[J, A]: Prism[TypeF[J, A], \/[SimpleType, J]]
  20. def map[J, A]: Prism[TypeF[J, A], (IMap[J, A], slamdata.Predef.Option[(A, A)])]
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. def primary[J](tf: TypeF[J, _])(implicit J: Aux[J, EJson]): slamdata.Predef.Option[PrimaryType]

    Returns the PrimaryType of the given type, if exists.

  25. implicit def show[J](implicit arg0: Show[J]): Delay[Show, [β$31$]TypeF[J, β$31$]]
    Definition Classes
    TypeFInstances
  26. def simple[J, A]: Prism[TypeF[J, A], SimpleType]
  27. def structuralEqual[J](implicit arg0: Equal[J]): Delay[Equal, [β$24$]TypeF[J, β$24$]]

    NB: This is structural equality and ignores semantics, for most use-cases the equality implied by the subtyping partial order is more useful.

    NB: This is structural equality and ignores semantics, for most use-cases the equality implied by the subtyping partial order is more useful.

    Definition Classes
    TypeFInstances
  28. def subtypingPartialOrder[J, T](implicit arg0: Order[J], TR: Aux[T, [β$22$]TypeF[J, β$22$]], TC: Aux[T, [β$23$]TypeF[J, β$23$]], JR: Aux[J, EJson], JC: Aux[J, EJson]): PartialOrder[T]
    Definition Classes
    TypeFInstances
  29. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. def top[J, A]: Prism[TypeF[J, A], slamdata.Predef.Unit]
  32. implicit def traverse[J]: Traverse[[β$29$]TypeF[J, β$29$]]
    Definition Classes
    TypeFInstances
  33. def union[J, A]: Prism[TypeF[J, A], (A, A, IList[A])]
  34. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  37. object Leaf
  38. object Unioned
  39. object glb

    Returns the greatest subtype of both types.

  40. object identical

    Returns whether two types have identical structure.

  41. object isBottom

    Whether a type is bottom.

  42. object isSubtypeOf

    Whether x is a subtype of y.

  43. object isTop

    Whether a type is top.

  44. object lub

    Returns the smallest supertype of both types.

Inherited from Serializable

Inherited from Serializable

Inherited from TypeFInstances

Inherited from AnyRef

Inherited from Any

Ungrouped