Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualReactivationProcessingQueue.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_PROCESS_CINDIVIDUALREACTIVATIONPROCESSINGQUEUE_H
22 #define KONCLUDE_REASONER_KERNEL_PROCESS_CINDIVIDUALREACTIVATIONPROCESSINGQUEUE_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "ProcessSettings.h"
29 #include "CIndividualProcessNode.h"
30 #include "CIndividualDepthPriority.h"
31
32
33 // Other includes
34
35
36 // Logger includes
37 #include "Logger/CLogger.h"
38
39
40
41 namespace Konclude {
42
43 namespace Reasoner {
44
45 namespace Kernel {
46
47 namespace Process {
48
49 /*!
50 *
51 * \class CIndividualReactivationProcessingQueue
52 * \author Andreas Steigmiller
53 * \version 0.1
54 * \brief TODO
55 *
56 */
57 class CIndividualReactivationProcessingQueue {
58 // public methods
59 public:
60 //! Constructor
61 CIndividualReactivationProcessingQueue(CProcessContext* processContext);
62
63 CIndividualReactivationProcessingQueue* initProcessingQueue(CIndividualReactivationProcessingQueue* processingQueue);
64
65
66 bool takeNextReactivationIndividual(CIndividualProcessNode*& indiNode, bool& forceReactivation);
67 bool getNextReactivationIndividual(CIndividualProcessNode*& indiNode, bool& forceReactivation);
68 bool insertReactivationIndiviudal(CIndividualProcessNode* individual, bool forceReactivation);
69
70 bool isEmpty();
71 cint64 getQueuedIndividualCount();
72 bool hasQueuedIndividuals();
73 bool hasQueuedIndividual(CIndividualProcessNode* individual);
74
75
76 // protected methods
77 protected:
78
79 // protected variables
80 protected:
81 CProcessContext* mProcessContext;
82
83 class CIndividualForceReactivationData {
84 public:
85 CIndividualForceReactivationData(CIndividualProcessNode* indiNode = nullptr, bool forceReactivation = false) {
86 mForceReactivation = forceReactivation;
87 mIndiNode = indiNode;
88 }
89 bool mForceReactivation;
90 CIndividualProcessNode* mIndiNode;
91 };
92
93 CPROCESSMAP<CIndividualDepthPriority,CIndividualForceReactivationData> mPriorityIndiReactivationMap;
94
95 // private methods
96 private:
97
98 // private variables
99 private:
100
101 };
102
103 }; // end namespace Process
104
105 }; // end namespace Kernel
106
107 }; // end namespace Reasoner
108
109 }; // end namespace Konclude
110
111 #endif // KONCLUDE_REASONER_KERNEL_PROCESS_CINDIVIDUALREACTIVATIONPROCESSINGQUEUE_H