Debian Codegraph @

Source/Reasoner/Kernel/Process/CSaturationIndividualNodeALLConceptsExtensionData.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 "CSaturationIndividualNodeALLConceptsExtensionData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CSaturationIndividualNodeALLConceptsExtensionData::CSaturationIndividualNodeALLConceptsExtensionData(CProcessContext* processContext) : mLinkedSuccIdnALLConceptExtHash(processContext) {
34 mProcessContext = processContext;
35 }
36
37 CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::initALLConceptsExtensionData(CIndividualSaturationProcessNode* indiProcessNode) {
38 mLinkedSuccIdnALLConceptExtHash.initLinkedSuccessorIndividualALLConceptsExtensionHash();
39 mIndiProcessNode = indiProcessNode;
40 mRoleProcessLinker = nullptr;
41 mSuccessorExtensionInitialized = false;
42 mExtensionProcessingQueued = false;
43 mExtensionProcessLinker = nullptr;
44 return this;
45 }
46
47 CRoleSaturationProcessLinker* CSaturationIndividualNodeALLConceptsExtensionData::getRoleProcessLinker() {
48 return mRoleProcessLinker;
49 }
50
51 CRoleSaturationProcessLinker* CSaturationIndividualNodeALLConceptsExtensionData::takeRoleProcessLinker() {
52 CRoleSaturationProcessLinker* tmpRoleProcessLinker = mRoleProcessLinker;
53 mRoleProcessLinker = nullptr;
54 return tmpRoleProcessLinker;
55 }
56
57 bool CSaturationIndividualNodeALLConceptsExtensionData::isSuccessorExtensionInitialized() {
58 return mSuccessorExtensionInitialized;
59 }
60
61 CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::setSuccessorExtensionInitialized(bool initialized) {
62 mSuccessorExtensionInitialized = initialized;
63 return this;
64 }
65
66 CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::addRoleProcessLinker(CRoleSaturationProcessLinker* roleProcessLinker) {
67 if (roleProcessLinker) {
68 mRoleProcessLinker = roleProcessLinker->append(mRoleProcessLinker);
69 }
70 return this;
71 }
72
73 bool CSaturationIndividualNodeALLConceptsExtensionData::hasProcessLinkerForRole(CRole* role) {
74 cint64 maxTestCount = 10;
75 for (CRoleSaturationProcessLinker* roleProcessLinkerIt = mRoleProcessLinker; roleProcessLinkerIt && --maxTestCount > 0; roleProcessLinkerIt = roleProcessLinkerIt->getNext()) {
76 if (roleProcessLinkerIt->getRole() == role) {
77 return true;
78 }
79 }
80 return false;
81 }
82
83 bool CSaturationIndividualNodeALLConceptsExtensionData::isExtensionProcessingQueued() {
84 return mExtensionProcessingQueued;
85 }
86
87 CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::setExtensionProcessingQueued(bool queued) {
88 mExtensionProcessingQueued = queued;
89 return this;
90 }
91
92 CSaturationLinkedSuccessorIndividualALLConceptsExtensionHash* CSaturationIndividualNodeALLConceptsExtensionData::getLinkedSuccessorIndividualALLConceptsExtensionHash() {
93 return &mLinkedSuccIdnALLConceptExtHash;
94 }
95
96 CSaturationLinkedSuccessorIndividualALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::getALLConceptsExtensionData(CIndividualSaturationProcessNode* indiNode, bool create) {
97 return mLinkedSuccIdnALLConceptExtHash.getALLConceptsExtensionData(indiNode,create);
98 }
99
100 bool CSaturationIndividualNodeALLConceptsExtensionData::hasExtensionProcessData() {
101 return mExtensionProcessLinker != nullptr;
102 }
103
104 CSaturationSuccessorALLConceptExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::takeNextExtensionProcessData() {
105 CSaturationSuccessorALLConceptExtensionData* tmpExtProcessLinker = mExtensionProcessLinker;
106 if (mExtensionProcessLinker) {
107 mExtensionProcessLinker = mExtensionProcessLinker->getNext();
108 tmpExtProcessLinker->clearNext();
109 }
110 return tmpExtProcessLinker;
111 }
112
113 CSaturationSuccessorALLConceptExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::getExtensionProcessDataLinker() {
114 return mExtensionProcessLinker;
115 }
116
117 CSaturationIndividualNodeALLConceptsExtensionData* CSaturationIndividualNodeALLConceptsExtensionData::addExtensionProcessData(CSaturationSuccessorALLConceptExtensionData* processData) {
118 mExtensionProcessLinker = processData->append(mExtensionProcessLinker);
119 return this;
120 }
121
122 }; // end namespace Process
123
124 }; // end namespace Kernel
125
126 }; // end namespace Reasoner
127
128 }; // end namespace Konclude