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
|
/*
* Copyright (C) 2013-2015, 2019 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 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* 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. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CClassificationSatisfiableCalculationData.h"
#include "Reasoner/Kernel/Task/CSatisfiableCalculationTask.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
CClassificationSatisfiableCalculationData::CClassificationSatisfiableCalculationData() {
mSatCalcedTask = nullptr;
mSatCalcedJob = nullptr;
mPrevData = nullptr;
mDependendCalculationCount = 0;
}
bool CClassificationSatisfiableCalculationData::hasSatisfiableCalculationTask() {
return mSatCalcedTask != nullptr;
}
CSatisfiableCalculationTask* CClassificationSatisfiableCalculationData::getSatisfiableCalculationTask() {
return mSatCalcedTask;
}
CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::setSatisfiableCalculationTask(CSatisfiableCalculationTask* task) {
mSatCalcedTask = task;
mSatCalcedJob = mSatCalcedTask;
return this;
}
bool CClassificationSatisfiableCalculationData::hasSatisfiableCalculationJobInstantiation() {
return mSatCalcedJob != nullptr;
}
bool CClassificationSatisfiableCalculationData::clearSatisfiableCalculationJobInstantiation() {
bool cleared = false;
if (mSatCalcedTask) {
CNewAllocationMemoryPoolProvider tmpProv;
tmpProv.releaseMemoryPool(mSatCalcedTask->getMemoryPools());
mSatCalcedTask = nullptr;
mSatCalcedJob = nullptr;
cleared = true;
}
return cleared;
}
CSatisfiableCalculationJobInstantiation* CClassificationSatisfiableCalculationData::getSatisfiableCalculationJobInstantiation() {
return mSatCalcedJob;
}
CTaskPreyingListner* CClassificationSatisfiableCalculationData::tellPreyedSatisfialbeTask(CSatisfiableCalculationTask* task) {
task->getTaskStatus()->setMemoryReleaseable(false);
setSatisfiableCalculationTask(task);
return this;
}
CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::getPreviousCalculationData() {
return mPrevData;
}
CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::setPreviousCalculationData(CClassificationSatisfiableCalculationData* data) {
mPrevData = data;
return this;
}
cint64 CClassificationSatisfiableCalculationData::getDependendCalculationCount() {
return mDependendCalculationCount;
}
CClassificationSatisfiableCalculationData* CClassificationSatisfiableCalculationData::incDependendCalculationCount(cint64 incCount) {
mDependendCalculationCount += incCount;
return this;
}
bool CClassificationSatisfiableCalculationData::decDependendCalculationCount(cint64 decCount) {
mDependendCalculationCount -= decCount;
return mDependendCalculationCount <= 0;
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|