object Strategy
- Source
- Queue.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Strategy
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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 boundedFifo[A](maxSize: Int): Strategy[A, Chunk[A], SizedQueue[A], Int]
Unbounded fifo strategy.
- def boundedLifo[A](maxSize: Int): Strategy[A, Chunk[A], SizedQueue[A], Int]
Unbounded lifo strategy.
- def circularBuffer[A](maxSize: Int): Strategy[A, Chunk[A], SizedQueue[A], Int]
Strategy for circular buffer, which stores the last
maxSizeenqueued elements and never blocks on enqueue. - def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def fifo[A]: Strategy[A, Chunk[A], SizedQueue[A], Int]
Unbounded fifo strategy.
- 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
- def lifo[A]: Strategy[A, Chunk[A], SizedQueue[A], Int]
Unbounded lifo strategy.
- 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 synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def synchronous[A]: Strategy[A, Chunk[A], (Boolean, Option[A]), Int]
Strategy that allows at most a single element to be published.
Strategy that allows at most a single element to be published. Before the
Ais published successfully, at least one subscriber must be ready to consume. - def toString(): String
- Definition Classes
- AnyRef → Any
- def unbounded[A](append: (SizedQueue[A], A) => SizedQueue[A]): Strategy[A, Chunk[A], SizedQueue[A], Int]
Creates unbounded queue strategy for
Awith configurable append function.Creates unbounded queue strategy for
Awith configurable append function.- append
function used to append new elements to the queue
- 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated