Include a public square bracket getter and setter pair, both with index range-checking, returning whatever value you wish if out of range. But apply capacity auto-adjusting for the setter if out of range high.

computer science

Description

PART 1

Write And Test An Array Class [DynamicArray.h and DynamicArray.TestDriver.cpp]
Write and test a data structures template. The resulting template can be used in any program in place of a C++ array.

Requirements. Develop DynamicArray.h as you write DynamicArray.TestDriver.cpp with class DynamicArray, defined and fully tested. Write the public interface exactly as specified below -- do not add to, or change the public interface as specified.

  1. Write the template for an array of capacity =2  (default constructor) of unspecified type.

  2. Include a public square bracket getter and setter pair, both with index range-checking, returning whatever value you wish if out of range. But apply capacity auto-adjusting for the setter if out of range high.

  3. Include a public getter named DynamicArray::capacity( ) to return the data structure's now-variable capacity

  4. Include a public setter named DynamicArray::capacity(int) to change the capacity.

  5. Do tests with int , double , or char . Also do tests with an object, like string .

Note that there is no good reason to copy the "dummy" value in the dynamic memory management functions, so don't include it in your testing of const object copy or object assignment.

DynamicArray template class public interface:


PART 2

Write An Array Application [MyDynamicArray.cpp]
Write MyDynamicArray.cpp using your DynamicArray template. Use your already-tested and verified H file from part 1.

Exactly as in Assignment 3's MyStaticArray.cpp, this app lets its user enter as many values as they like, and when that process is completed, lets the user look up values by matching index.

In a loop, the app should prompting the user to enter a pair of numbers on the same line: a whole number index and its corresponding floating point value. Do not validate index input in the app. Quit the loop when an uppercase or lowercase Q is entered for either the index or the value. Indexes can be entered in any order -- they don't have to start with zero and go up by one thereafter. It's whatever the user enters.

Your app should keep track of which indexes got entered. Use a bool DynamicArray for that. After all data entry is complete, the app should:

  1. output how many (unique) indexes got entered,

  2. output the list of all used indexes and their values, per the example below, and

  3. implement an event-controlled loop that prompts for an index value and outputs whether the index is in use or not, and if in use, what is the value stored for that index. Loop until the user elects to stop by entering uppercase or lowercase Q.

Here's a sample of how this should work (user input in blue):


Related Questions in computer science category