object AsyncQueue
- Source
- AsyncQueue.scala
- Alphabetic
- By Inheritance
- AsyncQueue
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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 bounded[A](capacity: Int)(implicit s: Scheduler): AsyncQueue[A]
Builds a limited capacity and back-pressured AsyncQueue.
Builds a limited capacity and back-pressured AsyncQueue.
- capacity
is the maximum capacity of the internal buffer; note that due to performance optimizations, the actual capacity gets rounded to a power of 2, so the actual capacity may be slightly different than the one specified
- s
is a Scheduler, needed for asynchronous waiting on
poll
when the queue is empty or for back-pressuringoffer
when the queue is full
- Annotations
- @UnsafeBecauseImpure()
- See also
unbounded for building an unbounded queue that can use the entire memory available to the process.
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def unbounded[A](chunkSizeHint: Option[Int] = None)(implicit s: Scheduler): AsyncQueue[A]
Builds an unlimited AsyncQueue that can use the entire memory available to the process.
Builds an unlimited AsyncQueue that can use the entire memory available to the process.
- chunkSizeHint
is an optimization parameter — the underlying implementation may use an internal buffer that uses linked arrays, in which case the "chunk size" represents the size of a chunk; providing it is just a hint, it may or may not be used
- s
is a Scheduler, needed for asynchronous waiting on
poll
when the queue is empty or for back-pressuringoffer
when the queue is full
- Annotations
- @UnsafeBecauseImpure()
- See also
bounded for building a limited capacity queue.
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- 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()
- def withConfig[A](capacity: BufferCapacity, channelType: ChannelType)(implicit scheduler: Scheduler): AsyncQueue[A]
Builds an AsyncQueue with fine-tuned config parameters.
Builds an AsyncQueue with fine-tuned config parameters.
This is unsafe due to problems that can happen via selecting the wrong ChannelType, so use with care.
- capacity
specifies the BufferCapacity, which can be either "bounded" (with a maximum capacity), or "unbounded"
- channelType
(UNSAFE) specifies the concurrency scenario, for fine tuning the performance
- Annotations
- @UnsafeProtocol() @UnsafeBecauseImpure()
This is the API documentation for the Monix library.
Package Overview
monix.execution exposes lower level primitives for dealing with asynchronous execution:
Atomic
types, as alternative tojava.util.concurrent.atomic
monix.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
Observable
pattern:Observable
implementationsmonix.tail exposes Iterant for purely functional pull based streaming:
Batch
andBatchCursor
, the alternatives to Scala'sIterable
andIterator
respectively 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.