tempest-react-sdk 0.23.0 → 0.24.0

package/dist/vision/luminance.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=256;function g(t){return t instanceof HTMLVideoElement?{width:t.videoWidth,height:t.videoHeight}:t instanceof HTMLCanvasElement?{width:t.width,height:t.height}:{width:t.naturalWidth||t.width,height:t.naturalHeight||t.height}}function L(t,e){const{width:n,height:o}=g(t);if(n===0||o===0)return 0;const u=Math.min(1,s/Math.max(n,o)),i=Math.max(1,Math.round(n*u)),r=Math.max(1,Math.round(o*u)),c=e??document.createElement("canvas");c.width=i,c.height=r;const m=c.getContext("2d",{willReadFrequently:!0});if(!m)return 0;m.drawImage(t,0,0,i,r);const h=m.getImageData(0,0,i,r).data;let d=0;const l=i*r;for(let a=0;a<h.length;a+=4)d+=.2126*h[a]+.7152*h[a+1]+.0722*h[a+2];return d/l}function E(t,e){return t>=e}class M extends Error{luminance;threshold;constructor(e,n){super("Image is too dark to analyse. Capture again in a brighter environment."),this.name="LowLuminanceError",this.luminance=e,this.threshold=n}}exports.LUMINANCE_SAMPLE_MAX_EDGE=s;exports.LowLuminanceError=M;exports.computeImageLuminance=L;exports.isLuminanceAcceptable=E;
-//# sourceMappingURL=luminance.cjs.map
+var e=256;function t(e){return e instanceof HTMLVideoElement?{width:e.videoWidth,height:e.videoHeight}:e instanceof HTMLCanvasElement?{width:e.width,height:e.height}:{width:e.naturalWidth||e.width,height:e.naturalHeight||e.height}}function n(e,n){let{width:r,height:i}=t(e);if(r===0||i===0)return 0;let a=Math.min(1,256/Math.max(r,i)),o=Math.max(1,Math.round(r*a)),s=Math.max(1,Math.round(i*a)),c=n??document.createElement(`canvas`);c.width=o,c.height=s;let l=c.getContext(`2d`,{willReadFrequently:!0});if(!l)return 0;l.drawImage(e,0,0,o,s);let u=l.getImageData(0,0,o,s).data,d=0,f=o*s;for(let e=0;e<u.length;e+=4)d+=.2126*u[e]+.7152*u[e+1]+.0722*u[e+2];return d/f}function r(e,t){return e>=t}var i=class extends Error{luminance;threshold;constructor(e,t){super(`Image is too dark to analyse. Capture again in a brighter environment.`),this.name=`LowLuminanceError`,this.luminance=e,this.threshold=t}};exports.LUMINANCE_SAMPLE_MAX_EDGE=e,exports.LowLuminanceError=i,exports.computeImageLuminance=n,exports.isLuminanceAcceptable=r;
+//# sourceMappingURL=luminance.cjs.map

package/dist/vision/luminance.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"luminance.cjs","sources":["../../src/vision/luminance.ts"],"sourcesContent":["/**\n * Frame-brightness helpers — measure the mean luminance of an already-decoded\n * `<img>`, `<video>` or `<canvas>` so a UI can reject underexposed captures\n * before paying the cost of downstream inference.\n *\n * These are framework-agnostic pure functions; {@link useLiveLuminance} wires\n * {@link computeImageLuminance} into a React `requestAnimationFrame` loop for\n * live camera feedback.\n */\n\n/**\n * Longest edge (in pixels) the source is downsampled to before sampling.\n * Averaging over a small downsample is statistically equivalent for a\n * brightness threshold and orders of magnitude faster than reading every pixel\n * of a full-resolution camera frame.\n */\nexport const LUMINANCE_SAMPLE_MAX_EDGE = 256;\n\n/** Drawable source we can sample luminance from — image, video, or canvas. */\nexport type LuminanceSource = HTMLImageElement | HTMLVideoElement | HTMLCanvasElement;\n\n/** Natural pixel size of the source (`0`/`0` while it is still unloaded). */\nfunction sourceSize(source: LuminanceSource): { width: number; height: number } {\n    if (source instanceof HTMLVideoElement) {\n        return { width: source.videoWidth, height: source.videoHeight };\n    }\n    if (source instanceof HTMLCanvasElement) {\n        return { width: source.width, height: source.height };\n    }\n    return {\n        width: source.naturalWidth || source.width,\n        height: source.naturalHeight || source.height,\n    };\n}\n\n/**\n * Mean BT.709 luminance (`0.2126*R + 0.7152*G + 0.0722*B`) of a decoded\n * `<img>`, `<video>` or `<canvas>`, scaled to `0..255`.\n *\n * The source is downsampled so its longest edge is at most\n * {@link LUMINANCE_SAMPLE_MAX_EDGE} before pixels are read. The 2D context is\n * created with `willReadFrequently` so repeated sampling (live feedback) stays\n * on the fast path.\n *\n * Pass `reusableCanvas` to avoid allocating a fresh canvas every frame in a hot\n * loop; when omitted a one-shot detached canvas is created.\n *\n * @param source - the image/video/canvas to sample.\n * @param reusableCanvas - optional canvas reused across frames to avoid GC churn.\n * @returns The mean luminance in `0..255`, or `0` when the source is unloaded\n *   (zero-sized) or a 2D context is unavailable.\n */\nexport function computeImageLuminance(\n    source: LuminanceSource,\n    reusableCanvas?: HTMLCanvasElement,\n): number {\n    const { width: srcW, height: srcH } = sourceSize(source);\n    if (srcW === 0 || srcH === 0) return 0;\n\n    const scale = Math.min(1, LUMINANCE_SAMPLE_MAX_EDGE / Math.max(srcW, srcH));\n    const w = Math.max(1, Math.round(srcW * scale));\n    const h = Math.max(1, Math.round(srcH * scale));\n\n    const canvas = reusableCanvas ?? document.createElement(\"canvas\");\n    canvas.width = w;\n    canvas.height = h;\n    const ctx = canvas.getContext(\"2d\", { willReadFrequently: true });\n    if (!ctx) return 0;\n    ctx.drawImage(source, 0, 0, w, h);\n\n    const data = ctx.getImageData(0, 0, w, h).data;\n    let sum = 0;\n    const pixelCount = w * h;\n    for (let i = 0; i < data.length; i += 4) {\n        sum += 0.2126 * data[i] + 0.7152 * data[i + 1] + 0.0722 * data[i + 2];\n    }\n    return sum / pixelCount;\n}\n\n/**\n * Whether a measured luminance clears a brightness threshold.\n *\n * `threshold` is intentionally required — a sensible value is\n * application-specific (it depends on the model, the lighting the model was\n * trained on, and the acceptable false-reject rate), so the SDK does not bake\n * in a default.\n *\n * @param luminance - measured mean luminance in `0..255`.\n * @param threshold - minimum acceptable luminance in `0..255`.\n * @returns `true` when `luminance >= threshold`.\n */\nexport function isLuminanceAcceptable(luminance: number, threshold: number): boolean {\n    return luminance >= threshold;\n}\n\n/**\n * Error raised when a captured frame is too dark to be analysed reliably.\n * Carries the measured luminance and the threshold it failed so callers can\n * surface actionable feedback.\n */\nexport class LowLuminanceError extends Error {\n    /** Measured mean luminance, `0..255`. */\n    readonly luminance: number;\n    /** Threshold that was checked against, `0..255`. */\n    readonly threshold: number;\n\n    /**\n     * @param luminance - the measured mean luminance in `0..255`.\n     * @param threshold - the threshold the measurement failed to reach.\n     */\n    constructor(luminance: number, threshold: number) {\n        super(\"Image is too dark to analyse. Capture again in a brighter environment.\");\n        this.name = \"LowLuminanceError\";\n        this.luminance = luminance;\n        this.threshold = threshold;\n    }\n}\n"],"names":["LUMINANCE_SAMPLE_MAX_EDGE","sourceSize","source","computeImageLuminance","reusableCanvas","srcW","srcH","scale","w","h","canvas","ctx","data","sum","pixelCount","i","isLuminanceAcceptable","luminance","threshold","LowLuminanceError"],"mappings":"gFAgBO,MAAMA,EAA4B,IAMzC,SAASC,EAAWC,EAA4D,CAC5E,OAAIA,aAAkB,iBACX,CAAE,MAAOA,EAAO,WAAY,OAAQA,EAAO,WAAA,EAElDA,aAAkB,kBACX,CAAE,MAAOA,EAAO,MAAO,OAAQA,EAAO,MAAA,EAE1C,CACH,MAAOA,EAAO,cAAgBA,EAAO,MACrC,OAAQA,EAAO,eAAiBA,EAAO,MAAA,CAE/C,CAmBO,SAASC,EACZD,EACAE,EACM,CACN,KAAM,CAAE,MAAOC,EAAM,OAAQC,CAAA,EAASL,EAAWC,CAAM,EACvD,GAAIG,IAAS,GAAKC,IAAS,EAAG,MAAO,GAErC,MAAMC,EAAQ,KAAK,IAAI,EAAGP,EAA4B,KAAK,IAAIK,EAAMC,CAAI,CAAC,EACpEE,EAAI,KAAK,IAAI,EAAG,KAAK,MAAMH,EAAOE,CAAK,CAAC,EACxCE,EAAI,KAAK,IAAI,EAAG,KAAK,MAAMH,EAAOC,CAAK,CAAC,EAExCG,EAASN,GAAkB,SAAS,cAAc,QAAQ,EAChEM,EAAO,MAAQF,EACfE,EAAO,OAASD,EAChB,MAAME,EAAMD,EAAO,WAAW,KAAM,CAAE,mBAAoB,GAAM,EAChE,GAAI,CAACC,EAAK,MAAO,GACjBA,EAAI,UAAUT,EAAQ,EAAG,EAAGM,EAAGC,CAAC,EAEhC,MAAMG,EAAOD,EAAI,aAAa,EAAG,EAAGH,EAAGC,CAAC,EAAE,KAC1C,IAAII,EAAM,EACV,MAAMC,EAAaN,EAAIC,EACvB,QAASM,EAAI,EAAGA,EAAIH,EAAK,OAAQG,GAAK,EAClCF,GAAO,MAASD,EAAKG,CAAC,EAAI,MAASH,EAAKG,EAAI,CAAC,EAAI,MAASH,EAAKG,EAAI,CAAC,EAExE,OAAOF,EAAMC,CACjB,CAcO,SAASE,EAAsBC,EAAmBC,EAA4B,CACjF,OAAOD,GAAaC,CACxB,CAOO,MAAMC,UAA0B,KAAM,CAEhC,UAEA,UAMT,YAAYF,EAAmBC,EAAmB,CAC9C,MAAM,wEAAwE,EAC9E,KAAK,KAAO,oBACZ,KAAK,UAAYD,EACjB,KAAK,UAAYC,CACrB,CACJ"}
+{"version":3,"file":"luminance.cjs","names":[],"sources":["../../src/vision/luminance.ts"],"sourcesContent":["/**\n * Frame-brightness helpers — measure the mean luminance of an already-decoded\n * `<img>`, `<video>` or `<canvas>` so a UI can reject underexposed captures\n * before paying the cost of downstream inference.\n *\n * These are framework-agnostic pure functions; {@link useLiveLuminance} wires\n * {@link computeImageLuminance} into a React `requestAnimationFrame` loop for\n * live camera feedback.\n */\n\n/**\n * Longest edge (in pixels) the source is downsampled to before sampling.\n * Averaging over a small downsample is statistically equivalent for a\n * brightness threshold and orders of magnitude faster than reading every pixel\n * of a full-resolution camera frame.\n */\nexport const LUMINANCE_SAMPLE_MAX_EDGE = 256;\n\n/** Drawable source we can sample luminance from — image, video, or canvas. */\nexport type LuminanceSource = HTMLImageElement | HTMLVideoElement | HTMLCanvasElement;\n\n/** Natural pixel size of the source (`0`/`0` while it is still unloaded). */\nfunction sourceSize(source: LuminanceSource): { width: number; height: number } {\n    if (source instanceof HTMLVideoElement) {\n        return { width: source.videoWidth, height: source.videoHeight };\n    }\n    if (source instanceof HTMLCanvasElement) {\n        return { width: source.width, height: source.height };\n    }\n    return {\n        width: source.naturalWidth || source.width,\n        height: source.naturalHeight || source.height,\n    };\n}\n\n/**\n * Mean BT.709 luminance (`0.2126*R + 0.7152*G + 0.0722*B`) of a decoded\n * `<img>`, `<video>` or `<canvas>`, scaled to `0..255`.\n *\n * The source is downsampled so its longest edge is at most\n * {@link LUMINANCE_SAMPLE_MAX_EDGE} before pixels are read. The 2D context is\n * created with `willReadFrequently` so repeated sampling (live feedback) stays\n * on the fast path.\n *\n * Pass `reusableCanvas` to avoid allocating a fresh canvas every frame in a hot\n * loop; when omitted a one-shot detached canvas is created.\n *\n * @param source - the image/video/canvas to sample.\n * @param reusableCanvas - optional canvas reused across frames to avoid GC churn.\n * @returns The mean luminance in `0..255`, or `0` when the source is unloaded\n *   (zero-sized) or a 2D context is unavailable.\n */\nexport function computeImageLuminance(\n    source: LuminanceSource,\n    reusableCanvas?: HTMLCanvasElement,\n): number {\n    const { width: srcW, height: srcH } = sourceSize(source);\n    if (srcW === 0 || srcH === 0) return 0;\n\n    const scale = Math.min(1, LUMINANCE_SAMPLE_MAX_EDGE / Math.max(srcW, srcH));\n    const w = Math.max(1, Math.round(srcW * scale));\n    const h = Math.max(1, Math.round(srcH * scale));\n\n    const canvas = reusableCanvas ?? document.createElement(\"canvas\");\n    canvas.width = w;\n    canvas.height = h;\n    const ctx = canvas.getContext(\"2d\", { willReadFrequently: true });\n    if (!ctx) return 0;\n    ctx.drawImage(source, 0, 0, w, h);\n\n    const data = ctx.getImageData(0, 0, w, h).data;\n    let sum = 0;\n    const pixelCount = w * h;\n    for (let i = 0; i < data.length; i += 4) {\n        sum += 0.2126 * data[i] + 0.7152 * data[i + 1] + 0.0722 * data[i + 2];\n    }\n    return sum / pixelCount;\n}\n\n/**\n * Whether a measured luminance clears a brightness threshold.\n *\n * `threshold` is intentionally required — a sensible value is\n * application-specific (it depends on the model, the lighting the model was\n * trained on, and the acceptable false-reject rate), so the SDK does not bake\n * in a default.\n *\n * @param luminance - measured mean luminance in `0..255`.\n * @param threshold - minimum acceptable luminance in `0..255`.\n * @returns `true` when `luminance >= threshold`.\n */\nexport function isLuminanceAcceptable(luminance: number, threshold: number): boolean {\n    return luminance >= threshold;\n}\n\n/**\n * Error raised when a captured frame is too dark to be analysed reliably.\n * Carries the measured luminance and the threshold it failed so callers can\n * surface actionable feedback.\n */\nexport class LowLuminanceError extends Error {\n    /** Measured mean luminance, `0..255`. */\n    readonly luminance: number;\n    /** Threshold that was checked against, `0..255`. */\n    readonly threshold: number;\n\n    /**\n     * @param luminance - the measured mean luminance in `0..255`.\n     * @param threshold - the threshold the measurement failed to reach.\n     */\n    constructor(luminance: number, threshold: number) {\n        super(\"Image is too dark to analyse. Capture again in a brighter environment.\");\n        this.name = \"LowLuminanceError\";\n        this.luminance = luminance;\n        this.threshold = threshold;\n    }\n}\n"],"mappings":"AAgBA,IAAa,EAA4B,IAMzC,SAAS,EAAW,EAA4D,CAO5E,OANI,aAAkB,iBACX,CAAE,MAAO,EAAO,WAAY,OAAQ,EAAO,WAAY,EAE9D,aAAkB,kBACX,CAAE,MAAO,EAAO,MAAO,OAAQ,EAAO,MAAO,EAEjD,CACH,MAAO,EAAO,cAAgB,EAAO,MACrC,OAAQ,EAAO,eAAiB,EAAO,MAC3C,CACJ,CAmBA,SAAgB,EACZ,EACA,EACM,CACN,GAAM,CAAE,MAAO,EAAM,OAAQ,GAAS,EAAW,CAAM,EACvD,GAAI,IAAS,GAAK,IAAS,EAAG,MAAO,GAErC,IAAM,EAAQ,KAAK,IAAI,EAAA,IAA+B,KAAK,IAAI,EAAM,CAAI,CAAC,EACpE,EAAI,KAAK,IAAI,EAAG,KAAK,MAAM,EAAO,CAAK,CAAC,EACxC,EAAI,KAAK,IAAI,EAAG,KAAK,MAAM,EAAO,CAAK,CAAC,EAExC,EAAS,GAAkB,SAAS,cAAc,QAAQ,EAChE,EAAO,MAAQ,EACf,EAAO,OAAS,EAChB,IAAM,EAAM,EAAO,WAAW,KAAM,CAAE,mBAAoB,EAAK,CAAC,EAChE,GAAI,CAAC,EAAK,MAAO,GACjB,EAAI,UAAU,EAAQ,EAAG,EAAG,EAAG,CAAC,EAEhC,IAAM,EAAO,EAAI,aAAa,EAAG,EAAG,EAAG,CAAC,CAAC,CAAC,KACtC,EAAM,EACJ,EAAa,EAAI,EACvB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,GAAK,EAClC,GAAO,MAAS,EAAK,GAAK,MAAS,EAAK,EAAI,GAAK,MAAS,EAAK,EAAI,GAEvE,OAAO,EAAM,CACjB,CAcA,SAAgB,EAAsB,EAAmB,EAA4B,CACjF,OAAO,GAAa,CACxB,CAOA,IAAa,EAAb,cAAuC,KAAM,CAEzC,UAEA,UAMA,YAAY,EAAmB,EAAmB,CAC9C,MAAM,wEAAwE,EAC9E,KAAK,KAAO,oBACZ,KAAK,UAAY,EACjB,KAAK,UAAY,CACrB,CACJ"}

