| 399 | } |
| 400 | |
| 401 | void Dictionary::reset() |
| 402 | { |
| 403 | if( hashTable && hashTable->owner != this ) |
| 404 | { |
| 405 | hashTable = NULL; |
| 406 | return; |
| 407 | } |
| 408 | |
| 409 | for( U32 i = 0; i < ownHashTable.size; ++ i ) |
| 410 | { |
| 411 | Entry* walk = ownHashTable.data[i]; |
| 412 | while( walk ) |
| 413 | { |
| 414 | Entry* temp = walk->nextEntry; |
| 415 | destructInPlace( walk ); |
| 416 | walk = temp; |
| 417 | } |
| 418 | } |
| 419 | |
| 420 | dMemset( ownHashTable.data, 0, ownHashTable.size * sizeof( Entry* ) ); |
| 421 | ownHashTable.mChunker.freeBlocks( true ); |
| 422 | |
| 423 | ownHashTable.count = 0; |
| 424 | hashTable = NULL; |
| 425 | |
| 426 | scopeName = NULL; |
| 427 | scopeNamespace = NULL; |
| 428 | code = NULL; |
| 429 | ip = 0; |
| 430 | } |
| 431 | |
| 432 | |
| 433 | const char *Dictionary::tabComplete(const char *prevText, S32 baseLen, bool fForward) |
no test coverage detected