Debian Codegraph @

Source/Reasoner/Kernel/Strategy/CEqualDepthTaskProcessingPriorityStrategy.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_KERNEL_STRATEGY_CEQUALDEPTHTASKPROCESSINGPRIORITYSTRATEGY_H
22 #define KONCLUDE_REASONER_KERNEL_STRATEGY_CEQUALDEPTHTASKPROCESSINGPRIORITYSTRATEGY_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "CTaskProcessingPriorityStrategy.h"
29
30 // Other includes
31
32
33 // Logger includes
34 #include "Logger/CLogger.h"
35
36
37
38 namespace Konclude {
39
40 namespace Reasoner {
41
42 namespace Kernel {
43
44 using namespace Process;
45 using namespace Task;
46
47 namespace Strategy {
48
49 /*!
50 *
51 * \class CEqualDepthTaskProcessingPriorityStrategy
52 * \author Andreas Steigmiller
53 * \version 0.1
54 * \brief TODO
55 *
56 */
57 class CEqualDepthTaskProcessingPriorityStrategy : public CTaskProcessingPriorityStrategy {
58 // public methods
59 public:
60 //! Constructor
61 CEqualDepthTaskProcessingPriorityStrategy();
62
63 //! Destructor
64 virtual ~CEqualDepthTaskProcessingPriorityStrategy();
65
66 virtual double getPriorityForTaskBranching(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask, CIndividualProcessNode* indiProcessNode, CConceptDescriptor* branchingConcept, CSortedNegLinker<CConcept*>* branchedConcept, cint64 branchNumber, CDisjunctBranchingStatistics* branchStats);
67 virtual double getPriorityForTaskQualifing(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask, bool qualifingNegated);
68 virtual double getPriorityForTaskMerging(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask);
69 virtual double getPriorityForTaskReusing(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask, bool reusingAlternative);
70
71
72 // protected methods
73 protected:
74
75 // protected variables
76 protected:
77
78 // private methods
79 private:
80
81 // private variables
82 private:
83
84 };
85
86 }; // end namespace Strategy
87
88 }; // end namespace Kernel
89
90 }; // end namespace Reasoner
91
92 }; // end namespace Konclude
93
94 #endif // KONCLUDE_REASONER_KERNEL_STRATEGY_CEQUALDEPTHTASKPROCESSINGPRIORITYSTRATEGY_H