The test files, node1.h, and node1.cpp are already provided, please use the included versions of the files.

The header has already been completed for you as well as test files. All you will be handing in is your implementation of the sequence3 class. It is recommended that you utilize the helper functions defined in node1 as much as possible.

sequence3.cpp: The implementation file for the new statistician class. You will write all of this file, which will have the implementations of all the statistician's member functions.

// FILE: sequence3.h // CLASS PROVIDED: sequence (part of the namespace main_savitch_5) // This is the header file for the project described in Section 5.4 // of "Data Structures and Other Objects Using C++" // This is called "sequence3" because some students already implemented // sequence1 (with a fixed array) and sequence2 (with a dynamic array). // // TYPEDEFS and MEMBER CONSTANTS for the sequence class: // typedef ____ value_type // sequence::value_type is the data type of the items in the sequence. It // may be any of the C++ built-in types (int, char, etc.), or a class with a // default constructor, an assignment operator, and a copy constructor. // // typedef ____ size_type // sequence::size_type is the data type of any variable that keeps track of // how many items are in a sequence. // // CONSTRUCTOR for the sequence class: // sequence( ) // Postcondition: The sequence has been initialized as an empty sequence. // // MODIFICATION MEMBER FUNCTIONS for the sequence class: // void start( ) // Postcondition: The first item on the sequence becomes the current item // (but if the sequence is empty, then there is no current item). // // void advance( ) // Precondition: is_item returns true. // Postcondition: If the current item was already the last item in the // sequence, then there is no longer any current item. Otherwise, the new // current item is the item immediately after the original current item. // // void insert(const value_type& entry) // Postcondition: A new copy of entry has been inserted in the sequence // before the current item. If there was no current item, then the new entry // has been inserted at the front of the sequence. In either case, the newly // inserted item is now the current item of the sequence. // // void attach(const value_type& entry) // Postcondition: A new copy of entry has been inserted in the sequence after // the current item. If there was no current item, then the new entry has // been attached to the end of the sequence. In either case, the newly // inserted item is now the current item of the sequence. // // void remove_current( ) // Precondition: is_item returns true. // Postcondition: The current item has been removed from the sequence, and // the item after this (if there is one) is now the new current item. // // CONSTANT MEMBER FUNCTIONS for the sequence class: // size_type size( ) const // Postcondition: The return value is the number of items in the sequence. // // bool is_item( ) const // Postcondition: A true return value indicates that there is a valid // "current" item that may be retrieved by activating the current // member function (listed below). A false return value indicates that // there is no valid current item. // // value_type current( ) const // Precondition: is_item( ) returns true. // Postcondition: The item returned is the current item in the sequence. // // const node * getLargest( ) const // Precondition: None // Postcondition: Returns a pointer to the first node in the list from current to end of list that has the largest value, // returns nullptr if list is empty // // VALUE SEMANTICS for the sequence class: // Assignments and the copy constructor may be used with sequence objects. #ifndef MAIN_SAVITCH_SEQUENCE3_H #define MAIN_SAVITCH_SEQUENCE3_H #include  // Provides size_t #include "node1.h" // Provides node class namespace DSProject2 { class sequence { public: // TYPEDEFS and MEMBER CONSTANTS typedef double value_type; typedef std::size_t size_type; // CONSTRUCTORS and DESTRUCTOR sequence( ); sequence(const sequence& source); ~sequence( ); // MODIFICATION MEMBER FUNCTIONS void start( ); void advance( ); void insert(const value_type& entry); void attach(const value_type& entry); void operator =(const sequence& source); void remove_current( ); // CONSTANT MEMBER FUNCTIONS size_type size( ) const { return many_nodes; } bool is_item( ) const { return (cursor != nullptr); } const node * getLargest( ) const; value_type current( ) const; private: node *head_ptr; node *tail_ptr; node *cursor; node *precursor; size_type many_nodes; }; } #endif

This is my implentation file------------------------------------------------------------

#include // Provides size_t

#include "node1.h" // Provides node class

#include "sequence3.h"

using namespace std;

namespace DSProject2

