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
|
/*
* Copyright (C) 2013, 2014, 2015 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 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* 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. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CBlockingIndividualNodeCandidateData.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Process {
CBlockingIndividualNodeCandidateData::CBlockingIndividualNodeCandidateData(CProcessContext* context) : mContext(context),mCandidateIndiMap(context) {
mMemMan = mContext->getUsedMemoryAllocationManager();
}
CBlockingIndividualNodeCandidateData::~CBlockingIndividualNodeCandidateData() {
}
CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateData::initBlockingCandidateData(CBlockingIndividualNodeCandidateData* prevBlockCandHash) {
if (prevBlockCandHash) {
mCandidateIndiMap = prevBlockCandHash->mCandidateIndiMap;
mMaxValidIndividualID = prevBlockCandHash->mMaxValidIndividualID;
} else {
mMaxValidIndividualID = -1;
mCandidateIndiMap.clear();
}
return this;
}
CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateData::insertBlockingCandidateIndividualNode(CIndividualProcessNode* candidateIndi) {
cint64 candidateIndividualID = candidateIndi->getIndividualID();
mCandidateIndiMap.insert(-candidateIndividualID,candidateIndi);
return this;
}
CBlockingIndividualNodeCandidateIterator CBlockingIndividualNodeCandidateData::getBlockingCandidatesIndividualNodeIterator(cint64 candidateIndividualID) {
return CBlockingIndividualNodeCandidateIterator(&mCandidateIndiMap,candidateIndividualID);
}
CBlockingIndividualNodeCandidateIterator CBlockingIndividualNodeCandidateData::getBlockingCandidatesIndividualNodeIterator(CIndividualProcessNode* candidateIndi) {
return getBlockingCandidatesIndividualNodeIterator(candidateIndi->getIndividualID());
}
cint64 CBlockingIndividualNodeCandidateData::getMaxValidIndividualID() {
return mMaxValidIndividualID;
}
CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateData::setMaxValidIndividualID(cint64 indiID) {
mMaxValidIndividualID = indiID;
return this;
}
}; // end namespace Process
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
