abstract class GenericBatch[+A] extends Batch[A]
Reusable Batch base class that can be used for implementing generators that simply modify their underlying cursor reference.
- Source
- GenericBatch.scala
- Alphabetic
- By Inheritance
- GenericBatch
- Batch
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new GenericBatch()
Abstract Value Members
- abstract def cursor(): BatchCursor[A]
- Definition Classes
- Batch
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def collect[B](pf: PartialFunction[A, B]): Batch[B]
Creates a generator by transforming values produced by the source with a partial function, dropping those values for which the partial function is not defined.
Creates a generator by transforming values produced by the source with a partial function, dropping those values for which the partial function is not defined.
- pf
the partial function which filters and maps the generator.
- returns
a new generator which yields each value
xproduced by this generator for whichpfis defined
- Definition Classes
- GenericBatch → Batch
- final def drop(n: Int): Batch[A]
Creates a new generator from the source, with the first
nelements dropped, of ifnis higher than the length of the underlying collection, the it mirrors the source, whichever applies.Creates a new generator from the source, with the first
nelements dropped, of ifnis higher than the length of the underlying collection, the it mirrors the source, whichever applies.- Definition Classes
- GenericBatch → Batch
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def filter(p: (A) => Boolean): Batch[A]
Returns a generator over all the elements of the source that satisfy the predicate
p.Returns a generator over all the elements of the source that satisfy the predicate
p. The order of the elements is preserved.- p
the predicate used to test values.
- returns
a generator which produces those values of the source which satisfy the predicate
p.
- Definition Classes
- GenericBatch → Batch
- final def foldLeft[R](initial: R)(op: (R, A) => R): R
Applies a binary operator to a start value and all elements of this generator, going left to right.
Applies a binary operator to a start value and all elements of this generator, going left to right.
- R
is the result type of the binary operator.
- initial
is the start value.
- op
the binary operator to apply
- returns
the result of inserting
opbetween consecutive elements of this generator, going left to right with the start valueinitialon the left. Returnsinitialif the generator is empty.
- Definition Classes
- GenericBatch → Batch
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def map[B](f: (A) => B): Batch[B]
Creates a new generator that maps all values produced by the source to new values using a transformation function.
Creates a new generator that maps all values produced by the source to new values using a transformation function.
- f
is the transformation function
- returns
a new generator which transforms every value produced by the source by applying the function
fto it.
- Definition Classes
- GenericBatch → Batch
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def slice(from: Int, until: Int): Batch[A]
Creates a new generator emitting an interval of the values produced by the source.
Creates a new generator emitting an interval of the values produced by the source.
- from
the index of the first generated element which forms part of the slice.
- until
the index of the first element following the slice.
- returns
a generator which emits the element of the source past the first
fromelements usingdrop, and then takesuntil - fromelements, usingtake
- Definition Classes
- GenericBatch → Batch
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def take(n: Int): Batch[A]
Creates a new generator that will only return the first
nelements of the source.Creates a new generator that will only return the first
nelements of the source.- Definition Classes
- GenericBatch → Batch
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
Converts this generator into a standard
Array.Converts this generator into a standard
Array.- Definition Classes
- Batch
- def toIterable: Iterable[A]
Converts this generator into a Scala
Iterable.Converts this generator into a Scala
Iterable.- Definition Classes
- Batch
- def toList: List[A]
Converts this generator into a Scala immutable
List.Converts this generator into a Scala immutable
List.- Definition Classes
- Batch
- def toString(): String
- Definition Classes
- AnyRef → Any
- def transform[B](f: (BatchCursor[A]) => BatchCursor[B]): Batch[B]
Transforms this generator with a mapping function for the underlying BatchCursor.
Transforms this generator with a mapping function for the underlying BatchCursor.
NOTE: application of this function can be either strict or lazy (depending on the underlying generator type), but it does not modify the original collection.
- if this generator is an
Array-backed generator, the given function will be applied immediately to create a new array with an accompanying generator. - if this generator is backed by
Iterable, then the given function will be applied lazily, on demand
- f
is the function used
- returns
a new generator with its underlying sequence transformed by the mapping function
- Attributes
- protected
- if this generator is an
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
This is the API documentation for the Monix library.
Package Overview
monix.execution exposes lower level primitives for dealing with asynchronous execution:
Atomictypes, as alternative tojava.util.concurrent.atomicmonix.catnap exposes pure abstractions built on top of the Cats-Effect type classes:
monix.eval is for dealing with evaluation of results, thus exposing Task and Coeval.
monix.reactive exposes the
Observablepattern:Observableimplementationsmonix.tail exposes Iterant for purely functional pull based streaming:
BatchandBatchCursor, the alternatives to Scala'sIterableandIteratorrespectively that we are using within Iterant's encodingYou can control evaluation with type you choose - be it Task, Coeval, cats.effect.IO or your own as long as you provide correct cats-effect or cats typeclass instance.