| 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 "CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Process { |
| 31 |
|
| 32 |
|
| 33 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData() { |
| 34 |
mInitializedNodeLinker = nullptr; |
| 35 |
mRootQueuingNodeLinker = nullptr; |
| 36 |
mBranchQueuingNodeLinker = nullptr; |
| 37 |
mOnlyConceptSetProcessedCount = 0; |
| 38 |
mQueuedNodeInitializingCount = 0; |
| 39 |
} |
| 40 |
|
| 41 |
CXLinker<CIndividualProcessNode*>* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::getInitializedNodeLinker() { |
| 42 |
return mInitializedNodeLinker; |
| 43 |
} |
| 44 |
|
| 45 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::appendInitializedNodeLinker(CXLinker<CIndividualProcessNode*>* indiNodeLinker) { |
| 46 |
if (indiNodeLinker) { |
| 47 |
mInitializedNodeLinker = indiNodeLinker->append(mInitializedNodeLinker); |
| 48 |
} |
| 49 |
return this; |
| 50 |
} |
| 51 |
|
| 52 |
cint64 CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::getOnlyConceptSetProcessedCount() { |
| 53 |
return mOnlyConceptSetProcessedCount; |
| 54 |
} |
| 55 |
|
| 56 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::incOnlyConceptSetProcessedCount(cint64 count) { |
| 57 |
mOnlyConceptSetProcessedCount += count; |
| 58 |
return this; |
| 59 |
} |
| 60 |
|
| 61 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::decOnlyConceptSetProcessedCount(cint64 count) { |
| 62 |
mOnlyConceptSetProcessedCount -= count; |
| 63 |
return this; |
| 64 |
} |
| 65 |
|
| 66 |
|
| 67 |
|
| 68 |
CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::getRootQueuingNodeLinker() { |
| 69 |
return mRootQueuingNodeLinker; |
| 70 |
} |
| 71 |
|
| 72 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::appendRootQueuingNodeLinker(CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker* indiNodeLinker) { |
| 73 |
if (indiNodeLinker) { |
| 74 |
mRootQueuingNodeLinker = indiNodeLinker->append(mRootQueuingNodeLinker); |
| 75 |
} |
| 76 |
return this; |
| 77 |
} |
| 78 |
|
| 79 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::setRootQueuingNodeLinker(CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker* indiNodeLinker) { |
| 80 |
mRootQueuingNodeLinker = indiNodeLinker; |
| 81 |
return this; |
| 82 |
} |
| 83 |
|
| 84 |
|
| 85 |
|
| 86 |
cint64 CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::getQueuedNodeInitializingCount() { |
| 87 |
return mQueuedNodeInitializingCount; |
| 88 |
} |
| 89 |
|
| 90 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::incQueuedNodeInitializingCount(cint64 count) { |
| 91 |
mQueuedNodeInitializingCount += count; |
| 92 |
return this; |
| 93 |
} |
| 94 |
|
| 95 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::decQueuedNodeInitializingCount(cint64 count) { |
| 96 |
if (mQueuedNodeInitializingCount >= count) { |
| 97 |
mQueuedNodeInitializingCount -= count; |
| 98 |
} |
| 99 |
return this; |
| 100 |
} |
| 101 |
|
| 102 |
|
| 103 |
CXLinker<CIndividualProcessNode*>* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::getBranchQueuingNodeLinker() { |
| 104 |
return mBranchQueuingNodeLinker; |
| 105 |
} |
| 106 |
|
| 107 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::appendBranchQueuingNodeLinker(CXLinker<CIndividualProcessNode*>* indiNodeLinker) { |
| 108 |
mBranchQueuingNodeLinker = indiNodeLinker->append(mBranchQueuingNodeLinker); |
| 109 |
return this; |
| 110 |
} |
| 111 |
|
| 112 |
CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData* CIndividualRepresentativeBackendCacheConceptSetLabelProcessingData::setBranchQueuingNodeLinker(CXLinker<CIndividualProcessNode*>* indiNodeLinker) { |
| 113 |
mBranchQueuingNodeLinker = indiNodeLinker; |
| 114 |
return this; |
| 115 |
} |
| 116 |
|
| 117 |
|
| 118 |
}; // end namespace Process |
| 119 |
|
| 120 |
}; // end namespace Kernel |
| 121 |
|
| 122 |
}; // end namespace Reasoner |
| 123 |
|
| 124 |
}; // end namespace Konclude |