Module 7: Sorting

• Module Home
• Activity
• Lab
• Extensions

Studio

Introduction

In this assignment, you will create a data structure which can derive 'slices' of itself such that changes made to a slice will also be reflected in all other slices, as well as in the original structure.

Wrapper Structure

• The class contains four instance variables:
  • T[] data - the backing array of generic type T
  • int first - the first location in the array that should be used in each 'slice', inclusively
  • int last - the last location in the array that should be used in each 'slice', inclusively
  • int inc - the change in index that should occur between accesses
• It is important to note that this class does not have a public constructor but rather is created using a static generator method, DBA.gen(T[] array). This method then procedes to call the private constructor and returns the newly constructed object. This design allows for the functionality of the class to be self-contained and unknown to the caller.

Your Assignment

• get(int index) - this method should return an object of type T at the specified index in the array, assuming the index is within the boundries of the current object. If the index is outside of the boundries, this method should throw an error (ex. throw new Error("Index out of bounds");).
• set(int index, T value) - this method should assign value to the object at the specified index in the array, assuming the index is within the boundries of the current object. If the index is outside of the boundries, this method should throw an error (ex. throw new Error("Index out of bounds");).
• reverse() - this method should return a new DBA object which iterates through its elements in the opposite direction of the current object.
• slice(int newFirst, int newLast) - this method should return a new DBA object with new bounds on its access to the back-end array.
• iterator() - this method should return a new Iterator<T> object which will be used to iterate through the back-end array based on the current object's bounds. An Iterator object keeps track of its place while iterating and has two required methods which you must implement to create the object:
  • hasNext() - this method should return a boolean to state whether or not there are more elements in the array (based on the current object's bounds) through which to iterate.
  • next() - this method should return the next object of type T in the iteration sequence.

Submitting your work (read carefully)

• If your studio contains a feedback.txt file, respond to the questions and supply any requested information.
• You must commit all of your work to your repository and push it. It's best to do this from the top-most level of your repository, which bears your wustl key.