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
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* Konclude 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. For more
* details, see GNU Lesser General Public License.
*
*/
#include "COptimizedConceptSaturationSatisfiableTestingItem.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
COptimizedConceptSaturationSatisfiableTestingItem::COptimizedConceptSaturationSatisfiableTestingItem() {
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::initConceptSatisfiableTestingItem(CConcept* satTestConcept) {
mConceptSat = satTestConcept;
mConRefLinking = nullptr;
mSpecialItemReference = nullptr;
mSpecialReferenceMode = NONESATURATIONMODE;
mOrderingQueued = false;
mSucessorsItems = false;
mPilingReference = false;
mMultiplePredItems = false;
return this;
}
CConcept* COptimizedConceptSaturationSatisfiableTestingItem::getSatisfiableConcept() {
return mConceptSat;
}
bool COptimizedConceptSaturationSatisfiableTestingItem::isClassSatisfiableTestingItem() {
return false;
}
CConceptReferenceLinking* COptimizedConceptSaturationSatisfiableTestingItem::getConceptReferenceLinking() {
return mConRefLinking;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setConceptReferenceLinking(CConceptReferenceLinking* refLinking) {
mConRefLinking = refLinking;
return this;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::getSpecialItemReference() {
return mSpecialItemReference;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setSpecialItemReference(COptimizedConceptSaturationSatisfiableTestingItem* reference) {
mSpecialItemReference = reference;
return this;
}
COptimizedConceptSaturationSatisfiableTestingItem::SATURATIONITEMREFERENCESPECIALMODE COptimizedConceptSaturationSatisfiableTestingItem::getSpecialReferenceMode() {
return mSpecialReferenceMode;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setSpecialItemReferenceMode(COptimizedConceptSaturationSatisfiableTestingItem::SATURATIONITEMREFERENCESPECIALMODE mode) {
mSpecialReferenceMode = mode;
return this;
}
bool COptimizedConceptSaturationSatisfiableTestingItem::isOrderingQueued() {
return mOrderingQueued;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setOrderingQueued(bool queued) {
mOrderingQueued = queued;
return this;
}
bool COptimizedConceptSaturationSatisfiableTestingItem::hasIndirectSuccessorsItems() {
return mSucessorsItems;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setIndirectSuccessorsItems(bool hasSuccessors) {
mSucessorsItems = hasSuccessors;
return this;
}
bool COptimizedConceptSaturationSatisfiableTestingItem::hasPilingReferenceItem() {
return mPilingReference;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setPilingReferenceItem(bool piledReference) {
mPilingReference = piledReference;
return this;
}
QList<COptimizedConceptSaturationSatisfiableTestingItem*>* COptimizedConceptSaturationSatisfiableTestingItem::getExistReferenceConceptItemList() {
return &mExistReferenceItemList;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::addExistReferenceConceptItemList(COptimizedConceptSaturationSatisfiableTestingItem* existItem) {
mExistReferenceItemList.append(existItem);
return this;
}
bool COptimizedConceptSaturationSatisfiableTestingItem::hasMultipleDirectPredecessorsItems() {
return mMultiplePredItems;
}
COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setMultipleDirectPredecessorsItems(bool multiblePredItems) {
mMultiplePredItems = multiblePredItems;
return this;
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|