{

// CONSTRUCTORS and DESTRUCTOR

sequence::sequence( )

{

head_ptr = NULL;

tail_ptr = NULL;

cursor = NULL;

precursor = NULL;

many_nodes = 0;

}

sequence::sequence(const sequence& source)

{

many_nodes = source.many_nodes;

list_copy(source.head_ptr, head_ptr, tail_ptr);

node* index_src;

index_src = source.head_ptr;

precursor = head_ptr;

if (source.cursor == NULL)

{

if (source.precursor == NULL)

{

cursor = NULL;

precursor = NULL;

}

else

{

precursor = tail_ptr;

cursor = NULL;

}

}

else

{

if (source.precursor == NULL)

{

cursor = head_ptr;

precursor = NULL;

}

else

{

while (index_src != source.precursor)

{

index_src = index_src->link();

precursor = precursor->link();

}

cursor = precursor->link();

}

}

}

sequence::~sequence( )

{

head_ptr = NULL;

tail_ptr = NULL;

cursor = NULL;

precursor = NULL;

many_nodes = 0;

}

// MODIFICATION MEMBER FUNCTIONS

void sequence::start( )

{

cursor = head_ptr;

precursor = NULL;

}

void sequence::advance( )

{

if (is_item())

{

precursor = cursor;

cursor = cursor ->link();

}

else

{

start();

}

}

void sequence::insert(const value_type& entry)

{

node* list_insert;

node* head_insert;

if (is_item())

{

if (precursor != NULL)

{

list_insert(precursor, entry);

cursor = precursor->link();

}

else

{

//cursor is at the head

head_insert(head_ptr, entry);

precursor = NULL;

cursor = head_ptr;

}

}

else

{

if (many_nodes == 0)

{

head_insert(head_ptr, entry);

precursor = NULL;

cursor = head_ptr;

tail_ptr = head_ptr;

}

else

{

head_insert(head_ptr, entry);

precursor = NULL;

cursor = head_ptr;

}

}

many_nodes++;

}

void sequence::attach(const value_type& entry)

{

if (head_ptr == NULL)

{

list_head_insert(head_ptr, entry);

tail_ptr = head_ptr;

cursor = head_ptr;

precursor = NULL;

}

else if (cursor == NULL || cursor == tail_ptr)

{

list_insert(tail_ptr, entry);

precursor = tail_ptr;

tail_ptr = tail_ptr -> link();

cursor = tail_ptr;

}

else

{

list_insert(cursor, entry);

precursor = cursor;

cursor = cursor -> link();

}

many_nodes += 1;

}

void sequence::operator =(const sequence& source)

{

many_nodes = source.many_nodes;

list_copy(source.head_ptr, head_ptr, tail_ptr);

node* index_src;

index_src = source.head_ptr;

precursor = head_ptr;

if (source.cursor == NULL)

{

if (source.precursor == NULL)

{

cursor = NULL;

precursor = NULL;

}

else

{

precursor = tail_ptr;

cursor = NULL;

}

}

else

{

if (source.precursor == NULL)

{

cursor = head_ptr;

precursor = NULL;

}

else

{

while (index_src != source.precursor)

{

index_src = index_src->link();

precursor = precursor->link();

}

cursor = precursor->link();

}

}

}

void sequence::remove_current( )

{

if(cursor == head_ptr)

{

cursor = cursor -> link(); //i'm setting curor to set link()

head_remove(head_ptr); //calling to remove

}

else

{

cursor = cursor ->link();

head_remove (head_ptr);

}

--many_nodes;

}

// CONSTANT MEMBER FUNCTIONS

/*sequence::sequence (size_type size( )) const

{ return many_nodes; }*/

sequence::sequence bool is_item( ) const

{ return current_index >=0 && current_index < many_nodes;}

sequence::sequence const node * getLargest( ) const

{

node* listNode;

if(size() == 0)

{

return nullptr;

}

listNode cursor = head;

listNode biggestNode = head;

value_type value = head->getData();

for(int i = 0 ; i < size() ;i++)

{

if(value < cursor->getData())

{

value = cursor->getData();

biggestNode = cursor;

}

cursor = cursor->getNext();

}

return biggestNode;

}

sequence::sequence value_type current( ) const

{

return data [current_index];

}

}

This is the main file:------------------------------------

DESCRIPTION:

// Each function of this program tests part of the sequence class, returning

// some number of points to indicate how much of the test was passed.

// A description and result of each test is printed to cout.

// Maximum number of points awarded by this program is determined by the

// constants POINTS[1], POINTS[2]...

#include // Provides cout.

#include // Provides size_t.

#include "sequence3.h" // Provides the sequence class with double items.

using namespace std;

using namespace DSProject2;

