Search  

---

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

Go to the documentation of this file.

#ifndef __J2K__Linked_Stack_HPP__
#define __J2K__Linked_Stack_HPP__

#include <j2k/Fred/Basic.hpp>

class LinkedStack {                        // Linked stack class
public:

  inline LinkedStack() : top( NULL ) { }   // Default Constructor

  inline virtual ~LinkedStack() {          // Destructor: return Elems
    clear();
  }

  void clear();                            // Remove all Elems from stack

  inline void push( const Elem item )      // Push Elem onto stack
  {
    top = new SLink( item, top );
  }

  Elem pop();                              // Pop Elem from top of stack

  inline Elem topValue() const             // Get value of top Elem
  {
    assert( !isEmpty() );
    return top->element;
  }

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

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

private:
  SLink *top;                              // Pointer to top stack Elem

};

void Stack::clear()                        // Remove all Elems from the stack
{
  while( top != NULL )                     // Return link nodes to the freelist
  {
    SLink* temp = top;
    top = top->next;
    delete[] temp;
  }

  assert( top == NULL );
}

Elem Stack::pop()                          // Pop Elem from top of stack
{
  assert( !isEmpty() );
  Elem temp = top->element;
  SLink* ltemp = top->next;
  delete top;
  top = ltemp;
  return temp;
}

#endif // End of LinkedStack.hpp

---