Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualNodeBlockingTestData.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 "CIndividualNodeBlockingTestData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CIndividualNodeBlockingTestData::CIndividualNodeBlockingTestData() {
34 mBlockingIndiNode = nullptr;
35 //mFirstEntailedAncestorDepth = 0;
36 //mConceptDes = 0;
37 }
38
39
40 CIndividualNodeBlockingTestData::~CIndividualNodeBlockingTestData() {
41 }
42
43 CIndividualNodeBlockingTestData* CIndividualNodeBlockingTestData::initBlockData(CIndividualNodeBlockingTestData* prevBlockData) {
44 if (prevBlockData) {
45 mBlockingIndiNode = prevBlockData->mBlockingIndiNode;
46 mLastAddedCoreConDes = prevBlockData->mLastAddedCoreConDes;
47 mLastCoreBlockCandConDes = prevBlockData->mLastCoreBlockCandConDes;
48 mLastCoreBlockCandNodeDiff = prevBlockData->mLastCoreBlockCandNodeDiff;
49 } else {
50 mBlockingIndiNode = nullptr;
51 mLastAddedCoreConDes = nullptr;
52 mLastCoreBlockCandConDes = nullptr;
53 mLastCoreBlockCandNodeDiff = 0;
54 }
55 return this;
56 }
57
58 CIndividualProcessNode* CIndividualNodeBlockingTestData::getBlockingIndividualNode() {
59 return mBlockingIndiNode;
60 }
61
62
63 CIndividualNodeBlockingTestData* CIndividualNodeBlockingTestData::clearBlockingIndividualNode() {
64 mBlockingIndiNode = nullptr;
65 return this;
66 }
67
68
69 CIndividualNodeBlockingTestData* CIndividualNodeBlockingTestData::setBlockingIndividualNode(CIndividualProcessNode* blockingIndividualNode) {
70 mBlockingIndiNode = blockingIndividualNode;
71 return this;
72 }
73
74
75 CConceptDescriptor* CIndividualNodeBlockingTestData::getLastCoreBlockingCandidateConceptDescriptor() {
76 return mLastCoreBlockCandConDes;
77 }
78
79 CIndividualNodeBlockingTestData* CIndividualNodeBlockingTestData::setLastCoreBlockingCandidateConceptDescriptor(CConceptDescriptor* lastCoreBlockCandConDes) {
80 mLastCoreBlockCandConDes = lastCoreBlockCandConDes;
81 return this;
82 }
83
84
85 cint64 CIndividualNodeBlockingTestData::getLastCoreBlockingCandidateConceptNodeDifference() {
86 return mLastCoreBlockCandNodeDiff;
87 }
88
89 CIndividualNodeBlockingTestData* CIndividualNodeBlockingTestData::setLastCoreBlockingCandidateConceptNodeDifference(cint64 diffCount) {
90 mLastCoreBlockCandNodeDiff = diffCount;
91 return this;
92 }
93
94 CCoreConceptDescriptor* CIndividualNodeBlockingTestData::getLastAddedCoreConceptDescriptor() {
95 return mLastAddedCoreConDes;
96 }
97
98 CIndividualNodeBlockingTestData* CIndividualNodeBlockingTestData::setLastAddedCoreConceptDescriptor(CCoreConceptDescriptor* lastCoreConDes) {
99 mLastAddedCoreConDes = lastCoreConDes;
100 return this;
101 }
102
103
104 }; // end namespace Process
105
106 }; // end namespace Kernel
107
108 }; // end namespace Reasoner
109
110 }; // end namespace Konclude