mi32/balancedtree.h

Go to the documentation of this file.

#ifndef  INC_MI32_BALANCEDTREE_H
#define  INC_MI32_BALANCEDTREE_H

#ifndef INC_MI32_BTREEFUN_H
#include <mi32/btreefun.h>
#endif


#ifndef  INC_MI32_ERRCODES_H
#include <mi32/errcodes.h>
#endif

#ifndef  INC_MI32_ERRHANDLER_H
#include <mi32/errhandler.h>
#endif


template <typename _ITEMTYPE> class BALANCEDTREE {
   public:

      class DUMP {
         public:
            virtual ERRVALUE v_DumpItem (const _ITEMTYPE& item, INT32 TagNum) = 0;
         };
   
      class TEST {
         public:
            virtual ~TEST () {}
            virtual int v_TestItems (const _ITEMTYPE& p1, const _ITEMTYPE& p2) { return ((p1 < p2) ? -1 : ((p2 < p1) ? 1 : 0)); }
         };
   
   private:
      #ifndef GENERATING_DOXYGEN_OUTPUT
      static int DumpFunc (void* p1, INT32* tagnum, void* ud) {
         return (static_cast<DUMP*>(ud)->v_DumpItem(*static_cast<_ITEMTYPE*>(p1), *tagnum));
         }
   
      static int TestFunc (const void* p1, const void* p2, void* ud) {
         return (static_cast<TEST*>(ud)->v_TestItems(*static_cast<const _ITEMTYPE*>(p1), *static_cast<const _ITEMTYPE*>(p2)));
         }
      #endif // GENERATING_DOXYGEN_OUTPUT
   
   public:

      BALANCEDTREE (
         ) : m_BTreeHandle(0) {}
         
      ~BALANCEDTREE (
         ) { 
         if (m_BTreeHandle != 0) {
            delete static_cast<TEST*>(BTreeGetUserData(m_BTreeHandle));
            BTreeFree(m_BTreeHandle); 
            }
         }

      ERRVALUE Allocate (
         INT32 InitialNumItems,
         TEST Test = TEST()
         ) {
         m_BTreeHandle = BTreeAlloc(InitialNumItems, sizeof(_ITEMTYPE), TestFunc, new TEST(Test));
         if (m_BTreeHandle == 0) return (SetErrPosnC(EOutOfMemory));
         return (0);
         }
         
      ERRVALUE Clear (
         ) { return (BTreeClear(m_BTreeHandle)); }
         
      INT32 FindAndInsertKey (
         _ITEMTYPE& Item,
         INT32 CurTagNum,        
         bool& AddedItem         
         ) { 
         int add = 0;
         INT32 retval = BTreeFindKey(m_BTreeHandle, &Item, CurTagNum, &add);
         AddedItem = (add != 0);
         return (retval);
         }

      bool IsAllocated (
         ) const { return (m_BTreeHandle != 0); }
         
      INT32 LocateKey (
         const _ITEMTYPE& Item
         ) { return (BTreeSearchKey(m_BTreeHandle, const_cast<_ITEMTYPE*>(&Item))); } 
         
      ERRVALUE TraverseTree (
         DUMP& Dump
         ) { return (BTreeDumpT(m_BTreeHandle, DumpFunc, &Dump)); }
         
   private:
      #ifndef GENERATING_DOXYGEN_OUTPUT
      void *m_BTreeHandle; 

      BALANCEDTREE (const BALANCEDTREE& rhs);
      BALANCEDTREE& operator=(const BALANCEDTREE& rhs);
      #endif // GENERATING_DOXYGEN_OUTPUT
   };

#endif   // INC_MI32_BALANCEDTREE_H

---