| 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 "CIndividualNodeSatisfiableExpandingCacheStoringData.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Process { |
| 31 |
|
| 32 |
|
| 33 |
CIndividualNodeSatisfiableExpandingCacheStoringData::CIndividualNodeSatisfiableExpandingCacheStoringData() { |
| 34 |
} |
| 35 |
|
| 36 |
|
| 37 |
CIndividualNodeSatisfiableExpandingCacheStoringData::~CIndividualNodeSatisfiableExpandingCacheStoringData() { |
| 38 |
} |
| 39 |
|
| 40 |
|
| 41 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::initSatisfiableExpandingCacheRetrievalData(CIndividualNodeSatisfiableExpandingCacheStoringData* prevData) { |
| 42 |
if (prevData) { |
| 43 |
mNodeSuccBranched = prevData->mNodeSuccBranched; |
| 44 |
mPrevCached = prevData->mPrevCached; |
| 45 |
mCachingError = prevData->mCachingError; |
| 46 |
mLastCachedSignature = prevData->mLastCachedSignature; |
| 47 |
mMinNodeBranchingTag = prevData->mMinNodeBranchingTag; |
| 48 |
mLastCachedConDes = prevData->mLastCachedConDes; |
| 49 |
mPrevSatCached = prevData->mPrevSatCached; |
| 50 |
} else { |
| 51 |
mNodeSuccBranched = false; |
| 52 |
mPrevCached = false; |
| 53 |
mCachingError = false; |
| 54 |
mPrevSatCached = false; |
| 55 |
mLastCachedSignature = 0; |
| 56 |
mMinNodeBranchingTag = -1; |
| 57 |
mLastCachedConDes = nullptr; |
| 58 |
} |
| 59 |
return this; |
| 60 |
} |
| 61 |
|
| 62 |
|
| 63 |
|
| 64 |
|
| 65 |
bool CIndividualNodeSatisfiableExpandingCacheStoringData::hasIndividualNodeOrSuccessorBranchedConcept() { |
| 66 |
return mNodeSuccBranched; |
| 67 |
} |
| 68 |
|
| 69 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setIndividualNodeOrSuccessorBranchedConcept(bool branched) { |
| 70 |
mNodeSuccBranched = branched; |
| 71 |
return this; |
| 72 |
} |
| 73 |
|
| 74 |
bool CIndividualNodeSatisfiableExpandingCacheStoringData::hasPreviousCached() { |
| 75 |
return mPrevCached; |
| 76 |
} |
| 77 |
|
| 78 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setPreviousCached(bool cached) { |
| 79 |
mPrevCached = cached; |
| 80 |
return this; |
| 81 |
} |
| 82 |
|
| 83 |
cint64 CIndividualNodeSatisfiableExpandingCacheStoringData::getLastCachedSignature() { |
| 84 |
return mLastCachedSignature; |
| 85 |
} |
| 86 |
|
| 87 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setLastCachedSignature(cint64 signature) { |
| 88 |
mLastCachedSignature = signature; |
| 89 |
return this; |
| 90 |
} |
| 91 |
|
| 92 |
CConceptDescriptor* CIndividualNodeSatisfiableExpandingCacheStoringData::getLastCachedConceptDescriptor() { |
| 93 |
return mLastCachedConDes; |
| 94 |
} |
| 95 |
|
| 96 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setLastCachedConceptDescriptor(CConceptDescriptor* conDes) { |
| 97 |
mLastCachedConDes = conDes; |
| 98 |
return this; |
| 99 |
} |
| 100 |
|
| 101 |
cint64 CIndividualNodeSatisfiableExpandingCacheStoringData::getMinimalIndividualNodeBranchingTag() { |
| 102 |
return mMinNodeBranchingTag; |
| 103 |
} |
| 104 |
|
| 105 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setMinimalIndividualNodeBranchingTag(cint64 branchingTag) { |
| 106 |
mMinNodeBranchingTag = branchingTag; |
| 107 |
return this; |
| 108 |
} |
| 109 |
|
| 110 |
bool CIndividualNodeSatisfiableExpandingCacheStoringData::hasCachingError() { |
| 111 |
return mCachingError; |
| 112 |
} |
| 113 |
|
| 114 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setCachingError(bool error) { |
| 115 |
mCachingError = error; |
| 116 |
return this; |
| 117 |
} |
| 118 |
|
| 119 |
bool CIndividualNodeSatisfiableExpandingCacheStoringData::hasPreviousSatisfiableCached() { |
| 120 |
return mPrevSatCached; |
| 121 |
} |
| 122 |
|
| 123 |
CIndividualNodeSatisfiableExpandingCacheStoringData* CIndividualNodeSatisfiableExpandingCacheStoringData::setPreviousSatisfiableCached(bool cached) { |
| 124 |
mPrevSatCached = cached; |
| 125 |
return this; |
| 126 |
} |
| 127 |
|
| 128 |
|
| 129 |
}; // end namespace Process |
| 130 |
|
| 131 |
}; // end namespace Kernel |
| 132 |
|
| 133 |
}; // end namespace Reasoner |
| 134 |
|
| 135 |
}; // end namespace Konclude |