@intellectif/lk-core 0.7.1 → 0.8.1

package/dist/{chunk-MVZKEWZN.cjs.map → chunk-YJZY5TPY.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/learning-kit/learning-kit/packages/lk-core/dist/chunk-MVZKEWZN.cjs","../src/scoring/rounding.ts","../src/grading.ts","../src/scoring/compose.ts","../src/scoring/index.ts"],"names":["EPSILON","score"],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;AC4BA,IAAM,QAAA,EAAU,IAAA;AAQhB,IAAM,cAAA,EAAgB,IAAA;AAEtB,SAAS,MAAA,CAAO,KAAA,EAAe,EAAA,EAAoB;AACjD,EAAA,OAAO,MAAA,EAAQ,GAAA,GAAM,EAAA;AACvB;AASA,SAAS,SAAA,CAAU,KAAA,EAAuB;AACxC,EAAA,OAAO,MAAA,CAAO,EAAA,CAAG,KAAA,EAAO,CAAA,CAAE,EAAA,EAAI,EAAA,EAAI,KAAA;AACpC;AASO,SAAS,UAAA,CAAW,KAAA,EAAe,MAAA,EAAgC;AACxE,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AAC3B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,EAAS,GAAA,GAAM,MAAA,CAAO,EAAA;AAC5B,EAAA,MAAM,IAAA,EAAM,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,EAAE,CAAA;AAWnC,EAAA,OAAA,CAAQ,MAAA,CAAO,IAAA,EAAM;AAAA,IACnB,KAAK,OAAA;AACH,MAAA,OAAO,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,IAAA,EAAM,OAAO,EAAA,EAAI,MAAM,CAAA;AAAA,IACrD,KAAK,MAAA;AACH,MAAA,OAAO,SAAA,CAAU,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,OAAO,EAAA,EAAI,MAAM,CAAA;AAAA,IACpD,KAAK,WAAA,EAAa;AAOhB,MAAA,MAAM,QAAA,EAAU,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC9B,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,QAAA,EAAU,GAAG,EAAA,EAAI,aAAA,EAAe;AACjD,QAAA,OAAO,SAAA,CAAU,QAAA,CAAS,GAAG,EAAA,EAAI,MAAM,CAAA;AAAA,MACzC;AAEA,MAAA,MAAM,KAAA,EAAO,QAAA,EAAU,EAAA,IAAM,EAAA,EAAI,QAAA,EAAU,QAAA,EAAU,CAAA;AACrD,MAAA,OAAO,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA;AAAA,IAChC;AAAA,IACA,OAAA;AACE,MAAA,OAAO,SAAA,CAAU,QAAA,CAAS,GAAG,EAAA,EAAI,MAAM,CAAA;AAAA,EAC3C;AACF;AAOA,SAAS,QAAA,CAAS,GAAA,EAAqB;AACrC,EAAA,MAAM,OAAA,EAAS,IAAA,GAAO,EAAA,EAAI,IAAA,EAAM,QAAA,EAAU,IAAA,EAAM,OAAA;AAChD,EAAA,OAAO,IAAA,GAAO,EAAA,EAAI,IAAA,CAAK,KAAA,CAAM,MAAM,EAAA,EAAI,CAAC,IAAA,CAAK,KAAA,CAAM,CAAC,MAAM,CAAA;AAC5D;AAUO,SAAS,GAAA,CAAI,KAAA,EAAe,SAAA,EAAmB,MAAA,EAAiC;AACrF,EAAA,OAAO,UAAA,CAAW,KAAA,EAAO,MAAM,EAAA,GAAK,UAAA,CAAW,SAAA,EAAW,MAAM,EAAA,EAAI,OAAA;AACtE;AAiBO,SAAS,YAAA,CAAa,KAAA,EAAe,KAAA,EAAqC;AAC/E,EAAA,IAAI,KAAA,EAAoB,IAAA;AACxB,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,GAAA,CAAI,MAAA,GAAS,IAAA,CAAK,IAAA,EAAM,QAAA,GAAA,CAAY,KAAA,IAAS,KAAA,GAAQ,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,GAAA,CAAA,EAAM;AACzE,MAAA,KAAA,EAAO,IAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;ADlGA;AACA;AEDO,SAAS,eAAA,CACd,QAAA,EACA,YAAA,EACA,QAAA,EAAkC,CAAC,CAAA,EACiB;AAMpD,EAAA,MAAM,QAAA,EAAU,QAAA,CAAS,IAAA;AAAA,IACvB,CAAC,SAAA,EAAA,GACC,SAAA,CAAU,cAAA,IAAkB,KAAA,GAC5B,SAAA,CAAU,MAAA,IAAU,KAAA,EAAA,GACpB,CAAC,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,KAAK;AAAA,EACpC,CAAA;AACA,EAAA,GAAA,CAAI,QAAA,IAAY,KAAA,CAAA,EAAW;AACzB,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ,CAAA,WAAA,EAAc,OAAA,CAAQ,IAAI,CAAA,0BAAA,EAA6B,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAC,CAAA,sCAAA;AAAA,IACtF,CAAA;AAAA,EACF;AAKA,EAAA,MAAM,OAAA,EAAS,QAAA,CAAS,IAAA;AAAA,IACtB,CAAC,SAAA,EAAA,GACC,SAAA,CAAU,cAAA,IAAkB,KAAA,GAC5B,SAAA,CAAU,SAAA,IAAa,KAAA,EAAA,GACvB,CAAA,CAAE,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,QAAQ,EAAA,GAAK,SAAA,CAAU,SAAA,EAAW,CAAA;AAAA,EAClE,CAAA;AACA,EAAA,GAAA,CAAI,OAAA,IAAW,KAAA,CAAA,EAAW;AACxB,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ,CAAA,WAAA,EAAc,MAAA,CAAO,IAAI,CAAA,oBAAA,EAAuB,MAAA,CAAO,MAAA,CAAO,QAAQ,CAAC,CAAA,uCAAA;AAAA,IACjF,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,EAAY,QAAA,CAAS,MAAA;AAAA,IACzB,CAAC,SAAA,EAAA,GAAc,SAAA,CAAU,cAAA,IAAkB,KAAA,GAAQ,OAAO,SAAA,CAAU,MAAA,IAAU;AAAA,EAChF,CAAA;AAGA,EAAA,MAAM,QAAA,EAAU,CAAC,SAAA,EAAA,GACd,SAAA,CAAU,MAAA,EAAA,kBAAoB,SAAA,CAAU,QAAA,UAAY,GAAA,CAAA;AAOvD,EAAA,MAAMA,SAAAA,EAAU,IAAA;AAChB,EAAA,MAAM,WAAA,EAAa,SAAA,CAAU,IAAA;AAAA,IAC3B,CAAC,SAAA,EAAA,GAAc,OAAA,CAAQ,SAAS,EAAA,EAAI,CAACA,SAAAA,GAAW,OAAA,CAAQ,SAAS,EAAA,EAAI,EAAA,EAAIA;AAAA,EAC3E,CAAA;AACA,EAAA,GAAA,CAAI,WAAA,IAAe,KAAA,CAAA,EAAW;AAC5B,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EACE,CAAA,WAAA,EAAc,UAAA,CAAW,IAAI,CAAA,YAAA,EAAe,UAAA,CAAW,KAAK,CAAA,QAAA,mBAAW,UAAA,CAAW,QAAA,UAAY,GAAC,CAAA,uKAAA;AAAA,IAGnG,CAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,SAAA,CAAU,OAAA,IAAW,CAAA,EAAG;AAC1B,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ;AAAA,IACV,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,YAAA,EAAc,SAAA,CAAU,MAAA,CAAO,CAAC,GAAA,EAAK,SAAA,EAAA,GAAc,IAAA,EAAA,kBAAO,SAAA,CAAU,MAAA,UAAU,GAAA,CAAA,EAAI,CAAC,CAAA;AACzF,EAAA,GAAA,CAAI,CAAA,CAAE,YAAA,EAAc,CAAA,CAAA,EAAI;AACtB,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EACE;AAAA,IACJ,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,EAAW,SAAA,CAAU,MAAA;AAAA,IACzB,CAAC,GAAA,EAAK,SAAA,EAAA,GAAc,IAAA,EAAM,OAAA,CAAQ,SAAS,EAAA,EAAA,kBAAK,SAAA,CAAU,MAAA,UAAU,GAAA,CAAA;AAAA,IACpE;AAAA,EACF,CAAA;AACA,EAAA,MAAM,SAAA,EAAW,SAAA,EAAW,WAAA;AAC5B,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC9B,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ;AAAA,IACV,CAAA;AAAA,EACF;AAGA,EAAA,MAAMC,OAAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAQ,CAAC,CAAA;AAE/C,EAAA,MAAM,OAAA,EACJ,OAAA,CAAQ,cAAA,IAAkB,KAAA,EAAA,EACtBA,OAAAA,GAAS,OAAA,CAAQ,cAAA,EACjB,aAAA,IAAiB,KAAA,EAAA,EACf,oBAAA,CAAqB,YAAA,EAAcA,MAAK,EAAA,EACxCA,OAAAA,GAAS,GAAA;AAEjB,EAAA,OAAO;AAAA,IACL,KAAA,EAAAA,MAAAA;AAAA,IACA,QAAA,EAAU,CAAA;AAAA,IACV,MAAA;AAAA,IACA,QAAA,mBAAU,OAAA,CAAQ,QAAA,UAAY,MAAA;AAAA,IAC9B,QAAA,EAAU,CAAC,GAAG,QAAQ;AAAA,EACxB,CAAA;AACF;AAQO,SAAS,gBAAA,CAAiB,KAAA,EAAiC;AAChE,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,QAAA;AAAA,IACR,KAAA;AAAA,IACA,KAAA,EAAO,KAAA,CAAM,KAAA;AAAA,IACb,QAAA,EAAU,KAAA,CAAM,QAAA;AAAA,IAChB,MAAA,EAAQ,KAAA,CAAM,MAAA;AAAA,IACd,QAAA,EAAU,KAAA,CAAM;AAAA,EAClB,CAAA;AACF;AAOO,SAAS,QAAA,CACd,OAAA,EACkE;AAClE,EAAA,OAAO,OAAA,CAAQ,OAAA,IAAW,SAAA,GAAY,OAAA,CAAQ,OAAA,IAAW,QAAA;AAC3D;AFzDA;AACA;AGYA,SAAS,MAAA,CAAO,IAAA,EAAoC;AAClD,EAAA,MAAM,EAAE,QAAQ,EAAA,EAAI,IAAA;AACpB,EAAA,GAAA,CAAI,QAAA,CAAS,OAAO,CAAA,EAAG;AACrB,IAAA,MAAM,IAAA,EAAM,OAAA,CAAQ,SAAA,EAAW,EAAA,EAAI,OAAA,CAAQ,SAAA,EAAW,CAAA;AACtD,IAAA,OAAO,EAAE,KAAA,EAAO,QAAA,EAAU,MAAA,EAAS,OAAA,CAAQ,MAAA,EAAQ,IAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAAA,EACxE;AACA,EAAA,GAAA,CAAI,OAAA,CAAQ,OAAA,IAAW,UAAA,EAAY;AACjC,IAAA,OAAO,EAAE,KAAA,EAAO,UAAU,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,aAAa,CAAA;AAC/B;AAYO,SAAS,sBAAA,CACd,QAAA,EACA,MAAA,EACiB;AACjB,EAAA,MAAM,WAAA,EAAuB,CAAC,CAAA;AAC9B,EAAA,MAAM,cAAA,EAA0B,CAAC,CAAA;AAGjC,EAAA,MAAM,SAAA,EAAW,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,EAAA,GAAY;AACzC,IAAA,IAAI,aAAA,EAAe,CAAA;AACnB,IAAA,IAAI,gBAAA,EAAkB,CAAA;AACtB,IAAA,IAAI,UAAA,EAAY,CAAA;AAChB,IAAA,MAAM,eAAA,EAA2B,CAAC,CAAA;AAClC,IAAA,MAAM,kBAAA,EAA8B,CAAC,CAAA;AAErC,IAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,OAAA,CAAQ,KAAA,EAAO;AAChC,MAAA,UAAA,GAAa,IAAA,CAAK,MAAA;AAClB,MAAA,MAAM,aAAA,EAAe,MAAA,CAAO,IAAI,CAAA;AAChC,MAAA,GAAA,CAAI,YAAA,CAAa,MAAA,IAAU,SAAA,EAAW;AACpC,QAAA,cAAA,CAAe,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAC/B,QAAA,UAAA,CAAW,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAC3B,QAAA,QAAA;AAAA,MACF;AACA,MAAA,GAAA,CAAI,YAAA,CAAa,MAAA,IAAU,YAAA,EAAc;AACvC,QAAA,iBAAA,CAAkB,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAClC,QAAA,aAAA,CAAc,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAC9B,QAAA,QAAA;AAAA,MACF;AACA,MAAA,aAAA,GAAgB,YAAA,CAAa,MAAA;AAC7B,MAAA,gBAAA,GAAmB,IAAA,CAAK,MAAA;AAAA,IAC1B;AAEA,IAAA,MAAM,IAAA,EAAM,gBAAA,EAAkB,EAAA,EAAI,aAAA,EAAe,gBAAA,EAAkB,CAAA;AACnE,IAAA,MAAM,iBAAA,oCAAmB,OAAA,CAAQ,qBAAA,UAAyB,MAAA,CAAO,kBAAA,UAAoB,MAAA;AAErF,IAAA,OAAO;AAAA,MACL,OAAA;AAAA,MACA,YAAA;AAAA,MACA,eAAA;AAAA,MACA,SAAA;AAAA,MACA,KAAA,EAAO,UAAA,CAAW,GAAA,EAAK,MAAA,CAAO,QAAQ,CAAA;AAAA,MACtC,gBAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,IACF,CAAA;AAAA,EACF,CAAC,CAAA;AAUD,EAAA,MAAM,mBAAA,EAAqB,QAAA,CAAS,MAAA;AAAA,IAClC,CAAC,GAAA,EAAK,OAAA,EAAA,GAAY,IAAA,EAAA,CAAO,OAAA,CAAQ,gBAAA,EAAkB,EAAA,EAAI,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,CAAA,CAAA;AAAA,IAChF;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,OAAA,EAAyB,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,EAAA,GAAA,CAAa;AAAA,IACxD,EAAA,EAAI,OAAA,CAAQ,OAAA,CAAQ,EAAA;AAAA,IACpB,GAAI,OAAA,CAAQ,OAAA,CAAQ,MAAA,IAAU,KAAA,EAAA,EAAY,EAAE,KAAA,EAAO,OAAA,CAAQ,OAAA,CAAQ,MAAM,EAAA,EAAI,CAAC,CAAA;AAAA,IAC9E,MAAA,EAAQ,OAAA,CAAQ,OAAA,CAAQ,MAAA;AAAA,IACxB,gBAAA,EACE,OAAA,CAAQ,gBAAA,EAAkB,EAAA,GAAK,mBAAA,EAAqB,EAAA,EAChD,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,mBAAA,EACzB,CAAA;AAAA,IACN,YAAA,EAAc,OAAA,CAAQ,YAAA;AAAA,IACtB,eAAA,EAAiB,OAAA,CAAQ,eAAA;AAAA,IACzB,SAAA,EAAW,OAAA,CAAQ,SAAA;AAAA,IACnB,KAAA,EAAO,OAAA,CAAQ,KAAA;AAAA;AAAA,IAEf,MAAA,EACE,OAAA,CAAQ,iBAAA,IAAqB,KAAA,GAAQ,OAAA,CAAQ,gBAAA,IAAoB,EAAA,EAC7D,KAAA,EACA,GAAA,CAAI,OAAA,CAAQ,KAAA,EAAO,OAAA,CAAQ,gBAAA,EAAkB,MAAA,CAAO,QAAQ,CAAA;AAAA,IAClE,gBAAA,EAAkB,OAAA,CAAQ,gBAAA;AAAA,IAC1B,cAAA,EAAgB,OAAA,CAAQ,cAAA;AAAA,IACxB,iBAAA,EAAmB,OAAA,CAAQ;AAAA,EAC7B,CAAA,CAAE,CAAA;AAEF,EAAA,MAAM,YAAA,EAAc,MAAA,CAAO,MAAA;AAAA,IACzB,CAAC,GAAA,EAAK,OAAA,EAAA,GAAY,IAAA,EAAM,OAAA,CAAQ,MAAA,EAAQ,OAAA,CAAQ,gBAAA;AAAA,IAChD;AAAA,EACF,CAAA;AACA,EAAA,MAAMA,OAAAA,EAAQ,UAAA,CAAW,WAAA,EAAa,MAAA,CAAO,QAAQ,CAAA;AAKrD,EAAA,MAAM,OAAA,EAAkC,UAAA,CAAW,OAAA,EAAS,EAAA,EAAI,cAAA,EAAgB,OAAA;AAEhF,EAAA,GAAA,CAAI,OAAA,IAAW,aAAA,EAAe;AAG5B,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,MAAA;AAAA,MACV,KAAA,EAAAA,MAAAA;AAAA,MACA,MAAA,EAAQ,IAAA;AAAA,MACR,iBAAA,EAAmB,IAAA;AAAA,MACnB,MAAA;AAAA,MACA,cAAA,EAAgB,UAAA;AAAA,MAChB,iBAAA,EAAmB;AAAA,IACrB,CAAA;AAAA,EACF;AAOA,EAAA,GAAA,CAAI,MAAA,CAAO,KAAA,CAAM,CAAC,OAAA,EAAA,GAAY,OAAA,CAAQ,gBAAA,IAAoB,CAAC,CAAA,EAAG;AAC5D,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,MAAA;AAAA,MACV,KAAA,EAAAA,MAAAA;AAAA,MACA,MAAA,EAAQ,IAAA;AAAA,MACR,iBAAA,EAAmB,IAAA;AAAA,MACnB,MAAA;AAAA,MACA,cAAA,EAAgB,UAAA;AAAA,MAChB,iBAAA,EAAmB;AAAA,IACrB,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,EAAY,GAAA,CAAIA,MAAAA,EAAO,MAAA,CAAO,aAAA,EAAe,MAAA,CAAO,QAAQ,CAAA;AAClE,EAAA,MAAM,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,CAAC,OAAA,EAAA,GAAY,OAAA,CAAQ,MAAM,CAAA;AAC3D,EAAA,MAAM,OAAA,EAAS,UAAA,GAAa,UAAA;AAE5B,EAAA,MAAM,kBAAA,EAAuC,OAAA,EACzC,KAAA,EACA,CAAC,UAAA,GAAa,CAAC,WAAA,EACb,OAAA,EACA,UAAA,EACE,0BAAA,EACA,yBAAA;AAER,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,MAAA;AAAA,IACV,KAAA,EAAAA,MAAAA;AAAA,IACA,MAAA;AAAA,IACA,iBAAA;AAAA,IACA,MAAA;AAAA,IACA,cAAA,EAAgB,UAAA;AAAA,IAChB,iBAAA,EAAmB;AAAA,EACrB,CAAA;AACF;AHpEA;AACA;AI/NO,IAAM,uBAAA,EAAyB,GAAA;AAc/B,SAAS,oBAAA,CACd,YAAA,EACAA,MAAAA,EACA,QAAA,EACS;AACT,EAAA,MAAM,UAAA,mBAAY,YAAA,CAAa,aAAA,UAAiB,wBAAA;AAChD,EAAA,OAAO,SAAA,IAAa,KAAA,EAAA,EAAYA,OAAAA,GAAS,UAAA,EAAY,GAAA,CAAIA,MAAAA,EAAO,SAAA,EAAW,QAAQ,CAAA;AACrF;AAOA,SAAS,UAAA,CAAW,IAAA,EAAwB;AAC1C,EAAA,OACE,OAAO,KAAA,IAAS,SAAA,GAAY,KAAA,IAAS,KAAA,GAAS,IAAA,CAAgC,SAAA,IAAa,IAAA;AAE/F;AAQA,SAAS,cAAA,CAAe,YAAA,EAA4B,MAAA,EAAgC;AAClF,EAAA,MAAM,SAAA,EAAY,YAAA,CAAiD,QAAA;AACnE,EAAA,GAAA,CAAI,SAAA,IAAa,KAAA,CAAA,EAAW;AAC1B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,wBAAA,CAAQ,OAAA,EAAS,QAAA,CAAS,QAAA,EAAU,QAAA,CAAS,SAAA,CAAA,UAAc,MAAA;AAC7D;AAeO,SAAS,KAAA,CACd,YAAA,EACA,YAAA,EACA,eAAA,EACe;AACf,EAAA,MAAM,WAAA,EAAa,yDAAA,YAAsC,CAAA;AACzD,EAAA,GAAA,CAAI,WAAA,IAAe,KAAA,CAAA,EAAW;AAC5B,IAAA,MAAM,IAAI,+CAAA,CAAyB,MAAA,CAAO,YAAY,CAAC,CAAA;AAAA,EACzD;AACA,EAAA,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,KAAA,IAAS,UAAA,EAAY;AAC1C,IAAA,MAAM,IAAI,2CAAA,CAAqB,UAAA,CAAW,IAAI,CAAA;AAAA,EAChD;AACA,EAAA,GAAA,CAAI,UAAA,CAAW,YAAY,CAAA,EAAG;AAC5B,IAAA,MAAM,IAAI,2CAAA,CAAqB,UAAA,CAAW,IAAI,CAAA;AAAA,EAChD;AAEA,EAAA,MAAM,OAAA,EAAS,UAAA,CAAW,OAAA,CAAQ,KAAA,CAAM,YAAA,EAAc,eAAe,CAAA;AACrE,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,KAAK,CAAA,EAAG;AAClC,IAAA,MAAM,IAAI,2CAAA,CAAqB,UAAA,CAAW,IAAI,CAAA;AAAA,EAChD;AACA,EAAA,MAAM,OAAA,EAAS,oBAAA,CAAqB,YAAA,EAAc,MAAA,CAAO,KAAK,CAAA;AAC9D,EAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,MAAA,EAAQ,QAAA,mBAAU,MAAA,CAAO,QAAA,UAAY,cAAA,CAAe,YAAA,EAAc,MAAM,IAAE,CAAA;AAChG;AAmBO,SAAS,QAAA,CAAS,IAAA,EAAoB,QAAA,EAAwC;AACnF,EAAA,MAAM,KAAA,EAAQ,IAAA,CAA4B,IAAA;AAC1C,EAAA,MAAM,WAAA,EAAa,OAAO,KAAA,IAAS,SAAA,EAAW,yDAAA,IAA8B,EAAA,EAAI,KAAA,CAAA;AAEhF,EAAA,GAAA,CAAI,WAAA,IAAe,KAAA,CAAA,EAAW;AAC5B,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,YAAA;AAAA,MACR,MAAA,EAAQ,CAAA,eAAA,EAAkB,MAAA,CAAO,IAAI,CAAC,CAAA,mBAAA,CAAA;AAAA,MACtC,QAAA,EAAU;AAAA,IACZ,CAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,KAAA,IAAS,UAAA,EAAY;AAC1C,IAAA,MAAM,QAAA,kBAAU,UAAA,mBAAW,OAAA,qBAAQ,OAAA,0BAAA,CAAU,IAAA,EAAM,QAAQ,GAAA;AAC3D,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,UAAA;AAAA,MACR,MAAA,EAAQ,UAAA,CAAW,OAAA,CAAQ,MAAA;AAAA,MAC3B,QAAA,EAAU,CAAA;AAAA,MACV,GAAI,QAAA,IAAY,KAAA,EAAA,EAAY,EAAE,QAAQ,EAAA,EAAI,CAAC;AAAA,IAC7C,CAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,UAAA,CAAW,IAAI,CAAA,EAAG;AACpB,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,YAAA;AAAA,MACR,MAAA,EACE,2HAAA;AAAA,MACF,QAAA,EAAU;AAAA,IACZ,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,OAAA,EAAS,UAAA,CAAW,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,QAAQ,CAAA;AACtD,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,KAAK,CAAA,EAAG;AAIlC,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,YAAA;AAAA,MACR,MAAA,EAAQ,CAAA,SAAA,EAAY,UAAA,CAAW,IAAI,CAAA,+DAAA,CAAA;AAAA,MACnC,QAAA,EAAU,MAAA,CAAO;AAAA,IACnB,CAAA;AAAA,EACF;AACA,EAAA,MAAM,OAAA,EAAS,oBAAA,CAAqB,IAAA,EAAM,MAAA,CAAO,KAAK,CAAA;AACtD,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,QAAA;AAAA,IACR,KAAA,EAAO,MAAA,CAAO,KAAA;AAAA,IACd,QAAA,EAAU,MAAA,CAAO,QAAA;AAAA,IACjB,MAAA;AAAA,IACA,QAAA,mBAAU,MAAA,CAAO,QAAA,UAAY,cAAA,CAAe,IAAA,EAAM,MAAM,GAAA;AAAA,IACxD,OAAA,EAAS,MAAA,CAAO;AAAA,EAClB,CAAA;AACF;AJoJA;AACA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,waAAC","file":"/home/runner/work/learning-kit/learning-kit/packages/lk-core/dist/chunk-MVZKEWZN.cjs","sourcesContent":[null,"/**\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 *\n * Scores need not be in [0,1]: set `maxScore` on a criterion to declare what\n * its score is out of, and each is normalised before weighting. A grader\n * working out of 100 says so and is done:\n *\n * ```ts\n * gradeFromRubric([\n *   { name: 'Task achievement', score: 82, maxScore: 100, weight: 2 },\n *   { name: 'Range',            score: 7,  maxScore: 9,   weight: 1 },\n * ]);\n * ```\n *\n * The returned `GradeRecord.score` is always scaled [0,1] against\n * `maxScore: 1`, like every other score in the SDK.\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  // A `maxScore` that is absent means 1 (the scaled convention). One that is\n  // present must be a positive finite number: dividing by 0, a negative, or a\n  // NaN would produce a grade nobody can defend.\n  const badMax = criteria.find(\n    (criterion) =>\n      criterion.notApplicable !== true &&\n      criterion.maxScore !== undefined &&\n      !(Number.isFinite(criterion.maxScore) && criterion.maxScore > 0),\n  );\n  if (badMax !== undefined) {\n    return {\n      unscorable: true,\n      reason: `Criterion \"${badMax.name}\" declares maxScore ${String(badMax.maxScore)}; it must be a positive, finite number.`,\n    };\n  }\n\n  const scoreable = criteria.filter(\n    (criterion) => criterion.notApplicable !== true && typeof criterion.score === 'number',\n  );\n\n  /** The criterion's score as a ratio in [0,1]. `maxScore` defaults to 1. */\n  const ratioOf = (criterion: CriterionScore): number =>\n    (criterion.score as number) / (criterion.maxScore ?? 1);\n\n  // A grader that returns raw points (4 out of 5) without declaring\n  // `maxScore: 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 further down.\n  const EPSILON = 1e-9;\n  const outOfRange = scoreable.find(\n    (criterion) => ratioOf(criterion) < -EPSILON || ratioOf(criterion) > 1 + EPSILON,\n  );\n  if (outOfRange !== undefined) {\n    return {\n      unscorable: true,\n      reason:\n        `Criterion \"${outOfRange.name}\" has score ${outOfRange.score} out of ${outOfRange.maxScore ?? 1}, ` +\n        'which is outside the [0,1] range once scaled. Set `maxScore` on the criterion to declare what the ' +\n        'score is out of (e.g. `maxScore: 100` for a 0–100 grader).',\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 + ratioOf(criterion) * (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"]}
+{"version":3,"sources":["/home/runner/work/learning-kit/learning-kit/packages/lk-core/dist/chunk-YJZY5TPY.cjs","../src/scoring/rounding.ts","../src/grading.ts","../src/scoring/compose.ts","../src/scoring/index.ts"],"names":["EPSILON","score"],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;AC4BA,IAAM,QAAA,EAAU,IAAA;AAQhB,IAAM,cAAA,EAAgB,IAAA;AAEtB,SAAS,MAAA,CAAO,KAAA,EAAe,EAAA,EAAoB;AACjD,EAAA,OAAO,MAAA,EAAQ,GAAA,GAAM,EAAA;AACvB;AASA,SAAS,SAAA,CAAU,KAAA,EAAuB;AACxC,EAAA,OAAO,MAAA,CAAO,EAAA,CAAG,KAAA,EAAO,CAAA,CAAE,EAAA,EAAI,EAAA,EAAI,KAAA;AACpC;AASO,SAAS,UAAA,CAAW,KAAA,EAAe,MAAA,EAAgC;AACxE,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AAC3B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,OAAA,EAAS,GAAA,GAAM,MAAA,CAAO,EAAA;AAC5B,EAAA,MAAM,IAAA,EAAM,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,EAAE,CAAA;AAWnC,EAAA,OAAA,CAAQ,MAAA,CAAO,IAAA,EAAM;AAAA,IACnB,KAAK,OAAA;AACH,MAAA,OAAO,SAAA,CAAU,IAAA,CAAK,KAAA,CAAM,IAAA,EAAM,OAAO,EAAA,EAAI,MAAM,CAAA;AAAA,IACrD,KAAK,MAAA;AACH,MAAA,OAAO,SAAA,CAAU,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,OAAO,EAAA,EAAI,MAAM,CAAA;AAAA,IACpD,KAAK,WAAA,EAAa;AAOhB,MAAA,MAAM,QAAA,EAAU,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC9B,MAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,QAAA,EAAU,GAAG,EAAA,EAAI,aAAA,EAAe;AACjD,QAAA,OAAO,SAAA,CAAU,QAAA,CAAS,GAAG,EAAA,EAAI,MAAM,CAAA;AAAA,MACzC;AAEA,MAAA,MAAM,KAAA,EAAO,QAAA,EAAU,EAAA,IAAM,EAAA,EAAI,QAAA,EAAU,QAAA,EAAU,CAAA;AACrD,MAAA,OAAO,SAAA,CAAU,KAAA,EAAO,MAAM,CAAA;AAAA,IAChC;AAAA,IACA,OAAA;AACE,MAAA,OAAO,SAAA,CAAU,QAAA,CAAS,GAAG,EAAA,EAAI,MAAM,CAAA;AAAA,EAC3C;AACF;AAOA,SAAS,QAAA,CAAS,GAAA,EAAqB;AACrC,EAAA,MAAM,OAAA,EAAS,IAAA,GAAO,EAAA,EAAI,IAAA,EAAM,QAAA,EAAU,IAAA,EAAM,OAAA;AAChD,EAAA,OAAO,IAAA,GAAO,EAAA,EAAI,IAAA,CAAK,KAAA,CAAM,MAAM,EAAA,EAAI,CAAC,IAAA,CAAK,KAAA,CAAM,CAAC,MAAM,CAAA;AAC5D;AAUO,SAAS,GAAA,CAAI,KAAA,EAAe,SAAA,EAAmB,MAAA,EAAiC;AACrF,EAAA,OAAO,UAAA,CAAW,KAAA,EAAO,MAAM,EAAA,GAAK,UAAA,CAAW,SAAA,EAAW,MAAM,EAAA,EAAI,OAAA;AACtE;AAiBO,SAAS,YAAA,CAAa,KAAA,EAAe,KAAA,EAAqC;AAC/E,EAAA,IAAI,KAAA,EAAoB,IAAA;AACxB,EAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,KAAA,EAAO;AACxB,IAAA,GAAA,CAAI,MAAA,GAAS,IAAA,CAAK,IAAA,EAAM,QAAA,GAAA,CAAY,KAAA,IAAS,KAAA,GAAQ,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,GAAA,CAAA,EAAM;AACzE,MAAA,KAAA,EAAO,IAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;ADlGA;AACA;AEDO,SAAS,eAAA,CACd,QAAA,EACA,YAAA,EACA,QAAA,EAAkC,CAAC,CAAA,EACiB;AAMpD,EAAA,MAAM,QAAA,EAAU,QAAA,CAAS,IAAA;AAAA,IACvB,CAAC,SAAA,EAAA,GACC,SAAA,CAAU,cAAA,IAAkB,KAAA,GAC5B,SAAA,CAAU,MAAA,IAAU,KAAA,EAAA,GACpB,CAAC,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,KAAK;AAAA,EACpC,CAAA;AACA,EAAA,GAAA,CAAI,QAAA,IAAY,KAAA,CAAA,EAAW;AACzB,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ,CAAA,WAAA,EAAc,OAAA,CAAQ,IAAI,CAAA,0BAAA,EAA6B,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAC,CAAA,sCAAA;AAAA,IACtF,CAAA;AAAA,EACF;AAKA,EAAA,MAAM,OAAA,EAAS,QAAA,CAAS,IAAA;AAAA,IACtB,CAAC,SAAA,EAAA,GACC,SAAA,CAAU,cAAA,IAAkB,KAAA,GAC5B,SAAA,CAAU,SAAA,IAAa,KAAA,EAAA,GACvB,CAAA,CAAE,MAAA,CAAO,QAAA,CAAS,SAAA,CAAU,QAAQ,EAAA,GAAK,SAAA,CAAU,SAAA,EAAW,CAAA;AAAA,EAClE,CAAA;AACA,EAAA,GAAA,CAAI,OAAA,IAAW,KAAA,CAAA,EAAW;AACxB,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ,CAAA,WAAA,EAAc,MAAA,CAAO,IAAI,CAAA,oBAAA,EAAuB,MAAA,CAAO,MAAA,CAAO,QAAQ,CAAC,CAAA,uCAAA;AAAA,IACjF,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,EAAY,QAAA,CAAS,MAAA;AAAA,IACzB,CAAC,SAAA,EAAA,GAAc,SAAA,CAAU,cAAA,IAAkB,KAAA,GAAQ,OAAO,SAAA,CAAU,MAAA,IAAU;AAAA,EAChF,CAAA;AAGA,EAAA,MAAM,QAAA,EAAU,CAAC,SAAA,EAAA,GACd,SAAA,CAAU,MAAA,EAAA,kBAAoB,SAAA,CAAU,QAAA,UAAY,GAAA,CAAA;AAOvD,EAAA,MAAMA,SAAAA,EAAU,IAAA;AAChB,EAAA,MAAM,WAAA,EAAa,SAAA,CAAU,IAAA;AAAA,IAC3B,CAAC,SAAA,EAAA,GAAc,OAAA,CAAQ,SAAS,EAAA,EAAI,CAACA,SAAAA,GAAW,OAAA,CAAQ,SAAS,EAAA,EAAI,EAAA,EAAIA;AAAA,EAC3E,CAAA;AACA,EAAA,GAAA,CAAI,WAAA,IAAe,KAAA,CAAA,EAAW;AAC5B,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EACE,CAAA,WAAA,EAAc,UAAA,CAAW,IAAI,CAAA,YAAA,EAAe,UAAA,CAAW,KAAK,CAAA,QAAA,mBAAW,UAAA,CAAW,QAAA,UAAY,GAAC,CAAA,uKAAA;AAAA,IAGnG,CAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,SAAA,CAAU,OAAA,IAAW,CAAA,EAAG;AAC1B,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ;AAAA,IACV,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,YAAA,EAAc,SAAA,CAAU,MAAA,CAAO,CAAC,GAAA,EAAK,SAAA,EAAA,GAAc,IAAA,EAAA,kBAAO,SAAA,CAAU,MAAA,UAAU,GAAA,CAAA,EAAI,CAAC,CAAA;AACzF,EAAA,GAAA,CAAI,CAAA,CAAE,YAAA,EAAc,CAAA,CAAA,EAAI;AACtB,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EACE;AAAA,IACJ,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,EAAW,SAAA,CAAU,MAAA;AAAA,IACzB,CAAC,GAAA,EAAK,SAAA,EAAA,GAAc,IAAA,EAAM,OAAA,CAAQ,SAAS,EAAA,EAAA,kBAAK,SAAA,CAAU,MAAA,UAAU,GAAA,CAAA;AAAA,IACpE;AAAA,EACF,CAAA;AACA,EAAA,MAAM,SAAA,EAAW,SAAA,EAAW,WAAA;AAC5B,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC9B,IAAA,OAAO;AAAA,MACL,UAAA,EAAY,IAAA;AAAA,MACZ,MAAA,EAAQ;AAAA,IACV,CAAA;AAAA,EACF;AAGA,EAAA,MAAMC,OAAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAQ,CAAC,CAAA;AAE/C,EAAA,MAAM,OAAA,EACJ,OAAA,CAAQ,cAAA,IAAkB,KAAA,EAAA,EACtBA,OAAAA,GAAS,OAAA,CAAQ,cAAA,EACjB,aAAA,IAAiB,KAAA,EAAA,EACf,oBAAA,CAAqB,YAAA,EAAcA,MAAK,EAAA,EACxCA,OAAAA,GAAS,GAAA;AAEjB,EAAA,OAAO;AAAA,IACL,KAAA,EAAAA,MAAAA;AAAA,IACA,QAAA,EAAU,CAAA;AAAA,IACV,MAAA;AAAA,IACA,QAAA,mBAAU,OAAA,CAAQ,QAAA,UAAY,MAAA;AAAA,IAC9B,QAAA,EAAU,CAAC,GAAG,QAAQ;AAAA,EACxB,CAAA;AACF;AAQO,SAAS,gBAAA,CAAiB,KAAA,EAAiC;AAChE,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,QAAA;AAAA,IACR,KAAA;AAAA,IACA,KAAA,EAAO,KAAA,CAAM,KAAA;AAAA,IACb,QAAA,EAAU,KAAA,CAAM,QAAA;AAAA,IAChB,MAAA,EAAQ,KAAA,CAAM,MAAA;AAAA,IACd,QAAA,EAAU,KAAA,CAAM;AAAA,EAClB,CAAA;AACF;AAOO,SAAS,QAAA,CACd,OAAA,EACkE;AAClE,EAAA,OAAO,OAAA,CAAQ,OAAA,IAAW,SAAA,GAAY,OAAA,CAAQ,OAAA,IAAW,QAAA;AAC3D;AFzDA;AACA;AGYA,SAAS,MAAA,CAAO,IAAA,EAAoC;AAClD,EAAA,MAAM,EAAE,QAAQ,EAAA,EAAI,IAAA;AACpB,EAAA,GAAA,CAAI,QAAA,CAAS,OAAO,CAAA,EAAG;AACrB,IAAA,MAAM,IAAA,EAAM,OAAA,CAAQ,SAAA,EAAW,EAAA,EAAI,OAAA,CAAQ,SAAA,EAAW,CAAA;AACtD,IAAA,OAAO,EAAE,KAAA,EAAO,QAAA,EAAU,MAAA,EAAS,OAAA,CAAQ,MAAA,EAAQ,IAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAAA,EACxE;AACA,EAAA,GAAA,CAAI,OAAA,CAAQ,OAAA,IAAW,UAAA,EAAY;AACjC,IAAA,OAAO,EAAE,KAAA,EAAO,UAAU,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,aAAa,CAAA;AAC/B;AAYO,SAAS,sBAAA,CACd,QAAA,EACA,MAAA,EACiB;AACjB,EAAA,MAAM,WAAA,EAAuB,CAAC,CAAA;AAC9B,EAAA,MAAM,cAAA,EAA0B,CAAC,CAAA;AAGjC,EAAA,MAAM,SAAA,EAAW,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,EAAA,GAAY;AACzC,IAAA,IAAI,aAAA,EAAe,CAAA;AACnB,IAAA,IAAI,gBAAA,EAAkB,CAAA;AACtB,IAAA,IAAI,UAAA,EAAY,CAAA;AAChB,IAAA,MAAM,eAAA,EAA2B,CAAC,CAAA;AAClC,IAAA,MAAM,kBAAA,EAA8B,CAAC,CAAA;AAErC,IAAA,IAAA,CAAA,MAAW,KAAA,GAAQ,OAAA,CAAQ,KAAA,EAAO;AAChC,MAAA,UAAA,GAAa,IAAA,CAAK,MAAA;AAClB,MAAA,MAAM,aAAA,EAAe,MAAA,CAAO,IAAI,CAAA;AAChC,MAAA,GAAA,CAAI,YAAA,CAAa,MAAA,IAAU,SAAA,EAAW;AACpC,QAAA,cAAA,CAAe,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAC/B,QAAA,UAAA,CAAW,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAC3B,QAAA,QAAA;AAAA,MACF;AACA,MAAA,GAAA,CAAI,YAAA,CAAa,MAAA,IAAU,YAAA,EAAc;AACvC,QAAA,iBAAA,CAAkB,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAClC,QAAA,aAAA,CAAc,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAC9B,QAAA,QAAA;AAAA,MACF;AACA,MAAA,aAAA,GAAgB,YAAA,CAAa,MAAA;AAC7B,MAAA,gBAAA,GAAmB,IAAA,CAAK,MAAA;AAAA,IAC1B;AAEA,IAAA,MAAM,IAAA,EAAM,gBAAA,EAAkB,EAAA,EAAI,aAAA,EAAe,gBAAA,EAAkB,CAAA;AACnE,IAAA,MAAM,iBAAA,oCAAmB,OAAA,CAAQ,qBAAA,UAAyB,MAAA,CAAO,kBAAA,UAAoB,MAAA;AAErF,IAAA,OAAO;AAAA,MACL,OAAA;AAAA,MACA,YAAA;AAAA,MACA,eAAA;AAAA,MACA,SAAA;AAAA,MACA,KAAA,EAAO,UAAA,CAAW,GAAA,EAAK,MAAA,CAAO,QAAQ,CAAA;AAAA,MACtC,gBAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,IACF,CAAA;AAAA,EACF,CAAC,CAAA;AAUD,EAAA,MAAM,mBAAA,EAAqB,QAAA,CAAS,MAAA;AAAA,IAClC,CAAC,GAAA,EAAK,OAAA,EAAA,GAAY,IAAA,EAAA,CAAO,OAAA,CAAQ,gBAAA,EAAkB,EAAA,EAAI,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,CAAA,CAAA;AAAA,IAChF;AAAA,EACF,CAAA;AAEA,EAAA,MAAM,OAAA,EAAyB,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,EAAA,GAAA,CAAa;AAAA,IACxD,EAAA,EAAI,OAAA,CAAQ,OAAA,CAAQ,EAAA;AAAA,IACpB,GAAI,OAAA,CAAQ,OAAA,CAAQ,MAAA,IAAU,KAAA,EAAA,EAAY,EAAE,KAAA,EAAO,OAAA,CAAQ,OAAA,CAAQ,MAAM,EAAA,EAAI,CAAC,CAAA;AAAA,IAC9E,MAAA,EAAQ,OAAA,CAAQ,OAAA,CAAQ,MAAA;AAAA,IACxB,gBAAA,EACE,OAAA,CAAQ,gBAAA,EAAkB,EAAA,GAAK,mBAAA,EAAqB,EAAA,EAChD,OAAA,CAAQ,OAAA,CAAQ,OAAA,EAAS,mBAAA,EACzB,CAAA;AAAA,IACN,YAAA,EAAc,OAAA,CAAQ,YAAA;AAAA,IACtB,eAAA,EAAiB,OAAA,CAAQ,eAAA;AAAA,IACzB,SAAA,EAAW,OAAA,CAAQ,SAAA;AAAA,IACnB,KAAA,EAAO,OAAA,CAAQ,KAAA;AAAA;AAAA,IAEf,MAAA,EACE,OAAA,CAAQ,iBAAA,IAAqB,KAAA,GAAQ,OAAA,CAAQ,gBAAA,IAAoB,EAAA,EAC7D,KAAA,EACA,GAAA,CAAI,OAAA,CAAQ,KAAA,EAAO,OAAA,CAAQ,gBAAA,EAAkB,MAAA,CAAO,QAAQ,CAAA;AAAA,IAClE,gBAAA,EAAkB,OAAA,CAAQ,gBAAA;AAAA,IAC1B,cAAA,EAAgB,OAAA,CAAQ,cAAA;AAAA,IACxB,iBAAA,EAAmB,OAAA,CAAQ;AAAA,EAC7B,CAAA,CAAE,CAAA;AAEF,EAAA,MAAM,YAAA,EAAc,MAAA,CAAO,MAAA;AAAA,IACzB,CAAC,GAAA,EAAK,OAAA,EAAA,GAAY,IAAA,EAAM,OAAA,CAAQ,MAAA,EAAQ,OAAA,CAAQ,gBAAA;AAAA,IAChD;AAAA,EACF,CAAA;AACA,EAAA,MAAMA,OAAAA,EAAQ,UAAA,CAAW,WAAA,EAAa,MAAA,CAAO,QAAQ,CAAA;AAKrD,EAAA,MAAM,OAAA,EAAkC,UAAA,CAAW,OAAA,EAAS,EAAA,EAAI,cAAA,EAAgB,OAAA;AAEhF,EAAA,GAAA,CAAI,OAAA,IAAW,aAAA,EAAe;AAG5B,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,MAAA;AAAA,MACV,KAAA,EAAAA,MAAAA;AAAA,MACA,MAAA,EAAQ,IAAA;AAAA,MACR,iBAAA,EAAmB,IAAA;AAAA,MACnB,MAAA;AAAA,MACA,cAAA,EAAgB,UAAA;AAAA,MAChB,iBAAA,EAAmB;AAAA,IACrB,CAAA;AAAA,EACF;AAOA,EAAA,GAAA,CAAI,MAAA,CAAO,KAAA,CAAM,CAAC,OAAA,EAAA,GAAY,OAAA,CAAQ,gBAAA,IAAoB,CAAC,CAAA,EAAG;AAC5D,IAAA,OAAO;AAAA,MACL,QAAA,EAAU,MAAA;AAAA,MACV,KAAA,EAAAA,MAAAA;AAAA,MACA,MAAA,EAAQ,IAAA;AAAA,MACR,iBAAA,EAAmB,IAAA;AAAA,MACnB,MAAA;AAAA,MACA,cAAA,EAAgB,UAAA;AAAA,MAChB,iBAAA,EAAmB;AAAA,IACrB,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,UAAA,EAAY,GAAA,CAAIA,MAAAA,EAAO,MAAA,CAAO,aAAA,EAAe,MAAA,CAAO,QAAQ,CAAA;AAClE,EAAA,MAAM,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,CAAC,OAAA,EAAA,GAAY,OAAA,CAAQ,MAAM,CAAA;AAC3D,EAAA,MAAM,OAAA,EAAS,UAAA,GAAa,UAAA;AAE5B,EAAA,MAAM,kBAAA,EAAuC,OAAA,EACzC,KAAA,EACA,CAAC,UAAA,GAAa,CAAC,WAAA,EACb,OAAA,EACA,UAAA,EACE,0BAAA,EACA,yBAAA;AAER,EAAA,OAAO;AAAA,IACL,QAAA,EAAU,MAAA;AAAA,IACV,KAAA,EAAAA,MAAAA;AAAA,IACA,MAAA;AAAA,IACA,iBAAA;AAAA,IACA,MAAA;AAAA,IACA,cAAA,EAAgB,UAAA;AAAA,IAChB,iBAAA,EAAmB;AAAA,EACrB,CAAA;AACF;AHpEA;AACA;AI/NO,IAAM,uBAAA,EAAyB,GAAA;AAc/B,SAAS,oBAAA,CACd,YAAA,EACAA,MAAAA,EACA,QAAA,EACS;AACT,EAAA,MAAM,UAAA,mBAAY,YAAA,CAAa,aAAA,UAAiB,wBAAA;AAChD,EAAA,OAAO,SAAA,IAAa,KAAA,EAAA,EAAYA,OAAAA,GAAS,UAAA,EAAY,GAAA,CAAIA,MAAAA,EAAO,SAAA,EAAW,QAAQ,CAAA;AACrF;AAOA,SAAS,UAAA,CAAW,IAAA,EAAwB;AAC1C,EAAA,OACE,OAAO,KAAA,IAAS,SAAA,GAAY,KAAA,IAAS,KAAA,GAAS,IAAA,CAAgC,SAAA,IAAa,IAAA;AAE/F;AAQA,SAAS,cAAA,CAAe,YAAA,EAA4B,MAAA,EAAgC;AAClF,EAAA,MAAM,SAAA,EAAY,YAAA,CAAiD,QAAA;AACnE,EAAA,GAAA,CAAI,SAAA,IAAa,KAAA,CAAA,EAAW;AAC1B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,wBAAA,CAAQ,OAAA,EAAS,QAAA,CAAS,QAAA,EAAU,QAAA,CAAS,SAAA,CAAA,UAAc,MAAA;AAC7D;AAeO,SAAS,KAAA,CACd,YAAA,EACA,YAAA,EACA,eAAA,EACe;AACf,EAAA,MAAM,WAAA,EAAa,yDAAA,YAAsC,CAAA;AACzD,EAAA,GAAA,CAAI,WAAA,IAAe,KAAA,CAAA,EAAW;AAC5B,IAAA,MAAM,IAAI,+CAAA,CAAyB,MAAA,CAAO,YAAY,CAAC,CAAA;AAAA,EACzD;AACA,EAAA,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,KAAA,IAAS,UAAA,EAAY;AAC1C,IAAA,MAAM,IAAI,2CAAA,CAAqB,UAAA,CAAW,IAAI,CAAA;AAAA,EAChD;AACA,EAAA,GAAA,CAAI,UAAA,CAAW,YAAY,CAAA,EAAG;AAC5B,IAAA,MAAM,IAAI,2CAAA,CAAqB,UAAA,CAAW,IAAI,CAAA;AAAA,EAChD;AAEA,EAAA,MAAM,OAAA,EAAS,UAAA,CAAW,OAAA,CAAQ,KAAA,CAAM,YAAA,EAAc,eAAe,CAAA;AACrE,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,KAAK,CAAA,EAAG;AAClC,IAAA,MAAM,IAAI,2CAAA,CAAqB,UAAA,CAAW,IAAI,CAAA;AAAA,EAChD;AACA,EAAA,MAAM,OAAA,EAAS,oBAAA,CAAqB,YAAA,EAAc,MAAA,CAAO,KAAK,CAAA;AAC9D,EAAA,OAAO,EAAE,GAAG,MAAA,EAAQ,MAAA,EAAQ,QAAA,mBAAU,MAAA,CAAO,QAAA,UAAY,cAAA,CAAe,YAAA,EAAc,MAAM,IAAE,CAAA;AAChG;AAmBO,SAAS,QAAA,CAAS,IAAA,EAAoB,QAAA,EAAwC;AACnF,EAAA,MAAM,KAAA,EAAQ,IAAA,CAA4B,IAAA;AAC1C,EAAA,MAAM,WAAA,EAAa,OAAO,KAAA,IAAS,SAAA,EAAW,yDAAA,IAA8B,EAAA,EAAI,KAAA,CAAA;AAEhF,EAAA,GAAA,CAAI,WAAA,IAAe,KAAA,CAAA,EAAW;AAC5B,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,YAAA;AAAA,MACR,MAAA,EAAQ,CAAA,eAAA,EAAkB,MAAA,CAAO,IAAI,CAAC,CAAA,mBAAA,CAAA;AAAA,MACtC,QAAA,EAAU;AAAA,IACZ,CAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,KAAA,IAAS,UAAA,EAAY;AAC1C,IAAA,MAAM,QAAA,kBAAU,UAAA,mBAAW,OAAA,qBAAQ,OAAA,0BAAA,CAAU,IAAA,EAAM,QAAQ,GAAA;AAC3D,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,UAAA;AAAA,MACR,MAAA,EAAQ,UAAA,CAAW,OAAA,CAAQ,MAAA;AAAA,MAC3B,QAAA,EAAU,CAAA;AAAA,MACV,GAAI,QAAA,IAAY,KAAA,EAAA,EAAY,EAAE,QAAQ,EAAA,EAAI,CAAC;AAAA,IAC7C,CAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,UAAA,CAAW,IAAI,CAAA,EAAG;AACpB,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,YAAA;AAAA,MACR,MAAA,EACE,2HAAA;AAAA,MACF,QAAA,EAAU;AAAA,IACZ,CAAA;AAAA,EACF;AAEA,EAAA,MAAM,OAAA,EAAS,UAAA,CAAW,OAAA,CAAQ,KAAA,CAAM,IAAA,EAAM,QAAQ,CAAA;AACtD,EAAA,GAAA,CAAI,CAAC,MAAA,CAAO,QAAA,CAAS,MAAA,CAAO,KAAK,CAAA,EAAG;AAIlC,IAAA,OAAO;AAAA,MACL,MAAA,EAAQ,YAAA;AAAA,MACR,MAAA,EAAQ,CAAA,SAAA,EAAY,UAAA,CAAW,IAAI,CAAA,+DAAA,CAAA;AAAA,MACnC,QAAA,EAAU,MAAA,CAAO;AAAA,IACnB,CAAA;AAAA,EACF;AACA,EAAA,MAAM,OAAA,EAAS,oBAAA,CAAqB,IAAA,EAAM,MAAA,CAAO,KAAK,CAAA;AACtD,EAAA,OAAO;AAAA,IACL,MAAA,EAAQ,QAAA;AAAA,IACR,KAAA,EAAO,MAAA,CAAO,KAAA;AAAA,IACd,QAAA,EAAU,MAAA,CAAO,QAAA;AAAA,IACjB,MAAA;AAAA,IACA,QAAA,mBAAU,MAAA,CAAO,QAAA,UAAY,cAAA,CAAe,IAAA,EAAM,MAAM,GAAA;AAAA,IACxD,OAAA,EAAS,MAAA,CAAO;AAAA,EAClB,CAAA;AACF;AJoJA;AACA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,waAAC","file":"/home/runner/work/learning-kit/learning-kit/packages/lk-core/dist/chunk-YJZY5TPY.cjs","sourcesContent":[null,"/**\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 *\n * Scores need not be in [0,1]: set `maxScore` on a criterion to declare what\n * its score is out of, and each is normalised before weighting. A grader\n * working out of 100 says so and is done:\n *\n * ```ts\n * gradeFromRubric([\n *   { name: 'Task achievement', score: 82, maxScore: 100, weight: 2 },\n *   { name: 'Range',            score: 7,  maxScore: 9,   weight: 1 },\n * ]);\n * ```\n *\n * The returned `GradeRecord.score` is always scaled [0,1] against\n * `maxScore: 1`, like every other score in the SDK.\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  // A `maxScore` that is absent means 1 (the scaled convention). One that is\n  // present must be a positive finite number: dividing by 0, a negative, or a\n  // NaN would produce a grade nobody can defend.\n  const badMax = criteria.find(\n    (criterion) =>\n      criterion.notApplicable !== true &&\n      criterion.maxScore !== undefined &&\n      !(Number.isFinite(criterion.maxScore) && criterion.maxScore > 0),\n  );\n  if (badMax !== undefined) {\n    return {\n      unscorable: true,\n      reason: `Criterion \"${badMax.name}\" declares maxScore ${String(badMax.maxScore)}; it must be a positive, finite number.`,\n    };\n  }\n\n  const scoreable = criteria.filter(\n    (criterion) => criterion.notApplicable !== true && typeof criterion.score === 'number',\n  );\n\n  /** The criterion's score as a ratio in [0,1]. `maxScore` defaults to 1. */\n  const ratioOf = (criterion: CriterionScore): number =>\n    (criterion.score as number) / (criterion.maxScore ?? 1);\n\n  // A grader that returns raw points (4 out of 5) without declaring\n  // `maxScore: 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 further down.\n  const EPSILON = 1e-9;\n  const outOfRange = scoreable.find(\n    (criterion) => ratioOf(criterion) < -EPSILON || ratioOf(criterion) > 1 + EPSILON,\n  );\n  if (outOfRange !== undefined) {\n    return {\n      unscorable: true,\n      reason:\n        `Criterion \"${outOfRange.name}\" has score ${outOfRange.score} out of ${outOfRange.maxScore ?? 1}, ` +\n        'which is outside the [0,1] range once scaled. Set `maxScore` on the criterion to declare what the ' +\n        'score is out of (e.g. `maxScore: 100` for a 0–100 grader).',\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 + ratioOf(criterion) * (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"]}