PartialOps

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +(other: PartialOps[A]): PartialOps[A]

   

   Implicit information

   This member is added by an implicit conversion from PartialOps[A] to BirecursiveOptionOps[PartialOps[A]] performed by method BirecursiveOptionOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], slamdata.Predef.Option] is in scope.

   Definition Classes

   BirecursiveOptionOps

4. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def drop[N](n: N)(implicit N: Aux[N, slamdata.Predef.Option]): PartialOps[A]

   

   Drops exactly n elements from the stream.

   Drops exactly n elements from the stream. This doesn’t expose the Coalgebra because it returns Stream \/ Stream, which isn’t the type of drop.

   Implicit information

   This member is added by an implicit conversion from PartialOps[A] to BirecursiveTuple2Ops[PartialOps[A], A] performed by method BirecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$54$](A, β$54$)] is in scope.

   Definition Classes

   BirecursiveTuple2Ops

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. def find(cond: (A) ⇒ slamdata.Predef.Boolean): slamdata.Predef.Option[A]

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveListFOps[PartialOps[A], A] performed by method RecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$12$]ListF[A, β$12$]] is in scope.

    Definition Classes

    RecursiveListFOps

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. def head: A

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveTuple2Ops[PartialOps[A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$47$](A, β$47$)] is in scope.

    Definition Classes

    RecursiveTuple2Ops

15. def headOption: slamdata.Predef.Option[A]

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveListFOps[PartialOps[A], A] performed by method RecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$12$]ListF[A, β$12$]] is in scope.

    Definition Classes

    RecursiveListFOps

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. def runFor[N](steps: N)(implicit N: Aux[N, slamdata.Predef.Option]): \/[A, Partial[A]]

    

    Returns left if the result was found within the given number of steps.

21. def step: \/[A, Partial[A]]

    

22. def succ: PartialOps[A]

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to CorecursiveOptionOps[PartialOps[A]] performed by method CorecursiveOptionOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], slamdata.Predef.Option] is in scope.

    Definition Classes

    CorecursiveOptionOps

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

    

    Definition Classes

    AnyRef

24. def tail: PartialOps[A]

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveTuple2Ops[PartialOps[A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$47$](A, β$47$)] is in scope.

    Definition Classes

    RecursiveTuple2Ops

25. def tailOption: slamdata.Predef.Option[PartialOps[A]]

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveListFOps[PartialOps[A], A] performed by method RecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$12$]ListF[A, β$12$]] is in scope.

    Definition Classes

    RecursiveListFOps

26. def take[N](i: N)(implicit N: Aux[N, slamdata.Predef.Option]): PartialOps[A]

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to BirecursiveListFOps[PartialOps[A], A] performed by method BirecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$14$]ListF[A, β$14$]] is in scope.

    Definition Classes

    BirecursiveListFOps

27. def toColist[L](implicit L: Aux[L, [β$48$]ListF[A, β$48$]]): L

    

    Colists are simply streams that may terminate, so a stream is easily converted to a Colist that doesn’t terminate.

    Colists are simply streams that may terminate, so a stream is easily converted to a Colist that doesn’t terminate.

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveTuple2Ops[PartialOps[A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$47$](A, β$47$)] is in scope.

    Definition Classes

    RecursiveTuple2Ops

28. def toInt: slamdata.Predef.Int

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveOptionOps[PartialOps[A]] performed by method RecursiveOptionOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], slamdata.Predef.Option] is in scope.

    Definition Classes

    RecursiveOptionOps

29. def toNEColist[L](implicit L: Aux[L, [β$49$]AndMaybe[A, β$49$]]): L

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveTuple2Ops[PartialOps[A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$47$](A, β$47$)] is in scope.

    Definition Classes

    RecursiveTuple2Ops

30. def toPossiblyEmpty[L](implicit L: Aux[L, [β$31$]ListF[A, β$31$]]): L

    

    Implicit information

    This member is added by an implicit conversion from PartialOps[A] to RecursiveAndMaybeOps[PartialOps[A], A] performed by method RecursiveAndMaybeOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[PartialOps[A], [β$30$]AndMaybe[A, β$30$]] is in scope.

    Definition Classes

    RecursiveAndMaybeOps

31. def toString(): String

    

    Definition Classes

    AnyRef → Any

32. final def unsafePerformSync: A

    

    Run to completion (if it completes).

    Run to completion (if it completes).

    Annotations

    @tailrec()

33. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

36. def ≈(that: Partial[A])(implicit A: Equal[A]): Partial[slamdata.Predef.Boolean]

    

    If two Partials eventually have the same value, then they are equivalent.