Debian Codegraph @

Source/Reasoner/Consistiser/CSaturationConceptDataItem.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 "CSaturationConceptDataItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Consistiser {
29
30
31 CSaturationConceptDataItem::CSaturationConceptDataItem() {
32 }
33
34
35 CSaturationConceptDataItem* CSaturationConceptDataItem::initConceptSaturationTestingItem(CConcept* satTestConcept, bool negated, CRole* role) {
36 mConceptSat = satTestConcept;
37 mNegation = negated;
38 mConRefLinking = nullptr;
39 mSpecialItemReference = nullptr;
40 mSpecialReferenceMode = NONESATURATIONMODE;
41 mOrderingQueued = false;
42 mSucessorsItems = false;
43 mMultiplePredItems = false;
44 mRoleRanges = role;
45 mInvalidSpecialItemReference = false;
46 mProcessingQueued = false;
47 mProcessingMarked = false;
48 return this;
49 }
50
51 CConcept* CSaturationConceptDataItem::getSaturationConcept() {
52 return mConceptSat;
53 }
54
55 CRole* CSaturationConceptDataItem::getSaturationRoleRanges() {
56 return mRoleRanges;
57 }
58
59 bool CSaturationConceptDataItem::getSaturationNegation() {
60 return mNegation;
61 }
62
63 CConceptReferenceLinking* CSaturationConceptDataItem::getConceptReferenceLinking() {
64 return mConRefLinking;
65 }
66
67 CSaturationConceptDataItem* CSaturationConceptDataItem::setConceptReferenceLinking(CConceptReferenceLinking* refLinking) {
68 mConRefLinking = refLinking;
69 return this;
70 }
71
72 CSaturationConceptDataItem* CSaturationConceptDataItem::getSpecialItemReference() {
73 return mSpecialItemReference;
74 }
75
76 CSaturationConceptDataItem* CSaturationConceptDataItem::setSpecialItemReference(CSaturationConceptDataItem* reference) {
77 mSpecialItemReference = reference;
78 return this;
79 }
80
81 CSaturationConceptDataItem::SATURATIONITEMREFERENCESPECIALMODE CSaturationConceptDataItem::getSpecialReferenceMode() {
82 return mSpecialReferenceMode;
83 }
84
85 CSaturationConceptDataItem* CSaturationConceptDataItem::setSpecialItemReferenceMode(CSaturationConceptDataItem::SATURATIONITEMREFERENCESPECIALMODE mode) {
86 mSpecialReferenceMode = mode;
87 return this;
88 }
89
90 bool CSaturationConceptDataItem::isOrderingQueued() {
91 return mOrderingQueued;
92 }
93
94 CSaturationConceptDataItem* CSaturationConceptDataItem::setOrderingQueued(bool queued) {
95 mOrderingQueued = queued;
96 return this;
97 }
98
99 bool CSaturationConceptDataItem::hasIndirectSuccessorsItems() {
100 return mSucessorsItems;
101 }
102
103 CSaturationConceptDataItem* CSaturationConceptDataItem::setIndirectSuccessorsItems(bool hasSuccessors) {
104 mSucessorsItems = hasSuccessors;
105 return this;
106 }
107
108 QList<CSaturationConceptDataItem*>* CSaturationConceptDataItem::getExistReferenceConceptItemList() {
109 return &mExistReferenceItemList;
110 }
111
112 CSaturationConceptDataItem* CSaturationConceptDataItem::addExistReferenceConceptItemList(CSaturationConceptDataItem* existItem) {
113 mExistReferenceItemList.append(existItem);
114 return this;
115 }
116
117 bool CSaturationConceptDataItem::hasMultipleDirectPredecessorsItems() {
118 return mMultiplePredItems;
119 }
120
121 CSaturationConceptDataItem* CSaturationConceptDataItem::setMultipleDirectPredecessorsItems(bool multiblePredItems) {
122 mMultiplePredItems = multiblePredItems;
123 return this;
124 }
125
126 bool CSaturationConceptDataItem::isInvalidSpecialItemReference() {
127 return mInvalidSpecialItemReference;
128 }
129
130 CSaturationConceptDataItem* CSaturationConceptDataItem::setInvalidSpecialItemReference(bool invalid) {
131 mInvalidSpecialItemReference = invalid;
132 return this;
133 }
134
135 bool CSaturationConceptDataItem::isItemProcessingQueued() {
136 return mProcessingQueued;
137 }
138
139 CSaturationConceptDataItem* CSaturationConceptDataItem::setItemProcessingQueued(bool queued) {
140 mProcessingQueued = queued;
141 return this;
142 }
143
144
145 bool CSaturationConceptDataItem::isItemProcessingMarked() {
146 return mProcessingMarked;
147 }
148
149 CSaturationConceptDataItem* CSaturationConceptDataItem::setItemProcessingMarked(bool marked) {
150 mProcessingMarked = marked;
151 return this;
152 }
153
154 }; // end namespace Consistiser
155
156 }; // end namespace Reasoner
157
158 }; // end namespace Konclude