| 1 | //
 | 
|---|
| 2 | // stack.h
 | 
|---|
| 3 | //
 | 
|---|
| 4 | // Copyright (C) 1996 Limit Point Systems, Inc.
 | 
|---|
| 5 | //
 | 
|---|
| 6 | // Author: Curtis Janssen <cljanss@limitpt.com>
 | 
|---|
| 7 | // Maintainer: LPS
 | 
|---|
| 8 | //
 | 
|---|
| 9 | // This file is part of the SC Toolkit.
 | 
|---|
| 10 | //
 | 
|---|
| 11 | // The SC Toolkit is free software; you can redistribute it and/or modify
 | 
|---|
| 12 | // it under the terms of the GNU Library General Public License as published by
 | 
|---|
| 13 | // the Free Software Foundation; either version 2, or (at your option)
 | 
|---|
| 14 | // any later version.
 | 
|---|
| 15 | //
 | 
|---|
| 16 | // The SC Toolkit is distributed in the hope that it will be useful,
 | 
|---|
| 17 | // but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
| 18 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
| 19 | // GNU Library General Public License for more details.
 | 
|---|
| 20 | //
 | 
|---|
| 21 | // You should have received a copy of the GNU Library General Public License
 | 
|---|
| 22 | // along with the SC Toolkit; see the file COPYING.LIB.  If not, write to
 | 
|---|
| 23 | // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
 | 
|---|
| 24 | //
 | 
|---|
| 25 | // The U.S. Government is granted a limited license as per AL 91-7.
 | 
|---|
| 26 | //
 | 
|---|
| 27 | 
 | 
|---|
| 28 | #ifndef _util_render_stack_h
 | 
|---|
| 29 | #define _util_render_stack_h
 | 
|---|
| 30 | 
 | 
|---|
| 31 | #include <iostream>
 | 
|---|
| 32 | 
 | 
|---|
| 33 | namespace sc {
 | 
|---|
| 34 | 
 | 
|---|
| 35 | #define STACK_MAX_STACK_SIZE 20
 | 
|---|
| 36 | template <class T>
 | 
|---|
| 37 | class Stack {
 | 
|---|
| 38 |   private:
 | 
|---|
| 39 |     T objects[STACK_MAX_STACK_SIZE];
 | 
|---|
| 40 |     int nobjects;
 | 
|---|
| 41 |   public:
 | 
|---|
| 42 |     Stack(): nobjects(0) {}
 | 
|---|
| 43 |     void push(const T&a) {
 | 
|---|
| 44 |         if (nobjects >= STACK_MAX_STACK_SIZE) {
 | 
|---|
| 45 |             ExEnv::errn() << "Stack: overflow" << std::endl;
 | 
|---|
| 46 |             abort();
 | 
|---|
| 47 |           }
 | 
|---|
| 48 |         objects[nobjects++] = a;
 | 
|---|
| 49 |       }
 | 
|---|
| 50 |     T pop() {
 | 
|---|
| 51 |         if (!nobjects) {
 | 
|---|
| 52 |             ExEnv::errn() << "Stack: underflow" << std::endl;
 | 
|---|
| 53 |             abort();
 | 
|---|
| 54 |           }
 | 
|---|
| 55 |         nobjects -= 1;
 | 
|---|
| 56 |         return objects[nobjects];
 | 
|---|
| 57 |       }
 | 
|---|
| 58 |     T top() const {
 | 
|---|
| 59 |         if (!nobjects) {
 | 
|---|
| 60 |             ExEnv::errn() << "Stack: underflow" << std::endl;
 | 
|---|
| 61 |             abort();
 | 
|---|
| 62 |           }
 | 
|---|
| 63 |         return objects[nobjects - 1];
 | 
|---|
| 64 |       }
 | 
|---|
| 65 |     int n() const { return nobjects; }
 | 
|---|
| 66 |     T operator[](int i) { return objects[i]; }
 | 
|---|
| 67 |     void print(std::ostream& os = ExEnv::out0()) {
 | 
|---|
| 68 |         os << "Stack (depth = " << nobjects << "):" << std::endl;
 | 
|---|
| 69 |         for (int i=0; i<nobjects; i++) {
 | 
|---|
| 70 |             os << "  object " << i << ":" << std::endl;
 | 
|---|
| 71 |             objects[i]->print(os);
 | 
|---|
| 72 |           }
 | 
|---|
| 73 |       }
 | 
|---|
| 74 | };
 | 
|---|
| 75 | 
 | 
|---|
| 76 | }
 | 
|---|
| 77 | 
 | 
|---|
| 78 | #endif
 | 
|---|
| 79 | 
 | 
|---|
| 80 | // Local Variables:
 | 
|---|
| 81 | // mode: c++
 | 
|---|
| 82 | // c-file-style: "CLJ"
 | 
|---|
| 83 | // End:
 | 
|---|