home *** CD-ROM | disk | FTP | other *** search
/ OS/2 Shareware BBS: 10 Tools / 10-Tools.zip / cset21v1.zip / IBMCPP / IBMCLASS / IDEQSEQ.H < prev    next >
Text File  |  1993-09-22  |  5KB  |  136 lines
  1. /*******************************************************************************
  2. *                                                                              *
  3. * COPYRIGHT:                                                                   *
  4. *   IBM C/C++ Tools Version 2.01 - Collection Class Library                    *
  5. *   Licensed Materials - Property of IBM                                       *
  6. *   (C) Copyright IBM Corporation 1992, 1993                                   *
  7. *   All Rights Reserved                                                        *
  8. *   US Government Users Restricted Rights - Use, duplication, or disclosure    *
  9. *   restricted by GSA ADP Schedule Contract with IBM Corp.                     *
  10. *                                                                              *
  11. *******************************************************************************/
  12. #ifndef _IDEQSEQ_H
  13. #define _IDEQSEQ_H
  14.  
  15. #include <iglobals.h>
  16. #include <icursor.h>
  17.  
  18. template < class Element, class ElementOps, class Base >
  19. class IWDequeOnSeq {
  20.   Base ivBase;
  21.   class Cursor;
  22.   friend class Cursor;
  23. public:
  24.  
  25.   class Cursor : public Base::Cursor {
  26.   protected:
  27.     IBoolean isFor (IWDequeOnSeq < Element, ElementOps, Base > const& c) const
  28.     { return Base::Cursor::isFor (c.ivBase); }
  29.  
  30.   public:
  31.     Cursor (IWDequeOnSeq < Element, ElementOps, Base > const& c)
  32.     : Base::Cursor (c.ivBase) {}
  33.   };
  34.  
  35.                   IWDequeOnSeq             (INumber
  36.                                                numberOfElements = 100);
  37.  
  38.                   IWDequeOnSeq             (IWDequeOnSeq < Element, ElementOps, Base > const&);
  39.  
  40.    IWDequeOnSeq < Element, ElementOps, Base >&
  41.                   operator =                  (IWDequeOnSeq < Element, ElementOps, Base > const&);
  42.  
  43.                  ~IWDequeOnSeq             ();
  44.  
  45.    IBoolean       add                         (Element const&);
  46.  
  47.    IBoolean       add                         (Element const&,
  48.                                                ICursor&);
  49.  
  50.    void           addAllFrom                  (IWDequeOnSeq < Element, ElementOps, Base > const&);
  51.  
  52.    Element const& elementAt                   (ICursor const&) const;
  53.  
  54.    Element const& anyElement                  () const;
  55.  
  56.    void           removeAll                   ();
  57.  
  58.    IBoolean       isBounded                   () const;
  59.  
  60.    INumber        maxNumberOfElements         () const;
  61.  
  62.    INumber        numberOfElements            () const;
  63.  
  64.    IBoolean       isEmpty                     () const;
  65.  
  66.    IBoolean       isFull                      () const;
  67.  
  68.    ICursor*       newCursor                   () const;
  69.  
  70.    IBoolean       setToFirst                  (ICursor&) const;
  71.  
  72.    IBoolean       setToNext                   (ICursor&) const;
  73.  
  74.    IBoolean       allElementsDo               (IBoolean (*function)
  75.                                                (Element const&, void*),
  76.                                                void* additionalArgument = 0)
  77.                                                const;
  78.  
  79.    IBoolean       allElementsDo               (IConstantIterator
  80.                                                   <Element>&) const;
  81.  
  82.    IBoolean       isConsistent                () const;
  83.  
  84.    void           removeFirst                 ();
  85.  
  86.    void           removeLast                  ();
  87.  
  88.    Element const& firstElement                () const;
  89.  
  90.    Element const& lastElement                 () const;
  91.  
  92.    Element const& elementAtPosition           (IPosition) const;
  93.  
  94.    IBoolean       setToLast                   (ICursor&) const;
  95.  
  96.    IBoolean       setToPrevious               (ICursor&) const;
  97.  
  98.    void           setToPosition               (IPosition,
  99.                                                ICursor&) const;
  100.  
  101.    IBoolean       isFirst                     (ICursor const&) const;
  102.  
  103.    IBoolean       isLast                      (ICursor const&) const;
  104.  
  105.    long           compare                     (IWDequeOnSeq < Element, ElementOps, Base > const&,
  106.                                                long (*comparisonFunction)
  107.                                                   (Element const&,
  108.                                                   Element const&)) const;
  109.  
  110.    void           addAsFirst                  (Element const&);
  111.  
  112.    void           addAsFirst                  (Element const&,
  113.                                                ICursor&);
  114.  
  115.    void           addAsLast                   (Element const&);
  116.  
  117.    void           addAsLast                   (Element const&,
  118.                                                ICursor&);
  119.  
  120. };
  121.  
  122. #define IDefineGDequeOnGSequence(GSeq, GDeque) \
  123. template < class Element, class ElementOps > \
  124. class GDeque : \
  125.   public IWDequeOnSeq < Element, ElementOps, \
  126.                         GSeq < Element, ElementOps > > { \
  127. public: \
  128.   GDeque (INumber n = 100) : \
  129.     IWDequeOnSeq < Element, ElementOps, \
  130.                    GSeq < Element, ElementOps > > (n) {} \
  131. };
  132.  
  133. #include <ideqseq.if>
  134.  
  135. #endif
  136.