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 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657
|
/*
===========================================================================
Copyright (C) 2015 the OpenMoHAA team
This file is part of OpenMoHAA source code.
OpenMoHAA source code is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the License,
or (at your option) any later version.
OpenMoHAA source code 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with OpenMoHAA source code; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===========================================================================
*/
// con_set.h: C++ map/set classes. Contains an hash table to improve the speed of finding a key
#pragma once
#include "mem_blockalloc.h"
class Class;
class Archiver;
template<typename k, typename v>
class con_set;
template<typename key, typename value>
class con_map;
template<typename key, typename value>
class con_map_enum;
template<typename key, typename value>
class con_set_enum;
template<typename T>
struct con_set_is_pointer {
static const bool con_value = false;
};
template<typename T>
struct con_set_is_pointer<T *> {
static const bool con_value = true;
};
/**
* This class was originally inside con_set (con_set::Entry).
* But because GCC is being extremely annoying and is moaning
* because of specialization after instantiation,
* the class is now laying there.
*/
template<typename k, typename v>
class con_set_Entry
{
friend con_set<k, v>;
friend con_set_enum<k, v>;
private:
con_set_Entry *next;
k key;
public:
v value;
public:
void *operator new(size_t size) { return con_set<k, v>::NewEntry(size); }
void operator delete(void *ptr) { con_set<k, v>::DeleteEntry(ptr); }
con_set_Entry()
: key(k())
, value(v())
, next(NULL)
{}
#ifdef ARCHIVE_SUPPORTED
void Archive(Archiver& arc);
#endif
k& GetKey() { return key; }
void SetKey(const k& newKey) { key = newKey; }
};
template<typename k, typename v>
class con_set
{
friend class con_set_enum<k, v>;
public:
using Entry = con_set_Entry<k, v>;
public:
static MEM_BlockAlloc<Entry> Entry_allocator;
protected:
Entry **table; // hashtable
unsigned int tableLength;
unsigned int threshold;
unsigned int count; // num of entries
short unsigned int tableLengthIndex;
Entry *defaultEntry;
protected:
Entry *findKeyEntry(const k& key) const;
Entry *addKeyEntry(const k& key);
Entry *addNewKeyEntry(const k& key);
public:
static void *NewEntry(size_t size);
static void DeleteEntry(void *entry);
public:
con_set();
~con_set();
#ifdef ARCHIVE_SUPPORTED
void Archive(Archiver& arc);
#endif
void clear();
void resize(int count = 0);
v *findKeyValue(const k& key) const;
k *firstKeyValue();
v& addKeyValue(const k& key);
v& addNewKeyValue(const k& key);
bool keyExists(const k& key);
bool isEmpty();
bool remove(const k& key);
unsigned int size();
};
template<typename k, typename v>
MEM_BlockAlloc<typename con_set<k, v>::Entry> con_set<k, v>::Entry_allocator;
template<typename k, typename v>
void *con_set<k, v>::NewEntry(size_t size)
{
return Entry_allocator.Alloc();
}
template<typename k, typename v>
void con_set<k, v>::DeleteEntry(void *entry)
{
Entry_allocator.Free(entry);
}
template<typename k>
int HashCode(const k& key);
template<typename key, typename value>
con_set<key, value>::con_set()
{
tableLength = 1;
table = &defaultEntry;
threshold = 1;
count = 0;
tableLengthIndex = 0;
defaultEntry = NULL;
}
template<typename key, typename value>
con_set<key, value>::~con_set()
{
clear();
}
template<typename key, typename value>
void con_set<key, value>::clear()
{
Entry *entry = NULL;
Entry *next = NULL;
unsigned int i;
for (i = 0; i < tableLength; i++) {
for (entry = table[i]; entry != NULL; entry = next) {
next = entry->next;
delete entry;
}
}
if (tableLength > 1) {
delete[] table;
}
tableLength = 1;
table = &defaultEntry;
threshold = 1;
count = 0;
tableLengthIndex = 0;
defaultEntry = NULL;
}
template<typename key, typename value>
void con_set<key, value>::resize(int count)
{
Entry **oldTable = table;
Entry *e, *old;
unsigned int oldTableLength = tableLength;
unsigned int i;
unsigned int index;
if (count > 0) {
tableLength += count;
threshold = tableLength;
} else {
//threshold = ( unsigned int )( ( float )tableLength * 0.75f );
threshold = (unsigned int)((float)tableLength * 0.75);
if (threshold < 1) {
threshold = 1;
}
tableLength += threshold;
}
// allocate a new table
table = new Entry *[tableLength]();
memset(table, 0, tableLength * sizeof(Entry *));
// rehash the table
for (i = oldTableLength; i > 0; i--) {
// rehash all entries from the old table
for (e = oldTable[i - 1]; e != NULL; e = old) {
old = e->next;
// insert the old entry to the table hashindex
index = HashCode<key>(e->GetKey()) % tableLength;
e->next = table[index];
table[index] = e;
}
}
if (oldTableLength > 1) {
// delete the previous table
delete[] oldTable;
}
}
template<typename k, typename v>
typename con_set<k, v>::Entry *con_set<k, v>::findKeyEntry(const k& key) const
{
Entry *entry;
entry = table[HashCode<k>(key) % tableLength];
for (; entry != NULL; entry = entry->next) {
if (entry->GetKey() == key) {
return entry;
}
}
return NULL;
}
template<typename k, typename v>
typename con_set<k, v>::Entry *con_set<k, v>::addKeyEntry(const k& key)
{
Entry *entry;
entry = findKeyEntry(key);
if (entry != NULL) {
return entry;
} else {
return addNewKeyEntry(key);
}
}
template<typename k, typename v>
typename con_set<k, v>::Entry *con_set<k, v>::addNewKeyEntry(const k& key)
{
Entry *entry;
int hash;
if (count >= threshold) {
resize();
}
count++;
entry = new Entry;
entry->SetKey(key);
hash = HashCode<k>(entry->GetKey()) % tableLength;
if (defaultEntry == NULL) {
defaultEntry = entry;
entry->next = NULL;
} else {
entry->next = table[hash];
}
table[hash] = entry;
return entry;
}
template<typename key, typename value>
bool con_set<key, value>::isEmpty(void)
{
return count == 0;
}
template<typename k, typename v>
bool con_set<k, v>::remove(const k& key)
{
int hash;
int i;
Entry *prev = NULL;
Entry *entry, *e;
hash = HashCode<k>(key) % tableLength;
for (entry = table[hash]; entry != NULL; entry = entry->next) {
// just to make sure we're using the correct overloaded operator for the key
if (!(entry->GetKey() == key)) {
prev = entry;
continue;
}
if (defaultEntry == entry) {
defaultEntry = prev ? prev : table[hash];
// find a default entry
for (i = 0; i < tableLength && !defaultEntry; i++) {
for (e = table[i]; e; e = e->next) {
if (e == entry) {
continue;
}
defaultEntry = e;
break;
}
}
}
if (prev) {
prev->next = entry->next;
} else {
table[hash] = entry->next;
}
count--;
delete entry;
return true;
}
return false;
}
template<typename k, typename v>
v *con_set<k, v>::findKeyValue(const k& key) const
{
Entry *entry = findKeyEntry(key);
if (entry != NULL) {
return &entry->value;
} else {
return NULL;
}
}
template<typename key, typename value>
key *con_set<key, value>::firstKeyValue(void)
{
if (defaultEntry) {
return &defaultEntry->GetKey();
} else {
return NULL;
}
}
template<typename k, typename v>
v& con_set<k, v>::addKeyValue(const k& key)
{
Entry *entry = addKeyEntry(key);
return entry->value;
}
template<typename k, typename v>
v& con_set<k, v>::addNewKeyValue(const k& key)
{
Entry *entry = addNewKeyEntry(key);
return entry->value;
}
template<typename k, typename v>
bool con_set<k, v>::keyExists(const k& key)
{
Entry *entry;
for (entry = table; entry != NULL; entry = entry->next) {
if (entry->GetKey() == key) {
return true;
}
}
return false;
}
template<typename key, typename value>
unsigned int con_set<key, value>::size()
{
return count;
}
template<typename key, typename value>
class con_set_enum
{
friend class con_map_enum<key, value>;
public:
using Entry = typename con_set<key, value>::Entry;
protected:
con_set<key, value> *m_Set;
unsigned int m_Index;
Entry *m_CurrentEntry;
Entry *m_NextEntry;
public:
con_set_enum();
con_set_enum(con_set<key, value>& set);
bool operator=(con_set<key, value>& set);
Entry *NextElement(void);
Entry *CurrentElement(void);
};
template<typename key, typename value>
con_set_enum<key, value>::con_set_enum()
{
m_Set = NULL;
m_Index = 0;
m_CurrentEntry = NULL;
m_NextEntry = NULL;
}
template<typename key, typename value>
con_set_enum<key, value>::con_set_enum(con_set<key, value>& set)
{
*this = set;
}
template<typename key, typename value>
bool con_set_enum<key, value>::operator=(con_set<key, value>& set)
{
m_Set = &set;
m_Index = m_Set->tableLength;
m_CurrentEntry = NULL;
m_NextEntry = NULL;
return true;
}
template<typename key, typename value>
typename con_set_enum<key, value>::Entry *con_set_enum<key, value>::CurrentElement(void)
{
return m_CurrentEntry;
}
template<typename key, typename value>
typename con_set_enum<key, value>::Entry *con_set_enum<key, value>::NextElement(void)
{
if (!m_NextEntry) {
while (1) {
if (!m_Index) {
break;
}
m_Index--;
m_NextEntry = m_Set->table[m_Index];
if (m_NextEntry) {
break;
}
}
if (!m_NextEntry) {
m_CurrentEntry = NULL;
return NULL;
}
}
m_CurrentEntry = m_NextEntry;
m_NextEntry = m_NextEntry->next;
return m_CurrentEntry;
}
template<typename key, typename value>
class con_map
{
friend class con_map_enum<key, value>;
private:
con_set<key, value> m_con_set;
public:
#ifdef ARCHIVE_SUPPORTED
void Archive(Archiver& arc);
#endif
void clear();
virtual void resize(int count = 0);
value& operator[](const key& index);
value *find(const key& index);
bool remove(const key& index);
unsigned int size();
};
template<typename key, typename value>
void con_map<key, value>::clear()
{
m_con_set.clear();
}
template<typename key, typename value>
void con_map<key, value>::resize(int count)
{
m_con_set.resize(count);
}
template<typename key, typename value>
value& con_map<key, value>::operator[](const key& index)
{
return m_con_set.addKeyValue(index);
}
template<typename key, typename value>
value *con_map<key, value>::find(const key& index)
{
return m_con_set.findKeyValue(index);
}
template<typename key, typename value>
bool con_map<key, value>::remove(const key& index)
{
return m_con_set.remove(index);
}
template<typename key, typename value>
unsigned int con_map<key, value>::size(void)
{
return m_con_set.size();
}
template<typename key, typename value>
class con_map_enum
{
public:
using Entry = typename con_set_enum<key, value>::Entry;
private:
con_set_enum<key, value> m_Set_Enum;
public:
con_map_enum();
con_map_enum(con_map<key, value>& map);
bool operator=(con_map<key, value>& map);
key *NextKey(void);
value *NextValue(void);
key *CurrentKey(void);
value *CurrentValue(void);
};
template<typename key, typename value>
con_map_enum<key, value>::con_map_enum()
{
m_Set_Enum.m_Set = NULL;
m_Set_Enum.m_Index = 0;
m_Set_Enum.m_CurrentEntry = NULL;
m_Set_Enum.m_NextEntry = NULL;
}
template<typename key, typename value>
con_map_enum<key, value>::con_map_enum(con_map<key, value>& map)
{
*this = map;
}
template<typename key, typename value>
bool con_map_enum<key, value>::operator=(con_map<key, value>& map)
{
m_Set_Enum = map.m_con_set;
return true;
}
template<typename key, typename value>
key *con_map_enum<key, value>::CurrentKey(void)
{
Entry *entry = m_Set_Enum.CurrentElement();
if (entry) {
return &entry->GetKey();
} else {
return NULL;
}
}
template<typename key, typename value>
value *con_map_enum<key, value>::CurrentValue(void)
{
Entry *entry = m_Set_Enum.CurrentElement();
if (entry) {
return &entry->value;
} else {
return NULL;
}
}
template<typename key, typename value>
key *con_map_enum<key, value>::NextKey(void)
{
Entry *entry = m_Set_Enum.NextElement();
if (entry) {
return &entry->GetKey();
} else {
return NULL;
}
}
template<typename key, typename value>
value *con_map_enum<key, value>::NextValue(void)
{
Entry *entry = m_Set_Enum.NextElement();
if (entry) {
return &entry->value;
} else {
return NULL;
}
}
|