Debian Codegraph @

Source/Reasoner/Kernel/Process/CBlockingIndividualNodeLinkedCandidateData.cpp

raw
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 "CBlockingIndividualNodeLinkedCandidateData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CBlockingIndividualNodeLinkedCandidateData::CBlockingIndividualNodeLinkedCandidateData(CProcessContext* context) : mContext(context) {
34 mMemMan = mContext->getUsedMemoryAllocationManager();
35 }
36
37 CBlockingIndividualNodeLinkedCandidateData::~CBlockingIndividualNodeLinkedCandidateData() {
38 }
39
40 CBlockingIndividualNodeLinkedCandidateData* CBlockingIndividualNodeLinkedCandidateData::initBlockingCandidateData(CBlockingIndividualNodeLinkedCandidateData* prevBlockCandData) {
41 if (prevBlockCandData) {
42 mCandidateCount = prevBlockCandData->mCandidateCount;
43 mCandLinker = prevBlockCandData->mCandLinker;
44 } else {
45 mCandidateCount = 0;
46 mCandLinker = nullptr;
47 }
48 return this;
49 }
50
51
52 CBlockingIndividualNodeLinkedCandidateData* CBlockingIndividualNodeLinkedCandidateData::addBlockingCandidateIndividualNode(CIndividualProcessNode* candidateIndi) {
53 CBlockingIndividualNodeLinker* linker = CObjectAllocator<CBlockingIndividualNodeLinker>::allocateAndConstruct(mMemMan);
54 linker->initBlockingIndividualNodeLinker(candidateIndi);
55 mCandLinker = linker->append(mCandLinker);
56 ++mCandidateCount;
57 return this;
58 }
59
60 CBlockingIndividualNodeLinker* CBlockingIndividualNodeLinkedCandidateData::getBlockingCandidatesIndividualNodeLinker() {
61 return mCandLinker;
62 }
63
64
65 cint64 CBlockingIndividualNodeLinkedCandidateData::getCandidateCount() {
66 return mCandidateCount;
67 }
68
69 CBlockingIndividualNodeLinkedCandidateData* CBlockingIndividualNodeLinkedCandidateData::setCandidateCount(cint64 candCount) {
70 mCandidateCount = candCount;
71 return this;
72 }
73
74
75 }; // end namespace Process
76
77 }; // end namespace Kernel
78
79 }; // end namespace Reasoner
80
81 }; // end namespace Konclude