@fern-api/fdr-sdk 1.2.42-e01a8637c3 → 1.2.43-60e226c2d6

package/dist/js/navigation/ledger-root-builder.mjs

@@ -1685,6 +1685,13 @@ function nearestExistingAncestor(sectionPath, existing) {
 }
 function buildSectionTree(ctx, scopeSegs, parentPath, scopePrefix, changelogScopePrefix) {
   const sectionPaths = new Set(scopeSegs.map((s) => s.seg.section));
+  const parentCandidates = scopeSegs.filter((s) => s.seg.section === parentPath);
+  const parentSeg = parentCandidates.length > 1 ? parentCandidates.reduce((best, cur) => {
+    const bd = metaNum(best.seg.metadata, "sidebarDepth") ?? Number.MAX_SAFE_INTEGER;
+    const cd = metaNum(cur.seg.metadata, "sidebarDepth") ?? Number.MAX_SAFE_INTEGER;
+    return cd < bd ? cur : best;
+  }) : parentCandidates[0];
+  const parentDepth = parentSeg != null ? metaNum(parentSeg.seg.metadata, "sidebarDepth") : void 0;
   const direct = scopeSegs.filter((s) => {
     const sec = s.seg.section;
     const type = metaStr(s.seg.metadata, "type");
@@ -1698,6 +1705,12 @@ function buildSectionTree(ctx, scopeSegs, parentPath, scopePrefix, changelogScop
     if (depth === 0) {
       return false;
     }
+    if (sec === parentPath && s !== parentSeg && depth != null && parentDepth != null && depth > parentDepth) {
+      return true;
+    }
+    if (parentDepth != null && depth != null && depth <= parentDepth) {
+      return false;
+    }
     const parent = parentSectionPath(sec);
     if (parent === parentPath) {
       return true;
@@ -1717,16 +1730,21 @@ function buildSectionTree(ctx, scopeSegs, parentPath, scopePrefix, changelogScop
     } else if (type === "changelog") {
       node = changelogNode(ctx, s, changelogScopePrefix ?? scopePrefix);
     } else {
-      const boundary = siblingBoundaries.get(s);
-      const childScopeSegs = boundary != null ? scopeSegs.filter(
-        (candidate) => candidate.seg.sortOrder >= boundary.lo && candidate.seg.sortOrder < boundary.hi
-      ) : scopeSegs;
-      node = sectionNode(
-        ctx,
-        s,
-        buildSectionTree(ctx, childScopeSegs, s.seg.section, scopePrefix, changelogScopePrefix),
-        scopePrefix
-      );
+      const isSkipSlugChild = s.seg.section === parentPath;
+      if (isSkipSlugChild) {
+        node = sectionNode(ctx, s, [], scopePrefix);
+      } else {
+        const boundary = siblingBoundaries.get(s);
+        const childScopeSegs = boundary != null ? scopeSegs.filter(
+          (candidate) => candidate.seg.sortOrder >= boundary.lo && candidate.seg.sortOrder < boundary.hi
+        ) : scopeSegs;
+        node = sectionNode(
+          ctx,
+          s,
+          buildSectionTree(ctx, childScopeSegs, s.seg.section, scopePrefix, changelogScopePrefix),
+          scopePrefix
+        );
+      }
     }
     return { node, childIndex };
   });
@@ -1752,8 +1770,18 @@ function computeSiblingSortBoundaries(ordered) {
       rootSections.push(s);
     }
   }
-  const byPath = /* @__PURE__ */ new Map();
+  const depth0Paths = /* @__PURE__ */ new Set();
   for (const s of rootSections) {
+    if (metaNum(s.seg.metadata, "sidebarDepth") === 0) {
+      depth0Paths.add(s.seg.section);
+    }
+  }
+  const effectiveRootSections = rootSections.filter((s) => {
+    const d = metaNum(s.seg.metadata, "sidebarDepth");
+    return d === 0 || d == null || !depth0Paths.has(s.seg.section);
+  });
+  const byPath = /* @__PURE__ */ new Map();
+  for (const s of effectiveRootSections) {
     const group = byPath.get(s.seg.section) ?? [];
     group.push(s);
     byPath.set(s.seg.section, group);
@@ -1778,6 +1806,12 @@ function buildSidebarRootChildren(ctx, scopeSegs, scopePrefix, changelogScopePre
   const hasRootSection = ordered.some(
     (s) => metaStr(s.seg.metadata, "type") === "section" && s.seg.section === "" && (metaNum(s.seg.metadata, "childIndex") == null || siblingBoundaries.has(s))
   );
+  const depth0SectionPaths = /* @__PURE__ */ new Set();
+  for (const s of ordered) {
+    if (metaStr(s.seg.metadata, "type") === "section" && metaNum(s.seg.metadata, "sidebarDepth") === 0) {
+      depth0SectionPaths.add(s.seg.section);
+    }
+  }
   for (const s of ordered) {
     const type = metaStr(s.seg.metadata, "type");
     const sec = s.seg.section;
@@ -1815,7 +1849,10 @@ function buildSidebarRootChildren(ctx, scopeSegs, scopePrefix, changelogScopePre
     const depth = metaNum(s.seg.metadata, "sidebarDepth");
     const parent = parentSectionPath(sec);
     const isRootLevel = depth === 0 || parent === "" || !sectionPaths.has(parent) && nearestExistingAncestor(sec, sectionPaths) === "";
-    if (isRootLevel && hasRootSection && sec !== "" && depth == null) {
+    if (isRootLevel && hasRootSection && sec !== "" && depth !== 0) {
+      continue;
+    }
+    if (isRootLevel && depth != null && depth > 0 && depth0SectionPaths.has(sec)) {
       continue;
     }
     if (isRootLevel) {
@@ -1828,7 +1865,11 @@ function buildSidebarRootChildren(ctx, scopeSegs, scopePrefix, changelogScopePre
         const bounds = siblingBoundaries.get(s);
         const ownedSegs = bounds != null ? scopeSegs.filter((seg) => seg.seg.sortOrder >= bounds.lo && seg.seg.sortOrder < bounds.hi) : scopeSegs;
         const isUnboundedSkipSlugSibling = sec === "" && metaNum(s.seg.metadata, "childIndex") != null && bounds == null;
-        const sectionChildren = isUnboundedSkipSlugSibling ? [] : buildSectionTree(ctx, ownedSegs, sec, scopePrefix, changelogScopePrefix);
+        const hasDepthMarkedChildren = isUnboundedSkipSlugSibling && ownedSegs.some((candidate) => {
+          const d = metaNum(candidate.seg.metadata, "sidebarDepth");
+          return d != null && d > 0 && parentSectionPath(candidate.seg.section) === sec;
+        });
+        const sectionChildren = isUnboundedSkipSlugSibling && !hasDepthMarkedChildren ? [] : buildSectionTree(ctx, ownedSegs, sec, scopePrefix, changelogScopePrefix);
         node = sectionNode(ctx, s, sectionChildren, scopePrefix);
       }
       const isSharedSection = siblingBoundaries.size > 0 && scopePrefix !== "" && sec !== "" && !sec.startsWith(scopePrefix);