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
143
144
145
146
147
148
|
/* 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 CWDARRAY_H
#define CWDARRAY_H
#include <ostream>
#include <algorithm> // find
#include "globaldef.h"
#include "growingArray.h"
#include "ConceptWithDep.h"
enum addConceptResult { acrClash, acrExist, acrDone };
class TRestorer;
/// array of concepts with dep-set, which may be viewed as a label of a completion-graph
class CWDArray
{
protected: // internal typedefs
/// base type
typedef growingArray<ConceptWDep> ConceptSet;
/// RW iterator
typedef ConceptSet::iterator iterator;
/// restorer for the merge
friend class UnMerge;
public: // type interface
/// class for saving one label
class SaveState
{
public:
/// end pointer of the label
size_t ep;
public: // interface
/// empty c'tor
SaveState ( void ) : ep(0) {}
/// copy c'tor
SaveState ( const SaveState& node ) : ep(node.ep) {}
/// empty d'tor
~SaveState ( void ) {}
}; // SaveState
/// const iterator on label
typedef ConceptSet::const_iterator const_iterator;
protected: // members
/// array of concepts together with dep-sets
ConceptSet Base;
public: // interface
/// init/clear label with given size
void init ( size_t size )
{
Base.reserve(size);
Base.clear();
}
/// empty c'tor
CWDArray ( void ) {}
/// copy c'tor
CWDArray ( const CWDArray& copy ) : Base(copy.Base) {}
/// assignment
CWDArray& operator = ( const CWDArray& copy ) { Base = copy.Base; return *this; }
/// empty d'tor
~CWDArray ( void ) {}
//----------------------------------------------
// Label access interface
//----------------------------------------------
// label iterators
/// begin RO iterator
const_iterator begin ( void ) const { return Base.begin(); }
/// end RO iterator
const_iterator end ( void ) const { return Base.end(); }
// add concept
/// adds concept P to a label
void add ( const ConceptWDep& p ) { Base.add(p); }
/// update concept BP with a dep-set DEP; @return the appropriate restorer
TRestorer* updateDepSet ( BipolarPointer bp, const DepSet& dep );
// access concepts
/// check whether label contains BP (ignoring dep-set)
bool contains ( BipolarPointer bp ) const { return std::find ( begin(), end(), bp ) != end(); }
/// get the concept by given index in the node's label
const ConceptWDep& getConcept ( size_t n ) const { return Base[n]; }
//----------------------------------------------
// Blocking support
//----------------------------------------------
/// check whether LABEL is a superset of a current one
bool operator <= ( const CWDArray& label ) const
{
for ( const_iterator p = begin(), p_end = end(); p < p_end; ++p )
if ( !label.contains(p->bp()) )
return false;
return true;
}
/// check whether LABEL is a subset of a current one
bool operator >= ( const CWDArray& label ) const { return label <= *this; }
/// check whether LABEL is the same as a current one
bool operator == ( const CWDArray& label ) const
{ return (*this <= label) && (label <= *this); }
//----------------------------------------------
// Save/restore interface
//----------------------------------------------
/// save label using given SS
void save ( SaveState& ss ) const { ss.ep = Base.size(); }
/// restore label to given LEVEL using given SS
void restore ( const SaveState& ss, unsigned int level );
//----------------------------------------------
// Output
//----------------------------------------------
/// print the whole label
void print ( std::ostream& o ) const;
}; // CWDArray
#endif
|
