DelayOverflowStrategy

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def backpressure: DelayOverflowStrategy

If the buffer is full when a new element is available this strategy backpressures the upstream publisher until space becomes available in the buffer.

def clone(): AnyRef

def dropBuffer: DelayOverflowStrategy

If the buffer is full when a new element arrives, drops all the buffered elements to make space for the new element.

def dropHead: DelayOverflowStrategy

If the buffer is full when a new element arrives, drops the oldest element from the buffer to make space for the new element.

def dropNew: DelayOverflowStrategy

If the buffer is full when a new element arrives, drops the new element.

def dropTail: DelayOverflowStrategy

If the buffer is full when a new element arrives, drops the youngest element from the buffer to make space for the new element.

def emitEarly: DelayOverflowStrategy

If the buffer is full when a new element is available this strategy send next element downstream without waiting

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def fail: DelayOverflowStrategy

If the buffer is full when a new element is available this strategy completes the stream with failure.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def finalize(): Unit