Debian Codegraph @

Source/Reasoner/Answerer/COptimizedComplexConceptStepAnsweringItem.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 "COptimizedComplexConceptStepAnsweringItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Answerer {
29
30
31 COptimizedComplexConceptStepAnsweringItem::COptimizedComplexConceptStepAnsweringItem() {
32 }
33
34 COptimizedComplexConceptStepAnsweringItem::~COptimizedComplexConceptStepAnsweringItem() {
35 }
36
37
38 COptimizedComplexConceptStepAnsweringItem* COptimizedComplexConceptStepAnsweringItem::addQueuedConceptItem(COptimizedComplexConceptItem* item) {
39 if (!mConceptItemQueuedSet.contains(item)) {
40 mConceptItemQueuedSet.insert(item);
41 mConceptItemQueuedList.append(item);
42 }
43 return this;
44 }
45
46 COptimizedComplexConceptItem* COptimizedComplexConceptStepAnsweringItem::takeNextQueuedConceptItem() {
47 COptimizedComplexConceptItem* item = nullptr;
48 if (!mConceptItemQueuedList.isEmpty()) {
49 item = mConceptItemQueuedList.takeFirst();
50 mConceptItemQueuedSet.remove(item);
51 }
52 return item;
53 }
54
55
56 COptimizedComplexConceptItem* COptimizedComplexConceptStepAnsweringItem::getNextQueuedConceptItem() {
57 COptimizedComplexConceptItem* item = nullptr;
58 if (!mConceptItemQueuedList.isEmpty()) {
59 item = mConceptItemQueuedList.first();
60 }
61 return item;
62 }
63
64 QList<COptimizedComplexConceptItem*>* COptimizedComplexConceptStepAnsweringItem::getConceptItemQueuedList() {
65 return &mConceptItemQueuedList;
66 }
67
68 QSet<COptimizedComplexConceptItem*>* COptimizedComplexConceptStepAnsweringItem::getConceptItemQueuedSet() {
69 return &mConceptItemQueuedSet;
70 }
71
72
73 QSet<COptimizedComplexConceptItem*>* COptimizedComplexConceptStepAnsweringItem::getConceptItemProcessingSet() {
74 return &mConceptItemProcessingSet;
75 }
76
77
78 COptimizedComplexConceptStepAnsweringItem* COptimizedComplexConceptStepAnsweringItem::addProcessingConceptItem(COptimizedComplexConceptItem* item) {
79 mConceptItemProcessingSet.insert(item);
80 return this;
81 }
82
83 COptimizedComplexConceptStepAnsweringItem* COptimizedComplexConceptStepAnsweringItem::removeProcessingConceptItem(COptimizedComplexConceptItem* item) {
84 mConceptItemProcessingSet.remove(item);
85 return this;
86 }
87
88 bool COptimizedComplexConceptStepAnsweringItem::hasConceptItemsQueued() {
89 return !mConceptItemQueuedSet.isEmpty();
90 }
91
92 bool COptimizedComplexConceptStepAnsweringItem::hasConceptItemsProcessing() {
93 return !mConceptItemProcessingSet.isEmpty();
94 }
95
96
97
98 }; // end namespace Answerer
99
100 }; // end namespace Reasoner
101
102 }; // end namespace Konclude