Debian Codegraph @

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