react-arborist 3.0.2 → 3.2.0

package/README.md

@@ -327,6 +327,7 @@ interface TreeProps<T> {
   dndRootElement?: globalThis.Node | null;
   onClick?: MouseEventHandler;
   onContextMenu?: MouseEventHandler;
+  dndManager?: DragDropManager;
 }
 ```
 

package/dist/index.js

@@ -663,9 +663,9 @@ const $58f9381615aa3d17$export$e324594224ef24da = {
                 id
             ]).map((0, $eb5355379510ac9b$export$65e5b62a4c490288))
         }),
-    set: (ids)=>({
+    set: (args)=>({
             type: "SELECTION_SET",
-            ids: ids
+            ...args
         }),
     mostRecent: (id)=>({
             type: "SELECTION_MOST_RECENT",
@@ -708,7 +708,9 @@ function $58f9381615aa3d17$export$1650419e431d3ba3(state = (0, $9d556ecd8e421ffe
         case "SELECTION_SET":
             return {
                 ...state,
-                ids: new Set(action.ids)
+                ids: action.ids,
+                mostRecent: action.mostRecent,
+                anchor: action.anchor
             };
         case "SELECTION_MOST_RECENT":
             return {
@@ -1474,20 +1476,26 @@ function $07d1cda4da20dc54$var$flattenTree(root) {
     return list;
 }
 function $07d1cda4da20dc54$var$flattenAndFilterTree(root, isMatch) {
-    function collect(node) {
-        let result = [];
+    const matches = {};
+    const list = [];
+    function markMatch(node) {
         const yes = !node.isRoot && isMatch(node);
-        if (node.children) for (let child of node.children)result = result.concat(collect(child));
-        if (result.length) {
-            if (!node.isRoot) result.unshift(node);
-            return result;
+        if (yes) {
+            matches[node.id] = true;
+            let parent = node.parent;
+            while(parent){
+                matches[parent.id] = true;
+                parent = parent.parent;
+            }
         }
-        if (yes) return [
-            node
-        ];
-        else return [];
+        if (node.children) for (let child of node.children)markMatch(child);
     }
-    const list = collect(root).filter((n)=>n.parent?.isOpen);
+    function collect(node) {
+        if (node.level >= 0 && matches[node.id]) list.push(node);
+        if (node.isOpen) node.children?.forEach(collect);
+    }
+    markMatch(root);
+    collect(root);
     list.forEach($07d1cda4da20dc54$var$assignRowIndex);
     return list;
 }
@@ -1741,13 +1749,14 @@ class $5c74fef433be2b0a$export$e2da3477247342d1 {
     }
     select(node, opts = {}) {
         if (!node) return;
+        const changeFocus = opts.focus !== false;
         const id = $5c74fef433be2b0a$var$identify(node);
-        this.dispatch((0, $61ef7f2c3c9633e7$export$d7ddd398f22d79ef)(id));
+        if (changeFocus) this.dispatch((0, $61ef7f2c3c9633e7$export$d7ddd398f22d79ef)(id));
         this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).only(id));
         this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).anchor(id));
         this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).mostRecent(id));
         this.scrollTo(id, opts.align);
-        if (this.focusedNode) $5c74fef433be2b0a$var$safeRun(this.props.onFocus, this.focusedNode);
+        if (this.focusedNode && changeFocus) $5c74fef433be2b0a$var$safeRun(this.props.onFocus, this.focusedNode);
         $5c74fef433be2b0a$var$safeRun(this.props.onSelect, this.selectedNodes);
     }
     deselect(node) {
@@ -1779,19 +1788,34 @@ class $5c74fef433be2b0a$export$e2da3477247342d1 {
         $5c74fef433be2b0a$var$safeRun(this.props.onSelect, this.selectedNodes);
     }
     deselectAll() {
-        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).clear());
-        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).anchor(null));
-        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).mostRecent(null));
+        this.setSelection({
+            ids: [],
+            anchor: null,
+            mostRecent: null
+        });
         $5c74fef433be2b0a$var$safeRun(this.props.onSelect, this.selectedNodes);
     }
     selectAll() {
-        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).set(new Set(Object.keys(this.idToIndex))));
+        this.setSelection({
+            ids: Object.keys(this.idToIndex),
+            anchor: this.firstNode,
+            mostRecent: this.lastNode
+        });
         this.dispatch((0, $61ef7f2c3c9633e7$export$d7ddd398f22d79ef)(this.lastNode?.id));
-        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).anchor(this.firstNode));
-        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).mostRecent(this.lastNode));
         if (this.focusedNode) $5c74fef433be2b0a$var$safeRun(this.props.onFocus, this.focusedNode);
         $5c74fef433be2b0a$var$safeRun(this.props.onSelect, this.selectedNodes);
     }
+    setSelection(args) {
+        const ids = new Set(args.ids?.map($5c74fef433be2b0a$var$identify));
+        const anchor = $5c74fef433be2b0a$var$identifyNull(args.anchor);
+        const mostRecent = $5c74fef433be2b0a$var$identifyNull(args.mostRecent);
+        this.dispatch((0, $58f9381615aa3d17$export$e324594224ef24da).set({
+            ids: ids,
+            anchor: anchor,
+            mostRecent: mostRecent
+        }));
+        $5c74fef433be2b0a$var$safeRun(this.props.onSelect, this.selectedNodes);
+    }
     /* Drag and Drop */ get cursorParentId() {
         const { cursor: cursor  } = this.state.dnd;
         switch(cursor.type){
@@ -2052,7 +2076,9 @@ function $9511ad6af37da13b$export$c49dab5eb1b4ce0c({ treeProps: treeProps , impe
     ]);
     /* Expose the tree api */ (0, $foSVk$react.useImperativeHandle)(imperativeHandle, ()=>api);
     /* Change selection based on props */ (0, $foSVk$react.useEffect)(()=>{
-        if (api.props.selection) api.select(api.props.selection);
+        if (api.props.selection) api.select(api.props.selection, {
+            focus: false
+        });
         else api.deselectAll();
     }, [
         api.props.selection
@@ -2075,6 +2101,9 @@ function $9511ad6af37da13b$export$c49dab5eb1b4ce0c({ treeProps: treeProps , impe
                         options: {
                             rootElement: api.props.dndRootElement || undefined
                         },
+                        ...treeProps.dndManager && {
+                            manager: treeProps.dndManager
+                        },
                         children: children
                     })
                 })