common/stack.h

   1 /*
   2     EIBD eib bus access and management daemon
   3     Copyright (C) 2005-2010 Martin Koegler <mkoegler@auto.tuwien.ac.at>
   4
   5     This program is free software; you can redistribute it and/or modify
   6     it under the terms of the GNU General Public License as published by
   7     the Free Software Foundation; either version 2 of the License, or
   8     (at your option) any later version.
   9
  10     This program is distributed in the hope that it will be useful,
  11     but WITHOUT ANY WARRANTY; without even the implied warranty of
  12     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13     GNU General Public License for more details.
  14
  15     You should have received a copy of the GNU General Public License
  16     along with this program; if not, write to the Free Software
  17     Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18 */
  19
  20 #ifndef STACK_H
  21 #define STACK_H
  22
  23 #include "array.h"
  24
  25 /** implement a generic LIFO stack*/
  26 template < class T > class Stack
  27 {
  28 protected:
  29   /** elements in the stack*/
  30   Array < T > data;
  31
  32 public:
  33
  34   /** initialize stack */
  35   Stack ()
  36   {
  37   }
  38
  39   /** copy constructer */
  40   Stack (const Stack < T > &c)
  41   {
  42     data = c.data;
  43   }
  44
  45   /** destructor */
  46   virtual ~ Stack ()
  47   {
  48   }
  49
  50   /** assignment operator */
  51   const Stack < T > &operator = (const Stack < T > &c)
  52   {
  53     data = c.data;
  54     return c;
  55   }
  56
  57   /** adds a element to the queue end */
  58   void push (const T & el)
  59   {
  60     data.resize (data () + 1);
  61     data[data () - 1] = el;
  62   }
  63
  64   /** remove the element from the queue head and returns it */
  65   T pop ()
  66   {
  67     T a = data[data () - 1];
  68     data.resize (data () - 1);
  69     return a;
  70   }
  71
  72   /** returns the element from the queue head */
  73   const T & top () const
  74   {
  75     return data[data () - 1];
  76   }
  77
  78   /** return true, if the queue is empty */
  79   int isempty () const
  80   {
  81     return data () == 0;
  82   }
  83
  84 };
  85
  86 #endif