| 520 | } |
| 521 | |
| 522 | LASinterval::~LASinterval() |
| 523 | { |
| 524 | // loop over all cells |
| 525 | my_cell_hash::iterator hash_element = ((my_cell_hash*)cells)->begin(); |
| 526 | while (hash_element != ((my_cell_hash*)cells)->end()) |
| 527 | { |
| 528 | LASintervalCell* previous_cell = (*hash_element).second; |
| 529 | LASintervalCell* cell = previous_cell->next; |
| 530 | while (cell) |
| 531 | { |
| 532 | delete previous_cell; |
| 533 | previous_cell = cell; |
| 534 | cell = cell->next; |
| 535 | } |
| 536 | delete previous_cell; |
| 537 | hash_element++; |
| 538 | } |
| 539 | delete ((my_cell_hash*)cells); |
| 540 | // maybe delete temporary merge cells from the previous merge |
| 541 | if (merged_cells) |
| 542 | { |
| 543 | if (merged_cells_temporary) |
| 544 | { |
| 545 | LASintervalCell* next_next; |
| 546 | LASintervalCell* next = merged_cells->next; |
| 547 | while (next) |
| 548 | { |
| 549 | next_next = next->next; |
| 550 | delete next; |
| 551 | next = next_next; |
| 552 | } |
| 553 | delete merged_cells; |
| 554 | } |
| 555 | merged_cells = 0; |
| 556 | } |
| 557 | if (cells_to_merge) delete ((my_cell_set*)cells_to_merge); |
| 558 | } |
| 559 | |
| 560 | BOOL LASinterval::read(ByteStreamIn* stream) |
| 561 | { |
nothing calls this directly
no outgoing calls
no test coverage detected