Class

matryoshka.instances.fixedpoint

RecursiveListFOps

Related Doc: package fixedpoint

Permalink

implicit class RecursiveListFOps[T, A] extends AnyRef

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RecursiveListFOps
  2. AnyRef
  3. Any
Implicitly
  1. by BirecursiveTuple2Ops
  2. by RecursiveTuple2Ops
  3. by RecursiveAndMaybeOps
  4. by BirecursiveListFOps
  5. by RecursiveListFOps
  6. by BirecursiveOptionOps
  7. by CorecursiveOptionOps
  8. by RecursiveOptionOps
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RecursiveListFOps(self: T)(implicit T: Aux[T, [β$12$]ListF[A, β$12$]])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: RecursiveListFOps[T, A]): RecursiveListFOps[T, A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to BirecursiveOptionOps[RecursiveListFOps[T, A]] performed by method BirecursiveOptionOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], slamdata.Predef.Option] is in scope.
    Definition Classes
    BirecursiveOptionOps
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  5. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def drop[N](n: N)(implicit N: Aux[N, slamdata.Predef.Option]): RecursiveListFOps[T, A]

    Permalink

    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 RecursiveListFOps[T, A] to BirecursiveTuple2Ops[RecursiveListFOps[T, A], A] performed by method BirecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$54$](A, β$54$)] is in scope.
    Definition Classes
    BirecursiveTuple2Ops
  8. final def eq(arg0: AnyRef): Boolean

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

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

    Permalink
    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]

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  14. def head: A

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveTuple2Ops[RecursiveListFOps[T, A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$47$](A, β$47$)] is in scope.
    Definition Classes
    RecursiveTuple2Ops
  15. def headOption: slamdata.Predef.Option[A]

    Permalink
  16. final def isInstanceOf[T0]: Boolean

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

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

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

    Permalink
    Definition Classes
    AnyRef
  20. def succ: RecursiveListFOps[T, A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to CorecursiveOptionOps[RecursiveListFOps[T, A]] performed by method CorecursiveOptionOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], slamdata.Predef.Option] is in scope.
    Definition Classes
    CorecursiveOptionOps
  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def tail: RecursiveListFOps[T, A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveTuple2Ops[RecursiveListFOps[T, A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$47$](A, β$47$)] is in scope.
    Definition Classes
    RecursiveTuple2Ops
  23. def tailOption: slamdata.Predef.Option[T]

    Permalink
  24. def take[N](i: N)(implicit N: Aux[N, slamdata.Predef.Option]): RecursiveListFOps[T, A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to BirecursiveListFOps[RecursiveListFOps[T, A], A] performed by method BirecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$14$]ListF[A, β$14$]] is in scope.
    Definition Classes
    BirecursiveListFOps
  25. def toColist[L](implicit L: Aux[L, [β$48$]ListF[A, β$48$]]): L

    Permalink

    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 RecursiveListFOps[T, A] to RecursiveTuple2Ops[RecursiveListFOps[T, A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$47$](A, β$47$)] is in scope.
    Definition Classes
    RecursiveTuple2Ops
  26. def toInt: slamdata.Predef.Int

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveOptionOps[RecursiveListFOps[T, A]] performed by method RecursiveOptionOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], slamdata.Predef.Option] is in scope.
    Definition Classes
    RecursiveOptionOps
  27. def toNEColist[L](implicit L: Aux[L, [β$49$]AndMaybe[A, β$49$]]): L

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveTuple2Ops[RecursiveListFOps[T, A], A] performed by method RecursiveTuple2Ops in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$47$](A, β$47$)] is in scope.
    Definition Classes
    RecursiveTuple2Ops
  28. def toPossiblyEmpty[L](implicit L: Aux[L, [β$31$]ListF[A, β$31$]]): L

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveAndMaybeOps[RecursiveListFOps[T, A], A] performed by method RecursiveAndMaybeOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$30$]AndMaybe[A, β$30$]] is in scope.
    Definition Classes
    RecursiveAndMaybeOps
  29. def toString(): String

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

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

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

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

Shadowed Implicit Value Members

  1. def find(cond: (A) ⇒ slamdata.Predef.Boolean): slamdata.Predef.Option[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveListFOps[RecursiveListFOps[T, A], A] performed by method RecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$12$]ListF[A, β$12$]] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (recursiveListFOps: RecursiveListFOps[RecursiveListFOps[T, A], A]).find(cond)
  2. def headOption: slamdata.Predef.Option[A]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveListFOps[RecursiveListFOps[T, A], A] performed by method RecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$12$]ListF[A, β$12$]] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (recursiveListFOps: RecursiveListFOps[RecursiveListFOps[T, A], A]).headOption
  3. def tailOption: slamdata.Predef.Option[RecursiveListFOps[T, A]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from RecursiveListFOps[T, A] to RecursiveListFOps[RecursiveListFOps[T, A], A] performed by method RecursiveListFOps in matryoshka.instances.fixedpoint. This conversion will take place only if an implicit value of type Aux[RecursiveListFOps[T, A], [β$12$]ListF[A, β$12$]] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (recursiveListFOps: RecursiveListFOps[RecursiveListFOps[T, A], A]).tailOption

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion BirecursiveTuple2Ops from RecursiveListFOps[T, A] to BirecursiveTuple2Ops[RecursiveListFOps[T, A], A]

Inherited by implicit conversion RecursiveTuple2Ops from RecursiveListFOps[T, A] to RecursiveTuple2Ops[RecursiveListFOps[T, A], A]

Inherited by implicit conversion RecursiveAndMaybeOps from RecursiveListFOps[T, A] to RecursiveAndMaybeOps[RecursiveListFOps[T, A], A]

Inherited by implicit conversion BirecursiveListFOps from RecursiveListFOps[T, A] to BirecursiveListFOps[RecursiveListFOps[T, A], A]

Inherited by implicit conversion RecursiveListFOps from RecursiveListFOps[T, A] to RecursiveListFOps[RecursiveListFOps[T, A], A]

Inherited by implicit conversion BirecursiveOptionOps from RecursiveListFOps[T, A] to BirecursiveOptionOps[RecursiveListFOps[T, A]]

Inherited by implicit conversion CorecursiveOptionOps from RecursiveListFOps[T, A] to CorecursiveOptionOps[RecursiveListFOps[T, A]]

Inherited by implicit conversion RecursiveOptionOps from RecursiveListFOps[T, A] to RecursiveOptionOps[RecursiveListFOps[T, A]]

Ungrouped