@intellectif/lk-core 0.4.0 → 0.5.0

package/dist/{chunk-QOAORTA4.cjs → chunk-4JR3UXX6.cjs}

@@ -10,6 +10,46 @@ function countWords(text) {
   return trimmed.split(/\s+/).length;
 }
 
+// src/errors.ts
+var ActivitySchemaError = class extends Error {
+  constructor(activityType, errors) {
+    super(`Invalid activity data for type "${activityType}"`);
+    this.activityType = activityType;
+    this.errors = errors;
+    this.name = "ActivitySchemaError";
+  }
+  
+  
+};
+var UnknownActivityTypeError = class extends Error {
+  constructor(activityType) {
+    super(`Activity type "${activityType}" is not registered`);
+    this.activityType = activityType;
+    this.name = "UnknownActivityTypeError";
+  }
+  
+};
+var RedactedScoringError = class extends Error {
+  constructor(activityType) {
+    super(
+      `Activity data for "${activityType}" carries no answer key (it looks redacted), so it cannot be scored. Score against the full activity data server-side, or use evaluate() which returns { status: "unscorable" }.`
+    );
+    this.activityType = activityType;
+    this.name = "RedactedScoringError";
+  }
+  
+};
+var DeferredScoringError = class extends Error {
+  constructor(activityType) {
+    super(
+      `Activity type "${activityType}" is graded asynchronously and has no synchronous score. Use evaluate() \u2014 it returns { status: 'deferred' } for this type.`
+    );
+    this.activityType = activityType;
+    this.name = "DeferredScoringError";
+  }
+  
+};
+
 // src/schemas/feedback.ts
 var _v4 = require('zod/v4');
 var FeedbackSchema = _v4.z.looseObject({
@@ -316,6 +356,11 @@ function defineActivityType(descriptor) {
   return descriptor;
 }
 function registerActivityType(descriptor) {
+  if (descriptor.type === "item-group") {
+    throw new Error(
+      `"item-group" is reserved for the SDK's item-group container (see ItemGroup) and cannot be registered as an activity type.`
+    );
+  }
   const existing = registry.get(descriptor.type);
   if (existing !== void 0) {
     if (existing === descriptor) {
@@ -572,5 +617,9 @@ registerActivityType(writtenResponseType);
 
 
 
-exports.countWords = countWords; exports.FeedbackSchema = FeedbackSchema; exports.MediaUrlSchema = MediaUrlSchema; exports.MediaSchema = MediaSchema; exports.TextMatchPolicySchema = TextMatchPolicySchema; exports.BlankConfigSchema = BlankConfigSchema; exports.FillInTheBlanksDataSchema = FillInTheBlanksDataSchema; exports.MultipleChoiceOptionSchema = MultipleChoiceOptionSchema; exports.MultipleChoiceDataSchema = MultipleChoiceDataSchema; exports.WrittenResponseRubricCriterionSchema = WrittenResponseRubricCriterionSchema; exports.WrittenResponseRubricSchema = WrittenResponseRubricSchema; exports.WrittenResponseDataSchema = WrittenResponseDataSchema; exports.RedactedMultipleChoiceOptionSchema = RedactedMultipleChoiceOptionSchema; exports.RedactedMultipleChoiceDataSchema = RedactedMultipleChoiceDataSchema; exports.RedactedBlankConfigSchema = RedactedBlankConfigSchema; exports.RedactedFillInTheBlanksDataSchema = RedactedFillInTheBlanksDataSchema; exports.RedactedWrittenResponseDataSchema = RedactedWrittenResponseDataSchema; exports.levenshteinDistance = levenshteinDistance; exports.matchText = matchText; exports.defineActivityType = defineActivityType; exports.registerActivityType = registerActivityType; exports.getActivityTypeDescriptor = getActivityTypeDescriptor; exports.registeredActivityTypes = registeredActivityTypes; exports.multipleChoiceType = multipleChoiceType; exports.fillInTheBlanksType = fillInTheBlanksType; exports.writtenResponseType = writtenResponseType;
-//# sourceMappingURL=chunk-QOAORTA4.cjs.map
+
+
+
+
+exports.countWords = countWords; exports.ActivitySchemaError = ActivitySchemaError; exports.UnknownActivityTypeError = UnknownActivityTypeError; exports.RedactedScoringError = RedactedScoringError; exports.DeferredScoringError = DeferredScoringError; exports.FeedbackSchema = FeedbackSchema; exports.MediaUrlSchema = MediaUrlSchema; exports.MediaSchema = MediaSchema; exports.TextMatchPolicySchema = TextMatchPolicySchema; exports.BlankConfigSchema = BlankConfigSchema; exports.FillInTheBlanksDataSchema = FillInTheBlanksDataSchema; exports.MultipleChoiceOptionSchema = MultipleChoiceOptionSchema; exports.MultipleChoiceDataSchema = MultipleChoiceDataSchema; exports.WrittenResponseRubricCriterionSchema = WrittenResponseRubricCriterionSchema; exports.WrittenResponseRubricSchema = WrittenResponseRubricSchema; exports.WrittenResponseDataSchema = WrittenResponseDataSchema; exports.RedactedMultipleChoiceOptionSchema = RedactedMultipleChoiceOptionSchema; exports.RedactedMultipleChoiceDataSchema = RedactedMultipleChoiceDataSchema; exports.RedactedBlankConfigSchema = RedactedBlankConfigSchema; exports.RedactedFillInTheBlanksDataSchema = RedactedFillInTheBlanksDataSchema; exports.RedactedWrittenResponseDataSchema = RedactedWrittenResponseDataSchema; exports.levenshteinDistance = levenshteinDistance; exports.matchText = matchText; exports.defineActivityType = defineActivityType; exports.registerActivityType = registerActivityType; exports.getActivityTypeDescriptor = getActivityTypeDescriptor; exports.registeredActivityTypes = registeredActivityTypes; exports.multipleChoiceType = multipleChoiceType; exports.fillInTheBlanksType = fillInTheBlanksType; exports.writtenResponseType = writtenResponseType;
+//# sourceMappingURL=chunk-4JR3UXX6.cjs.map

package/dist/chunk-4JR3UXX6.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/home/runner/work/learning-kit/learning-kit/packages/lk-core/dist/chunk-4JR3UXX6.cjs","../src/count-words.ts","../src/errors.ts","../src/schemas/feedback.ts","../src/schemas/media.ts","../src/schemas/fill-in-the-blanks.ts","../src/schemas/multiple-choice.ts","../src/schemas/written-response.ts","../src/schemas/redacted.ts","../src/scoring/text-match.ts","../src/registry/registry.ts","../src/scoring/strategies/all-or-nothing.ts","../src/scoring/strategies/partial.ts","../src/scoring/activity-scorers/fill-in-the-blanks.ts","../src/scoring/activity-scorers/multiple-choice.ts","../src/registry/builtins.ts"],"names":["z"],"mappings":"AAAA;ACOO,SAAS,UAAA,CAAW,IAAA,EAAsB;AAG/C,EAAA,GAAA,CAAI,OAAO,KAAA,IAAS,QAAA,EAAU;AAC5B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,MAAM,QAAA,EAAU,IAAA,CAAK,IAAA,CAAK,CAAA;AAC1B,EAAA,GAAA,CAAI,QAAA,IAAY,EAAA,EAAI;AAClB,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,OAAO,OAAA,CAAQ,KAAA,CAAM,KAAK,CAAA,CAAE,MAAA;AAC9B;ADPA;AACA;AETO,IAAM,oBAAA,EAAN,MAAA,QAAkC,MAAM;AAAA,EAC7C,WAAA,CACkB,YAAA,EACA,MAAA,EAChB;AACA,IAAA,KAAA,CAAM,CAAA,gCAAA,EAAmC,YAAY,CAAA,CAAA,CAAG,CAAA;AAHxC,IAAA,IAAA,CAAA,aAAA,EAAA,YAAA;AACA,IAAA,IAAA,CAAA,OAAA,EAAA,MAAA;AAGhB,IAAA,IAAA,CAAK,KAAA,EAAO,qBAAA;AAAA,EACd;AAAA,EALkB;AAAA,EACA;AAKpB,CAAA;AAGO,IAAM,yBAAA,EAAN,MAAA,QAAuC,MAAM;AAAA,EAClD,WAAA,CAA4B,YAAA,EAAsB;AAChD,IAAA,KAAA,CAAM,CAAA,eAAA,EAAkB,YAAY,CAAA,mBAAA,CAAqB,CAAA;AAD/B,IAAA,IAAA,CAAA,aAAA,EAAA,YAAA;AAE1B,IAAA,IAAA,CAAK,KAAA,EAAO,0BAAA;AAAA,EACd;AAAA,EAH4B;AAI9B,CAAA;AAUO,IAAM,qBAAA,EAAN,MAAA,QAAmC,MAAM;AAAA,EAC9C,WAAA,CAA4B,YAAA,EAAsB;AAChD,IAAA,KAAA;AAAA,MACE,CAAA,mBAAA,EAAsB,YAAY,CAAA,gLAAA;AAAA,IAEpC,CAAA;AAJ0B,IAAA,IAAA,CAAA,aAAA,EAAA,YAAA;AAK1B,IAAA,IAAA,CAAK,KAAA,EAAO,sBAAA;AAAA,EACd;AAAA,EAN4B;AAO9B,CAAA;AASO,IAAM,qBAAA,EAAN,MAAA,QAAmC,MAAM;AAAA,EAC9C,WAAA,CAA4B,YAAA,EAAsB;AAChD,IAAA,KAAA;AAAA,MACE,CAAA,eAAA,EAAkB,YAAY,CAAA,+HAAA;AAAA,IAEhC,CAAA;AAJ0B,IAAA,IAAA,CAAA,aAAA,EAAA,YAAA;AAK1B,IAAA,IAAA,CAAK,KAAA,EAAO,sBAAA;AAAA,EACd;AAAA,EAN4B;AAO9B,CAAA;AFHA;AACA;AGpDA,4BAAkB;AAOX,IAAM,eAAA,EAAiB,KAAA,CAAE,WAAA,CAAY;AAAA,EAC1C,OAAA,EAAS,KAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACpC,SAAA,EAAW,KAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS;AACxC,CAAC,CAAA;AHgDD;AACA;AI3DA;AA0BO,IAAM,eAAA,EAAiBA,KAAAA,CAAE,KAAA,CAAM;AAAA,EACpCA,KAAAA,CAAE,GAAA,CAAI,CAAA,CAAE,MAAA,CAAO,CAAC,KAAA,EAAA,GAAU,uBAAA,CAAwB,IAAA,CAAK,KAAK,CAAA,EAAG;AAAA,IAC7D,KAAA,EAAO;AAAA,EACT,CAAC,CAAA;AAAA,EACDA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,KAAA,CAAM,eAAA,EAAiB;AAAA,IAChC,KAAA,EAAO;AAAA,EACT,CAAC;AACH,CAAC,CAAA;AAEM,IAAM,YAAA,EAAcA,KAAAA,CACxB,WAAA,CAAY;AAAA,EACX,IAAA,EAAMA,KAAAA,CAAE,IAAA,CAAK,CAAC,OAAA,EAAS,OAAA,EAAS,OAAA,EAAS,OAAO,CAAC,CAAA;AAAA,EACjD,GAAA,EAAK,cAAA;AAAA,EACL,GAAA,EAAKA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAChC,WAAA,EAAa,cAAA,CAAe,QAAA,CAAS;AACvC,CAAC,CAAA,CACA,MAAA;AAAA,EACC,CAAC,CAAA,EAAA,GACE,CAAA,CAAE,KAAA,IAAS,QAAA,GAAW,CAAA,CAAE,KAAA,IAAS,QAAA,GAAa,OAAO,CAAA,CAAE,IAAA,IAAQ,SAAA,GAAY,CAAA,CAAE,GAAA,CAAI,OAAA,EAAS,CAAA;AAAA,EAC7F;AAAA,IACE,KAAA,EAAO,wEAAA;AAAA,IACP,IAAA,EAAM,CAAC,KAAK;AAAA,EACd;AACF,CAAA,CACC,MAAA,CAAO,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,KAAA,IAAS,QAAA,GAAW,eAAA,CAAgB,IAAA,CAAK,CAAA,CAAE,GAAG,CAAA,EAAG;AAAA,EAChE,KAAA,EACE,6NAAA;AAAA,EACF,IAAA,EAAM,CAAC,KAAK;AACd,CAAC,CAAA;AJ8BH;AACA;AKrFA;AAKA,IAAM,eAAA,EAAiB,0BAAA;AAMhB,IAAM,sBAAA,EAAwBA,KAAAA,CAAE,WAAA,CAAY;AAAA,EACjD,aAAA,EAAeA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACpC,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC3B,SAAA,EAAWA,KAAAA,CAAE,IAAA,CAAK,CAAC,MAAA,EAAQ,KAAA,EAAO,MAAM,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACpD,cAAA,EAAgBA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACrC,uBAAA,EAAyBA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC9C,iBAAA,EAAmBA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACxC,WAAA,EAAaA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC9C,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS;AAC9B,CAAC,CAAA;AAQM,IAAM,kBAAA,EAAoBA,KAAAA,CAAE,WAAA,CAAY;AAAA,EAC7C,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,eAAA,EAAiBA,KAAAA,CACd,KAAA;AAAA,IACCA,KAAAA,CACG,MAAA,CAAO,CAAA,CACP,GAAA,CAAI,CAAC,CAAA,CACL,MAAA,CAAO,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,OAAA,EAAS,CAAA,EAAG;AAAA,MAC5C,KAAA,EAAO;AAAA,IACT,CAAC;AAAA,EACL,CAAA,CACC,GAAA,CAAI,CAAC,CAAA;AAAA,EACR,aAAA,EAAeA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACpC,cAAA,EAAgBA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACrC,KAAA,EAAO,qBAAA,CAAsB,QAAA,CAAS,CAAA;AAAA,EACtC,IAAA,EAAMA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC1B,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS;AAChC,CAAC,CAAA;AAYM,IAAM,0BAAA,EAA4BA,KAAAA,CACtC,WAAA,CAAY;AAAA,EACX,aAAA,EAAeA,KAAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EAC9B,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,oBAAoB,CAAA;AAAA,EACpC,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACvB,OAAA,EAASA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACzB,WAAA,EAAaA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjC,MAAA,EAAQA,KAAAA,CAAE,KAAA,CAAM,iBAAiB,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACxC,eAAA,EAAiBA,KAAAA,CAAE,IAAA,CAAK,CAAC,gBAAA,EAAkB,SAAS,CAAC,CAAA;AAAA,EACrD,KAAA,EAAO,WAAA,CAAY,QAAA,CAAS,CAAA;AAAA,EAC5B,QAAA,EAAU,cAAA,CAAe,QAAA,CAAS,CAAA;AAAA,EAClC,aAAA,EAAeA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC5B,kBAAA,EAAoBA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,eAAA,EAAiBA,KAAAA,CAAE,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,CAAE,QAAA,CAAS;AACvD,CAAC,CAAA,CACA,MAAA;AAAA,EACC,CAAC,IAAA,EAAA,GAAS;AACR,IAAA,MAAM,kBAAA,kBAAoB,IAAI,GAAA,CAAoB,CAAA;AAClD,IAAA,IAAA,CAAA,MAAW,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,cAAc,CAAA,EAAG;AACzD,MAAA,MAAM,GAAA,EAAK,KAAA,CAAM,CAAC,CAAA;AAClB,MAAA,iBAAA,CAAkB,GAAA,CAAI,EAAA,EAAA,kBAAK,iBAAA,CAAkB,GAAA,CAAI,EAAE,CAAA,UAAK,GAAA,EAAA,EAAK,CAAC,CAAA;AAAA,IAChE;AACA,IAAA,MAAM,SAAA,EAAW,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,EAAA,GAAU,KAAA,CAAM,EAAE,CAAA;AACpD,IAAA,GAAA,CAAI,IAAI,GAAA,CAAI,QAAQ,CAAA,CAAE,KAAA,IAAS,QAAA,CAAS,MAAA,EAAQ;AAC9C,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,GAAA,CAAI,iBAAA,CAAkB,KAAA,IAAS,QAAA,CAAS,MAAA,EAAQ;AAC9C,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,OAAO,QAAA,CAAS,KAAA,CAAM,CAAC,EAAA,EAAA,GAAO,iBAAA,CAAkB,GAAA,CAAI,EAAE,EAAA,IAAM,CAAC,CAAA;AAAA,EAC/D,CAAA;AAAA,EACA;AAAA,IACE,KAAA,EACE,qIAAA;AAAA,IACF,IAAA,EAAM,CAAC,SAAS;AAAA,EAClB;AACF,CAAA;ALoDF;AACA;AMpJA;AAQO,IAAM,2BAAA,EAA6BA,KAAAA,CAAE,WAAA,CAAY;AAAA,EACtD,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,IAAA,EAAMA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACtB,SAAA,EAAWA,KAAAA,CAAE,OAAA,CAAQ,CAAA;AAAA,EACrB,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS;AAChC,CAAC,CAAA;AAiBM,IAAM,yBAAA,EAA2BA,KAAAA,CACrC,WAAA,CAAY;AAAA,EACX,aAAA,EAAeA,KAAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EAC9B,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,iBAAiB,CAAA;AAAA,EACjC,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACvB,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EAC1B,YAAA,EAAcA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAClC,IAAA,EAAMA,KAAAA,CAAE,IAAA,CAAK,CAAC,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,EAChC,OAAA,EAASA,KAAAA,CAAE,KAAA,CAAM,0BAA0B,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,EAAE,CAAA;AAAA,EAC1D,eAAA,EAAiBA,KAAAA,CAAE,IAAA,CAAK,CAAC,gBAAA,EAAkB,SAAS,CAAC,CAAA;AAAA,EACrD,KAAA,EAAO,WAAA,CAAY,QAAA,CAAS,CAAA;AAAA,EAC5B,QAAA,EAAU,cAAA,CAAe,QAAA,CAAS,CAAA;AAAA,EAClC,aAAA,EAAeA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,OAAA,EAASA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC9B,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC5B,kBAAA,EAAoBA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,eAAA,EAAiBA,KAAAA,CAAE,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,CAAE,QAAA,CAAS;AACvD,CAAC,CAAA,CACA,MAAA,CAAO,CAAC,IAAA,EAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,SAAS,CAAA,EAAG;AAAA,EACjE,KAAA,EAAO,6CAAA;AAAA,EACP,IAAA,EAAM,CAAC,SAAS;AAClB,CAAC,CAAA,CACA,MAAA;AAAA,EACC,CAAC,IAAA,EAAA,GACC,IAAA,CAAK,KAAA,IAAS,SAAA,GAAY,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,SAAS,CAAA,CAAE,OAAA,IAAW,CAAA;AAAA,EACzF;AAAA,IACE,KAAA,EAAO,iFAAA;AAAA,IACP,IAAA,EAAM,CAAC,SAAS;AAAA,EAClB;AACF,CAAA,CACC,MAAA,CAAO,CAAC,IAAA,EAAA,GAAS,IAAI,GAAA,CAAI,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,EAAE,CAAC,CAAA,CAAE,KAAA,IAAS,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAQ;AAAA,EAC/F,KAAA,EAAO,gDAAA;AAAA,EACP,IAAA,EAAM,CAAC,SAAS;AAClB,CAAC,CAAA;AN0HH;AACA;AO3LA;AAKO,IAAM,qCAAA,EAAuCA,KAAAA,CAAE,WAAA,CAAY;AAAA,EAChE,IAAA,EAAMA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACtB,WAAA,EAAaA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjC,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC;AAC1B,CAAC,CAAA;AAGM,IAAM,4BAAA,EAA8BA,KAAAA,CAAE,WAAA,CAAY;AAAA,EACvD,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC3B,QAAA,EAAUA,KAAAA,CAAE,KAAA,CAAM,oCAAoC,CAAA,CAAE,GAAA,CAAI,CAAC;AAC/D,CAAC,CAAA;AAUM,IAAM,0BAAA,EAA4BA,KAAAA,CACtC,WAAA,CAAY;AAAA,EACX,aAAA,EAAeA,KAAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EAC9B,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,kBAAkB,CAAA;AAAA,EAClC,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACvB,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA;AAAA,EACjB,UAAA,EAAYA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAChC,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EAChC,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EAChC,MAAA,EAAQ,2BAAA,CAA4B,QAAA,CAAS,CAAA;AAAA,EAC7C,cAAA,EAAgBA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACpC,KAAA,EAAO,WAAA,CAAY,QAAA,CAAS,CAAA;AAAA,EAC5B,QAAA,EAAU,cAAA,CAAe,QAAA,CAAS,CAAA;AAAA,EAClC,aAAA,EAAeA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC5B,kBAAA,EAAoBA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,eAAA,EAAiBA,KAAAA,CAAE,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,CAAE,QAAA,CAAS;AACvD,CAAC,CAAA,CACA,MAAA,CAAO,CAAC,IAAA,EAAA,GAAS,IAAA,CAAK,SAAA,GAAY,IAAA,CAAK,QAAA,EAAU;AAAA,EAChD,KAAA,EAAO,qDAAA;AAAA,EACP,IAAA,EAAM,CAAC,UAAU;AACnB,CAAC,CAAA;AP4KH;AACA;AQ5NA;AAaA,IAAM,aAAA,EAAe;AAAA;AAAA,EAEnB,QAAA,EAAUA,KAAAA,CAAE,OAAA,CAAQ,IAAI,CAAA;AAAA,EACxB,aAAA,EAAeA,KAAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EAC9B,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,KAAA,EAAOA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACvB,KAAA,EAAO,WAAA,CAAY,QAAA,CAAS,CAAA;AAAA,EAC5B,aAAA,EAAeA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAC5B,kBAAA,EAAoBA,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjD,eAAA,EAAiBA,KAAAA,CAAE,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA,CAAE,QAAA,CAAS;AACvD,CAAA;AAGO,IAAM,mCAAA,EAAqCA,KAAAA,CAAE,YAAA,CAAa;AAAA,EAC/D,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,IAAA,EAAMA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC;AACxB,CAAC,CAAA;AASM,IAAM,iCAAA,EAAmCA,KAAAA,CAAE,YAAA,CAAa;AAAA,EAC7D,GAAG,YAAA;AAAA,EACH,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,iBAAiB,CAAA;AAAA,EACjC,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EAC1B,YAAA,EAAcA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAClC,IAAA,EAAMA,KAAAA,CAAE,IAAA,CAAK,CAAC,QAAA,EAAU,OAAO,CAAC,CAAA;AAAA,EAChC,OAAA,EAASA,KAAAA,CAAE,KAAA,CAAM,kCAAkC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,GAAA,CAAI,EAAE,CAAA;AAAA,EAClE,OAAA,EAASA,KAAAA,CAAE,OAAA,CAAQ,CAAA,CAAE,QAAA,CAAS;AAChC,CAAC,CAAA;AAGM,IAAM,0BAAA,EAA4BA,KAAAA,CAAE,YAAA,CAAa;AAAA,EACtD,EAAA,EAAIA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACpB,IAAA,EAAMA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS;AAC5B,CAAC,CAAA;AAGM,IAAM,kCAAA,EAAoCA,KAAAA,CAAE,YAAA,CAAa;AAAA,EAC9D,GAAG,YAAA;AAAA,EACH,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,oBAAoB,CAAA;AAAA,EACpC,OAAA,EAASA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EACzB,WAAA,EAAaA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EACjC,MAAA,EAAQA,KAAAA,CAAE,KAAA,CAAM,yBAAyB,CAAA,CAAE,GAAA,CAAI,CAAC;AAClD,CAAC,CAAA;AAOM,IAAM,kCAAA,EAAoCA,KAAAA,CAAE,YAAA,CAAa;AAAA,EAC9D,GAAG,YAAA;AAAA,EACH,IAAA,EAAMA,KAAAA,CAAE,OAAA,CAAQ,kBAAkB,CAAA;AAAA,EAClC,MAAA,EAAQA,KAAAA,CAAE,MAAA,CAAO,CAAA;AAAA,EACjB,UAAA,EAAYA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS,CAAA;AAAA,EAChC,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EAChC,QAAA,EAAUA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,GAAA,CAAI,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA;AAAA,EAChC,MAAA,EAAQ,2BAAA,CAA4B,QAAA,CAAS,CAAA;AAAA,EAC7C,cAAA,EAAgBA,KAAAA,CAAE,MAAA,CAAO,CAAA,CAAE,QAAA,CAAS;AACtC,CAAC,CAAA;AR8LD;AACA;AS1NA,IAAM,mBAAA,EAAqB,SAAA;AAM3B,IAAM,eAAA,EAAiB,SAAA;AAEvB,SAAS,aAAA,CAAc,KAAA,EAAe,MAAA,EAAiC;AACrE,EAAA,IAAI,OAAA,EAAS,KAAA;AACb,EAAA,GAAA,CAAI,MAAA,CAAO,KAAA,IAAS,KAAA,EAAO;AACzB,IAAA,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,CAAA;AAAA,EACvB;AACA,EAAA,GAAA,CAAI,MAAA,CAAO,cAAA,IAAkB,IAAA,EAAM;AACjC,IAAA,OAAA,EAAS,MAAA,CAAO,OAAA,EAAS,MAAA,CAAO,iBAAA,CAAkB,MAAA,CAAO,MAAM,EAAA,EAAI,MAAA,CAAO,WAAA,CAAY,CAAA;AAAA,EACxF;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,kBAAA,CAAmB,KAAA,EAAe,MAAA,EAAiC;AAC1E,EAAA,IAAI,OAAA,EAAS,KAAA;AACb,EAAA,GAAA,CAAI,MAAA,CAAO,UAAA,IAAc,MAAA,GAAS,MAAA,CAAO,UAAA,IAAc,MAAA,EAAQ;AAC7D,IAAA,OAAA,EAAS,MAAA,CAAO,SAAA,CAAU,MAAA,CAAO,SAAS,CAAA;AAAA,EAC5C;AACA,EAAA,GAAA,CAAI,MAAA,CAAO,kBAAA,IAAsB,IAAA,EAAM;AACrC,IAAA,OAAA,EAAS,MAAA,CAAO,OAAA,CAAQ,cAAA,EAAgB,EAAE,CAAA;AAAA,EAC5C;AACA,EAAA,GAAA,CAAI,MAAA,CAAO,wBAAA,IAA4B,IAAA,EAAM;AAI3C,IAAA,OAAA,EAAS,MAAA,CAAO,OAAA,CAAQ,mBAAA,EAAqB,GAAG,CAAA;AAChD,IAAA,GAAA,CAAI,MAAA,CAAO,KAAA,IAAS,KAAA,EAAO;AACzB,MAAA,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,CAAA;AAAA,IACvB;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,kBAAA,CAAmB,KAAA,EAAuB;AACjD,EAAA,OAAO,KAAA,CAAM,SAAA,CAAU,KAAK,CAAA,CAAE,OAAA,CAAQ,kBAAA,EAAoB,EAAE,CAAA,CAAE,SAAA,CAAU,KAAK,CAAA;AAC/E;AAMO,SAAS,mBAAA,CAAoB,CAAA,EAAW,CAAA,EAAW,GAAA,EAAqB;AAC7E,EAAA,GAAA,CAAI,EAAA,IAAM,CAAA,EAAG,OAAO,CAAA;AACpB,EAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,OAAA,EAAS,CAAA,CAAE,MAAM,EAAA,EAAI,GAAA,EAAK,OAAO,IAAA,EAAM,CAAA;AACtD,EAAA,GAAA,CAAI,CAAA,CAAE,OAAA,IAAW,CAAA,EAAG,OAAO,CAAA,CAAE,MAAA;AAC7B,EAAA,GAAA,CAAI,CAAA,CAAE,OAAA,IAAW,CAAA,EAAG,OAAO,CAAA,CAAE,MAAA;AAE7B,EAAA,IAAI,SAAA,EAAW,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,CAAA,CAAE,OAAA,EAAS,EAAE,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM,CAAC,CAAA;AAC/D,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,GAAK,CAAA,CAAE,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAG;AACrC,IAAA,MAAM,QAAA,EAAU,CAAC,CAAC,CAAA;AAClB,IAAA,IAAI,OAAA,EAAS,CAAA;AACb,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,GAAK,CAAA,CAAE,MAAA,EAAQ,EAAA,GAAK,CAAA,EAAG;AACrC,MAAA,MAAM,KAAA,EAAO,CAAA,CAAE,EAAA,EAAI,CAAC,EAAA,IAAM,CAAA,CAAE,EAAA,EAAI,CAAC,EAAA,EAAI,EAAA,EAAI,CAAA;AACzC,MAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,GAAA;AAAA,QAChB,QAAA,CAAS,CAAC,EAAA,EAAe,CAAA;AAAA,QACzB,OAAA,CAAQ,EAAA,EAAI,CAAC,EAAA,EAAe,CAAA;AAAA,QAC5B,QAAA,CAAS,EAAA,EAAI,CAAC,EAAA,EAAe;AAAA,MAChC,CAAA;AACA,MAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA;AAClB,MAAA,GAAA,CAAI,MAAA,EAAQ,MAAA,EAAQ,OAAA,EAAS,KAAA;AAAA,IAC/B;AACA,IAAA,GAAA,CAAI,OAAA,EAAS,GAAA,EAAK,OAAO,IAAA,EAAM,CAAA;AAC/B,IAAA,SAAA,EAAW,OAAA;AAAA,EACb;AACA,EAAA,OAAO,QAAA,CAAS,CAAA,CAAE,MAAM,CAAA;AAC1B;AAYO,SAAS,SAAA,CACd,KAAA,EACA,QAAA,EACA,OAAA,EAA0B,CAAC,CAAA,EACV;AACjB,EAAA,MAAM,aAAA,EAAe,OAAO,SAAA,IAAa,SAAA,EAAW,CAAC,QAAQ,EAAA,EAAI,QAAA;AACjE,EAAA,MAAM,cAAA,EAAgB,aAAA,CAAc,KAAA,EAAO,MAAM,CAAA;AACjD,EAAA,MAAM,iBAAA,EAAmB,YAAA,CAAa,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW,aAAA,CAAc,MAAA,EAAQ,MAAM,CAAC,CAAA;AAEnF,EAAA,GAAA,CAAI,gBAAA,CAAiB,IAAA,CAAK,CAAC,MAAA,EAAA,GAAW,OAAA,IAAW,aAAa,CAAA,EAAG;AAC/D,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,GAAA,EAAK,QAAQ,CAAA;AAAA,EACvC;AAEA,EAAA,MAAM,kBAAA,EACJ,MAAA,CAAO,UAAA,IAAc,MAAA,GACrB,MAAA,CAAO,UAAA,IAAc,OAAA,GACrB,MAAA,CAAO,kBAAA,IAAsB,KAAA,GAC7B,MAAA,CAAO,wBAAA,IAA4B,IAAA;AACrC,EAAA,MAAM,gBAAA,EAAkB,kBAAA,EACpB,kBAAA,CAAmB,aAAA,EAAe,MAAM,EAAA,EACxC,aAAA;AACJ,EAAA,MAAM,mBAAA,EAAqB,kBAAA,EACvB,gBAAA,CAAiB,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW,kBAAA,CAAmB,MAAA,EAAQ,MAAM,CAAC,EAAA,EACnE,gBAAA;AAEJ,EAAA,GAAA,CAAI,kBAAA,GAAqB,kBAAA,CAAmB,IAAA,CAAK,CAAC,MAAA,EAAA,GAAW,OAAA,IAAW,eAAe,CAAA,EAAG;AACxF,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,GAAA,EAAK,aAAa,CAAA;AAAA,EAC5C;AAEA,EAAA,MAAM,YAAA,EACJ,MAAA,CAAO,eAAA,IAAmB,KAAA,EAAO,kBAAA,CAAmB,eAAe,EAAA,EAAI,eAAA;AACzE,EAAA,MAAM,eAAA,EACJ,MAAA,CAAO,eAAA,IAAmB,KAAA,EACtB,kBAAA,CAAmB,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW,kBAAA,CAAmB,MAAM,CAAC,EAAA,EAC7D,kBAAA;AAEN,EAAA,GAAA,CAAI,MAAA,CAAO,eAAA,IAAmB,KAAA,GAAQ,cAAA,CAAe,IAAA,CAAK,CAAC,MAAA,EAAA,GAAW,OAAA,IAAW,WAAW,CAAA,EAAG;AAC7F,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,GAAA,EAAK,SAAS,CAAA;AAAA,EACxC;AAEA,EAAA,MAAM,YAAA,mBAAc,MAAA,CAAO,WAAA,UAAe,GAAA;AAC1C,EAAA,GAAA,CACE,YAAA,EAAc,EAAA,GACd,cAAA,CAAe,IAAA;AAAA,IACb,CAAC,MAAA,EAAA,GAAW,mBAAA,CAAoB,WAAA,EAAa,MAAA,EAAQ,WAAW,EAAA,GAAK;AAAA,EACvE,CAAA,EACA;AACA,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,GAAA,EAAK,QAAQ,CAAA;AAAA,EACvC;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,GAAA,EAAK,OAAO,CAAA;AACvC;ATsKA;AACA;AUnOA,IAAM,SAAA,kBAAW,IAAI,GAAA,CAA8C,CAAA;AAU5D,SAAS,kBAAA,CACd,UAAA,EAC0C;AAC1C,EAAA,OAAO,UAAA;AACT;AAUO,SAAS,oBAAA,CACd,UAAA,EACM;AACN,EAAA,GAAA,CAAI,UAAA,CAAW,KAAA,IAAS,YAAA,EAAc;AAKpC,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,CAAA,yHAAA;AAAA,IACF,CAAA;AAAA,EACF;AACA,EAAA,MAAM,SAAA,EAAW,QAAA,CAAS,GAAA,CAAI,UAAA,CAAW,IAAI,CAAA;AAC7C,EAAA,GAAA,CAAI,SAAA,IAAa,KAAA,CAAA,EAAW;AAC1B,IAAA,GAAA,CAAK,SAAA,IAA0B,UAAA,EAAwB;AACrD,MAAA,MAAA;AAAA,IACF;AACA,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,CAAA,eAAA,EAAkB,UAAA,CAAW,IAAI,CAAA,gGAAA;AAAA,IAEnC,CAAA;AAAA,EACF;AACA,EAAA,QAAA,CAAS,GAAA,CAAI,UAAA,CAAW,IAAA,EAAM,UAAyD,CAAA;AACzF;AAGO,SAAS,yBAAA,CACd,IAAA,EAC8C;AAC9C,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA;AAC1B;AAGO,SAAS,uBAAA,CAAA,EAAoC;AAClD,EAAA,OAAO,CAAC,GAAG,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA;AAC5B;AVoMA;AACA;AWvXO,SAAS,oBAAA,CAAqB,YAAA,EAAiC;AACpE,EAAA,OAAO,YAAA,CAAa,KAAA,CAAM,CAAC,SAAA,EAAA,GAAc,SAAS,EAAA,EAAI,EAAA,EAAI,CAAA;AAC5D;AXyXA;AACA;AY7WO,SAAS,eAAA,CACd,eAAA,EACA,iBAAA,EACA,YAAA,EACA,cAAA,EACQ;AACR,EAAA,MAAM,OAAA,EAAS,gBAAA,EAAkB,YAAA;AACjC,EAAA,MAAM,QAAA,EAAU,eAAA,IAAmB,EAAA,EAAI,EAAA,EAAI,kBAAA,EAAoB,cAAA;AAC/D,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,OAAA,EAAS,OAAO,CAAA;AACrC;AAYO,SAAS,oBAAA,CAAqB,aAAA,EAAuB,WAAA,EAA6B;AACvF,EAAA,OAAO,cAAA,EAAgB,WAAA;AACzB;AZ+VA;AACA;Aa3XA,SAAS,SAAA,CAAU,KAAA,EAAqC;AACtD,EAAA,OAAO;AAAA,IACL,GAAI,KAAA,CAAM,cAAA,IAAkB,KAAA,EAAA,EAAY,EAAE,aAAA,EAAe,KAAA,CAAM,cAAc,EAAA,EAAI,CAAC,CAAA;AAAA,IAClF,GAAI,KAAA,CAAM,eAAA,IAAmB,KAAA,EAAA,EAAY,EAAE,IAAA,EAAM,KAAA,CAAM,eAAe,EAAA,EAAI,CAAC,CAAA;AAAA,IAC3E,GAAG,KAAA,CAAM;AAAA,EACX,CAAA;AACF;AAOO,SAAS,oBAAA,CACd,IAAA,EACA,QAAA,EACsB;AACtB,EAAA,MAAM,QAAA,EAA2B,CAAC,CAAA;AAClC,EAAA,MAAM,gBAAA,EAA6B,CAAC,CAAA;AAEpC,EAAA,IAAA,CAAA,MAAW,MAAA,GAAS,IAAA,CAAK,MAAA,EAAQ;AAC/B,IAAA,MAAM,SAAA,EAAW,QAAA,CAAS,OAAA,CAAQ,KAAA,CAAM,EAAE,CAAA;AAC1C,IAAA,MAAM,MAAA,EAAQ,OAAO,SAAA,IAAa,SAAA,EAAW,SAAA,EAAW,EAAA;AACxD,IAAA,MAAM,QAAA,EAAU,SAAA,CAAU,KAAA,EAAO,KAAA,CAAM,eAAA,EAAiB,SAAA,CAAU,KAAK,CAAC,CAAA,CAAE,OAAA;AAE1E,IAAA,eAAA,CAAgB,IAAA,CAAK,OAAO,CAAA;AAC5B,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,MAAA,EAAQ,KAAA,CAAM,EAAA;AAAA,MACd,OAAA,EAAS,OAAA;AAAA,MACT,OAAA,EAAS,QAAA,EAAU,UAAA,EAAY,WAAA;AAAA,MAC/B,eAAA,EAAiB,CAAC,KAAK,CAAA;AAAA,MACvB,eAAA,EAAiB,CAAC,GAAG,KAAA,CAAM,eAAe,CAAA;AAAA,MAC1C,MAAA,EAAQ;AAAA,IACV,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,cAAA,EAAgB,eAAA,CAAgB,MAAA,CAAO,OAAO,CAAA,CAAE,MAAA;AACtD,EAAA,MAAM,WAAA,EACJ,IAAA,CAAK,gBAAA,IAAoB,iBAAA,EACrB,oBAAA,CAAqB,eAAe,EAAA,EACpC,oBAAA,CAAqB,aAAA,EAAe,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAE5D,EAAA,OAAO,EAAE,KAAA,EAAO,UAAA,EAAY,QAAA,EAAU,CAAA,EAAG,QAAA,EAAU,IAAA,EAAM,QAAQ,CAAA;AACnE;Ab6WA;AACA;Ac3ZO,SAAS,mBAAA,CACd,IAAA,EACA,QAAA,EACsB;AACtB,EAAA,MAAM,WAAA,EAAa,IAAI,GAAA,CAAI,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW,CAAC,MAAA,CAAO,EAAA,EAAI,MAAM,CAAC,CAAC,CAAA;AAC5E,EAAA,MAAM,SAAA,EAAW,IAAI,GAAA,CAAI,QAAA,CAAS,iBAAiB,CAAA;AAEnD,EAAA,MAAM,aAAA,EAAe,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,SAAS,CAAA,CAAE,MAAA;AACvE,EAAA,MAAM,eAAA,EAAiB,IAAA,CAAK,OAAA,CAAQ,OAAA,EAAS,YAAA;AAE7C,EAAA,IAAI,UAAA;AAEJ,EAAA,GAAA,CAAI,IAAA,CAAK,gBAAA,IAAoB,gBAAA,EAAkB;AAC7C,IAAA,GAAA,CAAI,IAAA,CAAK,KAAA,IAAS,QAAA,EAAU;AAC1B,MAAA,WAAA,EACE,QAAA,CAAS,iBAAA,CAAkB,OAAA,IAAW,EAAA,mBACtC,UAAA,qBAAW,GAAA,mBAAI,QAAA,CAAS,iBAAA,CAAkB,CAAC,CAAC,CAAA,6BAAG,YAAA,IAAc,KAAA,EACzD,EAAA,EACA,CAAA;AAAA,IACR,EAAA,KAAO;AACL,MAAA,MAAM,WAAA,EAAa,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,SAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAA,GAAM,CAAA,CAAE,EAAE,CAAA;AAC1E,MAAA,MAAM,mBAAA,EAAqB,UAAA,CAAW,KAAA,CAAM,CAAC,EAAA,EAAA,GAAO,QAAA,CAAS,GAAA,CAAI,EAAE,CAAC,CAAA;AACpE,MAAA,WAAA,EAAa,QAAA,CAAS,KAAA,IAAS,UAAA,CAAW,OAAA,GAAU,mBAAA,EAAqB,EAAA,EAAI,CAAA;AAAA,IAC/E;AAAA,EACF,EAAA,KAAO;AACL,IAAA,IAAI,gBAAA,EAAkB,CAAA;AACtB,IAAA,IAAI,kBAAA,EAAoB,CAAA;AACxB,IAAA,IAAA,CAAA,MAAW,GAAA,GAAM,QAAA,EAAU;AACzB,MAAA,MAAM,OAAA,EAAS,UAAA,CAAW,GAAA,CAAI,EAAE,CAAA;AAChC,MAAA,GAAA,iBAAI,MAAA,6BAAQ,WAAA,EAAW;AACrB,QAAA,gBAAA,GAAmB,CAAA;AAAA,MACrB,EAAA,KAAO;AACL,QAAA,kBAAA,GAAqB,CAAA;AAAA,MACvB;AAAA,IACF;AACA,IAAA,WAAA,EAAa,eAAA,CAAgB,eAAA,EAAiB,iBAAA,EAAmB,YAAA,EAAc,cAAc,CAAA;AAAA,EAC/F;AAEA,EAAA,MAAM,QAAA,EAA2B,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW;AAC5D,IAAA,MAAM,YAAA,EAAc,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA;AAC1C,IAAA,MAAM,QAAA,EAAU,YAAA,EACZ,MAAA,CAAO,UAAA,EACL,UAAA,EACA,YAAA,EACF,MAAA,CAAO,UAAA,EACL,qBAAA,EACA,kBAAA;AACN,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,MAAA,CAAO,EAAA;AAAA,MACf,OAAA,EAAS,YAAA,IAAgB,MAAA,CAAO,SAAA;AAAA,MAChC,OAAA;AAAA,MACA,eAAA,EAAiB,CAAC,YAAA,EAAc,WAAA,EAAa,cAAc,CAAA;AAAA,MAC3D,eAAA,EAAiB,CAAC,MAAA,CAAO,UAAA,EAAY,WAAA,EAAa,cAAc,CAAA;AAAA,MAChE,MAAA,EAAQ;AAAA,IACV,CAAA;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,KAAA,EAAO,UAAA,EAAY,QAAA,EAAU,CAAA,EAAG,QAAA,EAAU,IAAA,EAAM,QAAQ,CAAA;AACnE;Ad2YA;AACA;AevbA,IAAM,qBAAA,EAAoC;AAAA,EACxC,aAAA,EAAe,QAAA;AAAA,EACf,IAAA,EAAM,QAAA;AAAA,EACN,EAAA,EAAI,QAAA;AAAA,EACJ,KAAA,EAAO,QAAA;AAAA,EACP,KAAA,EAAO,QAAA;AAAA,EACP,aAAA,EAAe,QAAA;AAAA,EACf,MAAA,EAAQ,QAAA;AAAA,EACR,kBAAA,EAAoB,QAAA;AAAA,EACpB,eAAA,EAAiB;AACnB,CAAA;AAEA,IAAM,6BAAA,EAA4C;AAAA,EAChD,GAAG,oBAAA;AAAA,EACH,QAAA,EAAU,QAAA;AAAA,EACV,YAAA,EAAc,QAAA;AAAA,EACd,IAAA,EAAM,QAAA;AAAA,EACN,OAAA,EAAS,QAAA;AAAA,EACT,eAAA,EAAiB,YAAA;AAAA,EACjB,QAAA,EAAU,YAAA;AAAA,EACV,OAAA,EAAS;AAAA,IACP,EAAA,EAAI,QAAA;AAAA,IACJ,IAAA,EAAM,QAAA;AAAA,IACN,SAAA,EAAW,YAAA;AAAA,IACX,QAAA,EAAU;AAAA,EACZ;AACF,CAAA;AAEA,IAAM,gCAAA,EAA+C;AAAA,EACnD,GAAG,oBAAA;AAAA,EACH,OAAA,EAAS,QAAA;AAAA,EACT,WAAA,EAAa,QAAA;AAAA,EACb,eAAA,EAAiB,YAAA;AAAA,EACjB,QAAA,EAAU,YAAA;AAAA,EACV,MAAA,EAAQ;AAAA,IACN,EAAA,EAAI,QAAA;AAAA,IACJ,IAAA,EAAM,QAAA;AAAA,IACN,eAAA,EAAiB,YAAA;AAAA,IACjB,aAAA,EAAe,YAAA;AAAA,IACf,cAAA,EAAgB,YAAA;AAAA,IAChB,KAAA,EAAO,YAAA;AAAA,IACP,QAAA,EAAU;AAAA,EACZ;AACF,CAAA;AAEA,IAAM,8BAAA,EAA6C;AAAA,EACjD,GAAG,oBAAA;AAAA,EACH,MAAA,EAAQ,QAAA;AAAA,EACR,UAAA,EAAY,QAAA;AAAA,EACZ,QAAA,EAAU,QAAA;AAAA,EACV,QAAA,EAAU,QAAA;AAAA,EACV,cAAA,EAAgB,QAAA;AAAA,EAChB,QAAA,EAAU,YAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMV,MAAA,EAAQ;AACV,CAAA;AAGO,IAAM,mBAAA,EAAqB,kBAAA,CAGhC;AAAA,EACA,IAAA,EAAM,iBAAA;AAAA;AAAA;AAAA,EAGN,MAAA,EAAQ,wBAAA;AAAA,EACR,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,oBAAoB,CAAA;AAAA,EACpD,UAAA,EAAY,CAAC,QAAA,EAAA,GAAA,kCAAc,QAAA,6BAAU,iBAAA,qBAAkB,QAAA,UAAU,GAAA,EAAA,EAAK,CAAA;AAAA,EACtE,WAAA,EAAa,4BAAA;AAAA,EACb,cAAA,EAAgB,gCAAA;AAAA,EAChB,OAAA,EAAS;AAAA,IACP,mBAAA,EAAqB,qDAAA;AAAA,IACrB,mBAAA,EAAqB,QAAA;AAAA,IACrB,uBAAA,EAAyB,CAAC,IAAA,EAAA,GAAS;AAAA,MACjC,IAAA,CAAK,OAAA,CACF,MAAA,CAAO,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,SAAS,CAAA,CACnC,GAAA,CAAI,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,EAAE,CAAA,CACzB,IAAA,CAAK,KAAK;AAAA,IACf;AAAA,EACF,CAAA;AAAA,EACA,YAAA,EAAc,CAAC,iBAAA,EAAmB,mBAAA,EAAqB,WAAW;AACpE,CAAC,CAAA;AAGM,IAAM,oBAAA,EAAsB,kBAAA,CAGjC;AAAA,EACA,IAAA,EAAM,oBAAA;AAAA,EACN,MAAA,EAAQ,yBAAA;AAAA,EACR,OAAA,EAAS,EAAE,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,qBAAqB,CAAA;AAAA,EACrD,UAAA,EAAY,CAAC,QAAA,EAAA,GACX,MAAA,CAAO,MAAA,kCAAO,QAAA,6BAAU,SAAA,UAAW,CAAC,GAAC,CAAA,CAAE,IAAA,CAAK,CAAC,MAAA,EAAA,GAAW,MAAA,CAAO,IAAA,CAAK,CAAA,CAAE,OAAA,EAAS,CAAC,CAAA;AAAA,EAClF,WAAA,EAAa,+BAAA;AAAA,EACb,cAAA,EAAgB,iCAAA;AAAA,EAChB,OAAA,EAAS;AAAA,IACP,mBAAA,EAAqB,qDAAA;AAAA,IACrB,mBAAA,EAAqB,SAAA;AAAA;AAAA;AAAA;AAAA,IAIrB,uBAAA,EAAyB,CAAC,IAAA,EAAA,GAAS;AAAA,MACjC,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,EAAA,oBAAU,KAAA,CAAM,eAAA,CAAgB,CAAC,CAAA,UAAK,IAAE,CAAA,CAAE,IAAA,CAAK,KAAK;AAAA,IACvE;AAAA,EACF,CAAA;AAAA,EACA,YAAA,EAAc,CAAC,cAAA,EAAgB,gBAAA,EAAkB,WAAW;AAC9D,CAAC,CAAA;AASM,IAAM,oBAAA,EAAsB,kBAAA,CAGjC;AAAA,EACA,IAAA,EAAM,kBAAA;AAAA,EACN,MAAA,EAAQ,yBAAA;AAAA,EACR,OAAA,EAAS;AAAA,IACP,IAAA,EAAM,UAAA;AAAA,IACN,MAAA,EAAQ,wBAAA;AAAA,IACR,OAAA,EAAS,CAAC,IAAA,EAAM,QAAA,EAAA,GAAa;AAC3B,MAAA,MAAM,UAAA,EAAY,UAAA,kCAAW,QAAA,6BAAU,MAAA,UAAQ,IAAE,CAAA;AACjD,MAAA,OAAO;AAAA,QACL,gBAAA,EACE,SAAA,IAAa,KAAA,EAAA,GAAa,UAAA,GAAa,IAAA,CAAK,SAAA,GAAY,UAAA,GAAa,IAAA,CAAK,QAAA;AAAA,QAC5E;AAAA,MACF,CAAA;AAAA,IACF;AAAA,EACF,CAAA;AAAA,EACA,UAAA,EAAY,CAAC,QAAA,EAAA,GAAA,kCAAc,QAAA,+BAAU,IAAA,uBAAK,IAAA,qBAAK,CAAA,uBAAE,QAAA,UAAU,GAAA,EAAA,EAAK,CAAA;AAAA,EAChE,WAAA,EAAa,6BAAA;AAAA,EACb,cAAA,EAAgB,iCAAA;AAAA,EAChB,OAAA,EAAS;AAAA,IACP,mBAAA,EAAqB,qDAAA;AAAA,IACrB,mBAAA,EAAqB,cAAA;AAAA,IACrB,uBAAA,EAAyB,CAAA,EAAA,GAAM,CAAC;AAAA,EAClC,CAAA;AAAA,EACA,YAAA,EAAc,CAAC,cAAA,EAAgB,WAAW;AAC5C,CAAC,CAAA;AAED,oBAAA,CAAqB,kBAAkB,CAAA;AACvC,oBAAA,CAAqB,mBAAmB,CAAA;AACxC,oBAAA,CAAqB,mBAAmB,CAAA;Af2ZxC;AACA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,6qDAAC","file":"/home/runner/work/learning-kit/learning-kit/packages/lk-core/dist/chunk-4JR3UXX6.cjs","sourcesContent":[null,"/**\n * Canonical word counter for written-response bounds (Req 22.9): tokens are\n * maximal runs of non-whitespace (split on `\\s+`), so hyphenated forms\n * (`well-known`) count as one word. The empty / whitespace-only string counts\n * 0. Consumers must use this helper rather than re-implementing the split so\n * client previews, SDK scoring, and stored `wordCount` values always agree.\n */\nexport function countWords(text: string): number {\n  // Tolerate non-strings: this runs on client-supplied submission payloads,\n  // where a malformed value must score 0 rather than throw mid-grading.\n  if (typeof text !== 'string') {\n    return 0;\n  }\n  const trimmed = text.trim();\n  if (trimmed === '') {\n    return 0;\n  }\n  return trimmed.split(/\\s+/).length;\n}\n","import type { ValidationError } from './types/activity.js';\n\n/** Thrown when activity data fails schema validation at a component boundary. */\nexport class ActivitySchemaError extends Error {\n  constructor(\n    public readonly activityType: string,\n    public readonly errors: ValidationError[],\n  ) {\n    super(`Invalid activity data for type \"${activityType}\"`);\n    this.name = 'ActivitySchemaError';\n  }\n}\n\n/** Thrown when an unrecognised activity type is passed to the scoring engine. */\nexport class UnknownActivityTypeError extends Error {\n  constructor(public readonly activityType: string) {\n    super(`Activity type \"${activityType}\" is not registered`);\n    this.name = 'UnknownActivityTypeError';\n  }\n}\n\n/**\n * Thrown when `score()` is asked to grade a `redact()` projection (or any\n * activity data whose answer key is missing, yielding a non-finite score).\n * Redacted data is learner-safe precisely because the key was removed, so a\n * score derived from it is meaningless — previously this produced a silent\n * `NaN` that serialized to `null` in a grade column. `evaluate()` returns\n * `{ status: 'unscorable' }` for the same input instead of throwing.\n */\nexport class RedactedScoringError extends Error {\n  constructor(public readonly activityType: string) {\n    super(\n      `Activity data for \"${activityType}\" carries no answer key (it looks redacted), so it cannot be scored. ` +\n        'Score against the full activity data server-side, or use evaluate() which returns { status: \"unscorable\" }.',\n    );\n    this.name = 'RedactedScoringError';\n  }\n}\n\n/**\n * Thrown when `score()` is called for an activity type whose grading is\n * deferred (asynchronous AI/human grading, e.g. `written-response`). A\n * deferred submission has no synchronous score — treating it as 0 would show\n * a learner a failing grade for work that simply has not been graded yet.\n * Call `evaluate()` instead, which returns `{ status: 'deferred', ... }`.\n */\nexport class DeferredScoringError extends Error {\n  constructor(public readonly activityType: string) {\n    super(\n      `Activity type \"${activityType}\" is graded asynchronously and has no synchronous score. ` +\n        `Use evaluate() — it returns { status: 'deferred' } for this type.`,\n    );\n    this.name = 'DeferredScoringError';\n  }\n}\n","import { z } from 'zod/v4';\n\n/**\n * Optional authored \"overall feedback\" shown after submission, selected by\n * whether the learner passed (h5p-style overall feedback). Both fields are\n * optional; non-empty when present.\n */\nexport const FeedbackSchema = z.looseObject({\n  correct: z.string().min(1).optional(),\n  incorrect: z.string().min(1).optional(),\n});\n","import { z } from 'zod/v4';\n\n/**\n * Optional media attached to an activity, rendered above the question or\n * passage — e.g. a recording to listen to, or an embedded video to watch\n * before answering. URL-only by design: hosting/delivery (S3/CDN, or the\n * provider's own embed for `embed`) is the consuming app's responsibility\n * (see requirements \"Non-Goals and Shared Responsibility\").\n *\n * - `image`: rendered as `<img>` — `alt` is REQUIRED (WCAG 1.1.1 / Req 14.5).\n * - `audio` / `video`: rendered with native controls; `alt` is an optional\n *   accessible label; `captionsUrl` points at a WebVTT `<track>`. `url` must\n *   be a direct media file (NOT a YouTube/Vimeo page — use `embed` for those).\n * - `embed`: rendered as a sandboxed `<iframe>` for provider players\n *   (YouTube/Vimeo/etc.). `url` MUST be the provider's *embeddable* URL\n *   (e.g. `https://www.youtube.com/embed/<id>`). `alt` is REQUIRED and used\n *   as the iframe's accessible `title` (WCAG 4.1.2 / 2.4.1).\n */\n/**\n * Media URL policy (security-reviewed): absolute URLs must use `https:`,\n * `http:`, `data:`, or `blob:`; root-relative paths (`/media/x.mp3`) are\n * allowed for same-origin hosting. Everything else — notably `javascript:`,\n * `file:`, `ftp:` — is rejected: these URLs land in `src` attributes\n * (including an iframe for `embed`), so an unvetted scheme is a stored-XSS\n * vector in every consuming app.\n */\nexport const MediaUrlSchema = z.union([\n  z.url().refine((value) => /^(https?|data|blob):/i.test(value), {\n    error: 'Absolute media URLs must use the https:, http:, data:, or blob: scheme.',\n  }),\n  z.string().regex(/^\\/(?!\\/)\\S*$/, {\n    error: 'Relative media URLs must be root-relative (a single leading \"/\").',\n  }),\n]);\n\nexport const MediaSchema = z\n  .looseObject({\n    type: z.enum(['image', 'audio', 'video', 'embed']),\n    url: MediaUrlSchema,\n    alt: z.string().min(1).optional(),\n    captionsUrl: MediaUrlSchema.optional(),\n  })\n  .refine(\n    (m) =>\n      (m.type !== 'image' && m.type !== 'embed') || (typeof m.alt === 'string' && m.alt.length > 0),\n    {\n      error: 'image and embed media require non-empty alt text (WCAG 1.1.1 / 4.1.2).',\n      path: ['alt'],\n    },\n  )\n  .refine((m) => m.type !== 'embed' || /^https?:\\/\\//i.test(m.url), {\n    error:\n      'embed media requires an absolute http(s) provider URL. data:, blob:, and relative URLs are not allowed for embeds — the embed iframe runs with allow-scripts, and a data:/same-origin document there is an XSS vector.',\n    path: ['url'],\n  });\n","import { z } from 'zod/v4';\nimport { FeedbackSchema } from './feedback.js';\nimport { MediaSchema } from './media.js';\n\n/** Matches `{{ blank_id }}` placeholders in a passage, capturing the trimmed id. */\nconst PLACEHOLDER_RE = /\\{\\{\\s*([^{}]+?)\\s*\\}\\}/g;\n\n/**\n * Zod schema for a `TextMatchPolicy` — the opt-in matching tolerances a blank\n * may declare. Every default reproduces the v1 trim + case-fold semantics.\n */\nexport const TextMatchPolicySchema = z.looseObject({\n  caseSensitive: z.boolean().optional(),\n  trim: z.boolean().optional(),\n  normalize: z.enum(['none', 'NFC', 'NFKC']).optional(),\n  foldDiacritics: z.boolean().optional(),\n  collapseInnerWhitespace: z.boolean().optional(),\n  ignorePunctuation: z.boolean().optional(),\n  levenshtein: z.number().int().min(0).optional(),\n  locale: z.string().optional(),\n});\n\n/**\n * Zod schema for a single fill-in-the-blank slot configuration. Loose:\n * unknown keys are preserved through validation. Accepted answers must\n * contain non-whitespace characters — a whitespace-only accepted answer\n * normalizes to the empty string and would mark an empty response correct.\n */\nexport const BlankConfigSchema = z.looseObject({\n  id: z.string().min(1),\n  acceptedAnswers: z\n    .array(\n      z\n        .string()\n        .min(1)\n        .refine((answer) => answer.trim().length > 0, {\n          error: 'Accepted answers must contain non-whitespace characters.',\n        }),\n    )\n    .min(1),\n  caseSensitive: z.boolean().optional(),\n  trimWhitespace: z.boolean().optional(),\n  match: TextMatchPolicySchema.optional(),\n  hint: z.string().optional(),\n  feedback: z.string().optional(),\n});\n\n/**\n * Zod schema validating the full Fill-in-the-Blanks activity data contract.\n * Loose at every level: unknown keys are preserved, never stripped (B7).\n *\n * The refinement enforces a true one-to-one correspondence between `{{id}}`\n * placeholders and `blanks[].id`: every blank id appears EXACTLY ONCE in the\n * passage and exactly once in `blanks[]`. (The previous set-based check let\n * duplicate placeholders and duplicate blank configs through, corrupting the\n * partial-score denominator and per-item details.)\n */\nexport const FillInTheBlanksDataSchema = z\n  .looseObject({\n    schemaVersion: z.literal('1.0'),\n    type: z.literal('fill-in-the-blanks'),\n    id: z.string().min(1),\n    title: z.string().min(1),\n    passage: z.string().min(1),\n    passageHtml: z.string().optional(),\n    blanks: z.array(BlankConfigSchema).min(1),\n    scoringStrategy: z.enum(['all-or-nothing', 'partial']),\n    media: MediaSchema.optional(),\n    feedback: FeedbackSchema.optional(),\n    passThreshold: z.number().min(0).max(1).optional(),\n    locale: z.string().optional(),\n    learningObjectives: z.array(z.string()).optional(),\n    difficultyLevel: z.literal([1, 2, 3, 4, 5]).optional(),\n  })\n  .refine(\n    (data) => {\n      const placeholderCounts = new Map<string, number>();\n      for (const match of data.passage.matchAll(PLACEHOLDER_RE)) {\n        const id = match[1] as string;\n        placeholderCounts.set(id, (placeholderCounts.get(id) ?? 0) + 1);\n      }\n      const blankIds = data.blanks.map((blank) => blank.id);\n      if (new Set(blankIds).size !== blankIds.length) {\n        return false;\n      }\n      if (placeholderCounts.size !== blankIds.length) {\n        return false;\n      }\n      return blankIds.every((id) => placeholderCounts.get(id) === 1);\n    },\n    {\n      error:\n        'Each blank id must appear exactly once in blanks[] and have exactly one matching {{id}} placeholder in the passage, and vice versa.',\n      path: ['passage'],\n    },\n  );\n","import { z } from 'zod/v4';\nimport { FeedbackSchema } from './feedback.js';\nimport { MediaSchema } from './media.js';\n\n/**\n * Zod schema for a single Multiple Choice option. Loose: unknown keys are\n * preserved through validation (forward-compat / consumer sidecars — B7).\n */\nexport const MultipleChoiceOptionSchema = z.looseObject({\n  id: z.string().min(1),\n  text: z.string().min(1),\n  isCorrect: z.boolean(),\n  feedback: z.string().optional(),\n});\n\n/**\n * Zod schema validating the full Multiple Choice activity data contract.\n * Loose at every level: unknown keys are preserved, never stripped, so a\n * v0.3 runtime reading a future payload (or a consumer sidecar field) does\n * not silently delete data.\n *\n * Semantic guards: (1) at least one option must be correct, otherwise the\n * activity can never be answered correctly; (2) `mode: 'single'` must have\n * exactly one correct option — multiple correct options under single-select\n * make `showCorrectAnswers` and the xAPI correct-response ambiguous and mask\n * authoring errors; (3) option ids must be unique — the scorer looks options\n * up by id, so a duplicate id makes one option unscoreable. All are\n * unrepresentable in JSON Schema and are dropped from `toJSONSchema` output\n * by design.\n */\nexport const MultipleChoiceDataSchema = z\n  .looseObject({\n    schemaVersion: z.literal('1.0'),\n    type: z.literal('multiple-choice'),\n    id: z.string().min(1),\n    title: z.string().min(1),\n    question: z.string().min(1),\n    questionHtml: z.string().optional(),\n    mode: z.enum(['single', 'multi']),\n    options: z.array(MultipleChoiceOptionSchema).min(2).max(26),\n    scoringStrategy: z.enum(['all-or-nothing', 'partial']),\n    media: MediaSchema.optional(),\n    feedback: FeedbackSchema.optional(),\n    passThreshold: z.number().min(0).max(1).optional(),\n    shuffle: z.boolean().optional(),\n    locale: z.string().optional(),\n    learningObjectives: z.array(z.string()).optional(),\n    difficultyLevel: z.literal([1, 2, 3, 4, 5]).optional(),\n  })\n  .refine((data) => data.options.some((option) => option.isCorrect), {\n    error: 'At least one option must be marked correct.',\n    path: ['options'],\n  })\n  .refine(\n    (data) =>\n      data.mode !== 'single' || data.options.filter((option) => option.isCorrect).length === 1,\n    {\n      error: 'Single-select activities (mode: \"single\") must have exactly one correct option.',\n      path: ['options'],\n    },\n  )\n  .refine((data) => new Set(data.options.map((option) => option.id)).size === data.options.length, {\n    error: 'Option ids must be unique within the activity.',\n    path: ['options'],\n  });\n","import { z } from 'zod/v4';\nimport { FeedbackSchema } from './feedback.js';\nimport { MediaSchema } from './media.js';\n\n/** Zod schema for a single rubric criterion. Loose: unknown keys preserved. */\nexport const WrittenResponseRubricCriterionSchema = z.looseObject({\n  name: z.string().min(1),\n  description: z.string().optional(),\n  weight: z.number().min(0),\n});\n\n/** Zod schema for a written-response grading rubric. Loose: unknown keys preserved. */\nexport const WrittenResponseRubricSchema = z.looseObject({\n  label: z.string().optional(),\n  criteria: z.array(WrittenResponseRubricCriterionSchema).min(1),\n});\n\n/**\n * Zod schema validating the Written Response activity data contract (Req 22).\n *\n * Wire-format constraints (Req 22.9): field names are locked for\n * byte-compatibility with consumer-stored rows, and the schema is loose at\n * EVERY level (Req 22.5) — unknown top-level keys, `promptHtml`, `rubric`\n * sidecars and any future fields survive `validateActivity` verbatim.\n */\nexport const WrittenResponseDataSchema = z\n  .looseObject({\n    schemaVersion: z.literal('1.0'),\n    type: z.literal('written-response'),\n    id: z.string().min(1),\n    title: z.string().min(1),\n    prompt: z.string(),\n    promptHtml: z.string().optional(),\n    minWords: z.number().int().min(0),\n    maxWords: z.number().int().min(1),\n    rubric: WrittenResponseRubricSchema.optional(),\n    languageTarget: z.string().optional(),\n    media: MediaSchema.optional(),\n    feedback: FeedbackSchema.optional(),\n    passThreshold: z.number().min(0).max(1).optional(),\n    locale: z.string().optional(),\n    learningObjectives: z.array(z.string()).optional(),\n    difficultyLevel: z.literal([1, 2, 3, 4, 5]).optional(),\n  })\n  .refine((data) => data.maxWords >= data.minWords, {\n    error: 'maxWords must be greater than or equal to minWords.',\n    path: ['maxWords'],\n  });\n","import { z } from 'zod/v4';\nimport { MediaSchema } from './media.js';\nimport { WrittenResponseRubricSchema } from './written-response.js';\n\n/**\n * Schemas for REDACTED activity data — the learner-safe projection `redact()`\n * produces (R7). Deliberately STRICT (`z.strictObject`), the opposite of the\n * loose content schemas: a redacted payload must prove the ABSENCE of every\n * answer-key and author-only field, so any unknown key is a validation\n * failure, not a passthrough. `assertRedacted` validates against these.\n */\n\n/** Shared fields every redacted activity carries. */\nconst redactedBase = {\n  /** Marker distinguishing a redacted projection from full activity data. */\n  redacted: z.literal(true),\n  schemaVersion: z.literal('1.0'),\n  id: z.string().min(1),\n  title: z.string().min(1),\n  media: MediaSchema.optional(),\n  passThreshold: z.number().min(0).max(1).optional(),\n  locale: z.string().optional(),\n  learningObjectives: z.array(z.string()).optional(),\n  difficultyLevel: z.literal([1, 2, 3, 4, 5]).optional(),\n};\n\n/** A redacted Multiple Choice option: id and display text only — no `isCorrect`, no feedback. */\nexport const RedactedMultipleChoiceOptionSchema = z.strictObject({\n  id: z.string().min(1),\n  text: z.string().min(1),\n});\n\n/**\n * Redacted Multiple Choice data: renderable (question, mode, options to pick\n * from) with the answer key, per-option feedback, overall feedback, and the\n * scoring strategy removed. `scoringStrategy` is answer-key by design: MC\n * `partial` carries a wrong-selection penalty `all-or-nothing` does not, so\n * knowing the strategy tells a learner whether guessing is free.\n */\nexport const RedactedMultipleChoiceDataSchema = z.strictObject({\n  ...redactedBase,\n  type: z.literal('multiple-choice'),\n  question: z.string().min(1),\n  questionHtml: z.string().optional(),\n  mode: z.enum(['single', 'multi']),\n  options: z.array(RedactedMultipleChoiceOptionSchema).min(2).max(26),\n  shuffle: z.boolean().optional(),\n});\n\n/** A redacted blank: id and hint only — no accepted answers, no matching rules, no feedback. */\nexport const RedactedBlankConfigSchema = z.strictObject({\n  id: z.string().min(1),\n  hint: z.string().optional(),\n});\n\n/** Redacted Fill-in-the-Blanks data: passage and blank slots, key removed. */\nexport const RedactedFillInTheBlanksDataSchema = z.strictObject({\n  ...redactedBase,\n  type: z.literal('fill-in-the-blanks'),\n  passage: z.string().min(1),\n  passageHtml: z.string().optional(),\n  blanks: z.array(RedactedBlankConfigSchema).min(1),\n});\n\n/**\n * Redacted Written Response data: the prompt, word bounds and rubric are\n * learner-visible (a rubric tells the learner what they are graded on);\n * authored pass/fail feedback is removed until the grade exists.\n */\nexport const RedactedWrittenResponseDataSchema = z.strictObject({\n  ...redactedBase,\n  type: z.literal('written-response'),\n  prompt: z.string(),\n  promptHtml: z.string().optional(),\n  minWords: z.number().int().min(0),\n  maxWords: z.number().int().min(1),\n  rubric: WrittenResponseRubricSchema.optional(),\n  languageTarget: z.string().optional(),\n});\n","/**\n * Configurable free-text answer matching (R3.3).\n *\n * Grade-stability contract: the DEFAULTS reproduce the v1 fill-in-the-blanks\n * semantics exactly (trim, then locale-insensitive lowercase, strict `===`).\n * Every tolerance below is opt-in, because changing a default here changes\n * historical grades — and this SDK powers real summative exams.\n */\nexport interface TextMatchPolicy {\n  /** Compare case-sensitively. Default `false` (v1 behaviour). */\n  caseSensitive?: boolean;\n  /** Strip leading/trailing whitespace before comparing. Default `true` (v1 behaviour). */\n  trim?: boolean;\n  /**\n   * Unicode normalization applied to both sides before comparing. Default\n   * `'none'` (v1 behaviour). `'NFC'` makes a decomposed `está` (combining\n   * U+0301) equal its composed form — the fix for accent-input mismatches in\n   * EN/ES/PT content.\n   */\n  normalize?: 'none' | 'NFC' | 'NFKC';\n  /** Treat diacritics as equal to their base letters (`está` ≡ `esta`). Default `false`. */\n  foldDiacritics?: boolean;\n  /** Collapse runs of inner whitespace to a single space. Default `false`. */\n  collapseInnerWhitespace?: boolean;\n  /** Ignore Unicode punctuation on both sides. Default `false`. */\n  ignorePunctuation?: boolean;\n  /** Maximum Levenshtein edit distance still accepted as a match. Default `0`. */\n  levenshtein?: number;\n  /**\n   * BCP 47 tag for locale-aware case folding (e.g. `'tr'` for Turkish dotted /\n   * dotless I). Default: locale-insensitive `toLowerCase()` (v1 behaviour).\n   */\n  locale?: string;\n}\n\n/**\n * How a match was achieved. Lets a consumer award full credit for an `exact`\n * match and partial credit for a `folded` or `fuzzy` one (e.g. diacritic\n * tolerance in a listening gap-fill vs. a spelling test).\n * - `exact` — equal under the baseline trim/case rules alone.\n * - `normalized` — required Unicode normalization, whitespace collapse, or punctuation tolerance.\n * - `folded` — required diacritic folding.\n * - `fuzzy` — required Levenshtein tolerance.\n * - `none` — no accepted answer matched.\n */\nexport interface TextMatchResult {\n  matched: boolean;\n  via: 'exact' | 'normalized' | 'folded' | 'fuzzy' | 'none';\n}\n\n/** Combining marks (any script) removed for diacritic folding after NFD decomposition. */\nconst COMBINING_MARKS_RE = /\\p{M}/gu;\n/**\n * Unicode punctuation (`\\p{P}`) removed by `ignorePunctuation`. Deliberately\n * NOT `\\p{S}`: symbols like `$`, `+`, `%` can be the substance of an answer\n * (`$100` vs `100`), so a \"punctuation\" toggle must not erase them.\n */\nconst PUNCTUATION_RE = /\\p{P}/gu;\n\nfunction applyBaseline(value: string, policy: TextMatchPolicy): string {\n  let result = value;\n  if (policy.trim !== false) {\n    result = result.trim();\n  }\n  if (policy.caseSensitive !== true) {\n    result = policy.locale ? result.toLocaleLowerCase(policy.locale) : result.toLowerCase();\n  }\n  return result;\n}\n\nfunction applyNormalization(value: string, policy: TextMatchPolicy): string {\n  let result = value;\n  if (policy.normalize === 'NFC' || policy.normalize === 'NFKC') {\n    result = result.normalize(policy.normalize);\n  }\n  if (policy.ignorePunctuation === true) {\n    result = result.replace(PUNCTUATION_RE, '');\n  }\n  if (policy.collapseInnerWhitespace === true) {\n    // \"Inner\" means between non-space runs. Only trim the ends when the\n    // policy's trim is on (its default) — an explicit `trim: false` must not\n    // be silently overridden by the collapse.\n    result = result.replace(/(?<=\\S)\\s+(?=\\S)/g, ' ');\n    if (policy.trim !== false) {\n      result = result.trim();\n    }\n  }\n  return result;\n}\n\nfunction applyDiacriticFold(value: string): string {\n  return value.normalize('NFD').replace(COMBINING_MARKS_RE, '').normalize('NFC');\n}\n\n/**\n * Levenshtein distance with an early-exit bound: returns `max + 1` as soon as\n * the distance provably exceeds `max`.\n */\nexport function levenshteinDistance(a: string, b: string, max: number): number {\n  if (a === b) return 0;\n  if (Math.abs(a.length - b.length) > max) return max + 1;\n  if (a.length === 0) return b.length;\n  if (b.length === 0) return a.length;\n\n  let previous = Array.from({ length: b.length + 1 }, (_, i) => i);\n  for (let i = 1; i <= a.length; i += 1) {\n    const current = [i];\n    let rowMin = i;\n    for (let j = 1; j <= b.length; j += 1) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      const value = Math.min(\n        (previous[j] as number) + 1,\n        (current[j - 1] as number) + 1,\n        (previous[j - 1] as number) + cost,\n      );\n      current.push(value);\n      if (value < rowMin) rowMin = value;\n    }\n    if (rowMin > max) return max + 1;\n    previous = current;\n  }\n  return previous[b.length] as number;\n}\n\n/**\n * Matches a learner's input against one or more accepted answers under a\n * {@link TextMatchPolicy}. Tolerances are evaluated in stages — baseline\n * (trim/case), then normalization, then diacritic folding, then Levenshtein —\n * and {@link TextMatchResult.via} reports the first stage that produced the\n * match, so graders can award credit by match quality.\n *\n * With no policy (or an empty one) this is byte-for-byte the v1 matching\n * semantics: `trim` + locale-insensitive `toLowerCase` + strict equality.\n */\nexport function matchText(\n  input: string,\n  accepted: string | readonly string[],\n  policy: TextMatchPolicy = {},\n): TextMatchResult {\n  const acceptedList = typeof accepted === 'string' ? [accepted] : accepted;\n  const baselineInput = applyBaseline(input, policy);\n  const baselineAccepted = acceptedList.map((answer) => applyBaseline(answer, policy));\n\n  if (baselineAccepted.some((answer) => answer === baselineInput)) {\n    return { matched: true, via: 'exact' };\n  }\n\n  const usesNormalization =\n    policy.normalize === 'NFC' ||\n    policy.normalize === 'NFKC' ||\n    policy.ignorePunctuation === true ||\n    policy.collapseInnerWhitespace === true;\n  const normalizedInput = usesNormalization\n    ? applyNormalization(baselineInput, policy)\n    : baselineInput;\n  const normalizedAccepted = usesNormalization\n    ? baselineAccepted.map((answer) => applyNormalization(answer, policy))\n    : baselineAccepted;\n\n  if (usesNormalization && normalizedAccepted.some((answer) => answer === normalizedInput)) {\n    return { matched: true, via: 'normalized' };\n  }\n\n  const foldedInput =\n    policy.foldDiacritics === true ? applyDiacriticFold(normalizedInput) : normalizedInput;\n  const foldedAccepted =\n    policy.foldDiacritics === true\n      ? normalizedAccepted.map((answer) => applyDiacriticFold(answer))\n      : normalizedAccepted;\n\n  if (policy.foldDiacritics === true && foldedAccepted.some((answer) => answer === foldedInput)) {\n    return { matched: true, via: 'folded' };\n  }\n\n  const maxDistance = policy.levenshtein ?? 0;\n  if (\n    maxDistance > 0 &&\n    foldedAccepted.some(\n      (answer) => levenshteinDistance(foldedInput, answer, maxDistance) <= maxDistance,\n    )\n  ) {\n    return { matched: true, via: 'fuzzy' };\n  }\n\n  return { matched: false, via: 'none' };\n}\n","import type { z } from 'zod/v4';\nimport type { DeferredScoringPartial, ScoringResult } from '../types/activity.js';\n\n/** ScoringResult without `passed` — the public `score()` / `evaluate()` fill that in. */\nexport type PartialScoringResult = Omit<ScoringResult, 'passed'>;\n\n/**\n * Sensitivity classification of a single activity-data field, driving\n * `redact()`:\n * - `public` — safe to send to a learner before they answer.\n * - `answer-key` — reveals (or helps infer) the correct answer or the scoring\n *   rules; removed unless `reveal: 'after-submit'` is requested.\n * - `author-only` — never leaves the authoring/grading context (e.g. rubrics).\n */\nexport type Sensitivity = 'public' | 'answer-key' | 'author-only';\n\n/**\n * Per-field sensitivity map for an activity type. A `Sensitivity` value\n * classifies the whole field (objects and arrays included); a nested\n * `FieldPolicy` recurses into an object field — and, for an array field,\n * applies to every element. Fail-closed: any field a policy does not mention\n * is treated as `author-only` and removed by `redact()` — adding a field\n * without classifying it hides it, never leaks it.\n */\nexport interface FieldPolicy {\n  readonly [field: string]: Sensitivity | FieldPolicy;\n}\n\n/** xAPI interaction types defined by xAPI 1.0.3 (cmi.interaction vocabulary). */\nexport type XAPIInteractionType =\n  | 'choice'\n  | 'fill-in'\n  | 'long-fill-in'\n  | 'matching'\n  | 'sequencing'\n  | 'performance'\n  | 'true-false'\n  | 'other';\n\n/** Interop facts a generic statement builder cannot infer from data alone. */\nexport interface ActivityTypeInterop<TData> {\n  /** IRI for the xAPI Activity `definition.type`. */\n  readonly xapiActivityTypeIri?: string;\n  /** xAPI `definition.interactionType` for this activity type. */\n  readonly xapiInteractionType?: XAPIInteractionType;\n  /** Builds the xAPI `correctResponsesPattern` strings for an item. */\n  readonly correctResponsesPattern?: (data: TData) => string[];\n}\n\n/**\n * How responses to an activity type are graded:\n * - `sync` — a pure function produces the grade at submit time.\n * - `deferred` — grading happens asynchronously (AI or human) after\n *   submission; `partial` reports the facts computable synchronously\n *   (e.g. word counts), surfaced in `ItemOutcome.partial`.\n */\nexport type ActivityTypeScoring<TData, TResponse> =\n  | {\n      readonly kind: 'sync';\n      readonly score: (data: TData, response: TResponse) => PartialScoringResult;\n    }\n  | {\n      readonly kind: 'deferred';\n      readonly reason: 'requires_async_grading';\n      readonly partial?: (data: TData, response: TResponse | undefined) => DeferredScoringPartial;\n    };\n\n/**\n * A value-level description of an activity type: its contract (schema), its\n * grading, its redaction policy, and its interop facts. Registering a\n * descriptor makes `validateActivity`, `score`, `evaluate`, `redact`, and\n * `jsonSchemaFor` work for the type — an activity type is a value, not a\n * hardcoded union member (R1).\n */\nexport interface ActivityTypeDescriptor<TData extends { type: string }, TResponse> {\n  /** The `type` discriminator string (kebab-case by convention). */\n  readonly type: TData['type'];\n  /** Zod schema validating the activity's data contract. */\n  readonly schema: z.ZodType<TData>;\n  /** How responses are graded. */\n  readonly scoring: ActivityTypeScoring<TData, TResponse>;\n  /** Whether a response counts as an answer (vs. blank/untouched). */\n  readonly isAnswered?: (response: TResponse | undefined) => boolean;\n  /** Per-field sensitivity map driving `redact()`. Fail-closed. */\n  readonly fieldPolicy?: FieldPolicy;\n  /**\n   * Schema the output of `redact(data)` (with default `reveal: 'none'`) must\n   * satisfy. Strict by design: it proves the ABSENCE of answer-key fields,\n   * so `assertRedacted` can guarantee a payload is safe to send to a learner.\n   */\n  readonly redactedSchema?: z.ZodType<unknown>;\n  /** Interop facts for xAPI (and later QTI) statement building. */\n  readonly interop?: ActivityTypeInterop<TData>;\n  /** The interaction-event kinds components for this type emit. */\n  readonly interactions?: readonly string[];\n}\n\n/**\n * Internal type-erased descriptor shape stored in the registry. Dispatch call\n * sites cast payloads back; the public generic API preserves inference.\n */\nexport interface RegisteredActivityTypeDescriptor {\n  readonly type: string;\n  readonly schema: z.ZodType<unknown>;\n  readonly scoring:\n    | {\n        readonly kind: 'sync';\n        readonly score: (data: unknown, response: unknown) => PartialScoringResult;\n      }\n    | {\n        readonly kind: 'deferred';\n        readonly reason: 'requires_async_grading';\n        readonly partial?: (data: unknown, response: unknown) => DeferredScoringPartial;\n      };\n  readonly isAnswered?: (response: unknown) => boolean;\n  readonly fieldPolicy?: FieldPolicy;\n  readonly redactedSchema?: z.ZodType<unknown>;\n  readonly interop?: ActivityTypeInterop<unknown>;\n  readonly interactions?: readonly string[];\n}\n\n/**\n * Module-scoped default registry (deliberate — no registry instances until a\n * second consumer exists; see roadmap §3.2 / audit §15.3).\n */\nconst registry = new Map<string, RegisteredActivityTypeDescriptor>();\n\n/**\n * Identity helper that gives full type inference when authoring a descriptor:\n *\n * ```ts\n * const myType = defineActivityType<MyTypeData, MyTypeLearnerResponse>({ ... });\n * registerActivityType(myType);\n * ```\n */\nexport function defineActivityType<TData extends { type: string }, TResponse>(\n  descriptor: ActivityTypeDescriptor<TData, TResponse>,\n): ActivityTypeDescriptor<TData, TResponse> {\n  return descriptor;\n}\n\n/**\n * Registers an activity type on the default registry, making it live for\n * `validateActivity`, `score`, `evaluate`, `redact`, and `jsonSchemaFor`.\n * Re-registering the same descriptor object is a no-op; registering a\n * DIFFERENT descriptor under an existing type throws — silently replacing a\n * type's contract or scoring is exactly the class of accident a summative\n * SDK must not allow.\n */\nexport function registerActivityType<TData extends { type: string }, TResponse>(\n  descriptor: ActivityTypeDescriptor<TData, TResponse>,\n): void {\n  if (descriptor.type === 'item-group') {\n    // The container that holds several items around one stimulus. It has no\n    // learner response and no score of its own, so it can never satisfy this\n    // contract — and letting a consumer register one would make `isItemGroup`\n    // and `flattenSequence` misread their own container.\n    throw new Error(\n      '\"item-group\" is reserved for the SDK\\'s item-group container (see ItemGroup) and cannot be registered as an activity type.',\n    );\n  }\n  const existing = registry.get(descriptor.type);\n  if (existing !== undefined) {\n    if ((existing as unknown) === (descriptor as unknown)) {\n      return;\n    }\n    throw new Error(\n      `Activity type \"${descriptor.type}\" is already registered. ` +\n        'Registering a different descriptor for an existing type is not allowed.',\n    );\n  }\n  registry.set(descriptor.type, descriptor as unknown as RegisteredActivityTypeDescriptor);\n}\n\n/** Returns the registered descriptor for `type`, or `undefined`. */\nexport function getActivityTypeDescriptor(\n  type: string,\n): RegisteredActivityTypeDescriptor | undefined {\n  return registry.get(type);\n}\n\n/** The type strings currently registered (built-ins plus consumer-registered). */\nexport function registeredActivityTypes(): string[] {\n  return [...registry.keys()];\n}\n","/**\n * All-or-nothing scoring: full credit only when every item is correct.\n *\n * @param correctItems - per-item correctness flags for the relevant items\n * @returns `1` if every item is correct (or the list is empty), otherwise `0`\n */\nexport function allOrNothingStrategy(correctItems: boolean[]): number {\n  return correctItems.every((isCorrect) => isCorrect) ? 1 : 0;\n}\n","/**\n * Partial-credit scoring for Multiple Choice — balanced/symmetric scheme.\n *\n * Reward and penalty are each normalised by their own pool: the fraction of\n * correct options found, minus the fraction of distractors wrongly chosen.\n * This is fairer than normalising the penalty by the correct-option count —\n * under that older form a single wrong pick could zero an otherwise-correct\n * response when there was only one correct answer.\n *\n * Result is always in [0, 1]: `reward ∈ [0,1]` and `penalty ∈ [0,1]`, so\n * `reward - penalty ∈ [-1,1]` and `max(0, …)` floors it at 0. Selecting every\n * option yields `1 - 1 = 0`; selecting exactly the correct set yields `1`.\n *\n * @param correctSelected - number of selected options that are correct\n * @param incorrectSelected - number of selected options that are incorrect\n * @param totalCorrect - total correct options; the `MultipleChoiceDataSchema`\n *   \"≥1 correct\" guard guarantees this is ≥ 1, so the reward term cannot\n *   divide by zero for schema-validated data\n * @param totalIncorrect - total incorrect options (distractors); when `0`\n *   (every option is correct) the penalty term is defined as `0`\n */\nexport function partialStrategy(\n  correctSelected: number,\n  incorrectSelected: number,\n  totalCorrect: number,\n  totalIncorrect: number,\n): number {\n  const reward = correctSelected / totalCorrect;\n  const penalty = totalIncorrect === 0 ? 0 : incorrectSelected / totalIncorrect;\n  return Math.max(0, reward - penalty);\n}\n\n/**\n * Partial-credit scoring for Fill-in-the-Blanks: fraction of blanks answered\n * correctly. Each blank is independently right or wrong, so a plain proportion\n * is already fair — no penalty term applies.\n *\n * @param correctBlanks - number of blanks answered correctly\n * @param totalBlanks - total number of blanks; the `FillInTheBlanksDataSchema`\n *   `blanks.min(1)` constraint guarantees this is ≥ 1, so division by zero\n *   cannot occur for schema-validated data\n */\nexport function partialBlankStrategy(correctBlanks: number, totalBlanks: number): number {\n  return correctBlanks / totalBlanks;\n}\n","import type {\n  BlankConfig,\n  FillInTheBlanksData,\n  FillInTheBlanksLearnerResponse,\n  ScoringDetail,\n} from '../../types/activity.js';\nimport { allOrNothingStrategy } from '../strategies/all-or-nothing.js';\nimport { partialBlankStrategy } from '../strategies/partial.js';\nimport { matchText, type TextMatchPolicy } from '../text-match.js';\nimport type { PartialScoringResult } from './multiple-choice.js';\n\n/**\n * Resolves the effective match policy for a blank. The legacy\n * `caseSensitive` / `trimWhitespace` flags map onto the baseline policy\n * fields; an explicit `blank.match` policy takes precedence field-by-field.\n * With neither present, the result is the v1 semantics exactly.\n */\nfunction policyFor(blank: BlankConfig): TextMatchPolicy {\n  return {\n    ...(blank.caseSensitive !== undefined ? { caseSensitive: blank.caseSensitive } : {}),\n    ...(blank.trimWhitespace !== undefined ? { trim: blank.trimWhitespace } : {}),\n    ...blank.match,\n  };\n}\n\n/**\n * Scores a Fill-in-the-Blanks response. Each blank is evaluated independently\n * via {@link matchText} under the blank's resolved policy; a missing answer\n * key is treated as empty input and scored incorrect.\n */\nexport function scoreFillInTheBlanks(\n  data: FillInTheBlanksData,\n  response: FillInTheBlanksLearnerResponse,\n): PartialScoringResult {\n  const details: ScoringDetail[] = [];\n  const perBlankCorrect: boolean[] = [];\n\n  for (const blank of data.blanks) {\n    const rawInput = response.answers[blank.id];\n    const input = typeof rawInput === 'string' ? rawInput : '';\n    const matched = matchText(input, blank.acceptedAnswers, policyFor(blank)).matched;\n\n    perBlankCorrect.push(matched);\n    details.push({\n      itemId: blank.id,\n      correct: matched,\n      outcome: matched ? 'correct' : 'incorrect',\n      learnerResponse: [input],\n      correctResponse: [...blank.acceptedAnswers],\n      weight: 1,\n    });\n  }\n\n  const correctBlanks = perBlankCorrect.filter(Boolean).length;\n  const scoreValue =\n    data.scoringStrategy === 'all-or-nothing'\n      ? allOrNothingStrategy(perBlankCorrect)\n      : partialBlankStrategy(correctBlanks, data.blanks.length);\n\n  return { score: scoreValue, maxScore: 1, feedback: null, details };\n}\n","import type { PartialScoringResult } from '../../registry/registry.js';\nimport type {\n  MultipleChoiceData,\n  MultipleChoiceLearnerResponse,\n  ScoringDetail,\n} from '../../types/activity.js';\nimport { partialStrategy } from '../strategies/partial.js';\n\nexport type { PartialScoringResult } from '../../registry/registry.js';\n\n/**\n * Scores a Multiple Choice response. Pure; trusts its typed inputs (validation\n * is the component boundary's job). Options are looked up by id; an unknown\n * selected id is treated as an incorrect selection.\n */\nexport function scoreMultipleChoice(\n  data: MultipleChoiceData,\n  response: MultipleChoiceLearnerResponse,\n): PartialScoringResult {\n  const optionById = new Map(data.options.map((option) => [option.id, option]));\n  const selected = new Set(response.selectedOptionIds);\n\n  const totalCorrect = data.options.filter((option) => option.isCorrect).length;\n  const totalIncorrect = data.options.length - totalCorrect;\n\n  let scoreValue: number;\n\n  if (data.scoringStrategy === 'all-or-nothing') {\n    if (data.mode === 'single') {\n      scoreValue =\n        response.selectedOptionIds.length === 1 &&\n        optionById.get(response.selectedOptionIds[0])?.isCorrect === true\n          ? 1\n          : 0;\n    } else {\n      const correctIds = data.options.filter((o) => o.isCorrect).map((o) => o.id);\n      const allCorrectSelected = correctIds.every((id) => selected.has(id));\n      scoreValue = selected.size === correctIds.length && allCorrectSelected ? 1 : 0;\n    }\n  } else {\n    let correctSelected = 0;\n    let incorrectSelected = 0;\n    for (const id of selected) {\n      const option = optionById.get(id);\n      if (option?.isCorrect) {\n        correctSelected += 1;\n      } else {\n        incorrectSelected += 1;\n      }\n    }\n    scoreValue = partialStrategy(correctSelected, incorrectSelected, totalCorrect, totalIncorrect);\n  }\n\n  const details: ScoringDetail[] = data.options.map((option) => {\n    const wasSelected = selected.has(option.id);\n    const outcome = wasSelected\n      ? option.isCorrect\n        ? 'correct'\n        : 'incorrect'\n      : option.isCorrect\n        ? 'incorrect-omission'\n        : 'correct-omission';\n    return {\n      itemId: option.id,\n      correct: wasSelected === option.isCorrect,\n      outcome,\n      learnerResponse: [wasSelected ? 'selected' : 'not-selected'],\n      correctResponse: [option.isCorrect ? 'selected' : 'not-selected'],\n      weight: 1,\n    };\n  });\n\n  return { score: scoreValue, maxScore: 1, feedback: null, details };\n}\n","import type { z } from 'zod/v4';\nimport { countWords } from '../count-words.js';\nimport { FillInTheBlanksDataSchema } from '../schemas/fill-in-the-blanks.js';\nimport { MultipleChoiceDataSchema } from '../schemas/multiple-choice.js';\nimport {\n  RedactedFillInTheBlanksDataSchema,\n  RedactedMultipleChoiceDataSchema,\n  RedactedWrittenResponseDataSchema,\n} from '../schemas/redacted.js';\nimport { WrittenResponseDataSchema } from '../schemas/written-response.js';\nimport { scoreFillInTheBlanks } from '../scoring/activity-scorers/fill-in-the-blanks.js';\nimport { scoreMultipleChoice } from '../scoring/activity-scorers/multiple-choice.js';\nimport type {\n  FillInTheBlanksData,\n  FillInTheBlanksLearnerResponse,\n  MultipleChoiceData,\n  MultipleChoiceLearnerResponse,\n  WrittenResponseData,\n  WrittenResponseLearnerResponse,\n} from '../types/activity.js';\nimport { defineActivityType, type FieldPolicy, registerActivityType } from './registry.js';\n\n/**\n * Field-sensitivity policies for the built-in types (R7). Fail-closed:\n * anything not listed here is dropped by `redact()`. `scoringStrategy` is\n * answer-key everywhere — MC `partial` penalises wrong selections while\n * `all-or-nothing` does not, so the strategy reveals whether guessing is\n * free. Authored feedback is answer-key (it may quote or hint the answer);\n * rubrics are author-only (grader assets).\n */\nconst SHARED_PUBLIC_FIELDS: FieldPolicy = {\n  schemaVersion: 'public',\n  type: 'public',\n  id: 'public',\n  title: 'public',\n  media: 'public',\n  passThreshold: 'public',\n  locale: 'public',\n  learningObjectives: 'public',\n  difficultyLevel: 'public',\n};\n\nconst MULTIPLE_CHOICE_FIELD_POLICY: FieldPolicy = {\n  ...SHARED_PUBLIC_FIELDS,\n  question: 'public',\n  questionHtml: 'public',\n  mode: 'public',\n  shuffle: 'public',\n  scoringStrategy: 'answer-key',\n  feedback: 'answer-key',\n  options: {\n    id: 'public',\n    text: 'public',\n    isCorrect: 'answer-key',\n    feedback: 'answer-key',\n  },\n};\n\nconst FILL_IN_THE_BLANKS_FIELD_POLICY: FieldPolicy = {\n  ...SHARED_PUBLIC_FIELDS,\n  passage: 'public',\n  passageHtml: 'public',\n  scoringStrategy: 'answer-key',\n  feedback: 'answer-key',\n  blanks: {\n    id: 'public',\n    hint: 'public',\n    acceptedAnswers: 'answer-key',\n    caseSensitive: 'answer-key',\n    trimWhitespace: 'answer-key',\n    match: 'answer-key',\n    feedback: 'answer-key',\n  },\n};\n\nconst WRITTEN_RESPONSE_FIELD_POLICY: FieldPolicy = {\n  ...SHARED_PUBLIC_FIELDS,\n  prompt: 'public',\n  promptHtml: 'public',\n  minWords: 'public',\n  maxWords: 'public',\n  languageTarget: 'public',\n  feedback: 'answer-key',\n  // A rubric is a LEARNER affordance, not a grader secret: it tells the\n  // learner what they are being graded on, which is pedagogically the point\n  // of publishing one. (Classifying it author-only broke real deployments\n  // that render a rubric panel during the attempt.) A deployment that wants\n  // it hidden can tighten this per call via `redact(data, { policy })`.\n  rubric: 'public',\n};\n\n/** Built-in Multiple Choice descriptor. */\nexport const multipleChoiceType = defineActivityType<\n  MultipleChoiceData,\n  MultipleChoiceLearnerResponse\n>({\n  type: 'multiple-choice',\n  // zod4 optional outputs are `T | undefined`; the hand-written wire types use\n  // exact optionals. Structurally identical at runtime — cast is type-level only.\n  schema: MultipleChoiceDataSchema as unknown as z.ZodType<MultipleChoiceData>,\n  scoring: { kind: 'sync', score: scoreMultipleChoice },\n  isAnswered: (response) => (response?.selectedOptionIds.length ?? 0) > 0,\n  fieldPolicy: MULTIPLE_CHOICE_FIELD_POLICY,\n  redactedSchema: RedactedMultipleChoiceDataSchema,\n  interop: {\n    xapiActivityTypeIri: 'http://adlnet.gov/expapi/activities/cmi.interaction',\n    xapiInteractionType: 'choice',\n    correctResponsesPattern: (data) => [\n      data.options\n        .filter((option) => option.isCorrect)\n        .map((option) => option.id)\n        .join('[,]'),\n    ],\n  },\n  interactions: ['option-selected', 'option-deselected', 'submitted'],\n});\n\n/** Built-in Fill-in-the-Blanks descriptor. */\nexport const fillInTheBlanksType = defineActivityType<\n  FillInTheBlanksData,\n  FillInTheBlanksLearnerResponse\n>({\n  type: 'fill-in-the-blanks',\n  schema: FillInTheBlanksDataSchema as unknown as z.ZodType<FillInTheBlanksData>,\n  scoring: { kind: 'sync', score: scoreFillInTheBlanks },\n  isAnswered: (response) =>\n    Object.values(response?.answers ?? {}).some((answer) => answer.trim().length > 0),\n  fieldPolicy: FILL_IN_THE_BLANKS_FIELD_POLICY,\n  redactedSchema: RedactedFillInTheBlanksDataSchema,\n  interop: {\n    xapiActivityTypeIri: 'http://adlnet.gov/expapi/activities/cmi.interaction',\n    xapiInteractionType: 'fill-in',\n    // xAPI fill-in pattern: blank answers joined with \"[,]\". Only the first\n    // accepted answer per blank is emitted (full alternates would explode\n    // combinatorially); the complete key lives in the activity data.\n    correctResponsesPattern: (data) => [\n      data.blanks.map((blank) => blank.acceptedAnswers[0] ?? '').join('[,]'),\n    ],\n  },\n  interactions: ['blank-filled', 'hint-requested', 'submitted'],\n});\n\n/**\n * Built-in Written Response descriptor. Grading is DEFERRED: submissions are\n * graded asynchronously (AI or human) by the consumer; the synchronous\n * outcome reports only word-count facts. `wordCount` is recomputed from the\n * submitted text with the canonical `countWords()` — the client-supplied\n * count is informational, never trusted.\n */\nexport const writtenResponseType = defineActivityType<\n  WrittenResponseData,\n  WrittenResponseLearnerResponse\n>({\n  type: 'written-response',\n  schema: WrittenResponseDataSchema as unknown as z.ZodType<WrittenResponseData>,\n  scoring: {\n    kind: 'deferred',\n    reason: 'requires_async_grading',\n    partial: (data, response) => {\n      const wordCount = countWords(response?.text ?? '');\n      return {\n        withinWordBounds:\n          response !== undefined && wordCount >= data.minWords && wordCount <= data.maxWords,\n        wordCount,\n      };\n    },\n  },\n  isAnswered: (response) => (response?.text.trim().length ?? 0) > 0,\n  fieldPolicy: WRITTEN_RESPONSE_FIELD_POLICY,\n  redactedSchema: RedactedWrittenResponseDataSchema,\n  interop: {\n    xapiActivityTypeIri: 'http://adlnet.gov/expapi/activities/cmi.interaction',\n    xapiInteractionType: 'long-fill-in',\n    correctResponsesPattern: () => [],\n  },\n  interactions: ['text-changed', 'submitted'],\n});\n\nregisterActivityType(multipleChoiceType);\nregisterActivityType(fillInTheBlanksType);\nregisterActivityType(writtenResponseType);\n"]}

package/dist/{chunk-A6JXV5GP.js → chunk-DUQVGLQ3.js}

@@ -1,11 +1,58 @@
-import {
-  getActivityTypeDescriptor
-} from "./chunk-5GJJHGY5.js";
 import {
   DeferredScoringError,
   RedactedScoringError,
-  UnknownActivityTypeError
-} from "./chunk-3YAVDV5F.js";
+  UnknownActivityTypeError,
+  getActivityTypeDescriptor
+} from "./chunk-NUCEUU4P.js";
+
+// src/scoring/rounding.ts
+var EPSILON = 1e-9;
+var TIE_TOLERANCE = 1e-6;
+function scaled(value, dp) {
+  return value * 10 ** dp;
+}
+function noNegZero(value) {
+  return Object.is(value, -0) ? 0 : value;
+}
+function roundGrade(value, policy) {
+  if (!Number.isFinite(value)) {
+    return value;
+  }
+  const factor = 10 ** policy.dp;
+  const raw = scaled(value, policy.dp);
+  switch (policy.mode) {
+    case "floor":
+      return noNegZero(Math.floor(raw + EPSILON) / factor);
+    case "ceil":
+      return noNegZero(Math.ceil(raw - EPSILON) / factor);
+    case "half-even": {
+      const floored = Math.floor(raw);
+      if (Math.abs(raw - floored - 0.5) > TIE_TOLERANCE) {
+        return noNegZero(halfAway(raw) / factor);
+      }
+      const even = floored % 2 === 0 ? floored : floored + 1;
+      return noNegZero(even / factor);
+    }
+    default:
+      return noNegZero(halfAway(raw) / factor);
+  }
+}
+function halfAway(raw) {
+  const nudged = raw >= 0 ? raw + EPSILON : raw - EPSILON;
+  return raw >= 0 ? Math.round(nudged) : -Math.round(-nudged);
+}
+function gte(value, threshold, policy) {
+  return roundGrade(value, policy) >= roundGrade(threshold, policy) - EPSILON;
+}
+function classifyBand(value, bands) {
+  let best = null;
+  for (const band of bands) {
+    if (value >= band.min - EPSILON && (best === null || band.min > best.min)) {
+      best = band;
+    }
+  }
+  return best;
+}
 
 // src/grading.ts
 function gradeFromRubric(criteria, activityData, options = {}) {
@@ -79,55 +126,6 @@ function hasGrade(outcome) {
   return outcome.status === "scored" || outcome.status === "graded";
 }
 
-// src/scoring/rounding.ts
-var EPSILON = 1e-9;
-var TIE_TOLERANCE = 1e-6;
-function scaled(value, dp) {
-  return value * 10 ** dp;
-}
-function noNegZero(value) {
-  return Object.is(value, -0) ? 0 : value;
-}
-function roundGrade(value, policy) {
-  if (!Number.isFinite(value)) {
-    return value;
-  }
-  const factor = 10 ** policy.dp;
-  const raw = scaled(value, policy.dp);
-  switch (policy.mode) {
-    case "floor":
-      return noNegZero(Math.floor(raw + EPSILON) / factor);
-    case "ceil":
-      return noNegZero(Math.ceil(raw - EPSILON) / factor);
-    case "half-even": {
-      const floored = Math.floor(raw);
-      if (Math.abs(raw - floored - 0.5) > TIE_TOLERANCE) {
-        return noNegZero(halfAway(raw) / factor);
-      }
-      const even = floored % 2 === 0 ? floored : floored + 1;
-      return noNegZero(even / factor);
-    }
-    default:
-      return noNegZero(halfAway(raw) / factor);
-  }
-}
-function halfAway(raw) {
-  const nudged = raw >= 0 ? raw + EPSILON : raw - EPSILON;
-  return raw >= 0 ? Math.round(nudged) : -Math.round(-nudged);
-}
-function gte(value, threshold, policy) {
-  return roundGrade(value, policy) >= roundGrade(threshold, policy) - EPSILON;
-}
-function classifyBand(value, bands) {
-  let best = null;
-  for (const band of bands) {
-    if (value >= band.min - EPSILON && (best === null || band.min > best.min)) {
-      best = band;
-    }
-  }
-  return best;
-}
-
 // src/scoring/compose.ts
 function earned(item) {
   const { outcome } = item;
@@ -242,8 +240,9 @@ function composeAssessmentScore(sections, policy) {
 
 // src/scoring/index.ts
 var DEFAULT_PASS_THRESHOLD = 0.7;
-function computePassThreshold(activityData, score2) {
-  return score2 >= (activityData.passThreshold ?? DEFAULT_PASS_THRESHOLD);
+function computePassThreshold(activityData, score2, rounding) {
+  const threshold = activityData.passThreshold ?? DEFAULT_PASS_THRESHOLD;
+  return rounding === void 0 ? score2 >= threshold : gte(score2, threshold, rounding);
 }
 function isRedacted(data) {
   return typeof data === "object" && data !== null && data.redacted === true;
@@ -331,4 +330,4 @@ export {
   outcomeFromGrade,
   hasGrade
 };
-//# sourceMappingURL=chunk-A6JXV5GP.js.map
+//# sourceMappingURL=chunk-DUQVGLQ3.js.map

package/dist/chunk-DUQVGLQ3.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/scoring/rounding.ts","../src/grading.ts","../src/scoring/compose.ts","../src/scoring/index.ts"],"sourcesContent":["/**\n * Rounding for assessment scores.\n *\n * Rounding is **two different operations** that must not share one policy, and\n * conflating them silently inverts one of them:\n *\n * - **Grade rounding** decides the number a learner is shown and recorded\n *   against. It rounds to a fixed number of decimal places, conventionally\n *   half-up, so a learner shown \"70%\" is not recorded as a fail at 69.6.\n * - **Band / level classification** decides which level someone is placed in.\n *   It deliberately **floors**: placing a learner above their real level is\n *   the more harmful error, so a band boundary must not be reached by\n *   rounding up.\n *\n * There is therefore no default `RoundingPolicy` anywhere in this SDK, and\n * `dp` has no default either — an integrator's deliberate choice must never be\n * supplied by us.\n */\n\n/** How a value is rounded to `dp` decimal places. */\nexport type RoundingMode = 'half-up' | 'half-even' | 'floor' | 'ceil';\n\n/** A rounding policy. Both fields are required — the SDK never guesses either. */\nexport interface RoundingPolicy {\n  mode: RoundingMode;\n  /** Decimal places. Load-bearing: `dp: 2` is what stops 69.6 becoming a fail at 70. */\n  dp: number;\n}\n\n/**\n * Float-noise guard. Binary floating point makes `1.005 * 100` come out as\n * `100.49999999999999` and `0.29 * 100` come out as `28.999999999999996`;\n * without an allowance both would move a learner's grade a step. It is applied\n * in the direction each mode needs — see {@link roundGrade}.\n */\nconst EPSILON = 1e-9;\n\n/**\n * Tolerance for deciding \"is this exactly halfway?\" in half-even mode.\n * Deliberately much larger than {@link EPSILON}: if the tie test shared the\n * nudge's tolerance, the nudge would decide its own outcome. Safe for grades,\n * which live on a [0,1] scale where representation error is far below this.\n */\nconst TIE_TOLERANCE = 1e-6;\n\nfunction scaled(value: number, dp: number): number {\n  return value * 10 ** dp;\n}\n\n/**\n * Normalises `-0` to `0` without touching anything else. `-0` JSON-serialises\n * as `0` but fails `Object.is(-0, 0)`, which surprises a strict-equality\n * gradebook comparison. Deliberately NOT `|| 0`: that also swallowed `NaN`\n * (reachable with an absurd `dp`, where `10 ** dp` overflows to Infinity) and\n * turned a visible failure into a plausible-looking grade of zero.\n */\nfunction noNegZero(value: number): number {\n  return Object.is(value, -0) ? 0 : value;\n}\n\n/**\n * Rounds `value` to `policy.dp` places under `policy.mode`.\n *\n * Idempotent for every mode: rounding an already-rounded value returns it\n * unchanged. That matters because a composed score is rounded once and then\n * compared through {@link gte}, which rounds again.\n */\nexport function roundGrade(value: number, policy: RoundingPolicy): number {\n  if (!Number.isFinite(value)) {\n    return value;\n  }\n  const factor = 10 ** policy.dp;\n  const raw = scaled(value, policy.dp);\n\n  // The nudge must oppose the mode, never point uniformly away from zero.\n  // `Math.ceil` on a value that is ALREADY exact at `dp` jumps a whole\n  // quantum if you add epsilon first: 0.7 became 0.71, a true 0 became 0.01,\n  // and the operation stopped being idempotent (0.7 -> 0.71 -> 0.72). So\n  // `ceil` nudges down and `floor` nudges up — just far enough to absorb\n  // representation error (0.29 * 100 is 28.999999999999996, which must still\n  // floor to 29) without ever moving a value that was already exact.\n  // Half modes keep the sign-aware nudge, which is what makes a .5 tie land\n  // away from zero.\n  switch (policy.mode) {\n    case 'floor':\n      return noNegZero(Math.floor(raw + EPSILON) / factor);\n    case 'ceil':\n      return noNegZero(Math.ceil(raw - EPSILON) / factor);\n    case 'half-even': {\n      // Detect the tie on the RAW value, and with a tolerance decoupled from\n      // (and far larger than) the nudge epsilon. Testing the NUDGED value\n      // against EPSILON let the nudge itself decide whether a tie was seen:\n      // 0.375 was detected but 0.125 was not, so half-even silently degraded\n      // to half-up for some exact ties — and only ever in the direction that\n      // rounds a learner UP, the opposite of what this mode is chosen for.\n      const floored = Math.floor(raw);\n      if (Math.abs(raw - floored - 0.5) > TIE_TOLERANCE) {\n        return noNegZero(halfAway(raw) / factor);\n      }\n      // Exactly halfway: pick the even neighbour (banker's rounding).\n      const even = floored % 2 === 0 ? floored : floored + 1;\n      return noNegZero(even / factor);\n    }\n    default:\n      return noNegZero(halfAway(raw) / factor);\n  }\n}\n\n/**\n * Half-up on a scaled value, with the sign-aware float-noise nudge.\n * `Math.round` breaks .5 ties toward +Infinity, so negatives are mirrored to\n * keep the tie breaking away from zero in both directions.\n */\nfunction halfAway(raw: number): number {\n  const nudged = raw >= 0 ? raw + EPSILON : raw - EPSILON;\n  return raw >= 0 ? Math.round(nudged) : -Math.round(-nudged);\n}\n\n/**\n * Threshold comparison that rounds **both sides** before comparing.\n *\n * Comparing a raw float against a rounded threshold is how a learner ends up\n * shown one number and recorded against another. Rounding both sides — and\n * allowing an epsilon — makes \"what the learner sees\" and \"what the gradebook\n * decides\" the same comparison.\n */\nexport function gte(value: number, threshold: number, policy: RoundingPolicy): boolean {\n  return roundGrade(value, policy) >= roundGrade(threshold, policy) - EPSILON;\n}\n\n/** A named band with an inclusive lower bound, e.g. `{ name: 'B1', min: 0.6 }`. */\nexport interface Band {\n  name: string;\n  /** Inclusive lower bound on the same scale as the value being classified. */\n  min: number;\n}\n\n/**\n * Classifies a value into a band by **flooring**: the highest band whose `min`\n * the value actually reaches. Deliberately does NOT round up to a boundary —\n * over-placement is the more harmful error, so a learner just below a boundary\n * stays below it.\n *\n * Returns `null` when the value reaches no band's minimum.\n */\nexport function classifyBand(value: number, bands: readonly Band[]): Band | null {\n  let best: Band | null = null;\n  for (const band of bands) {\n    if (value >= band.min - EPSILON && (best === null || band.min > best.min)) {\n      best = band;\n    }\n  }\n  return best;\n}\n","import { computePassThreshold } from './scoring/index.js';\nimport type { ActivityData, ItemOutcome } from './types/activity.js';\nimport type { CriterionScore, GradeRecord } from './types/grading.js';\n\nexport type {\n  CriterionScore,\n  GradeRecord,\n  Grader,\n  GraderKind,\n  GraderUsage,\n  GradingState,\n  InlineCorrection,\n} from './types/grading.js';\n\n/** Options for {@link gradeFromRubric}. */\nexport interface GradeFromRubricOptions {\n  /**\n   * Scaled score [0,1] required to pass. Defaults to the activity's\n   * `passThreshold`, or {@link DEFAULT_PASS_THRESHOLD} when absent.\n   */\n  passThreshold?: number;\n  /** Narrative feedback for the learner, carried onto the record verbatim. */\n  feedback?: string | null;\n}\n\n/**\n * Computes the weighted total from per-criterion scores — the arithmetic that\n * must NOT be delegated to a language model.\n *\n * A grader is asked for judgement (how good is this criterion?), not for\n * mental arithmetic. Asking a model to also produce the weighted total makes\n * the final grade unverifiable and unreproducible: two runs can return\n * different totals for identical criterion scores. This function makes the\n * total a pure function of the judgements, so a grade can be recomputed and\n * audited years later.\n *\n * Weights are normalised by their sum, so they need not add to 1. Criteria\n * marked `notApplicable`, and those carrying no numeric `score` (a purely\n * banded judgement), are excluded from both numerator and denominator. When\n * nothing scoreable remains the result is `unscorable`, never a zero.\n */\nexport function gradeFromRubric(\n  criteria: readonly CriterionScore[],\n  activityData?: ActivityData,\n  options: GradeFromRubricOptions = {},\n): GradeRecord | { unscorable: true; reason: string } {\n  // A corrupt score is an ERROR, not an exclusion. Exclusions (`notApplicable`,\n  // and band-only criteria with no numeric score) are deliberate authoring\n  // decisions; a NaN or Infinity is a broken grader. Silently dropping it\n  // would regrade the learner on fewer criteria — with different effective\n  // weights — and nobody would know.\n  const corrupt = criteria.find(\n    (criterion) =>\n      criterion.notApplicable !== true &&\n      criterion.score !== undefined &&\n      !Number.isFinite(criterion.score),\n  );\n  if (corrupt !== undefined) {\n    return {\n      unscorable: true,\n      reason: `Criterion \"${corrupt.name}\" has a non-finite score (${String(corrupt.score)}). A grade cannot be computed from it.`,\n    };\n  }\n\n  const scoreable = criteria.filter(\n    (criterion) => criterion.notApplicable !== true && typeof criterion.score === 'number',\n  );\n\n  // `score` is documented as scaled [0,1]. A grader that returns raw points\n  // (4 out of 5) would otherwise yield `{ score: 4, maxScore: 1 }` and pass\n  // every threshold. Reject rather than clamp: silently rescaling someone's\n  // grader is worse than telling them it is out of contract. A hair outside\n  // the range is float noise and is clamped.\n  const EPSILON = 1e-9;\n  const outOfRange = scoreable.find(\n    (criterion) =>\n      (criterion.score as number) < -EPSILON || (criterion.score as number) > 1 + EPSILON,\n  );\n  if (outOfRange !== undefined) {\n    return {\n      unscorable: true,\n      reason: `Criterion \"${outOfRange.name}\" has score ${outOfRange.score}, outside the scaled [0,1] range. Normalise grader output before building a GradeRecord.`,\n    };\n  }\n\n  if (scoreable.length === 0) {\n    return {\n      unscorable: true,\n      reason: 'No criterion carried a numeric score, so no weighted total can be computed.',\n    };\n  }\n\n  const totalWeight = scoreable.reduce((sum, criterion) => sum + (criterion.weight ?? 1), 0);\n  if (!(totalWeight > 0)) {\n    return {\n      unscorable: true,\n      reason:\n        'Criterion weights do not sum to a positive number, so the weighted total is undefined.',\n    };\n  }\n\n  const weighted = scoreable.reduce(\n    (sum, criterion) => sum + (criterion.score as number) * (criterion.weight ?? 1),\n    0,\n  );\n  const rawScore = weighted / totalWeight;\n  if (!Number.isFinite(rawScore)) {\n    return {\n      unscorable: true,\n      reason: 'The weighted total is not a finite number, so no grade can be produced.',\n    };\n  }\n  // Clamp the float-noise band only; anything genuinely out of range was\n  // already rejected above.\n  const score = Math.min(1, Math.max(0, rawScore));\n\n  const passed =\n    options.passThreshold !== undefined\n      ? score >= options.passThreshold\n      : activityData !== undefined\n        ? computePassThreshold(activityData, score)\n        : score >= 0.7;\n\n  return {\n    score,\n    maxScore: 1,\n    passed,\n    feedback: options.feedback ?? null,\n    criteria: [...criteria],\n  };\n}\n\n/**\n * Lifts a {@link GradeRecord} into the `graded` arm of {@link ItemOutcome}, so\n * a grade that arrived asynchronously renders through the same path as a\n * synchronously scored item. The score/passed/feedback fields are mirrored\n * onto the outcome for uniform reads; `grade` carries the full record.\n */\nexport function outcomeFromGrade(grade: GradeRecord): ItemOutcome {\n  return {\n    status: 'graded',\n    grade,\n    score: grade.score,\n    maxScore: grade.maxScore,\n    passed: grade.passed,\n    feedback: grade.feedback,\n  };\n}\n\n/**\n * True when an outcome carries a real grade — either the SDK scored it\n * synchronously or a grader returned one. Use this instead of testing\n * `status === 'scored'`, which silently misses asynchronously graded work.\n */\nexport function hasGrade(\n  outcome: ItemOutcome,\n): outcome is Extract<ItemOutcome, { status: 'scored' | 'graded' }> {\n  return outcome.status === 'scored' || outcome.status === 'graded';\n}\n","import { hasGrade } from '../grading.js';\nimport type { ItemOutcome } from '../types/activity.js';\nimport { gte, type RoundingPolicy, roundGrade } from './rounding.js';\n\n/**\n * Sectioned assessment scoring — weights, per-section thresholds, and an\n * explicit reason when an attempt fails.\n *\n * This exists because the formula is invariably implemented twice: once on the\n * server that records the grade, and again on the client that shows a learner\n * their grade breakdown. Two implementations of one formula is exactly the\n * duplication an SDK should remove, and they drift — usually in the scale\n * (0–1 vs 0–100) or in whether a section override is honoured.\n */\n\n/** One item's contribution to a section. */\nexport interface ScoredItem {\n  /**\n   * Identity of the SLOT, not the activity. The same activity can legitimately\n   * appear in two sections; keying on the activity id collapses them into one\n   * and silently scores the second occurrence as zero.\n   */\n  slotId: string;\n  /** The activity that filled this slot, for reporting. */\n  activityId?: string;\n  /** Maximum points this slot is worth. */\n  points: number;\n  /** What the learner achieved, or why there is no grade yet. */\n  outcome: ItemOutcome;\n}\n\n/** A weighted section of an assessment. */\nexport interface AssessmentSectionInput {\n  id: string;\n  title?: string;\n  /** Relative weight. Weights are normalised by their sum, so they need not total 1. */\n  weight: number;\n  /** Overrides the assessment-wide section threshold for this section only. */\n  passThresholdOverride?: number;\n  items: ScoredItem[];\n}\n\n/** Policy for {@link composeAssessmentScore}. */\nexport interface CompositionPolicy {\n  /** Scaled [0,1] overall score required to pass. */\n  passThreshold: number;\n  /** Scaled [0,1] score each section must reach, when sections gate the pass. */\n  sectionThreshold?: number;\n  /**\n   * How grades are rounded. Required, with no default: see `RoundingPolicy` —\n   * grade rounding and band classification are different operations and the\n   * SDK must not choose either for you.\n   */\n  rounding: RoundingPolicy;\n}\n\n/** Per-section result. */\nexport interface SectionScore {\n  id: string;\n  title?: string;\n  /** The authored weight, verbatim. */\n  weight: number;\n  /**\n   * The weight ACTUALLY used in the total, so a client can rebuild the grade\n   * from `sections[]` and agree with the record:\n   *\n   * ```ts\n   * roundGrade(\n   *   sections.reduce((sum, s) => sum + s.score * s.normalizedWeight, 0),\n   *   policy.rounding,\n   * ) === result.score            // exact, by construction\n   * ```\n   *\n   * Apply the same final rounding: the raw weighted sum of already-rounded\n   * section scores is not itself a rounded value (0.85 and 1.00 at equal\n   * weights sum to 0.925 against a recorded 0.93), so comparing it unrounded\n   * is off by up to half a quantum.\n   *\n   * Sections with nothing graded carry `0` here, because they contribute\n   * nothing; the remaining weights are renormalised among themselves.\n   */\n  normalizedWeight: number;\n  earnedPoints: number;\n  /** Points that are currently gradable — excludes items still awaiting a grade. */\n  gradedMaxPoints: number;\n  /** Every point in the section, whether graded yet or not. */\n  maxPoints: number;\n  /** Scaled [0,1] over the GRADED points, rounded once. */\n  score: number;\n  passed: boolean;\n  /** Threshold this section was judged against, after any override. */\n  appliedThreshold: number | null;\n  /** Slots still awaiting a grade. */\n  pendingSlotIds: string[];\n  /** Slots that can never be graded, excluded from the denominator. */\n  unscorableSlotIds: string[];\n}\n\n/** Why an attempt failed, or `null` when it passed. */\nexport type PassFailureReason =\n  | 'overall_below_threshold'\n  | 'section_below_threshold'\n  | 'both'\n  | null;\n\n/** Result of composing an assessment. */\nexport interface AssessmentScore {\n  sections: SectionScore[];\n  /** Weighted total, scaled [0,1], rounded once. */\n  score: number;\n  /**\n   * Whether the attempt passed — `null` while `status` is `provisional`,\n   * because an attempt with work still ungraded has not passed OR failed yet.\n   * Returning `false` there would let a UI keyed on `passed` show a fail for\n   * an essay nobody has marked.\n   */\n  passed: boolean | null;\n  /** `null` while provisional, for the same reason as {@link passed}. */\n  passFailureReason: PassFailureReason;\n  /**\n   * `provisional` while any item is still awaiting a grade — the total is\n   * computed over what HAS been graded, so it can still move. Do not record a\n   * provisional score as final. Items that can NEVER be graded\n   * (`unscorableSlotIds`) do not hold the result provisional.\n   */\n  status: 'final' | 'provisional';\n  pendingSlotIds: string[];\n  /** Slots that can never be graded. Excluded from the denominator. */\n  unscorableSlotIds: string[];\n}\n\n/**\n * What one item contributes. THREE states, not two — collapsing the last two\n * into a single \"no points\" answer is what made an unscorable item block an\n * attempt from ever becoming final:\n *\n * - `graded` — real points, counted.\n * - `pending` — a grade is coming (deferred). Excluded from the denominator,\n *   and the assessment stays `provisional` until it arrives.\n * - `unscorable` — a grade is never coming (unregistered type, redacted data,\n *   incomplete key). Also excluded from the denominator, but it must NOT keep\n *   the result provisional forever: `evaluate()` returns this precisely so a\n *   mixed-version content bank does not crash an exam, and an attempt that\n *   contains one still has to be recordable.\n */\ntype ItemContribution =\n  | { state: 'graded'; points: number }\n  | { state: 'pending' }\n  | { state: 'unscorable' };\n\nfunction earned(item: ScoredItem): ItemContribution {\n  const { outcome } = item;\n  if (hasGrade(outcome)) {\n    const max = outcome.maxScore > 0 ? outcome.maxScore : 1;\n    return { state: 'graded', points: (outcome.score / max) * item.points };\n  }\n  if (outcome.status === 'deferred') {\n    return { state: 'pending' };\n  }\n  return { state: 'unscorable' };\n}\n\n/**\n * Composes per-item outcomes into a sectioned assessment score.\n *\n * Weights are normalised by their sum. Each section's score is computed over\n * the points that are actually gradable and rounded ONCE, before any threshold\n * comparison, so the number a learner is shown is the number that decides the\n * outcome. Items still awaiting a grade are excluded from the denominator\n * rather than counted as zero, and the result is reported as `provisional`\n * until every item has a grade.\n */\nexport function composeAssessmentScore(\n  sections: readonly AssessmentSectionInput[],\n  policy: CompositionPolicy,\n): AssessmentScore {\n  const pendingAll: string[] = [];\n  const unscorableAll: string[] = [];\n\n  // Pass 1 — score each section over the points that are actually gradable.\n  const partials = sections.map((section) => {\n    let earnedPoints = 0;\n    let gradedMaxPoints = 0;\n    let maxPoints = 0;\n    const pendingSlotIds: string[] = [];\n    const unscorableSlotIds: string[] = [];\n\n    for (const item of section.items) {\n      maxPoints += item.points;\n      const contribution = earned(item);\n      if (contribution.state === 'pending') {\n        pendingSlotIds.push(item.slotId);\n        pendingAll.push(item.slotId);\n        continue;\n      }\n      if (contribution.state === 'unscorable') {\n        unscorableSlotIds.push(item.slotId);\n        unscorableAll.push(item.slotId);\n        continue;\n      }\n      earnedPoints += contribution.points;\n      gradedMaxPoints += item.points;\n    }\n\n    const raw = gradedMaxPoints > 0 ? earnedPoints / gradedMaxPoints : 0;\n    const appliedThreshold = section.passThresholdOverride ?? policy.sectionThreshold ?? null;\n\n    return {\n      section,\n      earnedPoints,\n      gradedMaxPoints,\n      maxPoints,\n      score: roundGrade(raw, policy.rounding),\n      appliedThreshold,\n      pendingSlotIds,\n      unscorableSlotIds,\n    };\n  });\n\n  // Pass 2 — the LIVE weights. Only sections with something graded contribute,\n  // and their weights are renormalised among themselves. A section whose items\n  // are all still ungraded must not contribute a zero: that is the \"live\n  // denominator\" bug, where a midterm reads 50% only because the essay has not\n  // been marked and a learner sees a fail for work nobody has looked at.\n  // These are the weights reported on each section, so that\n  // `sum(score * normalizedWeight) === result.score` holds and a client\n  // rendering the breakdown cannot disagree with the recorded grade.\n  const contributingWeight = partials.reduce(\n    (sum, partial) => sum + (partial.gradedMaxPoints > 0 ? partial.section.weight : 0),\n    0,\n  );\n\n  const scored: SectionScore[] = partials.map((partial) => ({\n    id: partial.section.id,\n    ...(partial.section.title !== undefined ? { title: partial.section.title } : {}),\n    weight: partial.section.weight,\n    normalizedWeight:\n      partial.gradedMaxPoints > 0 && contributingWeight > 0\n        ? partial.section.weight / contributingWeight\n        : 0,\n    earnedPoints: partial.earnedPoints,\n    gradedMaxPoints: partial.gradedMaxPoints,\n    maxPoints: partial.maxPoints,\n    score: partial.score,\n    // A section with nothing graded yet cannot be said to have failed.\n    passed:\n      partial.appliedThreshold === null || partial.gradedMaxPoints === 0\n        ? true\n        : gte(partial.score, partial.appliedThreshold, policy.rounding),\n    appliedThreshold: partial.appliedThreshold,\n    pendingSlotIds: partial.pendingSlotIds,\n    unscorableSlotIds: partial.unscorableSlotIds,\n  }));\n\n  const weightedRaw = scored.reduce(\n    (sum, section) => sum + section.score * section.normalizedWeight,\n    0,\n  );\n  const score = roundGrade(weightedRaw, policy.rounding);\n\n  // Only work that is still COMING keeps the result provisional. Work that can\n  // never be graded is excluded from the denominator but must not block the\n  // attempt from being recorded.\n  const status: 'final' | 'provisional' = pendingAll.length > 0 ? 'provisional' : 'final';\n\n  if (status === 'provisional') {\n    // Not passed and not failed: undetermined. Saying `false` here would let a\n    // UI keyed on `passed` show a fail for unmarked work.\n    return {\n      sections: scored,\n      score,\n      passed: null,\n      passFailureReason: null,\n      status,\n      pendingSlotIds: pendingAll,\n      unscorableSlotIds: unscorableAll,\n    };\n  }\n\n  // Nothing was gradable at all — every item unscorable, or an assessment with\n  // no items. There is no evidence either way, so there is no verdict: a hard\n  // `false` here records a fail at 0% for a learner whose work was never\n  // gradable, which is the same fabricated-failure this module exists to\n  // avoid, just reached through the other door.\n  if (scored.every((section) => section.gradedMaxPoints === 0)) {\n    return {\n      sections: scored,\n      score,\n      passed: null,\n      passFailureReason: null,\n      status,\n      pendingSlotIds: pendingAll,\n      unscorableSlotIds: unscorableAll,\n    };\n  }\n\n  const overallOk = gte(score, policy.passThreshold, policy.rounding);\n  const sectionsOk = scored.every((section) => section.passed);\n  const passed = overallOk && sectionsOk;\n\n  const passFailureReason: PassFailureReason = passed\n    ? null\n    : !overallOk && !sectionsOk\n      ? 'both'\n      : overallOk\n        ? 'section_below_threshold'\n        : 'overall_below_threshold';\n\n  return {\n    sections: scored,\n    score,\n    passed,\n    passFailureReason,\n    status,\n    pendingSlotIds: pendingAll,\n    unscorableSlotIds: unscorableAll,\n  };\n}\n","import { DeferredScoringError, RedactedScoringError, UnknownActivityTypeError } from '../errors.js';\nimport { getActivityTypeDescriptor } from '../registry/index.js';\nimport type {\n  ActivityData,\n  ActivityFeedback,\n  ActivityType,\n  ItemOutcome,\n  LearnerResponse,\n  ScoringResult,\n} from '../types/activity.js';\nimport { gte, type RoundingPolicy } from './rounding.js';\n\nexport type {\n  AssessmentScore,\n  AssessmentSectionInput,\n  CompositionPolicy,\n  PassFailureReason,\n  ScoredItem,\n  SectionScore,\n} from './compose.js';\nexport { composeAssessmentScore } from './compose.js';\nexport type { Band, RoundingMode, RoundingPolicy } from './rounding.js';\nexport { classifyBand, gte, roundGrade } from './rounding.js';\nexport type { TextMatchPolicy, TextMatchResult } from './text-match.js';\nexport { levenshteinDistance, matchText } from './text-match.js';\n\n/** Default minimum scaled score required to pass when `passThreshold` is absent. */\nexport const DEFAULT_PASS_THRESHOLD = 0.7;\n\n/**\n * Returns `true` iff `score` meets or exceeds the activity's `passThreshold`,\n * defaulting to {@link DEFAULT_PASS_THRESHOLD} (0.7) when the field is absent.\n *\n * Pass a {@link RoundingPolicy} to compare the way an assessment total is\n * compared — both sides rounded, via {@link gte} — so an item shown as \"70%\"\n * cannot be recorded as a fail at 69.6. It is **opt-in** rather than the\n * default because switching it on changes item-level pass/fail for scores in\n * the rounding band, and this SDK does not alter historical grades without an\n * explicit decision. Absent, the comparison is the exact raw `>=` it has\n * always been.\n */\nexport function computePassThreshold(\n  activityData: ActivityData,\n  score: number,\n  rounding?: RoundingPolicy,\n): boolean {\n  const threshold = activityData.passThreshold ?? DEFAULT_PASS_THRESHOLD;\n  return rounding === undefined ? score >= threshold : gte(score, threshold, rounding);\n}\n\n/**\n * True when `data` is a `redact()` projection rather than full activity data.\n * Scoring a redacted item is always a bug: the answer key is gone by design,\n * so any \"score\" computed from it is meaningless (it used to come out `NaN`).\n */\nfunction isRedacted(data: unknown): boolean {\n  return (\n    typeof data === 'object' && data !== null && (data as { redacted?: unknown }).redacted === true\n  );\n}\n\n/**\n * Selects the authored overall feedback for a result: `feedback.correct` when\n * the learner passed, `feedback.incorrect` otherwise; `null` when no matching\n * message was authored. Mirrors the selection the lk-react components applied\n * (keyed on `passed`, per the `ActivityFeedback` contract).\n */\nfunction selectFeedback(activityData: ActivityData, passed: boolean): string | null {\n  const feedback = (activityData as { feedback?: ActivityFeedback }).feedback;\n  if (feedback === undefined) {\n    return null;\n  }\n  return (passed ? feedback.correct : feedback.incorrect) ?? null;\n}\n\n/**\n * Scores a learner response against activity data and returns a full\n * {@link ScoringResult}.\n *\n * Pure and deterministic with no side effects. It does **not** re-validate\n * `activityData` — schema validation is the component boundary's\n * responsibility; this is a low-level scoring primitive that trusts its typed\n * inputs. Dispatch is registry-backed: consumer-registered types with `sync`\n * scoring work here too. An unregistered type throws\n * {@link UnknownActivityTypeError}; a type whose grading is deferred (e.g.\n * `written-response`) throws {@link DeferredScoringError} — use\n * {@link evaluate}, which can express \"not graded yet\".\n */\nexport function score(\n  activityType: ActivityType,\n  activityData: ActivityData,\n  learnerResponse: LearnerResponse,\n): ScoringResult {\n  const descriptor = getActivityTypeDescriptor(activityType);\n  if (descriptor === undefined) {\n    throw new UnknownActivityTypeError(String(activityType));\n  }\n  if (descriptor.scoring.kind === 'deferred') {\n    throw new DeferredScoringError(descriptor.type);\n  }\n  if (isRedacted(activityData)) {\n    throw new RedactedScoringError(descriptor.type);\n  }\n\n  const result = descriptor.scoring.score(activityData, learnerResponse);\n  if (!Number.isFinite(result.score)) {\n    throw new RedactedScoringError(descriptor.type);\n  }\n  const passed = computePassThreshold(activityData, result.score);\n  return { ...result, passed, feedback: result.feedback ?? selectFeedback(activityData, passed) };\n}\n\n/**\n * Evaluates a learner response against an activity and returns an\n * {@link ItemOutcome} — the resilient, forward-compatible alternative to\n * {@link score}:\n *\n * - Synchronously graded types return `{ status: 'scored', ... }` with the\n *   same numbers `score()` produces.\n * - Asynchronously graded types (e.g. `written-response`) return\n *   `{ status: 'deferred', reason, partial }` instead of a fake zero — \"not\n *   graded yet\" is expressible in the type system, never conflated with\n *   \"wrong\".\n * - An unregistered `data.type` returns `{ status: 'unscorable' }` rather\n *   than throwing, so a mixed-version content bank cannot crash an exam run.\n *\n * The activity type is read from `data.type` — there is no separate type\n * parameter to disagree with the payload.\n */\nexport function evaluate(data: ActivityData, response: LearnerResponse): ItemOutcome {\n  const type = (data as { type?: unknown }).type;\n  const descriptor = typeof type === 'string' ? getActivityTypeDescriptor(type) : undefined;\n\n  if (descriptor === undefined) {\n    return {\n      status: 'unscorable',\n      reason: `Activity type \"${String(type)}\" is not registered`,\n      maxScore: 1,\n    };\n  }\n\n  if (descriptor.scoring.kind === 'deferred') {\n    const partial = descriptor.scoring.partial?.(data, response);\n    return {\n      status: 'deferred',\n      reason: descriptor.scoring.reason,\n      maxScore: 1,\n      ...(partial !== undefined ? { partial } : {}),\n    };\n  }\n\n  if (isRedacted(data)) {\n    return {\n      status: 'unscorable',\n      reason:\n        'Activity data is redacted (no answer key), so it cannot be scored on the client. Score against the full data server-side.',\n      maxScore: 1,\n    };\n  }\n\n  const result = descriptor.scoring.score(data, response);\n  if (!Number.isFinite(result.score)) {\n    // Defence in depth: incomplete data (a missing answer key, an empty\n    // options array) used to divide by zero and surface as a real score of\n    // NaN, which JSON-serializes to null in a grade column.\n    return {\n      status: 'unscorable',\n      reason: `Scoring \"${descriptor.type}\" produced a non-finite score; the activity data is incomplete.`,\n      maxScore: result.maxScore,\n    };\n  }\n  const passed = computePassThreshold(data, result.score);\n  return {\n    status: 'scored',\n    score: result.score,\n    maxScore: result.maxScore,\n    passed,\n    feedback: result.feedback ?? selectFeedback(data, passed),\n    details: result.details,\n  };\n}\n"],"mappings":";;;;;;;;AAmCA,IAAM,UAAU;AAQhB,IAAM,gBAAgB;AAEtB,SAAS,OAAO,OAAe,IAAoB;AACjD,SAAO,QAAQ,MAAM;AACvB;AASA,SAAS,UAAU,OAAuB;AACxC,SAAO,OAAO,GAAG,OAAO,EAAE,IAAI,IAAI;AACpC;AASO,SAAS,WAAW,OAAe,QAAgC;AACxE,MAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3B,WAAO;AAAA,EACT;AACA,QAAM,SAAS,MAAM,OAAO;AAC5B,QAAM,MAAM,OAAO,OAAO,OAAO,EAAE;AAWnC,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aAAO,UAAU,KAAK,MAAM,MAAM,OAAO,IAAI,MAAM;AAAA,IACrD,KAAK;AACH,aAAO,UAAU,KAAK,KAAK,MAAM,OAAO,IAAI,MAAM;AAAA,IACpD,KAAK,aAAa;AAOhB,YAAM,UAAU,KAAK,MAAM,GAAG;AAC9B,UAAI,KAAK,IAAI,MAAM,UAAU,GAAG,IAAI,eAAe;AACjD,eAAO,UAAU,SAAS,GAAG,IAAI,MAAM;AAAA,MACzC;AAEA,YAAM,OAAO,UAAU,MAAM,IAAI,UAAU,UAAU;AACrD,aAAO,UAAU,OAAO,MAAM;AAAA,IAChC;AAAA,IACA;AACE,aAAO,UAAU,SAAS,GAAG,IAAI,MAAM;AAAA,EAC3C;AACF;AAOA,SAAS,SAAS,KAAqB;AACrC,QAAM,SAAS,OAAO,IAAI,MAAM,UAAU,MAAM;AAChD,SAAO,OAAO,IAAI,KAAK,MAAM,MAAM,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM;AAC5D;AAUO,SAAS,IAAI,OAAe,WAAmB,QAAiC;AACrF,SAAO,WAAW,OAAO,MAAM,KAAK,WAAW,WAAW,MAAM,IAAI;AACtE;AAiBO,SAAS,aAAa,OAAe,OAAqC;AAC/E,MAAI,OAAoB;AACxB,aAAW,QAAQ,OAAO;AACxB,QAAI,SAAS,KAAK,MAAM,YAAY,SAAS,QAAQ,KAAK,MAAM,KAAK,MAAM;AACzE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;;;AChHO,SAAS,gBACd,UACA,cACA,UAAkC,CAAC,GACiB;AAMpD,QAAM,UAAU,SAAS;AAAA,IACvB,CAAC,cACC,UAAU,kBAAkB,QAC5B,UAAU,UAAU,UACpB,CAAC,OAAO,SAAS,UAAU,KAAK;AAAA,EACpC;AACA,MAAI,YAAY,QAAW;AACzB,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ,cAAc,QAAQ,IAAI,6BAA6B,OAAO,QAAQ,KAAK,CAAC;AAAA,IACtF;AAAA,EACF;AAEA,QAAM,YAAY,SAAS;AAAA,IACzB,CAAC,cAAc,UAAU,kBAAkB,QAAQ,OAAO,UAAU,UAAU;AAAA,EAChF;AAOA,QAAMA,WAAU;AAChB,QAAM,aAAa,UAAU;AAAA,IAC3B,CAAC,cACE,UAAU,QAAmB,CAACA,YAAY,UAAU,QAAmB,IAAIA;AAAA,EAChF;AACA,MAAI,eAAe,QAAW;AAC5B,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ,cAAc,WAAW,IAAI,eAAe,WAAW,KAAK;AAAA,IACtE;AAAA,EACF;AAEA,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ;AAAA,IACV;AAAA,EACF;AAEA,QAAM,cAAc,UAAU,OAAO,CAAC,KAAK,cAAc,OAAO,UAAU,UAAU,IAAI,CAAC;AACzF,MAAI,EAAE,cAAc,IAAI;AACtB,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QACE;AAAA,IACJ;AAAA,EACF;AAEA,QAAM,WAAW,UAAU;AAAA,IACzB,CAAC,KAAK,cAAc,MAAO,UAAU,SAAoB,UAAU,UAAU;AAAA,IAC7E;AAAA,EACF;AACA,QAAM,WAAW,WAAW;AAC5B,MAAI,CAAC,OAAO,SAAS,QAAQ,GAAG;AAC9B,WAAO;AAAA,MACL,YAAY;AAAA,MACZ,QAAQ;AAAA,IACV;AAAA,EACF;AAGA,QAAMC,SAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,QAAQ,CAAC;AAE/C,QAAM,SACJ,QAAQ,kBAAkB,SACtBA,UAAS,QAAQ,gBACjB,iBAAiB,SACf,qBAAqB,cAAcA,MAAK,IACxCA,UAAS;AAEjB,SAAO;AAAA,IACL,OAAAA;AAAA,IACA,UAAU;AAAA,IACV;AAAA,IACA,UAAU,QAAQ,YAAY;AAAA,IAC9B,UAAU,CAAC,GAAG,QAAQ;AAAA,EACxB;AACF;AAQO,SAAS,iBAAiB,OAAiC;AAChE,SAAO;AAAA,IACL,QAAQ;AAAA,IACR;AAAA,IACA,OAAO,MAAM;AAAA,IACb,UAAU,MAAM;AAAA,IAChB,QAAQ,MAAM;AAAA,IACd,UAAU,MAAM;AAAA,EAClB;AACF;AAOO,SAAS,SACd,SACkE;AAClE,SAAO,QAAQ,WAAW,YAAY,QAAQ,WAAW;AAC3D;;;ACRA,SAAS,OAAO,MAAoC;AAClD,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,SAAS,OAAO,GAAG;AACrB,UAAM,MAAM,QAAQ,WAAW,IAAI,QAAQ,WAAW;AACtD,WAAO,EAAE,OAAO,UAAU,QAAS,QAAQ,QAAQ,MAAO,KAAK,OAAO;AAAA,EACxE;AACA,MAAI,QAAQ,WAAW,YAAY;AACjC,WAAO,EAAE,OAAO,UAAU;AAAA,EAC5B;AACA,SAAO,EAAE,OAAO,aAAa;AAC/B;AAYO,SAAS,uBACd,UACA,QACiB;AACjB,QAAM,aAAuB,CAAC;AAC9B,QAAM,gBAA0B,CAAC;AAGjC,QAAM,WAAW,SAAS,IAAI,CAAC,YAAY;AACzC,QAAI,eAAe;AACnB,QAAI,kBAAkB;AACtB,QAAI,YAAY;AAChB,UAAM,iBAA2B,CAAC;AAClC,UAAM,oBAA8B,CAAC;AAErC,eAAW,QAAQ,QAAQ,OAAO;AAChC,mBAAa,KAAK;AAClB,YAAM,eAAe,OAAO,IAAI;AAChC,UAAI,aAAa,UAAU,WAAW;AACpC,uBAAe,KAAK,KAAK,MAAM;AAC/B,mBAAW,KAAK,KAAK,MAAM;AAC3B;AAAA,MACF;AACA,UAAI,aAAa,UAAU,cAAc;AACvC,0BAAkB,KAAK,KAAK,MAAM;AAClC,sBAAc,KAAK,KAAK,MAAM;AAC9B;AAAA,MACF;AACA,sBAAgB,aAAa;AAC7B,yBAAmB,KAAK;AAAA,IAC1B;AAEA,UAAM,MAAM,kBAAkB,IAAI,eAAe,kBAAkB;AACnE,UAAM,mBAAmB,QAAQ,yBAAyB,OAAO,oBAAoB;AAErF,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,WAAW,KAAK,OAAO,QAAQ;AAAA,MACtC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AAUD,QAAM,qBAAqB,SAAS;AAAA,IAClC,CAAC,KAAK,YAAY,OAAO,QAAQ,kBAAkB,IAAI,QAAQ,QAAQ,SAAS;AAAA,IAChF;AAAA,EACF;AAEA,QAAM,SAAyB,SAAS,IAAI,CAAC,aAAa;AAAA,IACxD,IAAI,QAAQ,QAAQ;AAAA,IACpB,GAAI,QAAQ,QAAQ,UAAU,SAAY,EAAE,OAAO,QAAQ,QAAQ,MAAM,IAAI,CAAC;AAAA,IAC9E,QAAQ,QAAQ,QAAQ;AAAA,IACxB,kBACE,QAAQ,kBAAkB,KAAK,qBAAqB,IAChD,QAAQ,QAAQ,SAAS,qBACzB;AAAA,IACN,cAAc,QAAQ;AAAA,IACtB,iBAAiB,QAAQ;AAAA,IACzB,WAAW,QAAQ;AAAA,IACnB,OAAO,QAAQ;AAAA;AAAA,IAEf,QACE,QAAQ,qBAAqB,QAAQ,QAAQ,oBAAoB,IAC7D,OACA,IAAI,QAAQ,OAAO,QAAQ,kBAAkB,OAAO,QAAQ;AAAA,IAClE,kBAAkB,QAAQ;AAAA,IAC1B,gBAAgB,QAAQ;AAAA,IACxB,mBAAmB,QAAQ;AAAA,EAC7B,EAAE;AAEF,QAAM,cAAc,OAAO;AAAA,IACzB,CAAC,KAAK,YAAY,MAAM,QAAQ,QAAQ,QAAQ;AAAA,IAChD;AAAA,EACF;AACA,QAAMC,SAAQ,WAAW,aAAa,OAAO,QAAQ;AAKrD,QAAM,SAAkC,WAAW,SAAS,IAAI,gBAAgB;AAEhF,MAAI,WAAW,eAAe;AAG5B,WAAO;AAAA,MACL,UAAU;AAAA,MACV,OAAAA;AAAA,MACA,QAAQ;AAAA,MACR,mBAAmB;AAAA,MACnB;AAAA,MACA,gBAAgB;AAAA,MAChB,mBAAmB;AAAA,IACrB;AAAA,EACF;AAOA,MAAI,OAAO,MAAM,CAAC,YAAY,QAAQ,oBAAoB,CAAC,GAAG;AAC5D,WAAO;AAAA,MACL,UAAU;AAAA,MACV,OAAAA;AAAA,MACA,QAAQ;AAAA,MACR,mBAAmB;AAAA,MACnB;AAAA,MACA,gBAAgB;AAAA,MAChB,mBAAmB;AAAA,IACrB;AAAA,EACF;AAEA,QAAM,YAAY,IAAIA,QAAO,OAAO,eAAe,OAAO,QAAQ;AAClE,QAAM,aAAa,OAAO,MAAM,CAAC,YAAY,QAAQ,MAAM;AAC3D,QAAM,SAAS,aAAa;AAE5B,QAAM,oBAAuC,SACzC,OACA,CAAC,aAAa,CAAC,aACb,SACA,YACE,4BACA;AAER,SAAO;AAAA,IACL,UAAU;AAAA,IACV,OAAAA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,gBAAgB;AAAA,IAChB,mBAAmB;AAAA,EACrB;AACF;;;AClSO,IAAM,yBAAyB;AAc/B,SAAS,qBACd,cACAC,QACA,UACS;AACT,QAAM,YAAY,aAAa,iBAAiB;AAChD,SAAO,aAAa,SAAYA,UAAS,YAAY,IAAIA,QAAO,WAAW,QAAQ;AACrF;AAOA,SAAS,WAAW,MAAwB;AAC1C,SACE,OAAO,SAAS,YAAY,SAAS,QAAS,KAAgC,aAAa;AAE/F;AAQA,SAAS,eAAe,cAA4B,QAAgC;AAClF,QAAM,WAAY,aAAiD;AACnE,MAAI,aAAa,QAAW;AAC1B,WAAO;AAAA,EACT;AACA,UAAQ,SAAS,SAAS,UAAU,SAAS,cAAc;AAC7D;AAeO,SAAS,MACd,cACA,cACA,iBACe;AACf,QAAM,aAAa,0BAA0B,YAAY;AACzD,MAAI,eAAe,QAAW;AAC5B,UAAM,IAAI,yBAAyB,OAAO,YAAY,CAAC;AAAA,EACzD;AACA,MAAI,WAAW,QAAQ,SAAS,YAAY;AAC1C,UAAM,IAAI,qBAAqB,WAAW,IAAI;AAAA,EAChD;AACA,MAAI,WAAW,YAAY,GAAG;AAC5B,UAAM,IAAI,qBAAqB,WAAW,IAAI;AAAA,EAChD;AAEA,QAAM,SAAS,WAAW,QAAQ,MAAM,cAAc,eAAe;AACrE,MAAI,CAAC,OAAO,SAAS,OAAO,KAAK,GAAG;AAClC,UAAM,IAAI,qBAAqB,WAAW,IAAI;AAAA,EAChD;AACA,QAAM,SAAS,qBAAqB,cAAc,OAAO,KAAK;AAC9D,SAAO,EAAE,GAAG,QAAQ,QAAQ,UAAU,OAAO,YAAY,eAAe,cAAc,MAAM,EAAE;AAChG;AAmBO,SAAS,SAAS,MAAoB,UAAwC;AACnF,QAAM,OAAQ,KAA4B;AAC1C,QAAM,aAAa,OAAO,SAAS,WAAW,0BAA0B,IAAI,IAAI;AAEhF,MAAI,eAAe,QAAW;AAC5B,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QAAQ,kBAAkB,OAAO,IAAI,CAAC;AAAA,MACtC,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,MAAI,WAAW,QAAQ,SAAS,YAAY;AAC1C,UAAM,UAAU,WAAW,QAAQ,UAAU,MAAM,QAAQ;AAC3D,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QAAQ,WAAW,QAAQ;AAAA,MAC3B,UAAU;AAAA,MACV,GAAI,YAAY,SAAY,EAAE,QAAQ,IAAI,CAAC;AAAA,IAC7C;AAAA,EACF;AAEA,MAAI,WAAW,IAAI,GAAG;AACpB,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QACE;AAAA,MACF,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,QAAM,SAAS,WAAW,QAAQ,MAAM,MAAM,QAAQ;AACtD,MAAI,CAAC,OAAO,SAAS,OAAO,KAAK,GAAG;AAIlC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QAAQ,YAAY,WAAW,IAAI;AAAA,MACnC,UAAU,OAAO;AAAA,IACnB;AAAA,EACF;AACA,QAAM,SAAS,qBAAqB,MAAM,OAAO,KAAK;AACtD,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,OAAO,OAAO;AAAA,IACd,UAAU,OAAO;AAAA,IACjB;AAAA,IACA,UAAU,OAAO,YAAY,eAAe,MAAM,MAAM;AAAA,IACxD,SAAS,OAAO;AAAA,EAClB;AACF;","names":["EPSILON","score","score","score"]}