class MessageQueue extends LinkedBlockingDeque[Envelope] with UnboundedDequeBasedMessageQueue
- Alphabetic
- By Inheritance
- MessageQueue
- UnboundedDequeBasedMessageQueue
- UnboundedDequeBasedMessageQueueSemantics
- UnboundedMessageQueueSemantics
- DequeBasedMessageQueue
- DequeBasedMessageQueueSemantics
- QueueBasedMessageQueue
- MultipleConsumerSemantics
- MessageQueue
- LinkedBlockingDeque
- Serializable
- BlockingDeque
- Deque
- BlockingQueue
- AbstractQueue
- Queue
- AbstractCollection
- Collection
- Iterable
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new MessageQueue()
Value Members
- def add(arg0: Envelope): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → BlockingQueue → AbstractQueue → Queue → AbstractCollection → Collection
- def addAll(arg0: Collection[_ <: Envelope]): Boolean
- Definition Classes
- LinkedBlockingDeque → Deque → AbstractQueue → AbstractCollection → Collection
- def addFirst(arg0: Envelope): Unit
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def addLast(arg0: Envelope): Unit
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def cleanUp(owner: ActorRef, deadLetters: dispatch.MessageQueue): Unit
Called when the mailbox this queue belongs to is disposed of.
Called when the mailbox this queue belongs to is disposed of. Normally it is expected to transfer all remaining messages into the dead letter queue which is passed in. The owner of this MessageQueue is passed in if available (e.g. for creating DeadLetters()), “/deadletters” otherwise.
Note that we implement the method in a recursive manner mainly for atomicity (not touching the queue twice).
- Definition Classes
- QueueBasedMessageQueue → MessageQueue
- def clear(): Unit
- Definition Classes
- LinkedBlockingDeque → AbstractQueue → AbstractCollection → Collection
- def contains(arg0: AnyRef): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → BlockingQueue → AbstractCollection → Collection
- def containsAll(arg0: Collection[_ <: AnyRef]): Boolean
- Definition Classes
- AbstractCollection → Collection
- def dequeue(): Envelope
Try to dequeue the next message from this queue, return null failing that.
Try to dequeue the next message from this queue, return null failing that.
- Definition Classes
- UnboundedDequeBasedMessageQueue → MessageQueue
- def descendingIterator(): Iterator[Envelope]
- Definition Classes
- LinkedBlockingDeque → Deque
- def drainTo(arg0: Collection[_ >: Envelope <: AnyRef], arg1: Int): Int
- Definition Classes
- LinkedBlockingDeque → BlockingQueue
- def drainTo(arg0: Collection[_ >: Envelope <: AnyRef]): Int
- Definition Classes
- LinkedBlockingDeque → BlockingQueue
- def element(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → AbstractQueue → Queue
- def enqueue(receiver: ActorRef, handle: Envelope): Unit
Try to enqueue the message to this queue, or throw an exception.
Try to enqueue the message to this queue, or throw an exception.
- Definition Classes
- UnboundedDequeBasedMessageQueue → MessageQueue
- def enqueueFirst(receiver: ActorRef, handle: Envelope): Unit
- Definition Classes
- UnboundedDequeBasedMessageQueue → DequeBasedMessageQueueSemantics
- def forEach(arg0: Consumer[_ >: Envelope <: AnyRef]): Unit
- Definition Classes
- LinkedBlockingDeque → Iterable
- def getFirst(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def getLast(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def hasMessages: Boolean
Indicates whether this queue is non-empty.
Indicates whether this queue is non-empty.
- Definition Classes
- QueueBasedMessageQueue → MessageQueue
- def isEmpty(): Boolean
- Definition Classes
- AbstractCollection → Collection
- def iterator(): Iterator[Envelope]
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → AbstractCollection → Collection → Iterable
- def numberOfMessages: Int
Should return the current number of messages held in this queue; may always return 0 if no other value is available efficiently.
Should return the current number of messages held in this queue; may always return 0 if no other value is available efficiently. Do not use this for testing for presence of messages, use
hasMessages
instead.- Definition Classes
- QueueBasedMessageQueue → MessageQueue
- def offer(arg0: Envelope, arg1: Long, arg2: TimeUnit): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → BlockingQueue
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def offer(arg0: Envelope): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → BlockingQueue → Queue
- def offerFirst(arg0: Envelope, arg1: Long, arg2: TimeUnit): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def offerFirst(arg0: Envelope): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def offerLast(arg0: Envelope, arg1: Long, arg2: TimeUnit): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def offerLast(arg0: Envelope): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def parallelStream(): Stream[Envelope]
- Definition Classes
- Collection
- def peek(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → Queue
- def peekFirst(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def peekLast(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def poll(arg0: Long, arg1: TimeUnit): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → BlockingQueue
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def poll(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → Queue
- def pollFirst(arg0: Long, arg1: TimeUnit): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def pollFirst(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def pollLast(arg0: Long, arg1: TimeUnit): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def pollLast(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def pop(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def push(arg0: Envelope): Unit
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def put(arg0: Envelope): Unit
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → BlockingQueue
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def putFirst(arg0: Envelope): Unit
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def putLast(arg0: Envelope): Unit
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final val queue: MessageQueue
- Definition Classes
- MessageQueue → DequeBasedMessageQueue → QueueBasedMessageQueue
- def remainingCapacity(): Int
- Definition Classes
- LinkedBlockingDeque → BlockingQueue
- def remove(arg0: AnyRef): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → BlockingQueue → AbstractCollection → Collection
- def remove(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → AbstractQueue → Queue
- def removeAll(arg0: Collection[_ <: AnyRef]): Boolean
- Definition Classes
- LinkedBlockingDeque → AbstractCollection → Collection
- def removeFirst(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def removeFirstOccurrence(arg0: AnyRef): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def removeIf(arg0: Predicate[_ >: Envelope <: AnyRef]): Boolean
- Definition Classes
- LinkedBlockingDeque → Collection
- def removeLast(): Envelope
- Definition Classes
- LinkedBlockingDeque → Deque
- def removeLastOccurrence(arg0: AnyRef): Boolean
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque
- def retainAll(arg0: Collection[_ <: AnyRef]): Boolean
- Definition Classes
- LinkedBlockingDeque → AbstractCollection → Collection
- def size(): Int
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → Deque → AbstractCollection → Collection
- def spliterator(): Spliterator[Envelope]
- Definition Classes
- LinkedBlockingDeque → Collection → Iterable
- def stream(): Stream[Envelope]
- Definition Classes
- Collection
- def take(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque → BlockingQueue
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def takeFirst(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def takeLast(): Envelope
- Definition Classes
- LinkedBlockingDeque → BlockingDeque
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def toArray[T <: AnyRef](arg0: Array[T]): Array[T]
- Definition Classes
- LinkedBlockingDeque → AbstractCollection → Collection
- def toArray(): Array[AnyRef]
- Definition Classes
- LinkedBlockingDeque → AbstractCollection → Collection
- def toArray[T <: AnyRef](arg0: IntFunction[Array[T]]): Array[T]
- Definition Classes
- Collection
- def toString(): String
- Definition Classes
- LinkedBlockingDeque → AbstractCollection → AnyRef → Any