@neo4j-ndl/react 2.9.4 → 2.10.0

package/lib/esm/tree-view/TreeViewTextItem.js

@@ -0,0 +1,147 @@
+var __rest = (this && this.__rest) || function (s, e) {
+    var t = {};
+    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
+        t[p] = s[p];
+    if (s != null && typeof Object.getOwnPropertySymbols === "function")
+        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
+            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
+                t[p[i]] = s[p[i]];
+        }
+    return t;
+};
+import { createElement as _createElement } from "react";
+import { jsx as _jsx, jsxs as _jsxs } from "react/jsx-runtime";
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+import React from 'react';
+import { ConditionalWrap } from '../_common/coditionalWrap';
+import { IconButton } from '../button';
+import { Checkbox } from '../checkbox';
+import { ChevronDownIconOutline, ChevronRightIconOutline } from '../icons';
+import { Typography } from '../typography';
+import { TreeItemWrapper } from './TreeItemWrapper';
+/**
+ * checks if any parent is checked
+ * @param item
+ * @param items
+ * @returns
+ */
+const parentIsCheckedRecursively = (item, items) => {
+    const parent = items.find((i) => i.id === item.parentId);
+    if (parent) {
+        if (parent.isSelected) {
+            return true;
+        }
+        return parentIsCheckedRecursively(parent, items);
+    }
+    return false;
+};
+/**
+ * checks if any children are checked
+ * @param item
+ * @param items
+ * @returns
+ */
+const childrenCheckedRecursively = (item, items) => {
+    const children = items.filter((i) => i.parentId === item.id);
+    if (children.length === 0) {
+        return false;
+    }
+    return children.some((i) => i.isSelected || childrenCheckedRecursively(i, items));
+};
+export const TreeViewTextItem = React.forwardRef(function TreeViewTextItem(_a, ref) {
+    var { depth, shouldDisableInteraction, shouldDisableSorting, isGhost, indentationWidth, isIndicator, isCollapsed, onCollapse, item, parent, isOver, isOverParent, setNodeRef, setActivatorNodeRef, dragHandleProps, style, trails, onItemsChanged, items, tabIndex } = _a, restProps = __rest(_a, ["depth", "shouldDisableInteraction", "shouldDisableSorting", "isGhost", "indentationWidth", "isIndicator", "isCollapsed", "onCollapse", "item", "parent", "isOver", "isOverParent", "setNodeRef", "setActivatorNodeRef", "dragHandleProps", "style", "trails", "onItemsChanged", "items", "tabIndex"]);
+    const checkboxRef = React.useRef(null);
+    const isAnyParentChecked = parentIsCheckedRecursively(item, items);
+    if (checkboxRef.current) {
+        const isAnyChildChecked = childrenCheckedRecursively(item, items);
+        if (isAnyChildChecked && !isAnyParentChecked && !item.isSelected) {
+            checkboxRef.current.indeterminate = true;
+        }
+        else {
+            checkboxRef.current.indeterminate = false;
+        }
+    }
+    return (_jsxs(TreeItemWrapper, Object.assign({ depth: depth, shouldDisableInteraction: shouldDisableInteraction, shouldDisableSorting: shouldDisableSorting, isGhost: isGhost, indentationWidth: indentationWidth, isIndicator: isIndicator, isCollapsed: isCollapsed, onCollapse: onCollapse, item: item, parent: parent, isOver: isOver, isOverParent: isOverParent, setNodeRef: setNodeRef, setActivatorNodeRef: setActivatorNodeRef, dragHandleProps: dragHandleProps, style: style, trails: trails, 
+        // eslint-disable-next-line @typescript-eslint/no-empty-function
+        onItemsChanged: () => { }, ref: ref, items: items, tabIndex: tabIndex }, restProps, { children: [item.canHaveSubItems && onCollapse && (_jsxs("button", { className: "ndl-tree-view-collapse-button", onClick: () => onCollapse(), "aria-label": item.isCollapsed ? 'Expand' : 'Collapse', "aria-expanded": item.isCollapsed ? 'false' : 'true', "aria-pressed": !item.isCollapsed, 
+                /**
+                 * Tab index is set to -1 to prevent the item from being focused when the tree is navigated with tab
+                 * since we use the arrow keys instead
+                 */
+                tabIndex: tabIndex, children: [item.isCollapsed && _jsx(ChevronRightIconOutline, { className: "ndl-icon" }), !item.isCollapsed && _jsx(ChevronDownIconOutline, { className: "ndl-icon" })] })), item.isSelected !== undefined && (_jsx(Checkbox, { ref: checkboxRef, checked: item.isSelected, tabIndex: tabIndex, onChange: (event) => {
+                    const newItems = items.map((i) => {
+                        if (i.id === item.id) {
+                            return Object.assign(Object.assign({}, i), { isSelected: event.target.checked });
+                        }
+                        return i;
+                    });
+                    //Uncheck parents if a child is unchecked
+                    if (!event.target.checked) {
+                        let parentId = item.parentId;
+                        while (parentId !== null) {
+                            const parent = newItems.find((newItem) => newItem.id === parentId);
+                            if (parent) {
+                                newItems.forEach((newItem) => {
+                                    if (newItem.id === parent.id) {
+                                        newItem.isSelected = false;
+                                    }
+                                });
+                                parentId = parent.parentId;
+                            }
+                            else {
+                                parentId = null;
+                            }
+                        }
+                    }
+                    //Check children if a parent is checked
+                    if (item.canHaveSubItems) {
+                        const childIdsToUncheck = items
+                            .filter((i) => i.parentId === item.id)
+                            .map((i) => i.id);
+                        while (childIdsToUncheck.length > 0) {
+                            const childId = childIdsToUncheck.pop();
+                            const child = items.find((i) => i.id === childId);
+                            if (child) {
+                                newItems.forEach((newItem) => {
+                                    if (newItem.id === child.id) {
+                                        newItem.isSelected = event.target.checked;
+                                    }
+                                });
+                                newItems
+                                    .filter((i) => i.parentId === child.id)
+                                    .forEach((i) => {
+                                    childIdsToUncheck.push(i.id);
+                                });
+                            }
+                        }
+                    }
+                    onItemsChanged(newItems, { item, reason: 'selected' });
+                }, "aria-label": item.data.text })), _jsx(ConditionalWrap, { condition: item.data.onTextClick !== undefined, wrapper: (children) => (_jsx("button", { onClick: item.data.onTextClick, className: "ndl-tree-view-text-clickable", tabIndex: tabIndex, children: children })), children: _jsx(Typography, { style: {
+                        overflow: 'hidden',
+                        textOverflow: 'ellipsis',
+                        whiteSpace: 'nowrap',
+                    }, variant: item.canHaveSubItems ? 'subheading-small' : 'body-medium', children: item.data.text }) }), _jsx("div", { className: "ndl-tree-view-actions", children: item.data.actions &&
+                    item.data.actions.map((action, index) => {
+                        return (_createElement(IconButton, Object.assign({}, action.buttonProps, { key: index, className: "ndl-tree-view-action", clean: true, size: "small", tabIndex: tabIndex }), action.icon));
+                    }) })] })));
+});
+//# sourceMappingURL=TreeViewTextItem.js.map

