{"id":7321,"date":"2021-07-01T15:35:58","date_gmt":"2021-07-01T19:35:58","guid":{"rendered":"https:\/\/springframework.guru\/?p=7321"},"modified":"2021-09-10T08:55:00","modified_gmt":"2021-09-10T12:55:00","slug":"using-deque-in-java","status":"publish","type":"post","link":"https:\/\/springframework.guru\/using-deque-in-java\/","title":{"rendered":"Using Deque in Java"},"content":{"rendered":"

A Deque<\/code> is a linear collection that supports element insertion and removal at both ends. The name deque is short for “double ended queue” and is usually pronounced “deck”.<\/p>\n

The Deque<\/code> interface defines methods to access the elements at both ends of the deque. Methods are provided to insert, remove, and examine the element. Each of these methods exists in two forms: one throws an exception if the operation fails, the other returns a special value (either null or false, depending on the operation).<\/p>\n

In this post, you”ll learn about all implementing classes of Deque<\/code>, their creation and methods supported by each of them.<\/p>\n

Representation of a Deque<\/h2>\n

\"\"<\/a><\/p>\n

In Deque<\/code> the insertion and removal of elements can either be performed from the front or the rear. Thus, it does not follow FIFO rule (First In First Out).<\/p>\n

Types of Deque<\/h2>\n
\n
Input Restricted Deque<\/strong><\/dt>\n
In this deque, input is restricted at a single end but allows deletion at both the ends.<\/dd>\n<\/dl>\n
\n
Output Restricted Deque<\/strong><\/dt>\n
In this deque, output is restricted at a single end but allows insertion at both the ends.<\/dd>\n<\/dl>\n

Implementing Classes of Deque Interface<\/h2>\n