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
  • 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
  • NameGenerator
  • NameGeneratorInstances
  • NameGeneratorInstances0
  • Planner
c

quasar

NameGeneratorInstances

sealed abstract class NameGeneratorInstances extends NameGeneratorInstances0

Linear Supertypes
NameGeneratorInstances0, AnyRef, Any
Known Subclasses
NameGenerator
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NameGeneratorInstances
  2. NameGeneratorInstances0
  3. AnyRef
  4. 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. implicit def eitherTNameGenerator[F[_], A](implicit arg0: NameGenerator[F], arg1: Functor[F]): NameGenerator[[γ$2$]EitherT[F, A, γ$2$]]
    Definition Classes
    NameGeneratorInstances0
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. implicit def monotonicSeqNameGenerator[S[_]](implicit S: :<:[MonotonicSeq, S]): NameGenerator[[β$0$]Free[S, β$0$]]
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. implicit def readerTNameGenerator[F[_], A](implicit arg0: NameGenerator[F]): NameGenerator[[γ$4$]Kleisli[F, A, γ$4$]]
    Definition Classes
    NameGeneratorInstances0
  18. implicit def sequenceNameGenerator[F[_]](implicit F: MonadState[F, slamdata.Predef.Long]): NameGenerator[F]
  19. implicit def stateTNameGenerator[F[_], S](implicit arg0: NameGenerator[F], arg1: Monad[F]): NameGenerator[[γ$6$]IndexedStateT[F, S, S, γ$6$]]
    Definition Classes
    NameGeneratorInstances0
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  25. implicit def writerTNameGenerator[F[_], W](implicit arg0: NameGenerator[F], arg1: Functor[F], arg2: Monoid[W]): NameGenerator[[γ$8$]WriterT[F, W, γ$8$]]
    Definition Classes
    NameGeneratorInstances0

Inherited from NameGeneratorInstances0

Inherited from AnyRef

Inherited from Any

Ungrouped