Search  

---

C:/temp/src/j2k/DataType/BST/DataBase.cpp

Go to the documentation of this file.

// DataBase.cpp - Binary Search Tree DataBase Class Implementation

#include "DataBase.hpp"

DataBase::DataBase()            // Default Constructor
{
  BST   = new BinSearchTree();  // Create a Binary Search Tree
  cmp   = new double[4];        // Create an array for comparisons
  NbCmp = new double[4];        // informations for all the commands.

  for(int k = 0; k < 4; k++)    // Reset all the elements in the array,
  {
    cmp[k]   = 0;               // else we get "garbage += new_value;"
    NbCmp[k] = 0;
  }
}

DataBase::~DataBase()           // Destructor
{
  if ( _current != NULL ) 
    delete _current;

  delete _db;                   // Delete pointer to objects
  delete BST;

  delete [] cmp;                // Delete comparison tables
  delete [] NbCmp;

}

int DataBase::read(const char* datafile)
{
  FILE* record = NULL;          // Initialize variable
  char  c = 0;
  char  command[80];
  int   p = 0;

  // Open a file in read-only text mode, if the file exist.
  if ( (record = fopen(datafile, "rt") ) == NULL)
  {
    cout << "Cannot open the data file [" << datafile;
    cout << "] in the current directory." << endl;
    return 1;
  }

  while ( !feof(record) )       // Loop until end of file
  {
    c =  fgetc(record);         // Read a Byte from the record file
  
    if ( c != 13 && c != 10 )   // Scanning for CR, LF ASCII Code 
    {              
      command[p] = c;           // Add the new char to the array.
      p++;
      command[p] = '\0';
    } 
    else if ( p > 0 )           // We reached a end of line byte.
    {
      command[p] = '\0';

//      cout << command << endl;

           p = 0;    // Reset the counter for the next file read
           _db = new DBase( command );

      switch ( command[0] ) 
      {
        case 'I': cmd = "Insert";
            if ( findID( 0 ) < 0 ) {        // Insert
              BST->insert( _db );        // ID was not Found
            } else {
              cout << msgI_IDexist  << endl;  // ID was Found
            }
          break;

        case 'S': cmd = "Search";
            if ( findID( 1 ) < 0 ) {        // Search
              cout << command << endl;
              cout << msgS_IDnotFound << endl;
            } else {
              cout << msgS_IDFound << endl;
              _current->display();
            }
          break;
          
        case 'C': cmd = "Change";
            if ( findID( 2 ) < 0 ) {        // Change
              cout << command << endl;
              cout << msgC_IDnotFound << endl;
            } else {
              cout << "The following element:" << endl;
              _current->display();

              if ( _db->_name->filled() ) {
                 _current->_name = _db->_name;
              }

              if ( _db->_tel->filled() ) {
                 _current->_tel = _db->_tel;
              }
                  
              cout << "was changed to the following:" << endl;
              _current->display();      // Show modification
            }
          break;
 
        case 'D':  cmd = "Delete";
            if ( findID( 3 ) < 0 ) {        // Delete
              cout << msgD_IDnotFound << endl;
            } else {
              BST->remove();
            }
          break;
        
        default :                  // Invalid command
            cout << command     << endl;
            cout << msgInvalidOp << endl;

      } // End of switch

        // Display all the BST Step by Step to debug:

        //  findID( -10 );
        //  BST->display();

    } // End of line

  } // End of file while loop

  // Show the results
  cout << endl << endl;
   cout << msgTotalCmp << " Insert was " << cmp[0];
  cout << " with " << NbCmp[0] << " Insert commands.\n";
  cout << msgAvgCmp   << " Insert was " << (cmp[0] / NbCmp[0]) << ".\n";

  cout << msgTotalCmp << " Search was " << cmp[1];
  cout << " with " << NbCmp[1] << " Search commands.\n";
  cout << msgAvgCmp   << " Search was " << (cmp[1] / NbCmp[1]) << ".\n";

  cout << msgTotalCmp << " Change was " << cmp[2];
  cout << " with " << NbCmp[2] << " Change commands.\n";
  cout << msgAvgCmp   << " Change was " << (cmp[2] / NbCmp[2]) << ".\n";
 
  cout << msgTotalCmp << " Delete was " << cmp[3];
  cout << " with " << NbCmp[3] << " Delete commands.\n";
  cout << msgAvgCmp   << " Delete was " << (cmp[3] / NbCmp[3]) << ".\n\n";

  fclose(record);    

  return 0;
}

double DataBase::findID( int index ) { // Find an ID and record
  double comp = 0;             // the number of comparisons needed

  pos  = BST->findID( *_db->_id );
  comp = pos;

// cout << msgCompare << cmd << index << " was "; // << endl;

  comp = BST->search();

  _current = BST->getValue();
  
//  cout << comp << " out of " << BST->length() << endl;

  if ( index >= 0 ) {
    cmp[index] += comp;
    NbCmp[index]++;
  }

  return pos;
}

---