Subversion Repository Public Repository

Divide-Dependencies

This repository has no backups
This repository's network speed is throttled to 100KB/sec

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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
#ifndef SPARSE_ARRAY_H

#define SPARSE_ARRAY_H

#include "PlatformConfigHACD.h"

using namespace hacd;

/*!
**
** Copyright (c) 2015 by John W. Ratcliff mailto:jratcliffscarab@gmail.com
**
**
** The MIT license:
**
** Permission is hereby granted, free of charge, to any person obtaining a copy
** of this software and associated documentation files (the "Software"), to deal
** in the Software without restriction, including without limitation the rights
** to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
** copies of the Software, and to permit persons to whom the Software is furnished
** to do so, subject to the following conditions:
**
** The above copyright notice and this permission notice shall be included in all
** copies or substantial portions of the Software.

** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
** IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
** FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
** AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
** WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
** CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


**
** If you find this code snippet useful; you can tip me at this bitcoin address:
**
** BITCOIN TIP JAR: "1BT66EoaGySkbY9J6MugvQRhMMXDwPxPya"
**


*/

// This class implements a sparse array.
// You must know the maximum number of actual elements you will ever have in your array at creation time.
// Meaning it does not support 'growing' the number of active elements.
// The size of the array can be any array indexes up to 32 bits.
//


template < class Value,	size_t hashTableSize = 512 >		// *MUST* be a power of 2!
class SparseArray : public UANS::UserAllocated
{
public:
	SparseArray(HaSizeT maxEntries)
	{
		mFreeList = NULL;
		mHashTableCount = 0;
		memset(mHashTable,0,sizeof(void *)*hashTableSize);
		mMaxEntries = maxEntries;
		mEntries = HACD_NEW(HashEntry)[maxEntries];
	}
	~SparseArray(void)
	{
		delete []mEntries;
	}

	Value& operator[] (HaSizeT key)
	{
		Value *v = find(key);
		if ( v == NULL )
		{
			Value dummy=0;
			insert(key,dummy);
			v = find(key);
			HACD_ASSERT(v);
		}
		return *v;
	}

	const Value& operator[](HaSizeT key) const
	{
		Value *v = find(key);
		if ( v == NULL )
		{
			Value dummy=0;
			insert(key,dummy);
			v = find(key);
			HACD_ASSERT(v);
		}
		return *v;
	}


	Value* find(HaSizeT key)  const
	{
		Value* ret = NULL;
		HaSizeT hash = getHash(key);
		HashEntry* h = mHashTable[hash];
		while (h)
		{
			if (h->mKey == key)
			{
				ret = &h->mValue;
				break;
			}
			h = h->mNext;
		}
		return ret;
	}

	void erase(HaSizeT key)
	{
		HaSizeT hash = getHash(key);
		HashEntry* h = mHashTable[hash];
		HashEntry *prev = NULL;
		while (h)
		{
			if (h->mKey == key)
			{
				if ( prev )
				{
					prev->mNext = h->mNext; // if there was a previous, then it's next is our old next
				}
				else
				{
					mHashTable[hash] = h->mNext; // if there was no previous than the new head of the list is our next.
				}
				// add this hash entry to the free list.
				HashEntry *oldFreeList = mFreeList;
				mFreeList = h;
				h->mNext = oldFreeList;
				break;
			}
			prev = h;
			h = h->mNext;
		}
	}

	void insert(HaSizeT key, const Value& value)
	{
		if (mHashTableCount < mMaxEntries )
		{
			HashEntry* h;
			if ( mFreeList ) // if there are previously freed hash entry items
			{
				h = mFreeList;
				mFreeList = h->mNext;
				h->mNext = NULL;
			}
			else
			{
				h = &mEntries[mHashTableCount];
				mHashTableCount++;
				HACD_ASSERT( mHashTableCount < mMaxEntries );
			}

			h->mKey = key;
			h->mValue = value;
			HaSizeT hash = getHash(key);
			if (mHashTable[hash])
			{
				HashEntry* next = mHashTable[hash];
				mHashTable[hash] = h;
				h->mNext = next;
			}
			else
			{
				mHashTable[hash] = h;
			}
		}
	}
private:

	// Thomas Wang's 32 bit mix
	// http://www.cris.com/~Ttwang/tech/inthash.htm
	HACD_INLINE uint32_t hash(const uint32_t key) const
	{
		uint32_t k = key;
		k += ~(k << 15);
		k ^= (k >> 10);
		k += (k << 3);
		k ^= (k >> 6);
		k += ~(k << 11);
		k ^= (k >> 16);
		return (uint32_t)k;
	}

	HACD_INLINE uint32_t getHash(uint32_t key) const
	{
		uint32_t ret = hash(key);
		return ret & (hashTableSize - 1);
	}

	HACD_INLINE uint64_t getHash(uint64_t key) const
	{
		union {
			uint32_t parts[2];
			uint64_t whole;
		} temp;
		temp.whole = key;
		temp.parts[0] = hash(temp.parts[0]);
		temp.parts[1] = hash(temp.parts[1]);
		return temp.whole & (hashTableSize - 1);
	}

