Object

quasar.physical.couchbase.fs

queryfile

Related Doc: package fs

Permalink

object queryfile

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

Type Members

  1. implicit class LiftF[F[_], A] extends AnyRef

    Permalink

  2. implicit class LiftFE[A] extends AnyRef

    Permalink

  3. type Plan[S[_], A] = EitherT[[β$1$]WriterT[[β$0$]Free[S, β$0$], Vector[PhaseResult], β$1$], FileSystemError, A]

    Permalink

  4. implicit class liftPE[A] extends AnyRef

    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. def close[S[_]](handle: ResultHandle)(implicit results: Ops[ResultHandle, Cursor, S]): Free[S, slamdata.Predef.Unit]

    Permalink

  7. implicit val codec: DataCodec

    Permalink

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  10. def evaluatePlan[T[_[_]], S[_]](lp: T[LogicalPlan])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], S0: :<:[[β$10$]Read[Context, β$10$], S], S1: :<:[MonotonicSeq, S], S2: :<:[Task, S], results: Ops[ResultHandle, Cursor, S]): Free[S, (PhaseResults, \/[FileSystemError, ResultHandle])]

    Permalink

  11. def executePlan[T[_[_]], S[_]](lp: T[LogicalPlan], out: AFile)(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], S0: :<:[[β$9$]Read[Context, β$9$], S], S1: :<:[MonotonicSeq, S], S2: :<:[GenUUID, S], S3: :<:[Task, S]): Free[S, (PhaseResults, \/[FileSystemError, AFile])]

    Permalink

  12. def explain[T[_[_]], S[_]](lp: T[LogicalPlan])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], S0: :<:[[β$13$]Read[Context, β$13$], S], S1: :<:[MonotonicSeq, S], S2: :<:[Task, S]): Free[S, (PhaseResults, \/[FileSystemError, ExecutionPlan])]

    Permalink

  13. def fileExists[S[_]](file: AFile)(implicit S0: :<:[Task, S], context: Ops[Context, S]): Free[S, slamdata.Predef.Boolean]

    Permalink

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Permalink
    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  17. def interpret[S[_]](implicit S0: :<:[[β$3$]Read[Context, β$3$], S], S1: :<:[MonotonicSeq, S], S2: :<:[[γ$4$]KeyValueStore[ResultHandle, Cursor, γ$4$], S], S3: :<:[GenUUID, S], S4: :<:[Task, S]): ~>[QueryFile, [β$5$]Free[S, β$5$]]

    Permalink

  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  19. val jsonTranscoder: JsonTranscoder

    Permalink

  20. def listContents[S[_]](dir: APath)(implicit S0: :<:[Task, S], context: Ops[Context, S]): Free[S, \/[FileSystemError, slamdata.Predef.Set[PathSegment]]]

    Permalink

  21. def listNonRootContents[S[_]](dir: APath)(implicit S0: :<:[Task, S], context: Ops[Context, S]): Free[S, \/[FileSystemError, slamdata.Predef.Set[PathSegment]]]

    Permalink

  22. def listRootContents[S[_]](implicit S0: :<:[Task, S], context: Ops[Context, S]): Free[S, \/[FileSystemError, slamdata.Predef.Set[PathSegment]]]

    Permalink

  23. def lpLcToN1ql[T[_[_]], S[_]](lp: T[LogicalPlan], lc: ListContents[[β$18$]EitherT[[β$1$]WriterT[[β$0$]Free[S, β$0$], Vector[PhaseResult], β$1$], FileSystemError, β$18$]])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], S1: :<:[MonotonicSeq, S], S2: :<:[Task, S]): Plan[S, (T[N1QL], ISet[APath])]

    Permalink

  24. def lpToN1ql[T[_[_]], S[_]](lp: T[LogicalPlan])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], S0: :<:[[β$16$]Read[Context, β$16$], S], S1: :<:[MonotonicSeq, S], S2: :<:[Task, S]): Plan[S, (T[N1QL], ISet[APath])]

    Permalink

  25. def more[S[_]](handle: ResultHandle)(implicit results: Ops[ResultHandle, Cursor, S]): Free[S, \/[FileSystemError, slamdata.Predef.Vector[Data]]]

    Permalink

  26. def n1qlResults[T[_[_]], S[_]](n1ql: T[N1QL])(implicit arg0: BirecursiveT[T], S0: :<:[Task, S], context: Ops[Context, S]): Plan[S, slamdata.Predef.Vector[Data]]

    Permalink

  27. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  31. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  32. final def wait(): Unit

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

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

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

  34. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped