* @private
(tree, start, end)
| 162 | * @private |
| 163 | */ |
| 164 | deleteAllCoveredNodes_(tree, start, end) { |
| 165 | const to_delete = []; |
| 166 | let addr = end - this.kOne; |
| 167 | while (addr >= start) { |
| 168 | const node = tree.findGreatestLessThan(addr); |
| 169 | if (node === null) break; |
| 170 | const start2 = node.key, end2 = start2 + node.value.size; |
| 171 | if (start2 < end && start < end2) to_delete.push(start2); |
| 172 | addr = start2 - this.kOne; |
| 173 | } |
| 174 | for (let i = 0, l = to_delete.length; i < l; ++i) tree.remove(to_delete[i]); |
| 175 | } |
| 176 | |
| 177 | /** |
| 178 | * @private |
no test coverage detected