gantt-lib 0.117.0 → 0.117.2

package/dist/index.d.mts

@@ -1448,19 +1448,22 @@ declare const calculateOrthogonalPath: (from: {
     y: number;
 }) => string;
 
+type HierarchyTask = Task$1 & {
+    sortOrder?: number;
+};
 /**
  * Build a stable depth-first task order from parentId links.
  * Sibling order follows the order in the input array.
  * Tasks with missing parents are treated as root tasks.
  */
-declare function flattenHierarchy<T extends Task$1>(tasks: T[]): T[];
+declare function flattenHierarchy<T extends HierarchyTask>(tasks: T[]): T[];
 /**
  * Normalize hierarchy-aware display fields.
  * Parent task dates and progress are always recomputed from children,
  * taking precedence over any hardcoded parent values from the input.
  * Also normalizes task dates to ensure startDate is always before or equal to endDate.
  */
-declare function normalizeHierarchyTasks<T extends Task$1>(tasks: T[]): T[];
+declare function normalizeHierarchyTasks<T extends HierarchyTask>(tasks: T[]): T[];
 
 interface ResourceTimelineLayoutOptions {
     monthStart: Date;

package/dist/index.d.ts

@@ -1448,19 +1448,22 @@ declare const calculateOrthogonalPath: (from: {
     y: number;
 }) => string;
 
+type HierarchyTask = Task$1 & {
+    sortOrder?: number;
+};
 /**
  * Build a stable depth-first task order from parentId links.
  * Sibling order follows the order in the input array.
  * Tasks with missing parents are treated as root tasks.
  */
-declare function flattenHierarchy<T extends Task$1>(tasks: T[]): T[];
+declare function flattenHierarchy<T extends HierarchyTask>(tasks: T[]): T[];
 /**
  * Normalize hierarchy-aware display fields.
  * Parent task dates and progress are always recomputed from children,
  * taking precedence over any hardcoded parent values from the input.
  * Also normalizes task dates to ensure startDate is always before or equal to endDate.
  */
-declare function normalizeHierarchyTasks<T extends Task$1>(tasks: T[]): T[];
+declare function normalizeHierarchyTasks<T extends HierarchyTask>(tasks: T[]): T[];
 
 interface ResourceTimelineLayoutOptions {
     monthStart: Date;

package/dist/index.js

@@ -1669,12 +1669,27 @@ function validateDependencies(tasks) {
 function flattenHierarchy(tasks) {
   const byId = new Map(tasks.map((task) => [task.id, task]));
   const byParent = /* @__PURE__ */ new Map();
+  const originalIndexById = new Map(tasks.map((task, index) => [task.id, index]));
   for (const task of tasks) {
     const normalizedParentId = task.parentId && byId.has(task.parentId) ? task.parentId : void 0;
     const siblings = byParent.get(normalizedParentId) ?? [];
     siblings.push(task);
     byParent.set(normalizedParentId, siblings);
   }
+  for (const siblings of byParent.values()) {
+    siblings.sort((left, right) => {
+      const leftSortOrder = left.sortOrder;
+      const rightSortOrder = right.sortOrder;
+      if (leftSortOrder !== void 0 || rightSortOrder !== void 0) {
+        const normalizedLeftSortOrder = leftSortOrder ?? Number.MAX_SAFE_INTEGER;
+        const normalizedRightSortOrder = rightSortOrder ?? Number.MAX_SAFE_INTEGER;
+        if (normalizedLeftSortOrder !== normalizedRightSortOrder) {
+          return normalizedLeftSortOrder - normalizedRightSortOrder;
+        }
+      }
+      return (originalIndexById.get(left.id) ?? 0) - (originalIndexById.get(right.id) ?? 0);
+    });
+  }
   const result = [];
   const visited = /* @__PURE__ */ new Set();
   const walk = (parentId) => {