package/dist/vision/luminance.js

@@ -1,45 +1,40 @@
-const g = 256;
-function u(t) {
-  return t instanceof HTMLVideoElement ? { width: t.videoWidth, height: t.videoHeight } : t instanceof HTMLCanvasElement ? { width: t.width, height: t.height } : {
-    width: t.naturalWidth || t.width,
-    height: t.naturalHeight || t.height
-  };
+//#region src/vision/luminance.ts
+var e = 256;
+function t(e) {
+	return e instanceof HTMLVideoElement ? {
+		width: e.videoWidth,
+		height: e.videoHeight
+	} : e instanceof HTMLCanvasElement ? {
+		width: e.width,
+		height: e.height
+	} : {
+		width: e.naturalWidth || e.width,
+		height: e.naturalHeight || e.height
+	};
 }
-function E(t, n) {
-  const { width: e, height: o } = u(t);
-  if (e === 0 || o === 0) return 0;
-  const m = Math.min(1, 256 / Math.max(e, o)), i = Math.max(1, Math.round(e * m)), h = Math.max(1, Math.round(o * m)), c = n ?? document.createElement("canvas");
-  c.width = i, c.height = h;
-  const d = c.getContext("2d", { willReadFrequently: !0 });
-  if (!d) return 0;
-  d.drawImage(t, 0, 0, i, h);
-  const r = d.getImageData(0, 0, i, h).data;
-  let s = 0;
-  const l = i * h;
-  for (let a = 0; a < r.length; a += 4)
-    s += 0.2126 * r[a] + 0.7152 * r[a + 1] + 0.0722 * r[a + 2];
-  return s / l;
+function n(e, n) {
+	let { width: r, height: i } = t(e);
+	if (r === 0 || i === 0) return 0;
+	let a = Math.min(1, 256 / Math.max(r, i)), o = Math.max(1, Math.round(r * a)), s = Math.max(1, Math.round(i * a)), c = n ?? document.createElement("canvas");
+	c.width = o, c.height = s;
+	let l = c.getContext("2d", { willReadFrequently: !0 });
+	if (!l) return 0;
+	l.drawImage(e, 0, 0, o, s);
+	let u = l.getImageData(0, 0, o, s).data, d = 0, f = o * s;
+	for (let e = 0; e < u.length; e += 4) d += .2126 * u[e] + .7152 * u[e + 1] + .0722 * u[e + 2];
+	return d / f;
 }
-function M(t, n) {
-  return t >= n;
+function r(e, t) {
+	return e >= t;
 }
-class w extends Error {
-  /** Measured mean luminance, `0..255`. */
-  luminance;
-  /** Threshold that was checked against, `0..255`. */
-  threshold;
-  /**
-   * @param luminance - the measured mean luminance in `0..255`.
-   * @param threshold - the threshold the measurement failed to reach.
-   */
-  constructor(n, e) {
-    super("Image is too dark to analyse. Capture again in a brighter environment."), this.name = "LowLuminanceError", this.luminance = n, this.threshold = e;
-  }
-}
-export {
-  g as LUMINANCE_SAMPLE_MAX_EDGE,
-  w as LowLuminanceError,
-  E as computeImageLuminance,
-  M as isLuminanceAcceptable
+var i = class extends Error {
+	luminance;
+	threshold;
+	constructor(e, t) {
+		super("Image is too dark to analyse. Capture again in a brighter environment."), this.name = "LowLuminanceError", this.luminance = e, this.threshold = t;
+	}
 };
-//# sourceMappingURL=luminance.js.map
+//#endregion
+export { e as LUMINANCE_SAMPLE_MAX_EDGE, i as LowLuminanceError, n as computeImageLuminance, r as isLuminanceAcceptable };
+
+//# sourceMappingURL=luminance.js.map

package/dist/vision/luminance.js.map

@@ -1 +1 @@
-{"version":3,"file":"luminance.js","sources":["../../src/vision/luminance.ts"],"sourcesContent":["/**\n * Frame-brightness helpers — measure the mean luminance of an already-decoded\n * `<img>`, `<video>` or `<canvas>` so a UI can reject underexposed captures\n * before paying the cost of downstream inference.\n *\n * These are framework-agnostic pure functions; {@link useLiveLuminance} wires\n * {@link computeImageLuminance} into a React `requestAnimationFrame` loop for\n * live camera feedback.\n */\n\n/**\n * Longest edge (in pixels) the source is downsampled to before sampling.\n * Averaging over a small downsample is statistically equivalent for a\n * brightness threshold and orders of magnitude faster than reading every pixel\n * of a full-resolution camera frame.\n */\nexport const LUMINANCE_SAMPLE_MAX_EDGE = 256;\n\n/** Drawable source we can sample luminance from — image, video, or canvas. */\nexport type LuminanceSource = HTMLImageElement | HTMLVideoElement | HTMLCanvasElement;\n\n/** Natural pixel size of the source (`0`/`0` while it is still unloaded). */\nfunction sourceSize(source: LuminanceSource): { width: number; height: number } {\n    if (source instanceof HTMLVideoElement) {\n        return { width: source.videoWidth, height: source.videoHeight };\n    }\n    if (source instanceof HTMLCanvasElement) {\n        return { width: source.width, height: source.height };\n    }\n    return {\n        width: source.naturalWidth || source.width,\n        height: source.naturalHeight || source.height,\n    };\n}\n\n/**\n * Mean BT.709 luminance (`0.2126*R + 0.7152*G + 0.0722*B`) of a decoded\n * `<img>`, `<video>` or `<canvas>`, scaled to `0..255`.\n *\n * The source is downsampled so its longest edge is at most\n * {@link LUMINANCE_SAMPLE_MAX_EDGE} before pixels are read. The 2D context is\n * created with `willReadFrequently` so repeated sampling (live feedback) stays\n * on the fast path.\n *\n * Pass `reusableCanvas` to avoid allocating a fresh canvas every frame in a hot\n * loop; when omitted a one-shot detached canvas is created.\n *\n * @param source - the image/video/canvas to sample.\n * @param reusableCanvas - optional canvas reused across frames to avoid GC churn.\n * @returns The mean luminance in `0..255`, or `0` when the source is unloaded\n *   (zero-sized) or a 2D context is unavailable.\n */\nexport function computeImageLuminance(\n    source: LuminanceSource,\n    reusableCanvas?: HTMLCanvasElement,\n): number {\n    const { width: srcW, height: srcH } = sourceSize(source);\n    if (srcW === 0 || srcH === 0) return 0;\n\n    const scale = Math.min(1, LUMINANCE_SAMPLE_MAX_EDGE / Math.max(srcW, srcH));\n    const w = Math.max(1, Math.round(srcW * scale));\n    const h = Math.max(1, Math.round(srcH * scale));\n\n    const canvas = reusableCanvas ?? document.createElement(\"canvas\");\n    canvas.width = w;\n    canvas.height = h;\n    const ctx = canvas.getContext(\"2d\", { willReadFrequently: true });\n    if (!ctx) return 0;\n    ctx.drawImage(source, 0, 0, w, h);\n\n    const data = ctx.getImageData(0, 0, w, h).data;\n    let sum = 0;\n    const pixelCount = w * h;\n    for (let i = 0; i < data.length; i += 4) {\n        sum += 0.2126 * data[i] + 0.7152 * data[i + 1] + 0.0722 * data[i + 2];\n    }\n    return sum / pixelCount;\n}\n\n/**\n * Whether a measured luminance clears a brightness threshold.\n *\n * `threshold` is intentionally required — a sensible value is\n * application-specific (it depends on the model, the lighting the model was\n * trained on, and the acceptable false-reject rate), so the SDK does not bake\n * in a default.\n *\n * @param luminance - measured mean luminance in `0..255`.\n * @param threshold - minimum acceptable luminance in `0..255`.\n * @returns `true` when `luminance >= threshold`.\n */\nexport function isLuminanceAcceptable(luminance: number, threshold: number): boolean {\n    return luminance >= threshold;\n}\n\n/**\n * Error raised when a captured frame is too dark to be analysed reliably.\n * Carries the measured luminance and the threshold it failed so callers can\n * surface actionable feedback.\n */\nexport class LowLuminanceError extends Error {\n    /** Measured mean luminance, `0..255`. */\n    readonly luminance: number;\n    /** Threshold that was checked against, `0..255`. */\n    readonly threshold: number;\n\n    /**\n     * @param luminance - the measured mean luminance in `0..255`.\n     * @param threshold - the threshold the measurement failed to reach.\n     */\n    constructor(luminance: number, threshold: number) {\n        super(\"Image is too dark to analyse. Capture again in a brighter environment.\");\n        this.name = \"LowLuminanceError\";\n        this.luminance = luminance;\n        this.threshold = threshold;\n    }\n}\n"],"names":["LUMINANCE_SAMPLE_MAX_EDGE","sourceSize","source","computeImageLuminance","reusableCanvas","srcW","srcH","scale","w","canvas","ctx","data","sum","pixelCount","i","isLuminanceAcceptable","luminance","threshold","LowLuminanceError"],"mappings":"AAgBO,MAAMA,IAA4B;AAMzC,SAASC,EAAWC,GAA4D;AAC5E,SAAIA,aAAkB,mBACX,EAAE,OAAOA,EAAO,YAAY,QAAQA,EAAO,YAAA,IAElDA,aAAkB,oBACX,EAAE,OAAOA,EAAO,OAAO,QAAQA,EAAO,OAAA,IAE1C;AAAA,IACH,OAAOA,EAAO,gBAAgBA,EAAO;AAAA,IACrC,QAAQA,EAAO,iBAAiBA,EAAO;AAAA,EAAA;AAE/C;AAmBO,SAASC,EACZD,GACAE,GACM;AACN,QAAM,EAAE,OAAOC,GAAM,QAAQC,EAAA,IAASL,EAAWC,CAAM;AACvD,MAAIG,MAAS,KAAKC,MAAS,EAAG,QAAO;AAErC,QAAMC,IAAQ,KAAK,IAAI,GAAG,MAA4B,KAAK,IAAIF,GAAMC,CAAI,CAAC,GACpEE,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMH,IAAOE,CAAK,CAAC,GACxC,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMD,IAAOC,CAAK,CAAC,GAExCE,IAASL,KAAkB,SAAS,cAAc,QAAQ;AAChE,EAAAK,EAAO,QAAQD,GACfC,EAAO,SAAS;AAChB,QAAMC,IAAMD,EAAO,WAAW,MAAM,EAAE,oBAAoB,IAAM;AAChE,MAAI,CAACC,EAAK,QAAO;AACjB,EAAAA,EAAI,UAAUR,GAAQ,GAAG,GAAGM,GAAG,CAAC;AAEhC,QAAMG,IAAOD,EAAI,aAAa,GAAG,GAAGF,GAAG,CAAC,EAAE;AAC1C,MAAII,IAAM;AACV,QAAMC,IAAaL,IAAI;AACvB,WAASM,IAAI,GAAGA,IAAIH,EAAK,QAAQG,KAAK;AAClC,IAAAF,KAAO,SAASD,EAAKG,CAAC,IAAI,SAASH,EAAKG,IAAI,CAAC,IAAI,SAASH,EAAKG,IAAI,CAAC;AAExE,SAAOF,IAAMC;AACjB;AAcO,SAASE,EAAsBC,GAAmBC,GAA4B;AACjF,SAAOD,KAAaC;AACxB;AAOO,MAAMC,UAA0B,MAAM;AAAA;AAAA,EAEhC;AAAA;AAAA,EAEA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMT,YAAYF,GAAmBC,GAAmB;AAC9C,UAAM,wEAAwE,GAC9E,KAAK,OAAO,qBACZ,KAAK,YAAYD,GACjB,KAAK,YAAYC;AAAA,EACrB;AACJ;"}
+{"version":3,"file":"luminance.js","names":[],"sources":["../../src/vision/luminance.ts"],"sourcesContent":["/**\n * Frame-brightness helpers — measure the mean luminance of an already-decoded\n * `<img>`, `<video>` or `<canvas>` so a UI can reject underexposed captures\n * before paying the cost of downstream inference.\n *\n * These are framework-agnostic pure functions; {@link useLiveLuminance} wires\n * {@link computeImageLuminance} into a React `requestAnimationFrame` loop for\n * live camera feedback.\n */\n\n/**\n * Longest edge (in pixels) the source is downsampled to before sampling.\n * Averaging over a small downsample is statistically equivalent for a\n * brightness threshold and orders of magnitude faster than reading every pixel\n * of a full-resolution camera frame.\n */\nexport const LUMINANCE_SAMPLE_MAX_EDGE = 256;\n\n/** Drawable source we can sample luminance from — image, video, or canvas. */\nexport type LuminanceSource = HTMLImageElement | HTMLVideoElement | HTMLCanvasElement;\n\n/** Natural pixel size of the source (`0`/`0` while it is still unloaded). */\nfunction sourceSize(source: LuminanceSource): { width: number; height: number } {\n    if (source instanceof HTMLVideoElement) {\n        return { width: source.videoWidth, height: source.videoHeight };\n    }\n    if (source instanceof HTMLCanvasElement) {\n        return { width: source.width, height: source.height };\n    }\n    return {\n        width: source.naturalWidth || source.width,\n        height: source.naturalHeight || source.height,\n    };\n}\n\n/**\n * Mean BT.709 luminance (`0.2126*R + 0.7152*G + 0.0722*B`) of a decoded\n * `<img>`, `<video>` or `<canvas>`, scaled to `0..255`.\n *\n * The source is downsampled so its longest edge is at most\n * {@link LUMINANCE_SAMPLE_MAX_EDGE} before pixels are read. The 2D context is\n * created with `willReadFrequently` so repeated sampling (live feedback) stays\n * on the fast path.\n *\n * Pass `reusableCanvas` to avoid allocating a fresh canvas every frame in a hot\n * loop; when omitted a one-shot detached canvas is created.\n *\n * @param source - the image/video/canvas to sample.\n * @param reusableCanvas - optional canvas reused across frames to avoid GC churn.\n * @returns The mean luminance in `0..255`, or `0` when the source is unloaded\n *   (zero-sized) or a 2D context is unavailable.\n */\nexport function computeImageLuminance(\n    source: LuminanceSource,\n    reusableCanvas?: HTMLCanvasElement,\n): number {\n    const { width: srcW, height: srcH } = sourceSize(source);\n    if (srcW === 0 || srcH === 0) return 0;\n\n    const scale = Math.min(1, LUMINANCE_SAMPLE_MAX_EDGE / Math.max(srcW, srcH));\n    const w = Math.max(1, Math.round(srcW * scale));\n    const h = Math.max(1, Math.round(srcH * scale));\n\n    const canvas = reusableCanvas ?? document.createElement(\"canvas\");\n    canvas.width = w;\n    canvas.height = h;\n    const ctx = canvas.getContext(\"2d\", { willReadFrequently: true });\n    if (!ctx) return 0;\n    ctx.drawImage(source, 0, 0, w, h);\n\n    const data = ctx.getImageData(0, 0, w, h).data;\n    let sum = 0;\n    const pixelCount = w * h;\n    for (let i = 0; i < data.length; i += 4) {\n        sum += 0.2126 * data[i] + 0.7152 * data[i + 1] + 0.0722 * data[i + 2];\n    }\n    return sum / pixelCount;\n}\n\n/**\n * Whether a measured luminance clears a brightness threshold.\n *\n * `threshold` is intentionally required — a sensible value is\n * application-specific (it depends on the model, the lighting the model was\n * trained on, and the acceptable false-reject rate), so the SDK does not bake\n * in a default.\n *\n * @param luminance - measured mean luminance in `0..255`.\n * @param threshold - minimum acceptable luminance in `0..255`.\n * @returns `true` when `luminance >= threshold`.\n */\nexport function isLuminanceAcceptable(luminance: number, threshold: number): boolean {\n    return luminance >= threshold;\n}\n\n/**\n * Error raised when a captured frame is too dark to be analysed reliably.\n * Carries the measured luminance and the threshold it failed so callers can\n * surface actionable feedback.\n */\nexport class LowLuminanceError extends Error {\n    /** Measured mean luminance, `0..255`. */\n    readonly luminance: number;\n    /** Threshold that was checked against, `0..255`. */\n    readonly threshold: number;\n\n    /**\n     * @param luminance - the measured mean luminance in `0..255`.\n     * @param threshold - the threshold the measurement failed to reach.\n     */\n    constructor(luminance: number, threshold: number) {\n        super(\"Image is too dark to analyse. Capture again in a brighter environment.\");\n        this.name = \"LowLuminanceError\";\n        this.luminance = luminance;\n        this.threshold = threshold;\n    }\n}\n"],"mappings":";AAgBA,IAAa,IAA4B;AAMzC,SAAS,EAAW,GAA4D;CAO5E,OANI,aAAkB,mBACX;EAAE,OAAO,EAAO;EAAY,QAAQ,EAAO;CAAY,IAE9D,aAAkB,oBACX;EAAE,OAAO,EAAO;EAAO,QAAQ,EAAO;CAAO,IAEjD;EACH,OAAO,EAAO,gBAAgB,EAAO;EACrC,QAAQ,EAAO,iBAAiB,EAAO;CAC3C;AACJ;AAmBA,SAAgB,EACZ,GACA,GACM;CACN,IAAM,EAAE,OAAO,GAAM,QAAQ,MAAS,EAAW,CAAM;CACvD,IAAI,MAAS,KAAK,MAAS,GAAG,OAAO;CAErC,IAAM,IAAQ,KAAK,IAAI,GAAA,MAA+B,KAAK,IAAI,GAAM,CAAI,CAAC,GACpE,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,IAAO,CAAK,CAAC,GACxC,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,IAAO,CAAK,CAAC,GAExC,IAAS,KAAkB,SAAS,cAAc,QAAQ;CAEhE,AADA,EAAO,QAAQ,GACf,EAAO,SAAS;CAChB,IAAM,IAAM,EAAO,WAAW,MAAM,EAAE,oBAAoB,GAAK,CAAC;CAChE,IAAI,CAAC,GAAK,OAAO;CACjB,EAAI,UAAU,GAAQ,GAAG,GAAG,GAAG,CAAC;CAEhC,IAAM,IAAO,EAAI,aAAa,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,MACtC,IAAM,GACJ,IAAa,IAAI;CACvB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,KAAK,GAClC,KAAO,QAAS,EAAK,KAAK,QAAS,EAAK,IAAI,KAAK,QAAS,EAAK,IAAI;CAEvE,OAAO,IAAM;AACjB;AAcA,SAAgB,EAAsB,GAAmB,GAA4B;CACjF,OAAO,KAAa;AACxB;AAOA,IAAa,IAAb,cAAuC,MAAM;CAEzC;CAEA;CAMA,YAAY,GAAmB,GAAmB;EAI9C,AAHA,MAAM,wEAAwE,GAC9E,KAAK,OAAO,qBACZ,KAAK,YAAY,GACjB,KAAK,YAAY;CACrB;AACJ"}

package/dist/vision/postprocess/classification.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function l(e){const c=e.length,o=new Float32Array(c);let f=-1/0;for(let t=0;t<c;t++){const r=e[t];r>f&&(f=r)}let a=0;for(let t=0;t<c;t++){const r=Math.exp(e[t]-f);o[t]=r,a+=r}for(let t=0;t<c;t++)o[t]=o[t]/a;return o}function u(e,c){const o=e.length,f=c===null?o:Math.min(Math.max(0,c),o),a=new Array(o);for(let n=0;n<o;n++)a[n]=n;a.sort((n,s)=>e[s]-e[n]);const t=new Int32Array(f),r=new Float32Array(f);for(let n=0;n<f;n++){const s=a[n];t[n]=s,r[n]=e[s]}return{indices:t,values:r}}exports.softmax=l;exports.topK=u;
-//# sourceMappingURL=classification.cjs.map
+function e(e){let t=e.length,n=new Float32Array(t),r=-1/0;for(let n=0;n<t;n++){let t=e[n];t>r&&(r=t)}let i=0;for(let a=0;a<t;a++){let t=Math.exp(e[a]-r);n[a]=t,i+=t}for(let e=0;e<t;e++)n[e]=n[e]/i;return n}function t(e,t){let n=e.length,r=t===null?n:Math.min(Math.max(0,t),n),i=Array(n);for(let e=0;e<n;e++)i[e]=e;i.sort((t,n)=>e[n]-e[t]);let a=new Int32Array(r),o=new Float32Array(r);for(let t=0;t<r;t++){let n=i[t];a[t]=n,o[t]=e[n]}return{indices:a,values:o}}exports.softmax=e,exports.topK=t;
+//# sourceMappingURL=classification.cjs.map

package/dist/vision/postprocess/classification.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"classification.cjs","sources":["../../../src/vision/postprocess/classification.ts"],"sourcesContent":["/**\n * Classification head postprocessing — softmax + top-k.\n */\n\n/** Apply numerically-stable softmax to a 1-D vector of logits. */\nexport function softmax(logits: Float32Array | readonly number[]): Float32Array {\n    const n = logits.length;\n    const out = new Float32Array(n);\n    let max = -Infinity;\n    for (let i = 0; i < n; i++) {\n        const v = logits[i] as number;\n        if (v > max) max = v;\n    }\n    let sum = 0;\n    for (let i = 0; i < n; i++) {\n        const e = Math.exp((logits[i] as number) - max);\n        out[i] = e;\n        sum += e;\n    }\n    for (let i = 0; i < n; i++) {\n        out[i] = (out[i] as number) / sum;\n    }\n    return out;\n}\n\nexport interface TopKResult {\n    readonly indices: Int32Array;\n    readonly values: Float32Array;\n}\n\n/**\n * Return the top-k entries of a 1-D probability vector, sorted descending.\n *\n * @param k Number of entries to return; `null` returns all entries.\n */\nexport function topK(probabilities: Float32Array, k: number | null): TopKResult {\n    const n = probabilities.length;\n    const kEff = k === null ? n : Math.min(Math.max(0, k), n);\n\n    const idx = new Array<number>(n);\n    for (let i = 0; i < n; i++) idx[i] = i;\n    idx.sort((a, b) => (probabilities[b] as number) - (probabilities[a] as number));\n\n    const indices = new Int32Array(kEff);\n    const values = new Float32Array(kEff);\n    for (let i = 0; i < kEff; i++) {\n        const j = idx[i] as number;\n        indices[i] = j;\n        values[i] = probabilities[j] as number;\n    }\n    return { indices, values };\n}\n"],"names":["softmax","logits","n","out","max","i","v","sum","e","topK","probabilities","k","kEff","idx","a","b","indices","values","j"],"mappings":"gFAKO,SAASA,EAAQC,EAAwD,CAC5E,MAAMC,EAAID,EAAO,OACXE,EAAM,IAAI,aAAaD,CAAC,EAC9B,IAAIE,EAAM,KACV,QAASC,EAAI,EAAGA,EAAIH,EAAGG,IAAK,CACxB,MAAMC,EAAIL,EAAOI,CAAC,EACdC,EAAIF,IAAKA,EAAME,EACvB,CACA,IAAIC,EAAM,EACV,QAASF,EAAI,EAAGA,EAAIH,EAAGG,IAAK,CACxB,MAAMG,EAAI,KAAK,IAAKP,EAAOI,CAAC,EAAeD,CAAG,EAC9CD,EAAIE,CAAC,EAAIG,EACTD,GAAOC,CACX,CACA,QAASH,EAAI,EAAGA,EAAIH,EAAGG,IACnBF,EAAIE,CAAC,EAAKF,EAAIE,CAAC,EAAeE,EAElC,OAAOJ,CACX,CAYO,SAASM,EAAKC,EAA6BC,EAA8B,CAC5E,MAAMT,EAAIQ,EAAc,OAClBE,EAAOD,IAAM,KAAOT,EAAI,KAAK,IAAI,KAAK,IAAI,EAAGS,CAAC,EAAGT,CAAC,EAElDW,EAAM,IAAI,MAAcX,CAAC,EAC/B,QAASG,EAAI,EAAGA,EAAIH,EAAGG,IAAKQ,EAAIR,CAAC,EAAIA,EACrCQ,EAAI,KAAK,CAACC,EAAGC,IAAOL,EAAcK,CAAC,EAAgBL,EAAcI,CAAC,CAAY,EAE9E,MAAME,EAAU,IAAI,WAAWJ,CAAI,EAC7BK,EAAS,IAAI,aAAaL,CAAI,EACpC,QAASP,EAAI,EAAGA,EAAIO,EAAMP,IAAK,CAC3B,MAAMa,EAAIL,EAAIR,CAAC,EACfW,EAAQX,CAAC,EAAIa,EACbD,EAAOZ,CAAC,EAAIK,EAAcQ,CAAC,CAC/B,CACA,MAAO,CAAE,QAAAF,EAAS,OAAAC,CAAA,CACtB"}
+{"version":3,"file":"classification.cjs","names":[],"sources":["../../../src/vision/postprocess/classification.ts"],"sourcesContent":["/**\n * Classification head postprocessing — softmax + top-k.\n */\n\n/** Apply numerically-stable softmax to a 1-D vector of logits. */\nexport function softmax(logits: Float32Array | readonly number[]): Float32Array {\n    const n = logits.length;\n    const out = new Float32Array(n);\n    let max = -Infinity;\n    for (let i = 0; i < n; i++) {\n        const v = logits[i] as number;\n        if (v > max) max = v;\n    }\n    let sum = 0;\n    for (let i = 0; i < n; i++) {\n        const e = Math.exp((logits[i] as number) - max);\n        out[i] = e;\n        sum += e;\n    }\n    for (let i = 0; i < n; i++) {\n        out[i] = (out[i] as number) / sum;\n    }\n    return out;\n}\n\nexport interface TopKResult {\n    readonly indices: Int32Array;\n    readonly values: Float32Array;\n}\n\n/**\n * Return the top-k entries of a 1-D probability vector, sorted descending.\n *\n * @param k Number of entries to return; `null` returns all entries.\n */\nexport function topK(probabilities: Float32Array, k: number | null): TopKResult {\n    const n = probabilities.length;\n    const kEff = k === null ? n : Math.min(Math.max(0, k), n);\n\n    const idx = new Array<number>(n);\n    for (let i = 0; i < n; i++) idx[i] = i;\n    idx.sort((a, b) => (probabilities[b] as number) - (probabilities[a] as number));\n\n    const indices = new Int32Array(kEff);\n    const values = new Float32Array(kEff);\n    for (let i = 0; i < kEff; i++) {\n        const j = idx[i] as number;\n        indices[i] = j;\n        values[i] = probabilities[j] as number;\n    }\n    return { indices, values };\n}\n"],"mappings":"AAKA,SAAgB,EAAQ,EAAwD,CAC5E,IAAM,EAAI,EAAO,OACX,EAAM,IAAI,aAAa,CAAC,EAC1B,EAAM,KACV,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,IAAM,EAAI,EAAO,GACb,EAAI,IAAK,EAAM,EACvB,CACA,IAAI,EAAM,EACV,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,IAAM,EAAI,KAAK,IAAK,EAAO,GAAgB,CAAG,EAC9C,EAAI,GAAK,EACT,GAAO,CACX,CACA,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IACnB,EAAI,GAAM,EAAI,GAAgB,EAElC,OAAO,CACX,CAYA,SAAgB,EAAK,EAA6B,EAA8B,CAC5E,IAAM,EAAI,EAAc,OAClB,EAAO,IAAM,KAAO,EAAI,KAAK,IAAI,KAAK,IAAI,EAAG,CAAC,EAAG,CAAC,EAElD,EAAU,MAAc,CAAC,EAC/B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,EAAI,GAAK,EACrC,EAAI,MAAM,EAAG,IAAO,EAAc,GAAiB,EAAc,EAAa,EAE9E,IAAM,EAAU,IAAI,WAAW,CAAI,EAC7B,EAAS,IAAI,aAAa,CAAI,EACpC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAAK,CAC3B,IAAM,EAAI,EAAI,GACd,EAAQ,GAAK,EACb,EAAO,GAAK,EAAc,EAC9B,CACA,MAAO,CAAE,UAAS,QAAO,CAC7B"}

package/dist/vision/postprocess/classification.js

@@ -1,32 +1,33 @@
-function l(e) {
-  const c = e.length, o = new Float32Array(c);
-  let f = -1 / 0;
-  for (let n = 0; n < c; n++) {
-    const r = e[n];
-    r > f && (f = r);
-  }
-  let a = 0;
-  for (let n = 0; n < c; n++) {
-    const r = Math.exp(e[n] - f);
-    o[n] = r, a += r;
-  }
-  for (let n = 0; n < c; n++)
-    o[n] = o[n] / a;
-  return o;
+//#region src/vision/postprocess/classification.ts
+function e(e) {
+	let t = e.length, n = new Float32Array(t), r = -Infinity;
+	for (let n = 0; n < t; n++) {
+		let t = e[n];
+		t > r && (r = t);
+	}
+	let i = 0;
+	for (let a = 0; a < t; a++) {
+		let t = Math.exp(e[a] - r);
+		n[a] = t, i += t;
+	}
+	for (let e = 0; e < t; e++) n[e] = n[e] / i;
+	return n;
 }
-function u(e, c) {
-  const o = e.length, f = c === null ? o : Math.min(Math.max(0, c), o), a = new Array(o);
-  for (let t = 0; t < o; t++) a[t] = t;
-  a.sort((t, s) => e[s] - e[t]);
-  const n = new Int32Array(f), r = new Float32Array(f);
-  for (let t = 0; t < f; t++) {
-    const s = a[t];
-    n[t] = s, r[t] = e[s];
-  }
-  return { indices: n, values: r };
+function t(e, t) {
+	let n = e.length, r = t === null ? n : Math.min(Math.max(0, t), n), i = Array(n);
+	for (let e = 0; e < n; e++) i[e] = e;
+	i.sort((t, n) => e[n] - e[t]);
+	let a = new Int32Array(r), o = new Float32Array(r);
+	for (let t = 0; t < r; t++) {
+		let n = i[t];
+		a[t] = n, o[t] = e[n];
+	}
+	return {
+		indices: a,
+		values: o
+	};
 }
-export {
-  l as softmax,
-  u as topK
-};
-//# sourceMappingURL=classification.js.map
+//#endregion
+export { e as softmax, t as topK };
+
+//# sourceMappingURL=classification.js.map

package/dist/vision/postprocess/classification.js.map

@@ -1 +1 @@
-{"version":3,"file":"classification.js","sources":["../../../src/vision/postprocess/classification.ts"],"sourcesContent":["/**\n * Classification head postprocessing — softmax + top-k.\n */\n\n/** Apply numerically-stable softmax to a 1-D vector of logits. */\nexport function softmax(logits: Float32Array | readonly number[]): Float32Array {\n    const n = logits.length;\n    const out = new Float32Array(n);\n    let max = -Infinity;\n    for (let i = 0; i < n; i++) {\n        const v = logits[i] as number;\n        if (v > max) max = v;\n    }\n    let sum = 0;\n    for (let i = 0; i < n; i++) {\n        const e = Math.exp((logits[i] as number) - max);\n        out[i] = e;\n        sum += e;\n    }\n    for (let i = 0; i < n; i++) {\n        out[i] = (out[i] as number) / sum;\n    }\n    return out;\n}\n\nexport interface TopKResult {\n    readonly indices: Int32Array;\n    readonly values: Float32Array;\n}\n\n/**\n * Return the top-k entries of a 1-D probability vector, sorted descending.\n *\n * @param k Number of entries to return; `null` returns all entries.\n */\nexport function topK(probabilities: Float32Array, k: number | null): TopKResult {\n    const n = probabilities.length;\n    const kEff = k === null ? n : Math.min(Math.max(0, k), n);\n\n    const idx = new Array<number>(n);\n    for (let i = 0; i < n; i++) idx[i] = i;\n    idx.sort((a, b) => (probabilities[b] as number) - (probabilities[a] as number));\n\n    const indices = new Int32Array(kEff);\n    const values = new Float32Array(kEff);\n    for (let i = 0; i < kEff; i++) {\n        const j = idx[i] as number;\n        indices[i] = j;\n        values[i] = probabilities[j] as number;\n    }\n    return { indices, values };\n}\n"],"names":["softmax","logits","n","out","max","i","v","sum","e","topK","probabilities","k","kEff","idx","a","b","indices","values","j"],"mappings":"AAKO,SAASA,EAAQC,GAAwD;AAC5E,QAAMC,IAAID,EAAO,QACXE,IAAM,IAAI,aAAaD,CAAC;AAC9B,MAAIE,IAAM;AACV,WAASC,IAAI,GAAGA,IAAIH,GAAGG,KAAK;AACxB,UAAMC,IAAIL,EAAOI,CAAC;AAClB,IAAIC,IAAIF,MAAKA,IAAME;AAAA,EACvB;AACA,MAAIC,IAAM;AACV,WAASF,IAAI,GAAGA,IAAIH,GAAGG,KAAK;AACxB,UAAMG,IAAI,KAAK,IAAKP,EAAOI,CAAC,IAAeD,CAAG;AAC9C,IAAAD,EAAIE,CAAC,IAAIG,GACTD,KAAOC;AAAA,EACX;AACA,WAASH,IAAI,GAAGA,IAAIH,GAAGG;AACnB,IAAAF,EAAIE,CAAC,IAAKF,EAAIE,CAAC,IAAeE;AAElC,SAAOJ;AACX;AAYO,SAASM,EAAKC,GAA6BC,GAA8B;AAC5E,QAAMT,IAAIQ,EAAc,QAClBE,IAAOD,MAAM,OAAOT,IAAI,KAAK,IAAI,KAAK,IAAI,GAAGS,CAAC,GAAGT,CAAC,GAElDW,IAAM,IAAI,MAAcX,CAAC;AAC/B,WAASG,IAAI,GAAGA,IAAIH,GAAGG,IAAK,CAAAQ,EAAIR,CAAC,IAAIA;AACrC,EAAAQ,EAAI,KAAK,CAACC,GAAGC,MAAOL,EAAcK,CAAC,IAAgBL,EAAcI,CAAC,CAAY;AAE9E,QAAME,IAAU,IAAI,WAAWJ,CAAI,GAC7BK,IAAS,IAAI,aAAaL,CAAI;AACpC,WAASP,IAAI,GAAGA,IAAIO,GAAMP,KAAK;AAC3B,UAAMa,IAAIL,EAAIR,CAAC;AACf,IAAAW,EAAQX,CAAC,IAAIa,GACbD,EAAOZ,CAAC,IAAIK,EAAcQ,CAAC;AAAA,EAC/B;AACA,SAAO,EAAE,SAAAF,GAAS,QAAAC,EAAA;AACtB;"}
+{"version":3,"file":"classification.js","names":[],"sources":["../../../src/vision/postprocess/classification.ts"],"sourcesContent":["/**\n * Classification head postprocessing — softmax + top-k.\n */\n\n/** Apply numerically-stable softmax to a 1-D vector of logits. */\nexport function softmax(logits: Float32Array | readonly number[]): Float32Array {\n    const n = logits.length;\n    const out = new Float32Array(n);\n    let max = -Infinity;\n    for (let i = 0; i < n; i++) {\n        const v = logits[i] as number;\n        if (v > max) max = v;\n    }\n    let sum = 0;\n    for (let i = 0; i < n; i++) {\n        const e = Math.exp((logits[i] as number) - max);\n        out[i] = e;\n        sum += e;\n    }\n    for (let i = 0; i < n; i++) {\n        out[i] = (out[i] as number) / sum;\n    }\n    return out;\n}\n\nexport interface TopKResult {\n    readonly indices: Int32Array;\n    readonly values: Float32Array;\n}\n\n/**\n * Return the top-k entries of a 1-D probability vector, sorted descending.\n *\n * @param k Number of entries to return; `null` returns all entries.\n */\nexport function topK(probabilities: Float32Array, k: number | null): TopKResult {\n    const n = probabilities.length;\n    const kEff = k === null ? n : Math.min(Math.max(0, k), n);\n\n    const idx = new Array<number>(n);\n    for (let i = 0; i < n; i++) idx[i] = i;\n    idx.sort((a, b) => (probabilities[b] as number) - (probabilities[a] as number));\n\n    const indices = new Int32Array(kEff);\n    const values = new Float32Array(kEff);\n    for (let i = 0; i < kEff; i++) {\n        const j = idx[i] as number;\n        indices[i] = j;\n        values[i] = probabilities[j] as number;\n    }\n    return { indices, values };\n}\n"],"mappings":";AAKA,SAAgB,EAAQ,GAAwD;CAC5E,IAAM,IAAI,EAAO,QACX,IAAM,IAAI,aAAa,CAAC,GAC1B,IAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EACxB,IAAM,IAAI,EAAO;EACjB,AAAI,IAAI,MAAK,IAAM;CACvB;CACA,IAAI,IAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EACxB,IAAM,IAAI,KAAK,IAAK,EAAO,KAAgB,CAAG;EAE9C,AADA,EAAI,KAAK,GACT,KAAO;CACX;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACnB,EAAI,KAAM,EAAI,KAAgB;CAElC,OAAO;AACX;AAYA,SAAgB,EAAK,GAA6B,GAA8B;CAC5E,IAAM,IAAI,EAAc,QAClB,IAAO,MAAM,OAAO,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC,GAElD,IAAU,MAAc,CAAC;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,EAAI,KAAK;CACrC,EAAI,MAAM,GAAG,MAAO,EAAc,KAAiB,EAAc,EAAa;CAE9E,IAAM,IAAU,IAAI,WAAW,CAAI,GAC7B,IAAS,IAAI,aAAa,CAAI;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KAAK;EAC3B,IAAM,IAAI,EAAI;EAEd,AADA,EAAQ,KAAK,GACb,EAAO,KAAK,EAAc;CAC9B;CACA,OAAO;EAAE;EAAS;CAAO;AAC7B"}

package/dist/vision/postprocess/detection.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const L=require("../types.cjs");function H(n,a,y){const c=a.length;if(c===0)return new Int32Array(0);const h=new Float32Array(c);for(let o=0;o<c;o++){const d=n[o*4],A=n[o*4+1],l=n[o*4+2],w=n[o*4+3];h[o]=Math.max(0,l-d)*Math.max(0,w-A)}const t=new Array(c);for(let o=0;o<c;o++)t[o]=o;t.sort((o,d)=>a[d]-a[o]);const s=new Uint8Array(c),r=[];for(let o=0;o<t.length;o++){const d=t[o];if(s[d])continue;r.push(d);const A=n[d*4],l=n[d*4+1],w=n[d*4+2],C=n[d*4+3],E=h[d];for(let u=o+1;u<t.length;u++){const f=t[u];if(s[f])continue;const b=n[f*4],v=n[f*4+1],F=n[f*4+2],k=n[f*4+3],m=Math.max(A,b),V=Math.max(l,v),x=Math.min(w,F),$=Math.min(C,k),T=Math.max(0,x-m),e=Math.max(0,$-V),i=T*e,g=E+h[f]-i;(g>0?i/g:0)>y&&(s[f]=1)}}return Int32Array.from(r)}function J(n,a,y,c){if(a.length===0)return new Int32Array(0);const h=new Map;for(let s=0;s<y.length;s++){const r=y[s],o=h.get(r);o===void 0?h.set(r,[s]):o.push(s)}const t=[];for(const s of h.values()){const r=s.length,o=new Float32Array(r*4),d=new Float32Array(r);for(let l=0;l<r;l++){const w=s[l];o[l*4]=n[w*4],o[l*4+1]=n[w*4+1],o[l*4+2]=n[w*4+2],o[l*4+3]=n[w*4+3],d[l]=a[w]}const A=H(o,d,c);for(let l=0;l<A.length;l++)t.push(s[A[l]])}return t.sort((s,r)=>a[r]-a[s]),Int32Array.from(t)}function j(n,a,y){let c=a;if(c.length===3){if(c[0]!==1)throw new Error(`decodeYoloAnchors: expected batch size 1, got ${c[0]}.`);c=[c[1],c[2]]}if(c.length!==2)throw new Error(`decodeYoloAnchors: expected 2-D output after batch removal, got dims=${JSON.stringify(a)}.`);const h=c[0],t=c[1],{numClasses:s,originalWidth:r,originalHeight:o,padLeft:d,padTop:A,scale:l,confThreshold:w,iouThreshold:C,maxDetections:E}=y;if(s<1||s+4>h)throw new Error(`decodeYoloAnchors: invalid numClasses=${s} for channels=${h}.`);if(n.length!==h*t)throw new Error(`decodeYoloAnchors: data length ${n.length} does not match channels*numAnchors=${h*t}.`);const u=[];for(let e=0;e<t;e++){let i=0,g=-1/0;for(let X=0;X<s;X++){const B=n[(4+X)*t+e];B!==void 0&&B>g&&(g=B,i=X)}if(g<w)continue;const S=n[e],N=n[t+e],z=n[2*t+e],D=n[3*t+e];let p=S-z/2,I=N-D/2,Y=S+z/2,M=N+D/2;p=(p-d)/l,I=(I-A)/l,Y=(Y-d)/l,M=(M-A)/l,p=Math.max(0,Math.min(r,p)),I=Math.max(0,Math.min(o,I)),Y=Math.max(0,Math.min(r,Y)),M=Math.max(0,Math.min(o,M)),u.push({anchorIdx:e,x1:p,y1:I,x2:Y,y2:M,classId:i,confidence:g})}if(u.length===0)return O();const f=new Float32Array(u.length*4),b=new Float32Array(u.length),v=new Int32Array(u.length);for(let e=0;e<u.length;e++){const i=u[e];f[e*4]=i.x1,f[e*4+1]=i.y1,f[e*4+2]=i.x2,f[e*4+3]=i.y2,b[e]=i.confidence,v[e]=i.classId}const F=J(f,b,v,C);if(F.length===0)return O();const k=Array.from(F).slice(0,E),m=k.length,V=new Int32Array(m),x=new Float32Array(m*4),$=new Int32Array(m),T=new Float32Array(m);for(let e=0;e<m;e++){const i=u[k[e]];V[e]=i.anchorIdx,x[e*4]=i.x1,x[e*4+1]=i.y1,x[e*4+2]=i.x2,x[e*4+3]=i.y2,$[e]=i.classId,T[e]=i.confidence}return{anchorIndices:V,boxesXyxy:x,classIds:$,confidences:T}}function O(){return{anchorIndices:new Int32Array(0),boxesXyxy:new Float32Array(0),classIds:new Int32Array(0),confidences:new Float32Array(0)}}function K(n,a,y){const c=a.length===3?a[1]:a[0];if(c===void 0||c<5)throw new Error(`decodeYolo: invalid output channel count ${c} (expected >= 5).`);const h=c-4,t=j(n,a,{numClasses:h,...y}),s=[];for(let r=0;r<t.classIds.length;r++)s.push({bbox:new L.BoundingBox(t.boxesXyxy[r*4],t.boxesXyxy[r*4+1],t.boxesXyxy[r*4+2],t.boxesXyxy[r*4+3]),classId:t.classIds[r],confidence:t.confidences[r]});return s}let _=!1,q=!1;function P(n,a,y){return _||(_=!0,console.warn("[@ort-vision-sdk/web] decodeYoloV8 is deprecated since 0.2.0; use decodeYolo. The alias will be removed in 0.3.0.")),K(n,a,y)}function U(n,a,y){return q||(q=!0,console.warn("[@ort-vision-sdk/web] decodeYoloV8Anchors is deprecated since 0.2.0; use decodeYoloAnchors. The alias will be removed in 0.3.0.")),j(n,a,y)}exports.batchedNms=J;exports.decodeYolo=K;exports.decodeYoloAnchors=j;exports.decodeYoloV8=P;exports.decodeYoloV8Anchors=U;exports.nms=H;
-//# sourceMappingURL=detection.cjs.map
+const e=require("../types.cjs");function t(e,t,n){let r=t.length;if(r===0)return new Int32Array;let i=new Float32Array(r);for(let t=0;t<r;t++){let n=e[t*4],r=e[t*4+1],a=e[t*4+2],o=e[t*4+3];i[t]=Math.max(0,a-n)*Math.max(0,o-r)}let a=Array(r);for(let e=0;e<r;e++)a[e]=e;a.sort((e,n)=>t[n]-t[e]);let o=new Uint8Array(r),s=[];for(let t=0;t<a.length;t++){let r=a[t];if(o[r])continue;s.push(r);let c=e[r*4],l=e[r*4+1],u=e[r*4+2],d=e[r*4+3],f=i[r];for(let r=t+1;r<a.length;r++){let t=a[r];if(o[t])continue;let s=e[t*4],p=e[t*4+1],m=e[t*4+2],h=e[t*4+3],g=Math.max(c,s),_=Math.max(l,p),v=Math.min(u,m),y=Math.min(d,h),b=Math.max(0,v-g)*Math.max(0,y-_),x=f+i[t]-b;(x>0?b/x:0)>n&&(o[t]=1)}}return Int32Array.from(s)}function n(e,n,r,i){if(n.length===0)return new Int32Array;let a=new Map;for(let e=0;e<r.length;e++){let t=r[e],n=a.get(t);n===void 0?a.set(t,[e]):n.push(e)}let o=[];for(let r of a.values()){let a=r.length,s=new Float32Array(a*4),c=new Float32Array(a);for(let t=0;t<a;t++){let i=r[t];s[t*4]=e[i*4],s[t*4+1]=e[i*4+1],s[t*4+2]=e[i*4+2],s[t*4+3]=e[i*4+3],c[t]=n[i]}let l=t(s,c,i);for(let e=0;e<l.length;e++)o.push(r[l[e]])}return o.sort((e,t)=>n[t]-n[e]),Int32Array.from(o)}function r(e,t,r){let a=t;if(a.length===3){if(a[0]!==1)throw Error(`decodeYoloAnchors: expected batch size 1, got ${a[0]}.`);a=[a[1],a[2]]}if(a.length!==2)throw Error(`decodeYoloAnchors: expected 2-D output after batch removal, got dims=${JSON.stringify(t)}.`);let o=a[0],s=a[1],{numClasses:c,originalWidth:l,originalHeight:u,padLeft:d,padTop:f,scale:p,confThreshold:m,iouThreshold:h,maxDetections:g}=r;if(c<1||c+4>o)throw Error(`decodeYoloAnchors: invalid numClasses=${c} for channels=${o}.`);if(e.length!==o*s)throw Error(`decodeYoloAnchors: data length ${e.length} does not match channels*numAnchors=${o*s}.`);let _=[];for(let t=0;t<s;t++){let n=0,r=-1/0;for(let i=0;i<c;i++){let a=e[(4+i)*s+t];a!==void 0&&a>r&&(r=a,n=i)}if(r<m)continue;let i=e[t],a=e[s+t],o=e[2*s+t],h=e[3*s+t],g=i-o/2,v=a-h/2,y=i+o/2,b=a+h/2;g=(g-d)/p,v=(v-f)/p,y=(y-d)/p,b=(b-f)/p,g=Math.max(0,Math.min(l,g)),v=Math.max(0,Math.min(u,v)),y=Math.max(0,Math.min(l,y)),b=Math.max(0,Math.min(u,b)),_.push({anchorIdx:t,x1:g,y1:v,x2:y,y2:b,classId:n,confidence:r})}if(_.length===0)return i();let v=new Float32Array(_.length*4),y=new Float32Array(_.length),b=new Int32Array(_.length);for(let e=0;e<_.length;e++){let t=_[e];v[e*4]=t.x1,v[e*4+1]=t.y1,v[e*4+2]=t.x2,v[e*4+3]=t.y2,y[e]=t.confidence,b[e]=t.classId}let x=n(v,y,b,h);if(x.length===0)return i();let S=Array.from(x).slice(0,g),C=S.length,w=new Int32Array(C),T=new Float32Array(C*4),E=new Int32Array(C),D=new Float32Array(C);for(let e=0;e<C;e++){let t=_[S[e]];w[e]=t.anchorIdx,T[e*4]=t.x1,T[e*4+1]=t.y1,T[e*4+2]=t.x2,T[e*4+3]=t.y2,E[e]=t.classId,D[e]=t.confidence}return{anchorIndices:w,boxesXyxy:T,classIds:E,confidences:D}}function i(){return{anchorIndices:new Int32Array,boxesXyxy:new Float32Array,classIds:new Int32Array,confidences:new Float32Array}}function a(t,n,i){let a=n.length===3?n[1]:n[0];if(a===void 0||a<5)throw Error(`decodeYolo: invalid output channel count ${a} (expected >= 5).`);let o=r(t,n,{numClasses:a-4,...i}),s=[];for(let t=0;t<o.classIds.length;t++)s.push({bbox:new e.BoundingBox(o.boxesXyxy[t*4],o.boxesXyxy[t*4+1],o.boxesXyxy[t*4+2],o.boxesXyxy[t*4+3]),classId:o.classIds[t],confidence:o.confidences[t]});return s}var o=!1,s=!1;function c(e,t,n){return o||(o=!0,console.warn(`[@ort-vision-sdk/web] decodeYoloV8 is deprecated since 0.2.0; use decodeYolo. The alias will be removed in 0.3.0.`)),a(e,t,n)}function l(e,t,n){return s||(s=!0,console.warn(`[@ort-vision-sdk/web] decodeYoloV8Anchors is deprecated since 0.2.0; use decodeYoloAnchors. The alias will be removed in 0.3.0.`)),r(e,t,n)}exports.batchedNms=n,exports.decodeYolo=a,exports.decodeYoloAnchors=r,exports.decodeYoloV8=c,exports.decodeYoloV8Anchors=l,exports.nms=t;
+//# sourceMappingURL=detection.cjs.map

package/dist/vision/postprocess/detection.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"detection.cjs","sources":["../../../src/vision/postprocess/detection.ts"],"sourcesContent":["/**\n * Detection head postprocessing: anchor-free YOLO decoding + non-maximum suppression.\n *\n * The shared {@link decodeYoloAnchors} helper does the per-anchor work that\n * is identical for plain detection and segmentation (transpose, xywh→xyxy,\n * letterbox unmap, per-class NMS, sort & cap). {@link decodeYolo} is a thin\n * wrapper around it; the segmentation module ({@link ./segmentation.js})\n * calls the helper directly so it can also recover the per-anchor mask\n * coefficients.\n *\n * Works for any YOLO export with the post-v8 anchor-free head:\n * **YOLOv8 / v9 / v10 / v11 / v12** detect heads, all of which share the\n * `[1, 4 + nc, N]` output layout.\n */\n\nimport { BoundingBox } from \"../types\";\n\n/**\n * Greedy non-maximum suppression on axis-aligned bounding boxes.\n *\n * Mirrors `torchvision.ops.nms` (keeps boxes with the highest score, drops\n * any subsequent box whose IoU exceeds the threshold).\n *\n * @param boxes Flat array of length `4 * N` in xyxy order: `[x1,y1,x2,y2, ...]`.\n * @param scores Detection score per box, length `N`.\n * @param iouThreshold Boxes with IoU above this threshold relative to a kept box are suppressed.\n * @returns Indices of kept boxes, in descending score order.\n */\nexport function nms(boxes: Float32Array, scores: Float32Array, iouThreshold: number): Int32Array {\n    const n = scores.length;\n    if (n === 0) return new Int32Array(0);\n\n    const areas = new Float32Array(n);\n    for (let i = 0; i < n; i++) {\n        const x1 = boxes[i * 4] as number;\n        const y1 = boxes[i * 4 + 1] as number;\n        const x2 = boxes[i * 4 + 2] as number;\n        const y2 = boxes[i * 4 + 3] as number;\n        areas[i] = Math.max(0, x2 - x1) * Math.max(0, y2 - y1);\n    }\n\n    const order = new Array<number>(n);\n    for (let i = 0; i < n; i++) order[i] = i;\n    order.sort((a, b) => (scores[b] as number) - (scores[a] as number));\n\n    const suppressed = new Uint8Array(n);\n    const keep: number[] = [];\n\n    for (let oi = 0; oi < order.length; oi++) {\n        const i = order[oi] as number;\n        if (suppressed[i]) continue;\n        keep.push(i);\n\n        const ax1 = boxes[i * 4] as number;\n        const ay1 = boxes[i * 4 + 1] as number;\n        const ax2 = boxes[i * 4 + 2] as number;\n        const ay2 = boxes[i * 4 + 3] as number;\n        const ai = areas[i] as number;\n\n        for (let oj = oi + 1; oj < order.length; oj++) {\n            const j = order[oj] as number;\n            if (suppressed[j]) continue;\n\n            const bx1 = boxes[j * 4] as number;\n            const by1 = boxes[j * 4 + 1] as number;\n            const bx2 = boxes[j * 4 + 2] as number;\n            const by2 = boxes[j * 4 + 3] as number;\n\n            const ix1 = Math.max(ax1, bx1);\n            const iy1 = Math.max(ay1, by1);\n            const ix2 = Math.min(ax2, bx2);\n            const iy2 = Math.min(ay2, by2);\n            const iw = Math.max(0, ix2 - ix1);\n            const ih = Math.max(0, iy2 - iy1);\n            const inter = iw * ih;\n            const union = ai + (areas[j] as number) - inter;\n            const iou = union > 0 ? inter / union : 0;\n            if (iou > iouThreshold) suppressed[j] = 1;\n        }\n    }\n\n    return Int32Array.from(keep);\n}\n\n/**\n * Per-class NMS — boxes are suppressed only by other boxes of the same class.\n *\n * Mirrors `torchvision.ops.batched_nms`.\n *\n * @param boxes Flat array of length `4 * N` in xyxy order.\n * @param scores Detection score per box, length `N`.\n * @param idxs Class index per box, length `N`. Boxes with different `idxs`\n *   never suppress each other.\n * @param iouThreshold IoU threshold for suppression within a class.\n */\nexport function batchedNms(\n    boxes: Float32Array,\n    scores: Float32Array,\n    idxs: Int32Array,\n    iouThreshold: number,\n): Int32Array {\n    if (scores.length === 0) return new Int32Array(0);\n\n    const byClass = new Map<number, number[]>();\n    for (let i = 0; i < idxs.length; i++) {\n        const c = idxs[i] as number;\n        const list = byClass.get(c);\n        if (list === undefined) byClass.set(c, [i]);\n        else list.push(i);\n    }\n\n    const keep: number[] = [];\n    for (const indices of byClass.values()) {\n        const m = indices.length;\n        const subBoxes = new Float32Array(m * 4);\n        const subScores = new Float32Array(m);\n        for (let k = 0; k < m; k++) {\n            const i = indices[k] as number;\n            subBoxes[k * 4] = boxes[i * 4] as number;\n            subBoxes[k * 4 + 1] = boxes[i * 4 + 1] as number;\n            subBoxes[k * 4 + 2] = boxes[i * 4 + 2] as number;\n            subBoxes[k * 4 + 3] = boxes[i * 4 + 3] as number;\n            subScores[k] = scores[i] as number;\n        }\n        const subKeep = nms(subBoxes, subScores, iouThreshold);\n        for (let k = 0; k < subKeep.length; k++) {\n            keep.push(indices[subKeep[k] as number] as number);\n        }\n    }\n\n    keep.sort((a, b) => (scores[b] as number) - (scores[a] as number));\n    return Int32Array.from(keep);\n}\n\nexport interface DecodeYoloAnchorsOptions {\n    /** Number of class-score channels following the 4 box channels. */\n    readonly numClasses: number;\n    readonly originalWidth: number;\n    readonly originalHeight: number;\n    readonly padLeft: number;\n    readonly padTop: number;\n    readonly scale: number;\n    readonly confThreshold: number;\n    readonly iouThreshold: number;\n    readonly maxDetections: number;\n}\n\nexport interface DecodedAnchors {\n    /** Indices into the original `numAnchors` axis, in descending confidence order. */\n    readonly anchorIndices: Int32Array;\n    /** `[k, 4]` boxes in original-image pixel coords, flat row-major xyxy. */\n    readonly boxesXyxy: Float32Array;\n    /** Predicted class id per survivor. */\n    readonly classIds: Int32Array;\n    /** Confidence per survivor. */\n    readonly confidences: Float32Array;\n}\n\n/**\n * Shared YOLO per-anchor decode used by both detection and segmentation\n * (v8 / v9 / v10 / v11 / v12).\n *\n * Only the first `4 + numClasses` channels are read; later channels (e.g.\n * mask coefficients) are ignored — callers can fetch them via the returned\n * {@link DecodedAnchors.anchorIndices}.\n *\n * @param data Flat per-anchor output, length `channels * numAnchors`.\n * @param dims Dims as reported by ORT, e.g. `[1, 84, 8400]` (det) or\n *   `[1, 116, 8400]` (seg). The leading batch dim must be 1.\n */\nexport function decodeYoloAnchors(\n    data: Float32Array,\n    dims: readonly number[],\n    options: DecodeYoloAnchorsOptions,\n): DecodedAnchors {\n    let normalized = dims;\n    if (normalized.length === 3) {\n        if (normalized[0] !== 1) {\n            throw new Error(`decodeYoloAnchors: expected batch size 1, got ${normalized[0]}.`);\n        }\n        normalized = [normalized[1] as number, normalized[2] as number];\n    }\n    if (normalized.length !== 2) {\n        throw new Error(\n            `decodeYoloAnchors: expected 2-D output after batch removal, got dims=${JSON.stringify(dims)}.`,\n        );\n    }\n    const channels = normalized[0] as number;\n    const numAnchors = normalized[1] as number;\n\n    const {\n        numClasses,\n        originalWidth,\n        originalHeight,\n        padLeft,\n        padTop,\n        scale,\n        confThreshold,\n        iouThreshold,\n        maxDetections,\n    } = options;\n\n    if (numClasses < 1 || numClasses + 4 > channels) {\n        throw new Error(\n            `decodeYoloAnchors: invalid numClasses=${numClasses} for channels=${channels}.`,\n        );\n    }\n    if (data.length !== channels * numAnchors) {\n        throw new Error(\n            `decodeYoloAnchors: data length ${data.length} does not match channels*numAnchors=${channels * numAnchors}.`,\n        );\n    }\n\n    type Candidate = {\n        anchorIdx: number;\n        x1: number;\n        y1: number;\n        x2: number;\n        y2: number;\n        classId: number;\n        confidence: number;\n    };\n    const candidates: Candidate[] = [];\n\n    for (let a = 0; a < numAnchors; a++) {\n        let bestCls = 0;\n        let bestScore = -Infinity;\n        for (let c = 0; c < numClasses; c++) {\n            const s = data[(4 + c) * numAnchors + a];\n            if (s !== undefined && s > bestScore) {\n                bestScore = s;\n                bestCls = c;\n            }\n        }\n        if (bestScore < confThreshold) continue;\n\n        const cx = data[a] as number;\n        const cy = data[numAnchors + a] as number;\n        const w = data[2 * numAnchors + a] as number;\n        const h = data[3 * numAnchors + a] as number;\n\n        let x1 = cx - w / 2;\n        let y1 = cy - h / 2;\n        let x2 = cx + w / 2;\n        let y2 = cy + h / 2;\n\n        x1 = (x1 - padLeft) / scale;\n        y1 = (y1 - padTop) / scale;\n        x2 = (x2 - padLeft) / scale;\n        y2 = (y2 - padTop) / scale;\n\n        x1 = Math.max(0, Math.min(originalWidth, x1));\n        y1 = Math.max(0, Math.min(originalHeight, y1));\n        x2 = Math.max(0, Math.min(originalWidth, x2));\n        y2 = Math.max(0, Math.min(originalHeight, y2));\n\n        candidates.push({ anchorIdx: a, x1, y1, x2, y2, classId: bestCls, confidence: bestScore });\n    }\n\n    if (candidates.length === 0) return emptyDecoded();\n\n    // Build flat arrays then delegate to batchedNms — same algorithm as before\n    // but funnelled through the public per-class NMS helper.\n    const flatBoxes = new Float32Array(candidates.length * 4);\n    const scoresArr = new Float32Array(candidates.length);\n    const idxsArr = new Int32Array(candidates.length);\n    for (let i = 0; i < candidates.length; i++) {\n        const c = candidates[i] as Candidate;\n        flatBoxes[i * 4] = c.x1;\n        flatBoxes[i * 4 + 1] = c.y1;\n        flatBoxes[i * 4 + 2] = c.x2;\n        flatBoxes[i * 4 + 3] = c.y2;\n        scoresArr[i] = c.confidence;\n        idxsArr[i] = c.classId;\n    }\n    const kept = batchedNms(flatBoxes, scoresArr, idxsArr, iouThreshold);\n    if (kept.length === 0) return emptyDecoded();\n\n    const limited = Array.from(kept).slice(0, maxDetections);\n    const k = limited.length;\n    const anchorIndices = new Int32Array(k);\n    const boxesXyxy = new Float32Array(k * 4);\n    const classIds = new Int32Array(k);\n    const confidences = new Float32Array(k);\n    for (let i = 0; i < k; i++) {\n        const c = candidates[limited[i] as number] as Candidate;\n        anchorIndices[i] = c.anchorIdx;\n        boxesXyxy[i * 4] = c.x1;\n        boxesXyxy[i * 4 + 1] = c.y1;\n        boxesXyxy[i * 4 + 2] = c.x2;\n        boxesXyxy[i * 4 + 3] = c.y2;\n        classIds[i] = c.classId;\n        confidences[i] = c.confidence;\n    }\n    return { anchorIndices, boxesXyxy, classIds, confidences };\n}\n\nfunction emptyDecoded(): DecodedAnchors {\n    return {\n        anchorIndices: new Int32Array(0),\n        boxesXyxy: new Float32Array(0),\n        classIds: new Int32Array(0),\n        confidences: new Float32Array(0),\n    };\n}\n\nexport interface DecodeYoloOptions {\n    readonly originalWidth: number;\n    readonly originalHeight: number;\n    readonly padLeft: number;\n    readonly padTop: number;\n    readonly scale: number;\n    readonly confThreshold: number;\n    readonly iouThreshold: number;\n    readonly maxDetections: number;\n}\n\nexport interface DecodedDetection {\n    readonly bbox: BoundingBox;\n    readonly classId: number;\n    readonly confidence: number;\n}\n\n/**\n * Decode an anchor-free YOLO detection output into a list of detections.\n *\n * Works for **YOLOv8 / v9 / v10 / v11 / v12** detect heads.\n *\n * Expected raw shape: `[1, 4 + numClasses, N]`. `numClasses` is inferred\n * from the channel count.\n */\nexport function decodeYolo(\n    output: Float32Array,\n    outputDims: readonly number[],\n    options: DecodeYoloOptions,\n): DecodedDetection[] {\n    const channels = outputDims.length === 3 ? outputDims[1] : outputDims[0];\n    if (channels === undefined || channels < 5) {\n        throw new Error(`decodeYolo: invalid output channel count ${channels} (expected >= 5).`);\n    }\n    const numClasses = channels - 4;\n\n    const decoded = decodeYoloAnchors(output, outputDims, {\n        numClasses,\n        ...options,\n    });\n\n    const results: DecodedDetection[] = [];\n    for (let i = 0; i < decoded.classIds.length; i++) {\n        results.push({\n            bbox: new BoundingBox(\n                decoded.boxesXyxy[i * 4] as number,\n                decoded.boxesXyxy[i * 4 + 1] as number,\n                decoded.boxesXyxy[i * 4 + 2] as number,\n                decoded.boxesXyxy[i * 4 + 3] as number,\n            ),\n            classId: decoded.classIds[i] as number,\n            confidence: decoded.confidences[i] as number,\n        });\n    }\n    return results;\n}\n\nlet _warnedDecodeYoloV8 = false;\nlet _warnedDecodeYoloV8Anchors = false;\n\n/**\n * @deprecated since 0.2.0 — use {@link decodeYolo}. Same behavior; the\n * decoder covers v8/v9/v10/v11/v12 detect heads. Will be removed in 0.3.0.\n */\nexport function decodeYoloV8(\n    output: Float32Array,\n    outputDims: readonly number[],\n    options: DecodeYoloOptions,\n): DecodedDetection[] {\n    if (!_warnedDecodeYoloV8) {\n        _warnedDecodeYoloV8 = true;\n        console.warn(\n            \"[@ort-vision-sdk/web] decodeYoloV8 is deprecated since 0.2.0; use decodeYolo. \" +\n                \"The alias will be removed in 0.3.0.\",\n        );\n    }\n    return decodeYolo(output, outputDims, options);\n}\n\n/**\n * @deprecated since 0.2.0 — use {@link decodeYoloAnchors}. Will be removed in 0.3.0.\n */\nexport function decodeYoloV8Anchors(\n    data: Float32Array,\n    dims: readonly number[],\n    options: DecodeYoloAnchorsOptions,\n): DecodedAnchors {\n    if (!_warnedDecodeYoloV8Anchors) {\n        _warnedDecodeYoloV8Anchors = true;\n        console.warn(\n            \"[@ort-vision-sdk/web] decodeYoloV8Anchors is deprecated since 0.2.0; use decodeYoloAnchors. \" +\n                \"The alias will be removed in 0.3.0.\",\n        );\n    }\n    return decodeYoloAnchors(data, dims, options);\n}\n\n/** @deprecated since 0.2.0 — use {@link DecodeYoloAnchorsOptions}. */\nexport type DecodeYoloV8AnchorsOptions = DecodeYoloAnchorsOptions;\n\n/** @deprecated since 0.2.0 — use {@link DecodeYoloOptions}. */\nexport type DecodeYoloV8Options = DecodeYoloOptions;\n"],"names":["nms","boxes","scores","iouThreshold","n","areas","i","x1","y1","x2","y2","order","a","b","suppressed","keep","oi","ax1","ay1","ax2","ay2","ai","oj","j","bx1","by1","bx2","by2","ix1","iy1","ix2","iy2","iw","ih","inter","union","batchedNms","idxs","byClass","c","list","indices","m","subBoxes","subScores","k","subKeep","decodeYoloAnchors","data","dims","options","normalized","channels","numAnchors","numClasses","originalWidth","originalHeight","padLeft","padTop","scale","confThreshold","maxDetections","candidates","bestCls","bestScore","s","cx","cy","w","h","emptyDecoded","flatBoxes","scoresArr","idxsArr","kept","limited","anchorIndices","boxesXyxy","classIds","confidences","decodeYolo","output","outputDims","decoded","results","BoundingBox","_warnedDecodeYoloV8","_warnedDecodeYoloV8Anchors","decodeYoloV8","decodeYoloV8Anchors"],"mappings":"gHA4BO,SAASA,EAAIC,EAAqBC,EAAsBC,EAAkC,CAC7F,MAAMC,EAAIF,EAAO,OACjB,GAAIE,IAAM,EAAG,OAAO,IAAI,WAAW,CAAC,EAEpC,MAAMC,EAAQ,IAAI,aAAaD,CAAC,EAChC,QAASE,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,MAAMC,EAAKN,EAAMK,EAAI,CAAC,EAChBE,EAAKP,EAAMK,EAAI,EAAI,CAAC,EACpBG,EAAKR,EAAMK,EAAI,EAAI,CAAC,EACpBI,EAAKT,EAAMK,EAAI,EAAI,CAAC,EAC1BD,EAAMC,CAAC,EAAI,KAAK,IAAI,EAAGG,EAAKF,CAAE,EAAI,KAAK,IAAI,EAAGG,EAAKF,CAAE,CACzD,CAEA,MAAMG,EAAQ,IAAI,MAAcP,CAAC,EACjC,QAASE,EAAI,EAAGA,EAAIF,EAAGE,IAAKK,EAAML,CAAC,EAAIA,EACvCK,EAAM,KAAK,CAACC,EAAGC,IAAOX,EAAOW,CAAC,EAAgBX,EAAOU,CAAC,CAAY,EAElE,MAAME,EAAa,IAAI,WAAWV,CAAC,EAC7BW,EAAiB,CAAA,EAEvB,QAASC,EAAK,EAAGA,EAAKL,EAAM,OAAQK,IAAM,CACtC,MAAMV,EAAIK,EAAMK,CAAE,EAClB,GAAIF,EAAWR,CAAC,EAAG,SACnBS,EAAK,KAAKT,CAAC,EAEX,MAAMW,EAAMhB,EAAMK,EAAI,CAAC,EACjBY,EAAMjB,EAAMK,EAAI,EAAI,CAAC,EACrBa,EAAMlB,EAAMK,EAAI,EAAI,CAAC,EACrBc,EAAMnB,EAAMK,EAAI,EAAI,CAAC,EACrBe,EAAKhB,EAAMC,CAAC,EAElB,QAASgB,EAAKN,EAAK,EAAGM,EAAKX,EAAM,OAAQW,IAAM,CAC3C,MAAMC,EAAIZ,EAAMW,CAAE,EAClB,GAAIR,EAAWS,CAAC,EAAG,SAEnB,MAAMC,EAAMvB,EAAMsB,EAAI,CAAC,EACjBE,EAAMxB,EAAMsB,EAAI,EAAI,CAAC,EACrBG,EAAMzB,EAAMsB,EAAI,EAAI,CAAC,EACrBI,EAAM1B,EAAMsB,EAAI,EAAI,CAAC,EAErBK,EAAM,KAAK,IAAIX,EAAKO,CAAG,EACvBK,EAAM,KAAK,IAAIX,EAAKO,CAAG,EACvBK,EAAM,KAAK,IAAIX,EAAKO,CAAG,EACvBK,EAAM,KAAK,IAAIX,EAAKO,CAAG,EACvBK,EAAK,KAAK,IAAI,EAAGF,EAAMF,CAAG,EAC1BK,EAAK,KAAK,IAAI,EAAGF,EAAMF,CAAG,EAC1BK,EAAQF,EAAKC,EACbE,EAAQd,EAAMhB,EAAMkB,CAAC,EAAeW,GAC9BC,EAAQ,EAAID,EAAQC,EAAQ,GAC9BhC,IAAcW,EAAWS,CAAC,EAAI,EAC5C,CACJ,CAEA,OAAO,WAAW,KAAKR,CAAI,CAC/B,CAaO,SAASqB,EACZnC,EACAC,EACAmC,EACAlC,EACU,CACV,GAAID,EAAO,SAAW,EAAG,OAAO,IAAI,WAAW,CAAC,EAEhD,MAAMoC,MAAc,IACpB,QAAShC,EAAI,EAAGA,EAAI+B,EAAK,OAAQ/B,IAAK,CAClC,MAAMiC,EAAIF,EAAK/B,CAAC,EACVkC,EAAOF,EAAQ,IAAIC,CAAC,EACtBC,IAAS,OAAWF,EAAQ,IAAIC,EAAG,CAACjC,CAAC,CAAC,EACrCkC,EAAK,KAAKlC,CAAC,CACpB,CAEA,MAAMS,EAAiB,CAAA,EACvB,UAAW0B,KAAWH,EAAQ,SAAU,CACpC,MAAMI,EAAID,EAAQ,OACZE,EAAW,IAAI,aAAaD,EAAI,CAAC,EACjCE,EAAY,IAAI,aAAaF,CAAC,EACpC,QAASG,EAAI,EAAGA,EAAIH,EAAGG,IAAK,CACxB,MAAMvC,EAAImC,EAAQI,CAAC,EACnBF,EAASE,EAAI,CAAC,EAAI5C,EAAMK,EAAI,CAAC,EAC7BqC,EAASE,EAAI,EAAI,CAAC,EAAI5C,EAAMK,EAAI,EAAI,CAAC,EACrCqC,EAASE,EAAI,EAAI,CAAC,EAAI5C,EAAMK,EAAI,EAAI,CAAC,EACrCqC,EAASE,EAAI,EAAI,CAAC,EAAI5C,EAAMK,EAAI,EAAI,CAAC,EACrCsC,EAAUC,CAAC,EAAI3C,EAAOI,CAAC,CAC3B,CACA,MAAMwC,EAAU9C,EAAI2C,EAAUC,EAAWzC,CAAY,EACrD,QAAS0C,EAAI,EAAGA,EAAIC,EAAQ,OAAQD,IAChC9B,EAAK,KAAK0B,EAAQK,EAAQD,CAAC,CAAW,CAAW,CAEzD,CAEA,OAAA9B,EAAK,KAAK,CAACH,EAAGC,IAAOX,EAAOW,CAAC,EAAgBX,EAAOU,CAAC,CAAY,EAC1D,WAAW,KAAKG,CAAI,CAC/B,CAsCO,SAASgC,EACZC,EACAC,EACAC,EACc,CACd,IAAIC,EAAaF,EACjB,GAAIE,EAAW,SAAW,EAAG,CACzB,GAAIA,EAAW,CAAC,IAAM,EAClB,MAAM,IAAI,MAAM,iDAAiDA,EAAW,CAAC,CAAC,GAAG,EAErFA,EAAa,CAACA,EAAW,CAAC,EAAaA,EAAW,CAAC,CAAW,CAClE,CACA,GAAIA,EAAW,SAAW,EACtB,MAAM,IAAI,MACN,wEAAwE,KAAK,UAAUF,CAAI,CAAC,GAAA,EAGpG,MAAMG,EAAWD,EAAW,CAAC,EACvBE,EAAaF,EAAW,CAAC,EAEzB,CACF,WAAAG,EACA,cAAAC,EACA,eAAAC,EACA,QAAAC,EACA,OAAAC,EACA,MAAAC,EACA,cAAAC,EACA,aAAAzD,EACA,cAAA0D,CAAA,EACAX,EAEJ,GAAII,EAAa,GAAKA,EAAa,EAAIF,EACnC,MAAM,IAAI,MACN,yCAAyCE,CAAU,iBAAiBF,CAAQ,GAAA,EAGpF,GAAIJ,EAAK,SAAWI,EAAWC,EAC3B,MAAM,IAAI,MACN,kCAAkCL,EAAK,MAAM,uCAAuCI,EAAWC,CAAU,GAAA,EAajH,MAAMS,EAA0B,CAAA,EAEhC,QAASlD,EAAI,EAAGA,EAAIyC,EAAYzC,IAAK,CACjC,IAAImD,EAAU,EACVC,EAAY,KAChB,QAASzB,EAAI,EAAGA,EAAIe,EAAYf,IAAK,CACjC,MAAM0B,EAAIjB,GAAM,EAAIT,GAAKc,EAAazC,CAAC,EACnCqD,IAAM,QAAaA,EAAID,IACvBA,EAAYC,EACZF,EAAUxB,EAElB,CACA,GAAIyB,EAAYJ,EAAe,SAE/B,MAAMM,EAAKlB,EAAKpC,CAAC,EACXuD,EAAKnB,EAAKK,EAAazC,CAAC,EACxBwD,EAAIpB,EAAK,EAAIK,EAAazC,CAAC,EAC3ByD,EAAIrB,EAAK,EAAIK,EAAazC,CAAC,EAEjC,IAAIL,EAAK2D,EAAKE,EAAI,EACd5D,EAAK2D,EAAKE,EAAI,EACd5D,EAAKyD,EAAKE,EAAI,EACd1D,EAAKyD,EAAKE,EAAI,EAElB9D,GAAMA,EAAKkD,GAAWE,EACtBnD,GAAMA,EAAKkD,GAAUC,EACrBlD,GAAMA,EAAKgD,GAAWE,EACtBjD,GAAMA,EAAKgD,GAAUC,EAErBpD,EAAK,KAAK,IAAI,EAAG,KAAK,IAAIgD,EAAehD,CAAE,CAAC,EAC5CC,EAAK,KAAK,IAAI,EAAG,KAAK,IAAIgD,EAAgBhD,CAAE,CAAC,EAC7CC,EAAK,KAAK,IAAI,EAAG,KAAK,IAAI8C,EAAe9C,CAAE,CAAC,EAC5CC,EAAK,KAAK,IAAI,EAAG,KAAK,IAAI8C,EAAgB9C,CAAE,CAAC,EAE7CoD,EAAW,KAAK,CAAE,UAAWlD,EAAG,GAAAL,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,EAAI,QAASqD,EAAS,WAAYC,CAAA,CAAW,CAC7F,CAEA,GAAIF,EAAW,SAAW,EAAG,OAAOQ,EAAA,EAIpC,MAAMC,EAAY,IAAI,aAAaT,EAAW,OAAS,CAAC,EAClDU,EAAY,IAAI,aAAaV,EAAW,MAAM,EAC9CW,EAAU,IAAI,WAAWX,EAAW,MAAM,EAChD,QAASxD,EAAI,EAAGA,EAAIwD,EAAW,OAAQxD,IAAK,CACxC,MAAMiC,EAAIuB,EAAWxD,CAAC,EACtBiE,EAAUjE,EAAI,CAAC,EAAIiC,EAAE,GACrBgC,EAAUjE,EAAI,EAAI,CAAC,EAAIiC,EAAE,GACzBgC,EAAUjE,EAAI,EAAI,CAAC,EAAIiC,EAAE,GACzBgC,EAAUjE,EAAI,EAAI,CAAC,EAAIiC,EAAE,GACzBiC,EAAUlE,CAAC,EAAIiC,EAAE,WACjBkC,EAAQnE,CAAC,EAAIiC,EAAE,OACnB,CACA,MAAMmC,EAAOtC,EAAWmC,EAAWC,EAAWC,EAAStE,CAAY,EACnE,GAAIuE,EAAK,SAAW,EAAG,OAAOJ,EAAA,EAE9B,MAAMK,EAAU,MAAM,KAAKD,CAAI,EAAE,MAAM,EAAGb,CAAa,EACjDhB,EAAI8B,EAAQ,OACZC,EAAgB,IAAI,WAAW/B,CAAC,EAChCgC,EAAY,IAAI,aAAahC,EAAI,CAAC,EAClCiC,EAAW,IAAI,WAAWjC,CAAC,EAC3BkC,EAAc,IAAI,aAAalC,CAAC,EACtC,QAASvC,EAAI,EAAGA,EAAIuC,EAAGvC,IAAK,CACxB,MAAMiC,EAAIuB,EAAWa,EAAQrE,CAAC,CAAW,EACzCsE,EAActE,CAAC,EAAIiC,EAAE,UACrBsC,EAAUvE,EAAI,CAAC,EAAIiC,EAAE,GACrBsC,EAAUvE,EAAI,EAAI,CAAC,EAAIiC,EAAE,GACzBsC,EAAUvE,EAAI,EAAI,CAAC,EAAIiC,EAAE,GACzBsC,EAAUvE,EAAI,EAAI,CAAC,EAAIiC,EAAE,GACzBuC,EAASxE,CAAC,EAAIiC,EAAE,QAChBwC,EAAYzE,CAAC,EAAIiC,EAAE,UACvB,CACA,MAAO,CAAE,cAAAqC,EAAe,UAAAC,EAAW,SAAAC,EAAU,YAAAC,CAAA,CACjD,CAEA,SAAST,GAA+B,CACpC,MAAO,CACH,cAAe,IAAI,WAAW,CAAC,EAC/B,UAAW,IAAI,aAAa,CAAC,EAC7B,SAAU,IAAI,WAAW,CAAC,EAC1B,YAAa,IAAI,aAAa,CAAC,CAAA,CAEvC,CA2BO,SAASU,EACZC,EACAC,EACAhC,EACkB,CAClB,MAAME,EAAW8B,EAAW,SAAW,EAAIA,EAAW,CAAC,EAAIA,EAAW,CAAC,EACvE,GAAI9B,IAAa,QAAaA,EAAW,EACrC,MAAM,IAAI,MAAM,4CAA4CA,CAAQ,mBAAmB,EAE3F,MAAME,EAAaF,EAAW,EAExB+B,EAAUpC,EAAkBkC,EAAQC,EAAY,CAClD,WAAA5B,EACA,GAAGJ,CAAA,CACN,EAEKkC,EAA8B,CAAA,EACpC,QAAS9E,EAAI,EAAGA,EAAI6E,EAAQ,SAAS,OAAQ7E,IACzC8E,EAAQ,KAAK,CACT,KAAM,IAAIC,EAAAA,YACNF,EAAQ,UAAU7E,EAAI,CAAC,EACvB6E,EAAQ,UAAU7E,EAAI,EAAI,CAAC,EAC3B6E,EAAQ,UAAU7E,EAAI,EAAI,CAAC,EAC3B6E,EAAQ,UAAU7E,EAAI,EAAI,CAAC,CAAA,EAE/B,QAAS6E,EAAQ,SAAS7E,CAAC,EAC3B,WAAY6E,EAAQ,YAAY7E,CAAC,CAAA,CACpC,EAEL,OAAO8E,CACX,CAEA,IAAIE,EAAsB,GACtBC,EAA6B,GAM1B,SAASC,EACZP,EACAC,EACAhC,EACkB,CAClB,OAAKoC,IACDA,EAAsB,GACtB,QAAQ,KACJ,mHAAA,GAIDN,EAAWC,EAAQC,EAAYhC,CAAO,CACjD,CAKO,SAASuC,EACZzC,EACAC,EACAC,EACc,CACd,OAAKqC,IACDA,EAA6B,GAC7B,QAAQ,KACJ,iIAAA,GAIDxC,EAAkBC,EAAMC,EAAMC,CAAO,CAChD"}
+{"version":3,"file":"detection.cjs","names":[],"sources":["../../../src/vision/postprocess/detection.ts"],"sourcesContent":["/**\n * Detection head postprocessing: anchor-free YOLO decoding + non-maximum suppression.\n *\n * The shared {@link decodeYoloAnchors} helper does the per-anchor work that\n * is identical for plain detection and segmentation (transpose, xywh→xyxy,\n * letterbox unmap, per-class NMS, sort & cap). {@link decodeYolo} is a thin\n * wrapper around it; the segmentation module ({@link ./segmentation.js})\n * calls the helper directly so it can also recover the per-anchor mask\n * coefficients.\n *\n * Works for any YOLO export with the post-v8 anchor-free head:\n * **YOLOv8 / v9 / v10 / v11 / v12** detect heads, all of which share the\n * `[1, 4 + nc, N]` output layout.\n */\n\nimport { BoundingBox } from \"../types\";\n\n/**\n * Greedy non-maximum suppression on axis-aligned bounding boxes.\n *\n * Mirrors `torchvision.ops.nms` (keeps boxes with the highest score, drops\n * any subsequent box whose IoU exceeds the threshold).\n *\n * @param boxes Flat array of length `4 * N` in xyxy order: `[x1,y1,x2,y2, ...]`.\n * @param scores Detection score per box, length `N`.\n * @param iouThreshold Boxes with IoU above this threshold relative to a kept box are suppressed.\n * @returns Indices of kept boxes, in descending score order.\n */\nexport function nms(boxes: Float32Array, scores: Float32Array, iouThreshold: number): Int32Array {\n    const n = scores.length;\n    if (n === 0) return new Int32Array(0);\n\n    const areas = new Float32Array(n);\n    for (let i = 0; i < n; i++) {\n        const x1 = boxes[i * 4] as number;\n        const y1 = boxes[i * 4 + 1] as number;\n        const x2 = boxes[i * 4 + 2] as number;\n        const y2 = boxes[i * 4 + 3] as number;\n        areas[i] = Math.max(0, x2 - x1) * Math.max(0, y2 - y1);\n    }\n\n    const order = new Array<number>(n);\n    for (let i = 0; i < n; i++) order[i] = i;\n    order.sort((a, b) => (scores[b] as number) - (scores[a] as number));\n\n    const suppressed = new Uint8Array(n);\n    const keep: number[] = [];\n\n    for (let oi = 0; oi < order.length; oi++) {\n        const i = order[oi] as number;\n        if (suppressed[i]) continue;\n        keep.push(i);\n\n        const ax1 = boxes[i * 4] as number;\n        const ay1 = boxes[i * 4 + 1] as number;\n        const ax2 = boxes[i * 4 + 2] as number;\n        const ay2 = boxes[i * 4 + 3] as number;\n        const ai = areas[i] as number;\n\n        for (let oj = oi + 1; oj < order.length; oj++) {\n            const j = order[oj] as number;\n            if (suppressed[j]) continue;\n\n            const bx1 = boxes[j * 4] as number;\n            const by1 = boxes[j * 4 + 1] as number;\n            const bx2 = boxes[j * 4 + 2] as number;\n            const by2 = boxes[j * 4 + 3] as number;\n\n            const ix1 = Math.max(ax1, bx1);\n            const iy1 = Math.max(ay1, by1);\n            const ix2 = Math.min(ax2, bx2);\n            const iy2 = Math.min(ay2, by2);\n            const iw = Math.max(0, ix2 - ix1);\n            const ih = Math.max(0, iy2 - iy1);\n            const inter = iw * ih;\n            const union = ai + (areas[j] as number) - inter;\n            const iou = union > 0 ? inter / union : 0;\n            if (iou > iouThreshold) suppressed[j] = 1;\n        }\n    }\n\n    return Int32Array.from(keep);\n}\n\n/**\n * Per-class NMS — boxes are suppressed only by other boxes of the same class.\n *\n * Mirrors `torchvision.ops.batched_nms`.\n *\n * @param boxes Flat array of length `4 * N` in xyxy order.\n * @param scores Detection score per box, length `N`.\n * @param idxs Class index per box, length `N`. Boxes with different `idxs`\n *   never suppress each other.\n * @param iouThreshold IoU threshold for suppression within a class.\n */\nexport function batchedNms(\n    boxes: Float32Array,\n    scores: Float32Array,\n    idxs: Int32Array,\n    iouThreshold: number,\n): Int32Array {\n    if (scores.length === 0) return new Int32Array(0);\n\n    const byClass = new Map<number, number[]>();\n    for (let i = 0; i < idxs.length; i++) {\n        const c = idxs[i] as number;\n        const list = byClass.get(c);\n        if (list === undefined) byClass.set(c, [i]);\n        else list.push(i);\n    }\n\n    const keep: number[] = [];\n    for (const indices of byClass.values()) {\n        const m = indices.length;\n        const subBoxes = new Float32Array(m * 4);\n        const subScores = new Float32Array(m);\n        for (let k = 0; k < m; k++) {\n            const i = indices[k] as number;\n            subBoxes[k * 4] = boxes[i * 4] as number;\n            subBoxes[k * 4 + 1] = boxes[i * 4 + 1] as number;\n            subBoxes[k * 4 + 2] = boxes[i * 4 + 2] as number;\n            subBoxes[k * 4 + 3] = boxes[i * 4 + 3] as number;\n            subScores[k] = scores[i] as number;\n        }\n        const subKeep = nms(subBoxes, subScores, iouThreshold);\n        for (let k = 0; k < subKeep.length; k++) {\n            keep.push(indices[subKeep[k] as number] as number);\n        }\n    }\n\n    keep.sort((a, b) => (scores[b] as number) - (scores[a] as number));\n    return Int32Array.from(keep);\n}\n\nexport interface DecodeYoloAnchorsOptions {\n    /** Number of class-score channels following the 4 box channels. */\n    readonly numClasses: number;\n    readonly originalWidth: number;\n    readonly originalHeight: number;\n    readonly padLeft: number;\n    readonly padTop: number;\n    readonly scale: number;\n    readonly confThreshold: number;\n    readonly iouThreshold: number;\n    readonly maxDetections: number;\n}\n\nexport interface DecodedAnchors {\n    /** Indices into the original `numAnchors` axis, in descending confidence order. */\n    readonly anchorIndices: Int32Array;\n    /** `[k, 4]` boxes in original-image pixel coords, flat row-major xyxy. */\n    readonly boxesXyxy: Float32Array;\n    /** Predicted class id per survivor. */\n    readonly classIds: Int32Array;\n    /** Confidence per survivor. */\n    readonly confidences: Float32Array;\n}\n\n/**\n * Shared YOLO per-anchor decode used by both detection and segmentation\n * (v8 / v9 / v10 / v11 / v12).\n *\n * Only the first `4 + numClasses` channels are read; later channels (e.g.\n * mask coefficients) are ignored — callers can fetch them via the returned\n * {@link DecodedAnchors.anchorIndices}.\n *\n * @param data Flat per-anchor output, length `channels * numAnchors`.\n * @param dims Dims as reported by ORT, e.g. `[1, 84, 8400]` (det) or\n *   `[1, 116, 8400]` (seg). The leading batch dim must be 1.\n */\nexport function decodeYoloAnchors(\n    data: Float32Array,\n    dims: readonly number[],\n    options: DecodeYoloAnchorsOptions,\n): DecodedAnchors {\n    let normalized = dims;\n    if (normalized.length === 3) {\n        if (normalized[0] !== 1) {\n            throw new Error(`decodeYoloAnchors: expected batch size 1, got ${normalized[0]}.`);\n        }\n        normalized = [normalized[1] as number, normalized[2] as number];\n    }\n    if (normalized.length !== 2) {\n        throw new Error(\n            `decodeYoloAnchors: expected 2-D output after batch removal, got dims=${JSON.stringify(dims)}.`,\n        );\n    }\n    const channels = normalized[0] as number;\n    const numAnchors = normalized[1] as number;\n\n    const {\n        numClasses,\n        originalWidth,\n        originalHeight,\n        padLeft,\n        padTop,\n        scale,\n        confThreshold,\n        iouThreshold,\n        maxDetections,\n    } = options;\n\n    if (numClasses < 1 || numClasses + 4 > channels) {\n        throw new Error(\n            `decodeYoloAnchors: invalid numClasses=${numClasses} for channels=${channels}.`,\n        );\n    }\n    if (data.length !== channels * numAnchors) {\n        throw new Error(\n            `decodeYoloAnchors: data length ${data.length} does not match channels*numAnchors=${channels * numAnchors}.`,\n        );\n    }\n\n    type Candidate = {\n        anchorIdx: number;\n        x1: number;\n        y1: number;\n        x2: number;\n        y2: number;\n        classId: number;\n        confidence: number;\n    };\n    const candidates: Candidate[] = [];\n\n    for (let a = 0; a < numAnchors; a++) {\n        let bestCls = 0;\n        let bestScore = -Infinity;\n        for (let c = 0; c < numClasses; c++) {\n            const s = data[(4 + c) * numAnchors + a];\n            if (s !== undefined && s > bestScore) {\n                bestScore = s;\n                bestCls = c;\n            }\n        }\n        if (bestScore < confThreshold) continue;\n\n        const cx = data[a] as number;\n        const cy = data[numAnchors + a] as number;\n        const w = data[2 * numAnchors + a] as number;\n        const h = data[3 * numAnchors + a] as number;\n\n        let x1 = cx - w / 2;\n        let y1 = cy - h / 2;\n        let x2 = cx + w / 2;\n        let y2 = cy + h / 2;\n\n        x1 = (x1 - padLeft) / scale;\n        y1 = (y1 - padTop) / scale;\n        x2 = (x2 - padLeft) / scale;\n        y2 = (y2 - padTop) / scale;\n\n        x1 = Math.max(0, Math.min(originalWidth, x1));\n        y1 = Math.max(0, Math.min(originalHeight, y1));\n        x2 = Math.max(0, Math.min(originalWidth, x2));\n        y2 = Math.max(0, Math.min(originalHeight, y2));\n\n        candidates.push({ anchorIdx: a, x1, y1, x2, y2, classId: bestCls, confidence: bestScore });\n    }\n\n    if (candidates.length === 0) return emptyDecoded();\n\n    // Build flat arrays then delegate to batchedNms — same algorithm as before\n    // but funnelled through the public per-class NMS helper.\n    const flatBoxes = new Float32Array(candidates.length * 4);\n    const scoresArr = new Float32Array(candidates.length);\n    const idxsArr = new Int32Array(candidates.length);\n    for (let i = 0; i < candidates.length; i++) {\n        const c = candidates[i] as Candidate;\n        flatBoxes[i * 4] = c.x1;\n        flatBoxes[i * 4 + 1] = c.y1;\n        flatBoxes[i * 4 + 2] = c.x2;\n        flatBoxes[i * 4 + 3] = c.y2;\n        scoresArr[i] = c.confidence;\n        idxsArr[i] = c.classId;\n    }\n    const kept = batchedNms(flatBoxes, scoresArr, idxsArr, iouThreshold);\n    if (kept.length === 0) return emptyDecoded();\n\n    const limited = Array.from(kept).slice(0, maxDetections);\n    const k = limited.length;\n    const anchorIndices = new Int32Array(k);\n    const boxesXyxy = new Float32Array(k * 4);\n    const classIds = new Int32Array(k);\n    const confidences = new Float32Array(k);\n    for (let i = 0; i < k; i++) {\n        const c = candidates[limited[i] as number] as Candidate;\n        anchorIndices[i] = c.anchorIdx;\n        boxesXyxy[i * 4] = c.x1;\n        boxesXyxy[i * 4 + 1] = c.y1;\n        boxesXyxy[i * 4 + 2] = c.x2;\n        boxesXyxy[i * 4 + 3] = c.y2;\n        classIds[i] = c.classId;\n        confidences[i] = c.confidence;\n    }\n    return { anchorIndices, boxesXyxy, classIds, confidences };\n}\n\nfunction emptyDecoded(): DecodedAnchors {\n    return {\n        anchorIndices: new Int32Array(0),\n        boxesXyxy: new Float32Array(0),\n        classIds: new Int32Array(0),\n        confidences: new Float32Array(0),\n    };\n}\n\nexport interface DecodeYoloOptions {\n    readonly originalWidth: number;\n    readonly originalHeight: number;\n    readonly padLeft: number;\n    readonly padTop: number;\n    readonly scale: number;\n    readonly confThreshold: number;\n    readonly iouThreshold: number;\n    readonly maxDetections: number;\n}\n\nexport interface DecodedDetection {\n    readonly bbox: BoundingBox;\n    readonly classId: number;\n    readonly confidence: number;\n}\n\n/**\n * Decode an anchor-free YOLO detection output into a list of detections.\n *\n * Works for **YOLOv8 / v9 / v10 / v11 / v12** detect heads.\n *\n * Expected raw shape: `[1, 4 + numClasses, N]`. `numClasses` is inferred\n * from the channel count.\n */\nexport function decodeYolo(\n    output: Float32Array,\n    outputDims: readonly number[],\n    options: DecodeYoloOptions,\n): DecodedDetection[] {\n    const channels = outputDims.length === 3 ? outputDims[1] : outputDims[0];\n    if (channels === undefined || channels < 5) {\n        throw new Error(`decodeYolo: invalid output channel count ${channels} (expected >= 5).`);\n    }\n    const numClasses = channels - 4;\n\n    const decoded = decodeYoloAnchors(output, outputDims, {\n        numClasses,\n        ...options,\n    });\n\n    const results: DecodedDetection[] = [];\n    for (let i = 0; i < decoded.classIds.length; i++) {\n        results.push({\n            bbox: new BoundingBox(\n                decoded.boxesXyxy[i * 4] as number,\n                decoded.boxesXyxy[i * 4 + 1] as number,\n                decoded.boxesXyxy[i * 4 + 2] as number,\n                decoded.boxesXyxy[i * 4 + 3] as number,\n            ),\n            classId: decoded.classIds[i] as number,\n            confidence: decoded.confidences[i] as number,\n        });\n    }\n    return results;\n}\n\nlet _warnedDecodeYoloV8 = false;\nlet _warnedDecodeYoloV8Anchors = false;\n\n/**\n * @deprecated since 0.2.0 — use {@link decodeYolo}. Same behavior; the\n * decoder covers v8/v9/v10/v11/v12 detect heads. Will be removed in 0.3.0.\n */\nexport function decodeYoloV8(\n    output: Float32Array,\n    outputDims: readonly number[],\n    options: DecodeYoloOptions,\n): DecodedDetection[] {\n    if (!_warnedDecodeYoloV8) {\n        _warnedDecodeYoloV8 = true;\n        console.warn(\n            \"[@ort-vision-sdk/web] decodeYoloV8 is deprecated since 0.2.0; use decodeYolo. \" +\n                \"The alias will be removed in 0.3.0.\",\n        );\n    }\n    return decodeYolo(output, outputDims, options);\n}\n\n/**\n * @deprecated since 0.2.0 — use {@link decodeYoloAnchors}. Will be removed in 0.3.0.\n */\nexport function decodeYoloV8Anchors(\n    data: Float32Array,\n    dims: readonly number[],\n    options: DecodeYoloAnchorsOptions,\n): DecodedAnchors {\n    if (!_warnedDecodeYoloV8Anchors) {\n        _warnedDecodeYoloV8Anchors = true;\n        console.warn(\n            \"[@ort-vision-sdk/web] decodeYoloV8Anchors is deprecated since 0.2.0; use decodeYoloAnchors. \" +\n                \"The alias will be removed in 0.3.0.\",\n        );\n    }\n    return decodeYoloAnchors(data, dims, options);\n}\n\n/** @deprecated since 0.2.0 — use {@link DecodeYoloAnchorsOptions}. */\nexport type DecodeYoloV8AnchorsOptions = DecodeYoloAnchorsOptions;\n\n/** @deprecated since 0.2.0 — use {@link DecodeYoloOptions}. */\nexport type DecodeYoloV8Options = DecodeYoloOptions;\n"],"mappings":"gCA4BA,SAAgB,EAAI,EAAqB,EAAsB,EAAkC,CAC7F,IAAM,EAAI,EAAO,OACjB,GAAI,IAAM,EAAG,OAAO,IAAI,WAExB,IAAM,EAAQ,IAAI,aAAa,CAAC,EAChC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,IAAM,EAAK,EAAM,EAAI,GACf,EAAK,EAAM,EAAI,EAAI,GACnB,EAAK,EAAM,EAAI,EAAI,GACnB,EAAK,EAAM,EAAI,EAAI,GACzB,EAAM,GAAK,KAAK,IAAI,EAAG,EAAK,CAAE,EAAI,KAAK,IAAI,EAAG,EAAK,CAAE,CACzD,CAEA,IAAM,EAAY,MAAc,CAAC,EACjC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,EAAM,GAAK,EACvC,EAAM,MAAM,EAAG,IAAO,EAAO,GAAiB,EAAO,EAAa,EAElE,IAAM,EAAa,IAAI,WAAW,CAAC,EAC7B,EAAiB,CAAC,EAExB,IAAK,IAAI,EAAK,EAAG,EAAK,EAAM,OAAQ,IAAM,CACtC,IAAM,EAAI,EAAM,GAChB,GAAI,EAAW,GAAI,SACnB,EAAK,KAAK,CAAC,EAEX,IAAM,EAAM,EAAM,EAAI,GAChB,EAAM,EAAM,EAAI,EAAI,GACpB,EAAM,EAAM,EAAI,EAAI,GACpB,EAAM,EAAM,EAAI,EAAI,GACpB,EAAK,EAAM,GAEjB,IAAK,IAAI,EAAK,EAAK,EAAG,EAAK,EAAM,OAAQ,IAAM,CAC3C,IAAM,EAAI,EAAM,GAChB,GAAI,EAAW,GAAI,SAEnB,IAAM,EAAM,EAAM,EAAI,GAChB,EAAM,EAAM,EAAI,EAAI,GACpB,EAAM,EAAM,EAAI,EAAI,GACpB,EAAM,EAAM,EAAI,EAAI,GAEpB,EAAM,KAAK,IAAI,EAAK,CAAG,EACvB,EAAM,KAAK,IAAI,EAAK,CAAG,EACvB,EAAM,KAAK,IAAI,EAAK,CAAG,EACvB,EAAM,KAAK,IAAI,EAAK,CAAG,EAGvB,EAFK,KAAK,IAAI,EAAG,EAAM,CAEf,EADH,KAAK,IAAI,EAAG,EAAM,CACV,EACb,EAAQ,EAAM,EAAM,GAAgB,GAC9B,EAAQ,EAAI,EAAQ,EAAQ,GAC9B,IAAc,EAAW,GAAK,EAC5C,CACJ,CAEA,OAAO,WAAW,KAAK,CAAI,CAC/B,CAaA,SAAgB,EACZ,EACA,EACA,EACA,EACU,CACV,GAAI,EAAO,SAAW,EAAG,OAAO,IAAI,WAEpC,IAAM,EAAU,IAAI,IACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CAClC,IAAM,EAAI,EAAK,GACT,EAAO,EAAQ,IAAI,CAAC,EACtB,IAAS,IAAA,GAAW,EAAQ,IAAI,EAAG,CAAC,CAAC,CAAC,EACrC,EAAK,KAAK,CAAC,CACpB,CAEA,IAAM,EAAiB,CAAC,EACxB,IAAK,IAAM,KAAW,EAAQ,OAAO,EAAG,CACpC,IAAM,EAAI,EAAQ,OACZ,EAAW,IAAI,aAAa,EAAI,CAAC,EACjC,EAAY,IAAI,aAAa,CAAC,EACpC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,IAAM,EAAI,EAAQ,GAClB,EAAS,EAAI,GAAK,EAAM,EAAI,GAC5B,EAAS,EAAI,EAAI,GAAK,EAAM,EAAI,EAAI,GACpC,EAAS,EAAI,EAAI,GAAK,EAAM,EAAI,EAAI,GACpC,EAAS,EAAI,EAAI,GAAK,EAAM,EAAI,EAAI,GACpC,EAAU,GAAK,EAAO,EAC1B,CACA,IAAM,EAAU,EAAI,EAAU,EAAW,CAAY,EACrD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAChC,EAAK,KAAK,EAAQ,EAAQ,GAAuB,CAEzD,CAGA,OADA,EAAK,MAAM,EAAG,IAAO,EAAO,GAAiB,EAAO,EAAa,EAC1D,WAAW,KAAK,CAAI,CAC/B,CAsCA,SAAgB,EACZ,EACA,EACA,EACc,CACd,IAAI,EAAa,EACjB,GAAI,EAAW,SAAW,EAAG,CACzB,GAAI,EAAW,KAAO,EAClB,MAAU,MAAM,iDAAiD,EAAW,GAAG,EAAE,EAErF,EAAa,CAAC,EAAW,GAAc,EAAW,EAAY,CAClE,CACA,GAAI,EAAW,SAAW,EACtB,MAAU,MACN,wEAAwE,KAAK,UAAU,CAAI,EAAE,EACjG,EAEJ,IAAM,EAAW,EAAW,GACtB,EAAa,EAAW,GAExB,CACF,aACA,gBACA,iBACA,UACA,SACA,QACA,gBACA,eACA,iBACA,EAEJ,GAAI,EAAa,GAAK,EAAa,EAAI,EACnC,MAAU,MACN,yCAAyC,EAAW,gBAAgB,EAAS,EACjF,EAEJ,GAAI,EAAK,SAAW,EAAW,EAC3B,MAAU,MACN,kCAAkC,EAAK,OAAO,sCAAsC,EAAW,EAAW,EAC9G,EAYJ,IAAM,EAA0B,CAAC,EAEjC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,IAAK,CACjC,IAAI,EAAU,EACV,EAAY,KAChB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,IAAK,CACjC,IAAM,EAAI,GAAM,EAAI,GAAK,EAAa,GAClC,IAAM,IAAA,IAAa,EAAI,IACvB,EAAY,EACZ,EAAU,EAElB,CACA,GAAI,EAAY,EAAe,SAE/B,IAAM,EAAK,EAAK,GACV,EAAK,EAAK,EAAa,GACvB,EAAI,EAAK,EAAI,EAAa,GAC1B,EAAI,EAAK,EAAI,EAAa,GAE5B,EAAK,EAAK,EAAI,EACd,EAAK,EAAK,EAAI,EACd,EAAK,EAAK,EAAI,EACd,EAAK,EAAK,EAAI,EAElB,GAAM,EAAK,GAAW,EACtB,GAAM,EAAK,GAAU,EACrB,GAAM,EAAK,GAAW,EACtB,GAAM,EAAK,GAAU,EAErB,EAAK,KAAK,IAAI,EAAG,KAAK,IAAI,EAAe,CAAE,CAAC,EAC5C,EAAK,KAAK,IAAI,EAAG,KAAK,IAAI,EAAgB,CAAE,CAAC,EAC7C,EAAK,KAAK,IAAI,EAAG,KAAK,IAAI,EAAe,CAAE,CAAC,EAC5C,EAAK,KAAK,IAAI,EAAG,KAAK,IAAI,EAAgB,CAAE,CAAC,EAE7C,EAAW,KAAK,CAAE,UAAW,EAAG,KAAI,KAAI,KAAI,KAAI,QAAS,EAAS,WAAY,CAAU,CAAC,CAC7F,CAEA,GAAI,EAAW,SAAW,EAAG,OAAO,EAAa,EAIjD,IAAM,EAAY,IAAI,aAAa,EAAW,OAAS,CAAC,EAClD,EAAY,IAAI,aAAa,EAAW,MAAM,EAC9C,EAAU,IAAI,WAAW,EAAW,MAAM,EAChD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,IAAK,CACxC,IAAM,EAAI,EAAW,GACrB,EAAU,EAAI,GAAK,EAAE,GACrB,EAAU,EAAI,EAAI,GAAK,EAAE,GACzB,EAAU,EAAI,EAAI,GAAK,EAAE,GACzB,EAAU,EAAI,EAAI,GAAK,EAAE,GACzB,EAAU,GAAK,EAAE,WACjB,EAAQ,GAAK,EAAE,OACnB,CACA,IAAM,EAAO,EAAW,EAAW,EAAW,EAAS,CAAY,EACnE,GAAI,EAAK,SAAW,EAAG,OAAO,EAAa,EAE3C,IAAM,EAAU,MAAM,KAAK,CAAI,CAAC,CAAC,MAAM,EAAG,CAAa,EACjD,EAAI,EAAQ,OACZ,EAAgB,IAAI,WAAW,CAAC,EAChC,EAAY,IAAI,aAAa,EAAI,CAAC,EAClC,EAAW,IAAI,WAAW,CAAC,EAC3B,EAAc,IAAI,aAAa,CAAC,EACtC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,IAAM,EAAI,EAAW,EAAQ,IAC7B,EAAc,GAAK,EAAE,UACrB,EAAU,EAAI,GAAK,EAAE,GACrB,EAAU,EAAI,EAAI,GAAK,EAAE,GACzB,EAAU,EAAI,EAAI,GAAK,EAAE,GACzB,EAAU,EAAI,EAAI,GAAK,EAAE,GACzB,EAAS,GAAK,EAAE,QAChB,EAAY,GAAK,EAAE,UACvB,CACA,MAAO,CAAE,gBAAe,YAAW,WAAU,aAAY,CAC7D,CAEA,SAAS,GAA+B,CACpC,MAAO,CACH,cAAe,IAAI,WACnB,UAAW,IAAI,aACf,SAAU,IAAI,WACd,YAAa,IAAI,YACrB,CACJ,CA2BA,SAAgB,EACZ,EACA,EACA,EACkB,CAClB,IAAM,EAAW,EAAW,SAAW,EAAI,EAAW,GAAK,EAAW,GACtE,GAAI,IAAa,IAAA,IAAa,EAAW,EACrC,MAAU,MAAM,4CAA4C,EAAS,kBAAkB,EAI3F,IAAM,EAAU,EAAkB,EAAQ,EAAY,CAClD,WAHe,EAAW,EAI1B,GAAG,CACP,CAAC,EAEK,EAA8B,CAAC,EACrC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAQ,SAAS,OAAQ,IACzC,EAAQ,KAAK,CACT,KAAM,IAAI,EAAA,YACN,EAAQ,UAAU,EAAI,GACtB,EAAQ,UAAU,EAAI,EAAI,GAC1B,EAAQ,UAAU,EAAI,EAAI,GAC1B,EAAQ,UAAU,EAAI,EAAI,EAC9B,EACA,QAAS,EAAQ,SAAS,GAC1B,WAAY,EAAQ,YAAY,EACpC,CAAC,EAEL,OAAO,CACX,CAEA,IAAI,EAAsB,GACtB,EAA6B,GAMjC,SAAgB,EACZ,EACA,EACA,EACkB,CAQlB,OAPK,IACD,EAAsB,GACtB,QAAQ,KACJ,mHAEJ,GAEG,EAAW,EAAQ,EAAY,CAAO,CACjD,CAKA,SAAgB,EACZ,EACA,EACA,EACc,CAQd,OAPK,IACD,EAA6B,GAC7B,QAAQ,KACJ,iIAEJ,GAEG,EAAkB,EAAM,EAAM,CAAO,CAChD"}