// Descriptions and points for each of the tests:

const size_t MANY_TESTS = 7;

const int POINTS[MANY_TESTS+1] = {

85, // Total points for all tests.

15, // Test 1 points

15, // Test 2 points

15, // Test 3 points

10, // Test 4 points

10, // Test 5 points

10, // Test 6 points

10 // Test 7 points

};

const char DESCRIPTION[MANY_TESTS+1][256] = {

"tests for sequence Class with a linked sequence",

"Testing insert, attach, and the constant member functions",

"Testing situations where the cursor goes off the sequence",

"Testing remove_current",

"Testing the copy constructor",

"Testing the assignment operator",

"Testing insert/attach for somewhat larger sequences",

"Testing find largest"

};

// **************************************************************************

// bool test_basic(const sequence& test, size_t s, bool has_cursor)

// Postcondition: A return value of true indicates:

// a. test.size() is s, and

// b. test.is_item() is has_cursor.

// Otherwise the return value is false.

// In either case, a description of the test result is printed to cout.

// **************************************************************************

bool test_basic(const sequence& test, size_t s, bool has_cursor)

{

bool answer;

cout << "Testing that size() returns " << s << " ... ";

cout.flush( );

answer = (test.size( ) == s);

cout << (answer ? "Passed." : "Failed.") << endl;

if (answer)

{

cout << "Testing that is_item() returns ";

cout << (has_cursor ? "true" : "false") << " ... ";

cout.flush( );

answer = (test.is_item( ) == has_cursor);

cout << (answer ? "Passed." : "Failed.") << endl;

}

return answer;

}

// **************************************************************************

// bool test_items(sequence& test, size_t s, size_t i, double items[])

// The function determines if the test sequence has the correct items

// Precondition: The size of the items array is at least s.

// Postcondition: A return value of true indicates that test.current()

// is equal to items[i], and after test.advance() the result of

// test.current() is items[i+1], and so on through items[s-1].

// At this point, one more advance takes the cursor off the sequence.

// If any of this fails, the return value is false.

// NOTE: The test sequence has been changed by advancing its cursor.

// **************************************************************************

bool test_items(sequence& test, size_t s, size_t i, double items[])

{

bool answer = true;

cout << "The cursor should be at item [" << i << "]" << " of the sequence ";

cout << "(counting the first item as [0]). I will advance the cursor ";

cout << "to the end of the sequence, checking that each item is correct...";

cout.flush( );

while ((i < s) && test.is_item( ) && (test.current( ) == items[i]))

{

i++;

test.advance( );

}

if ((i != s) && !test.is_item( ))

{ // The test.is_item( ) function returns false too soon.

cout << " Cursor fell off the sequence too soon." << endl;

answer = false;

}

else if (i != s)

{ // The test.current( ) function returned a wrong value.

cout << " The item [" << i << "] should be " << items[i] << ", ";

cout << " but it was " << test.current( ) << " instead. ";

answer = false;

}

else if (test.is_item( ))

{ // The test.is_item( ) function returns true after moving off the sequence.

cout << " The cursor was moved off the sequence,";

cout << " but is_item still returns true." << endl;

answer = false;

}

cout << (answer ? "Passed." : "Failed.") << endl;

return answer;

}

// **************************************************************************

// bool correct(sequence& test, size_t s, size_t cursor_spot, double items[])

// This function determines if the sequence (test) is "correct" according to

// these requirements:

// a. it has exactly s items.

// b. the items (starting at the front) are equal to

// items[0] ... items[s-1]

// c. if cursor_spot < s, then test's cursor must be at

// the location given by cursor_spot.

// d. if cursor_spot >= s, then test must not have a cursor.

// NOTE: The function also moves the cursor off the sequence.

// **************************************************************************

bool correct(sequence& test, size_t size, size_t cursor_spot, double items[])

{

bool has_cursor = (cursor_spot < size);

// Check the sequence's size and whether it has a cursor.

if (!test_basic(test, size, has_cursor))

{

cout << "Basic test of size() or is_item() failed." << endl << endl;

return false;

}

// If there is a cursor, check the items from cursor to end of the sequence.

if (has_cursor && !test_items(test, size, cursor_spot, items))

{

cout << "Test of the sequence's items failed." << endl << endl;

return false;

}

// Restart the cursor at the front of the sequence and test items again.

cout << "I'll call start() and look at the items one more time..." << endl;

test.start( );

if (has_cursor && !test_items(test, size, 0, items))

{

cout << "Test of the sequence's items failed." << endl << endl;

return false;

}

// If the code reaches here, then all tests have been passed.

cout << "All tests passed for this sequence." << endl << endl;

return true;

}

