Packages

o

quasar.tpe

normalization

object normalization

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. normalization
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. def coalesceUnion[J, T](implicit TC: Aux[T, [β$4$]TypeF[J, β$4$]], TR: Aux[T, [β$5$]TypeF[J, β$5$]]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Coalesce nested unions into a single union.

  7. def elideBottom[J, T](implicit TR: Aux[T, [β$8$]TypeF[J, β$8$]], TC: Aux[T, [β$9$]TypeF[J, β$9$]]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Elide bottom values from unions.

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def liftConst[J, T](implicit TR: Aux[T, [β$10$]TypeF[J, β$10$]], JC: Aux[J, EJson], JR: Aux[J, EJson]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Lift arrays and maps of constants to constant types.

  15. def lowerConst[J, T](implicit arg0: Order[J], TC: Aux[T, [β$11$]TypeF[J, β$11$]], TR: Aux[T, [β$12$]TypeF[J, β$12$]], JC: Aux[J, EJson], JR: Aux[J, EJson]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Lower constant arrays and maps to types of constants.

  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def normalizeEJson[J, T](implicit arg0: Order[J], TC: Aux[T, [β$13$]TypeF[J, β$13$]], JC: Aux[J, EJson], JR: Aux[J, EJson]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Normalizes EJson literals by

    Normalizes EJson literals by

    • Converting constant strings to arrays of characters.
    • Replacing Meta nodes with their value component.
  18. def normalizeƒ[J, T](implicit arg0: Order[J], TC: Aux[T, [β$2$]TypeF[J, β$2$]], TR: Aux[T, [β$3$]TypeF[J, β$3$]], JC: Aux[J, EJson], JR: Aux[J, EJson]): (TypeF[J, T]) ⇒ TypeF[J, T]
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. def reduceToBottom[J, T](implicit TR: Aux[T, [β$14$]TypeF[J, β$14$]]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Reduce arrays and maps containing bottom values to bottom.

  22. def reduceToTop[J, T](implicit T: Aux[T, [β$15$]TypeF[J, β$15$]]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Reduce unions containing top to top.

  23. def simplifyUnion[J, T](implicit arg0: Order[J], TC: Aux[T, [β$16$]TypeF[J, β$16$]], TR: Aux[T, [β$17$]TypeF[J, β$17$]], JC: Aux[J, EJson], JR: Aux[J, EJson]): (TypeF[J, T]) ⇒ TypeF[J, T]

    Simplify unions by eliding subtypes.

  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  29. object normalize

    Returns the normal form of the given type.

Inherited from AnyRef

Inherited from Any

Ungrouped