Search  

---

C:/temp/src/j2k/Test/DList_Test.cpp

Go to the documentation of this file.

#include <j2k/Fred/Standard.hpp>

#define Elem long

#include <j2k/DataType/Link/DLink.cpp>
#include <j2k/DataType/Link/DList.cpp>

#define List DList

void test()
{
  List L1;
  List L2;  // (15);
  List L3;

  L2.append(10);

  L2.display();

  L2.insert(20);
  L2.prev();
  L2.append(15);

  L2.display();

  L1.setFirst();
  L1.display();
  L1.insert( 39 );
  L1.next();
  L1.insert(12);
  L1.append(5);
  L1.prev();
  L1.insert(4);
  L1.display();
  L1.append(3);
  L1.append(2);
  L1.append(1);
  L1.display();

  L2.setFirst();
  L2.find(20);

  if ( L2.isInList() ) 
  { 
    printf( "L2 curr: \t" );
    printf( "%d\n", L2.currValue() );
  } 
  else 
  {
    printf( "Odd - what happened to 20?\n" );
  }

  printf( "L1: \n" ); 
  L1.display();

  printf( "Size: %d \nL2:\n", L2.length() );
  L2.display();

  printf( "L3: \n" ); 
  L3.display();

  L1.setFirst();
  printf( "L1: \n" ); 
  L1.display();

  if ( L1.find(20) > 0 ) 
  {
    printf( "Odd - shouldn't find 20 in L1!\n" );
  } 
  else 
  {
    printf( "20 not in L1.\n" );
  }

  L1.setFirst();
  printf( "L1: \n" ); 
  L1.display();

  if ( L1.find(5) > 0 ) 
  {
    printf( "%d @ %d\n", L1.currValue(), L1.getPos() );
  }

  L2.setFirst();
  printf( "L2: \n" ); 
  L2.display();

  if( L2.find(20) > 0 ) 
  {
    printf( "%d @ %d\n", L2.currValue(), L2.getPos() );
  } 
  else 
  {
    printf( "Didn't find it the first time\n" );
  }

  L2.next();

  if ( L2.find(20) > 0 ) 
  {
    printf( "Error: Found it again!\n" );
    printf( "%d @ %d\n", L2.currValue(), L2.getPos() );
  } 
  else 
  {
    printf( "Only once in list.\n" );
  }

  L1.setFirst();
  printf( "L1: \n" ); 
  L1.display();
  printf( "%d @ %d\n", L1.currValue(), L1.getPos() );  
 
  L1.setValue(42);

  printf( "L1: \n" ); 
  L1.display();

  L2.setFirst();
  printf( "L2: \n" ); 
  L2.display();

  printf( "\nRemoving: " );
  printf( "%d @ %d\n", L2.currValue(), L2.getPos() );
  printf( "%d\n", L2.remove() );
  printf( "%d @ %d\n", L2.currValue(), L2.getPos() );

  printf( "L2: \n" ); 
  L2.display();

  printf( "\nRemoving: " );
  printf( "%d @ %d\n", L2.currValue(), L2.getPos() );
  printf( "%d\n", L2.remove() );
  printf( "%d @ %d\n", L2.currValue(), L2.getPos() );
 
  printf( "L2: \n" ); 
  L2.display();

  printf( "Size: %d \n", L2.length() );
  L2.clear();
  printf( "L2: \n" ); 
  L2.display();

  printf( "Size: %d \n", L2.length() );
  L2.append(5); 
  printf( "L2: \n" ); 
  L2.display();

  printf( "Start a new round.\n" );
  L2.clear();

  printf( "L2: \n" ); 
  L2.display();

  L2.setFirst();
  L2.insert(1);

  printf( "L2: \n" ); 
  L2.display();

  L2.insert(2);

  printf( "L2: \n" ); 
  L2.display();

  L2.setPos(2);
  L2.insert(3);

  printf( "L2: \n" ); 
  L2.display();

  printf( "That is all.\n" );
  printf( "-----------------------\n" );
}

int main() 
{
  test();
  return 0;
}

---