File: CQtManagedRestrictedModificationSharingHash.h

package info (click to toggle)
konclude 0.7.0%2B1137~dfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 48,824 kB
  • sloc: cpp: 378,238; xml: 116,067; makefile: 38; sh: 8; ansic: 3
file content (249 lines) | stat: -rw-r--r-- 8,340 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
/*
 *		Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
 *
 *		This file is part of the reasoning system Konclude.
 *		For details and support, see <http://konclude.com/>.
 *
 *		Konclude is free software: you can redistribute it and/or modify
 *		it under the terms of version 3 of the GNU Lesser General Public
 *		License (LGPLv3) as published by the Free Software Foundation.
 *
 *		Konclude is distributed in the hope that it will be useful,
 *		but WITHOUT ANY WARRANTY; without even the implied warranty of
 *		MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 *		GNU (Lesser) General Public License for more details.
 *
 *		You should have received a copy of the GNU (Lesser) General Public
 *		License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
 *
 */
 
#ifndef KONCLUDE_UTILITIES_CONTAINER_CQTMANAGEDRESTRICTEDMODIFICATIONSHARINGHASH_H
#define KONCLUDE_UTILITIES_CONTAINER_CQTMANAGEDRESTRICTEDMODIFICATIONSHARINGHASH_H

// Namespace includes
#include "ContainerSettings.h"
#include "CQtManagedRestrictedModificationHash.h"



// Library includes

// Other includes
#include "Context/CContext.h"

// Logger includes
#include "Logger/CLogger.h"


namespace Konclude {

	using namespace Context;

	namespace Utilities {

		namespace Container {


			/*! 
			 *
			 *		\class		CQtManagedRestrictedModificationSharingHash
			 *		\author		Andreas Steigmiller
			 *		\version	0.1
			 *		\brief		TODO
			 *
			 */


			template <class Key, class T>
			class CQtManagedRestrictedModificationSharingHash {

			public:
				

				CQtManagedRestrictedModificationSharingHash(CContext* context);


				CQtManagedRestrictedModificationSharingHash<Key, T>* init(CContext* context = nullptr);
				CQtManagedRestrictedModificationSharingHash<Key, T>* init(const CQtManagedRestrictedModificationSharingHash<Key, T> &other, CContext* context = nullptr);
				CQtManagedRestrictedModificationSharingHash<Key, T>* init(CQtManagedRestrictedModificationSharingHash<Key, T> *other, CContext* context = nullptr);


				CQtManagedRestrictedModificationSharingHash<Key, T>* initSharing(const CQtManagedRestrictedModificationSharingHash<Key, T> &other);
				
				CQtManagedRestrictedModificationSharingHash<Key, T>& operator=(const CQtManagedRestrictedModificationSharingHash<Key, T> &other);


				int size() const;
				int count() const;
				bool isEmpty() const;
				void clear();
				bool contains(const Key &key) const;
				T &operator[](const Key &key);
				const T operator[](const Key &key) const;
				const T value(const Key &key) const;
				const T value(const Key &key, const T &defaultValue) const;


				CQtManagedRestrictedModificationSharingHash<Key, T>* insert(const Key &key, const T &value);
				CQtManagedRestrictedModificationSharingHash<Key, T>* insertMulti(const Key &key, const T &value);


				class const_iterator {
					bool mCurrentIterator = false;
					typename  CQtManagedRestrictedModificationHash<Key, T>::const_iterator mItCurrentBegin;
					typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator mItCurrentEnd;

					bool mSharingIterator = false;
					typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator mItSharingBegin;
					typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator mItSharingEnd;

					cint64 mShareValidatingCount;
					CQtManagedRestrictedModificationHash<Key, T>* mShareValidatingHash;

				public:
					inline const_iterator() : mCurrentIterator(false), mSharingIterator(false) {
					}
					inline const_iterator(typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator itCurrentBegin, typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator itCurrentEnd) {
						mCurrentIterator = true;
						mItCurrentBegin = itCurrentBegin;
						mItCurrentEnd = itCurrentEnd;
						mSharingIterator = false;
					}

