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
|
/* 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 TSETASTREE_H
#define TSETASTREE_H
#include <set>
// implement model cache set as a tree-set
class TSetAsTree
{
protected: // types
/// base type
typedef std::set<unsigned int> BaseType;
protected: // members
/// set implementation
BaseType Base;
/// maximal number of elements
unsigned int nElems;
public: // interface
/// empty c'tor taking max possible number of elements in the set
explicit TSetAsTree ( unsigned int size ) : nElems(size) {}
/// copy c'tor
TSetAsTree ( const TSetAsTree& is ) : Base(is.Base) {}
/// assignment
TSetAsTree& operator= ( const TSetAsTree& is )
{
Base = is.Base;
return *this;
}
/// empty d'tor
~TSetAsTree ( void ) {}
/// adds given index to the set
void insert ( unsigned int i )
{
# ifdef ENABLE_CHECKING
fpp_assert ( i > 0 );
# endif
Base.insert(i);
}
/// completes the set with [1,n)
void completeSet ( void )
{
for ( unsigned int i = 1; i < nElems; ++i )
Base.insert(i);
}
/// adds the given set to the current one
TSetAsTree& operator |= ( const TSetAsTree& is )
{
Base.insert ( is.Base.begin(), is.Base.end() );
return *this;
}
/// clear the set
void clear ( void ) { Base.clear(); }
/// check whether the set is empty
bool empty ( void ) const { return Base.empty(); }
/// check whether I contains in the set
bool contains ( unsigned int i ) const { return Base.find(i) != Base.end(); }
/// check whether the intersection between the current set and IS is nonempty
bool intersects ( const TSetAsTree& is ) const
{
if ( Base.empty() || is.Base.empty() )
return false;
BaseType::const_iterator p1 = Base.begin(), p1_end = Base.end(), p2 = is.Base.begin(), p2_end = is.Base.end();
while ( p1 != p1_end && p2 != p2_end )
if ( *p1 == *p2 )
return true;
else if ( *p1 < *p2 )
++p1;
else
++p2;
return false;
}
/// prints the set in a human-readable form
void print ( std::ostream& o ) const
{
o << "{";
if ( !empty() )
{
BaseType::const_iterator p = Base.begin(), p_end = Base.end();
o << *p;
while ( ++p != p_end )
o << ',' << *p;
}
o << "}";
}
typedef BaseType::const_iterator const_iterator;
const_iterator begin ( void ) const { return Base.begin(); }
const_iterator end ( void ) const { return Base.end(); }
/// size of a set
size_t size ( void ) const { return Base.size(); }
/// maximal size of a set
unsigned int maxSize ( void ) const { return nElems; }
}; // TSetAsTree
#endif
|