package/lib/esm/tree-view/TreeViewTextItem.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeViewTextItem.js","sourceRoot":"","sources":["../../../src/tree-view/TreeViewTextItem.tsx"],"names":[],"mappings":";;;;;;;;;;;;;AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,KAAK,MAAM,OAAO,CAAC;AAE1B,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,MAAM,UAAU,CAAC;AAC3E,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAOpD;;;;;GAKG;AACH,MAAM,0BAA0B,GAAG,CACjC,IAAqC,EACrC,KAAwC,EAC/B,EAAE;IACX,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzD,IAAI,MAAM,EAAE;QACV,IAAI,MAAM,CAAC,UAAU,EAAE;YACrB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,0BAA0B,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;KAClD;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,0BAA0B,GAAG,CACjC,IAAqC,EACrC,KAAwC,EAC/B,EAAE;IACX,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;QACzB,OAAO,KAAK,CAAC;KACd;IACD,OAAO,QAAQ,CAAC,IAAI,CAClB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,0BAA0B,CAAC,CAAC,EAAE,KAAK,CAAC,CAC5D,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,KAAK,CAAC,UAAU,CAAC,SAAS,gBAAgB,CACxE,EAsBuC,EACvC,GAAoC;QAvBpC,EACE,KAAK,EACL,wBAAwB,EACxB,oBAAoB,EACpB,OAAO,EACP,gBAAgB,EAChB,WAAW,EACX,WAAW,EACX,UAAU,EACV,IAAI,EACJ,MAAM,EACN,MAAM,EACN,YAAY,EACZ,UAAU,EACV,mBAAmB,EACnB,eAAe,EACf,KAAK,EACL,MAAM,EACN,cAAc,EACd,KAAK,EACL,QAAQ,OAE6B,EADlC,SAAS,cArBd,sSAsBC,CADa;IAId,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAmB,IAAI,CAAC,CAAC;IACzD,MAAM,kBAAkB,GAAG,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACnE,IAAI,WAAW,CAAC,OAAO,EAAE;QACvB,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAClE,IAAI,iBAAiB,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YAChE,WAAW,CAAC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;SAC1C;aAAM;YACL,WAAW,CAAC,OAAO,CAAC,aAAa,GAAG,KAAK,CAAC;SAC3C;KACF;IAED,OAAO,CACL,MAAC,eAAe,kBACd,KAAK,EAAE,KAAK,EACZ,wBAAwB,EAAE,wBAAwB,EAClD,oBAAoB,EAAE,oBAAoB,EAC1C,OAAO,EAAE,OAAO,EAChB,gBAAgB,EAAE,gBAAgB,EAClC,WAAW,EAAE,WAAW,EACxB,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,UAAU,EACtB,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,YAAY,EAC1B,UAAU,EAAE,UAAU,EACtB,mBAAmB,EAAE,mBAAmB,EACxC,eAAe,EAAE,eAAe,EAChC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM;QACd,gEAAgE;QAChE,cAAc,EAAE,GAAG,EAAE,GAAE,CAAC,EACxB,GAAG,EAAE,GAAG,EACR,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,QAAQ,IACd,SAAS,eAEZ,IAAI,CAAC,eAAe,IAAI,UAAU,IAAI,CACrC,kBACE,SAAS,EAAC,+BAA+B,EACzC,OAAO,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE,gBACf,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,mBACrC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,kBACpC,CAAC,IAAI,CAAC,WAAW;gBAC/B;;;mBAGG;gBACH,QAAQ,EAAE,QAAQ,aAEjB,IAAI,CAAC,WAAW,IAAI,KAAC,uBAAuB,IAAC,SAAS,EAAC,UAAU,GAAG,EACpE,CAAC,IAAI,CAAC,WAAW,IAAI,KAAC,sBAAsB,IAAC,SAAS,EAAC,UAAU,GAAG,IAC9D,CACV,EACA,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,CAChC,KAAC,QAAQ,IACP,GAAG,EAAE,WAAW,EAChB,OAAO,EAAE,IAAI,CAAC,UAAU,EACxB,QAAQ,EAAE,QAAQ,EAClB,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;oBAClB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBAC/B,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE;4BACpB,uCACK,CAAC,KACJ,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,IAChC;yBACH;wBACD,OAAO,CAAC,CAAC;oBACX,CAAC,CAAC,CAAC;oBAEH,yCAAyC;oBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE;wBACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;wBAC7B,OAAO,QAAQ,KAAK,IAAI,EAAE;4BACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAC1B,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,QAAQ,CACrC,CAAC;4BACF,IAAI,MAAM,EAAE;gCACV,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oCAC3B,IAAI,OAAO,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE;wCAC5B,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC;qCAC5B;gCACH,CAAC,CAAC,CAAC;gCACH,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;6BAC5B;iCAAM;gCACL,QAAQ,GAAG,IAAI,CAAC;6BACjB;yBACF;qBACF;oBACD,uCAAuC;oBACvC,IAAI,IAAI,CAAC,eAAe,EAAE;wBACxB,MAAM,iBAAiB,GAAG,KAAK;6BAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;6BACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBACpB,OAAO,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;4BACnC,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,EAAE,CAAC;4BACxC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;4BAClD,IAAI,KAAK,EAAE;gCACT,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oCAC3B,IAAI,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,EAAE;wCAC3B,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC;qCAC3C;gCACH,CAAC,CAAC,CAAC;gCACH,QAAQ;qCACL,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,KAAK,CAAC,EAAE,CAAC;qCACtC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;oCACb,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gCAC/B,CAAC,CAAC,CAAC;6BACN;yBACF;qBACF;oBACD,cAAc,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;gBACzD,CAAC,gBACW,IAAI,CAAC,IAAI,CAAC,IAAI,GAC1B,CACH,EAED,KAAC,eAAe,IACd,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9C,OAAO,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,CACrB,iBACE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAC9B,SAAS,EAAC,8BAA8B,EACxC,QAAQ,EAAE,QAAQ,YAEjB,QAAQ,GACF,CACV,YAED,KAAC,UAAU,IACT,KAAK,EAAE;wBACL,QAAQ,EAAE,QAAQ;wBAClB,YAAY,EAAE,UAAU;wBACxB,UAAU,EAAE,QAAQ;qBACrB,EACD,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,aAAa,YAEjE,IAAI,CAAC,IAAI,CAAC,IAAI,GACJ,GACG,EAClB,cAAK,SAAS,EAAC,uBAAuB,YACnC,IAAI,CAAC,IAAI,CAAC,OAAO;oBAChB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;wBACtC,OAAO,CACL,eAAC,UAAU,oBACL,MAAM,CAAC,WAAW,IACtB,GAAG,EAAE,KAAK,EACV,SAAS,EAAC,sBAAsB,EAChC,KAAK,QACL,IAAI,EAAC,OAAO,EACZ,QAAQ,EAAE,QAAQ,KAEjB,MAAM,CAAC,IAAI,CACD,CACd,CAAC;oBACJ,CAAC,CAAC,GACA,KACU,CACnB,CAAC;AACJ,CAAC,CAKsB,CAAC"}

