| 348 | } |
| 349 | } |
| 350 | void bm_DeleteHashTable() { |
| 351 | if (bm_hashTable) { |
| 352 | int idx; |
| 353 | for (idx = 0; idx < bm_hashTableSize; idx++) { |
| 354 | if (bm_hashTable[idx]) { |
| 355 | bm_Node *curr, *next; |
| 356 | curr = bm_hashTable[idx]; |
| 357 | while (curr) { |
| 358 | next = curr->next; |
| 359 | mem_free(curr); |
| 360 | curr = next; |
| 361 | } |
| 362 | bm_hashTable[idx] = NULL; |
| 363 | } |
| 364 | } |
| 365 | |
| 366 | mem_free(bm_hashTable); |
| 367 | bm_hashTable = NULL; |
| 368 | } |
| 369 | } |
| 370 | |
| 371 | bm_hashTableIndex bm_hash(bm_T data) { |
| 372 | /*********************************** |
no outgoing calls
no test coverage detected