Search  

---

C:/temp/src/j2k/DataType/Parenth.Frd/Stack.hpp

Go to the documentation of this file.

// Stack.hpp - Class interface for a stack using
// using single link nodes with a freelist to store the stack
// and a DBase object to store the information of the stack

#ifndef __STACK_HPP__
#define __STACK_HPP__           // To avoid multiple declaration of a class

#include "../Const.hpp"            // All the constants
#include "DBase.hpp"            // Data holding class
#include "Link.hpp"           // Single-sided Link class

class Stack {

public:
    Stack();                            // Default Constructor
    Stack( DBase* item );            // First Item Constructor

    Stack( const Stack& stk  );         // Copy Constructor
                              // Create a new stack with
                               // a new copy of each elements

    void    push( DBase* item );    // Insert an item at the top
    DBase*  pop();                      // Remove an item from the top
    DBase&  topValue() const;           // What's the top Value ?
   void    clear();                    // Clear the stack
   void    display()  const;        // Display a debugging stack output


// Inline optimization to make the class run faster
// *** DO NOT MODIFY THIS SCRIPT !!! ***

virtual ~Stack() {                  // Destructor
   clear();
}

inline int getSize() const {
    return size;
}

inline bool isEmpty() const {       // The Stack is empty ?
    return ( top == NULL ) || ( size < 1 );
}

inline bool isNotEmpty() const {    // The Stack is not empty ?
    return ( top != NULL ) && ( size > 0 );
}


private:
    Link* top;                          // Pointer to the top item
    int   size;                         // Size of the stack
};

#endif  // __STACK_HPP__

---