File: tSaveStack.h

package info (click to toggle)
fact%2B%2B 1.6.5~dfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 4,496 kB
  • sloc: cpp: 28,000; java: 22,674; xml: 3,268; makefile: 102; ansic: 61; sh: 3
file content (65 lines) | stat: -rw-r--r-- 1,936 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2003-2015 Dmitry Tsarkov and The University of Manchester
Copyright (C) 2015-2016 Dmitry Tsarkov

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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
*/

#ifndef _TSAVESTACK_H
#define _TSAVESTACK_H

#include "growingArrayP.h"
#include "fpp_assert.h"

/**
 *	Template stack for Saving/Restoring internal state of template parameter.
 *  Implemented as a growing array of pointers with more ops
 */
template <class T>
class TSaveStack: public growingArrayP<T>
{
public:		// interface
		/// c'tor: do nothing
	TSaveStack ( void ) {}
		/// d'tor: do nothing (all done in ~gaP)
	virtual ~TSaveStack ( void ) {}

	// stack operations

		/// get a new object from the stack;it will be filled by caller
	T* push ( void )
	{
		this->ensureHeapSize();
		return this->Base[this->last++];
	}
		/// get an object from the top of the stack
	T* pop ( void ) { return this->Base[--this->last]; }
		/// get an object from a fixed depth
	T* pop ( unsigned int depth )
	{
		fpp_assert ( this->last >= depth );
		this->last = depth;
		return pop();
	}
		/// get an object from a fixed depth
	T* top ( unsigned int depth )
	{
		fpp_assert ( this->last >= depth );
		this->last = depth;
		return this->Base[depth-1];
	}
}; // TSaveStack

#endif