![]() 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 One throws an exception if the operation fails, the other returns a 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". A linear collection that supports element insertion and removal atīoth ends.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |