| 413 | } |
| 414 | |
| 415 | void Dictionary::reset() |
| 416 | { |
| 417 | if (hashTable && hashTable->owner != this) |
| 418 | { |
| 419 | hashTable = NULL; |
| 420 | return; |
| 421 | } |
| 422 | |
| 423 | for (U32 i = 0; i < ownHashTable.size; ++i) |
| 424 | { |
| 425 | Entry* walk = ownHashTable.data[i]; |
| 426 | while (walk) |
| 427 | { |
| 428 | Entry* temp = walk->nextEntry; |
| 429 | destructInPlace(walk); |
| 430 | walk = temp; |
| 431 | } |
| 432 | } |
| 433 | |
| 434 | dMemset(ownHashTable.data, 0, ownHashTable.size * sizeof(Entry*)); |
| 435 | ownHashTable.mChunker.freeBlocks(true); |
| 436 | |
| 437 | ownHashTable.count = 0; |
| 438 | hashTable = NULL; |
| 439 | |
| 440 | scopeName = NULL; |
| 441 | scopeNamespace = NULL; |
| 442 | code = NULL; |
| 443 | ip = 0; |
| 444 | } |
| 445 | |
| 446 | |
| 447 | const char *Dictionary::tabComplete(const char *prevText, S32 baseLen, bool fForward) |
no test coverage detected