complete the implementation of the sequence class. // FILE: sequence.cxx // // C
ID: 3650767 • Letter: C
Question
complete the implementation of the sequence class.// FILE: sequence.cxx
//
// CLASS IMPLEMENTED: sequence
// INVARIANTS:
// 1. The number of items in the sequence is in the data member 'used'
// 2. Data is stored in 'data', with data[0] ... data[used-1] the meaningful locations
// 3. 0 <= current_index < used
//
#include <cassert>
using namespace std;
#insert "sequence.h"
namespace CS102_2012_CH3
{
const sequence::size_type sequence::CAPACITY;
////////// CONSTRUCTOR
sequence( ) {
used = 0;
current_index = 0;
}
////////////// MODIFICATION MEMBER FUNCTIONS
void sequence::begin( );
void sequence::end();
void sequence::forward( );
void sequence::backward();
void sequence::insert(const value_type& entry);
void sequence::remove( );
////////////// CONSTANT MEMBER FUNCTIONS
sequence::size_type sequence::size( ) const;
bool sequence::is_item( ) const;
sequence::value_type sequence::current( ) const;
}//end namespace
Explanation / Answer
#include #include // Provides assert function #include "sequence1.h" // With value_type defined as double using namespace std; namespace main_savitch_3 { // MODIFICATION MEMBER FUNCTIONS sequence::sequence () { current_index = 0; used = 0; } void sequence::start( ) { current_index = 0; } void sequence::advance( ) { current_index++; } void sequence::insert(const value_type& entry) { int i; for (i = used; iRelated Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.