@photivra/engine 1.5.0 → 2.0.0

package/dist/capture/linear-encoding.js.map

@@ -1 +1 @@
-{"version":3,"file":"linear-encoding.js","sourceRoot":"","sources":["../../src/capture/linear-encoding.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;;GAQG;AAEH,OAAO,EAAE,wBAAwB,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAC1F,OAAO,EAAE,gBAAgB,EAA0B,MAAM,+BAA+B,CAAC;AACzF,OAAO,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAgF,MAAM,wBAAwB,CAAC;AAE7I,MAAM,CAAC,MAAM,sCAAsC,GAAG,OAAgB,CAAC;AAcvE,SAAS,MAAM,CAAC,KAAc,EAAE,IAAuB;IACrD,OAAO,wBAAwB,CAAC,KAAK,EAAE,IAAI,EAAE,iCAAiC,CAAC,CAAC;AAClF,CAAC;AACD,2FAA2F;AAC3F,MAAM,UAAU,0BAA0B,CAAC,KAAc;IACvD,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,eAAe,EAAE,YAAY,EAAE,WAAW,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC,CAAC;IACxI,IAAI,CAAC,CAAC,aAAa,KAAK,sCAAsC,IAAI,OAAO,CAAC,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;QAChI,OAAO,CAAC,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,KAAK;QAC3G,OAAO,CAAC,CAAC,kBAAkB,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,kBAAkB,GAAG,KAAK;QAC1J,CAAC,CAAC,CAAC,cAAc,KAAK,2BAA2B,IAAI,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC;QACnF,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,iBAAiB,EAAE,CAAC;QAC/F,MAAM,IAAI,yBAAyB,CAAC,mDAAmD,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,EAAE,aAAa,EAAE,sCAAsC,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU;QACxH,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,kBAAkB,EAAE,CAAC,CAAC,kBAAkB,EAAE,cAAc,EAAE,CAAC,CAAC,cAAc;QAClG,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AACrD,CAAC;AAmCD;;;;GAIG;AACH,MAAM,UAAU,8BAA8B,CAAC,KAAiC;IAC9E,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAAE,UAAU,CAAC,CAAC,CAAC;IAClF,MAAM,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,GAAG,0BAA0B,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACpG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC;QAC5B,CAAC,CAAC,oBAAoB,EAAE,yBAAyB,EAAE,8BAA8B,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAA4B,CAAC,EAAE,CAAC;QAChI,MAAM,IAAI,yBAAyB,CAAC,wCAAwC,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC;IAC7D,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,UAAU,KAAK,CAAC,CAAC,kBAAkB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnG,MAAM,IAAI,yBAAyB,CAAC,sEAAsE,CAAC,CAAC;IAC9G,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,mBAAmB,GAAC,QAAQ,CAAC,UAAU,CAAC;IAC5D,MAAM,SAAS,GAAG,QAAQ,CAAC,kBAAkB,GAAC,QAAQ,CAAC,SAAS,CAAC;IACjE,MAAM,KAAK,GAAG,SAAS,GAAC,KAAK,CAAC;IAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,GAAC,QAAQ,CAAC,SAAS,GAAC,KAAK,CAAC;IAC7D,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,GAAC,CAAC,KAAK,GAAC,QAAQ,CAAC,SAAS,CAAC,GAAC,KAAK,CAAC;IACrE,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAC,OAAO,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACzG,OAAO,GAAG,QAAQ,CAAC,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,mBAAmB,IAAI,OAAO,IAAI,OAAO;QAC1F,CAAC,QAAQ,CAAC,SAAS,GAAG,CAAC,IAAI,OAAO,KAAK,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,yBAAyB,CAAC,6DAA6D,CAAC,CAAC;IACrG,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;IACtB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QACnD,IAAI,QAAQ,CAAC,cAAc,KAAK,QAAQ,IAAI,MAAM,GAAG,CAAC;YAAE,MAAM,IAAI,yBAAyB,CAAC,yDAAyD,CAAC,CAAC;QACvJ,+FAA+F;QAC/F,IAAI,MAAM,GAAG,OAAO,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,UAAU,KAAK,QAAQ;gBAAE,MAAM,IAAI,yBAAyB,CAAC,yCAAyC,CAAC,CAAC;YACrH,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;gBAAC,GAAG,EAAE,CAAC;gBAAC,OAAO,CAAC,CAAC;YAAC,CAAC;YAC1C,IAAI,EAAE,CAAC;YAAC,OAAO,KAAK,CAAC;QACvB,CAAC;QACD,IAAI,MAAM,KAAK,OAAO;YAAE,OAAO,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,MAAM,KAAK,QAAQ,CAAC,UAAU;YAAE,OAAO,QAAQ,CAAC,SAAS,CAAC;QAC9D,IAAI,MAAM,KAAK,KAAK,CAAC,mBAAmB;YAAE,OAAO,QAAQ,CAAC,kBAAkB,CAAC;QAC7E,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,GAAC,CAAC,MAAM,GAAC,QAAQ,CAAC,UAAU,CAAC,GAAC,KAAK,GAAC,SAAS,CAAC;QAC/E,+FAA+F;QAC/F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IACH,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,WAAW,EAAE,GAAG,KAAK,CAAC;IACpD,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,CAAC;IACxD,KAAK,QAAQ,CAAC;IAAC,KAAK,OAAO,CAAC,CAAC,uEAAuE;IACpG,OAAO,gBAAgB,CAAC,EAAE,aAAa,EAAE,sCAAsC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,eAAe,EAAE,WAAW;QACzI,QAAQ,EAAE,YAAY,EAAE,uBAAuB,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK;QACjG,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,EAAE,KAAK,EAAE,yBAAyB,EAAE,OAAO,EAAE,yBAAyB,EAAE,OAAO;QAC7H,cAAc,EAAE,CAAC,KAAK,GAAC,QAAQ,CAAC,SAAS,CAAC,GAAC,SAAS,EAAE,oBAAoB,EAAE,EAAE,GAAC,KAAK;QACpF,qBAAqB,EAAE,GAAG,EAAE,sBAAsB,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,OAAO,EAAE,EACvG,+BAA+B,EAAE,sCAAsC,EACvE,CAAC,oGAAoG;QACnG,gGAAgG;QAChG,mGAAmG,CAAC,CAAC,CAAC;AAC1G,CAAC"}
+{"version":3,"file":"linear-encoding.js","sourceRoot":"","sources":["../../src/capture/linear-encoding.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;GAKG;AAEH,OAAO,EAAE,wBAAwB,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAC1F,OAAO,EAAE,gBAAgB,EAA0B,MAAM,+BAA+B,CAAC;AACzF,OAAO,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAgF,MAAM,wBAAwB,CAAC;AAE7I,MAAM,CAAC,MAAM,sCAAsC,GAAG,OAAgB,CAAC;AACvE,sHAAsH;AACtH,MAAM,CAAC,MAAM,qCAAqC,GAAG,OAAgB,CAAC;AActE,SAAS,MAAM,CAAC,KAAc,EAAE,IAAuB;IACrD,OAAO,wBAAwB,CAAC,KAAK,EAAE,IAAI,EAAE,iCAAiC,CAAC,CAAC;AAClF,CAAC;AACD,oGAAoG;AACpG,MAAM,UAAU,0BAA0B,CAAC,KAAc;IACvD,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,eAAe,EAAE,YAAY,EAAE,WAAW,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC,CAAC;IACxI,IAAI,CAAC,CAAC,aAAa,KAAK,sCAAsC,IAAI,OAAO,CAAC,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;QAChI,OAAO,CAAC,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,KAAK;QAC3G,OAAO,CAAC,CAAC,kBAAkB,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,kBAAkB,GAAG,KAAK;QAC1J,CAAC,CAAC,CAAC,cAAc,KAAK,2BAA2B,IAAI,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC;QACnF,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,iBAAiB,EAAE,CAAC;QAC/F,MAAM,IAAI,yBAAyB,CAAC,mDAAmD,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,EAAE,aAAa,EAAE,sCAAsC,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU;QACxH,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,kBAAkB,EAAE,CAAC,CAAC,kBAAkB,EAAE,cAAc,EAAE,CAAC,CAAC,cAAc;QAClG,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AACrD,CAAC;AAmCD;;;;;GAKG;AACH,MAAM,UAAU,8BAA8B,CAAC,KAAiC;IAC9E,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAAE,UAAU,CAAC,CAAC,CAAC;IAClF,MAAM,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,GAAG,0BAA0B,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACpG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC;QAC5B,CAAC,CAAC,oBAAoB,EAAE,yBAAyB,EAAE,8BAA8B,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAA4B,CAAC,EAAE,CAAC;QAChI,MAAM,IAAI,yBAAyB,CAAC,wCAAwC,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC;IAC7D,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,UAAU,KAAK,CAAC,CAAC,kBAAkB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnG,MAAM,IAAI,yBAAyB,CAAC,sEAAsE,CAAC,CAAC;IAC9G,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,mBAAmB,GAAC,QAAQ,CAAC,UAAU,CAAC;IAC5D,MAAM,SAAS,GAAG,QAAQ,CAAC,kBAAkB,GAAC,QAAQ,CAAC,SAAS,CAAC;IACjE,MAAM,KAAK,GAAG,SAAS,GAAC,KAAK,CAAC;IAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,GAAC,QAAQ,CAAC,SAAS,GAAC,KAAK,CAAC;IAC7D,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,GAAC,CAAC,KAAK,GAAC,QAAQ,CAAC,SAAS,CAAC,GAAC,KAAK,CAAC;IACrE,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAC,OAAO,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACzG,OAAO,GAAG,QAAQ,CAAC,UAAU,IAAI,OAAO,GAAG,KAAK,CAAC,mBAAmB,IAAI,OAAO,IAAI,OAAO;QAC1F,CAAC,QAAQ,CAAC,SAAS,GAAG,CAAC,IAAI,OAAO,KAAK,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,yBAAyB,CAAC,6DAA6D,CAAC,CAAC;IACrG,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;IACtB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QACnD,IAAI,QAAQ,CAAC,cAAc,KAAK,QAAQ,IAAI,MAAM,GAAG,CAAC;YAAE,MAAM,IAAI,yBAAyB,CAAC,yDAAyD,CAAC,CAAC;QACvJ,yGAAyG;QACzG,IAAI,MAAM,GAAG,OAAO,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,UAAU,KAAK,QAAQ;gBAAE,MAAM,IAAI,yBAAyB,CAAC,yCAAyC,CAAC,CAAC;YACrH,IAAI,MAAM,GAAG,OAAO,EAAE,CAAC;gBAAC,GAAG,EAAE,CAAC;gBAAC,OAAO,CAAC,CAAC;YAAC,CAAC;YAC1C,IAAI,EAAE,CAAC;YAAC,OAAO,KAAK,CAAC;QACvB,CAAC;QACD,IAAI,MAAM,KAAK,OAAO;YAAE,OAAO,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,MAAM,KAAK,QAAQ,CAAC,UAAU;YAAE,OAAO,QAAQ,CAAC,SAAS,CAAC;QAC9D,IAAI,MAAM,KAAK,KAAK,CAAC,mBAAmB;YAAE,OAAO,QAAQ,CAAC,kBAAkB,CAAC;QAC7E,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,GAAC,CAAC,MAAM,GAAC,QAAQ,CAAC,UAAU,CAAC,GAAC,KAAK,GAAC,SAAS,CAAC;QAC/E,kGAAkG;QAClG,+FAA+F;QAC/F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IACH,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,WAAW,EAAE,GAAG,KAAK,CAAC;IACpD,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,CAAC;IACxD,KAAK,QAAQ,CAAC;IAAC,KAAK,OAAO,CAAC,CAAC,6EAA6E;IAC1G,OAAO,gBAAgB,CAAC,EAAE,aAAa,EAAE,sCAAsC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,eAAe,EAAE,WAAW;QACzI,QAAQ,EAAE,YAAY,EAAE,uBAAuB,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK;QACjG,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,EAAE,KAAK,EAAE,yBAAyB,EAAE,OAAO,EAAE,yBAAyB,EAAE,OAAO;QAC7H,cAAc,EAAE,CAAC,KAAK,GAAC,QAAQ,CAAC,SAAS,CAAC,GAAC,SAAS,EAAE,oBAAoB,EAAE,EAAE,GAAC,KAAK;QACpF,qBAAqB,EAAE,GAAG,EAAE,sBAAsB,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,OAAO,EAAE,EACvG,+BAA+B,EAAE,qCAAqC,EACtE,CAAC,oGAAoG;QACnG,gGAAgG;QAChG,mGAAmG,CAAC,CAAC,CAAC;AAC1G,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * Linear capture encoding: converts a floating-point capture plane to 16-bit unsigned integer\n * codes with a uniform linear mapping. The capture itself is not changed.\n * @see docs/LINEAR_CAPTURE_ENCODING.md for equations, coordinate/unit conventions, blockers and\n * support limits.\n */\n\nimport { requireAllowlistedRecord, isPublicOpaqueId } from \"../core/record-validation.js\";\nimport { calculatedResult, type CalculationResult } from \"../core/calculation-result.js\";\nimport { InvalidConfigurationError } from \"../core/configuration-error.js\";\nimport { parseSimulatedCapture, type SimulatedCapture, type CaptureLinearPlane, type CaptureLinearImageState } from \"./simulated-capture.js\";\n\nexport const LINEAR_CAPTURE_ENCODING_SCHEMA_VERSION = \"0.1.0\" as const;\n/** Version of the `uniform-linear-capture-uint16` model. 0.2.0 made rounding exact: nearest, ties up (Math.round). */\nexport const LINEAR_CAPTURE_ENCODING_MODEL_VERSION = \"0.2.0\" as const;\n/** The same linear mapping for every channel. The reference white value comes from the source plane. */\nexport interface LinearCaptureEncoding {\n  schemaVersion: typeof LINEAR_CAPTURE_ENCODING_SCHEMA_VERSION;\n  /** Relative source sample value assigned blackCode; may be negative. */\n  blackValue: number;\n  /** Integer code for blackValue, 0..65534. A nonzero offset can keep negative samples. */\n  blackCode: number;\n  /** Code at the plane's referenceWhiteValue, strictly above blackCode, at most 65535. */\n  referenceWhiteCode: number;\n  negativeValues: \"preserve-if-representable\" | \"reject\";\n  outOfRange: \"clip\" | \"reject\";\n  rounding: \"nearest-ties-up\";\n}\nfunction record(value: unknown, keys: readonly string[]): Record<string, unknown> {\n  return requireAllowlistedRecord(value, keys, \"Invalid linear encoding fields.\");\n}\n/** Strictly parses an encoding profile. It never fills in a default clipping or rounding policy. */\nexport function parseLinearCaptureEncoding(value: unknown): LinearCaptureEncoding {\n  const r = record(value, [\"schemaVersion\", \"blackValue\", \"blackCode\", \"referenceWhiteCode\", \"negativeValues\", \"outOfRange\", \"rounding\"]);\n  if (r.schemaVersion !== LINEAR_CAPTURE_ENCODING_SCHEMA_VERSION || typeof r.blackValue !== \"number\" || !Number.isFinite(r.blackValue) ||\n      typeof r.blackCode !== \"number\" || !Number.isInteger(r.blackCode) || r.blackCode < 0 || r.blackCode > 65534 ||\n      typeof r.referenceWhiteCode !== \"number\" || !Number.isInteger(r.referenceWhiteCode) || r.referenceWhiteCode <= r.blackCode || r.referenceWhiteCode > 65535 ||\n      (r.negativeValues !== \"preserve-if-representable\" && r.negativeValues !== \"reject\") ||\n      (r.outOfRange !== \"clip\" && r.outOfRange !== \"reject\") || r.rounding !== \"nearest-ties-up\") {\n    throw new InvalidConfigurationError(\"Invalid linear encoding range or explicit policy.\");\n  }\n  return { schemaVersion: LINEAR_CAPTURE_ENCODING_SCHEMA_VERSION, blackValue: Object.is(r.blackValue, -0) ? 0 : r.blackValue,\n    blackCode: r.blackCode, referenceWhiteCode: r.referenceWhiteCode, negativeValues: r.negativeValues,\n    outOfRange: r.outOfRange, rounding: r.rounding };\n}\nexport interface LinearCaptureEncodingInput {\n  capture: SimulatedCapture;\n  planeId: string;\n  /** Identifies the exact source plane, so a plane with a different meaning cannot be swapped in. */\n  requiredImageState: CaptureLinearImageState;\n  encoding: LinearCaptureEncoding;\n}\n/** 16-bit unsigned codes, not tied to a file format. The metadata keeps their colour, white-balance (WB) and saturation meaning. */\nexport interface EncodedLinearCapture {\n  schemaVersion: typeof LINEAR_CAPTURE_ENCODING_SCHEMA_VERSION;\n  captureId: string;\n  /** Cleaned-up copy of the capture's geometry, settings, WB, adopted white and model provenance, without the float planes. */\n  captureMetadata: Omit<SimulatedCapture, \"planes\">;\n  sourcePlane: Omit<CaptureLinearPlane, \"storage\">;\n  encoding: LinearCaptureEncoding;\n  sampleLayout: \"row-major-interleaved\";\n  bitDepth: 16;\n  codeMinimum: 0;\n  codeMaximum: 65535;\n  referenceWhiteValue: number;\n  /** Codes per relative source unit; same scale for all channels. */\n  scale: number;\n  minimumRepresentableValue: number;\n  maximumRepresentableValue: number;\n  /** Headroom: (maximum value − black) / (reference white − black). */\n  headroomFactor: number;\n  /** Largest rounding error for in-range samples, 0.5/scale. Clipping error is not included. */\n  maximumRoundingError: number;\n  clippedLowSampleCount: number;\n  clippedHighSampleCount: number;\n  /** Linear encoding never picks a default rendering exposure or display white. */\n  defaultRenderingExposureEv: null;\n  samples: readonly number[];\n}\n/**\n * Converts one inline float plane to integer codes. The capture data is not changed.\n *\n * Mapping: blackCode + (sample-blackValue)/(referenceWhiteValue-blackValue)\n * * (referenceWhiteCode-blackCode). It clips only when the policy says so, then rounds.\n */\nexport function calculateLinearCaptureEncoding(input: LinearCaptureEncodingInput): CalculationResult<EncodedLinearCapture> {\n  const r = record(input, [\"capture\", \"planeId\", \"requiredImageState\", \"encoding\"]);\n  const capture = parseSimulatedCapture(r.capture), encoding = parseLinearCaptureEncoding(r.encoding);\n  if (!isPublicOpaqueId(r.planeId) ||\n      ![\"scene-referred-xyz\", \"virtual-sensor-channels\", \"color-transformed-linear-rgb\"].includes(r.requiredImageState as string)) {\n    throw new InvalidConfigurationError(\"Invalid encoding plane/state identity.\");\n  }\n  const plane = capture.planes.find((p) => p.id === r.planeId);\n  if (!plane || plane.imageState !== r.requiredImageState || plane.storage.kind !== \"inline-float64\") {\n    throw new InvalidConfigurationError(\"Encoding requires the exact image state and verified inline samples.\");\n  }\n  const width = plane.referenceWhiteValue-encoding.blackValue;\n  const codeWidth = encoding.referenceWhiteCode-encoding.blackCode;\n  const scale = codeWidth/width;\n  const minimum = encoding.blackValue-encoding.blackCode/scale;\n  const maximum = encoding.blackValue+(65535-encoding.blackCode)/scale;\n  if (!(width > 0) || ![width, scale, minimum, maximum, maximum-minimum].every(Number.isFinite) || !(scale > 0) ||\n      minimum > encoding.blackValue || maximum < plane.referenceWhiteValue || maximum <= minimum ||\n      (encoding.blackCode > 0 && minimum === encoding.blackValue)) {\n    throw new InvalidConfigurationError(\"Linear encoding cannot represent the declared finite range.\");\n  }\n  let low = 0, high = 0;\n  const samples = plane.storage.samples.map((sample) => {\n    if (encoding.negativeValues === \"reject\" && sample < 0) throw new InvalidConfigurationError(\"Negative source values are rejected by encoding policy.\");\n    // Compare against the limits in source units first, so a huge finite value can clip without overflowing.\n    if (sample < minimum || sample > maximum) {\n      if (encoding.outOfRange === \"reject\") throw new InvalidConfigurationError(\"Source value exceeds the encoded range.\");\n      if (sample < minimum) { low++; return 0; }\n      high++; return 65535;\n    }\n    if (sample === minimum) return 0;\n    if (sample === maximum) return 65535;\n    if (sample === encoding.blackValue) return encoding.blackCode;\n    if (sample === plane.referenceWhiteValue) return encoding.referenceWhiteCode;\n    const mapped = encoding.blackCode+(sample-encoding.blackValue)/width*codeWidth;\n    // Round to nearest; exact ties go to the larger code (Math.round; Math.floor(x+.5) wrongly rounds\n    // 0.49999999999999994 up). Clamp only rounding error at the end points; Math.max(0, -0) is +0.\n    return Math.max(0, Math.min(65535, Math.round(mapped)));\n  });\n  const { storage: _storage, ...sourcePlane } = plane;\n  const { planes: _planes, ...captureMetadata } = capture;\n  void _storage; void _planes; // The float sample arrays are deliberately left out of the encoded metadata.\n  return calculatedResult({ schemaVersion: LINEAR_CAPTURE_ENCODING_SCHEMA_VERSION, captureId: capture.captureId, captureMetadata, sourcePlane,\n    encoding, sampleLayout: \"row-major-interleaved\", bitDepth: 16, codeMinimum: 0, codeMaximum: 65535,\n    referenceWhiteValue: plane.referenceWhiteValue, scale, minimumRepresentableValue: minimum, maximumRepresentableValue: maximum,\n    headroomFactor: (65535-encoding.blackCode)/codeWidth, maximumRoundingError: .5/scale,\n    clippedLowSampleCount: low, clippedHighSampleCount: high, defaultRenderingExposureEv: null, samples },\n  \"uniform-linear-capture-uint16\", LINEAR_CAPTURE_ENCODING_MODEL_VERSION,\n  [\"Deterministic unsigned linear codes; no dithering, transfer curve, tone mapping or serializer tags\",\n    \"Reference white, capture saturation history, integer maximum and display white remain separate\",\n    \"In-range error bound covers ideal rounding only; binary64 arithmetic can add floating-point error\"]);\n}\n"]}

package/dist/capture/lossless-jpeg.d.ts

@@ -0,0 +1,27 @@
+/** Decoded lossless JPEG samples, interleaved by component within each line (line, x, component). */
+export interface LosslessJpegImage {
+    /** Samples per line (X in the frame header). */
+    width: number;
+    /** Lines (Y in the frame header). */
+    height: number;
+    components: number;
+    /** Sample precision P in bits, 2..16. */
+    precision: number;
+    predictor: number;
+    pointTransform: number;
+    samples: Uint16Array;
+}
+export interface LosslessJpegLimits {
+    /** Largest width x height x components accepted. Checked before output is allocated. */
+    maximumSamples: number;
+    /**
+     * DNG files with DNGVersion below 1.1.0.0 store 16 extra bits after the SSSS = 16 difference category
+     * (DNG 1.7.1.0 specification, Compatibility Issue 2). Standard streams store none.
+     */
+    legacySixteenBitDifference?: boolean;
+}
+/**
+ * Decodes one lossless JPEG stream. Every length, count and table index is checked against the
+ * buffer. Output is allocated only after the declared size passes `limits.maximumSamples`.
+ */
+export declare function parseLosslessJpeg(bytes: Uint8Array, limits: LosslessJpegLimits): LosslessJpegImage;

package/dist/capture/lossless-jpeg.js

@@ -0,0 +1,237 @@
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Size-limited decoder for lossless Huffman JPEG (ITU-T T.81 | ISO/IEC 10918-1, Annex H, process 14,
+ * SOF3), the variant DNG uses for Compression = 7 raw data. Written independently from the published
+ * standard, with no third-party decoder source. Browser-safe: plain typed arrays, no I/O.
+ *
+ * Supported: one SOF3 frame, precision 2..16, 1..4 components with 1x1 sampling, one interleaved scan
+ * over all components, predictors 1..7, point transform, DRI restart intervals, 0xFF00 byte stuffing.
+ * Rejected: hierarchical/DCT/arithmetic frames, multiple scans, subsampled components, truncated data.
+ */
+import { rejectUnknownFields } from "../core/record-validation.js";
+import { InvalidConfigurationError } from "../core/configuration-error.js";
+function fail(message) { throw new InvalidConfigurationError("Lossless JPEG: " + message); }
+/** T.81 Annex C code generation and F.2.2.3 decoder tables (MINCODE, MAXCODE, VALPTR). */
+function buildTable(counts, values) {
+    const maxCode = new Int32Array(17).fill(-1), minCode = new Int32Array(17), valPtr = new Int32Array(17);
+    let code = 0, k = 0;
+    for (let length = 1; length <= 16; length++) {
+        const n = counts[length - 1];
+        if (n) {
+            valPtr[length] = k;
+            minCode[length] = code;
+            code += n;
+            k += n;
+            maxCode[length] = code - 1;
+        }
+        // Canonical codes of `length` bits must fit in `length` bits.
+        if (code > (1 << length))
+            fail("over-subscribed Huffman table.");
+        code <<= 1;
+    }
+    return { maxCode, minCode, valPtr, values };
+}
+/**
+ * Decodes one lossless JPEG stream. Every length, count and table index is checked against the
+ * buffer. Output is allocated only after the declared size passes `limits.maximumSamples`.
+ */
+export function parseLosslessJpeg(bytes, limits) {
+    if (!(bytes instanceof Uint8Array))
+        fail("input must be a Uint8Array.");
+    if (limits === null || typeof limits !== "object" || Array.isArray(limits))
+        fail("limits must be an object.");
+    rejectUnknownFields(limits, ["maximumSamples", "legacySixteenBitDifference"], "Lossless JPEG limits");
+    if (!Number.isSafeInteger(limits.maximumSamples) || limits.maximumSamples < 1)
+        fail("invalid sample limit.");
+    const length = bytes.length;
+    if (length < 4 || bytes[0] !== 0xff || bytes[1] !== 0xd8)
+        fail("missing SOI marker.");
+    const tables = [];
+    let frame;
+    let restartInterval = 0, p = 2;
+    for (;;) {
+        while (p < length && bytes[p] === 0xff && bytes[p + 1] === 0xff)
+            p++; // fill bytes before a marker
+        if (p + 4 > length || bytes[p] !== 0xff)
+            fail("malformed marker segment.");
+        const marker = bytes[p + 1];
+        if (marker === 0xd9)
+            fail("no scan before EOI.");
+        const size = bytes[p + 2] * 256 + bytes[p + 3], start = p + 4, end = p + 2 + size;
+        if (size < 2 || end > length)
+            fail("segment exceeds the stream.");
+        if (marker === 0xc4) {
+            let q = start;
+            while (q < end) {
+                const tc = bytes[q] >> 4, th = bytes[q] & 15;
+                if (tc !== 0 || th > 3 || q + 17 > end)
+                    fail("invalid Huffman table.");
+                const counts = bytes.subarray(q + 1, q + 17);
+                let total = 0;
+                for (const c of counts)
+                    total += c;
+                if (total > 256 || q + 17 + total > end)
+                    fail("Huffman table exceeds its segment.");
+                tables[th] = buildTable(counts, bytes.slice(q + 17, q + 17 + total));
+                q += 17 + total;
+            }
+        }
+        else if (marker === 0xc3) {
+            if (frame || size < 8)
+                fail("unexpected frame header.");
+            const precision = bytes[start], height = bytes[start + 1] * 256 + bytes[start + 2], width = bytes[start + 3] * 256 + bytes[start + 4], nf = bytes[start + 5];
+            if (precision < 2 || precision > 16 || height < 1 || width < 1 || nf < 1 || nf > 4 || size !== 8 + 3 * nf)
+                fail("unsupported frame header.");
+            const ids = [];
+            for (let i = 0; i < nf; i++) {
+                const o = start + 6 + i * 3;
+                if (bytes[o + 1] !== 0x11)
+                    fail("only 1x1 component sampling is supported.");
+                if (ids.includes(bytes[o]))
+                    fail("duplicate component identifier.");
+                ids.push(bytes[o]);
+            }
+            if (width * height * nf > limits.maximumSamples)
+                fail("frame exceeds the sample limit.");
+            frame = { precision, height, width, ids };
+        }
+        else if (marker === 0xdd) {
+            if (size !== 4)
+                fail("invalid restart interval.");
+            restartInterval = bytes[start] * 256 + bytes[start + 1];
+        }
+        else if (marker === 0xda) {
+            if (!frame)
+                fail("scan before frame header.");
+            const ns = bytes[start];
+            if (ns !== frame.ids.length || size !== 6 + 2 * ns)
+                fail("only one interleaved scan over all components is supported.");
+            const selectors = [];
+            for (let i = 0; i < ns; i++) {
+                if (bytes[start + 1 + i * 2] !== frame.ids[i])
+                    fail("scan component order differs from the frame.");
+                const table = tables[bytes[start + 2 + i * 2] >> 4];
+                if (!table)
+                    fail("scan references an undefined Huffman table.");
+                selectors.push(table);
+            }
+            const predictor = bytes[start + 1 + 2 * ns], se = bytes[start + 2 + 2 * ns], ah = bytes[start + 3 + 2 * ns] >> 4, pt = bytes[start + 3 + 2 * ns] & 15;
+            if (predictor < 1 || predictor > 7 || se !== 0 || ah !== 0 || pt >= frame.precision)
+                fail("unsupported scan parameters.");
+            return decodeScan(bytes, end, frame, selectors, predictor, pt, restartInterval, limits.legacySixteenBitDifference === true);
+        }
+        else if (marker === 0xc0 || marker === 0xc1 || marker === 0xc2 || (marker >= 0xc5 && marker <= 0xcf && marker !== 0xc8 && marker !== 0xcc) || marker === 0xde) {
+            fail("only lossless Huffman SOF3 frames are supported.");
+        }
+        else if (marker < 0xc0 || marker === 0xd8 || (marker >= 0xd0 && marker <= 0xd7)) {
+            fail("unexpected marker.");
+        }
+        // APPn, COM, DQT and other non-frame segments are skipped by their declared length.
+        p = end;
+    }
+}
+function decodeScan(bytes, start, frame, selectors, predictor, pt, restartInterval, legacy) {
+    const { width, height, precision } = frame, nf = selectors.length, rowSamples = width * nf;
+    if (restartInterval !== 0 && restartInterval % width !== 0)
+        fail("restart interval must be a whole number of lines.");
+    const out = new Uint16Array(width * height * nf), modulus = 65536, valueLimit = 1 << (precision - pt);
+    let p = start, buffer = 0, bits = 0, padding = 0;
+    const fill = () => {
+        // Load one byte. 0xFF00 is a stuffed 0xFF. Any other marker ends the entropy-coded data; later reads return zero padding.
+        let byte = 0;
+        if (p < bytes.length && bytes[p] !== 0xff)
+            byte = bytes[p++];
+        else if (p + 1 < bytes.length && bytes[p] === 0xff && bytes[p + 1] === 0x00) {
+            byte = 0xff;
+            p += 2;
+        }
+        else if (++padding > 8)
+            fail("entropy-coded data is truncated.");
+        buffer = ((buffer << 8) | byte) >>> 0;
+        bits += 8;
+    };
+    const readBits = (count) => {
+        while (bits < count)
+            fill();
+        bits -= count;
+        return (buffer >>> bits) & ((1 << count) - 1);
+    };
+    const decodeCategory = (table) => {
+        let code = readBits(1), len = 1;
+        while (code > table.maxCode[len]) {
+            if (++len > 16)
+                fail("invalid Huffman code.");
+            code = (code << 1) | readBits(1);
+        }
+        const value = table.values[table.valPtr[len] + code - table.minCode[len]];
+        if (value === undefined || value > 16)
+            fail("invalid difference category.");
+        return value;
+    };
+    let linesSinceRestart = 0, restartIndex = 0;
+    for (let y = 0; y < height; y++) {
+        if (restartInterval && y > 0 && (y * width) % restartInterval === 0) {
+            // Byte-align, then require RSTm with m = restart count mod 8 (T.81 F.1.2.3, H.1.2.1).
+            bits = 0;
+            buffer = 0;
+            padding = 0;
+            if (p + 1 >= bytes.length || bytes[p] !== 0xff || bytes[p + 1] !== (0xd0 | (restartIndex & 7)))
+                fail("missing restart marker.");
+            p += 2;
+            restartIndex++;
+            linesSinceRestart = 0;
+        }
+        const row = y * rowSamples, above = row - rowSamples;
+        for (let x = 0; x < width; x++)
+            for (let c = 0; c < nf; c++) {
+                const i = row + x * nf + c;
+                let prediction;
+                if (linesSinceRestart === 0)
+                    prediction = x === 0 ? 1 << (precision - pt - 1) : out[i - nf];
+                else if (x === 0)
+                    prediction = out[above + c];
+                else {
+                    const ra = out[i - nf], rb = out[i - rowSamples], rc = out[i - rowSamples - nf];
+                    switch (predictor) {
+                        case 1:
+                            prediction = ra;
+                            break;
+                        case 2:
+                            prediction = rb;
+                            break;
+                        case 3:
+                            prediction = rc;
+                            break;
+                        case 4:
+                            prediction = ra + rb - rc;
+                            break;
+                        case 5:
+                            prediction = ra + ((rb - rc) >> 1);
+                            break;
+                        case 6:
+                            prediction = rb + ((ra - rc) >> 1);
+                            break;
+                        default: prediction = (ra + rb) >> 1;
+                    }
+                }
+                const category = decodeCategory(selectors[c]);
+                let difference = 0;
+                if (category === 16)
+                    difference = legacy ? (readBits(16), 32768) : 32768;
+                else if (category > 0) {
+                    const v = readBits(category);
+                    difference = v < (1 << (category - 1)) ? v - (1 << category) + 1 : v;
+                }
+                const value = (((prediction + difference) % modulus) + modulus) % modulus;
+                if (value >= valueLimit)
+                    fail("reconstructed sample exceeds the declared precision.");
+                out[i] = value;
+            }
+        linesSinceRestart++;
+    }
+    if (pt)
+        for (let i = 0; i < out.length; i++)
+            out[i] = out[i] << pt;
+    return { width, height, components: nf, precision, predictor, pointTransform: pt, samples: out };
+}
+//# sourceMappingURL=lossless-jpeg.js.map

package/dist/capture/lossless-jpeg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lossless-jpeg.js","sourceRoot":"","sources":["../../src/capture/lossless-jpeg.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;;GAQG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AA0B3E,SAAS,IAAI,CAAC,OAAe,IAAW,MAAM,IAAI,yBAAyB,CAAC,iBAAiB,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAE3G,0FAA0F;AAC1F,SAAS,UAAU,CAAC,MAAkB,EAAE,MAAkB;IACxD,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IACvG,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QAC9B,IAAI,CAAC,EAAE,CAAC;YAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAAC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;YAAC,IAAI,IAAI,CAAC,CAAC;YAAC,CAAC,IAAI,CAAC,CAAC;YAAC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QAAC,CAAC;QACrG,8DAA8D;QAC9D,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC;YAAE,IAAI,CAAC,gCAAgC,CAAC,CAAC;QACjE,IAAI,KAAK,CAAC,CAAC;IACb,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAiB,EAAE,MAA0B;IAC7E,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC;QAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC;IACxE,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC9G,mBAAmB,CAAC,MAAM,EAAE,CAAC,gBAAgB,EAAE,4BAA4B,CAAC,EAAE,sBAAsB,CAAC,CAAC;IACtG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,cAAc,GAAG,CAAC;QAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAC7G,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;QAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACtF,MAAM,MAAM,GAAiC,EAAE,CAAC;IAChD,IAAI,KAAsF,CAAC;IAC3F,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC/B,SAAS,CAAC;QACR,OAAO,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI;YAAE,CAAC,EAAE,CAAC,CAAC,6BAA6B;QACnG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC3E,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QAC7B,IAAI,MAAM,KAAK,IAAI;YAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACpF,IAAI,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,MAAM;YAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAClE,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,GAAG,KAAK,CAAC;YACd,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;gBACf,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAE,IAAI,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC;gBAC/C,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG;oBAAE,IAAI,CAAC,wBAAwB,CAAC,CAAC;gBACvE,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC7C,IAAI,KAAK,GAAG,CAAC,CAAC;gBAAC,KAAK,MAAM,CAAC,IAAI,MAAM;oBAAE,KAAK,IAAI,CAAC,CAAC;gBAClD,IAAI,KAAK,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,GAAG;oBAAE,IAAI,CAAC,oCAAoC,CAAC,CAAC;gBACpF,MAAM,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;gBACrE,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC;gBAAE,IAAI,CAAC,0BAA0B,CAAC,CAAC;YACxD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAE,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,EAAE,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC;YACnK,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,EAAE,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;gBAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC;YAC7I,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI;oBAAE,IAAI,CAAC,2CAA2C,CAAC,CAAC;gBAC7E,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;oBAAE,IAAI,CAAC,iCAAiC,CAAC,CAAC;gBACrE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;YACtB,CAAC;YACD,IAAI,KAAK,GAAG,MAAM,GAAG,EAAE,GAAG,MAAM,CAAC,cAAc;gBAAE,IAAI,CAAC,iCAAiC,CAAC,CAAC;YACzF,KAAK,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QAC5C,CAAC;aAAM,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,IAAI,KAAK,CAAC;gBAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC;YAClD,eAAe,GAAG,KAAK,CAAC,KAAK,CAAE,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC;QAC5D,CAAC;aAAM,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,2BAA2B,CAAC,CAAC;YAC9C,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;YACzB,IAAI,EAAE,KAAK,KAAK,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;gBAAE,IAAI,CAAC,6DAA6D,CAAC,CAAC;YACxH,MAAM,SAAS,GAAmB,EAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,IAAI,CAAC,8CAA8C,CAAC,CAAC;gBACpG,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,IAAI,CAAC,CAAC,CAAC;gBACrD,IAAI,CAAC,KAAK;oBAAE,IAAI,CAAC,6CAA6C,CAAC,CAAC;gBAChE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;YACD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAE,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAE,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAE,IAAI,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAE,GAAG,EAAE,CAAC;YAC1J,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC,SAAS;gBAAE,IAAI,CAAC,8BAA8B,CAAC,CAAC;YAC1H,OAAO,UAAU,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,eAAe,EAAE,MAAM,CAAC,0BAA0B,KAAK,IAAI,CAAC,CAAC;QAC9H,CAAC;aAAM,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAChK,IAAI,CAAC,kDAAkD,CAAC,CAAC;QAC3D,CAAC;aAAM,IAAI,MAAM,GAAG,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;YAClF,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAC7B,CAAC;QACD,oFAAoF;QACpF,CAAC,GAAG,GAAG,CAAC;IACV,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,KAAiB,EAAE,KAAa,EAAE,KAA0E,EAC9H,SAAkC,EAAE,SAAiB,EAAE,EAAU,EAAE,eAAuB,EAAE,MAAe;IAC3G,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,UAAU,GAAG,KAAK,GAAG,EAAE,CAAC;IAC3F,IAAI,eAAe,KAAK,CAAC,IAAI,eAAe,GAAG,KAAK,KAAK,CAAC;QAAE,IAAI,CAAC,mDAAmD,CAAC,CAAC;IACtH,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,KAAK,GAAG,MAAM,GAAG,EAAE,CAAC,EAAE,OAAO,GAAG,KAAK,EAAE,UAAU,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC;IACtG,IAAI,CAAC,GAAG,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,0HAA0H;QAC1H,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAE,CAAC;aACzD,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAAC,IAAI,GAAG,IAAI,CAAC;YAAC,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC;aAChG,IAAI,EAAE,OAAO,GAAG,CAAC;YAAE,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACjE,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAAC,IAAI,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC;IACF,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAU,EAAE;QACzC,OAAO,IAAI,GAAG,KAAK;YAAE,IAAI,EAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,CAAC;QACd,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC;IACF,MAAM,cAAc,GAAG,CAAC,KAAmB,EAAU,EAAE;QACrD,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;QAChC,OAAO,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAE,EAAE,CAAC;YAClC,IAAI,EAAE,GAAG,GAAG,EAAE;gBAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;YAC9C,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAE,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAE,CAAC,CAAC;QAC5E,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,EAAE;YAAE,IAAI,CAAC,8BAA8B,CAAC,CAAC;QAC5E,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,IAAI,iBAAiB,GAAG,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,eAAe,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,eAAe,KAAK,CAAC,EAAE,CAAC;YACpE,sFAAsF;YACtF,IAAI,GAAG,CAAC,CAAC;YAAC,MAAM,GAAG,CAAC,CAAC;YAAC,OAAO,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC;YAChI,CAAC,IAAI,CAAC,CAAC;YAAC,YAAY,EAAE,CAAC;YAAC,iBAAiB,GAAG,CAAC,CAAC;QAChD,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,GAAG,UAAU,EAAE,KAAK,GAAG,GAAG,GAAG,UAAU,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5D,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC3B,IAAI,UAAkB,CAAC;gBACvB,IAAI,iBAAiB,KAAK,CAAC;oBAAE,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAE,CAAC;qBACxF,IAAI,CAAC,KAAK,CAAC;oBAAE,UAAU,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC;qBAC1C,CAAC;oBACJ,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAE,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,CAAE,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,GAAG,EAAE,CAAE,CAAC;oBACnF,QAAQ,SAAS,EAAE,CAAC;wBAClB,KAAK,CAAC;4BAAE,UAAU,GAAG,EAAE,CAAC;4BAAC,MAAM;wBAC/B,KAAK,CAAC;4BAAE,UAAU,GAAG,EAAE,CAAC;4BAAC,MAAM;wBAC/B,KAAK,CAAC;4BAAE,UAAU,GAAG,EAAE,CAAC;4BAAC,MAAM;wBAC/B,KAAK,CAAC;4BAAE,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;4BAAC,MAAM;wBACzC,KAAK,CAAC;4BAAE,UAAU,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;4BAAC,MAAM;wBAClD,KAAK,CAAC;4BAAE,UAAU,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;4BAAC,MAAM;wBAClD,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;oBACvC,CAAC;gBACH,CAAC;gBACD,MAAM,QAAQ,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC/C,IAAI,UAAU,GAAG,CAAC,CAAC;gBACnB,IAAI,QAAQ,KAAK,EAAE;oBAAE,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;qBACpE,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;oBAC7B,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvE,CAAC;gBACD,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;gBAC1E,IAAI,KAAK,IAAI,UAAU;oBAAE,IAAI,CAAC,sDAAsD,CAAC,CAAC;gBACtF,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACjB,CAAC;QACD,iBAAiB,EAAE,CAAC;IACtB,CAAC;IACD,IAAI,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,IAAI,EAAE,CAAC;IACpE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;AACnG,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * Size-limited decoder for lossless Huffman JPEG (ITU-T T.81 | ISO/IEC 10918-1, Annex H, process 14,\n * SOF3), the variant DNG uses for Compression = 7 raw data. Written independently from the published\n * standard, with no third-party decoder source. Browser-safe: plain typed arrays, no I/O.\n *\n * Supported: one SOF3 frame, precision 2..16, 1..4 components with 1x1 sampling, one interleaved scan\n * over all components, predictors 1..7, point transform, DRI restart intervals, 0xFF00 byte stuffing.\n * Rejected: hierarchical/DCT/arithmetic frames, multiple scans, subsampled components, truncated data.\n */\n\nimport { rejectUnknownFields } from \"../core/record-validation.js\";\nimport { InvalidConfigurationError } from \"../core/configuration-error.js\";\n\n/** Decoded lossless JPEG samples, interleaved by component within each line (line, x, component). */\nexport interface LosslessJpegImage {\n  /** Samples per line (X in the frame header). */\n  width: number;\n  /** Lines (Y in the frame header). */\n  height: number;\n  components: number;\n  /** Sample precision P in bits, 2..16. */\n  precision: number;\n  predictor: number;\n  pointTransform: number;\n  samples: Uint16Array;\n}\nexport interface LosslessJpegLimits {\n  /** Largest width x height x components accepted. Checked before output is allocated. */\n  maximumSamples: number;\n  /**\n   * DNG files with DNGVersion below 1.1.0.0 store 16 extra bits after the SSSS = 16 difference category\n   * (DNG 1.7.1.0 specification, Compatibility Issue 2). Standard streams store none.\n   */\n  legacySixteenBitDifference?: boolean;\n}\n\ninterface HuffmanTable { maxCode: Int32Array; valPtr: Int32Array; minCode: Int32Array; values: Uint8Array }\nfunction fail(message: string): never { throw new InvalidConfigurationError(\"Lossless JPEG: \" + message); }\n\n/** T.81 Annex C code generation and F.2.2.3 decoder tables (MINCODE, MAXCODE, VALPTR). */\nfunction buildTable(counts: Uint8Array, values: Uint8Array): HuffmanTable {\n  const maxCode = new Int32Array(17).fill(-1), minCode = new Int32Array(17), valPtr = new Int32Array(17);\n  let code = 0, k = 0;\n  for (let length = 1; length <= 16; length++) {\n    const n = counts[length - 1]!;\n    if (n) { valPtr[length] = k; minCode[length] = code; code += n; k += n; maxCode[length] = code - 1; }\n    // Canonical codes of `length` bits must fit in `length` bits.\n    if (code > (1 << length)) fail(\"over-subscribed Huffman table.\");\n    code <<= 1;\n  }\n  return { maxCode, minCode, valPtr, values };\n}\n\n/**\n * Decodes one lossless JPEG stream. Every length, count and table index is checked against the\n * buffer. Output is allocated only after the declared size passes `limits.maximumSamples`.\n */\nexport function parseLosslessJpeg(bytes: Uint8Array, limits: LosslessJpegLimits): LosslessJpegImage {\n  if (!(bytes instanceof Uint8Array)) fail(\"input must be a Uint8Array.\");\n  if (limits === null || typeof limits !== \"object\" || Array.isArray(limits)) fail(\"limits must be an object.\");\n  rejectUnknownFields(limits, [\"maximumSamples\", \"legacySixteenBitDifference\"], \"Lossless JPEG limits\");\n  if (!Number.isSafeInteger(limits.maximumSamples) || limits.maximumSamples < 1) fail(\"invalid sample limit.\");\n  const length = bytes.length;\n  if (length < 4 || bytes[0] !== 0xff || bytes[1] !== 0xd8) fail(\"missing SOI marker.\");\n  const tables: (HuffmanTable | undefined)[] = [];\n  let frame: { precision: number; height: number; width: number; ids: number[] } | undefined;\n  let restartInterval = 0, p = 2;\n  for (;;) {\n    while (p < length && bytes[p] === 0xff && bytes[p + 1] === 0xff) p++; // fill bytes before a marker\n    if (p + 4 > length || bytes[p] !== 0xff) fail(\"malformed marker segment.\");\n    const marker = bytes[p + 1]!;\n    if (marker === 0xd9) fail(\"no scan before EOI.\");\n    const size = bytes[p + 2]! * 256 + bytes[p + 3]!, start = p + 4, end = p + 2 + size;\n    if (size < 2 || end > length) fail(\"segment exceeds the stream.\");\n    if (marker === 0xc4) {\n      let q = start;\n      while (q < end) {\n        const tc = bytes[q]! >> 4, th = bytes[q]! & 15;\n        if (tc !== 0 || th > 3 || q + 17 > end) fail(\"invalid Huffman table.\");\n        const counts = bytes.subarray(q + 1, q + 17);\n        let total = 0; for (const c of counts) total += c;\n        if (total > 256 || q + 17 + total > end) fail(\"Huffman table exceeds its segment.\");\n        tables[th] = buildTable(counts, bytes.slice(q + 17, q + 17 + total));\n        q += 17 + total;\n      }\n    } else if (marker === 0xc3) {\n      if (frame || size < 8) fail(\"unexpected frame header.\");\n      const precision = bytes[start]!, height = bytes[start + 1]! * 256 + bytes[start + 2]!, width = bytes[start + 3]! * 256 + bytes[start + 4]!, nf = bytes[start + 5]!;\n      if (precision < 2 || precision > 16 || height < 1 || width < 1 || nf < 1 || nf > 4 || size !== 8 + 3 * nf) fail(\"unsupported frame header.\");\n      const ids: number[] = [];\n      for (let i = 0; i < nf; i++) {\n        const o = start + 6 + i * 3;\n        if (bytes[o + 1] !== 0x11) fail(\"only 1x1 component sampling is supported.\");\n        if (ids.includes(bytes[o]!)) fail(\"duplicate component identifier.\");\n        ids.push(bytes[o]!);\n      }\n      if (width * height * nf > limits.maximumSamples) fail(\"frame exceeds the sample limit.\");\n      frame = { precision, height, width, ids };\n    } else if (marker === 0xdd) {\n      if (size !== 4) fail(\"invalid restart interval.\");\n      restartInterval = bytes[start]! * 256 + bytes[start + 1]!;\n    } else if (marker === 0xda) {\n      if (!frame) fail(\"scan before frame header.\");\n      const ns = bytes[start]!;\n      if (ns !== frame.ids.length || size !== 6 + 2 * ns) fail(\"only one interleaved scan over all components is supported.\");\n      const selectors: HuffmanTable[] = [];\n      for (let i = 0; i < ns; i++) {\n        if (bytes[start + 1 + i * 2] !== frame.ids[i]) fail(\"scan component order differs from the frame.\");\n        const table = tables[bytes[start + 2 + i * 2]! >> 4];\n        if (!table) fail(\"scan references an undefined Huffman table.\");\n        selectors.push(table);\n      }\n      const predictor = bytes[start + 1 + 2 * ns]!, se = bytes[start + 2 + 2 * ns]!, ah = bytes[start + 3 + 2 * ns]! >> 4, pt = bytes[start + 3 + 2 * ns]! & 15;\n      if (predictor < 1 || predictor > 7 || se !== 0 || ah !== 0 || pt >= frame.precision) fail(\"unsupported scan parameters.\");\n      return decodeScan(bytes, end, frame, selectors, predictor, pt, restartInterval, limits.legacySixteenBitDifference === true);\n    } else if (marker === 0xc0 || marker === 0xc1 || marker === 0xc2 || (marker >= 0xc5 && marker <= 0xcf && marker !== 0xc8 && marker !== 0xcc) || marker === 0xde) {\n      fail(\"only lossless Huffman SOF3 frames are supported.\");\n    } else if (marker < 0xc0 || marker === 0xd8 || (marker >= 0xd0 && marker <= 0xd7)) {\n      fail(\"unexpected marker.\");\n    }\n    // APPn, COM, DQT and other non-frame segments are skipped by their declared length.\n    p = end;\n  }\n}\n\nfunction decodeScan(bytes: Uint8Array, start: number, frame: { precision: number; height: number; width: number; ids: number[] },\n  selectors: readonly HuffmanTable[], predictor: number, pt: number, restartInterval: number, legacy: boolean): LosslessJpegImage {\n  const { width, height, precision } = frame, nf = selectors.length, rowSamples = width * nf;\n  if (restartInterval !== 0 && restartInterval % width !== 0) fail(\"restart interval must be a whole number of lines.\");\n  const out = new Uint16Array(width * height * nf), modulus = 65536, valueLimit = 1 << (precision - pt);\n  let p = start, buffer = 0, bits = 0, padding = 0;\n  const fill = (): void => {\n    // Load one byte. 0xFF00 is a stuffed 0xFF. Any other marker ends the entropy-coded data; later reads return zero padding.\n    let byte = 0;\n    if (p < bytes.length && bytes[p] !== 0xff) byte = bytes[p++]!;\n    else if (p + 1 < bytes.length && bytes[p] === 0xff && bytes[p + 1] === 0x00) { byte = 0xff; p += 2; }\n    else if (++padding > 8) fail(\"entropy-coded data is truncated.\");\n    buffer = ((buffer << 8) | byte) >>> 0; bits += 8;\n  };\n  const readBits = (count: number): number => {\n    while (bits < count) fill();\n    bits -= count;\n    return (buffer >>> bits) & ((1 << count) - 1);\n  };\n  const decodeCategory = (table: HuffmanTable): number => {\n    let code = readBits(1), len = 1;\n    while (code > table.maxCode[len]!) {\n      if (++len > 16) fail(\"invalid Huffman code.\");\n      code = (code << 1) | readBits(1);\n    }\n    const value = table.values[table.valPtr[len]! + code - table.minCode[len]!];\n    if (value === undefined || value > 16) fail(\"invalid difference category.\");\n    return value;\n  };\n  let linesSinceRestart = 0, restartIndex = 0;\n  for (let y = 0; y < height; y++) {\n    if (restartInterval && y > 0 && (y * width) % restartInterval === 0) {\n      // Byte-align, then require RSTm with m = restart count mod 8 (T.81 F.1.2.3, H.1.2.1).\n      bits = 0; buffer = 0; padding = 0;\n      if (p + 1 >= bytes.length || bytes[p] !== 0xff || bytes[p + 1] !== (0xd0 | (restartIndex & 7))) fail(\"missing restart marker.\");\n      p += 2; restartIndex++; linesSinceRestart = 0;\n    }\n    const row = y * rowSamples, above = row - rowSamples;\n    for (let x = 0; x < width; x++) for (let c = 0; c < nf; c++) {\n      const i = row + x * nf + c;\n      let prediction: number;\n      if (linesSinceRestart === 0) prediction = x === 0 ? 1 << (precision - pt - 1) : out[i - nf]!;\n      else if (x === 0) prediction = out[above + c]!;\n      else {\n        const ra = out[i - nf]!, rb = out[i - rowSamples]!, rc = out[i - rowSamples - nf]!;\n        switch (predictor) {\n          case 1: prediction = ra; break;\n          case 2: prediction = rb; break;\n          case 3: prediction = rc; break;\n          case 4: prediction = ra + rb - rc; break;\n          case 5: prediction = ra + ((rb - rc) >> 1); break;\n          case 6: prediction = rb + ((ra - rc) >> 1); break;\n          default: prediction = (ra + rb) >> 1;\n        }\n      }\n      const category = decodeCategory(selectors[c]!);\n      let difference = 0;\n      if (category === 16) difference = legacy ? (readBits(16), 32768) : 32768;\n      else if (category > 0) {\n        const v = readBits(category);\n        difference = v < (1 << (category - 1)) ? v - (1 << category) + 1 : v;\n      }\n      const value = (((prediction + difference) % modulus) + modulus) % modulus;\n      if (value >= valueLimit) fail(\"reconstructed sample exceeds the declared precision.\");\n      out[i] = value;\n    }\n    linesSinceRestart++;\n  }\n  if (pt) for (let i = 0; i < out.length; i++) out[i] = out[i]! << pt;\n  return { width, height, components: nf, precision, predictor, pointTransform: pt, samples: out };\n}\n"]}

