Purpose You will have an opportunity in this exercise to rewrite a method to be immutable and add contracts to all methods. Instructions Consider Bloch's non-generic Stack implementation; public class Stack { private Object[] elements; private int size = 0; private static final int DEFAULT_INITIAL_CAPACITY = 16; public Stack() { this.elements = new Object[DEFAULT_INITIAL_CAPACITY]; } public void push (Object e) { ensureCapacity(); elements[size++] = e; } public Object pop () { if (size == 0) throw new IllegalStateException("Stack.pop"); Object result = elements[--size]; elements[size] = null; // Eliminate obsolete reference return result; } private void ensureCapacity() { if (elements.length == size) { Object oldElements[] = elements; elements = new Object[2*size + 1]; System.arraycopy(oldElements, 0, elements, 0, size); } } } Rewrite Stack to be immutable. Keep the representation variables elements and size. Do the right thing with push(). Do the right thing with pop(). Get rid of anything that doesn't make sense in an immutable data type. Deliverable Elect one member of your group to submit your group's answers to the discussion forum. Note your group name/number in the subject of your post. Everyone in your group is expected to actively contribute and is responsible for the solution provided. Individual grades for this course include a component based on evaluations submitted by your peers for this activity. Please refer to the Course Schedule for due dates.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 3PE
icon
Related questions
Question

Purpose You will have an opportunity in this exercise to rewrite a method to be immutable and add contracts to all methods.

Instructions

Consider Bloch's non-generic Stack implementation;

public class Stack { private Object[] elements; private int size = 0; private static final int DEFAULT_INITIAL_CAPACITY = 16; public Stack() { this.elements = new Object[DEFAULT_INITIAL_CAPACITY]; } public void push (Object e) { ensureCapacity(); elements[size++] = e; } public Object pop () { if (size == 0) throw new IllegalStateException("Stack.pop"); Object result = elements[--size]; elements[size] = null; // Eliminate obsolete reference return result; } private void ensureCapacity() { if (elements.length == size) { Object oldElements[] = elements; elements = new Object[2*size + 1]; System.arraycopy(oldElements, 0, elements, 0, size); } } }

  1. Rewrite Stack to be immutable. Keep the representation variables elements and size.
  2. Do the right thing with push().
  3. Do the right thing with pop().
  4. Get rid of anything that doesn't make sense in an immutable data type.

Deliverable Elect one member of your group to submit your group's answers to the discussion forum. Note your group name/number in the subject of your post. Everyone in your group is expected to actively contribute and is responsible for the solution provided. Individual grades for this course include a component based on evaluations submitted by your peers for this activity. Please refer to the Course Schedule for due dates. 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning