(key: Key, ...values: T[])
| 312 | }); |
| 313 | }, |
| 314 | insertBefore(key: Key, ...values: T[]): void { |
| 315 | let node = nodeMap.get(key); |
| 316 | if (!node) { |
| 317 | return; |
| 318 | } |
| 319 | |
| 320 | let parentNode = nodeMap.get(node.parentKey!); |
| 321 | let nodes = parentNode ? parentNode.children : items; |
| 322 | let index = nodes!.indexOf(node); |
| 323 | this.insert(parentNode?.key ?? null, index, ...values); |
| 324 | }, |
| 325 | insertAfter(key: Key, ...values: T[]): void { |
| 326 | let node = nodeMap.get(key); |
| 327 | if (!node) { |