Debian Codegraph @

Source/Reasoner/Kernel/Process/CBlockingIndividualNodeCandidateHash.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 "CBlockingIndividualNodeCandidateHash.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CBlockingIndividualNodeCandidateHash::CBlockingIndividualNodeCandidateHash(CProcessContext* context) : mContext(context) {
34 mMemMan = mContext->getUsedMemoryAllocationManager();
35 mBlockCandidateHash = nullptr;
36 mUseBlockCandidateHash = nullptr;
37 mPrevBlockCandidateHash = nullptr;
38 }
39
40 CBlockingIndividualNodeCandidateHash::~CBlockingIndividualNodeCandidateHash() {
41 }
42
43
44 CBlockingIndividualNodeCandidateHash* CBlockingIndividualNodeCandidateHash::initBlockingIndividualNodeCandidateHash(CBlockingIndividualNodeCandidateHash* prevBlockCandHash) {
45 mBlockCandidateHash = nullptr;
46 if (prevBlockCandHash) {
47 mPrevBlockCandidateHash = prevBlockCandHash->mUseBlockCandidateHash;
48 mUseBlockCandidateHash = mPrevBlockCandidateHash;
49 } else {
50 mPrevBlockCandidateHash = nullptr;
51 mUseBlockCandidateHash = nullptr;
52 }
53 return this;
54 }
55
56
57 CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateHash::getBlockingIndividualCandidateData(CConcept* initializationConcept, bool conceptNegation, bool create) {
58 if (!mUseBlockCandidateHash || !mBlockCandidateHash && create) {
59 mBlockCandidateHash = CObjectParameterizingAllocator< CPROCESSHASH< QPair<CConcept*,bool> ,CBlockingCandidateHashData>,CContext* >::allocateAndConstructAndParameterize(mMemMan,mContext);
60 if (mPrevBlockCandidateHash) {
61 *mBlockCandidateHash = *mPrevBlockCandidateHash;
62 }
63 mUseBlockCandidateHash = mBlockCandidateHash;
64 }
65 if (create) {
66 CBlockingCandidateHashData& data = (*mUseBlockCandidateHash)[QPair<CConcept*,bool>(initializationConcept,conceptNegation)];
67 if (!data.mCandidateIndiData) {
68 data.mCandidateIndiData = CObjectParameterizingAllocator< CBlockingIndividualNodeCandidateData,CProcessContext* >::allocateAndConstructAndParameterize(mMemMan,mContext);
69 data.mCandidateIndiData->initBlockingCandidateData(data.mPrevCandidateIndiData);
70 data.mPrevCandidateIndiData = data.mCandidateIndiData;
71 }
72 return data.mPrevCandidateIndiData;
73 } else {
74 CBlockingCandidateHashData* data = nullptr;
75 if (mUseBlockCandidateHash->tryGetValuePointer(QPair<CConcept*,bool>(initializationConcept,conceptNegation),data)) {
76 return data->mPrevCandidateIndiData;
77 }
78 }
79 return nullptr;
80 }
81
82
83 CBlockingIndividualNodeCandidateData* CBlockingIndividualNodeCandidateHash::getBlockingIndividualCandidateData(CConceptDescriptor* initializationConDes, bool create) {
84 return getBlockingIndividualCandidateData(initializationConDes->getConcept(),initializationConDes->getNegation(),create);
85 }
86
87
88 }; // end namespace Process
89
90 }; // end namespace Kernel
91
92 }; // end namespace Reasoner
93
94 }; // end namespace Konclude