include/AD/trees/rlxheap.h

   1 //////////////////////////////////////////////////////////////////////////////
   2 // NOTICE:
   3 //
   4 // ADLib, Prop and their related set of tools and documentation are in the
   5 // public domain.   The author(s) of this software reserve no copyrights on
   6 // the source code and any code generated using the tools.  You are encouraged
   7 // to use ADLib and Prop to develop software, in both academic and commercial
   8 // settings, and are free to incorporate any part of ADLib and Prop into
   9 // your programs.
  10 //
  11 // Although you are under no obligation to do so, we strongly recommend that
  12 // you give away all software developed using our tools.
  13 //
  14 // We also ask that credit be given to us when ADLib and/or Prop are used in
  15 // your programs, and that this notice be preserved intact in all the source
  16 // code.
  17 //
  18 // This software is still under development and we welcome any suggestions
  19 // and help from the users.
  20 //
  21 // Allen Leung
  22 // 1994
  23 //////////////////////////////////////////////////////////////////////////////
  24
  25 #ifndef relaxed_heap_h
  26 #define relaxed_heap_h
  27
  28 ///////////////////////////////////////////////////////////////////////////
  29 // Class |RelaxedHeap|
  30 ///////////////////////////////////////////////////////////////////////////
  31
  32 #include <AD/trees/trees.h>
  33
  34 template <class K, class V>
  35    class RelaxedHeap : public BinaryTree<K,V> {
  36    public:
  37
  38       ///////////////////////////////////////////////////////////////////
  39       //  Constructors and destructor
  40       ///////////////////////////////////////////////////////////////////
  41       RelaxedHeap() {}
  42       RelaxedHeap(const RelaxedHeap& p) : BinaryTree<K,V>(p) {}
  43      ~RelaxedHeap() {}
  44
  45       ///////////////////////////////////////////////////////////////////
  46       //  New mutators
  47       ///////////////////////////////////////////////////////////////////
  48       BinaryNode * insert(const K&, const V&);
  49       Bool remove(const K&);
  50    };
  51
  52 #endif