package/lib/esm/tree-view/TreeViewTrail.js

@@ -0,0 +1,26 @@
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+import { jsx as _jsx, jsxs as _jsxs } from "react/jsx-runtime";
+export const Trail = ({ variant }) => {
+    return (_jsxs("div", { className: "ndl-trail", children: [variant === 'straight' && (_jsx("svg", { className: "ndl-trail-straight", width: "2", height: "24", viewBox: "0 0 2 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", children: _jsx("path", { d: "M1.00001 16.0005L1 -4.00049L1 28.0004", stroke: "#BBBEC3" }) })), variant === 'curved' && (_jsx("svg", { className: "ndl-trail-curved", width: "9", height: "13", viewBox: "0 0 9 13", fill: "none", xmlns: "http://www.w3.org/2000/svg", children: _jsx("path", { d: "M1 -4L1 3.99988C1 8.41816 4.58172 11.9999 9 11.9999V11.9999", stroke: "#BBBEC3" }) })), variant === 'straight-curved' && (_jsxs("svg", { className: "ndl-trail-straight-curved", width: "16", height: "24", viewBox: "0 0 16 24", fill: "none", xmlns: "http://www.w3.org/2000/svg", children: [_jsx("g", { clipPath: "url(#clip0_16990_133)", children: _jsx("path", { d: "M16 12V12C11.5817 12 8.00001 8.41828 8.00001 4L8.00001 -4L8 28", stroke: "#BBBEC3" }) }), _jsx("defs", { children: _jsx("clipPath", { id: "clip0_16990_133", children: _jsx("rect", { width: "16", height: "24", fill: "white" }) }) })] }))] }));
+};
+//# sourceMappingURL=TreeViewTrail.js.map

