Debian Codegraph @

Source/Reasoner/Classifier/CClassificationSatisfiableCalculationData.h

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 #ifndef KONCLUDE_REASONER_CLASSIFIER_CCLASSIFICATIONSATISFIABLECALCULATIONDATA_H
22 #define KONCLUDE_REASONER_CLASSIFIER_CCLASSIFICATIONSATISFIABLECALCULATIONDATA_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "ClassifierSettings.h"
29
30 // Other includes
31 #include "Reasoner/Taxonomy/CHierarchyNodeData.h"
32
33 #include "Reasoner/Kernel/Task/CTaskPreyingListner.h"
34 #include "Reasoner/Kernel/Task/CSatisfiableCalculationJobInstantiation.h"
35
36 #include "Utilities/UtilitiesSettings.h"
37 #include "Utilities/Memory/CNewAllocationMemoryPoolProvider.h"
38
39 // Logger includes
40 #include "Logger/CLogger.h"
41
42
43 namespace Konclude {
44
45 using namespace Utilities;
46 using namespace Utilities::Memory;
47
48 namespace Reasoner {
49
50 using namespace Taxonomy;
51 using namespace Kernel::Task;
52
53 namespace Classifier {
54
55
56 /*!
57 *
58 * \class CClassificationSatisfiableCalculationData
59 * \author Andreas Steigmiller
60 * \version 0.1
61 * \brief TODO
62 *
63 */
64 class CClassificationSatisfiableCalculationData : public CHierarchyNodeData, public CTaskPreyingListner {
65 // public methods
66 public:
67 //! Constructor
68 CClassificationSatisfiableCalculationData();
69
70 virtual CTaskPreyingListner* tellPreyedSatisfialbeTask(CSatisfiableCalculationTask* task);
71
72 bool hasSatisfiableCalculationTask();
73 CSatisfiableCalculationTask* getSatisfiableCalculationTask();
74 CClassificationSatisfiableCalculationData* setSatisfiableCalculationTask(CSatisfiableCalculationTask* task);
75
76 bool hasSatisfiableCalculationJobInstantiation();
77 CSatisfiableCalculationJobInstantiation* getSatisfiableCalculationJobInstantiation();
78 bool clearSatisfiableCalculationJobInstantiation();
79
80 CClassificationSatisfiableCalculationData* getPreviousCalculationData();
81 CClassificationSatisfiableCalculationData* setPreviousCalculationData(CClassificationSatisfiableCalculationData* data);
82
83 cint64 getDependendCalculationCount();
84 CClassificationSatisfiableCalculationData* incDependendCalculationCount(cint64 incCount = 1);
85 bool decDependendCalculationCount(cint64 decCount = 1);
86
87 // protected methods
88 protected:
89
90 // protected variables
91 protected:
92 CSatisfiableCalculationTask* mSatCalcedTask;
93 CSatisfiableCalculationJobInstantiation* mSatCalcedJob;
94 CClassificationSatisfiableCalculationData* mPrevData;
95 cint64 mDependendCalculationCount;
96
97 // private methods
98 private:
99
100 // private variables
101 private:
102
103 };
104
105 }; // end namespace Classifier
106
107 }; // end namespace Reasoner
108
109 }; // end namespace Konclude
110
111 #endif // KONCLUDE_REASONER_CLASSIFIER_CCLASSIFICATIONSATISFIABLECALCULATIONDATA_H