Debian Codegraph @

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