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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2005-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 TNECOLLECTION_H
#define TNECOLLECTION_H
#include <vector>
#include <set>
#include "tNamedEntry.h"
#include "tNameSet.h"
#include "eFPPCantRegName.h"
/** class for collect TNamedEntry'es together. Template parameter should be
inherited from TNamedEntry. Implemented as vector of T*,
with Base[i]->getId() == i.
**/
template<class T>
class TNECollection
{
protected: // typedefs
typedef std::vector<T*> BaseType;
public: // typedefs
typedef typename BaseType::iterator iterator;
typedef typename BaseType::const_iterator const_iterator;
protected: // members
/// vector of elements
BaseType Base;
/// nameset to hold the elements
TNameSet<T> NameSet;
/// name of the type
std::string TypeName;
/// flag to lock the nameset (ie, prohibit to add new names there)
bool locked;
/// if true, allow fresh entities even when locked. treat them as System in this case
bool allowFresh;
protected: // methods
/// virtual method for additional tuning of newly created element
virtual void registerNew ( T* ) {}
/// register new element in a collection; return this element
T* registerElem ( T* p )
{
p->setId((int)Base.size());
Base.push_back(p);
registerNew(p);
return p;
}
public: // interface
/// c'tor: clear 0-th element
TNECollection ( const std::string& name )
: TypeName(name)
, locked(false)
, allowFresh(false)
{ Base.push_back(NULL); }
/// empty d'tor: all elements will be deleted in other place
virtual ~TNECollection ( void ) {}
// locked interface
/// check if collection is locked
bool isLocked ( void ) const { return locked; }
/// set LOCKED value to a VAL; @return old value of LOCKED
bool setLocked ( bool val ) { bool old = locked; locked = val; return old; }
/// set FRESH value to a VAL; @return the old value
bool setAllowFresh ( bool val ) { bool old = allowFresh; allowFresh = val; return old; }
// add/remove elements
/// check if entry with a NAME is registered in given collection
bool isRegistered ( const std::string& name ) const { return NameSet.get(name) != NULL; }
/// get entry by NAME from the collection; register it if necessary
T* get ( const std::string& name )
{
T* p = NameSet.get(name);
// check if name is already defined
if ( p != NULL )
return p;
// check if it is possible to insert name
if ( isLocked() && !allowFresh )
throw EFPPCantRegName ( name, TypeName );
// create name in name set, and register it
p = registerElem(NameSet.add(name));
// if fresh entity -- mark it System
if ( isLocked() )
{
p->setSystem();
if ( dynamic_cast<ClassifiableEntry*>(p) != NULL )
dynamic_cast<ClassifiableEntry*>(p)->setNonClassifiable();
}
return p;
}
/// remove given entry from the collection; @return true iff it was NOT the last entry.
bool Remove ( T* p )
{
if ( !isRegistered(p->getName()) ) // not in a name-set: just delete it
{
delete p;
return false;
}
// we might delete vars in order (6,7), so the resize should be done to 6
if ( p->getId() > 0 && Base.size() > (size_t)p->getId() )
Base.resize(p->getId());
NameSet.remove(p->getName());
return false;
}
// access to elements
iterator begin ( void ) { return Base.begin()+1; }
const_iterator begin ( void ) const { return Base.begin()+1; }
iterator end ( void ) { return Base.end(); }
const_iterator end ( void ) const { return Base.end(); }
size_t size ( void ) const { return Base.size()-1; }
}; // TNECollection
#endif
|
