Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualNodeAnalizedConceptExpansionData.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 "CIndividualNodeAnalizedConceptExpansionData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CIndividualNodeAnalizedConceptExpansionData::CIndividualNodeAnalizedConceptExpansionData() {
34 }
35
36
37 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::initBlockingExplorationData(CIndividualNodeAnalizedConceptExpansionData* prevData) {
38 if (prevData) {
39 mLastConceptCount = prevData->mLastConceptCount;
40 mLastConDes = prevData->mLastConDes;
41 mRevAnaConExpLinker = prevData->mRevAnaConExpLinker;
42 mMinValidConceptCountLimit = prevData->mMinValidConceptCountLimit;
43 mExpCount = prevData->mExpCount;
44 mLastConceptSignature = prevData->mLastConceptSignature;
45 mInvalidBlocker = prevData->mInvalidBlocker;
46 mNonDetExpansionLinker = prevData->mNonDetExpansionLinker;
47 } else {
48 mLastConceptCount = 0;
49 mLastConDes = nullptr;
50 mRevAnaConExpLinker = nullptr;
51 mExpCount = 0;
52 mMinValidConceptCountLimit = 0;
53 mLastConceptSignature = 0;
54 mInvalidBlocker = false;
55 mNonDetExpansionLinker = nullptr;
56 }
57 return this;
58 }
59
60
61 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::addAnalizedConceptExpansionLinker(CAnalizedConceptExpansionLinker *linker) {
62 mExpCount += linker->getCount();
63 if (mRevAnaConExpLinker) {
64 mRevAnaConExpLinker = linker->append(mRevAnaConExpLinker);
65 } else {
66 mRevAnaConExpLinker = linker;
67 }
68 return this;
69 }
70
71
72 CAnalizedConceptExpansionLinker* CIndividualNodeAnalizedConceptExpansionData::getReverseAnalizedConceptExpansionLinker() {
73 return mRevAnaConExpLinker;
74 }
75
76
77 CConceptDescriptor* CIndividualNodeAnalizedConceptExpansionData::getLastConceptDescriptor() {
78 return mLastConDes;
79 }
80
81 cint64 CIndividualNodeAnalizedConceptExpansionData::getLastConceptCount() {
82 return mLastConceptCount;
83 }
84
85 cint64 CIndividualNodeAnalizedConceptExpansionData::getExpansionConceptCount() {
86 return mExpCount;
87 }
88
89 cint64 CIndividualNodeAnalizedConceptExpansionData::getMinimalValidConceptCountLimit() {
90 return mMinValidConceptCountLimit;
91 }
92
93 cint64 CIndividualNodeAnalizedConceptExpansionData::getLastConceptSignature() {
94 return mLastConceptSignature;
95 }
96
97 bool CIndividualNodeAnalizedConceptExpansionData::isInvalidBlocker() {
98 return mInvalidBlocker;
99 }
100
101 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::setLastConceptDescriptor(CConceptDescriptor* conDes) {
102 mLastConDes = conDes;
103 return this;
104 }
105
106 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::setLastConceptSignature(cint64 signature) {
107 mLastConceptSignature = signature;
108 return this;
109 }
110
111 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::setLastConceptCount(cint64 conCount) {
112 mLastConceptCount = conCount;
113 return this;
114 }
115
116 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::setMinimalValidConceptCountLimit(cint64 conCount) {
117 mMinValidConceptCountLimit = conCount;
118 return this;
119 }
120
121 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::setInvalidBlocker(bool invalid) {
122 mInvalidBlocker = invalid;
123 return this;
124 }
125
126
127 CXLinker<CConceptDescriptor*>* CIndividualNodeAnalizedConceptExpansionData::getAnalysedNonDeterministicConceptExpansionLinker() {
128 return mNonDetExpansionLinker;
129 }
130
131 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::setAnalysedNonDeterministicConceptExpansionLinker(CXLinker<CConceptDescriptor*>* linker) {
132 mNonDetExpansionLinker = linker;
133 return this;
134 }
135
136
137 CIndividualNodeAnalizedConceptExpansionData* CIndividualNodeAnalizedConceptExpansionData::addAnalysedNonDeterministicConceptExpansionLinker(CXLinker<CConceptDescriptor*>* linker) {
138 if (linker) {
139 mNonDetExpansionLinker = linker->append(mNonDetExpansionLinker);
140 }
141 return this;
142 }
143
144
145 }; // end namespace Process
146
147 }; // end namespace Kernel
148
149 }; // end namespace Reasoner
150
151 }; // end namespace Konclude