bstack.h File Reference

bounded stack. More...

#include "abacus/array.h"
#include "abacus/bstack.inc"

Go to the source code of this file.

Classes
class	ABA_BSTACK< Type >
	a set of elements, following the last-in first-out (LIFO) principle the access to or the deletion of an element is restricted to the most recently inserted element. More...

---

Detailed Description

bounded stack.

Author:

Matthias Elf

A stack is a data structure storing a set of elements. Following the last-in first-out (LIFO) principle the access to or the deletion of an element is restricted to the most recently inserted element.

In order to provide an efficient implementation this stack is ``bounded'', i.e., the number of elements which can be inserted is limited. However, a reallocation can be performed if required.

License:

This file is part of ABACUS - A Branch And CUt System Copyright (C) 1995 - 2003 University of Cologne, Germany

This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version.

This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

See also:

http://www.gnu.org/copyleft/gpl.html

Definition in file bstack.h.

---