@supernova-studio/client 1.17.2 → 1.18.0

package/dist/index.mjs

@@ -17229,18 +17229,24 @@ var LocalProjectActionExecutor = class {
         return this.artifactUpdate(trx);
       case "ArtifactDelete":
         return this.artifactDelete(trx);
+      case "ArtifactMove":
+        return this.artifactMove(trx);
       case "FeatureCreate":
         return this.featureCreate(trx);
       case "FeatureDelete":
         return this.featureDelete(trx);
       case "FeatureUpdate":
         return this.featureUpdate(trx);
+      case "FeatureMove":
+        return this.featureMove(trx);
       case "SectionCreate":
         return this.sectionCreate(trx);
       case "SectionUpdate":
         return this.sectionUpdate(trx);
       case "SectionDelete":
         return this.sectionDelete(trx);
+      case "SectionMove":
+        return this.sectionMove(trx);
     }
   }
   //
@@ -17248,11 +17254,13 @@ var LocalProjectActionExecutor = class {
   //
   artifactCreate(trx) {
     const { input } = trx;
-    const { id } = input;
+    const { id, afterArtifactId, sectionId } = input;
+    const sortOrder = this.calculateItemSortOrder(this.artifacts, afterArtifactId, sectionId);
     this.artifacts.set(id, {
       id,
       projectId: this.projectId,
-      sortOrder: 0,
+      sectionId,
+      sortOrder,
       title: input.title,
       updatedAt: /* @__PURE__ */ new Date(),
       createdAt: /* @__PURE__ */ new Date(),
@@ -17273,6 +17281,21 @@ var LocalProjectActionExecutor = class {
     };
     this.artifacts.set(id, mergedArtifact);
   }
+  artifactMove(trx) {
+    const { input } = trx;
+    const { id, afterId, sectionId } = input;
+    const existingArtifact = this.artifacts.get(id);
+    if (!existingArtifact) {
+      throw new Error(`Cannot move artifact: artifact ${id} was not found in local storage`);
+    }
+    const sortOrder = this.calculateItemSortOrder(this.artifacts, afterId, sectionId);
+    const mergedArtifact = {
+      ...existingArtifact,
+      sortOrder,
+      updatedAt: /* @__PURE__ */ new Date()
+    };
+    this.artifacts.set(id, mergedArtifact);
+  }
   artifactDelete(trx) {
     const { input } = trx;
     const { id } = input;
@@ -17285,14 +17308,15 @@ var LocalProjectActionExecutor = class {
   //
   featureCreate(trx) {
     const { input } = trx;
-    const { id } = input;
+    const { id, afterFeatureId, sectionId } = input;
+    const sortOrder = this.calculateItemSortOrder(this.features, afterFeatureId, sectionId);
     this.features.set(id, {
       id,
       projectId: this.projectId,
       description: input.description,
       isArchived: false,
       sectionId: input.sectionId,
-      sortOrder: 0,
+      sortOrder,
       name: input.name,
       status: "Draft",
       updatedAt: /* @__PURE__ */ new Date(),
@@ -17317,6 +17341,21 @@ var LocalProjectActionExecutor = class {
     };
     this.features.set(id, mergedFeature);
   }
+  featureMove(trx) {
+    const { input } = trx;
+    const { id, afterId, sectionId } = input;
+    const existingFeature = this.features.get(id);
+    if (!existingFeature) {
+      throw new Error(`Cannot move feature: feature ${id} was not found in local storage`);
+    }
+    const sortOrder = this.calculateItemSortOrder(this.features, afterId, sectionId);
+    const mergedFeature = {
+      ...existingFeature,
+      sortOrder,
+      updatedAt: /* @__PURE__ */ new Date()
+    };
+    this.features.set(id, mergedFeature);
+  }
   featureDelete(trx) {
     const { input } = trx;
     const { id } = input;
@@ -17329,15 +17368,15 @@ var LocalProjectActionExecutor = class {
   //
   sectionCreate(trx) {
     const { input } = trx;
-    const { id } = input;
+    const { id, afterSectionId } = input;
     const sections = input.childType === "Artifact" ? this.artifactSections : this.featureSections;
+    const sortOrder = this.calculateSectionSortOrder(sections, afterSectionId);
     sections.set(id, {
       id,
       projectId: this.projectId,
       name: input.name,
       childType: input.childType,
-      sortOrder: 0,
-      // TODO: Use Roman's calculate functions
+      sortOrder,
       updatedAt: /* @__PURE__ */ new Date(),
       createdAt: /* @__PURE__ */ new Date()
     });
@@ -17357,6 +17396,22 @@ var LocalProjectActionExecutor = class {
     const sections = existingSection.childType === "Artifact" ? this.artifactSections : this.featureSections;
     sections.set(id, mergedSection);
   }
+  sectionMove(trx) {
+    const { input } = trx;
+    const { id, afterSectionId } = input;
+    const existingSection = this.artifactSections.get(id) ?? this.featureSections.get(id);
+    if (!existingSection) {
+      throw new Error(`Cannot move section: section ${id} was not found in local storage`);
+    }
+    const sections = existingSection.childType === "Artifact" ? this.artifactSections : this.featureSections;
+    const sortOrder = this.calculateSectionSortOrder(sections, afterSectionId);
+    const mergedSection = {
+      ...existingSection,
+      sortOrder,
+      updatedAt: /* @__PURE__ */ new Date()
+    };
+    sections.set(id, mergedSection);
+  }
   sectionDelete(trx) {
     const { input } = trx;
     const { id } = input;
@@ -17366,6 +17421,59 @@ var LocalProjectActionExecutor = class {
       throw new Error(`Cannot delete section: section ${id} was not found in local storage`);
     }
   }
+  calculateSectionSortOrder(items, afterItemId) {
+    const sortedItems = Array.from(items.values()).sort((a, b) => a.sortOrder - b.sortOrder);
+    const sortOrder = this.calculateSortOrderNoDb(
+      (pId) => sortedItems.find((s) => s.projectId === pId),
+      (pId) => sortedItems.findLast((s) => s.projectId === pId),
+      (pId, id) => sortedItems.find((s) => s.projectId === pId && s.id === id),
+      (pId, sortOrder2) => sortedItems.find((s) => s.projectId === pId && s.sortOrder > sortOrder2),
+      (pId, sortOrder2, step) => items.forEach((s) => s.sortOrder > sortOrder2 && s.projectId === pId ? s.sortOrder += step : {}),
+      this.projectId,
+      afterItemId
+    );
+    return sortOrder ?? 0;
+  }
+  calculateItemSortOrder(items, afterItemId, sectionId) {
+    const sortedItems = Array.from(items.values()).sort((a, b) => a.sortOrder - b.sortOrder);
+    const matchIds = (i, pId, sId) => i.sectionId === sId && i.projectId === pId;
+    const sortOrder = this.calculateSortOrderNoDb(
+      (pId, sId) => sortedItems.find((i) => matchIds(i, pId, sId)),
+      (pId, sId) => sortedItems.findLast((i) => matchIds(i, pId, sId)),
+      (pId, id, sId) => sortedItems.find((i) => i.id === id && matchIds(i, pId, sId)),
+      (pId, sortOrder2, sId) => sortedItems.find((i) => i.sortOrder > sortOrder2 && matchIds(i, pId, sId)),
+      (pId, sortOrder2, step, sId) => items.forEach((i) => i.sortOrder > sortOrder2 && matchIds(i, pId, sId) ? i.sortOrder += step : {}),
+      this.projectId,
+      afterItemId,
+      sectionId ?? void 0
+    );
+    return sortOrder ?? 0;
+  }
+  // See also calculateSectionSortOrder and calculateSectionedItemSortOrder
+  calculateSortOrderNoDb(findFirst, findLast, findUnique, findNext, shiftAfter, projectId, afterItemId, sectionId) {
+    const SORT_ORDER_STEP = 1e3;
+    if (afterItemId === void 0) {
+      const lastSection = findLast(projectId, sectionId);
+      return (lastSection?.sortOrder ?? 0) + SORT_ORDER_STEP;
+    } else if (afterItemId === null) {
+      const firstSection = findFirst(projectId, sectionId);
+      return (firstSection?.sortOrder ?? SORT_ORDER_STEP) - SORT_ORDER_STEP;
+    } else {
+      const targetSection = findUnique(projectId, afterItemId, sectionId);
+      if (!targetSection) return null;
+      const nextSection = findNext(projectId, targetSection.sortOrder, sectionId);
+      if (nextSection) {
+        let newSortOrder = Math.floor((targetSection.sortOrder + nextSection.sortOrder) / 2);
+        if (newSortOrder <= targetSection.sortOrder) {
+          newSortOrder = targetSection.sortOrder + SORT_ORDER_STEP / 2;
+          shiftAfter(projectId, targetSection.sortOrder, SORT_ORDER_STEP, sectionId);
+        }
+        return newSortOrder;
+      } else {
+        return targetSection.sortOrder + SORT_ORDER_STEP;
+      }
+    }
+  }
 };
 
 // src/sync/project-content-repo.ts