Chapter 16, Problem 9PE

Program Plan Intro

Simplified implementation of “ArrayList” class

Program plan:

• In a file “ArrayList.java”, import necessary packages and create a class “ArrayList” that implements “Iterable” interface,
  • Declare the object variable.
  • Declare the necessary variable.
  • Define the constructor to create an empty array list.
  • Define the method “size()” to return the array list size.
  • Define the method “checkBounds()” that throws an exception if the index that has been checked is out of bounds.
  • Define the method “get()” that returns an element at a given position.
  • Define the method “set()” that locates the element at a given position.
  • Define the method “remove()” that removes an element at a given location.
    • Call the method “checkBounds()”.
    • Assign the element.
    • Create a loop,
      • Assign the current element to the previous location.
    • Decrement the size.
    • Return the element.
  • Define the method “add()” to insert the element next to the given position.
  • Define the method “addHere()”,
    • Call the method “add()”.
  • Define the method “addLast()” that insert the element next to the end of the array list.
  • Define the method “growBufferIfNecessary()” that grow the buffer the buffer if the current size is same as the capacity of the buffer.
  • Define the method “iterator()” of type “ArrayListIterator”,
    • Return the object of “ArrayListIterator”.
  • Create a class “ArrayListIterator”,
    • Declare the necessary variables.
    • Define the constructor to create an iterator.
    • Define the method “add()” that inserts an element before the position of the iterator.
    • Define the method “hasNext()” that checks whether there is an element next to the iterator position.
    • Define the method “hasPrevious()” that checks whether there is an element before the iterator position.
    • Define the method “next()” that moves the iterator past the succeeding element.
    • Define the method “nextIndex()”,
      • Check whether the next position is greater than the current size,
        • If it is true, returns the position.
        • • Returns the next position.
    • Define the method “previous()”,
      • Check whether there is not a previous element,
        • If it is true, throws an exception.
        • • Decrement the position.
          • Returns the function call.
    • Define the method “previousIndex()”,
      • Check whether there is the previous position id greater than “0”,
        • If it is true, returns the position.
        • • Returns the previous position.
    • Define the method “remove()” that removes the last traversed element.
    • Define the method “set()” that assign last traversed element to the different value.
• In a file “ListTest.java”, create a class “ListTest”,
  • Define the “main()” method.
    • Create an “ArrayList” object.
    • Call the method “addLast()” to add the element “David”.
    • Call the method “addLast()” to add the element “Harris”.
    • Call the method “addLast()” to add the element “Roman”.
    • Call the method “addLast()” to add the element “Tommy”.
    • Create a loop,
      • Print the actual output.
    • Print new line.
    • Print the expected output.