Debian Codegraph @

Source/Reasoner/Kernel/Process/CSaturationDisjunctCommonConceptCountHash.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 "CSaturationDisjunctCommonConceptCountHash.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CSaturationDisjunctCommonConceptCountHash::CSaturationDisjunctCommonConceptCountHash(CProcessContext* processContext) : mCommonConceptCountHash(processContext) {
34 }
35
36 CSaturationDisjunctCommonConceptCountHash* CSaturationDisjunctCommonConceptCountHash::initCommonConceptCountHash() {
37 mCommonConceptCountHash.clear();
38 mDisjunctCount = 0;
39 return this;
40 }
41
42 CPROCESSHASH<cint64,CSaturationDisjunctCommonConceptCountHashData>* CSaturationDisjunctCommonConceptCountHash::getCommonConceptCountHash() {
43 return &mCommonConceptCountHash;
44 }
45
46 CSaturationDisjunctCommonConceptCountHash* CSaturationDisjunctCommonConceptCountHash::setDisjunctCount(cint64 disjunctCount) {
47 mDisjunctCount = disjunctCount;
48 return this;
49 }
50
51 CSaturationDisjunctCommonConceptCountHashData& CSaturationDisjunctCommonConceptCountHash::getCommonConceptCountData(cint64 conceptTag) {
52 return mCommonConceptCountHash[conceptTag];
53 }
54
55 CSaturationDisjunctCommonConceptCountHashData& CSaturationDisjunctCommonConceptCountHash::getCommonConceptCountData(CConcept* concept) {
56 return mCommonConceptCountHash[concept->getConceptTag()];
57 }
58
59 CSaturationDisjunctCommonConceptCountHashData& CSaturationDisjunctCommonConceptCountHash::getCommonConceptCountData(CConceptSaturationDescriptor* conSatDes) {
60 return mCommonConceptCountHash[conSatDes->getConceptTag()];
61 }
62
63
64 CSaturationDisjunctCommonConceptCountHash* CSaturationDisjunctCommonConceptCountHash::removeCommonConceptData(CConceptSaturationDescriptor* conSatDes) {
65 mCommonConceptCountHash.remove(conSatDes->getConceptTag());
66 return this;
67 }
68
69 bool CSaturationDisjunctCommonConceptCountHash::incCommonConceptCountReturnMaxReached(CConceptSaturationDescriptor* conSatDes) {
70 bool maxReached = false;
71 CSaturationDisjunctCommonConceptCountHashData& hashData = mCommonConceptCountHash[conSatDes->getConceptTag()];
72 if (!hashData.mConcept) {
73 hashData.mConcept = conSatDes->getConcept();
74 hashData.mNegation = conSatDes->isNegated();
75 }
76 if (hashData.mNegation != conSatDes->isNegated()) {
77 return false;
78 }
79 hashData.mConceptCount++;
80 if (hashData.mConceptCount >= mDisjunctCount) {
81 return true;
82 }
83 return false;
84 }
85
86
87 }; // end namespace Process
88
89 }; // end namespace Kernel
90
91 }; // end namespace Reasoner
92
93 }; // end namespace Konclude