@sme.up/ketchup 9.2.0 → 9.3.0

package/dist/collection/components/kup-tree/kup-tree-declarations.js

@@ -4,32 +4,32 @@
  */
 export var KupTreeProps;
 (function (KupTreeProps) {
-  KupTreeProps["asAccordion"] = "When enabled, the first level of depth will give an accordion look to nodes.";
-  KupTreeProps["columns"] = "The columns of the tree when tree visualization is active.";
-  KupTreeProps["customStyle"] = "Custom style of the component.";
-  KupTreeProps["data"] = "The json data used to populate the tree view: the basic, always visible tree nodes.";
-  KupTreeProps["density"] = "The density of the rows, defaults at 'medium' and can also be set to 'dense' or 'wide'.";
-  KupTreeProps["dynamicExpansionCallback"] = "Function that gets invoked when a new set of nodes must be loaded as children of a node. When useDynamicExpansion is set, the tree component will have two different behaviors depending on the value of this prop. If this prop is set to null, no callback to download data is available: the component will emit an event requiring the parent to load the children of the given node. If this prop is set to have a callback, then the component will automatically make requests to load children of a given node. After the load has been completed, a different event will be fired to alert the parent of the change.";
-  KupTreeProps["enableExtraColumns"] = "Enables adding extra columns.";
-  KupTreeProps["expanded"] = "Flag: the nodes of the whole tree must be already expanded upon loading. Disabled nodes do NOT get expanded.";
-  KupTreeProps["expansionMode"] = "Behavior of nodes' expansion: it can be chosen between expanding a node by clicking on the dropdown icon, or by clicking on the whole node.";
-  KupTreeProps["filters"] = "List of filters set by the user.";
-  KupTreeProps["globalFilter"] = "When set to true it activates the global filter.";
-  KupTreeProps["globalFilterValue"] = "The value of the global filter.";
-  KupTreeProps["globalFilterMode"] = "The mode of the global filter.";
-  KupTreeProps["removableColumns"] = "Sets the possibility to remove the selected column.";
-  KupTreeProps["preventXScroll"] = "Experimental feature: when active, the tree will try to prevent horizontal overflowing elements by setting a width on the content of the table cells. It works only on cells of the main column.";
-  KupTreeProps["ripple"] = "When enabled displays Material's ripple effect on nodes (only when no columns are displayed).";
-  KupTreeProps["scrollOnHover"] = "Activates the scroll on hover function.";
-  KupTreeProps["showColumns"] = "Shows the tree data as a table.";
-  KupTreeProps["showFilters"] = "When set to true enables the column filters.";
-  KupTreeProps["showFooter"] = "When set to true shows the footer.";
-  KupTreeProps["showHeader"] = "Flag: shows the header of the tree when the tree is displayed as a table.";
-  KupTreeProps["showIcons"] = "Shows the icons of the nodes.";
-  KupTreeProps["stateId"] = "";
-  KupTreeProps["store"] = "";
-  KupTreeProps["totals"] = "Defines the current totals options.";
-  KupTreeProps["useDynamicExpansion"] = "When the component must use the dynamic expansion feature to open its nodes, it means that not all the nodes of the tree have been passed inside the data property. Therefore, when expanding a node, the tree must emit an event (or run a given callback) and wait for the child nodes to be downloaded from the server.";
+    KupTreeProps["asAccordion"] = "When enabled, the first level of depth will give an accordion look to nodes.";
+    KupTreeProps["columns"] = "The columns of the tree when tree visualization is active.";
+    KupTreeProps["customStyle"] = "Custom style of the component.";
+    KupTreeProps["data"] = "The json data used to populate the tree view: the basic, always visible tree nodes.";
+    KupTreeProps["density"] = "The density of the rows, defaults at 'medium' and can also be set to 'dense' or 'wide'.";
+    KupTreeProps["dynamicExpansionCallback"] = "Function that gets invoked when a new set of nodes must be loaded as children of a node. When useDynamicExpansion is set, the tree component will have two different behaviors depending on the value of this prop. If this prop is set to null, no callback to download data is available: the component will emit an event requiring the parent to load the children of the given node. If this prop is set to have a callback, then the component will automatically make requests to load children of a given node. After the load has been completed, a different event will be fired to alert the parent of the change.";
+    KupTreeProps["enableExtraColumns"] = "Enables adding extra columns.";
+    KupTreeProps["expanded"] = "Flag: the nodes of the whole tree must be already expanded upon loading. Disabled nodes do NOT get expanded.";
+    KupTreeProps["expansionMode"] = "Behavior of nodes' expansion: it can be chosen between expanding a node by clicking on the dropdown icon, or by clicking on the whole node.";
+    KupTreeProps["filters"] = "List of filters set by the user.";
+    KupTreeProps["globalFilter"] = "When set to true it activates the global filter.";
+    KupTreeProps["globalFilterValue"] = "The value of the global filter.";
+    KupTreeProps["globalFilterMode"] = "The mode of the global filter.";
+    KupTreeProps["removableColumns"] = "Sets the possibility to remove the selected column.";
+    KupTreeProps["preventXScroll"] = "Experimental feature: when active, the tree will try to prevent horizontal overflowing elements by setting a width on the content of the table cells. It works only on cells of the main column.";
+    KupTreeProps["ripple"] = "When enabled displays Material's ripple effect on nodes (only when no columns are displayed).";
+    KupTreeProps["scrollOnHover"] = "Activates the scroll on hover function.";
+    KupTreeProps["showColumns"] = "Shows the tree data as a table.";
+    KupTreeProps["showFilters"] = "When set to true enables the column filters.";
+    KupTreeProps["showFooter"] = "When set to true shows the footer.";
+    KupTreeProps["showHeader"] = "Flag: shows the header of the tree when the tree is displayed as a table.";
+    KupTreeProps["showIcons"] = "Shows the icons of the nodes.";
+    KupTreeProps["stateId"] = "";
+    KupTreeProps["store"] = "";
+    KupTreeProps["totals"] = "Defines the current totals options.";
+    KupTreeProps["useDynamicExpansion"] = "When the component must use the dynamic expansion feature to open its nodes, it means that not all the nodes of the tree have been passed inside the data property. Therefore, when expanding a node, the tree must emit an event (or run a given callback) and wait for the child nodes to be downloaded from the server.";
 })(KupTreeProps || (KupTreeProps = {}));
 /**
  * The name of the constant used by the tree component to identify the main tree in column menu
@@ -38,6 +38,6 @@ export var KupTreeProps;
 export const treeMainColumnName = 'TREE_COLUMN';
 export var KupTreeExpansionMode;
 (function (KupTreeExpansionMode) {
-  KupTreeExpansionMode["DROPDOWN"] = "dropdown";
-  KupTreeExpansionMode["NODE"] = "node";
+    KupTreeExpansionMode["DROPDOWN"] = "dropdown";
+    KupTreeExpansionMode["NODE"] = "node";
 })(KupTreeExpansionMode || (KupTreeExpansionMode = {}));

package/dist/collection/components/kup-tree/kup-tree-faker.js

@@ -1,14 +1,14 @@
 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;
+    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;
 };
 //---- Constants ----
 /**
@@ -17,42 +17,42 @@ var __rest = (this && this.__rest) || function (s, e) {
  * @namespace
  */
 const TreeDataPool = {
-  /**
-   * IMPORTANT: colors here must always be specified as rgb or rgba()
-   * This is due to a browser method getComputedStyle which always computes the colors as rgb/rgba values
-   * So when using a HEX color (for example) to test these objects, the test will fail due to a different color format received.
-   *
-   * See [this issue]{@link https://www.npmjs.com/package/color} event if it's related to Cypress and not Jest.
-   * The concepts are identical.
-   *
-   * @memberOf! TreeDataPool
-   * @see https://www.npmjs.com/package/color
-   */
-  cellStyles: [
-    {
-      'background-color': 'rgb(84, 84, 84)',
-      color: 'rgba(255, 0, 255, 0.87)',
-    },
-    {
-      'background-color': 'rgba(0, 255, 0, 0.54)',
-      color: 'rgb(255, 255, 255)',
-      'font-size': '20px',
-    },
-    {
-      'background-color': 'rgb(46, 125, 50)',
-      color: 'rgba(130, 20, 200, 0.54)',
-      'text-decoration': 'underline',
-    },
-    {
-      backgroundColor: 'rgb(0, 16, 100)',
-      borderRadius: '4px',
-      color: 'rgba(0, 200, 225, 0.54)',
-      textDecoration: 'line-through',
-    },
-  ],
-  columnsName: ['Mat', 'Program', 'Attack', 'Defense'],
-  nameValues: ['DELGIO', 'CASFRA', 'PARFRA', 'FIOGIA', 'ZAMCHI'],
-  programValues: ['Java', 'Javascript', 'Delphi', 'Kotlin', 'Go'],
+    /**
+     * IMPORTANT: colors here must always be specified as rgb or rgba()
+     * This is due to a browser method getComputedStyle which always computes the colors as rgb/rgba values
+     * So when using a HEX color (for example) to test these objects, the test will fail due to a different color format received.
+     *
+     * See [this issue]{@link https://www.npmjs.com/package/color} event if it's related to Cypress and not Jest.
+     * The concepts are identical.
+     *
+     * @memberOf! TreeDataPool
+     * @see https://www.npmjs.com/package/color
+     */
+    cellStyles: [
+        {
+            'background-color': 'rgb(84, 84, 84)',
+            color: 'rgba(255, 0, 255, 0.87)',
+        },
+        {
+            'background-color': 'rgba(0, 255, 0, 0.54)',
+            color: 'rgb(255, 255, 255)',
+            'font-size': '20px',
+        },
+        {
+            'background-color': 'rgb(46, 125, 50)',
+            color: 'rgba(130, 20, 200, 0.54)',
+            'text-decoration': 'underline',
+        },
+        {
+            backgroundColor: 'rgb(0, 16, 100)',
+            borderRadius: '4px',
+            color: 'rgba(0, 200, 225, 0.54)',
+            textDecoration: 'line-through',
+        },
+    ],
+    columnsName: ['Mat', 'Program', 'Attack', 'Defense'],
+    nameValues: ['DELGIO', 'CASFRA', 'PARFRA', 'FIOGIA', 'ZAMCHI'],
+    programValues: ['Java', 'Javascript', 'Delphi', 'Kotlin', 'Go'],
 };
 //---- Helper methods ----
 /**
@@ -60,33 +60,33 @@ const TreeDataPool = {
  * @param probability - The probability that the returned boolean will be truthy.
  */
 function getBooleanOnProbability(probability = 0.5) {
-  return Math.random() < probability;
+    return Math.random() < probability;
 }
 export function getRandomInteger(maximum = 10) {
-  return Math.round(Math.random() * maximum);
+    return Math.round(Math.random() * maximum);
 }
 export function getTreeNodeFromPath(treeNodes, path) {
-  if (path.length) {
-    let supportTreeNode = treeNodes[path[0]];
-    for (let i = 1; i < path.length; i++) {
-      supportTreeNode = supportTreeNode.children[path[i]];
+    if (path.length) {
+        let supportTreeNode = treeNodes[path[0]];
+        for (let i = 1; i < path.length; i++) {
+            supportTreeNode = supportTreeNode.children[path[i]];
+        }
+        return supportTreeNode;
     }
-    return supportTreeNode;
-  }
-  return null;
+    return null;
 }
 export function flattenTree(nodesToFlatten, useIsExpandedFlag = true) {
-  let flattenedNodes = [];
-  if (nodesToFlatten && nodesToFlatten.length) {
-    for (let i = 0; i < nodesToFlatten.length; i++) {
-      flattenedNodes.push(nodesToFlatten[i]);
-      if (!useIsExpandedFlag ||
-        (useIsExpandedFlag && nodesToFlatten[i].isExpanded)) {
-        flattenedNodes = flattenedNodes.concat(flattenTree(nodesToFlatten[i].children));
-      }
+    let flattenedNodes = [];
+    if (nodesToFlatten && nodesToFlatten.length) {
+        for (let i = 0; i < nodesToFlatten.length; i++) {
+            flattenedNodes.push(nodesToFlatten[i]);
+            if (!useIsExpandedFlag ||
+                (useIsExpandedFlag && nodesToFlatten[i].isExpanded)) {
+                flattenedNodes = flattenedNodes.concat(flattenTree(nodesToFlatten[i].children));
+            }
+        }
     }
-  }
-  return flattenedNodes;
+    return flattenedNodes;
 }
 /**
  * Randomly selects a not disabled node.
@@ -96,127 +96,127 @@ export function flattenTree(nodesToFlatten, useIsExpandedFlag = true) {
  * @param currentDepth
  */
 function randomlyTraverseTree(currentDepthTreeElements, desiredTreeNodeDepth, currentDepth = 0) {
-  let itemIndex = getRandomInteger(currentDepthTreeElements.length - 1);
-  let count = 0;
-  // Searches a non disabled node
-  while (count < currentDepthTreeElements.length &&
-    currentDepthTreeElements[itemIndex].disabled) {
-    itemIndex++;
-    count++;
-    if (itemIndex >= currentDepthTreeElements.length) {
-      itemIndex = 0;
+    let itemIndex = getRandomInteger(currentDepthTreeElements.length - 1);
+    let count = 0;
+    // Searches a non disabled node
+    while (count < currentDepthTreeElements.length &&
+        currentDepthTreeElements[itemIndex].disabled) {
+        itemIndex++;
+        count++;
+        if (itemIndex >= currentDepthTreeElements.length) {
+            itemIndex = 0;
+        }
+    }
+    // Element is still disabled -> all elements are disabled
+    if (currentDepthTreeElements[itemIndex].disabled) {
+        // Returns null value
+        return {
+            selectedTreeNode: null,
+            treeNodePath: null,
+        };
+    }
+    const selectedNode = currentDepthTreeElements[itemIndex];
+    if (!(selectedNode.children && selectedNode.children.length) ||
+        desiredTreeNodeDepth === currentDepth) {
+        return {
+            selectedTreeNode: selectedNode,
+            treeNodePath: [itemIndex],
+        };
+    }
+    else {
+        const nextDepth = randomlyTraverseTree(selectedNode.children, desiredTreeNodeDepth, currentDepth + 1);
+        return {
+            selectedTreeNode: nextDepth.selectedTreeNode
+                ? nextDepth.selectedTreeNode
+                : selectedNode,
+            treeNodePath: nextDepth.treeNodePath
+                ? [itemIndex].concat(nextDepth.treeNodePath)
+                : [itemIndex],
+        };
     }
-  }
-  // Element is still disabled -> all elements are disabled
-  if (currentDepthTreeElements[itemIndex].disabled) {
-    // Returns null value
-    return {
-      selectedTreeNode: null,
-      treeNodePath: null,
-    };
-  }
-  const selectedNode = currentDepthTreeElements[itemIndex];
-  if (!(selectedNode.children && selectedNode.children.length) ||
-    desiredTreeNodeDepth === currentDepth) {
-    return {
-      selectedTreeNode: selectedNode,
-      treeNodePath: [itemIndex],
-    };
-  }
-  else {
-    const nextDepth = randomlyTraverseTree(selectedNode.children, desiredTreeNodeDepth, currentDepth + 1);
-    return {
-      selectedTreeNode: nextDepth.selectedTreeNode
-        ? nextDepth.selectedTreeNode
-        : selectedNode,
-      treeNodePath: nextDepth.treeNodePath
-        ? [itemIndex].concat(nextDepth.treeNodePath)
-        : [itemIndex],
-    };
-  }
 }
 export function getRndTreeNode(currentDepthTreeElements, treeDepth) {
-  return randomlyTraverseTree(currentDepthTreeElements, getRandomInteger(treeDepth));
+    return randomlyTraverseTree(currentDepthTreeElements, getRandomInteger(treeDepth));
 }
 //---- Factory functions ----
 function ColumnFactory(index, forceVisibility = false) {
-  let colName = TreeDataPool.columnsName[index]
-    ? TreeDataPool.columnsName[index]
-    : 'Col' + index;
-  return {
-    name: colName,
-    title: colName + ' Title',
-    visible: forceVisibility || getBooleanOnProbability(0.7),
-  };
+    let colName = TreeDataPool.columnsName[index]
+        ? TreeDataPool.columnsName[index]
+        : 'Col' + index;
+    return {
+        name: colName,
+        title: colName + ' Title',
+        visible: forceVisibility || getBooleanOnProbability(0.7),
+    };
 }
 function TreeNodeFactory(columns, depth = {
-  current: 0,
-  max: 5,
-  path: '0',
+    current: 0,
+    max: 5,
+    path: '0',
 }, index, options = {
-  minimumChildCount: 0,
+    minimumChildCount: 0,
 }) {
-  let childrenCount = Math.max(getRandomInteger(options.maximumChildCount || 5), options.minimumChildCount);
-  const children = [];
-  // If it can have children, and the randomly extracted children are more than 1, adds children to this node
-  if (depth.current < depth.max && childrenCount) {
-    for (let i = 0; i < childrenCount; i++)
-      children.push(TreeNodeFactory(columns, {
-        current: depth.current + 1,
-        max: depth.max,
-        path: depth.path + index.toString(),
-      }, i, options.propagate ? options : undefined));
-  }
-  else {
-    // IT can have no children, so we set them to 0
-    // Fixes an error of expand icon rendering even if the node is not expandable
-    childrenCount = 0;
-  }
-  // Defines a generated value to be used
-  const depthAndIndex = depth.current.toString() + index.toString();
-  // Adds cells to the Node
-  let cells = {};
-  if (columns && columns.length) {
-    for (let j = 0; j < columns.length; j++) {
-      const colName = columns[j].name;
-      const cellValue = depthAndIndex + colName;
-      cells[colName] = {
+    let childrenCount = Math.max(getRandomInteger(options.maximumChildCount || 5), options.minimumChildCount);
+    const children = [];
+    // If it can have children, and the randomly extracted children are more than 1, adds children to this node
+    if (depth.current < depth.max && childrenCount) {
+        for (let i = 0; i < childrenCount; i++)
+            children.push(TreeNodeFactory(columns, {
+                current: depth.current + 1,
+                max: depth.max,
+                path: depth.path + index.toString(),
+            }, i, options.propagate ? options : undefined));
+    }
+    else {
+        // IT can have no children, so we set them to 0
+        // Fixes an error of expand icon rendering even if the node is not expandable
+        childrenCount = 0;
+    }
+    // Defines a generated value to be used
+    const depthAndIndex = depth.current.toString() + index.toString();
+    // Adds cells to the Node
+    let cells = {};
+    if (columns && columns.length) {
+        for (let j = 0; j < columns.length; j++) {
+            const colName = columns[j].name;
+            const cellValue = depthAndIndex + colName;
+            cells[colName] = {
+                obj: {
+                    t: 'NR',
+                    p: '',
+                    k: cellValue,
+                },
+                icon: 'widgets',
+                cssClass: 'strong-text',
+                value: cellValue,
+                style: getBooleanOnProbability(0.2)
+                    ? TreeDataPool.cellStyles[getRandomInteger(TreeDataPool.cellStyles.length - 1)]
+                    : undefined,
+                //config: any,
+            };
+        }
+    }
+    // TreeNode value
+    const treeNodeValue = TreeDataPool.nameValues[getRandomInteger(TreeDataPool.nameValues.length - 1)] + depthAndIndex;
+    return {
+        // actions?: Array<RowAction>;
+        cells,
+        children,
+        disabled: getBooleanOnProbability(0.3),
+        expandable: !!childrenCount,
+        icon: 'account',
+        id: depth.path + depthAndIndex + childrenCount.toString(),
+        isExpanded: getBooleanOnProbability(options.isExpandedProbability || 0),
         obj: {
-          t: 'NR',
-          p: '',
-          k: cellValue,
+            t: 'TN',
+            p: '',
+            k: treeNodeValue,
         },
-        icon: 'widgets',
-        cssClass: 'strong-text',
-        value: cellValue,
-        style: getBooleanOnProbability(0.2)
-          ? TreeDataPool.cellStyles[getRandomInteger(TreeDataPool.cellStyles.length - 1)]
-          : undefined,
-        //config: any,
-      };
-    }
-  }
-  // TreeNode value
-  const treeNodeValue = TreeDataPool.nameValues[getRandomInteger(TreeDataPool.nameValues.length - 1)] + depthAndIndex;
-  return {
-    // actions?: Array<RowAction>;
-    cells,
-    children,
-    disabled: getBooleanOnProbability(0.3),
-    expandable: !!childrenCount,
-    icon: 'account',
-    id: depth.path + depthAndIndex + childrenCount.toString(),
-    isExpanded: getBooleanOnProbability(options.isExpandedProbability || 0),
-    obj: {
-      t: 'TN',
-      p: '',
-      k: treeNodeValue,
-    },
-    style: getBooleanOnProbability(0.1)
-      ? TreeDataPool.cellStyles[getRandomInteger(TreeDataPool.cellStyles.length - 1)]
-      : undefined,
-    value: treeNodeValue,
-  };
+        style: getBooleanOnProbability(0.1)
+            ? TreeDataPool.cellStyles[getRandomInteger(TreeDataPool.cellStyles.length - 1)]
+            : undefined,
+        value: treeNodeValue,
+    };
 }
 /**
  * Function returning the columns and the data to create and initialize a kup-tree component.
@@ -227,26 +227,26 @@ function TreeNodeFactory(columns, depth = {
  * @returns {{columns: array, data: object}}*
  */
 export function TreeFactory(treeDepth = 5, columnCount = 4, options = {
-  forceColumnVisibility: false,
+    forceColumnVisibility: false,
 }, treeOptions = {
-  minimumChildCount: 5,
+    minimumChildCount: 5,
 }) {
-  let columns = [];
-  for (let i = 0; i < columnCount; i++) {
-    columns.push(ColumnFactory(i, options.forceColumnVisibility));
-  }
-  const data = [];
-  for (let j = 0; j < treeOptions.minimumChildCount; j++) {
-    data.push(TreeNodeFactory(columns, {
-      current: 0,
-      max: treeDepth,
-      path: j.toString(),
-    }, j, treeOptions));
-  }
-  return {
-    columns,
-    data,
-  };
+    let columns = [];
+    for (let i = 0; i < columnCount; i++) {
+        columns.push(ColumnFactory(i, options.forceColumnVisibility));
+    }
+    const data = [];
+    for (let j = 0; j < treeOptions.minimumChildCount; j++) {
+        data.push(TreeNodeFactory(columns, {
+            current: 0,
+            max: treeDepth,
+            path: j.toString(),
+        }, j, treeOptions));
+    }
+    return {
+        columns,
+        data,
+    };
 }
 /**
  * Function mocking a DynamicallyExpandable tree.
@@ -259,47 +259,47 @@ export function TreeFactory(treeDepth = 5, columnCount = 4, options = {
  * @returns {{columns: array, data: object}}*
  */
 export function DynamicExpansionFaker(treeDepth = 5, columnCount = 4, options = {
-  tree: {
-    forceColumnVisibility: false,
-  },
-  treeNode: {
-    minimumChildCount: 5,
-  },
+    tree: {
+        forceColumnVisibility: false,
+    },
+    treeNode: {
+        minimumChildCount: 5,
+    },
 }) {
-  // Function to copy a tree node but not its children.
-  function copyTreeNodeWithoutChildren(node) {
-    const { children } = node, otherProps = __rest(node, ["children"]);
-    return Object.assign(Object.assign({}, otherProps), { children: [] });
-  }
-  function getTreeNodeChildren(startTreeChildren, nodePath = []) {
-    let children = startTreeChildren;
-    if (nodePath.length) {
-      for (let i = 0; i < nodePath.length && children && children.length; i++) {
-        children = children[nodePath[i]].children;
-      }
+    // Function to copy a tree node but not its children.
+    function copyTreeNodeWithoutChildren(node) {
+        const { children } = node, otherProps = __rest(node, ["children"]);
+        return Object.assign(Object.assign({}, otherProps), { children: [] });
     }
-    return children.map((child) => copyTreeNodeWithoutChildren(child));
-  }
-  // Generates the model
-  const treeDataSource = TreeFactory(treeDepth, columnCount, options.tree, options.treeNode);
-  const data = treeDataSource.data.map((treeNode) => copyTreeNodeWithoutChildren(treeNode));
-  return {
-    data,
-    columns: treeDataSource.columns,
-    getTreeNodeChildren(nodePath = []) {
-      const children = getTreeNodeChildren(treeDataSource.data, nodePath);
-      const waitTime = options.dynamicExpansion && options.dynamicExpansion.useDelay
-        ? options.dynamicExpansion.useDelay
-        : 0;
-      return new Promise((resolve, reject) => {
-        setTimeout(() => {
-          if (children)
-            resolve(children);
-          else
-            reject('404: The required children of the given treeNodePath could not be found.');
-        }, waitTime);
-      });
-    },
-    treeDataSource,
-  };
+    function getTreeNodeChildren(startTreeChildren, nodePath = []) {
+        let children = startTreeChildren;
+        if (nodePath.length) {
+            for (let i = 0; i < nodePath.length && children && children.length; i++) {
+                children = children[nodePath[i]].children;
+            }
+        }
+        return children.map((child) => copyTreeNodeWithoutChildren(child));
+    }
+    // Generates the model
+    const treeDataSource = TreeFactory(treeDepth, columnCount, options.tree, options.treeNode);
+    const data = treeDataSource.data.map((treeNode) => copyTreeNodeWithoutChildren(treeNode));
+    return {
+        data,
+        columns: treeDataSource.columns,
+        getTreeNodeChildren(nodePath = []) {
+            const children = getTreeNodeChildren(treeDataSource.data, nodePath);
+            const waitTime = options.dynamicExpansion && options.dynamicExpansion.useDelay
+                ? options.dynamicExpansion.useDelay
+                : 0;
+            return new Promise((resolve, reject) => {
+                setTimeout(() => {
+                    if (children)
+                        resolve(children);
+                    else
+                        reject('404: The required children of the given treeNodePath could not be found.');
+                }, waitTime);
+            });
+        },
+        treeDataSource,
+    };
 }

package/dist/collection/components/kup-tree/kup-tree-state.js

@@ -1,15 +1,15 @@
 export class KupTreeState {
-  constructor() {
-    this.density = 'small';
-    this.globalFilter = false;
-    this.globalFilterValue = '';
-    this.showFilters = false;
-    this.showFooter = false;
-    this.filters = {};
-    this.load = false;
-  }
-  toDebugString() {
-    // TODO
-    return 'tree state';
-  }
+    constructor() {
+        this.density = 'small';
+        this.globalFilter = false;
+        this.globalFilterValue = '';
+        this.showFilters = false;
+        this.showFooter = false;
+        this.filters = {};
+        this.load = false;
+    }
+    toDebugString() {
+        // TODO
+        return 'tree state';
+    }
 }