Debian Codegraph @

Source/Reasoner/Classifier/COptimizedConceptSaturationSatisfiableTestingItem.cpp

raw
1 /*
2 * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
3 *
4 * This file is part of the reasoning system Konclude.
5 * For details and support, see <http://konclude.com/>.
6 *
7 * Konclude is free software: you can redistribute it and/or modify
8 * it under the terms of version 3 of the GNU Lesser General Public
9 * License (LGPLv3) as published by the Free Software Foundation.
10 *
11 * Konclude is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU (Lesser) General Public License for more details.
15 *
16 * You should have received a copy of the GNU (Lesser) General Public
17 * License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21 #include "COptimizedConceptSaturationSatisfiableTestingItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedConceptSaturationSatisfiableTestingItem::COptimizedConceptSaturationSatisfiableTestingItem() {
32 }
33
34
35 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::initConceptSatisfiableTestingItem(CConcept* satTestConcept) {
36 mConceptSat = satTestConcept;
37 mConRefLinking = nullptr;
38 mSpecialItemReference = nullptr;
39 mSpecialReferenceMode = NONESATURATIONMODE;
40 mOrderingQueued = false;
41 mSucessorsItems = false;
42 mPilingReference = false;
43 mMultiplePredItems = false;
44 return this;
45 }
46
47 CConcept* COptimizedConceptSaturationSatisfiableTestingItem::getSatisfiableConcept() {
48 return mConceptSat;
49 }
50
51
52 bool COptimizedConceptSaturationSatisfiableTestingItem::isClassSatisfiableTestingItem() {
53 return false;
54 }
55
56
57 CConceptReferenceLinking* COptimizedConceptSaturationSatisfiableTestingItem::getConceptReferenceLinking() {
58 return mConRefLinking;
59 }
60
61 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setConceptReferenceLinking(CConceptReferenceLinking* refLinking) {
62 mConRefLinking = refLinking;
63 return this;
64 }
65
66 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::getSpecialItemReference() {
67 return mSpecialItemReference;
68 }
69
70 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setSpecialItemReference(COptimizedConceptSaturationSatisfiableTestingItem* reference) {
71 mSpecialItemReference = reference;
72 return this;
73 }
74
75 COptimizedConceptSaturationSatisfiableTestingItem::SATURATIONITEMREFERENCESPECIALMODE COptimizedConceptSaturationSatisfiableTestingItem::getSpecialReferenceMode() {
76 return mSpecialReferenceMode;
77 }
78
79 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setSpecialItemReferenceMode(COptimizedConceptSaturationSatisfiableTestingItem::SATURATIONITEMREFERENCESPECIALMODE mode) {
80 mSpecialReferenceMode = mode;
81 return this;
82 }
83
84 bool COptimizedConceptSaturationSatisfiableTestingItem::isOrderingQueued() {
85 return mOrderingQueued;
86 }
87
88 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setOrderingQueued(bool queued) {
89 mOrderingQueued = queued;
90 return this;
91 }
92
93 bool COptimizedConceptSaturationSatisfiableTestingItem::hasIndirectSuccessorsItems() {
94 return mSucessorsItems;
95 }
96
97 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setIndirectSuccessorsItems(bool hasSuccessors) {
98 mSucessorsItems = hasSuccessors;
99 return this;
100 }
101
102 bool COptimizedConceptSaturationSatisfiableTestingItem::hasPilingReferenceItem() {
103 return mPilingReference;
104 }
105
106 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setPilingReferenceItem(bool piledReference) {
107 mPilingReference = piledReference;
108 return this;
109 }
110
111
112
113 QList<COptimizedConceptSaturationSatisfiableTestingItem*>* COptimizedConceptSaturationSatisfiableTestingItem::getExistReferenceConceptItemList() {
114 return &mExistReferenceItemList;
115 }
116
117 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::addExistReferenceConceptItemList(COptimizedConceptSaturationSatisfiableTestingItem* existItem) {
118 mExistReferenceItemList.append(existItem);
119 return this;
120 }
121
122 bool COptimizedConceptSaturationSatisfiableTestingItem::hasMultipleDirectPredecessorsItems() {
123 return mMultiplePredItems;
124 }
125
126 COptimizedConceptSaturationSatisfiableTestingItem* COptimizedConceptSaturationSatisfiableTestingItem::setMultipleDirectPredecessorsItems(bool multiblePredItems) {
127 mMultiplePredItems = multiblePredItems;
128 return this;
129 }
130
131 }; // end namespace Classifier
132
133 }; // end namespace Reasoner
134
135 }; // end namespace Konclude