include/AD/contain/ordercol.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 ordered_collection_h
  26 #define ordered_collection_h
  27
  28 #include <AD/contain/seqcol.h>
  29
  30 template <class T>
  31    class OrderedCollection : public SequenceableCollection<T> {
  32
  33       Bool (*less)(const T&, const T&);
  34
  35    public:
  36       //////////////////////////////////////////////////////////////
  37       //  Inherit types
  38       //////////////////////////////////////////////////////////////
  39       typedef SequenceableCollection<T> Super;
  40       typedef Super::Element            Element;
  41
  42       //////////////////////////////////////////////////////////////
  43       //  Constructors and destructor
  44       //////////////////////////////////////////////////////////////
  45       OrderedCollection(int initial_size);
  46      ~OrderedCollection();
  47
  48       //////////////////////////////////////////////////////////////
  49       //  Selectors
  50       //////////////////////////////////////////////////////////////
  51       // virtual int  size()             const; // inherited
  52       // virtual int  capacity()         const; // inherited
  53       // virtual Bool is_empty()         const; // inherited
  54       // virtual Bool is_full()          const; // inherited
  55       // virtual Bool contains(const T&) const; // inherited
  56       // virtual Ix   lookup(const T&)   const; // inherited
  57
  58       //////////////////////////////////////////////////////////////
  59       //  Mutators
  60       //////////////////////////////////////////////////////////////
  61       // virtual void clear();          // inherited
  62       // virtual Ix   insert(const T&); // inherited
  63       // virtual Bool remove(const T&); // inherited
  64
  65       //////////////////////////////////////////////////////////////
  66       //  Iteration
  67       //////////////////////////////////////////////////////////////
  68       // virtual Ix first()          const; // inherited
  69       // virtual Ix next(Ix)         const; // inherited
  70       // virtual Ix operator () (Ix) const; // inherited
  71    };
  72
  73 #endif