Class

quasar.qscript

PAFindRemap

Related Doc: package qscript

Permalink

class PAFindRemap[T[_[_]], F[_]] extends AnyRef

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

Instance Constructors

  1. new PAFindRemap()(implicit arg0: BirecursiveT[T], arg1: Functor[F])

    Permalink

Type Members

  1. type ArrayEnv[G[_], A] = EnvT[RewriteState, G, A]

    Permalink

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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def findIndices[S[_[_]], M[_], F[_], G[_]](implicit arg0: Functor[G], R: Aux[S[F], G], M: MonadState[M, RewriteState], P: PruneArrays[G]): CoalgebraM[M, [β$19$]EnvT[RewriteState, G, β$19$], S[F]]

    Permalink

    Given an input, we accumulate state and annotate the focus.

    Given an input, we accumulate state and annotate the focus.

    The state collects the used indices and indicates if the dereferenced array can be pruned. For example, if we deref an array non-statically, we cannot prune it.

    If the focus is an array that can be pruned, the annotatation is set to the state. Else the annotation is set to None.

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  16. def remapIndices[S[_[_]], M[_], F[_], G[_]](implicit arg0: Functor[G], C: Aux[S[F], G], M: MonadState[M, RewriteState], P: PruneArrays[G]): AlgebraM[M, [β$20$]EnvT[RewriteState, G, β$20$], S[F]]

    Permalink

    Given an annotated input, we produce an output with state.

    Given an annotated input, we produce an output with state.

    If the previous state provides indices, we remap array dereferences accordingly.

    If an array has an associated environment, we update the state to be the environment and prune the array.

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

    Permalink
    Definition Classes
    AnyRef
  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped