From 2de74571bd0798f640272d0196f4bd0adcd2fab8 Mon Sep 17 00:00:00 2001 From: Xevion Date: Wed, 29 Jan 2020 20:27:38 -0600 Subject: [PATCH] Queue and Deque Interface examples --- study/COLLECTIONS.MD | 13 +++++++++++++ 1 file changed, 13 insertions(+) diff --git a/study/COLLECTIONS.MD b/study/COLLECTIONS.MD index abff609..4700525 100644 --- a/study/COLLECTIONS.MD +++ b/study/COLLECTIONS.MD @@ -113,12 +113,25 @@ A Queue implements a basic first-in, first-out (FIFO) order. It is a ordered lis Queue interface is implemented by the classes (and interfaces) [PriorityQueue](#priorityqueue-class), [Deque](#deque-interface), and [ArrayDeque](#arraydeque-class). +```java +Queue q; +q = new PriorityQueue(); +q = new ArrayDeque(); // Deque Interface is an extension of Queue +``` + ### Deque Interface An extension of the [Queue](#queue-interface) Interface, the Deque can remove and add elements from both sides of the list. It stands for *double-ended queue* (addition and removal ops can be done on both sides). Side note: Deque is pronounced like Deck (i.e. a deck of cards), not like DQ (Dee-Cue) as might be interpreted based on it's underlying meaning. +Deque is implemented in the class [ArrayDeque](#arraydeque-class) + +```java +Deque d; +d = new ArrayDeque(); +``` + ### Set Interface ### SortedSet Interface