// **************************************************************************

// int test1( )

// Performs some basic tests of insert, attach, and the constant member

// functions. Returns POINTS[1] if the tests are passed. Otherwise returns 0.

// **************************************************************************

int test1( )

{

sequence empty; // An empty sequence

sequence test; // A sequence to add items to

double items1[4] = { 5, 10, 20, 30 }; // These 4 items are put in a sequence

double items2[4] = { 10, 15, 20, 30 }; // These are put in another sequence

// Test that the empty sequence is really empty

cout << "Starting with an empty sequence." << endl;

if (!correct(empty, 0, 0, items1)) return 0;

// Test the attach function to add something to an empty sequence

cout << "I am now using attach to put 10 into an empty sequence." << endl;

test.attach(10);

if (!correct(test, 1, 0, items2)) return 0;

// Test the insert function to add something to an empty sequence

cout << "I am now using insert to put 10 into an empty sequence." << endl;

test = empty;

test.insert(10);

if (!correct(test, 1, 0, items2)) return 0;

// Test the insert function to add an item at the front of a sequence

cout << "I am now using attach to put 10,20,30 in an empty sequence. ";

cout << "Then I move the cursor to the start and insert 5." << endl;

test = empty;

test.attach(10);

test.attach(20);

test.attach(30);

test.start( );

test.insert(5);

if (!correct(test, 4, 0, items1)) return 0;

// Test the insert function to add an item in the middle of a sequence

cout << "I am now using attach to put 10,20,30 in an empty sequence. ";

cout << "Then I move the cursor to the start, advance once, ";

cout << "and insert 15." << endl;

test = empty;

test.attach(10);

test.attach(20);

test.attach(30);

test.start( );

test.advance( );

test.insert(15);

if (!correct(test, 4, 1, items2)) return 0;

// Test the attach function to add an item in the middle of a sequence

cout << "I am now using attach to put 10,20,30 in an empty sequence. ";

cout << "Then I move the cursor to the start and attach 15 ";

cout << "after the 10." << endl;

test = empty;

test.attach(10);

test.attach(20);

test.attach(30);

test.start( );

test.attach(15);

if (!correct(test, 4, 1, items2)) return 0;

// All tests have been passed

cout << "All tests of this first function have been passed." << endl;

return POINTS[1];

}

// **************************************************************************

// int test2( )

// Performs a test to ensure that the cursor can correctly be run off the end

// of the sequence. Also tests that attach/insert work correctly when there is

// no cursor. Returns POINTS[2] if the tests are passed. Otherwise returns 0.

// **************************************************************************

int test2( )

{

const size_t TESTSIZE = 30;

sequence test;

size_t i;

// Put three items in the sequence

cout << "Using attach to put 20 and 30 in the sequence, and then calling ";

cout << "advance, so that is_item should return false ... ";

cout.flush( );

test.attach(20);

test.attach(30);

test.advance( );

if (test.is_item( ))

{

cout << "failed." << endl;

return 0;

}

cout << "passed." << endl;

// Insert 10 at the front and run the cursor off the end again

cout << "Inserting 10, which should go at the sequence's front." << endl;

cout << "Then calling advance three times to run cursor off the sequence ...";

cout.flush( );

test.insert(10);

test.advance( ); // advance to the 20

test.advance( ); // advance to the 30

test.advance( ); // advance right off the sequence

if (test.is_item( ))

{

cout << " failed." << endl;

return false;

}

cout << " passed." << endl;

// Attach more items until the sequence becomes full.

// Note that the first attach should attach to the end of the sequence.

cout << "Calling attach to put the numbers 40, 50, 60 ...";

cout << TESTSIZE*10 << " at the sequence's end." << endl;

for (i = 4; i <= TESTSIZE; i++)

test.attach(i*10);

// Test that the sequence is correctly filled.

cout << "Now I will test that the sequence has 10, 20, 30, ...";

cout << TESTSIZE*10 << "." << endl;

test.start( );

for (i = 1; i <= TESTSIZE; i++)

{

if ((!test.is_item( )) || test.current( ) != i*10)

{

cout << " Test failed to find " << i*10 << endl;

return 0;

}

test.advance( );

}

if (test.is_item( ))

{

cout << " There are too many items on the sequence." << endl;

return false;

}

// All tests passed

cout << "All tests of this second function have been passed." << endl;

return POINTS[2];

}

