Debian Codegraph @

Source/Reasoner/Realizer/COptimizedKPSetIndividualInstantiatedItemMultiHash.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 "COptimizedKPSetIndividualInstantiatedItemMultiHash.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Realizer {
29
30
31 COptimizedKPSetIndividualInstantiatedItemMultiHash::COptimizedKPSetIndividualInstantiatedItemMultiHash(cint64 concurrentMultiSize) {
32 mConcurrentMultiSize = concurrentMultiSize;
33 mIndividualInstantiatedItemMultiHash = new QHash<cint64, COptimizedKPSetIndividualItem*>*[mConcurrentMultiSize];
34 mContainerMultiList = new QList<COptimizedKPSetIndividualItem *>*[mConcurrentMultiSize];
35 for (cint64 i = 0; i < mConcurrentMultiSize; ++i) {
36 mIndividualInstantiatedItemMultiHash[i] = nullptr;
37 mContainerMultiList[i] = nullptr;
38 }
39 mContainerList = nullptr;
40 }
41
42 COptimizedKPSetIndividualInstantiatedItemMultiHash::~COptimizedKPSetIndividualInstantiatedItemMultiHash() {
43 for (cint64 i = 0; i < mConcurrentMultiSize; ++i) {
44 if (mIndividualInstantiatedItemMultiHash[i]) {
45 delete mIndividualInstantiatedItemMultiHash[i];
46 }
47 if (mContainerMultiList[i]) {
48 delete mContainerMultiList[i];
49 }
50 }
51 delete[] mIndividualInstantiatedItemMultiHash;
52 delete[] mContainerMultiList;
53 if (mContainerList) {
54 delete mContainerList;
55 }
56 }
57
58
59 QList<COptimizedKPSetIndividualItem*>* COptimizedKPSetIndividualInstantiatedItemMultiHash::getIndividualInstantiatedItemContainerList() {
60 if (!mContainerList) {
61 mContainerList = new QList<COptimizedKPSetIndividualItem *>();
62 for (cint64 i = 0; i < mConcurrentMultiSize; ++i) {
63 if (mContainerMultiList[i]) {
64 mContainerList->append(*mContainerMultiList[i]);
65 delete mContainerMultiList[i];
66 mContainerMultiList[i] = nullptr;
67 }
68 }
69 }
70 return mContainerList;
71 }
72
73
74
75 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualInstantiatedItemMultiHash::getIndividualInstantiatedItem(cint64 indiId, bool directCreate, CIndividual* individual) {
76 cint64 indiVecPos = indiId % mConcurrentMultiSize;
77 COptimizedKPSetIndividualItem* instantiatedItem = nullptr;
78 QHash<cint64, COptimizedKPSetIndividualItem*>*& individualInstantiatedItemHash = mIndividualInstantiatedItemMultiHash[indiVecPos];
79 QList<COptimizedKPSetIndividualItem*>*& containerList = mContainerMultiList[indiVecPos];
80
81 if (directCreate) {
82 if (!individualInstantiatedItemHash) {
83 individualInstantiatedItemHash = new QHash<cint64, COptimizedKPSetIndividualItem *>();
84 }
85 COptimizedKPSetIndividualItem*& instantiatedItemPointer = (*individualInstantiatedItemHash)[indiId];
86 if (!instantiatedItemPointer) {
87 if (!containerList) {
88 containerList = new QList<COptimizedKPSetIndividualItem *>();
89 }
90 instantiatedItemPointer = new COptimizedKPSetIndividualItem();
91 instantiatedItemPointer->initInstantiatedItem(indiId, individual);
92 containerList->append(instantiatedItemPointer);
93 }
94 instantiatedItem = instantiatedItemPointer;
95 } else if (individualInstantiatedItemHash) {
96 instantiatedItem = individualInstantiatedItemHash->value(indiId);
97 }
98 return instantiatedItem;
99 }
100
101
102 COptimizedKPSetIndividualInstantiatedItemMultiHash* COptimizedKPSetIndividualInstantiatedItemMultiHash::updateIndividualInstantiatedItem(cint64 indiId, COptimizedKPSetIndividualItem* item) {
103 cint64 indiVecPos = indiId % mConcurrentMultiSize;
104 QHash<cint64, COptimizedKPSetIndividualItem*>*& individualInstantiatedItemHash = mIndividualInstantiatedItemMultiHash[indiVecPos];
105 if (!individualInstantiatedItemHash) {
106 individualInstantiatedItemHash = new QHash<cint64, COptimizedKPSetIndividualItem *>();
107 }
108 individualInstantiatedItemHash->insert(indiId, item);
109 return this;
110 }
111
112
113 bool COptimizedKPSetIndividualInstantiatedItemMultiHash::hasIndividualInstantiatedItem(cint64 indiId) {
114 cint64 indiVecPos = indiId % mConcurrentMultiSize;
115 QHash<cint64, COptimizedKPSetIndividualItem*>*& individualInstantiatedItemHash = mIndividualInstantiatedItemMultiHash[indiVecPos];
116 if (!individualInstantiatedItemHash) {
117 return false;
118 }
119 return individualInstantiatedItemHash->contains(indiId);
120 }
121
122
123 COptimizedKPSetIndividualItem* COptimizedKPSetIndividualInstantiatedItemMultiHash::getIndividualInstantiatedItem(cint64 indiId) {
124 if (indiId < 0) {
125 return nullptr;
126 }
127 cint64 indiVecPos = indiId % mConcurrentMultiSize;
128 QHash<cint64, COptimizedKPSetIndividualItem*>*& individualInstantiatedItemHash = mIndividualInstantiatedItemMultiHash[indiVecPos];
129 if (!individualInstantiatedItemHash) {
130 return nullptr;
131 }
132 return individualInstantiatedItemHash->value(indiId);
133 }
134
135
136 }; // end namespace Realizer
137
138 }; // end namespace Reasoner
139
140 }; // end namespace Konclude