gantt-lib 0.85.0 → 0.85.1

package/dist/index.mjs

@@ -448,17 +448,27 @@ function normalizePredecessorDates(predecessor, parseDateFn) {
 function getDependencyLag(dep) {
   return Number.isFinite(dep.lag) ? dep.lag : 0;
 }
+function normalizeTaskDependencyLags(task) {
+  if (!task.dependencies?.length) {
+    return task;
+  }
+  let changed = false;
+  const dependencies = task.dependencies.map((dep) => {
+    const lag = getDependencyLag(dep);
+    const normalizedLag = dep.type === "FS" ? Math.max(0, lag) : lag;
+    if (normalizedLag === dep.lag) {
+      return dep;
+    }
+    changed = true;
+    return { ...dep, lag: normalizedLag };
+  });
+  return changed ? { ...task, dependencies } : task;
+}
 function normalizeDependencyLag(linkType, lag, predecessorStart, predecessorEnd, businessDays = false, weekendPredicate) {
   if (linkType !== "FS") {
     return lag;
   }
-  const predecessorDuration = getTaskDuration(
-    predecessorStart,
-    predecessorEnd,
-    businessDays,
-    weekendPredicate
-  );
-  return Math.max(-predecessorDuration, lag);
+  return Math.max(0, lag);
 }
 function computeLagFromDates(linkType, predStart, predEnd, succStart, succEnd, businessDays = false, weekendPredicate) {
   const pS = Date.UTC(predStart.getUTCFullYear(), predStart.getUTCMonth(), predStart.getUTCDate());
@@ -717,17 +727,11 @@ function clampTaskRangeForIncomingFS(task, proposedStart, proposedEnd, allTasks,
       continue;
     }
     const { predStart: predecessorStart, predEnd: predecessorEnd } = normalizePredecessorDates(predecessor, parseDateOnly);
-    const predecessorDuration = getTaskDuration(
-      predecessorStart,
-      predecessorEnd,
-      businessDays,
-      weekendPredicate
-    );
     const candidateMinStart = calculateSuccessorDate(
       predecessorStart,
       predecessorEnd,
       "FS",
-      -predecessorDuration,
+      0,
       businessDays,
       weekendPredicate
     );
@@ -838,11 +842,11 @@ function cascadeByLinks(movedTaskId, newStart, newEnd, allTasks, skipChildCascad
         const newChildEnd = new Date(origEnd.getTime() + parentEndDelta);
         visited.add(child.id);
         updatedDates.set(child.id, { start: newChildStart, end: newChildEnd });
-        result.push({
+        result.push(normalizeTaskDependencyLags({
           ...child,
           startDate: newChildStart.toISOString().split("T")[0],
           endDate: newChildEnd.toISOString().split("T")[0]
-        });
+        }));
         queue.push(child.id);
       }
     }
@@ -878,11 +882,11 @@ function cascadeByLinks(movedTaskId, newStart, newEnd, allTasks, skipChildCascad
         }
         visited.add(task.id);
         updatedDates.set(task.id, { start: newSuccStart, end: newSuccEnd });
-        result.push({
+        result.push(normalizeTaskDependencyLags({
           ...task,
           startDate: newSuccStart.toISOString().split("T")[0],
           endDate: newSuccEnd.toISOString().split("T")[0]
-        });
+        }));
         queue.push(task.id);
         break;
       }
@@ -937,11 +941,11 @@ function universalCascade(movedTask, newStart, newEnd, allTasks, businessDays =
   const updatedDates = /* @__PURE__ */ new Map();
   updatedDates.set(movedTask.id, { start: newStart, end: newEnd });
   const resultMap = /* @__PURE__ */ new Map();
-  resultMap.set(movedTask.id, {
+  resultMap.set(movedTask.id, normalizeTaskDependencyLags({
     ...movedTask,
     startDate: newStart.toISOString().split("T")[0],
     endDate: newEnd.toISOString().split("T")[0]
-  });
+  }));
   const queue = [[movedTask.id, "direct"]];
   const childShifted = /* @__PURE__ */ new Set();
   let iterations = 0;
@@ -987,11 +991,11 @@ function universalCascade(movedTask, newStart, newEnd, allTasks, businessDays =
         updatedDates.set(child.id, { start: childNewStart, end: childNewEnd });
         childShifted.add(child.id);
         queue.push([child.id, "child-delta"]);
-        resultMap.set(child.id, {
+        resultMap.set(child.id, normalizeTaskDependencyLags({
           ...child,
           startDate: childNewStart.toISOString().split("T")[0],
           endDate: childNewEnd.toISOString().split("T")[0]
-        });
+        }));
       }
     }
     const parentId = currentOriginal.parentId;
@@ -1009,11 +1013,11 @@ function universalCascade(movedTask, newStart, newEnd, allTasks, businessDays =
         if (!prev || prev.start.getTime() !== minStart.getTime() || prev.end.getTime() !== maxEnd.getTime()) {
           updatedDates.set(parentId, { start: minStart, end: maxEnd });
           queue.push([parentId, "parent-recalc"]);
-          resultMap.set(parentId, {
+          resultMap.set(parentId, normalizeTaskDependencyLags({
             ...parent,
             startDate: minStart.toISOString().split("T")[0],
             endDate: maxEnd.toISOString().split("T")[0]
-          });
+          }));
         }
       }
     }
@@ -1063,11 +1067,11 @@ function universalCascade(movedTask, newStart, newEnd, allTasks, businessDays =
       }
       updatedDates.set(task.id, { start: succNewStart, end: succNewEnd });
       queue.push([task.id, "dependency"]);
-      resultMap.set(task.id, {
+      resultMap.set(task.id, normalizeTaskDependencyLags({
         ...task,
         startDate: succNewStart.toISOString().split("T")[0],
         endDate: succNewEnd.toISOString().split("T")[0]
-      });
+      }));
     }
   }
   return Array.from(resultMap.values());
@@ -10034,6 +10038,7 @@ export {
   normalizeHierarchyTasks,
   normalizePredecessorDates,
   normalizeTaskDates,
+  normalizeTaskDependencyLags,
   normalizeUTCDate,
   not,
   or,