All files / tree-view drag-drop.util.ts

87.09% Statements 54/62
62.85% Branches 22/35
100% Functions 5/5
86.88% Lines 53/61

Press n or j to go to the next uncovered block, b, p or k for the previous block.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152                            1x 4x 1x     3x 3x 3x                     1x                 1x             1x                       1x 2x 2x 2x 1x 1x   1x 1x 1x   1x     1x 36x   32x 10x     22x 22x 22x 22x     25x     1x             4x         4x         4x   4x         4x         4x 1x 1x     3x 3x       3x 1x 1x 1x 1x         2x 2x 2x 2x 2x     3x 3x 3x 3x      
/**
 * Copyright (c) Siemens 2016 - 2025
 * SPDX-License-Identifier: MIT
 */
import type { CdkDragDrop } from '@angular/cdk/drag-drop';
 
import type { TreeItem } from './si-tree-view.model';
 
/**
 *
 * @param treeItems - TreeItem array which is used with the si-tree-view.
 * @param event - event object which is emitted by cdkDropListDropped.
 * @returns reordered TreeItems list.
 */
export const reorderTreeItem = (treeItems: TreeItem[], event: CdkDragDrop<any>): TreeItem[] => {
  if (event.currentIndex === event.previousIndex) {
    return treeItems;
  }
  const targetIndex =
    event.currentIndex < event.previousIndex ? event.currentIndex - 1 : event.currentIndex;
  modifyTreeStructure(treeItems, event, treeItems, targetIndex);
  return treeItems;
};
 
/**
 *
 * @param sourceTreeItems - TreeItem array of the source tree from where item is being dragged.
 * @param targetTreeItems - TreeItem array of the target tree where item is being dropped.
 * @param event - event object which is emitted by cdkDropListDropped.
 * @param removeFromSource - whether to remove item from its source tree after moving to target.
 * @returns modified TreeItems list of source and target trees.
 */
export const transferTreeItem = (
  sourceTreeItems: TreeItem[],
  targetTreeItems: TreeItem[],
  event: CdkDragDrop<TreeItem[]>,
  removeFromSource: boolean = false
): {
  sourceTree: TreeItem[];
  targetTree: TreeItem[];
} => {
  modifyTreeStructure(
    sourceTreeItems,
    event,
    targetTreeItems,
    event.currentIndex - 1,
    removeFromSource
  );
  return {
    sourceTree: sourceTreeItems,
    targetTree: targetTreeItems
  };
};
 
/**
 *
 * @param sourceTree - TreeItems array from where item needs to be removed.
 * @param itemToRemove - TreeItem which needs to be removed.
 * @returns Updated TreeItems array.
 */
export const removeItemFromTree = (sourceTree: TreeItem[], itemToRemove: TreeItem): TreeItem[] => {
  const sourceItem = findTreeItem(sourceTree, itemToRemove);
  const itemParent = sourceItem?.parent;
  if (!itemParent) {
    console.error('Item parent not found.');
    return sourceTree;
  }
  if (itemParent.children) {
    const itemIndex = itemParent.children.indexOf(itemToRemove);
    itemParent.children?.splice(itemIndex, 1);
  }
  return sourceTree;
};
 
const findTreeItem = <T extends TreeItem>(array: T[], targetItem: T): T | null => {
  for (const obj of array) {
    // Check if the current item reference is the same as the target object reference
    if (obj === targetItem) {
      return obj; // Found the item, return it
    }
    // If the current item has nested children, recursively search within them
    const key = 'children';
    if (Array.isArray(obj[key])) {
      const found = findTreeItem(obj[key] as T[], targetItem);
      if (found) return found; // If found in nested array, return it
    }
  }
  return null; // Object not found
};
 
const modifyTreeStructure = (
  sourceItems: TreeItem[],
  event: CdkDragDrop<TreeItem[]>,
  targetItems: TreeItem[],
  targetIndex: number,
  removeFromSource = true
): void => {
  const sourceTreeItem = findTreeItem(
    sourceItems,
    event.previousContainer.data[event.previousIndex]
  );
 
  Iif (!sourceTreeItem) {
    console.error('Source tree item not found');
    return;
  }
 
  const sourceTreeItemCopy = structuredClone(sourceTreeItem);
 
  const targetTreeItem = findTreeItem<TreeItem>(
    targetItems,
    event.container.data[targetIndex < 0 ? 0 : targetIndex]
  );
 
  Iif (!targetTreeItem) {
    console.error('Target tree item not found');
    return;
  }
 
  if (findTreeItem(sourceTreeItem.children!, targetTreeItem)) {
    console.error('Cannot move parent into its own child');
    return;
  }
 
  const targetItemParent = targetTreeItem?.parent;
  Iif (targetIndex < 0) {
    sourceTreeItemCopy.parent = targetItemParent;
    sourceTreeItemCopy.level = targetItemParent?.level ? targetItemParent.level + 1 : 0;
    targetItemParent?.children?.splice(0, 0, sourceTreeItemCopy);
  } else if (targetTreeItem?.state === 'expanded') {
    sourceTreeItemCopy.parent = targetTreeItem;
    sourceTreeItemCopy.level = targetTreeItem.level ? targetTreeItem.level + 1 : 0;
    if (targetTreeItem.children?.length) {
      targetTreeItem.children = [sourceTreeItemCopy, ...targetTreeItem.children];
    } else E{
      targetTreeItem.children = [sourceTreeItemCopy];
    }
  } else {
    if (targetItemParent) {
      const targetItemIndex = targetItemParent.children?.indexOf(targetTreeItem) ?? -1;
      sourceTreeItemCopy.parent = targetItemParent;
      sourceTreeItemCopy.level = targetItemParent.level ? targetItemParent.level + 1 : 0;
      targetItemParent?.children?.splice(targetItemIndex + 1, 0, sourceTreeItemCopy);
    }
  }
  const sourceTreeItemParent = sourceTreeItem.parent;
  if (removeFromSource && sourceTreeItemParent) {
    const sourceItemIndex = sourceTreeItemParent.children?.indexOf(sourceTreeItem) ?? -1;
    sourceTreeItemParent?.children?.splice(sourceItemIndex, 1);
  }
};