00001 // Main.cpp - main program declaration. 00002 00003 #include "DataBase.hpp" 00004 00005 // If everything run correctly the program return 0 00006 // else the program return the errorcode level 1 00007 // to indicate that the datafile was not found 00008 // in the current directory. 00009 00010 00011 // How this program is organized to be more reusable: 00012 // ================================================== 00013 // 00014 // Main defines the entry and exit point of the program. 00015 // 00016 // DataBase defines the reading and decoding part of the datafile 00017 // and all the computation that have to be done 00018 // for comparisons purposes. 00019 // 00020 // BST defines the Binary Search Tree class used here. 00021 // 00022 // BinNode defines the Binary Search Tree node component 00023 // used by the class BinSearchTree. 00024 // 00025 // Const defines all the MS headers and others constant. 00026 // 00027 // DBase defines a ID, Name, Tel class using the String ADT, 00028 // a bit like Shaffer's ELEM type. 00029 // 00030 // String defines an Abstract Data Type (ADT) to make manipulations, 00031 // additions, decomposition, comparisons between string and 00032 // char* easier and more bullet proof. 00033 // This class gives the same kind of behavior like the JAVA String 00034 // class does. It will be used in all of my assignments for simplicity 00035 // and to reduced debugging headache, since it have been fully 00036 // debugged once for all, in one of the COEN 244 assignment ! =) 00037 00038 int main() 00039 { 00040 00041 DataBase* bst = new DataBase(); 00042 int x = 0; 00043 00044 x = bst->read( "assmt352.dat" ); 00045 00046 delete bst; 00047 00048 return x; 00049 }