Debian Codegraph @

Source/Reasoner/Kernel/Process/CIndividualUnsortedProcessingQueue.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 "CIndividualUnsortedProcessingQueue.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Process {
31
32
33 CIndividualUnsortedProcessingQueue::CIndividualUnsortedProcessingQueue(CProcessContext* processContext)
34 : mProcessContext(processContext) {
35
36 mMemMan = mProcessContext->getMemoryAllocationManager();
37 mIndiProDesCount = 0;
38 mProcessingIndiNodeLinker = nullptr;
39 }
40
41
42 CIndividualUnsortedProcessingQueue* CIndividualUnsortedProcessingQueue::initProcessingQueue(CIndividualUnsortedProcessingQueue* processingQueue) {
43 if (processingQueue) {
44 mIndiProDesCount = processingQueue->mIndiProDesCount;
45 mProcessingIndiNodeLinker = processingQueue->mProcessingIndiNodeLinker;
46 } else {
47 mProcessingIndiNodeLinker = nullptr;
48 mIndiProDesCount = 0;
49 }
50 return this;
51 }
52
53 CXLinker<CIndividualProcessNode*>* CIndividualUnsortedProcessingQueue::getProcessIndividualNodeLinker() {
54 return mProcessingIndiNodeLinker;
55 }
56
57 CIndividualProcessNode* CIndividualUnsortedProcessingQueue::takeNextProcessIndividualNode() {
58 CIndividualProcessNode* nextIndiNode = nullptr;
59 if (mProcessingIndiNodeLinker) {
60 --mIndiProDesCount;
61 nextIndiNode = mProcessingIndiNodeLinker->getData();
62 mProcessingIndiNodeLinker = mProcessingIndiNodeLinker->getNext();
63 }
64 return nextIndiNode;
65 }
66
67 CIndividualProcessNode* CIndividualUnsortedProcessingQueue::getNextProcessIndividualNode() {
68 CIndividualProcessNode* nextIndiNode = nullptr;
69 if (mProcessingIndiNodeLinker) {
70 nextIndiNode = mProcessingIndiNodeLinker->getData();
71 }
72 return nextIndiNode;
73 }
74
75 CIndividualUnsortedProcessingQueue* CIndividualUnsortedProcessingQueue::insertIndiviudalProcessNode(CIndividualProcessNode* indiProNode) {
76 CXLinker<CIndividualProcessNode*>* newIndiNodeLinker = CObjectAllocator< CXLinker<CIndividualProcessNode*> >::allocateAndConstruct(mMemMan);
77 mProcessingIndiNodeLinker = newIndiNodeLinker->initLinker(indiProNode,mProcessingIndiNodeLinker);
78 ++mIndiProDesCount;
79 return this;
80 }
81
82 bool CIndividualUnsortedProcessingQueue::isEmpty() {
83 return mProcessingIndiNodeLinker == nullptr;
84 }
85
86
87 }; // end namespace Process
88
89 }; // end namespace Kernel
90
91 }; // end namespace Reasoner
92
93 }; // end namespace Konclude