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