package/lib/esm/tree-view/TreeViewTrail.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeViewTrail.js","sourceRoot":"","sources":["../../../src/tree-view/TreeViewTrail.tsx"],"names":[],"mappings":";AAwBA,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,EAAE,OAAO,EAAc,EAAE,EAAE;IAC/C,OAAO,CACL,eAAK,SAAS,EAAC,WAAW,aACvB,OAAO,KAAK,UAAU,IAAI,CACzB,cACE,SAAS,EAAC,oBAAoB,EAC9B,KAAK,EAAC,GAAG,EACT,MAAM,EAAC,IAAI,EACX,OAAO,EAAC,UAAU,EAClB,IAAI,EAAC,MAAM,EACX,KAAK,EAAC,4BAA4B,YAElC,eAAM,CAAC,EAAC,uCAAuC,EAAC,MAAM,EAAC,SAAS,GAAG,GAC/D,CACP,EACA,OAAO,KAAK,QAAQ,IAAI,CACvB,cACE,SAAS,EAAC,kBAAkB,EAC5B,KAAK,EAAC,GAAG,EACT,MAAM,EAAC,IAAI,EACX,OAAO,EAAC,UAAU,EAClB,IAAI,EAAC,MAAM,EACX,KAAK,EAAC,4BAA4B,YAElC,eACE,CAAC,EAAC,6DAA6D,EAC/D,MAAM,EAAC,SAAS,GAChB,GACE,CACP,EACA,OAAO,KAAK,iBAAiB,IAAI,CAChC,eACE,SAAS,EAAC,2BAA2B,EACrC,KAAK,EAAC,IAAI,EACV,MAAM,EAAC,IAAI,EACX,OAAO,EAAC,WAAW,EACnB,IAAI,EAAC,MAAM,EACX,KAAK,EAAC,4BAA4B,aAElC,YAAG,QAAQ,EAAC,uBAAuB,YACjC,eACE,CAAC,EAAC,gEAAgE,EAClE,MAAM,EAAC,SAAS,GAChB,GACA,EACJ,yBACE,mBAAU,EAAE,EAAC,iBAAiB,YAC5B,eAAM,KAAK,EAAC,IAAI,EAAC,MAAM,EAAC,IAAI,EAAC,IAAI,EAAC,OAAO,GAAG,GACnC,GACN,IACH,CACP,IACG,CACP,CAAC;AACJ,CAAC,CAAC"}

package/lib/esm/tree-view/index.js

@@ -0,0 +1,22 @@
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+export { TreeView } from './TreeView';
+//# sourceMappingURL=index.js.map

package/lib/esm/tree-view/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tree-view/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC"}

package/lib/esm/tree-view/tree-view-keyboard-coordinates.js

@@ -0,0 +1,115 @@
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+import { KeyboardCode, closestCorners, getFirstCollision, } from '@dnd-kit/core';
+import { getProjection } from './tree-view-utils';
+const directions = [
+    KeyboardCode.Down,
+    KeyboardCode.Right,
+    KeyboardCode.Up,
+    KeyboardCode.Left,
+];
+const horizontal = [KeyboardCode.Left, KeyboardCode.Right];
+export const sortableTreeKeyboardCoordinates = (context, indicator, indentationWidth) => (event, { currentCoordinates, context: { active, over, collisionRect, droppableRects, droppableContainers, }, }) => {
+    if (directions.includes(event.code)) {
+        if (!active || !collisionRect) {
+            return;
+        }
+        event.preventDefault();
+        const { current: { items, offset }, } = context;
+        if (horizontal.includes(event.code) && (over === null || over === void 0 ? void 0 : over.id)) {
+            const { depth, maxDepth, minDepth } = getProjection(items, active.id, over.id, offset, indentationWidth);
+            switch (event.code) {
+                case KeyboardCode.Left:
+                    if (depth > minDepth) {
+                        return Object.assign(Object.assign({}, currentCoordinates), { x: currentCoordinates.x - indentationWidth });
+                    }
+                    break;
+                case KeyboardCode.Right:
+                    if (depth < maxDepth) {
+                        return Object.assign(Object.assign({}, currentCoordinates), { x: currentCoordinates.x + indentationWidth });
+                    }
+                    break;
+            }
+            return undefined;
+        }
+        const containers = [];
+        droppableContainers.forEach((container) => {
+            if ((container === null || container === void 0 ? void 0 : container.disabled) ||
+                container.id === (over === null || over === void 0 ? void 0 : over.id) ||
+                (container === null || container === void 0 ? void 0 : container.id) === 'ndl-active-tree-item') {
+                return;
+            }
+            const rect = droppableRects.get(container.id);
+            if (!rect) {
+                return;
+            }
+            switch (event.code) {
+                case KeyboardCode.Down:
+                    if (collisionRect.top < rect.top) {
+                        containers.push(container);
+                    }
+                    break;
+                case KeyboardCode.Up:
+                    if (collisionRect.top > rect.top) {
+                        containers.push(container);
+                    }
+                    break;
+            }
+        });
+        const collisions = closestCorners({
+            active,
+            collisionRect,
+            pointerCoordinates: null,
+            droppableRects,
+            droppableContainers: containers,
+        });
+        let closestId = getFirstCollision(collisions, 'id');
+        if (closestId === (over === null || over === void 0 ? void 0 : over.id) && collisions.length > 1) {
+            closestId = collisions[1].id;
+        }
+        if (closestId && (over === null || over === void 0 ? void 0 : over.id)) {
+            const activeRect = droppableRects.get(active.id);
+            const newRect = droppableRects.get(closestId);
+            const newDroppable = droppableContainers.get(closestId);
+            if (activeRect && newRect && newDroppable) {
+                const newIndex = items.findIndex(({ id }) => id === closestId);
+                const newItem = items[newIndex];
+                const activeIndex = items.findIndex(({ id }) => id === active.id);
+                const activeItem = items[activeIndex];
+                if (newItem && activeItem) {
+                    const { depth } = getProjection(items, active.id, closestId, (newItem.depth - activeItem.depth) * indentationWidth, indentationWidth);
+                    const isBelow = newIndex > activeIndex;
+                    const modifier = isBelow ? 1 : -1;
+                    const offset = indicator
+                        ? (collisionRect.height - activeRect.height) / 2
+                        : 0;
+                    const newCoordinates = {
+                        x: newRect.left + depth * indentationWidth,
+                        y: newRect.top + modifier * offset,
+                    };
+                    return newCoordinates;
+                }
+            }
+        }
+    }
+    return undefined;
+};
+//# sourceMappingURL=tree-view-keyboard-coordinates.js.map

