include/AD/contain/dlnklist.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 parametrized_doubly_linked_lists_h
  26 #define parametrized_doubly_linked_lists_h
  27
  28 #include <AD/contain/dlist.h>
  29
  30 template <class T>
  31    class DLinkList : public DList {
  32
  33       struct DNode : public DLink {
  34          T element;
  35          DNode(const T& e) : element(e) {}
  36       };
  37
  38    public:
  39
  40       //////////////////////////////////////////////////////////////////////
  41       // Constructor and destructors
  42       //////////////////////////////////////////////////////////////////////
  43       DLinkList() {}
  44       DLinkList(const DLinkList&);
  45      ~DLinkList() {}
  46
  47       //////////////////////////////////////////////////////////////////////
  48       // Assignment
  49       //////////////////////////////////////////////////////////////////////
  50       void operator = (const DLinkList&);
  51
  52       //////////////////////////////////////////////////////////////////////
  53       // New mutators
  54       //////////////////////////////////////////////////////////////////////
  55       Ix   insert_head  (const T& e)
  56          { return DList::insert_head(new DNode<T>(e)); }
  57       Ix   insert_tail  (const T& e)
  58          { return DList::insert_head(new DNode<T>(e)); }
  59       Ix   insert_after (Ix i, const T& e)
  60          { return DList::insert_after((DList *)i,new DNode<T>(e)); }
  61       Ix   insert_before(Ix i, const T& e)
  62          { return DList::insert_before((DList *)i,new DNode<T>(e)); }
  63
  64       //////////////////////////////////////////////////////////////////////
  65       // New iterators
  66       //////////////////////////////////////////////////////////////////////
  67       T& operator () (Ix i) { return ((DNode<T>*)i)->element; }
  68    };
  69
  70 #endif