include/AD/contain/seqcol.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 sequenceable_collection_h
  26 #define sequenceable_collection_h
  27
  28 #include <AD/contain/col.h>
  29
  30 template <class T>
  31    class SequenceableCollection : public Collection<T> {
  32    public:
  33       //////////////////////////////////////////////////////////////
  34       //  Inherit types
  35       //////////////////////////////////////////////////////////////
  36       typedef Collection<T>  Super;
  37       typedef Super::Element Element;
  38
  39       //////////////////////////////////////////////////////////////
  40       //  Selectors
  41       //////////////////////////////////////////////////////////////
  42       // virtual int  size() const;              // inherited
  43       // virtual int  capacity() const;          // inherited
  44       // virtual Bool contains(const T&) const;  // inherited
  45       // virtual Bool is_empty() const;          // inherited
  46       // virtual Bool is_full() const;           // inherited
  47       // virtual Ix   lookup() const;            // inherited
  48       inline virtual int length() const { return size(); } // pseudonym for size()
  49       virtual const T& operator [] (int i) const = 0;     // indexing operation
  50       virtual       T& operator [] (int i)       = 0;     // indexing operation
  51
  52       //////////////////////////////////////////////////////////////
  53       //  Mutators
  54       ///////////////////////////////////////////////////////////////
  55       // virtual void clear();          // inherited
  56       // virtual Ix   insert(const T&); // inherited
  57       // virtual void remove(const T&); // inherited
  58
  59       ///////////////////////////////////////////////////////////////
  60       //  Iteration
  61       ///////////////////////////////////////////////////////////////
  62       // virtual Ix first() const;                // inherited
  63       // virtual Ix next(Ix i) const;             // inherited
  64       // virtual const T& operator () (Ix) const; // inherited
  65       // virtual       T& operator () (Ix);       // inherited
  66    };
  67
  68 #endif