54 lines
1.4 KiB
C++
54 lines
1.4 KiB
C++
|
TestLinkedList.cpp - Test program for linked list package
|
||
|
|
|
||
|
|
#include <iostream.h>
|
||
|
|
#include "LinkedList.h"
|
||
|
|
|
||
|
|
// Simple print method
|
||
|
|
template <class Object>
|
||
|
|
void printList( const List<Object> & theList )
|
||
|
|
{
|
||
|
|
if( theList.isEmpty( ) )
|
||
|
|
cout << "Empty list" << endl;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
ListItr<Object> itr = theList.first( );
|
||
|
|
for( ; !itr.isPastEnd( ); itr.advance( ) )
|
||
|
|
cout << itr.retrieve( ) << " ";
|
||
|
|
}
|
||
|
|
|
||
|
|
cout << endl;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
int main( )
|
||
|
|
{
|
||
|
|
List<int> theList;
|
||
|
|
ListItr<int> theItr = theList.zeroth( );
|
||
|
|
int i;
|
||
|
|
|
||
|
|
printList( theList );
|
||
|
|
|
||
|
|
for( i = 0; i < 10; i++ )
|
||
|
|
{
|
||
|
|
theList.insert( i, theItr );
|
||
|
|
printList( theList );
|
||
|
|
theItr.advance( );
|
||
|
|
}
|
||
|
|
|
||
|
|
for( i = 0; i < 10; i += 2 )
|
||
|
|
theList.remove( i );
|
||
|
|
|
||
|
|
for( i = 0; i < 10; i++ )
|
||
|
|
if( ( i % 2 == 0 ) != ( theList.find( i ).isPastEnd( ) ) )
|
||
|
|
cout << "Find fails!" << endl;
|
||
|
|
|
||
|
|
cout << "Finished deletions" << endl;
|
||
|
|
printList( theList );
|
||
|
|
|
||
|
|
List<int> list2;
|
||
|
|
list2 = theList;
|
||
|
|
printList( list2 );
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|