// **************************************************************************

// int test3( )

// Performs basic tests for the remove_current function.

// Returns POINTS[3] if the tests are passed.

// Otherwise returns 0.

// **************************************************************************

int test3( )

{

const size_t TESTSIZE = 30;

sequence test;

// Within this function, I create several different sequences using the

// items in these arrays:

double items1[1] = { 30 };

double items2[2] = { 10, 30 };

double items3[3] = { 10, 20, 30 };

size_t i; // for-loop control variable

// Build a sequence with three items 10, 20, 30, and remove the middle,

// and last and then first.

cout << "Using attach to build a sequence with 10,30." << endl;

test.attach(10);

test.attach(30);

cout << "Insert a 20 before the 30, so entire sequence is 10,20,30." << endl;

test.insert(20);

if (!correct(test, 3, 1, items3)) return 0;

cout << "Remove the 20, so entire sequence is now 10,30." << endl;

test.start( );

test.advance( );

test.remove_current( );

if (!correct(test, 2, 1, items2)) return 0;

cout << "Remove the 30, so entire sequence is now just 10 with no cursor.";

cout << endl;

test.start( );

test.advance( );

test.remove_current( );

if (!correct(test, 1, 1, items2)) return 0;

cout << "Set the cursor to the start and remove the 10." << endl;

test.start( );

test.remove_current( );

if (!correct(test, 0, 0, items2)) return 0;

// Build a sequence with three items 10, 20, 30, and remove the middle,

// and then first and then last.

cout << "Using attach to build another sequence with 10,30." << endl;

test.attach(10);

test.attach(30);

cout << "Insert a 20 before the 30, so entire sequence is 10,20,30." << endl;

test.insert(20);

if (!correct(test, 3, 1, items3)) return 0;

cout << "Remove the 20, so entire sequence is now 10,30." << endl;

test.start( );

test.advance( );

test.remove_current( );

if (!correct(test, 2, 1, items2)) return 0;

cout << "Set the cursor to the start and remove the 10," << endl;

cout << "so the sequence should now contain just 30." << endl;

test.start( );

test.remove_current( );

if (!correct(test, 1, 0, items1)) return 0;

cout << "Remove the 30 from the sequence, resulting in an empty sequence." << endl;

test.start( );

test.remove_current( );

if (!correct(test, 0, 0, items1)) return 0;

// Build a sequence with three items 10, 20, 30, and remove the first.

cout << "Build a new sequence by inserting 30, 10, 20 (so the sequence ";

cout << "is 20, then 10, then 30). Then remove the 20." << endl;

test.insert(30);

test.insert(10);

test.insert(20);

test.remove_current( );

if (!correct(test, 2, 0, items2)) return 0;

test.start( );

test.remove_current( );

test.remove_current( );

// Just for fun, fill up the sequence, and empty it!

cout << "Just for fun, I'll empty the sequence then fill it up, then ";

cout << "empty it again. During this process, I'll try to determine ";

cout << "whether any of the sequence's member functions access the ";

cout << "array outside of its legal indexes." << endl;

for (i = 0; i < TESTSIZE; i++)

test.insert(0);

for (i = 0; i < TESTSIZE; i++)

test.remove_current( );

// All tests passed

cout << "All tests of this third function have been passed." << endl;

return POINTS[3];

}

// **************************************************************************

// int test4( )

// Performs some tests of the copy constructor.

// Returns POINTS[4] if the tests are passed. Otherwise returns 0.

// **************************************************************************

int test4( )

{

const size_t TESTSIZE = 30;

sequence original; // A sequence that we'll copy.

double items[2*TESTSIZE];

size_t i;

// Set up the items array to conatin 1...2*TESTSIZE.

for (i = 1; i <= 2*TESTSIZE; i++)

items[i-1] = i;

// Test copying of an empty sequence. After the copying, we change original.

cout << "Copy constructor test: for an empty sequence." << endl;

sequence copy1(original);

original.attach(1); // Changes the original sequence, but not the copy.

if (!correct(copy1, 0, 0, items)) return 0;

// Test copying of a sequence with current item at the tail.

cout << "Copy constructor test: for a sequence with cursor at tail." << endl;

for (i=2; i <= 2*TESTSIZE; i++)

original.attach(i);

sequence copy2(original);

original.remove_current( ); // Delete tail from original, but not the copy

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy2, 2*TESTSIZE, 2*TESTSIZE-1, items)

)

