Debian Codegraph @

Source/Reasoner/Kernel/Process/CRepresentativeJoiningHash.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 "CRepresentativeJoiningHash.h"
22 #include "CRepresentativeVariableBindingPathSetData.h"
23
24
25 namespace Konclude {
26
27 namespace Reasoner {
28
29 namespace Kernel {
30
31 namespace Process {
32
33 CRepresentativeJoiningHash::CRepresentativeJoiningHash(CProcessContext* context) : CPROCESSHASH<TRepIDPair,CRepresentativeJoiningHashData>(context) {
34 mContext = context;
35 }
36
37
38 CRepresentativeJoiningHash* CRepresentativeJoiningHash::initRepresentativeJoiningHash(CRepresentativeJoiningHash* prevHash) {
39 if (prevHash) {
40 CPROCESSHASH<TRepIDPair, CRepresentativeJoiningHashData>::operator=(*prevHash);
41 } else {
42 CPROCESSHASH<TRepIDPair,CRepresentativeJoiningHashData>::clear();
43 }
44 return this;
45 }
46
47 CRepresentativeJoiningData* CRepresentativeJoiningHash::getRepresentativeJoiningData(CRepresentativeVariableBindingPathSetData* leftRepData, CRepresentativeVariableBindingPathSetData* rightRepData, bool create) {
48 CRepresentativeJoiningData* repJoiningData = nullptr;
49 cint64 leftID = leftRepData->getRepresentativeID();
50 cint64 rightID = rightRepData->getRepresentativeID();
51 if (create) {
52 CRepresentativeJoiningHashData& data = CPROCESSHASH<TRepIDPair,CRepresentativeJoiningHashData>::operator[](TRepIDPair(leftID,rightID));
53 repJoiningData = data.mVarBindPathJoiningData;
54 if (!data.mVarBindPathJoiningData) {
55 repJoiningData = CObjectParameterizingAllocator< CRepresentativeJoiningData,CProcessContext* >::allocateAndConstructAndParameterize(mContext->getUsedMemoryAllocationManager(),mContext);
56 data.mVarBindPathJoiningData = repJoiningData;
57 }
58 } else {
59 const CRepresentativeJoiningHashData& data = CPROCESSHASH<TRepIDPair,CRepresentativeJoiningHashData>::value(TRepIDPair(leftID,rightID));
60 repJoiningData = data.mVarBindPathJoiningData;
61 }
62 return repJoiningData;
63 }
64
65
66 }; // end namespace Process
67
68 }; // end namespace Kernel
69
70 }; // end namespace Reasoner
71
72 }; // end namespace Konclude