Packages

  • package root
    Definition Classes
    root
  • package quasar
    Definition Classes
    root
  • package config
    Definition Classes
    quasar
  • package connector
    Definition Classes
    quasar
  • package fp
    Definition Classes
    quasar
  • PFOps
  • PrOps
  • ProcessOfTaskOps
  • SeqW
  • TaskOps
  • ToDebugOps
  • package fs
    Definition Classes
    quasar
  • package qscript

    The various representations of an arbitrary query, as seen by the filesystem connectors, along with the operations for dealing with them.

    The various representations of an arbitrary query, as seen by the filesystem connectors, along with the operations for dealing with them.

    There are a few patterns that are worth noting: - (src: A, ..., lBranch: FreeQS[T], rBranch: FreeQS[T], ...) – used in operations that combine multiple data sources (notably joins and unions). This holds the divergent parts of the data sources in the branches, with SrcHole indicating a reference back to the common src of the two branches. There is not required to be a SrcHole. - Free[F, A] – we use this structure as a restricted form of variable binding, where F is some pattern functor, and A is some enumeration that has a specific referent. E.g., FreeMap is a recursive structure of MapFunc that has a single “variable”, SrcHole, which (usually) refers to the src parameter of that operation. JoinFunc, FreeQS, and the repair parameter to Reduce behave similarly. - We use the type parameter QS[_] to indicate QScript, as well as the type parameters IN[_] and OUT[_] to indicate the input and output coproducts in transformations where they can be different.

    Definition Classes
    quasar

package fp

Linear Supertypes
DebugOps, ProcessOps, JsonOps, PartialFunctionOps, ListMapInstances, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. fp
  2. DebugOps
  3. ProcessOps
  4. JsonOps
  5. PartialFunctionOps
  6. ListMapInstances
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type EndoK[F[X]] = NaturalTransformation[F, F]
  2. type NTComp[F[X], G[Y]] = NaturalTransformation[F, [A]G[F[A]]]
  3. implicit class PFOps[A, B] extends AnyRef
    Definition Classes
    PartialFunctionOps
  4. implicit class PrOps[F[_], O] extends AnyRef
    Definition Classes
    ProcessOps
  5. implicit class ProcessOfTaskOps[O] extends AnyRef
    Definition Classes
    ProcessOps
  6. class SeqW[A] extends AnyRef
    Definition Classes
    ListMapInstances
  7. implicit class TaskOps[A] extends AnyRef
    Definition Classes
    ProcessOps
  8. implicit final class ToDebugOps[A] extends AnyRef
    Definition Classes
    DebugOps