package/lib/esm/tree-view/tree-view-keyboard-coordinates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-view-keyboard-coordinates.js","sourceRoot":"","sources":["../../../src/tree-view/tree-view-keyboard-coordinates.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAEL,YAAY,EAEZ,cAAc,EACd,iBAAiB,GAClB,MAAM,eAAe,CAAC;AAEvB,OAAO,EAAsB,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEtE,MAAM,UAAU,GAAa;IAC3B,YAAY,CAAC,IAAI;IACjB,YAAY,CAAC,KAAK;IAClB,YAAY,CAAC,EAAE;IACf,YAAY,CAAC,IAAI;CAClB,CAAC;AAEF,MAAM,UAAU,GAAa,CAAC,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;AAErE,MAAM,CAAC,MAAM,+BAA+B,GAK1C,CAAC,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,EAAE,CACzC,CACE,KAAK,EACL,EACE,kBAAkB,EAClB,OAAO,EAAE,EACP,MAAM,EACN,IAAI,EACJ,aAAa,EACb,cAAc,EACd,mBAAmB,GACpB,GACF,EACD,EAAE;IACF,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;QACnC,IAAI,CAAC,MAAM,IAAI,CAAC,aAAa,EAAE;YAC7B,OAAO;SACR;QACD,KAAK,CAAC,cAAc,EAAE,CAAC;QAEvB,MAAM,EACJ,OAAO,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAC3B,GAAG,OAAO,CAAC;QACZ,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,CAAA,EAAE;YAC/C,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,aAAa,CACjD,KAAK,EACL,MAAM,CAAC,EAAE,EACT,IAAI,CAAC,EAAE,EACP,MAAM,EACN,gBAAgB,CACjB,CAAC;YAEF,QAAQ,KAAK,CAAC,IAAI,EAAE;gBAClB,KAAK,YAAY,CAAC,IAAI;oBACpB,IAAI,KAAK,GAAG,QAAQ,EAAE;wBACpB,uCACK,kBAAkB,KACrB,CAAC,EAAE,kBAAkB,CAAC,CAAC,GAAG,gBAAgB,IAC1C;qBACH;oBACD,MAAM;gBACR,KAAK,YAAY,CAAC,KAAK;oBACrB,IAAI,KAAK,GAAG,QAAQ,EAAE;wBACpB,uCACK,kBAAkB,KACrB,CAAC,EAAE,kBAAkB,CAAC,CAAC,GAAG,gBAAgB,IAC1C;qBACH;oBACD,MAAM;aACT;YAED,OAAO,SAAS,CAAC;SAClB;QAED,MAAM,UAAU,GAAyB,EAAE,CAAC;QAE5C,mBAAmB,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;YACxC,IACE,CAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,QAAQ;gBACnB,SAAS,CAAC,EAAE,MAAK,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,CAAA;gBACzB,CAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,EAAE,MAAK,sBAAsB,EACxC;gBACA,OAAO;aACR;YACD,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAE9C,IAAI,CAAC,IAAI,EAAE;gBACT,OAAO;aACR;YAED,QAAQ,KAAK,CAAC,IAAI,EAAE;gBAClB,KAAK,YAAY,CAAC,IAAI;oBACpB,IAAI,aAAa,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;wBAChC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;qBAC5B;oBACD,MAAM;gBACR,KAAK,YAAY,CAAC,EAAE;oBAClB,IAAI,aAAa,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;wBAChC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;qBAC5B;oBACD,MAAM;aACT;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG,cAAc,CAAC;YAChC,MAAM;YACN,aAAa;YACb,kBAAkB,EAAE,IAAI;YACxB,cAAc;YACd,mBAAmB,EAAE,UAAU;SAChC,CAAC,CAAC;QACH,IAAI,SAAS,GAAG,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACpD,IAAI,SAAS,MAAK,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,CAAA,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YACnD,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC9B;QAED,IAAI,SAAS,KAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,EAAE,CAAA,EAAE;YACzB,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC9C,MAAM,YAAY,GAAG,mBAAmB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAExD,IAAI,UAAU,IAAI,OAAO,IAAI,YAAY,EAAE;gBACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;gBAC/D,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAChC,MAAM,WAAW,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;gBAClE,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;gBAEtC,IAAI,OAAO,IAAI,UAAU,EAAE;oBACzB,MAAM,EAAE,KAAK,EAAE,GAAG,aAAa,CAC7B,KAAK,EACL,MAAM,CAAC,EAAE,EACT,SAAS,EACT,CAAC,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,gBAAgB,EACrD,gBAAgB,CACjB,CAAC;oBACF,MAAM,OAAO,GAAG,QAAQ,GAAG,WAAW,CAAC;oBACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClC,MAAM,MAAM,GAAG,SAAS;wBACtB,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC;wBAChD,CAAC,CAAC,CAAC,CAAC;oBAEN,MAAM,cAAc,GAAG;wBACrB,CAAC,EAAE,OAAO,CAAC,IAAI,GAAG,KAAK,GAAG,gBAAgB;wBAC1C,CAAC,EAAE,OAAO,CAAC,GAAG,GAAG,QAAQ,GAAG,MAAM;qBACnC,CAAC;oBAEF,OAAO,cAAc,CAAC;iBACvB;aACF;SACF;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC"}

package/lib/esm/tree-view/tree-view-keyboard-helpers.js

