TypeF

Type Members

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

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
object Leaf
object Unioned
def arr[J, A]: Prism[TypeF[J, A], \/[IList[A], A]]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def bottom[J, A]: Prism[TypeF[J, A], slamdata.Predef.Unit]
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
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def const[J, A]: Prism[TypeF[J, A], J]
def coproduct[J, A]: Prism[TypeF[J, A], (A, A)]
implicit def encodeEJsonK[A](implicit A: EncodeEJson[A]): EncodeEJsonK[[β$26$]TypeF[A, β$26$]]

Definition Classes
TypeFInstances
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
object glb

Returns the greatest subtype of both types.
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.
def hashCode(): Int

Definition Classes
AnyRef → Any
object identical

Returns whether two types have identical structure.
object isBottom

Whether a type is bottom.
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
object isSubtypeOf

Whether x is a subtype of y.
object isTop

Whether a type is top.
def leaf[J, A]: Prism[TypeF[J, A], \/[SimpleType, J]]
object lub

Returns the smallest supertype of both types.
def map[J, A]: Prism[TypeF[J, A], (IMap[J, A], slamdata.Predef.Option[(A, A)])]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def primary[J](tf: TypeF[J, _])(implicit J: Aux[J, EJson]): slamdata.Predef.Option[PrimaryType]

Returns the PrimaryType of the given type, if exists.
implicit def show[J](implicit arg0: Show[J]): Delay[Show, [β$31$]TypeF[J, β$31$]]

Definition Classes
TypeFInstances
def simple[J, A]: Prism[TypeF[J, A], SimpleType]
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
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
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def top[J, A]: Prism[TypeF[J, A], slamdata.Predef.Unit]
implicit def traverse[J]: Traverse[[β$29$]TypeF[J, β$29$]]

Definition Classes
TypeFInstances
def union[J, A]: Prism[TypeF[J, A], (A, A, IList[A])]
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: class TypeF | package tpe

object TypeF extends TypeFInstances with Serializable

Type Members

final case class Arr[J, A](elementsOrLub: \/[IList[A], A]) extends TypeF[J, A] with Product with Serializable

final case class Bottom[J, A]() extends TypeF[J, A] with Product with Serializable

final case class Const[J, A](ejson: J) extends TypeF[J, A] with Product with Serializable

final case class Map[J, A](known: IMap[J, A], unknown: slamdata.Predef.Option[(A, A)]) extends TypeF[J, A] with Product with Serializable

final case class Simple[J, A](simpleType: SimpleType) extends TypeF[J, A] with Product with Serializable

final case class Top[J, A]() extends TypeF[J, A] with Product with Serializable

final case class Union[J, A](fst: A, snd: A, rest: IList[A]) extends TypeF[J, A] with Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object Leaf

object Unioned

def arr[J, A]: Prism[TypeF[J, A], \/[IList[A], A]]

final def asInstanceOf[T0]: T0

def bottom[J, A]: Prism[TypeF[J, A], slamdata.Predef.Unit]

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]

def clone(): AnyRef

def const[J, A]: Prism[TypeF[J, A], J]

def coproduct[J, A]: Prism[TypeF[J, A], (A, A)]

implicit def encodeEJsonK[A](implicit A: EncodeEJson[A]): EncodeEJsonK[[β$26$]TypeF[A, β$26$]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

object glb

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)]

def hashCode(): Int

object identical

object isBottom

final def isInstanceOf[T0]: Boolean

object isSubtypeOf

object isTop

def leaf[J, A]: Prism[TypeF[J, A], \/[SimpleType, J]]

object lub

def map[J, A]: Prism[TypeF[J, A], (IMap[J, A], slamdata.Predef.Option[(A, A)])]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def primary[J](tf: TypeF[J, _])(implicit J: Aux[J, EJson]): slamdata.Predef.Option[PrimaryType]

implicit def show[J](implicit arg0: Show[J]): Delay[Show, [β$31$]TypeF[J, β$31$]]

def simple[J, A]: Prism[TypeF[J, A], SimpleType]

def structuralEqual[J](implicit arg0: Equal[J]): Delay[Equal, [β$24$]TypeF[J, β$24$]]

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]

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

def toString(): String

def top[J, A]: Prism[TypeF[J, A], slamdata.Predef.Unit]

implicit def traverse[J]: Traverse[[β$29$]TypeF[J, β$29$]]

def union[J, A]: Prism[TypeF[J, A], (A, A, IList[A])]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from TypeFInstances

Inherited from AnyRef

Inherited from Any

Ungrouped