Queue

abstract def add(t: T): Unit

These are the only two methods to implement.

abstract def pollNonBlocking: Option[T]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def dequeueAll(fn: (T) ⇒ Boolean): Seq[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def foldLeft[V](init: V)(fn: (V, T) ⇒ V): V

final def foreach(fn: (T) ⇒ Unit): Unit

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

def poll: Option[T]

check if something is ready now

def put(item: T): Int

def putAll(items: TraversableOnce[T]): Int

Returns the size immediately after the put

def size: Int

Obviously, this might not be the same by the time you call trimTo or poll

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

def take(maxSeqSize: Int): Seq[T]

Take items currently in the queue up to the max sequence size we want to return Due to threading/muliple readers/writers this will not be an exact size

def toSeq: Seq[T]

Take all the items currently in the queue

def toString(): String

def trimTo(maxLength: Int): Seq[T]

Take enough elements to get .

final def wait(): Unit

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

final def wait(arg0: Long): Unit