| 668 | node = next(node); |
| 669 | } |
| 670 | Allocator::iterator Allocator::begin() const |
| 671 | { |
| 672 | Node *n = tree.root; |
| 673 | if (n == nullptr) |
| 674 | return end(); |
| 675 | while (n->entry.left != nullptr) |
| 676 | n = n->entry.left; |
| 677 | Allocator::iterator i = {n}; |
| 678 | return i; |
| 679 | } |
| 680 | Allocator::iterator Allocator::find(intptr_t addr) const |
| 681 | { |
| 682 | Node *n = this->tree.root; |
no outgoing calls
no test coverage detected