stack.h

Go to the documentation of this file.

/**********************************************************************
 *<
    FILE: stack.h

    DESCRIPTION: Simple stack using Tab.

    CREATED BY: Rolf Berteig

    HISTORY: Created 22 November 1994

 *> Copyright (c) 1994, All Rights Reserved.
 **********************************************************************/

#pragma once
#include "maxheap.h"
#include "tab.h"

template<class T> class Stack : public MaxHeapOperators
{
    private:
        Tab<T> s;       
    
    public:     
        // access the stack indexing from the top down.
        const T& operator[](const int i) const { 
            DbgAssert(s.Count()-i>0);
            return s[s.Count()-i-1];
            }
        T& operator[](const int i) { 
            DbgAssert(s.Count()-i>0);
            return s[s.Count()-i-1];
        }

        void Push( T *el ) { 
            s.Append( 1, el );          
            }

        void Pop( T *el ) { 
            DbgAssert( s.Count() ); 
            *el = s[s.Count()-1];
            s.Delete( s.Count()-1, 1 );         
            }

        void Pop() { 
            DbgAssert( s.Count() );             
            s.Delete( s.Count()-1, 1 );         
            }

        void GetTop( T *el ) {
            DbgAssert( s.Count() ); 
            *el = s[s.Count()-1];
            }

        void Clear() {
            s.Delete(0,s.Count());          
            }

        int Count() const {
            return s.Count(); 
            }

        int Remove( int i ) {
            assert(i<s.Count());
            return s.Delete(s.Count()-1-i,1);
            }
    };