| 426 | }); |
| 427 | }, |
| 428 | moveBefore(key: Key, keys: Iterable<Key>) { |
| 429 | setItems(prevState => { |
| 430 | let {items, nodeMap} = prevState; |
| 431 | let node = nodeMap.get(key); |
| 432 | if (!node) { |
| 433 | return prevState; |
| 434 | } |
| 435 | let toParentKey = node.parentKey ?? null; |
| 436 | let parent: null | TreeNode<T> = null; |
| 437 | if (toParentKey != null) { |
| 438 | parent = nodeMap.get(toParentKey) ?? null; |
| 439 | } |
| 440 | let toIndex = parent?.children ? parent.children.indexOf(node) : items.indexOf(node); |
| 441 | return moveItems(prevState, keys, parent, toIndex, updateTree, addNode); |
| 442 | }); |
| 443 | }, |
| 444 | moveAfter(key: Key, keys: Iterable<Key>) { |
| 445 | setItems(prevState => { |
| 446 | let {items, nodeMap} = prevState; |