@@ -0,0 +1,68 @@
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+import { findFocusableChildren } from '../_common/utils';
+const focusElementInElement = (parentElement, newParentElement, activeElement) => {
+    const focusable = findFocusableChildren(newParentElement);
+    const focusableCurrent = findFocusableChildren(parentElement);
+    const cellIndex = focusableCurrent.indexOf(activeElement);
+    let newIndex = cellIndex;
+    if (cellIndex >= focusable.length) {
+        newIndex = focusable.length - 1;
+    }
+    else if (cellIndex < 0) {
+        newIndex = 0;
+    }
+    const element = focusable[newIndex];
+    if (element instanceof HTMLElement) {
+        element.focus();
+    }
+};
+export const focusNextRow = (parentElement) => {
+    const { nextElementSibling } = parentElement;
+    if (nextElementSibling instanceof HTMLElement) {
+        nextElementSibling.focus();
+    }
+};
+export const focusPreviousRow = (parentElement) => {
+    const { previousElementSibling } = parentElement;
+    if (previousElementSibling instanceof HTMLElement) {
+        previousElementSibling.focus();
+    }
+};
+export const focusCellInNextRow = (parentElement) => {
+    const { nextElementSibling } = parentElement;
+    const { activeElement } = document;
+    if (!(nextElementSibling instanceof HTMLElement) ||
+        !(activeElement instanceof HTMLElement)) {
+        return;
+    }
+    focusElementInElement(parentElement, nextElementSibling, activeElement);
+};
+export const focusCellInPreviousRow = (parentElement) => {
+    const { previousElementSibling } = parentElement;
+    const { activeElement } = document;
+    if (!(previousElementSibling instanceof HTMLElement) ||
+        !(activeElement instanceof HTMLElement)) {
+        return;
+    }
+    focusElementInElement(parentElement, previousElementSibling, activeElement);
+};
+//# sourceMappingURL=tree-view-keyboard-helpers.js.map

package/lib/esm/tree-view/tree-view-keyboard-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-view-keyboard-helpers.js","sourceRoot":"","sources":["../../../src/tree-view/tree-view-keyboard-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AAEzD,MAAM,qBAAqB,GAAG,CAC5B,aAA0B,EAC1B,gBAA6B,EAC7B,aAA0B,EAC1B,EAAE;IACF,MAAM,SAAS,GAAG,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;IAC1D,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAC9D,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAE1D,IAAI,QAAQ,GAAG,SAAS,CAAC;IAEzB,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,EAAE;QACjC,QAAQ,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;KACjC;SAAM,IAAI,SAAS,GAAG,CAAC,EAAE;QACxB,QAAQ,GAAG,CAAC,CAAC;KACd;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IACpC,IAAI,OAAO,YAAY,WAAW,EAAE;QAClC,OAAO,CAAC,KAAK,EAAE,CAAC;KACjB;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,aAA0B,EAAE,EAAE;IACzD,MAAM,EAAE,kBAAkB,EAAE,GAAG,aAAa,CAAC;IAC7C,IAAI,kBAAkB,YAAY,WAAW,EAAE;QAC7C,kBAAkB,CAAC,KAAK,EAAE,CAAC;KAC5B;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,aAA0B,EAAE,EAAE;IAC7D,MAAM,EAAE,sBAAsB,EAAE,GAAG,aAAa,CAAC;IACjD,IAAI,sBAAsB,YAAY,WAAW,EAAE;QACjD,sBAAsB,CAAC,KAAK,EAAE,CAAC;KAChC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,aAA0B,EAAE,EAAE;IAC/D,MAAM,EAAE,kBAAkB,EAAE,GAAG,aAAa,CAAC;IAC7C,MAAM,EAAE,aAAa,EAAE,GAAG,QAAQ,CAAC;IACnC,IACE,CAAC,CAAC,kBAAkB,YAAY,WAAW,CAAC;QAC5C,CAAC,CAAC,aAAa,YAAY,WAAW,CAAC,EACvC;QACA,OAAO;KACR;IAED,qBAAqB,CAAC,aAAa,EAAE,kBAAkB,EAAE,aAAa,CAAC,CAAC;AAC1E,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,aAA0B,EAAE,EAAE;IACnE,MAAM,EAAE,sBAAsB,EAAE,GAAG,aAAa,CAAC;IACjD,MAAM,EAAE,aAAa,EAAE,GAAG,QAAQ,CAAC;IACnC,IACE,CAAC,CAAC,sBAAsB,YAAY,WAAW,CAAC;QAChD,CAAC,CAAC,aAAa,YAAY,WAAW,CAAC,EACvC;QACA,OAAO;KACR;IAED,qBAAqB,CAAC,aAAa,EAAE,sBAAsB,EAAE,aAAa,CAAC,CAAC;AAC9E,CAAC,CAAC"}

package/lib/esm/tree-view/tree-view-types.js

@@ -0,0 +1,23 @@
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+export {};
+//# sourceMappingURL=tree-view-types.js.map

package/lib/esm/tree-view/tree-view-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-view-types.js","sourceRoot":"","sources":["../../../src/tree-view/tree-view-types.ts"],"names":[],"mappings":""}

package/lib/esm/tree-view/tree-view-utils.js

