reneco-hierarchized-picker 0.4.3-beta.18 → 0.4.3-beta.19

package/dist/cjs/reneco-hierarchized-picker_2.cjs.entry.js

@@ -18461,7 +18461,7 @@ function findNodeById(tree, nodeId) {
 /**
  * Fills the tree with nodes based on the provided object.
  */
-function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
+function fillTreeWithObject(tree, myObject, searched, options) {
   const searchResultPresentsUnMatched = options.searchResultPresentsUnMatched;
   if (myObject && myObject.length) {
     myObject.forEach(value => {
@@ -18493,7 +18493,6 @@ function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
       const objToPush = {
         id: keyPropFromNode,
         nodeId: keyPropFromNode,
-        depth,
         text: valueTranslatedPropFromNode,
         fullpath: fullpathPropFromNode,
         fullpathTranslated: fullpathTranslatedPropFromNode,
@@ -18502,7 +18501,7 @@ function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
         isDesaturated: false,
         searchMatch: false,
       };
-      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options, depth + 1);
+      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options);
       let pushMe = false;
       if (searched) {
         const matched = searchValue(objToPush, false, searched);
@@ -19528,6 +19527,28 @@ const HierarchizedPickerComponent = class {
     document.querySelectorAll('#tree-area-' + this.componentID + ' .treejs-checkbox').forEach((item) => (item.style.display = (this.theOptions.multiple ? 'inline-block' : 'none')));
   }
   onItemContextMenuItemClick(e) {
+    if (e.target && e.target.id) {
+      function getDirectParentAndDepth(nodesById, targetId) {
+        // Find the direct parent
+        const parent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === targetId); }) || null;
+        if (!nodesById[targetId])
+          return null; // target not found
+        // Depth is 0 for root nodes, 1 for children of root, etc.
+        let depth = 0;
+        let current = targetId;
+        while (true) {
+          const directParent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === current); });
+          if (!directParent)
+            break;
+          depth++;
+          current = directParent.id;
+        }
+        return { parent, depth };
+      }
+      const result = getDirectParentAndDepth(this.loadedTreeJs.nodesById, e.target.id);
+      e.target.depth = result.depth;
+      e.target.parentId = result.parent.id;
+    }
     this.itemContextMenuItemClick.emit(e);
   }
   setNodeAsSelected(id, treeToUpdate, userClick) {

package/dist/collection/components/hierarchized-picker/hierarchized-picker.js

@@ -789,6 +789,28 @@ export class HierarchizedPickerComponent {
     document.querySelectorAll('#tree-area-' + this.componentID + ' .treejs-checkbox').forEach((item) => (item.style.display = (this.theOptions.multiple ? 'inline-block' : 'none')));
   }
   onItemContextMenuItemClick(e) {
+    if (e.target && e.target.id) {
+      function getDirectParentAndDepth(nodesById, targetId) {
+        // Find the direct parent
+        const parent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === targetId); }) || null;
+        if (!nodesById[targetId])
+          return null; // target not found
+        // Depth is 0 for root nodes, 1 for children of root, etc.
+        let depth = 0;
+        let current = targetId;
+        while (true) {
+          const directParent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === current); });
+          if (!directParent)
+            break;
+          depth++;
+          current = directParent.id;
+        }
+        return { parent, depth };
+      }
+      const result = getDirectParentAndDepth(this.loadedTreeJs.nodesById, e.target.id);
+      e.target.depth = result.depth;
+      e.target.parentId = result.parent.id;
+    }
     this.itemContextMenuItemClick.emit(e);
   }
   setNodeAsSelected(id, treeToUpdate, userClick) {

package/dist/collection/features/tree/tree-utils.js

@@ -47,7 +47,7 @@ export function findNodeById(tree, nodeId) {
 /**
  * Fills the tree with nodes based on the provided object.
  */
-export function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
+export function fillTreeWithObject(tree, myObject, searched, options) {
   const searchResultPresentsUnMatched = options.searchResultPresentsUnMatched;
   if (myObject && myObject.length) {
     myObject.forEach(value => {
@@ -79,7 +79,6 @@ export function fillTreeWithObject(tree, myObject, searched, options, depth = 0)
       const objToPush = {
         id: keyPropFromNode,
         nodeId: keyPropFromNode,
-        depth,
         text: valueTranslatedPropFromNode,
         fullpath: fullpathPropFromNode,
         fullpathTranslated: fullpathTranslatedPropFromNode,
@@ -88,7 +87,7 @@ export function fillTreeWithObject(tree, myObject, searched, options, depth = 0)
         isDesaturated: false,
         searchMatch: false,
       };
-      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options, depth + 1);
+      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options);
       let pushMe = false;
       if (searched) {
         const matched = searchValue(objToPush, false, searched);

package/dist/custom-elements/index.js

@@ -18458,7 +18458,7 @@ function findNodeById(tree, nodeId) {
 /**
  * Fills the tree with nodes based on the provided object.
  */
-function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
+function fillTreeWithObject(tree, myObject, searched, options) {
   const searchResultPresentsUnMatched = options.searchResultPresentsUnMatched;
   if (myObject && myObject.length) {
     myObject.forEach(value => {
@@ -18490,7 +18490,6 @@ function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
       const objToPush = {
         id: keyPropFromNode,
         nodeId: keyPropFromNode,
-        depth,
         text: valueTranslatedPropFromNode,
         fullpath: fullpathPropFromNode,
         fullpathTranslated: fullpathTranslatedPropFromNode,
@@ -18499,7 +18498,7 @@ function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
         isDesaturated: false,
         searchMatch: false,
       };
-      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options, depth + 1);
+      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options);
       let pushMe = false;
       if (searched) {
         const matched = searchValue(objToPush, false, searched);
@@ -19526,6 +19525,28 @@ const HierarchizedPickerComponent = class extends HTMLElement {
     document.querySelectorAll('#tree-area-' + this.componentID + ' .treejs-checkbox').forEach((item) => (item.style.display = (this.theOptions.multiple ? 'inline-block' : 'none')));
   }
   onItemContextMenuItemClick(e) {
+    if (e.target && e.target.id) {
+      function getDirectParentAndDepth(nodesById, targetId) {
+        // Find the direct parent
+        const parent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === targetId); }) || null;
+        if (!nodesById[targetId])
+          return null; // target not found
+        // Depth is 0 for root nodes, 1 for children of root, etc.
+        let depth = 0;
+        let current = targetId;
+        while (true) {
+          const directParent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === current); });
+          if (!directParent)
+            break;
+          depth++;
+          current = directParent.id;
+        }
+        return { parent, depth };
+      }
+      const result = getDirectParentAndDepth(this.loadedTreeJs.nodesById, e.target.id);
+      e.target.depth = result.depth;
+      e.target.parentId = result.parent.id;
+    }
     this.itemContextMenuItemClick.emit(e);
   }
   setNodeAsSelected(id, treeToUpdate, userClick) {

package/dist/esm/reneco-hierarchized-picker_2.entry.js

@@ -18457,7 +18457,7 @@ function findNodeById(tree, nodeId) {
 /**
  * Fills the tree with nodes based on the provided object.
  */
-function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
+function fillTreeWithObject(tree, myObject, searched, options) {
   const searchResultPresentsUnMatched = options.searchResultPresentsUnMatched;
   if (myObject && myObject.length) {
     myObject.forEach(value => {
@@ -18489,7 +18489,6 @@ function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
       const objToPush = {
         id: keyPropFromNode,
         nodeId: keyPropFromNode,
-        depth,
         text: valueTranslatedPropFromNode,
         fullpath: fullpathPropFromNode,
         fullpathTranslated: fullpathTranslatedPropFromNode,
@@ -18498,7 +18497,7 @@ function fillTreeWithObject(tree, myObject, searched, options, depth = 0) {
         isDesaturated: false,
         searchMatch: false,
       };
-      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options, depth + 1);
+      const childTree = fillTreeWithObject(objToPush.children, childrenPropFromNode, searched, options);
       let pushMe = false;
       if (searched) {
         const matched = searchValue(objToPush, false, searched);
@@ -19524,6 +19523,28 @@ const HierarchizedPickerComponent = class {
     document.querySelectorAll('#tree-area-' + this.componentID + ' .treejs-checkbox').forEach((item) => (item.style.display = (this.theOptions.multiple ? 'inline-block' : 'none')));
   }
   onItemContextMenuItemClick(e) {
+    if (e.target && e.target.id) {
+      function getDirectParentAndDepth(nodesById, targetId) {
+        // Find the direct parent
+        const parent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === targetId); }) || null;
+        if (!nodesById[targetId])
+          return null; // target not found
+        // Depth is 0 for root nodes, 1 for children of root, etc.
+        let depth = 0;
+        let current = targetId;
+        while (true) {
+          const directParent = Object.values(nodesById).find(node => { var _a; return (_a = node.children) === null || _a === void 0 ? void 0 : _a.some(child => child.id === current); });
+          if (!directParent)
+            break;
+          depth++;
+          current = directParent.id;
+        }
+        return { parent, depth };
+      }
+      const result = getDirectParentAndDepth(this.loadedTreeJs.nodesById, e.target.id);
+      e.target.depth = result.depth;
+      e.target.parentId = result.parent.id;
+    }
     this.itemContextMenuItemClick.emit(e);
   }
   setNodeAsSelected(id, treeToUpdate, userClick) {