return 0;

// Test copying of a sequence with cursor near the middle.

cout << "Copy constructor test: with cursor near middle." << endl;

original.insert(2);

for (i = 1; i < TESTSIZE; i++)

original.advance( );

// Cursor is now at location [TESTSIZE] (counting [0] as the first spot).

sequence copy3(original);

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy3, 2*TESTSIZE-1, TESTSIZE, items)

)

return 0;

// Test copying of a sequence with cursor at the front.

cout << "Copy constructor test: for a sequence with cursor at front." << endl;

original.insert(2);

original.start( );

// Cursor is now at the front.

sequence copy4(original);

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy4, 2*TESTSIZE-1, 0, items)

)

return 0;

// Test copying of a sequence with no current item.

cout << "Copy constructor test: for a sequence with no current item." << endl;

original.insert(2);

while (original.is_item( ))

original.advance( );

// There is now no current item.

sequence copy5(original);

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy5, 2*TESTSIZE-1, 2*TESTSIZE, items)

)

return 0;

// All tests passed

cout << "All tests of this fourth function have been passed." << endl;

return POINTS[4];

}

// **************************************************************************

// int test5( )

// Performs some tests of the assignment operator.

// Returns POINTS[5] if the tests are passed. Otherwise returns 0.

// **************************************************************************

int test5( )

{

const size_t TESTSIZE = 30;

sequence original; // A sequence that we'll copy.

double items[2*TESTSIZE];

size_t i;

// Set up the items array to conatin 1...2*TESTSIZE.

for (i = 1; i <= 2*TESTSIZE; i++)

items[i-1] = i;

// Test copying of an empty sequence. After the copying, we change original.

cout << "Assignment operator test: for an empty sequence." << endl;

sequence copy1;

copy1 = original;

original.attach(1); // Changes the original sequence, but not the copy.

if (!correct(copy1, 0, 0, items)) return 0;

// Test copying of a sequence with current item at the tail.

cout << "Assignment operator test: cursor at tail." << endl;

for (i=2; i <= 2*TESTSIZE; i++)

original.attach(i);

sequence copy2;

copy2 = original;

original.remove_current( ); // Delete tail from original, but not the copy

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy2, 2*TESTSIZE, 2*TESTSIZE-1, items)

)

return 0;

// Test copying of a sequence with cursor near the middle.

cout << "Assignment operator test: with cursor near middle." << endl;

original.insert(2);

for (i = 1; i < TESTSIZE; i++)

original.advance( );

// Cursor is now at location [TESTSIZE] (counting [0] as the first spot).

sequence copy3;

copy3 = original;

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy3, 2*TESTSIZE-1, TESTSIZE, items)

)

return 0;

// Test copying of a sequence with cursor at the front.

cout << "Assignment operator test: with cursor at front." << endl;

original.insert(2);

original.start( );

// Cursor is now at the front.

sequence copy4;

copy4 = original;

original.start( );

original.advance( );

original.remove_current( ); // Delete 2 from original, but not the copy.

if (!correct

(copy4, 2*TESTSIZE-1, 0, items)

)

return 0;

// Test copying of a sequence with no current item.

cout << "Assignment operator test: with no current item." << endl;

original.insert(2);

while (original.is_item( ))

original.advance( );

// There is now no current item.

sequence copy5;

copy5 = original;

original.start( );

original.advance( );

original.remove_current( ); // Deletes 2 from the original, but not copy.

if (!correct

(copy5, 2*TESTSIZE-1, 2*TESTSIZE, items)

)

return 0;

cout << "Checking correctness of a self-assignment x = x;" << endl;

original.insert(2);

original = original; //you can ignore this compile warning

if (!correct

(original, 2*TESTSIZE-1, 1, items)

)

return 0;

// All tests passed

cout << "All tests of this fifth function have been passed." << endl;

return POINTS[5];

}

// **************************************************************************

// int test6( )

// Performs some basic tests of insert and attach for the case where the

// current capacity has been reached.

// Returns POINTS[6] if the tests are passed. Otherwise returns 0.

// **************************************************************************

int test6( )

