| 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 "CIncrementalConsistenceTaskData.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Task { |
| 31 |
|
| 32 |
CIncrementalConsistenceTaskData::CIncrementalConsistenceTaskData(CSatisfiableCalculationTask* detSatTask, CSatisfiableCalculationTask* graphCachedSatTask, CConcreteOntology* prevOntology, CConsistenceTaskData* prevConsData) : CConsistenceTaskData(detSatTask,graphCachedSatTask) { |
| 33 |
mPrevOntology = prevOntology; |
| 34 |
mPrevConsData = prevConsData; |
| 35 |
mTotalNodeCount = 0; |
| 36 |
mAddedNodeCount = 0; |
| 37 |
mPreviousNodeCount = 0; |
| 38 |
} |
| 39 |
|
| 40 |
|
| 41 |
CIncrementalConsistenceTaskData::~CIncrementalConsistenceTaskData() { |
| 42 |
} |
| 43 |
|
| 44 |
|
| 45 |
QSet<cint64>* CIncrementalConsistenceTaskData::getIndirectlyChangedNodeSet() { |
| 46 |
return &mIndirectlyChangedNodeSet; |
| 47 |
} |
| 48 |
|
| 49 |
QSet<cint64>* CIncrementalConsistenceTaskData::getDeterministicallyChangedNodeSet() { |
| 50 |
return &mDeterministicallyChangedNodeSet; |
| 51 |
} |
| 52 |
|
| 53 |
|
| 54 |
QSet<cint64>* CIncrementalConsistenceTaskData::getChangedCompatibleNodeSet() { |
| 55 |
return &mChangedCompatibleNodeSet; |
| 56 |
} |
| 57 |
|
| 58 |
CConcreteOntology* CIncrementalConsistenceTaskData::getPreviousOntology() { |
| 59 |
return mPrevOntology; |
| 60 |
} |
| 61 |
|
| 62 |
CConsistenceTaskData* CIncrementalConsistenceTaskData::getPreviousConsistenceData() { |
| 63 |
return mPrevConsData; |
| 64 |
} |
| 65 |
|
| 66 |
CIncrementalConsistenceTaskData* CIncrementalConsistenceTaskData::setPreviousOntology(CConcreteOntology* prevOntology) { |
| 67 |
mPrevOntology = prevOntology; |
| 68 |
return this; |
| 69 |
} |
| 70 |
|
| 71 |
CIncrementalConsistenceTaskData* CIncrementalConsistenceTaskData::setPreviousConsistenceData(CConsistenceTaskData* prevConsData) { |
| 72 |
mPrevConsData = prevConsData; |
| 73 |
return this; |
| 74 |
} |
| 75 |
|
| 76 |
cint64 CIncrementalConsistenceTaskData::getAddedNodeCount() { |
| 77 |
return mAddedNodeCount; |
| 78 |
} |
| 79 |
|
| 80 |
cint64 CIncrementalConsistenceTaskData::getTotalNodeCount() { |
| 81 |
return mTotalNodeCount; |
| 82 |
} |
| 83 |
|
| 84 |
cint64 CIncrementalConsistenceTaskData::getPreviousNodeCount() { |
| 85 |
return mPreviousNodeCount; |
| 86 |
} |
| 87 |
|
| 88 |
cint64 CIncrementalConsistenceTaskData::getChangedCompatibleNodeCount() { |
| 89 |
return mChangedCompatibleNodeSet.count(); |
| 90 |
} |
| 91 |
|
| 92 |
cint64 CIncrementalConsistenceTaskData::getDeterministicallyChangedNodeCount() { |
| 93 |
return mDeterministicallyChangedNodeSet.count(); |
| 94 |
} |
| 95 |
|
| 96 |
cint64 CIncrementalConsistenceTaskData::getIndirectlyChangedCount() { |
| 97 |
return mIndirectlyChangedNodeSet.count(); |
| 98 |
} |
| 99 |
|
| 100 |
|
| 101 |
CIncrementalConsistenceTaskData* CIncrementalConsistenceTaskData::setAddedNodeCount(cint64 addedNodeCount) { |
| 102 |
mAddedNodeCount = addedNodeCount; |
| 103 |
return this; |
| 104 |
} |
| 105 |
|
| 106 |
CIncrementalConsistenceTaskData* CIncrementalConsistenceTaskData::setTotalNodeCount(cint64 totalNodeCount) { |
| 107 |
mTotalNodeCount = totalNodeCount; |
| 108 |
return this; |
| 109 |
} |
| 110 |
|
| 111 |
CIncrementalConsistenceTaskData* CIncrementalConsistenceTaskData::setPreviousNodeCount(cint64 prevNodeCount) { |
| 112 |
mPreviousNodeCount = prevNodeCount; |
| 113 |
return this; |
| 114 |
} |
| 115 |
|
| 116 |
}; // end namespace Task |
| 117 |
|
| 118 |
}; // end namespace Kernel |
| 119 |
|
| 120 |
}; // end namespace Reasoner |
| 121 |
|
| 122 |
}; // end namespace Konclude |