Debian Codegraph @

Source/Reasoner/Kernel/Process/CSaturationIndividualNodeProcessingQueue.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 "CSaturationIndividualNodeProcessingQueue.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CSaturationIndividualNodeProcessingQueue::CSaturationIndividualNodeProcessingQueue(CProcessContext* processContext)
34 : mProcessContext(processContext),mPriorityIndiDesMap(processContext) {
35
36 }
37
38 CSaturationIndividualNodeProcessingQueue* CSaturationIndividualNodeProcessingQueue::initProcessingQueue(CSaturationIndividualNodeProcessingQueue* processingQueue) {
39 if (processingQueue) {
40 mPriorityIndiDesMap = processingQueue->mPriorityIndiDesMap;
41 } else {
42 mPriorityIndiDesMap.clear();
43 }
44 return this;
45 }
46
47
48 CIndividualSaturationProcessNode* CSaturationIndividualNodeProcessingQueue::takeNextProcessIndividual() {
49 CIndividualSaturationProcessNode* nextNode = nullptr;
50 if (!mPriorityIndiDesMap.isEmpty()) {
51 CPROCESSMAP<cint64,CIndividualSaturationProcessNode*>::iterator it = mPriorityIndiDesMap.begin();
52 nextNode = it.value();
53 it = mPriorityIndiDesMap.erase(it);
54 }
55 return nextNode;
56 }
57
58 CIndividualSaturationProcessNode* CSaturationIndividualNodeProcessingQueue::getNextProcessIndividual() {
59 CIndividualSaturationProcessNode* nextNode = nullptr;
60 if (!mPriorityIndiDesMap.isEmpty()) {
61 CPROCESSMAP<cint64,CIndividualSaturationProcessNode*>::iterator it = mPriorityIndiDesMap.begin();
62 nextNode = it.value();
63 }
64 return nextNode;
65 }
66
67 CSaturationIndividualNodeProcessingQueue* CSaturationIndividualNodeProcessingQueue::insertProcessIndiviudal(CIndividualSaturationProcessNode* individual) {
68 mPriorityIndiDesMap.insert(-individual->getIndividualID(),individual);
69 return this;
70 }
71
72
73 bool CSaturationIndividualNodeProcessingQueue::isEmpty() {
74 return mPriorityIndiDesMap.count() <= 0;
75 }
76
77 cint64 CSaturationIndividualNodeProcessingQueue::getQueuedIndividualCount() {
78 return mPriorityIndiDesMap.count();
79 }
80
81 bool CSaturationIndividualNodeProcessingQueue::hasQueuedIndividuals() {
82 return mPriorityIndiDesMap.count() > 0;
83 }
84
85 bool CSaturationIndividualNodeProcessingQueue::isIndividualQueued(CIndividualSaturationProcessNode *individual) {
86 return mPriorityIndiDesMap.contains(-individual->getIndividualID());
87 }
88
89
90 }; // end namespace Process
91
92 }; // end namespace Kernel
93
94 }; // end namespace Reasoner
95
96 }; // end namespace Konclude