diff options
author | Matt Strapp <matt@mattstrapp.net> | 2022-05-24 11:18:46 -0500 |
---|---|---|
committer | Matt Strapp <matt@mattstrapp.net> | 2022-05-24 11:19:55 -0500 |
commit | 7a73162607544204032aa66cce755daf21edebda (patch) | |
tree | 58578e01f15f34a855d99c32898db9d7a1603e67 /csci1913/Java/lab11_strap012.java | |
parent | do some stuff (diff) | |
download | homework-7a73162607544204032aa66cce755daf21edebda.tar homework-7a73162607544204032aa66cce755daf21edebda.tar.gz homework-7a73162607544204032aa66cce755daf21edebda.tar.bz2 homework-7a73162607544204032aa66cce755daf21edebda.tar.lz homework-7a73162607544204032aa66cce755daf21edebda.tar.xz homework-7a73162607544204032aa66cce755daf21edebda.tar.zst homework-7a73162607544204032aa66cce755daf21edebda.zip |
Graduate
Signed-off-by: Matt Strapp <matt@mattstrapp.net>
Diffstat (limited to 'csci1913/Java/lab11_strap012.java')
-rw-r--r-- | csci1913/Java/lab11_strap012.java | 115 |
1 files changed, 115 insertions, 0 deletions
diff --git a/csci1913/Java/lab11_strap012.java b/csci1913/Java/lab11_strap012.java new file mode 100644 index 0000000..7eb146a --- /dev/null +++ b/csci1913/Java/lab11_strap012.java @@ -0,0 +1,115 @@ +class Deque<Base> { + private Node head; + private class Node { + private Base object; + private Node left; + private Node right; + private Node(Base o, Node l, Node r) { + object = o; + left = l; right = r; + } + } + public Deque() { + head = new Node(null, null, null); + head.left=head; head.right=head; + } + public void enqueueRear(Base object) { + Node tempL = head; + Node newNode = new Node(object, tempL.left, tempL); + tempL.left.right = newNode; + tempL.left = newNode; + } + public void enqueueFront(Base object) { + Node tempR = head; + Node newNode = new Node(object, tempR, tempR.right); + tempR.right.left = newNode; + tempR.right = newNode; + } + public Base dequeueRear() { + if (isEmpty()) { + throw new IllegalStateException(); + } else { + Node temp = head.left; + temp.left.right = head; + head.left = temp.left; + return temp.object; + } + } + public Base dequeueFront() { + if (isEmpty()) { + throw new IllegalStateException(); + } else { + Node temp = head.right; + temp.right.left = head; + head.right = temp.right; + return temp.object; + } + } + public Boolean isEmpty() { + return head.right==head && head.left==head; + } +} + +// OBSERVATION DEQUE. Test the class DEQUE. 40 points total. +class ObservationDeque{ +// MAIN. Test the DEQUE on various example arguments. + public static void main(String [] args) { + Deque<String> deque = new Deque<String>(); + System.out.println(deque.isEmpty()); // true 2 points. + try { + System.out.println(deque.dequeueFront()); + } catch (IllegalStateException ignore) { + System.out.println("No dequeueFront."); // No dequeueFront. 2 points. + } + try { System.out.println(deque.dequeueRear()); + } catch (IllegalStateException ignore) { + System.out.println("No dequeueRear."); // No dequeueRear. 2 points. + } +//Enqueueing to the rear and dequeueing from the rear makes the DEQUE act +// like a stack. + deque.enqueueRear("A"); + deque.enqueueRear("B"); + deque.enqueueRear("C"); + + System.out.println(deque.isEmpty()); // false 2 points. + + System.out.println(deque.dequeueRear()); // C 2 points. + System.out.println(deque.dequeueRear()); // B 2 points. + System.out.println(deque.dequeueRear()); // A 2 points. + System.out.println(deque.isEmpty()); // true 2 points. +// Enqueueing to the rear and dequeueing from the front makes the DEQUE act +// like a queue. + deque.enqueueRear("A"); + deque.enqueueRear("B"); + deque.enqueueRear("C"); + + System.out.println(deque.dequeueFront()); // A 2 points. + System.out.println(deque.dequeueFront()); // B 2 points. + System.out.println(deque.dequeueFront()); // C 2 points. + + System.out.println(deque.isEmpty()); // true 2 points. +//Enqueueing to the front and dequeueing from the front makes the DEQUE act +//like a stack. + deque.enqueueFront("A"); + deque.enqueueFront("B"); + deque.enqueueFront("C"); + + System.out.println(deque.dequeueFront()); // C 2 points. + System.out.println(deque.dequeueFront()); // B 2 points. + System.out.println(deque.dequeueFront()); // A 2 points. + + System.out.println(deque.isEmpty()); // true 2 points. + +// Enqueueing to the front and dequeueing from the rear makes the DEQUE act +// like a queue. + deque.enqueueFront("A"); + deque.enqueueFront("B"); + deque.enqueueFront("C"); + + System.out.println(deque.dequeueRear()); // A 2 points. + System.out.println(deque.dequeueRear()); // B 2 points. + System.out.println(deque.dequeueRear()); // C 2 points. + + System.out.println(deque.isEmpty()); // true 2 points. + } +}
\ No newline at end of file |