					inline const_iterator(typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator itCurrentBegin, typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator itCurrentEnd,
											typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator itSharingBegin, typename CQtManagedRestrictedModificationHash<Key, T>::const_iterator itSharingEnd,
											CQtManagedRestrictedModificationHash<Key, T>* validatingHash = nullptr, cint64 validatingCount = 0) {
						mCurrentIterator = true;
						mItCurrentBegin = itCurrentBegin;
						mItCurrentEnd = itCurrentEnd;
						mSharingIterator = true;
						mItSharingBegin = itSharingBegin;
						mItSharingEnd = itSharingEnd;
						mShareValidatingHash = validatingHash;
						mShareValidatingCount = validatingCount;

						while (mShareValidatingHash && mShareValidatingCount > 0 && mItSharingBegin != mItSharingEnd && mShareValidatingHash->contains(mItSharingBegin.key())) {		
							++mItSharingBegin;
							--mShareValidatingCount;
						}
					}

					inline const Key &key() const {
						if (mCurrentIterator && mItCurrentBegin != mItCurrentEnd) {
							return mItCurrentBegin.key();
						}
						if (mSharingIterator && mItSharingBegin != mItSharingEnd) {
							return mItSharingBegin.key();
						}
						return mItCurrentBegin.key();
					}

					inline const T &value() const {
						if (mCurrentIterator && mItCurrentBegin != mItCurrentEnd) {
							return mItCurrentBegin.value();
						}
						if (mSharingIterator && mItSharingBegin != mItSharingEnd) {
							return mItSharingBegin.value();
						}
						return mItCurrentBegin.value();
					}

					inline const T &operator*() const {
						return value();
					}

					inline const T *operator->() const {
						return value();
					}

					inline bool operator==(const const_iterator &o) const {
						if (mCurrentIterator != o.mCurrentIterator) {
							return false;
						}
						if (mCurrentIterator && mItCurrentBegin != o.mItCurrentBegin) {
							return false;
						}
						if (mCurrentIterator && mItCurrentEnd != o.mItCurrentEnd) {
							return false;
						}
						if (mSharingIterator != o.mSharingIterator) {
							return false;
						}
						if (mSharingIterator && mItSharingBegin != o.mItSharingBegin) {
							return false;
						}
						if (mSharingIterator && mItSharingEnd != o.mItSharingEnd) {
							return false;
						}
						return true;
					}

					inline bool operator!=(const const_iterator &o) const {
						return !this->operator==(o);
					}

					inline const_iterator &operator++() {
						if (mCurrentIterator && mItCurrentBegin != mItCurrentEnd) {
							++mItCurrentBegin;
						} else if (mSharingIterator && mItSharingBegin != mItSharingEnd) {
							++mItSharingBegin;
							while (mShareValidatingHash && mShareValidatingCount > 0 && mItSharingBegin != mItSharingEnd && mShareValidatingHash->contains(mItSharingBegin.key())) {
								++mItSharingBegin;
								--mShareValidatingCount;
							}
						}
						return *this;
					}

					inline const_iterator operator++(int) {
						const_iterator r = *this;
						this->operator++();
						return r;
					}


				private:
					inline operator bool() const { return false; }
				};
				typedef const_iterator ConstIterator;


				inline const_iterator constBegin() const { 
					if (mSharingHash) {
						return const_iterator(mCurrentHash->constBegin(), mCurrentHash->constEnd(), mSharingHash->constBegin(), mSharingHash->constEnd(), mCurrentHash, mSharingDuplicatedCount);
					}
					return const_iterator(mCurrentHash->constBegin(), mCurrentHash->constEnd());
				}
				inline const_iterator constEnd() const { 
					if (mSharingHash) {
						return const_iterator(mCurrentHash->constEnd(), mCurrentHash->constEnd(), mSharingHash->constEnd(), mSharingHash->constEnd());
					}
					return const_iterator(mCurrentHash->constEnd(), mCurrentHash->constEnd());
				}


				void unshare(const Key & key);
				void unshareAll();

				protected:
					CQtManagedRestrictedModificationHash<Key, T>* mCurrentHash;
					CQtManagedRestrictedModificationHash<Key, T>* mSharingHash;
					cint64 mSharingDuplicatedCount;
					CContext* mContext;
					CMemoryAllocationManager* mMemMan;
				
			};


		}; // end namespace Container

	}; // end namespace Utilities

}; // end namespace Konclude

#include "CQtManagedRestrictedModificationSharingHash.cpp"


#endif // KONCLUDE_UTILITIES_CONTAINER_CQTMANAGEDRESTRICTEDMODIFICATIONSHARINGHASH_H