(...keys: Key[])
| 348 | } |
| 349 | }, |
| 350 | remove(...keys: Key[]) { |
| 351 | if (keys.length === 0) { |
| 352 | return; |
| 353 | } |
| 354 | |
| 355 | let newItems = items; |
| 356 | let prevMap = nodeMap; |
| 357 | let newTree; |
| 358 | for (let key of keys) { |
| 359 | newTree = updateTree(newItems, key, () => null, prevMap); |
| 360 | prevMap = newTree.nodeMap; |
| 361 | newItems = newTree.items; |
| 362 | } |
| 363 | |
| 364 | setItems(newTree); |
| 365 | |
| 366 | let selection = new Set(selectedKeys); |
| 367 | for (let key of selectedKeys) { |
| 368 | if (!newTree.nodeMap.has(key)) { |
| 369 | selection.delete(key); |
| 370 | } |
| 371 | } |
| 372 | |
| 373 | setSelectedKeys(selection); |
| 374 | }, |
| 375 | removeSelectedItems() { |
| 376 | this.remove(...selectedKeys); |
| 377 | }, |
nothing calls this directly
no test coverage detected