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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/* 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 TRARESAVESTACK_H
#define TRARESAVESTACK_H
#include <vector>
#include "globaldef.h"
#include "tRestorer.h"
/**
* Stack for Saving/Restoring rarely changing information.
* Uses self-contained Restorer as a way to update state of object.
*/
class TRareSaveStack
{
protected: // typedefs
/// vector of restorers
typedef std::vector<TRestorer*> TBaseType;
protected: // members
/// heap of saved objects
TBaseType Base;
/// current level
unsigned int curLevel;
public: // interface
/// empty c'tor: stack will most likely be empty
TRareSaveStack ( void ) : curLevel(InitBranchingLevelValue) {}
/// d'tor
~TRareSaveStack ( void ) { clear(); }
// stack operations
/// inclrement current level
void incLevel ( void ) { ++curLevel; }
/// check that stack is empty
bool empty ( void ) const { return Base.empty(); }
/// add a new object to the stack
void push ( TRestorer* p )
{
p->setLevel(curLevel);
Base.push_back(p);
}
/// get all object from the top of the stack with levels >= LEVEL
void restore ( unsigned int level )
{
curLevel = level;
while ( !Base.empty() )
{
TRestorer* cur = Base.back();
if ( cur->level() <= level )
break;
// need to restore: restore last element, remove it from stack
cur->restore();
delete cur;
Base.pop_back();
}
}
/// clear stack
void clear ( void )
{
for ( TBaseType::iterator p = Base.begin(), p_end = Base.end(); p < p_end; ++p )
delete *p;
Base.clear();
curLevel = InitBranchingLevelValue;
}
}; // TRareSaveStack
#endif
|
