Debian Codegraph @

Source/Reasoner/Classifier/CClassificationSatisfiableCalculationData.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 "CClassificationSatisfiableCalculationData.h"
22 #include "Reasoner/Kernel/Task/CSatisfiableCalculationTask.h"
23
24
25 namespace Konclude {
26
27 namespace Reasoner {
28
29 namespace Classifier {
30
31
32 CClassificationSatisfiableCalculationData::CClassificationSatisfiableCalculationData() {
33 mSatCalcedTask = nullptr;
34 mSatCalcedJob = nullptr;
35 mPrevData = nullptr;
36 mDependendCalculationCount = 0;
37 }
38
39
40 bool CClassificationSatisfiableCalculationData::hasSatisfiableCalculationTask() {
41 return mSatCalcedTask != nullptr;
42 }
43
44 CSatisfiableCalculationTask* CClassificationSatisfiableCalculationData::getSatisfiableCalculationTask() {
45 return mSatCalcedTask;
46 }
47
48 CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::setSatisfiableCalculationTask(CSatisfiableCalculationTask* task) {
49 mSatCalcedTask = task;
50 mSatCalcedJob = mSatCalcedTask;
51 return this;
52 }
53
54
55 bool CClassificationSatisfiableCalculationData::hasSatisfiableCalculationJobInstantiation() {
56 return mSatCalcedJob != nullptr;
57 }
58
59
60
61 bool CClassificationSatisfiableCalculationData::clearSatisfiableCalculationJobInstantiation() {
62 bool cleared = false;
63 if (mSatCalcedTask) {
64 CNewAllocationMemoryPoolProvider tmpProv;
65 tmpProv.releaseMemoryPool(mSatCalcedTask->getMemoryPools());
66 mSatCalcedTask = nullptr;
67 mSatCalcedJob = nullptr;
68 cleared = true;
69 }
70 return cleared;
71 }
72
73 CSatisfiableCalculationJobInstantiation* CClassificationSatisfiableCalculationData::getSatisfiableCalculationJobInstantiation() {
74 return mSatCalcedJob;
75 }
76
77
78 CTaskPreyingListner* CClassificationSatisfiableCalculationData::tellPreyedSatisfialbeTask(CSatisfiableCalculationTask* task) {
79 task->getTaskStatus()->setMemoryReleaseable(false);
80 setSatisfiableCalculationTask(task);
81 return this;
82 }
83
84
85 CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::getPreviousCalculationData() {
86 return mPrevData;
87 }
88
89 CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::setPreviousCalculationData(CClassificationSatisfiableCalculationData* data) {
90 mPrevData = data;
91 return this;
92 }
93
94 cint64 CClassificationSatisfiableCalculationData::getDependendCalculationCount() {
95 return mDependendCalculationCount;
96 }
97
98 CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::incDependendCalculationCount(cint64 incCount) {
99 mDependendCalculationCount += incCount;
100 return this;
101 }
102
103 bool CClassificationSatisfiableCalculationData::decDependendCalculationCount(cint64 decCount) {
104 mDependendCalculationCount -= decCount;
105 return mDependendCalculationCount <= 0;
106 }
107
108
109 }; // end namespace Classifier
110
111 }; // end namespace Reasoner
112
113 }; // end namespace Konclude