Debian Codegraph @

Source/Reasoner/Kernel/Process/CSaturationSuccessorExtensionIndividualNodeProcessingQueue.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 "CSaturationSuccessorExtensionIndividualNodeProcessingQueue.h"
22 #include "CIndividualSaturationProcessNode.h"
23
24
25 namespace Konclude {
26
27 namespace Reasoner {
28
29 namespace Kernel {
30
31 namespace Process {
32
33
34 CSaturationSuccessorExtensionIndividualNodeProcessingQueue::CSaturationSuccessorExtensionIndividualNodeProcessingQueue(CProcessContext* processContext)
35 : mProcessContext(processContext),mPriorityIndiDesMap(processContext) {
36
37 mCurrentIndividual = nullptr;
38 }
39
40 CSaturationSuccessorExtensionIndividualNodeProcessingQueue* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::initProcessingQueue(CSaturationSuccessorExtensionIndividualNodeProcessingQueue* processingQueue) {
41 if (processingQueue) {
42 mPriorityIndiDesMap = processingQueue->mPriorityIndiDesMap;
43 mCurrentIndividual = processingQueue->mCurrentIndividual;
44 } else {
45 mPriorityIndiDesMap.clear();
46 mCurrentIndividual = nullptr;
47 }
48 return this;
49 }
50
51
52 CIndividualSaturationProcessNode* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::takeNextToCurrentProcessIndividual() {
53 if (!mCurrentIndividual) {
54 CIndividualSaturationProcessNode* nextNode = nullptr;
55 if (!mPriorityIndiDesMap.isEmpty()) {
56 CPROCESSMAP<cint64,CIndividualSaturationProcessNode*>::iterator it = mPriorityIndiDesMap.begin();
57 nextNode = it.value();
58 it = mPriorityIndiDesMap.erase(it);
59 }
60 mCurrentIndividual = nextNode;
61 }
62 return mCurrentIndividual;
63 }
64
65 CSaturationSuccessorExtensionIndividualNodeProcessingQueue* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::insertProcessIndiviudal(CIndividualSaturationProcessNode* individual) {
66 if (mCurrentIndividual) {
67 if (mCurrentIndividual->getIndividualID() == individual->getIndividualID()) {
68 return this;
69 }
70 }
71 mPriorityIndiDesMap.insert(-individual->getIndividualID(),individual);
72 return this;
73 }
74
75
76 bool CSaturationSuccessorExtensionIndividualNodeProcessingQueue::isEmpty() {
77 return !mCurrentIndividual && mPriorityIndiDesMap.count() <= 0;
78 }
79
80 cint64 CSaturationSuccessorExtensionIndividualNodeProcessingQueue::getQueuedIndividualCount() {
81 cint64 processingCount = mPriorityIndiDesMap.count();
82 if (mCurrentIndividual) {
83 processingCount += 1;
84 }
85 return processingCount;
86 }
87
88 bool CSaturationSuccessorExtensionIndividualNodeProcessingQueue::hasQueuedIndividuals() {
89 return mCurrentIndividual || mPriorityIndiDesMap.count() > 0;
90 }
91
92 bool CSaturationSuccessorExtensionIndividualNodeProcessingQueue::isIndividualQueued(CIndividualSaturationProcessNode *individual) {
93 if (mCurrentIndividual) {
94 if (mCurrentIndividual->getIndividualID() == individual->getIndividualID()) {
95 return true;
96 }
97 }
98 return mPriorityIndiDesMap.contains(-individual->getIndividualID());
99 }
100
101 CIndividualSaturationProcessNode* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::getCurrentProcessIndividual() {
102 return mCurrentIndividual;
103 }
104
105 CSaturationSuccessorExtensionIndividualNodeProcessingQueue* CSaturationSuccessorExtensionIndividualNodeProcessingQueue::clearCurrentProcessIndividual() {
106 mCurrentIndividual = nullptr;
107 return this;
108 }
109
110
111 }; // end namespace Process
112
113 }; // end namespace Kernel
114
115 }; // end namespace Reasoner
116
117 }; // end namespace Konclude