c11p610.txt

来自「Data Abstraction & Problem Solving with 」· 文本 代码 · 共 42 行

// ********************************************************
// Excerpts from the implementation file TableB.cpp. 
// Binary search tree implementation.
// ********************************************************

#include "TableB.h"  // header file

void Table::tableInsert(const TableItemType& newItem)
{
      bst.searchTreeInsert(newItem);
      ++size;
}  // end tableInsert

void Table::tableDelete(KeyType searchKey)
            throw(TableException)
{
   try
   {  bst.searchTreeDelete(searchKey);
   }  // end try
   catch (TreeException e)
   {  throw TableException("TableException: Item not found on delete");
   }  // end catch
}  // end tableDelete

void Table::tableRetrieve(KeyType searchKey, 
                          TableItemType& tableItem) const
                          throw(TableException)
{
   try
   {  bst.searchTreeRetrieve(searchKey, tableItem);
   }  // end try
   catch (TreeException e)
   {  throw TableException("TableException: Item not found on retrieve");
   }  // end catch
}  // end tableRetrieve

void Table::traverseTable(FunctionType visit)
{
   bst.inorderTraverse(visit);
}  // end traverseTable
// End of implementation file.