Debian Codegraph @

Source/Reasoner/Kernel/Algorithm/CSatisfiableTaskSaturationIndividualsAnalyser.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 "CSatisfiableTaskSaturationIndividualsAnalyser.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Algorithm {
31
32 CSatisfiableTaskSaturationIndividualsAnalyser::CSatisfiableTaskSaturationIndividualsAnalyser() {
33 }
34
35
36 CSatisfiableTaskSaturationIndividualsAnalyser::~CSatisfiableTaskSaturationIndividualsAnalyser() {
37 }
38
39
40 bool CSatisfiableTaskSaturationIndividualsAnalyser::analyseSatisfiableTask(CSatisfiableCalculationTask* statCalcTask, CCalculationAlgorithmContext* calcAlgContext) {
41 CSaturationIndividualsAnalysingAdapter* satIndiAnAdapter = statCalcTask->getSaturationIndividualsAnalysationObserver();
42 if (satIndiAnAdapter) {
43 bool foundInsufficientHandledNode = false;
44 bool foundClashedNode = false;
45 CProcessingDataBox* procDataBox = statCalcTask->getProcessingDataBox();
46 CIndividualSaturationProcessNodeLinker* indiSaturationAnalysingNodeLinker = procDataBox->getIndividualSaturationAnalysationNodeLinker();
47 for (CIndividualSaturationProcessNodeLinker* indiSaturationAnalysingNodeLinkerIt = indiSaturationAnalysingNodeLinker; indiSaturationAnalysingNodeLinkerIt; indiSaturationAnalysingNodeLinkerIt = indiSaturationAnalysingNodeLinkerIt->getNext()) {
48 CIndividualSaturationProcessNode* satIndiNode = indiSaturationAnalysingNodeLinkerIt->getProcessingIndividual();
49 CIndividualSaturationProcessNodeStatusFlags* indStatFlags = satIndiNode->getIndirectStatusFlags();
50 CIndividualSaturationProcessNodeStatusFlags* dirFlags = satIndiNode->getDirectStatusFlags();
51 if (indStatFlags->hasInsufficientFlag() || !indStatFlags->hasCompletedFlag() || !dirFlags->hasCompletedFlag()) {
52 foundInsufficientHandledNode = true;
53 }
54 if (indStatFlags->hasClashedFlag()) {
55 foundClashedNode = true;
56 }
57 }
58
59 CSaturationIndividualAnalysationObserver* satIndAnalObs = satIndiAnAdapter->getIndividualsAnalysationObserver();
60 if (satIndAnalObs) {
61 if (foundInsufficientHandledNode) {
62 satIndAnalObs->notifyInsufficientIndividual();
63 }
64 if (foundClashedNode) {
65 satIndAnalObs->notifyClashedIndividual();
66 }
67 }
68 return true;
69 }
70 return false;
71 }
72
73
74
75 }; // end namespace Algorithm
76
77 }; // end namespace Kernel
78
79 }; // end namespace Reasoner
80
81 }; // end namespace Konclude