@@ -0,0 +1,179 @@
+/**
+ *
+ *  Copyright (c) "Neo4j"
+ *  Neo4j Sweden AB [http://neo4j.com]
+ *
+ *  This file is part of Neo4j.
+ *
+ *  Neo4j is free software: you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+import { arrayMove } from '@dnd-kit/sortable';
+/**
+ * Takes a tree and flattens it into a list of item
+ * where each item has a depth and a parentId.
+ * @param tree the tree to flatten
+ * @param depth the depth of the root of the tree (default 0)
+ * @param parentId the id of the parent of the root of the tree (default null)
+ * @returns a list of items with depth and parentId
+ */
+export const flattenTree = (tree, depth = 0, parentId = null) => {
+    const flattened = [];
+    tree.forEach((item) => {
+        flattened.push(Object.assign(Object.assign({}, item), { depth: depth, parentId: parentId }));
+        if (item.canHaveSubItems) {
+            flattenTree(item.subItems, depth + 1, item.id).forEach((subItem) => flattened.push(Object.assign({}, subItem)));
+        }
+    });
+    return flattened;
+};
+/**
+ * Removes the children of the items with the given ids
+ * @param items the flattened tree items to remove the children from
+ * @param ids the ids of the items to remove the children from
+ * @returns a new list of items with the children of the items with the given ids removed
+ */
+export function removeChildrenOf(items, ids) {
+    const excludeParentIds = [...ids];
+    return items.filter((item) => {
+        if (item.parentId !== null && excludeParentIds.includes(item.parentId)) {
+            if (item.canHaveSubItems && item.subItems.length > 0) {
+                excludeParentIds.push(item.id);
+            }
+            return false;
+        }
+        return true;
+    });
+}
+/**
+ * Builds a tree from a list of flattened tree items
+ * @param items the flattened tree items
+ * @returns the items as a tree data structure
+ */
+export function buildTree(items) {
+    const tree = [];
+    const itemMap = {};
+    items.forEach((item) => {
+        const { id } = item;
+        if (item.canHaveSubItems) {
+            itemMap[id] = {
+                id: id,
+                canHaveSubItems: true,
+                isCollapsed: item.isCollapsed,
+                subItems: [],
+                data: item.data,
+                isSelected: item.isSelected,
+                isSortable: item.isSortable,
+            };
+        }
+        else {
+            itemMap[id] = {
+                id: id,
+                canHaveSubItems: false,
+                data: item.data,
+                isSortable: item.isSortable,
+                isSelected: item.isSelected,
+            };
+        }
+    });
+    // Build the tree structure by assigning children to their parent items
+    items.forEach((item) => {
+        const { id, parentId } = item;
+        if (parentId !== null) {
+            const parentItem = itemMap[parentId];
+            if (parentItem && parentItem.canHaveSubItems) {
+                parentItem.subItems.push(itemMap[id]);
+            }
+        }
+        else {
+            tree.push(itemMap[id]);
+        }
+    });
+    return tree;
+}
+function getDragDepth(offset, indentationWidth) {
+    return Math.round(offset / indentationWidth);
+}
+function getMaxDepth({ previousItem, }) {
+    var _a;
+    if (previousItem && previousItem.canHaveSubItems === true) {
+        return previousItem.depth + 1;
+    }
+    return (_a = previousItem === null || previousItem === void 0 ? void 0 : previousItem.depth) !== null && _a !== void 0 ? _a : 0;
+}
+function getMinDepth({ nextItem }) {
+    if (nextItem) {
+        return nextItem.depth;
+    }
+    return 0;
+}
+/**
+ * Calculates the new depth, max depth, min depth and parent id of the item being dragged
+ * Used to project the position of the dragged item. For example, to convert the item being dragged into a placeholder.
+ * such as the line that appears when dragging an item in a tree view.
+ * @param items the flattened tree items
+ * @param activeId the id of the item being dragged
+ * @param overId the id of the item that the dragged item is being dragged over
+ * @param dragOffset the offset of the drag in pixels
+ * @param indentationWidth the width of the indentation in pixels
+ * @returns the depth, max depth, min depth and parent id of the item being dragged
+ */
+export function getProjection(items, activeId, overId, dragOffset, indentationWidth) {
+    const overItemIndex = items.findIndex(({ id }) => id === overId);
+    const activeItemIndex = items.findIndex(({ id }) => id === activeId);
+    const activeItem = items[activeItemIndex];
+    const newItems = arrayMove(items, activeItemIndex, overItemIndex);
+    const previousItem = newItems[overItemIndex - 1];
+    const nextItem = newItems[overItemIndex + 1];
+    const dragDepth = getDragDepth(dragOffset, indentationWidth);
+    const projectedDepth = activeItem.depth + dragDepth;
+    const maxDepth = getMaxDepth({
+        previousItem,
+    });
+    const minDepth = getMinDepth({ nextItem });
+    let depth = projectedDepth;
+    if (projectedDepth >= maxDepth) {
+        depth = maxDepth;
+    }
+    else if (projectedDepth < minDepth) {
+        depth = minDepth;
+    }
+    return { depth, maxDepth, minDepth, parentId: getParentId() };
+    function getParentId() {
+        var _a;
+        if (depth === 0 || !previousItem) {
+            return null;
+        }
+        if (depth === previousItem.depth) {
+            return previousItem.parentId;
+        }
+        if (depth > previousItem.depth) {
+            return previousItem.id;
+        }
+        const newParent = (_a = newItems
+            .slice(0, overItemIndex)
+            .reverse()
+            .find((item) => item.depth === depth)) === null || _a === void 0 ? void 0 : _a.parentId;
+        return newParent !== null && newParent !== void 0 ? newParent : null;
+    }
+}
+/**
+ *
+ * @param transform a transform object
+ * @returns a css transform string
+ */
+export const transformToString = (transform) => {
+    return `scaleX(${transform.scaleX}) scaleY(${transform.scaleY}) translate3d(${transform.x}px, ${transform.y}px, 0)`;
+};
+//# sourceMappingURL=tree-view-utils.js.map

