Packages

class Queue[A] extends AnyRef

 * A Queue is a lightweight, asynchronous queue. This implementation is  * naive, if functional, and could benefit from significant optimization.  *  * TODO:  *  * 1. Investigate using a faster option than Queue, because Queue has  *    O(n) length method.  * 2. Benchmark to see how slow this implementation is and if there are any  *    easy ways to improve performance.  

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Queue
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def interruptOffer(t: Throwable): IO[Nothing, Boolean]

    Interrupts any fibers that are suspended on offer because the queue is    * at capacity.

    Interrupts any fibers that are suspended on offer because the queue is    * at capacity. If any fibers are interrupted, returns true, otherwise,    * returns  false.

  12. final def interruptTake(t: Throwable): IO[Nothing, Boolean]

    Interrupts any fibers that are suspended on take because the queue is    * empty.

    Interrupts any fibers that are suspended on take because the queue is    * empty. If any fibers are interrupted, returns true, otherwise, returns    * false.

  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def offer(a: A): IO[Nothing, Unit]

    Places the value in the queue.

    Places the value in the queue. If the queue has reached capacity, then    * the fiber performing the offer will be suspended until there is room in    * the queue.

  18. final def size: IO[Nothing, Int]

    Retrieves the size of the queue, which is equal to the number of elements in the queue.

    Retrieves the size of the queue, which is equal to the number of elements in the queue. This may be negative if fibers are suspended waiting for elements to be added to the queue.

  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. final def take: IO[Nothing, A]

    Removes the oldest value in the queue.

    Removes the oldest value in the queue. If the queue is empty, this will    * return a computation that resumes when an item has been added to the queue.

  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped