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
|
/*
* 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 "CSaturationIndividualNodeALLConceptsExtensionData.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CSaturationIndividualNodeALLConceptsExtensionData::CSaturationIndividualNodeALLConceptsExtensionData(CProcessContext* processContext) : mLinkedSuccIdnALLConceptExtHash(processContext) {
mProcessContext = processContext;
}
CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::initALLConceptsExtensionData(CIndividualSaturationProcessNode* indiProcessNode) {
mLinkedSuccIdnALLConceptExtHash.initLinkedSuccessorIndividualALLConceptsExtensionHash();
mIndiProcessNode = indiProcessNode;
mRoleProcessLinker = nullptr;
mSuccessorExtensionInitialized = false;
mExtensionProcessingQueued = false;
mExtensionProcessLinker = nullptr;
return this;
}
CRoleSaturationProcessLinker* CSaturationIndividualNodeALLConceptsExtensionData::getRoleProcessLinker() {
return mRoleProcessLinker;
}
CRoleSaturationProcessLinker* CSaturationIndividualNodeALLConceptsExtensionData::takeRoleProcessLinker() {
CRoleSaturationProcessLinker* tmpRoleProcessLinker = mRoleProcessLinker;
mRoleProcessLinker = nullptr;
return tmpRoleProcessLinker;
}
bool CSaturationIndividualNodeALLConceptsExtensionData::isSuccessorExtensionInitialized() {
return mSuccessorExtensionInitialized;
}
CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::setSuccessorExtensionInitialized(bool initialized) {
mSuccessorExtensionInitialized = initialized;
return this;
}
CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::addRoleProcessLinker(CRoleSaturationProcessLinker* roleProcessLinker) {
if (roleProcessLinker) {
mRoleProcessLinker = roleProcessLinker->append(mRoleProcessLinker);
}
return this;
}
bool CSaturationIndividualNodeALLConceptsExtensionData::hasProcessLinkerForRole(CRole* role) {
cint64 maxTestCount = 10;
for (CRoleSaturationProcessLinker* roleProcessLinkerIt = mRoleProcessLinker; roleProcessLinkerIt && --maxTestCount > 0; roleProcessLinkerIt = roleProcessLinkerIt->getNext()) {
if (roleProcessLinkerIt->getRole() == role) {
return true;
}
}
return false;
}
bool CSaturationIndividualNodeALLConceptsExtensionData::isExtensionProcessingQueued() {
return mExtensionProcessingQueued;
}
CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::setExtensionProcessingQueued(bool queued) {
mExtensionProcessingQueued = queued;
return this;
}
CSaturationLinkedSuccessorIndividualALLConceptsExtensionHash* CSaturationIndividualNodeALLConceptsExtensionData::getLinkedSuccessorIndividualALLConceptsExtensionHash() {
return &mLinkedSuccIdnALLConceptExtHash;
}
CSaturationLinkedSuccessorIndividualALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::getALLConceptsExtensionData(CIndividualSaturationProcessNode* indiNode, bool create) {
return mLinkedSuccIdnALLConceptExtHash.getALLConceptsExtensionData(indiNode,create);
}
bool CSaturationIndividualNodeALLConceptsExtensionData::hasExtensionProcessData() {
return mExtensionProcessLinker != nullptr;
}
CSaturationSuccessorALLConceptExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::takeNextExtensionProcessData() {
CSaturationSuccessorALLConceptExtensionData* tmpExtProcessLinker = mExtensionProcessLinker;
if (mExtensionProcessLinker) {
mExtensionProcessLinker = mExtensionProcessLinker->getNext();
tmpExtProcessLinker->clearNext();
}
return tmpExtProcessLinker;
}
CSaturationSuccessorALLConceptExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::getExtensionProcessDataLinker() {
return mExtensionProcessLinker;
}
CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::addExtensionProcessData(CSaturationSuccessorALLConceptExtensionData* processData) {
mExtensionProcessLinker = processData->append(mExtensionProcessLinker);
return this;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
