| 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 "CBlockingIndividualNodeCandidateData.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Process { |
| 31 |
|
| 32 |
|
| 33 |
CBlockingIndividualNodeCandidateData::CBlockingIndividualNodeCandidateData(CProcessContext* context) : mContext(context),mCandidateIndiMap(context) { |
| 34 |
mMemMan = mContext->getUsedMemoryAllocationManager(); |
| 35 |
} |
| 36 |
|
| 37 |
CBlockingIndividualNodeCandidateData::~CBlockingIndividualNodeCandidateData() { |
| 38 |
} |
| 39 |
|
| 40 |
CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateData::initBlockingCandidateData(CBlockingIndividualNodeCandidateData* prevBlockCandHash) { |
| 41 |
if (prevBlockCandHash) { |
| 42 |
mCandidateIndiMap = prevBlockCandHash->mCandidateIndiMap; |
| 43 |
mMaxValidIndividualID = prevBlockCandHash->mMaxValidIndividualID; |
| 44 |
} else { |
| 45 |
mMaxValidIndividualID = 0; |
| 46 |
mCandidateIndiMap.clear(); |
| 47 |
} |
| 48 |
return this; |
| 49 |
} |
| 50 |
|
| 51 |
|
| 52 |
CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateData::insertBlockingCandidateIndividualNode(CIndividualProcessNode* candidateIndi) { |
| 53 |
cint64 candidateIndividualID = candidateIndi->getIndividualNodeID(); |
| 54 |
mCandidateIndiMap.insert(-candidateIndividualID,candidateIndi); |
| 55 |
return this; |
| 56 |
} |
| 57 |
|
| 58 |
CBlockingIndividualNodeCandidateIterator CBlockingIndividualNodeCandidateData::getBlockingCandidatesIndividualNodeIterator(cint64 candidateIndividualID) { |
| 59 |
return CBlockingIndividualNodeCandidateIterator(&mCandidateIndiMap,candidateIndividualID); |
| 60 |
} |
| 61 |
|
| 62 |
CBlockingIndividualNodeCandidateIterator CBlockingIndividualNodeCandidateData::getBlockingCandidatesIndividualNodeIterator(CIndividualProcessNode* candidateIndi) { |
| 63 |
return getBlockingCandidatesIndividualNodeIterator(candidateIndi->getIndividualNodeID()); |
| 64 |
} |
| 65 |
|
| 66 |
cint64 CBlockingIndividualNodeCandidateData::getMaxValidIndividualID() { |
| 67 |
return mMaxValidIndividualID; |
| 68 |
} |
| 69 |
|
| 70 |
CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateData::setMaxValidIndividualID(cint64 indiID) { |
| 71 |
mMaxValidIndividualID = indiID; |
| 72 |
return this; |
| 73 |
} |
| 74 |
|
| 75 |
|
| 76 |
}; // end namespace Process |
| 77 |
|
| 78 |
}; // end namespace Kernel |
| 79 |
|
| 80 |
}; // end namespace Reasoner |
| 81 |
|
| 82 |
}; // end namespace Konclude |