{

const size_t TESTSIZE = 30;

sequence testa, testi;

double items[2*TESTSIZE];

size_t i;

// Set up the items array to conatin 1...2*TESTSIZE.

for (i = 1; i <= 2*TESTSIZE; i++)

items[i-1] = i;

cout << "Testing to see that attach works correctly when the ";

cout << "current capacity is exceeded." << endl;

for (i = 1; i <= 2*TESTSIZE; i++)

testa.attach(i);

if (!correct

(testa, 2*TESTSIZE, 2*TESTSIZE-1, items)

)

return 0;

cout << "Testing to see that insert works correctly when the ";

cout << "current capacity is exceeded." << endl;

for (i = 2*TESTSIZE; i >= 1; i--)

testi.insert(i);

if (!correct

(testi, 2*TESTSIZE, 0, items)

)

return 0;

// All tests passed

cout << "All tests of this sixth function have been passed." << endl;

return POINTS[6];

}

// **************************************************************************

// int test7( )

// Performs a test to ensure that the cursor can correctly be run off the end

// of the sequence. Also tests that attach/insert work correctly when there is

// no cursor. Returns POINTS[2] if the tests are passed. Otherwise returns 0.

// **************************************************************************

int test7( )

{

const node * maxNode;

sequence test;

int points = POINTS[7];

// Put three items in the sequence

cout << "Using attach to put 11, 22, 33, 44, 55, 46, 37, 28, 19 in the sequence, and then calling ";

cout << "getLargest, should return 19 ... ";

cout.flush( );

test.attach(11);

test.attach(22);

test.attach(33);

test.attach(44);

test.attach(55);

test.attach(46);

test.attach(37);

test.attach(28);

test.attach(19);

maxNode = test.getLargest();

if ( maxNode == nullptr || maxNode->data() != 19 )

{

cout << "failed." << endl;

points -= 2;

} else {

cout << "passed." << endl;

}

cout << "Calling advance and testing for nullptr ...";

test.advance();

maxNode = test.getLargest();

if ( maxNode != nullptr )

{

cout << "failed." << endl;

points -= 2;

} else {

cout << "passed." << endl;

}

//Reset current

cout << "Calling start and testing for 55 ...";

test.start();

maxNode = test.getLargest();

if ( maxNode == nullptr || maxNode->data() != 55 )

{

cout << "failed." << endl;

points -= 3;

} else {

cout << "passed." << endl;

}

cout << "Calling advance 5 times and testing for 46 ...";

test.advance();

test.advance();

test.advance();

test.advance();

test.advance();

maxNode = test.getLargest();

if ( maxNode == nullptr || maxNode->data() != 46 )

{

cout << "failed." << endl;

points -= 3;

} else {

cout << "passed." << endl;

}

return points;

}

int run_a_test(int number, const char message[], int test_function( ), int max)

{

int result;

cout << endl << "START OF TEST " << number << ":" << endl;

cout << message << " (" << max << " points)." << endl;

result = test_function( );

if (result > 0)

{

cout << "Test " << number << " got " << result << " points";

cout << " out of a possible " << max << "." << endl;

}

else

cout << "Test " << number << " failed." << endl;

cout << "END OF TEST " << number << "." << endl << endl;

return result;

}

// **************************************************************************

// int main( )

// The main program calls all tests and prints the sum of all points

// earned from the tests.

// **************************************************************************

int main( )

{

int sum = 0;

cout << "Running " << DESCRIPTION[0] << endl;

sum += run_a_test(1, DESCRIPTION[1], test1, POINTS[1]); cout << sum << endl;

sum += run_a_test(2, DESCRIPTION[2], test2, POINTS[2]); cout << sum << endl;

sum += run_a_test(3, DESCRIPTION[3], test3, POINTS[3]); cout << sum << endl;

sum += run_a_test(4, DESCRIPTION[4], test4, POINTS[4]); cout << sum << endl;

sum += run_a_test(5, DESCRIPTION[5], test5, POINTS[5]); cout << sum << endl;

sum += run_a_test(6, DESCRIPTION[6], test6, POINTS[6]); cout << sum << endl;

sum += run_a_test(7, DESCRIPTION[7], test7, POINTS[7]); cout << sum << endl;

cout << "If you submit this now, you will have ";

cout << sum << " points out of the " << POINTS[0];

cout << " points from this test program. ";

return EXIT_SUCCESS;

}