Value Members

  1. implicit def ListMapEqual[A, B](implicit arg0: Equal[A], arg1: Equal[B]): Equal[slamdata.Predef.ListMap[A, B]]
    Definition Classes
    ListMapInstances
  2. implicit def TraverseListMap[K]: Traverse[[β$0$]ListMap[K, β$0$]] with IsEmpty[[β$1$]ListMap[K, β$1$]]
    Definition Classes
    ListMapInstances
  3. def applyCoEnvFrom[T[_[_]], F[_], A](modify: (T[[γ$20$]CoEnv[A, F, γ$20$]]) ⇒ T[[γ$21$]CoEnv[A, F, γ$21$]])(implicit arg0: BirecursiveT[T], arg1: Functor[F]): (Free[F, A]) ⇒ Free[F, A]
  4. def applyFrom[A, B](bij: Bijection[A, B])(modify: (B) ⇒ B): (A) ⇒ A
  5. def coenvBijection[T[_[_]], F[_], A](implicit arg0: BirecursiveT[T], arg1: Functor[F]): Bijection[Free[F, A], T[[γ$17$]CoEnv[A, F, γ$17$]]]
  6. def coenvPrism[F[_], A]: PrismNT[[γ$4$]CoEnv[A, F, γ$4$], F]
  7. implicit def constEqual[A](implicit arg0: Equal[A]): Delay[Equal, [β$13$]Const[A, β$13$]]
  8. implicit def constShow[A](implicit arg0: Show[A]): Delay[Show, [β$15$]Const[A, β$15$]]
  9. implicit def coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): Delay[Equal, [γ$9$]Coproduct[F, G, γ$9$]]
  10. implicit def coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): Delay[Show, [γ$11$]Coproduct[F, G, γ$11$]]
  11. def decodeJson[A](text: slamdata.Predef.String)(implicit DA: DecodeJson[A]): \/[slamdata.Predef.String, A]
    Definition Classes
    JsonOps
  12. def evalNT[F[_], S](initial: S)(implicit arg0: Monad[F]): ~>[[γ$7$]IndexedStateT[F, S, S, γ$7$], F]
  13. implicit def finEqual[N <: Succ[_]]: Equal[Fin[N]]
  14. implicit def finShow[N <: Succ[_]]: Show[Fin[N]]
  15. def idPrism[F[_]]: PrismNT[F, F]
  16. def ignore[A](a: A): slamdata.Predef.Unit
  17. def injR[T[_[_]], F[_], G[_]](orig: T[F])(implicit arg0: BirecursiveT[T], arg1: Functor[F], arg2: Functor[G], F: :<:[F, G]): T[G]
  18. def liftCo[T[_[_]], F[_], A, B](f: (F[B]) ⇒ CoEnv[A, F, B]): (CoEnv[A, F, B]) ⇒ CoEnv[A, F, B]
  19. def liftCoM[T[_[_]], M[_], F[_], A, B](f: (F[B]) ⇒ M[CoEnv[A, F, B]])(implicit arg0: Applicative[M]): (CoEnv[A, F, B]) ⇒ M[CoEnv[A, F, B]]
  20. def liftFF[F[_], G[_], A](orig: (F[A]) ⇒ F[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]
  21. def liftFFTrans[F[_], G[_], A](prism: PrismNT[G, F])(f: (F[A]) ⇒ slamdata.Predef.Option[F[A]]): (G[A]) ⇒ slamdata.Predef.Option[G[A]]
  22. def liftFG[F[_], G[_], A](orig: (F[A]) ⇒ G[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]
  23. def liftFGM[M[_], F[_], G[_], A](orig: (F[A]) ⇒ M[G[A]])(implicit arg0: Monad[M], F: :<:[F, G]): (G[A]) ⇒ M[G[A]]
  24. def liftFGTrans[F[_], G[_], A](prism: PrismNT[G, F])(f: (F[A]) ⇒ slamdata.Predef.Option[G[A]]): (G[A]) ⇒ slamdata.Predef.Option[G[A]]
  25. def liftMT[F[_], G[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[G]): ~>[F, [β$4$]G[F, β$4$]]
  26. def liftR[T[_[_]], F[_], G[_]](orig: (T[F]) ⇒ T[F])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): (T[G]) ⇒ T[G]
  27. val minspace: PrettyParams
    Definition Classes
    JsonOps
  28. val multiline: PrettyParams
    Definition Classes
    JsonOps
  29. implicit def natEqual[N <: Nat]: Equal[N]
  30. implicit def natShow[N <: Nat]: Show[N]
  31. def optional[A](cur: ACursor)(implicit arg0: DecodeJson[A]): DecodeResult[slamdata.Predef.Option[A]]
    Definition Classes
    JsonOps
  32. def orElse[A](cur: ACursor, default: ⇒ A)(implicit arg0: DecodeJson[A]): DecodeResult[A]
    Definition Classes
    JsonOps
  33. def pointNT[F[_]](implicit arg0: Applicative[F]): ~>[scalaz.Scalaz.Id, F]
  34. def prjR[T[_[_]], F[_], G[_]](orig: T[G])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): slamdata.Predef.Option[T[F]]
  35. def reflNT[F[_]]: ~>[F, F]
  36. implicit def seqW[A](xs: slamdata.Predef.Seq[A]): SeqW[A]
    Definition Classes
    ListMapInstances
  37. implicit def sizedEqual[A, N <: Nat](implicit arg0: Equal[A]): Equal[Sized[A, N]]
  38. implicit def sizedShow[A, N <: Nat](implicit arg0: Show[A]): Show[Sized[A, N]]
  39. implicit val symbolOrder: Order[slamdata.Predef.Symbol]
  40. implicit val symbolShow: Show[slamdata.Predef.Symbol]

Inherited from DebugOps

Inherited from ProcessOps

Inherited from JsonOps

Inherited from PartialFunctionOps

Inherited from ListMapInstances

Inherited from AnyRef

Inherited from Any

Ungrouped