mot.queue.LinkedBlockingMultiQueue

SubQueue

Related Doc: package LinkedBlockingMultiQueue

class SubQueue extends Offerable[E]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SubQueue
  2. Offerable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SubQueue(capacity: Int, priority: Int)

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. val capacity: Int

  6. def clear(): Unit

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def enable(status: Boolean): Unit

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  14. def isEmpty(): Boolean

  15. def isEnabled(): Boolean

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  20. def offer(e: E): Boolean

    Insert the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.

    Insert the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.

    e

    the element to add

    returns

    true if the element was added to this queue, else false

    Definition Classes
    SubQueueOfferable
  21. def offer(e: E, timeout: Long, unit: TimeUnit): Boolean

    Insert the specified element into this queue, waiting up to the specified wait time if necessary for space to become available.

    Insert the specified element into this queue, waiting up to the specified wait time if necessary for space to become available.

    e

    the element to add

    timeout

    how long to wait before giving up, in units of unit

    unit

    a TimeUnit determining how to interpret the timeout parameter

    returns

    true if successful, or false if the specified waiting time elapses before space is available

    Definition Classes
    SubQueueOfferable
  22. val priority: Int

  23. def size(): Int

    Return the number of elements in this queue.

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

    Definition Classes
    AnyRef
  25. def toString(): String

    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Offerable[E]

Inherited from AnyRef

Inherited from Any

Ungrouped