package/dist/capture/native-environment-lean.d.ts

@@ -0,0 +1,227 @@
+/**
+ * A faster ("lean") per-site optical executor for createNativeEnvironmentRawTask, added in 2.0 for
+ * performance. It skips only per-site re-validation and result-envelope building that can be proven
+ * redundant, and nothing else:
+ *
+ * - A site whose environment is strictly equal (plain data, same keys in the same order, Object.is leaves) to
+ *   an earlier fully validated "template" site except for the two index-bound fields (temporalIntegrationId and
+ *   sensor.spatialSampling.site), and whose colour-sampling site has the same CFA phase, passes every
+ *   site-independent check exactly as the template did. Only the site-dependent work is recomputed: aperture
+ *   geometry and its bounds, the local exposure window, field throughput, aperture rays, query projection and
+ *   provider requests, with the same arithmetic in the same order as the full planner.
+ * - Execution replays the same callbacks with the same frozen requests, validates every provider result with
+ *   the same parser, and evaluates the photon/charge-rate arithmetic of the full chain (scene-to-sensor
+ *   acceptance, spatio-spectral reduction, operating range, EQE electron rate, Kahan sums, temporal midpoint
+ *   sums) in the same floating-point operation order.
+ * - Every data-dependent check of the full chain is still evaluated. When one fails, or anything is unexpected,
+ *   the lean path hands the exact same inputs to the full engine function, which then throws its own error (or
+ *   returns its own value). Planning falls back before any callback. Execution falls back at the step whose check
+ *   failed. So callbacks, errors and their order are unchanged.
+ * - Each template verifies itself: its own site is planned by both planners and executed by the full executor,
+ *   and the lean results must be bit-identical (Object.is) before any other site uses the template. A mismatch
+ *   disables the template and its sites run the full path.
+ *
+ * Sampled PSFs (point-spread functions) and lens field mappings are covered as well (2.0). A sampled-PSF site
+ * resolves its kernels with the full resolver's own code (resolveLensSampledPsfKernel), places the taps with the
+ * shared sensorPsfSourcePoint and sums each node's taps in kernel order, as calculateSensorPsfIrradianceQuadrature
+ * does. Its per-instant checks run after that instant's callbacks; when one fails, the full quadrature runs on the
+ * site's full plan and decides. A lens-mapped site builds each query with calculateMappedSensorEnvironmentRadianceQuery
+ * itself and applies the distortion area factor once, after the tap's pupil sum.
+ * @see docs/NATIVE_RAW_AND_PRINT.md for the invariance argument and limits.
+ */
+import type { SimulateEnvironmentSensorRawFrameInput } from "./environment-raw-producer.js";
+import type { planEnvironmentSensorPhotoSignal, executeEnvironmentSensorPhotoSignal, EnvironmentRadianceEvaluator, EnvironmentApertureRadianceEvaluator } from "../sensor/environment-photo-signal.js";
+import type { SensorEqeTemporalPhotoSignal } from "../sensor/temporal-photo-signal.js";
+import { type SceneRadianceEvaluationRequest } from "../schema/scene-radiance.js";
+import { type PreparedEnvironmentLensFieldMapping } from "../optics/sensor-environment-query.js";
+import { type ResolveLensSampledPsfInput } from "../optics/lens-psf-profile.js";
+import { type SensorApertureRay } from "../optics/sensor-aperture-rays.js";
+import { parseFocusPlane } from "../optics/focus-state.js";
+import { prepareCaptureExposureWindowSampler } from "../sensor/exposure-window.js";
+import { type NativeRawProducerFrameContext } from "./sensor-raw-producer.js";
+import type { NativeRawLeanSensorHook } from "./native-raw.js";
+type Site = SimulateEnvironmentSensorRawFrameInput["sites"][number];
+type Env = Site["environment"];
+type FullPlan = ReturnType<typeof planEnvironmentSensorPhotoSignal>;
+type FullResult = ReturnType<typeof executeEnvironmentSensorPhotoSignal>;
+type FieldThroughput = FullPlan["instants"][number]["groups"][number]["taps"][number]["fieldThroughput"];
+/** Internal counters of lean work (tests assert the lean path actually runs). Not exported from the package. */
+export declare const nativeEnvironmentLeanStatistics: {
+    plannedSites: number;
+    executedSites: number;
+    sensorSites: number;
+    psfFallbacks: number;
+};
+export declare function setNativeEnvironmentLeanExecutionEnabled(enabled: boolean): void;
+interface SpatialNode {
+    xPhase: number;
+    yPhase: number;
+    aaX: number;
+    aaY: number;
+}
+interface ExecutionConstants {
+    /** Per spatial node: combined normalized weight and geometric area measure in m². */
+    weight: Float64Array;
+    areaSquareMeters: Float64Array;
+    /** Per spectral node: dλ (wavelength step), photon energy and effective EQE, exactly as the template's full chain used them. */
+    measure: Float64Array;
+    photonEnergy: Float64Array;
+    eqe: Float64Array;
+    /** Per spectral node: scene-to-sensor acceptance before field throughput. */
+    acceptance: Float64Array;
+    rangeKind: "power" | "irradiance";
+    rangeMinimum: number;
+    rangeMaximum: number;
+    perBin: boolean;
+    photo: SensorEqeTemporalPhotoSignal;
+}
+interface Template {
+    environment: Env;
+    phase: number;
+    /** True until the template's plan constants are derived and self-checked. */
+    disabled: boolean;
+    consts?: PlanConstants;
+    /** The lean plan of the template's own site, shown equal to its full plan. */
+    selfPlan?: LeanEnvironmentPlan | undefined;
+    execution?: ExecutionConstants;
+    /** undefined until the template site executed through the full path. */
+    executionVerified?: boolean;
+}
+interface PlanConstants {
+    spectralCount: number;
+    spatialCount: number;
+    temporalCount: number;
+    pupilCount: number;
+    count: number;
+    /** Per group (spectral × spatial node): its number of taps (1 without a sampled PSF). */
+    tapCounts: readonly number[];
+    /** Start of each group in an instant's flat tap list, plus the total at the end. */
+    tapOffsets: readonly number[];
+    /** The template's sampled-PSF resolver input (its engine-owned, frozen profile), without wavelength and field point. */
+    psf?: Omit<ResolveLensSampledPsfInput, "wavelengthNm" | "fieldPointMm">;
+    /** The template's validated lens field mapping. */
+    lensMapping?: PreparedEnvironmentLensFieldMapping;
+    wavelengths: Float64Array;
+    nodes: readonly FullPlan["instants"][number]["groups"][number]["node"][];
+    spatial: SpatialNode[];
+    geometry: {
+        firstX: number;
+        firstY: number;
+        pitchX: number;
+        pitchY: number;
+        offsetX: number;
+        offsetY: number;
+        widthUm: number;
+        heightUm: number;
+        imagingWidthMm: number;
+        imagingHeightMm: number;
+    };
+    sampler: ReturnType<typeof prepareCaptureExposureWindowSampler>;
+    projectionDistanceMm: number;
+    focus: FullPlan["focus"];
+    /** The focus plane as calculateSensorApertureRays parses it. */
+    parsedFocus: ReturnType<typeof parseFocusPlane>;
+    requestBase: {
+        providerProfileId: string;
+        sceneId: string;
+        illuminationProfileId: string;
+        materialResponseProfileId: string;
+        wavelengthBasis: string;
+    };
+    sceneBindings: FullPlan["sceneBindings"];
+}
+interface LeanTap {
+    request: SceneRadianceEvaluationRequest;
+    sourcePointImagePlaneMm: {
+        x: number;
+        y: number;
+    };
+    fieldThroughput: FieldThroughput;
+    fieldFactor: number;
+    fieldValid: boolean;
+    apertureRays?: readonly SensorApertureRay[];
+    /** 1 / det(d distorted / d ideal), applied once after the tap's pupil sum. Present only with a lens field mapping. */
+    distortionAreaFactor?: number;
+}
+/** A lean site plan. `owned` and `count` mirror the full plan fields the native task reads. */
+export interface LeanEnvironmentPlan {
+    readonly lean: true;
+    readonly template: Template;
+    readonly index: number;
+    readonly owned: Env;
+    readonly count: number;
+    readonly site: {
+        x: number;
+        y: number;
+    };
+    readonly start: number;
+    readonly end: number;
+    readonly duration: number;
+    /**
+     * Per instant, every tap in one flat list: group by group (spectral-major, spatial-minor), each group's taps in kernel
+     * order. Group gi holds taps tapOffsets[gi] to tapOffsets[gi + 1] - 1 of its template's plan constants.
+     */
+    readonly instants: readonly {
+        time: number;
+        taps: readonly LeanTap[];
+    }[];
+    /** Per group: the resolved PSF kernel weights. Present only with a sampled PSF. */
+    readonly kernels?: readonly (readonly number[])[];
+}
+export declare function isLeanEnvironmentPlan(plan: unknown): plan is LeanEnvironmentPlan;
+export interface NativeEnvironmentLeanFrame {
+    frameId: string;
+    nativeWidth: number;
+    nativeHeight: number;
+    repeatWidth: number;
+    repeatHeight: number;
+    /** True only when native sites and colour-sampling sites map one to one, with the same top-left origin (identity mapping). */
+    identityBinding: boolean;
+}
+/** Per-event lean executor state. Templates and memos live only for one native task. */
+export interface NativeEnvironmentLeanExecutor {
+    /**
+     * Classifies a planned site. Returns a lean plan when it matches a verified template; "candidate" when it
+     * should be planned in full with "full" retention and offered to admitCandidate; or undefined (plan it in
+     * full, keeping only the photo signal).
+     */
+    plan(environment: Env, index: number): LeanEnvironmentPlan | "candidate" | undefined;
+    /** Registers a fully planned ("full" retention) candidate; never throws. */
+    admitCandidate(environment: Env, index: number, plan: FullPlan): void;
+    /** True when this index is an accepted candidate. Its full execution must use "full" retention and be verified. */
+    isCandidate(index: number): boolean;
+    /** Verifies a candidate's full execution (full retention) against the lean arithmetic; never throws. */
+    verifyCandidate(index: number, plan: FullPlan, result: FullResult): void;
+    /**
+     * Executes a lean plan. Returns the photo signal, or undefined when the template could not be verified; the
+     * caller then plans and executes this site in full. `fullPlan` builds the site's full plan without callbacks;
+     * it is called only when a sampled-PSF check fails and the full PSF quadrature must decide.
+     */
+    execute(plan: LeanEnvironmentPlan, evaluate: EnvironmentRadianceEvaluator, aperture: EnvironmentApertureRadianceEvaluator | undefined, fullPlan: () => FullPlan): SensorEqeTemporalPhotoSignal | undefined;
+}
+export declare function createNativeEnvironmentLeanExecutor(frame: NativeEnvironmentLeanFrame): NativeEnvironmentLeanExecutor;
+/**
+ * Lean sensor stage for createNativeEnvironmentRawTask.
+ *
+ * claim() runs in the environment task, at the point where the full path composes the site (dark charge), and
+ * evaluates every parse-phase check there. compute() runs in the native RAW task's compute phase. If any
+ * compute-phase check fails, it falls back to the full parse and calculateNativeRawSite.
+ */
+export interface NativeEnvironmentSensorLean {
+    readonly hook: NativeRawLeanSensorHook;
+    /** Starts a tile: fully composed sites of the previous tile are forgotten. */
+    beginTile(): void;
+    /** A lean tile entry for a site matching a verified template, or undefined (compose it in full and remember it). */
+    claim(site: Site, photo: SensorEqeTemporalPhotoSignal, index: number): object | undefined;
+    /** Remembers a fully composed site so its full computation can become a template. */
+    remember(index: number, site: Site, photo: SensorEqeTemporalPhotoSignal): void;
+}
+export declare function createNativeEnvironmentSensorLean(frame: NativeEnvironmentLeanFrame, producerFrame: NativeRawProducerFrameContext, nativeWindow: ((point: {
+    x: number;
+    y: number;
+}) => {
+    startOffsetSecondsFromOpeningReference: number;
+    endOffsetSecondsFromOpeningReference: number;
+    localExposureDurationSeconds: number;
+}) | undefined): NativeEnvironmentSensorLean;
+export {};