package/lib/esm/tree-view/tree-view-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-view-utils.js","sourceRoot":"","sources":["../../../src/tree-view/tree-view-utils.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAU9C;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CACzB,IAAmB,EACnB,KAAK,GAAG,CAAC,EACT,WAAoC,IAAI,EAChB,EAAE;IAC1B,MAAM,SAAS,GAA2B,EAAE,CAAC;IAE7C,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACpB,SAAS,CAAC,IAAI,iCACT,IAAI,KACP,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,QAAQ,IAClB,CAAC;QAEH,IAAI,IAAI,CAAC,eAAe,EAAE;YACxB,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CACjE,SAAS,CAAC,IAAI,mBAAM,OAAO,EAAG,CAC/B,CAAC;SACH;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAA6B,EAC7B,GAAuB;IAEvB,MAAM,gBAAgB,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3B,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YACtE,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACpD,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAChC;YACD,OAAO,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAI,KAA6B;IACxD,MAAM,IAAI,GAAkB,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAkC,EAAE,CAAC;IAElD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACrB,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAEpB,IAAI,IAAI,CAAC,eAAe,EAAE;YACxB,OAAO,CAAC,EAAE,CAAC,GAAG;gBACZ,EAAE,EAAE,EAAE;gBACN,eAAe,EAAE,IAAI;gBACrB,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,QAAQ,EAAE,EAAE;gBACZ,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;aAC5B,CAAC;SACH;aAAM;YACL,OAAO,CAAC,EAAE,CAAC,GAAG;gBACZ,EAAE,EAAE,EAAE;gBACN,eAAe,EAAE,KAAK;gBACtB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;aAC5B,CAAC;SACH;IACH,CAAC,CAAC,CAAC;IAEH,uEAAuE;IACvE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACrB,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QAC9B,IAAI,QAAQ,KAAK,IAAI,EAAE;YACrB,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,UAAU,IAAI,UAAU,CAAC,eAAe,EAAE;gBAC5C,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;aACvC;SACF;aAAM;YACL,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;SACxB;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,MAAc,EAAE,gBAAwB;IAC5D,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,WAAW,CAAI,EACtB,YAAY,GAGb;;IACC,IAAI,YAAY,IAAI,YAAY,CAAC,eAAe,KAAK,IAAI,EAAE;QACzD,OAAO,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC;KAC/B;IAED,OAAO,MAAA,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,KAAK,mCAAI,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,WAAW,CAAI,EAAE,QAAQ,EAAsC;IACtE,IAAI,QAAQ,EAAE;QACZ,OAAO,QAAQ,CAAC,KAAK,CAAC;KACvB;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA6B,EAC7B,QAA0B,EAC1B,MAAwB,EACxB,UAAkB,EAClB,gBAAwB;IAExB,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IACjE,MAAM,eAAe,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;IAClE,MAAM,YAAY,GAAG,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,YAAY,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;IAC7D,MAAM,cAAc,GAAG,UAAU,CAAC,KAAK,GAAG,SAAS,CAAC;IACpD,MAAM,QAAQ,GAAG,WAAW,CAAC;QAC3B,YAAY;KACb,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,WAAW,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC3C,IAAI,KAAK,GAAG,cAAc,CAAC;IAE3B,IAAI,cAAc,IAAI,QAAQ,EAAE;QAC9B,KAAK,GAAG,QAAQ,CAAC;KAClB;SAAM,IAAI,cAAc,GAAG,QAAQ,EAAE;QACpC,KAAK,GAAG,QAAQ,CAAC;KAClB;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE,CAAC;IAE9D,SAAS,WAAW;;QAClB,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE;YAChC,OAAO,IAAI,CAAC;SACb;QAED,IAAI,KAAK,KAAK,YAAY,CAAC,KAAK,EAAE;YAChC,OAAO,YAAY,CAAC,QAAQ,CAAC;SAC9B;QAED,IAAI,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE;YAC9B,OAAO,YAAY,CAAC,EAAE,CAAC;SACxB;QAED,MAAM,SAAS,GAAG,MAAA,QAAQ;aACvB,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC;aACvB,OAAO,EAAE;aACT,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,0CAAE,QAAQ,CAAC;QAElD,OAAO,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,IAAI,CAAC;IAC3B,CAAC;AACH,CAAC;AACD;;;;GAIG;AAEH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,SAKjC,EAAE,EAAE;IACH,OAAO,UAAU,SAAS,CAAC,MAAM,YAAY,SAAS,CAAC,MAAM,iBAAiB,SAAS,CAAC,CAAC,OAAO,SAAS,CAAC,CAAC,QAAQ,CAAC;AACtH,CAAC,CAAC"}

package/lib/types/_common/utils.d.ts

@@ -50,3 +50,15 @@ export declare function isRefObject<T>(obj: React.RefObject<T> | T): obj is Reac
  * or vice versa.
  */
 export declare function findUntil(direction: 'next' | 'prev', el: Element | ChildNode, matchSelector: string): Element | null;
+/**
+ * Find all html elements that are focusable given a parent element
+ * @param parentElement the parent element
+ * @returns an array of HTML elements
+ */
+export declare const findFocusableChildren: (parentElement: HTMLElement) => Element[];
+/**
+ * Using the element that currently has focus, finds the previous sibling of the currently focused element that is focusable
+ * @param parentRef the parent element
+ * @returns the previous focusable element
+ */
+export declare const findFocusableSibling: (parentRef: React.RefObject<HTMLElement>, direction: 'prev' | 'next') => HTMLElement | undefined;