@thanh01.pmt/curriculum-kit 1.4.16 → 1.4.17

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Tony Pham
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/index.cjs

@@ -11469,6 +11469,17 @@ function packUnitSessions(group, nodeById, spec, warnings) {
     const node = nodeById.get(id);
     const isKnowledge = node.kind === "concept";
     if (node.estimated_minutes > spec.contentBudget) {
+      if (node.estimated_minutes <= spec.sessionDurationMinutes || node.estimated_minutes <= spec.contentBudget * 1.25) {
+        if (current.entries.length > 0) flush();
+        const entry = { id, minutes: spec.contentBudget, part: 1, totalParts: 1 };
+        if (isKnowledge) current.knowledgeMinutes += entry.minutes;
+        else current.practiceMinutes += entry.minutes;
+        current.entries.push(entry);
+        current.nodeIds.push(id);
+        current.oversized = false;
+        flush();
+        continue;
+      }
       const parts = [];
       let remaining = node.estimated_minutes;
       while (remaining > 0) {
@@ -11637,6 +11648,35 @@ async function buildCurriculumPlan(rawGraph, options) {
   const unitIndexByGroup = new Map(groups.map((g, i) => [g.key, i]));
   const packed = [];
   for (const g of groups) packed.push(...packUnitSessions(g, nodeById, spec, warnings));
+  if (constraints.total_sessions && packed.length > constraints.total_sessions) {
+    warnings.push(`Initial packing produced ${packed.length} sessions, coalescing to satisfy total_sessions constraint (${constraints.total_sessions})`);
+    for (let i = 0; i < packed.length - 1 && packed.length > constraints.total_sessions; i++) {
+      const curr = packed[i];
+      const next = packed[i + 1];
+      if (curr.groupId === next.groupId) {
+        const currMins = curr.knowledgeMinutes + curr.practiceMinutes;
+        const nextMins = next.knowledgeMinutes + next.practiceMinutes;
+        const totalContent = currMins + nextMins;
+        if (currMins <= 45 || nextMins <= 45 || totalContent <= spec.contentBudget * 1.5) {
+          const scale = totalContent > spec.contentBudget ? spec.contentBudget / totalContent : 1;
+          curr.nodeIds.push(...next.nodeIds);
+          for (const e of next.entries) {
+            e.minutes = Math.max(5, Math.round(e.minutes * scale));
+            curr.entries.push(e);
+          }
+          for (const e of curr.entries) {
+            e.minutes = Math.max(5, Math.round(e.minutes * scale));
+          }
+          const scaledKnowledge = Math.round((curr.knowledgeMinutes + next.knowledgeMinutes) * scale);
+          curr.knowledgeMinutes = scaledKnowledge;
+          curr.practiceMinutes = Math.max(0, spec.contentBudget - scaledKnowledge);
+          curr.oversized = false;
+          packed.splice(i + 1, 1);
+          i--;
+        }
+      }
+    }
+  }
   packed.map(
     (_, i) => "U" + pad2(Math.min(units.length, 99)).replace("U", "U")
     /* placeholder replaced below */