Debian Codegraph @

Source/Reasoner/Kernel/Process/CConceptReapplyHash.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 "CConceptReapplyHash.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CConceptReapplyHash::CConceptReapplyHash(CProcessContext* processContext) : CPROCESSHASH<QPair<CConcept*,bool>,CReapplyQueue>(processContext) {
34 }
35
36 CConceptReapplyHash::~CConceptReapplyHash() {
37 }
38
39 CConceptReapplyHash* CConceptReapplyHash::initConceptReapplyHash(CConceptReapplyHash* prevConceptReapplyHash) {
40 if (prevConceptReapplyHash) {
41 *this = *prevConceptReapplyHash;
42 } else {
43 CPROCESSHASH<QPair<CConcept*,bool>,CReapplyQueue>::clear();
44 }
45 return this;
46 }
47
48
49 CReapplyQueue* CConceptReapplyHash::getConceptReapplyQueue(CConcept *&concept, bool &conceptNegation, bool create) {
50 QPair<CConcept*,bool> conNegPair(concept,conceptNegation);
51 if (create) {
52 return &this->operator[](conNegPair);
53 } else {
54 if (contains(conNegPair)) {
55 return &this->operator[](conNegPair);
56 } else {
57 return nullptr;
58 }
59 }
60 }
61
62
63 bool CConceptReapplyHash::containsConceptReapplyQueue(CConcept *&concept, bool &conceptNegation) {
64 return contains(QPair<CConcept*,bool>(concept,conceptNegation));
65 }
66
67 CReapplyQueueIterator CConceptReapplyHash::getConceptReapplyIterator(CConcept *&concept, bool &conceptNegation, bool clearDynamicReapplyQueue) {
68 QPair<CConcept*,bool> conNegPair(concept,conceptNegation);
69 CReapplyQueue* reapplyQueue = nullptr;
70 if (tryGetValuePointer(conNegPair,reapplyQueue)) {
71 return reapplyQueue->getIterator(clearDynamicReapplyQueue);
72 }
73 return CReapplyQueueIterator(nullptr,nullptr);
74 }
75
76
77 }; // end namespace Process
78
79 }; // end namespace Kernel
80
81 }; // end namespace Reasoner
82
83 }; // end namespace Konclude