	class HashEntry : public UANS::UserAllocated
	{
	public:
		HashEntry(void)
		{
			mNext = NULL;
		}
		HashEntry*	mNext;
		HaSizeT		mKey;
		Value		mValue;
	};

	HashEntry*		mFreeList;
	HashEntry*		mHashTable[hashTableSize];
	unsigned int	mHashTableCount;
	HaSizeT			mMaxEntries;
	HashEntry		*mEntries;

};


template < class Value,	size_t hashTableSize = 512, size_t maxEntries = 2048 >		// *MUST* be a power of 2!
class SparseArrayFixed : public UANS::UserAllocated
{
public:
	SparseArrayFixed(void)
	{
		mFreeList = NULL;
		mHashTableCount = 0;
		memset(mHashTable,0,sizeof(void *)*hashTableSize);
	}
	~SparseArrayFixed(void)
	{
	}

	Value& operator[] (HaSizeT key)
	{
		Value *v = find(key);
		if ( v == NULL )
		{
			Value dummy=0;
			insert(key,dummy);
			v = find(key);
			HACD_ASSERT(v);
		}
		return *v;
	}

	const Value& operator[](HaSizeT key) const
	{
		Value *v = find(key);
		if ( v == NULL )
		{
			Value dummy=0;
			insert(key,dummy);
			v = find(key);
			HACD_ASSERT(v);
		}
		return *v;
	}


	Value* find(HaSizeT key)  const
	{
		Value* ret = NULL;
		HaSizeT hash = getHash(key);
		HashEntry* h = mHashTable[hash];
		while (h)
		{
			if (h->mKey == key)
			{
				ret = &h->mValue;
				break;
			}
			h = h->mNext;
		}
		return ret;
	}

	void erase(HaSizeT key)
	{
		HaSizeT hash = getHash(key);
		HashEntry* h = mHashTable[hash];
		HashEntry *prev = NULL;
		while (h)
		{
			if (h->mKey == key)
			{
				if ( prev )
				{
					prev->mNext = h->mNext; // if there was a previous, then it's next is our old next
				}
				else
				{
					mHashTable[hash] = h->mNext; // if there was no previous than the new head of the list is our next.
				}
				// add this hash entry to the free list.
				HashEntry *oldFreeList = mFreeList;
				mFreeList = h;
				h->mNext = oldFreeList;
				break;
			}
			prev = h;
			h = h->mNext;
		}
	}

	void insert(HaSizeT key, const Value& value)
	{
		if (mHashTableCount < maxEntries )
		{
			HashEntry* h;
			if ( mFreeList ) // if there are previously freed hash entry items
			{
				h = mFreeList;
				mFreeList = h->mNext;
				h->mNext = NULL;
			}
			else
			{
				h = &mEntries[mHashTableCount];
				mHashTableCount++;
				HACD_ASSERT( mHashTableCount < maxEntries );
			}

			h->mKey = key;
			h->mValue = value;
			HaSizeT hash = getHash(key);
			if (mHashTable[hash])
			{
				HashEntry* next = mHashTable[hash];
				mHashTable[hash] = h;
				h->mNext = next;
			}
			else
			{
				mHashTable[hash] = h;
			}
		}
	}
private:

	// Thomas Wang's 32 bit mix
	// http://www.cris.com/~Ttwang/tech/inthash.htm
	HACD_INLINE uint32_t hash(const uint32_t key) const
	{
		uint32_t k = key;
		k += ~(k << 15);
		k ^= (k >> 10);
		k += (k << 3);
		k ^= (k >> 6);
		k += ~(k << 11);
		k ^= (k >> 16);
		return (uint32_t)k;
	}

	HACD_INLINE uint32_t getHash(uint32_t key) const
	{
		uint32_t ret = hash(key);
		return ret & (hashTableSize - 1);
	}

	HACD_INLINE uint64_t getHash(uint64_t key) const
	{
		union {
			uint32_t parts[2];
			uint64_t whole;
		} temp;
		temp.whole = key;
		temp.parts[0] = hash(temp.parts[0]);
		temp.parts[1] = hash(temp.parts[1]);
		return temp.whole & (hashTableSize - 1);
	}

	class HashEntry : public UANS::UserAllocated
	{
	public:
		HashEntry(void)
		{
			mNext = NULL;
		}
		HashEntry*	mNext;
		HaSizeT		mKey;
		Value		mValue;
	};

	HashEntry*		mFreeList;
	HashEntry*		mHashTable[hashTableSize];
	unsigned int	mHashTableCount;
	HashEntry		mEntries[maxEntries];

};


#endif

Commits for Divide-Dependencies/physx/APEX_1.4/shared/general/HACD/public/SparseArray.h

Diff revisions: vs.
Revision Author Commited Message
105 IonutCava picture IonutCava Tue 16 Apr, 2019 19:55:41 +0000

Forgot to actually add physx