Specified by: add in interface Collection Specified by: add in interface Queue Parameters: e - the element to add Returns: true (as specified by Collection. When using a capacity-restricted deque, it is generally preferable to IllegalStateException if no space is currently available. numbers.offer() - insert elements to the rear of the queue numbers. Here, we have used the LinkedList class that implements the Queue interface. You could also delete the queue via removeQueue (String) or removeTopic (String) methods on the BrokerViewMBean. In the above example, we have used the Queue interface to implement the queue in Java. Another option is to use JMX to browse the queues and call the purge () method on the QueueViewMBean. Immediately without violating capacity restrictions, returning You can use the Web Console to view queues, add/remove queues, purge queues or delete/forward individual messages. (in other words, at the tail of this deque) if it is possible to do so Inserts the specified element into the queue represented by this deque This interface is a member of the Java Collections Methods, but instead inherit the identity-based versions from class Null is used as a special return value by various methodsÄeque implementations generally do not defineÄ®lement-based versions of the equals and hashCode Take advantage of the ability to insert nulls. That do allow null elements are strongly encouraged not to To prohibit the insertion of null elements, they are stronglyÄ®ncouraged to do so. While Deque implementations are not strictly required Provide support for indexed access to elements. Unlike the List interface, this interface does not This interface provides two methods to remove interior Note that the peek method works equally well whenĪ deque is used as a queue or a stack in either case, elements are Stack methods are precisely equivalent toÄeque methods as indicated in the table below:Ĭomparison of Stack and Deque methods Stack Method When a deque is used as a stack, elements are pushed and popped from theÄ«eginning of the deque. Interface should be used in preference to the legacy Stack class. Inherited from the Queue interface are precisely equivalent toÄeque methods as indicated in the following table:Ĭomparison of Queue and Deque methods Queue MethodÄeques can also be used as LIFO (Last-In-First-Out) stacks. Elements areĪdded at the end of the deque and removed from the beginning. Used as a queue, FIFO (First-In-First-Out) behavior results. This interface extends the Queue interface. The twelve methods described above are summarized in the The latter form of the insert operation isÄesigned specifically for use with capacity-restrictedÄeque implementations in most implementations, insert Special value (either null or false, depending on The tail of the queue is that element that has been on. The head of the queue is that element that has been on the queue the longest time. This queue orders elements FIFO (first-in-first-out). An unbounded thread-safe queue based on linked nodes. One throws an exception if the operation fails, the other returns a public class ConcurrentLinkedQueue extends AbstractQueue implements Queue , Serializable.Each of these methods exists in two forms: Methods are provided to insert, remove, andÄ®xamine the element. This interface defines methods to access the elements at bothÄ®nds of the deque. They may contain, but this interface supports capacity-restrictedÄeques as well as those with no fixed size limit. Implementations place no fixed limits on the number of elements The name deque is short for "double ended queue"Īnd is usually pronounced "deck". Thrown.A linear collection that supports element insertion and removal atÄ«oth ends. Having been successfully added when the associated exception is Null element) may result in only some of the elements Trying to add an element (including, in particular, a This implementation iterates over the specified collection,Īnd adds each element returned by the iterator to this Modified while the operation is in progress. This operation is undefined if the specified collection is Attempts to addAll of a queue to itself result in Adds all of the elements in the specified collection to this
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |