BurstQueue
Mutable class for managing the message queue . We want this to be fast, and we know we always empty all at once, after which it may grow again. Therefore we might as well use a list. Growing is fast, and whatever other structure we use, there will at least be once an O(n) operation involved. In case there are not a lot of messages List wins from the other collections because of the low overhead setup.
Attributes
- Graph
-
- Supertypes
Members list
Value members
Concrete methods
Get all the messages in posted order, clear queue. Since the list must be reversed this is not fast O(n). If there is already a tail, elements of the queue are prepended.
Get all the messages in posted order, clear queue. Since the list must be reversed this is not fast O(n). If there is already a tail, elements of the queue are prepended.
Attributes
Inherited methods
Remove all messages from the queue(s), always fast: O(1)
Put an element on the queue. Always fast O(1).
See if the queue is empty, always fast: O(1)
The maximum number of messages that were held in the queue at once
The maximum number of messages that were held in the queue at once
Attributes
- Inherited from:
- ShareQueue
Clear the statistics on this queue. The queue itself remains as is.
Clear the statistics on this queue. The queue itself remains as is.
Attributes
- Inherited from:
- ShareQueue
The size of this queue, always fast: O(1)
The total number of messages that were processed by the queue