Search  

---

C:/temp/src/j2k/DataType/Stack/ArrayStack.hpp

Go to the documentation of this file.

#ifndef __J2K__ArrayBased_Stack_HPP__
#define __J2K__ArrayBased_Stack_HPP__

#include <j2k/Fred/Basic.hpp>

#define LIST_SIZE    100

class ArrayStack {                           // Array-based stack class
public:

  inline ArrayStack()                        // Default Constructor
    : size( LIST_SIZE ), top( 0 ) 
  {
    listarray = new Elem[ LIST_SIZE ];
  }

  inline ArrayStack( unsigned long sz )      // Constructor with Size   
    : size( LIST_SIZE ), top( 0 ) 
  {
    listarray = new Elem[sz];
  }

  inline virtual ~ArrayStack()               // Destructor: delete the array
  {
    delete [] listarray;
  }

  inline void clear()                        // Remove all Elem's from stack
  {
    top = 0;
    memset( listarray, 0, ( sizeof( Elem ) * LIST_SIZE ) );
  }

  inline void push( const Elem item )        // Push Elem onto stack
  {
    assert(top < size);
    listarray[top] = item;
    top++;
  }

  inline Elem pop()                          // Pop Elem from top of stack
  {
    assert( !isEmpty() );
    --top;
    return listarray[ top ];
  }

  inline Elem topValue() const               // Return value of top Elem
  {
    assert( !isEmpty() );
    return listarray[ top-1 ];
  }

  inline BOOL isEmpty() const                // Return TRUE if stack is empty
  {
    return (top == 0);
  }

  inline BOOL isFilled() const               // Return TRUE if NOT empty
  {
    return (top != 0);
  }

private:
  unsigned long size;                        // Maximum size of stack
  unsigned long top;                         // Index for top Elem
  Elem *listarray;                           // Array holding stack Elem's
};

#endif // End of ArrayStack.hpp

---