next up previous contents
Next: How Many Elements Are Up: Overloaded I/O Methods: Previous: The Destructor Call for

Building a List:

    // ************************************** //
    //  build a list                          //
    // ************************************** //
void CHAR_DLLIST::build_list(CHAR *A,int number)
{
  //cout << "entering build_list " << endl;
  int i = -1;
  CHAR_DL_CELL *temp,*again,*before;
  if(!(A==NULL)){
    head = new CHAR_DL_CELL(name);
    head->element = A[++i];
    again = head;
    while(i<number-1){
      temp = new CHAR_DL_CELL(name);
      temp->element = A[++i];
      again->next = temp;
      temp->previous = again;
      before = again;
      again = temp;
      }
    again->next = NULL;
    }
  end = again;
  end->previous = before;
}



Jim Peterson
1999-04-22