tempest-react-sdk 0.77.0 → 0.79.0

package/dist/vite/tempest-styles.js.map

@@ -1 +1 @@
-{"version":3,"file":"tempest-styles.js","names":[],"sources":["../../src/vite/tempest-styles.ts"],"sourcesContent":["import { readdir, readFile } from \"node:fs/promises\";\nimport { readFileSync } from \"node:fs\";\nimport { dirname, join, resolve } from \"node:path\";\nimport { fileURLToPath } from \"node:url\";\n\nimport { narrowTokens } from \"./narrow-tokens\";\nimport type { TempestVitePlugin } from \"./tempest-pwa-manifest\";\n\n/** The stylesheet id an app imports to get exactly the CSS it uses. */\nexport const TEMPEST_STYLES_ID = \"tempest-react-sdk/styles/auto.css\";\n\nconst RESOLVED_ID = \"\\0tempest-styles/auto.css\";\n\n/** Package subpaths whose exports are components with stylesheets. */\nconst SDK_SPECIFIER = /^tempest-react-sdk(\\/(charts|editor|br|icons))?$/;\n\nconst SOURCE_FILE = /\\.[cm]?[jt]sx?$/;\n\n/**\n * The app's own stylesheets, scanned for token reads rather than for imports.\n *\n * An app is documented as free to read `--tempest-*` in CSS of its own, so cutting\n * the token sheet to what the SDK's components reach would drop tokens the app is\n * still reading — and a dropped token is not a smaller sheet, it is an unset\n * property. These files contribute reads to the closure and nothing else.\n */\nconst STYLE_FILE = /\\.(css|scss|sass|less)$/;\nconst SKIP_DIRS = new Set([\"node_modules\", \"dist\", \"build\", \"coverage\"]);\n\n/**\n * How much of the reset an app takes.\n *\n * The components are written against the reset — `.tempest_button` assumes\n * `button { background: none; border: 0; padding: 0 }`, every width assumes\n * `box-sizing: border-box` — so `\"none\"` is not \"unstyled document, styled\n * components\": it is components missing their box model. It exists for the app\n * that already ships an equivalent reset of its own.\n */\nexport type ResetMode = \"scoped\" | \"global\" | \"none\";\n\n/**\n * How much of the token sheet an app takes.\n *\n * `\"used\"` emits only the tokens the selected stylesheets — and the app's own CSS —\n * can reach, following token-to-token references. `\"all\"` emits `tokens.css` whole,\n * which is what to reach for when the app names tokens somewhere the scan cannot\n * see: a token read from a CSS-in-JS library, a sibling package's stylesheet, a\n * `<style>` block in `index.html`.\n */\nexport type TokenMode = \"used\" | \"all\";\n\n/** Shape of `dist/styles/manifest.json`. */\nexport interface StyleManifest {\n    /** The foundation sheet — tokens and reset together, the pre-split default. */\n    core: string;\n    /** Public export name → the stylesheets it needs, transitive closure included. */\n    components: Record<string, readonly string[]>;\n}\n\nexport interface TempestStylesOptions {\n    /** Directory to scan, relative to the Vite root. Default: `\"src\"`. */\n    dir?: string;\n    /**\n     * Which reset to emit alongside the tokens. Default: `\"scoped\"`.\n     *\n     * `\"scoped\"` confines the reset to `:where([class*=\"tempest_\"])`, so components\n     * keep the normalisation they are written against and the app keeps `html`,\n     * `body` and `#root`. `\"global\"` is the pre-split behaviour, correct when the\n     * SDK owns the whole page. `\"none\"` emits tokens only.\n     */\n    reset?: ResetMode;\n    /**\n     * Extra export names to style even when the scan cannot see them — a component\n     * reached only through a namespace import, or rendered by a sibling package.\n     */\n    include?: readonly string[];\n    /** Directory names to skip. Default: `node_modules`, `dist`, `build`, `coverage`. */\n    skipDirs?: readonly string[];\n    /**\n     * How much of the token sheet to emit. Default: `\"used\"`.\n     *\n     * The default falls back to the whole sheet on its own whenever a token name is\n     * assembled at runtime (`` `var(--tempest-${tone})` ``), so `\"all\"` is for the\n     * case the scan cannot see at all — a token read from outside `dir`.\n     */\n    tokens?: TokenMode;\n}\n\n/**\n * Collect the SDK export names a source file imports.\n *\n * Reads the import specifier rather than the JSX, because a bare `<Button>` in the\n * markup says nothing about where it came from — the app may well define its own.\n * Type-only bindings are dropped: they are erased before any component renders, so\n * paying for their CSS would be paying for nothing.\n *\n * @param code - File contents.\n * @returns The imported names, or `null` when the file namespace-imports the SDK\n *   and the set therefore cannot be known.\n */\nexport function scanStyleImports(code: string): string[] | null {\n    const names = new Set<string>();\n\n    for (const match of code.matchAll(\n        /\\bimport\\s+(type\\s+)?([^;'\"]*?)\\s+from\\s*[\"']([^\"']+)[\"']/g,\n    )) {\n        const [, typeOnly, clause, specifier] = match;\n        if (!SDK_SPECIFIER.test(specifier ?? \"\")) continue;\n        if (typeOnly) continue;\n        if (/^\\s*\\*\\s+as\\s/.test(clause ?? \"\")) return null;\n\n        const braces = /\\{([^}]*)\\}/.exec(clause ?? \"\");\n        if (!braces) continue;\n        for (const part of (braces[1] ?? \"\").split(\",\")) {\n            const binding = part.trim();\n            if (!binding || binding.startsWith(\"type \")) continue;\n            const name = binding.split(/\\s+as\\s+/)[0]?.trim();\n            if (name) names.add(name);\n        }\n    }\n    return [...names];\n}\n\n/**\n * Build the stylesheet for a set of export names.\n *\n * Emits `@import` statements rather than inlined rules so Vite's own CSS pipeline\n * resolves, deduplicates and minifies them — the same treatment a hand-written\n * list of imports gets, which is what this replaces.\n *\n * The narrowed token block is the exception, and it goes last for a reason the\n * cascade does not explain: `@import` is only valid before any rule, so a token\n * block written above the imports would make every one of them invalid and the\n * components would arrive with no CSS at all. Putting it last is safe because the\n * block declares custom properties and nothing else — resolving `var()` does not\n * depend on where in the document the declaration sits, only on which selector\n * wins, and no component sheet declares a token to compete with.\n *\n * @param names - Export names the app imports, or `null` to take everything.\n * @param manifest - The published style manifest.\n * @param reset - How much of the reset to emit.\n * @param tokenBlock - The narrowed token sheet, or `null` to `@import` it whole.\n * @returns CSS source.\n */\nexport function buildStyleEntry(\n    names: readonly string[] | null,\n    manifest: StyleManifest,\n    reset: ResetMode = \"scoped\",\n    tokenBlock: string | null = null,\n): string {\n    const banner = \"/* Generated by tempestStyles() — the CSS this app actually uses. */\\n\";\n    const tokenSheets = tokenBlock === null ? [\"tokens.css\"] : [];\n    const foundation =\n        reset === \"global\"\n            ? tokenBlock === null\n                ? [manifest.core]\n                : [...tokenSheets, \"base.css\"]\n            : reset === \"scoped\"\n              ? [...tokenSheets, \"scoped.css\"]\n              : tokenSheets;\n\n    const trailer = tokenBlock === null ? \"\" : `${tokenBlock}\\n`;\n\n    if (names === null) {\n        const whole =\n            reset === \"global\"\n                ? [manifest.core, \"../styles.css\"]\n                : [...foundation, \"../styles.css\"];\n        return `${banner}${whole.map((sheet) => `@import \"tempest-react-sdk/styles/${sheet}\";`).join(\"\\n\")}\\n${trailer}`;\n    }\n\n    const sheets = new Set<string>();\n    for (const name of names) {\n        for (const sheet of manifest.components[name] ?? []) sheets.add(sheet);\n    }\n    const lines = [...foundation, ...[...sheets].sort()].map(\n        (sheet) => `@import \"tempest-react-sdk/styles/${sheet}\";`,\n    );\n    return `${banner}${lines.join(\"\\n\")}\\n${trailer}`;\n}\n\n/**\n * The stylesheets an entry will load, by name, for the token closure to read.\n *\n * @param names - Export names the app imports, or `null` when unknowable.\n * @param manifest - The published style manifest.\n * @param reset - How much of the reset to emit.\n * @returns Stylesheet file names under `dist/styles/`.\n */\nexport function selectedSheets(\n    names: readonly string[] | null,\n    manifest: StyleManifest,\n    reset: ResetMode,\n): string[] {\n    if (names === null) return [\"../styles.css\"];\n    const sheets = new Set<string>();\n    if (reset === \"scoped\") sheets.add(\"scoped.css\");\n    if (reset === \"global\") sheets.add(\"base.css\");\n    for (const name of names) {\n        for (const sheet of manifest.components[name] ?? []) sheets.add(sheet);\n    }\n    return [...sheets].sort();\n}\n\n/**\n * Walk a directory and collect every source and stylesheet path.\n *\n * @param dir - Absolute directory to walk.\n * @param skip - Directory names to skip.\n * @returns Absolute file paths.\n */\nasync function collectSourceFiles(dir: string, skip: ReadonlySet<string>): Promise<string[]> {\n    const out: string[] = [];\n    let entries;\n    try {\n        entries = await readdir(dir, { withFileTypes: true });\n    } catch {\n        return out;\n    }\n    for (const entry of entries) {\n        if (entry.isDirectory()) {\n            if (skip.has(entry.name) || entry.name.startsWith(\".\")) continue;\n            out.push(...(await collectSourceFiles(join(dir, entry.name), skip)));\n        } else if (\n            entry.isFile() &&\n            (SOURCE_FILE.test(entry.name) || STYLE_FILE.test(entry.name))\n        ) {\n            out.push(join(dir, entry.name));\n        }\n    }\n    return out;\n}\n\n/**\n * Read the style manifest the installed package ships.\n *\n * Resolved by walking the filesystem rather than through `createRequire`, which\n * does not survive the trip: Vite bundles `vite.config.ts` into a temporary module\n * before running it, and in that bundle the `node:module` namespace import comes\n * back without the function — `(0, a.createRequire) is not a function`, at load\n * time, inside the build. The same rewrite is why `import.meta.url` is only the\n * fallback here and the app's `node_modules` is tried first.\n *\n * @param root - The Vite root, where the walk for `node_modules` starts.\n * @returns The manifest and the directory it was read from, which is also where the\n *   stylesheets it names live.\n * @throws If no installed copy carries one — an SDK older than the manifest.\n */\nfunction readManifest(root: string): { manifest: StyleManifest; dir: string } {\n    const relative = join(\"tempest-react-sdk\", \"dist\", \"styles\", \"manifest.json\");\n    const candidates: string[] = [];\n\n    let dir = resolve(root);\n    for (;;) {\n        candidates.push(join(dir, \"node_modules\", relative));\n        const parent = dirname(dir);\n        if (parent === dir) break;\n        dir = parent;\n    }\n    candidates.push(join(dirname(fileURLToPath(import.meta.url)), \"..\", \"styles\", \"manifest.json\"));\n\n    for (const candidate of candidates) {\n        try {\n            const manifest = JSON.parse(readFileSync(candidate, \"utf8\")) as StyleManifest;\n            return { manifest, dir: dirname(candidate) };\n        } catch {\n            continue;\n        }\n    }\n    throw new Error(\n        \"tempestStyles(): tempest-react-sdk/dist/styles/manifest.json not found — \" +\n            \"the installed SDK predates it. Upgrade, or drop the plugin and import \" +\n            \"tempest-react-sdk/styles.css.\",\n    );\n}\n\n/**\n * Import only the SDK stylesheets your app can actually reach.\n *\n * `styles.css` carries every component the SDK ships — measured at 236.71 kB raw\n * against the 38.94 kB an app mounting twelve of them can reach. The per-component\n * sheets under `styles/` have always closed that gap, but by hand: the app lists\n * them and keeps the list honest as it grows. This plugin makes the list the build's\n * problem, resolving it from the imports the source already writes.\n *\n * The closure matters more than the scan. A component pays for the CSS of every SDK\n * component it renders internally, so `<DataTable>` alone needs six sheets and\n * `<AIChat>` seven — a hand-kept list of one sheet per component the app names is\n * wrong in a way that only shows up as an unstyled child.\n *\n * The reset is the other half, and the half that breaks apps. `styles.css` claims\n * `html`, `body` and `#root`; an app with its own layout that imports it loses its\n * document surface, and an app that drops the import loses the box model its\n * components are written against — components render unstyled, which is what the\n * \"just remove the import\" fix actually costs. The default `reset: \"scoped\"` is the\n * third option: the same normalisation, confined to\n * `:where([class*=\"tempest_\"])`, so it reaches inside a Tempest component and\n * nowhere else.\n *\n * `tempest-react-sdk/styles/auto.css` is a real file, so it resolves without the\n * plugin too — to the complete sheet. Dropping the plugin costs bytes, never\n * correctness.\n *\n * @param options - Scan configuration.\n * @returns The Vite plugin.\n *\n * @example\n * // vite.config.ts\n * import { createViteConfig, tempestStyles } from \"tempest-react-sdk/vite\";\n *\n * export default createViteConfig({ plugins: [tempestStyles()] });\n *\n * @example\n * // src/main.tsx — the one import, instead of a maintained list\n * import \"tempest-react-sdk/styles/auto.css\";\n */\nexport function tempestStyles(options: TempestStylesOptions = {}): TempestVitePlugin {\n    const { dir = \"src\", include = [], skipDirs, reset = \"scoped\", tokens = \"used\" } = options;\n    const skip = new Set<string>(skipDirs ?? SKIP_DIRS);\n    let root = process.cwd();\n    let names: string[] | null = [...include];\n    let appStyleUsage = \"\";\n\n    /**\n     * Rescan the source tree, keeping the explicitly included names.\n     *\n     * @tempest-limits empty-catch — the scan races the editor and the file system:\n     * a file listed a moment ago can be renamed, deleted, or held by another process\n     * by the time it is read. An unreadable file contributes no names and the build\n     * continues; failing the whole scan would break `vite dev` over a temp file that\n     * no longer exists.\n     */\n    const rescan = async (): Promise<void> => {\n        const found = new Set<string>(include);\n        const usage: string[] = [];\n        let namespaced = false;\n        for (const file of await collectSourceFiles(resolve(root, dir), skip)) {\n            let code: string;\n            try {\n                code = await readFile(file, \"utf8\");\n            } catch {\n                continue;\n            }\n            if (code.includes(\"--tempest-\")) usage.push(code);\n            if (STYLE_FILE.test(file)) continue;\n            const scanned = scanStyleImports(code);\n            if (scanned === null) namespaced = true;\n            else for (const name of scanned) found.add(name);\n        }\n        appStyleUsage = usage.join(\"\\n\");\n        names = namespaced ? null : [...found];\n    };\n\n    /**\n     * The token block for this build, or `null` to `@import` the whole sheet.\n     *\n     * Reads the stylesheets the entry is about to load and closes over the tokens\n     * they consult, plus the ones the app's own CSS consults. Any read it cannot\n     * resolve statically — a name assembled at runtime, an unreadable sheet, a\n     * package too old to ship `tokens.css` — returns `null`, which costs bytes and\n     * never correctness. Serving a token sheet with a hole in it would do the\n     * opposite.\n     *\n     * @param manifest - The published style manifest.\n     * @param styleDir - Directory the manifest and its stylesheets live in.\n     * @returns The narrowed sheet, or `null`.\n     */\n    const narrowedTokens = (manifest: StyleManifest, styleDir: string): string | null => {\n        if (tokens === \"all\" || names === null) return null;\n        let tokensCss: string;\n        try {\n            tokensCss = readFileSync(join(styleDir, \"tokens.css\"), \"utf8\");\n        } catch {\n            return null;\n        }\n        const parts: string[] = [appStyleUsage];\n        for (const sheet of selectedSheets(names, manifest, reset)) {\n            try {\n                parts.push(readFileSync(join(styleDir, sheet), \"utf8\"));\n            } catch {\n                return null;\n            }\n        }\n        return narrowTokens(tokensCss, parts.join(\"\\n\"));\n    };\n\n    return {\n        name: \"tempest-styles\",\n        enforce: \"pre\",\n\n        configResolved(config: { root?: string }) {\n            root = config.root ?? root;\n        },\n\n        async buildStart() {\n            await rescan();\n        },\n\n        resolveId(id: string) {\n            return id === TEMPEST_STYLES_ID ? RESOLVED_ID : null;\n        },\n\n        load(id: string) {\n            if (id !== RESOLVED_ID) return null;\n            const { manifest, dir: styleDir } = readManifest(root);\n            return buildStyleEntry(names, manifest, reset, narrowedTokens(manifest, styleDir));\n        },\n    };\n}\n"],"mappings":";;;;;;AASA,IAAa,IAAoB,qCAE3B,IAAc,6BAGd,IAAgB,oDAEhB,IAAc,mBAUd,IAAa,2BACb,oBAAY,IAAI,IAAI;CAAC;CAAgB;CAAQ;CAAS;AAAU,CAAC;AAyEvE,SAAgB,EAAiB,GAA+B;CAC5D,IAAM,oBAAQ,IAAI,IAAY;CAE9B,KAAK,IAAM,KAAS,EAAK,SACrB,4DACJ,GAAG;EACC,IAAM,GAAG,GAAU,GAAQ,KAAa;EAExC,IADI,CAAC,EAAc,KAAK,KAAa,EAAE,KACnC,GAAU;EACd,IAAI,gBAAgB,KAAK,KAAU,EAAE,GAAG,OAAO;EAE/C,IAAM,IAAS,cAAc,KAAK,KAAU,EAAE;EACzC,OACL,KAAK,IAAM,MAAS,EAAO,MAAM,GAAA,CAAI,MAAM,GAAG,GAAG;GAC7C,IAAM,IAAU,EAAK,KAAK;GAC1B,IAAI,CAAC,KAAW,EAAQ,WAAW,OAAO,GAAG;GAC7C,IAAM,IAAO,EAAQ,MAAM,UAAU,CAAC,CAAC,EAAE,EAAE,KAAK;GAChD,AAAI,KAAM,EAAM,IAAI,CAAI;EAC5B;CACJ;CACA,OAAO,CAAC,GAAG,CAAK;AACpB;AAuBA,SAAgB,EACZ,GACA,GACA,IAAmB,UACnB,IAA4B,MACtB;CACN,IAAM,IAAS,0EACT,IAAc,MAAe,OAAO,CAAC,YAAY,IAAI,CAAC,GACtD,IACF,MAAU,WACJ,MAAe,OACX,CAAC,EAAS,IAAI,IACd,CAAC,GAAG,GAAa,UAAU,IAC/B,MAAU,WACR,CAAC,GAAG,GAAa,YAAY,IAC7B,GAEN,IAAU,MAAe,OAAO,KAAK,GAAG,EAAW;CAEzD,IAAI,MAAU,MAKV,OAAO,GAAG,KAHN,MAAU,WACJ,CAAC,EAAS,MAAM,eAAe,IAC/B,CAAC,GAAG,GAAY,eAAe,EAAA,CAChB,KAAK,MAAU,qCAAqC,EAAM,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,IAAI;CAG3G,IAAM,oBAAS,IAAI,IAAY;CAC/B,KAAK,IAAM,KAAQ,GACf,KAAK,IAAM,KAAS,EAAS,WAAW,MAAS,CAAC,GAAG,EAAO,IAAI,CAAK;CAKzE,OAAO,GAAG,IAHI,CAAC,GAAG,GAAY,GAAG,CAAC,GAAG,CAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAChD,MAAU,qCAAqC,EAAM,GAEvC,CAAA,CAAM,KAAK,IAAI,EAAE,IAAI;AAC5C;AAUA,SAAgB,EACZ,GACA,GACA,GACQ;CACR,IAAI,MAAU,MAAM,OAAO,CAAC,eAAe;CAC3C,IAAM,oBAAS,IAAI,IAAY;CAE/B,AADI,MAAU,YAAU,EAAO,IAAI,YAAY,GAC3C,MAAU,YAAU,EAAO,IAAI,UAAU;CAC7C,KAAK,IAAM,KAAQ,GACf,KAAK,IAAM,KAAS,EAAS,WAAW,MAAS,CAAC,GAAG,EAAO,IAAI,CAAK;CAEzE,OAAO,CAAC,GAAG,CAAM,CAAC,CAAC,KAAK;AAC5B;AASA,eAAe,EAAmB,GAAa,GAA8C;CACzF,IAAM,IAAgB,CAAC,GACnB;CACJ,IAAI;EACA,IAAU,MAAM,EAAQ,GAAK,EAAE,eAAe,GAAK,CAAC;CACxD,QAAQ;EACJ,OAAO;CACX;CACA,KAAK,IAAM,KAAS,GAChB,IAAI,EAAM,YAAY,GAAG;EACrB,IAAI,EAAK,IAAI,EAAM,IAAI,KAAK,EAAM,KAAK,WAAW,GAAG,GAAG;EACxD,EAAI,KAAK,GAAI,MAAM,EAAmB,EAAK,GAAK,EAAM,IAAI,GAAG,CAAI,CAAE;CACvE,OAAO,AACH,EAAM,OAAO,MACZ,EAAY,KAAK,EAAM,IAAI,KAAK,EAAW,KAAK,EAAM,IAAI,MAE3D,EAAI,KAAK,EAAK,GAAK,EAAM,IAAI,CAAC;CAGtC,OAAO;AACX;AAiBA,SAAS,EAAa,GAAwD;CAC1E,IAAM,IAAW,EAAK,qBAAqB,QAAQ,UAAU,eAAe,GACtE,IAAuB,CAAC,GAE1B,IAAM,EAAQ,CAAI;CACtB,SAAS;EACL,EAAW,KAAK,EAAK,GAAK,gBAAgB,CAAQ,CAAC;EACnD,IAAM,IAAS,EAAQ,CAAG;EAC1B,IAAI,MAAW,GAAK;EACpB,IAAM;CACV;CACA,EAAW,KAAK,EAAK,EAAQ,EAAc,YAAY,GAAG,CAAC,GAAG,MAAM,UAAU,eAAe,CAAC;CAE9F,KAAK,IAAM,KAAa,GACpB,IAAI;EAEA,OAAO;GAAE,UADQ,KAAK,MAAM,EAAa,GAAW,MAAM,CACjD;GAAU,KAAK,EAAQ,CAAS;EAAE;CAC/C,QAAQ;EACJ;CACJ;CAEJ,MAAU,MACN,8KAGJ;AACJ;AA0CA,SAAgB,EAAc,IAAgC,CAAC,GAAsB;CACjF,IAAM,EAAE,SAAM,OAAO,aAAU,CAAC,GAAG,aAAU,WAAQ,UAAU,YAAS,WAAW,GAC7E,IAAO,IAAI,IAAY,KAAY,CAAS,GAC9C,IAAO,QAAQ,IAAI,GACnB,IAAyB,CAAC,GAAG,CAAO,GACpC,IAAgB,IAWd,IAAS,YAA2B;EACtC,IAAM,IAAQ,IAAI,IAAY,CAAO,GAC/B,IAAkB,CAAC,GACrB,IAAa;EACjB,KAAK,IAAM,KAAQ,MAAM,EAAmB,EAAQ,GAAM,CAAG,GAAG,CAAI,GAAG;GACnE,IAAI;GACJ,IAAI;IACA,IAAO,MAAM,EAAS,GAAM,MAAM;GACtC,QAAQ;IACJ;GACJ;GAEA,IADI,EAAK,SAAS,YAAY,KAAG,EAAM,KAAK,CAAI,GAC5C,EAAW,KAAK,CAAI,GAAG;GAC3B,IAAM,IAAU,EAAiB,CAAI;GACrC,IAAI,MAAY,MAAM,IAAa;QAC9B,KAAK,IAAM,KAAQ,GAAS,EAAM,IAAI,CAAI;EACnD;EAEA,AADA,IAAgB,EAAM,KAAK,IAAI,GAC/B,IAAQ,IAAa,OAAO,CAAC,GAAG,CAAK;CACzC,GAgBM,KAAkB,GAAyB,MAAoC;EACjF,IAAI,MAAW,SAAS,MAAU,MAAM,OAAO;EAC/C,IAAI;EACJ,IAAI;GACA,IAAY,EAAa,EAAK,GAAU,YAAY,GAAG,MAAM;EACjE,QAAQ;GACJ,OAAO;EACX;EACA,IAAM,IAAkB,CAAC,CAAa;EACtC,KAAK,IAAM,KAAS,EAAe,GAAO,GAAU,CAAK,GACrD,IAAI;GACA,EAAM,KAAK,EAAa,EAAK,GAAU,CAAK,GAAG,MAAM,CAAC;EAC1D,QAAQ;GACJ,OAAO;EACX;EAEJ,OAAO,EAAa,GAAW,EAAM,KAAK,IAAI,CAAC;CACnD;CAEA,OAAO;EACH,MAAM;EACN,SAAS;EAET,eAAe,GAA2B;GACtC,IAAO,EAAO,QAAQ;EAC1B;EAEA,MAAM,aAAa;GACf,MAAM,EAAO;EACjB;EAEA,UAAU,GAAY;GAClB,OAAO,MAAA,sCAA2B,IAAc;EACpD;EAEA,KAAK,GAAY;GACb,IAAI,MAAO,GAAa,OAAO;GAC/B,IAAM,EAAE,aAAU,KAAK,MAAa,EAAa,CAAI;GACrD,OAAO,EAAgB,GAAO,GAAU,GAAO,EAAe,GAAU,CAAQ,CAAC;EACrF;CACJ;AACJ"}
+{"version":3,"file":"tempest-styles.js","names":["TEMPEST_STYLES_ID","RESOLVED_ID","SDK_SPECIFIER","SOURCE_FILE","STYLE_FILE","SKIP_DIRS","scanStyleImports","names","match","code","typeOnly","clause","specifier","braces","part","binding","name","buildStyleEntry","banner","tokenSheets","tokenBlock","foundation","reset","manifest","trailer","sheet","sheets","selectedSheets","collectSourceFiles","out","entries","readdir","dir","entry","skip","join","readManifest","relative","candidates","resolve","root","parent","dirname","fileURLToPath","candidate","readFileSync","tempestStyles","options","skipDirs","include","appStyleUsage","rescan","found","usage","namespaced","file","readFile","scanned","narrowedTokens","tokens","tokensCss","styleDir","parts","narrowTokens","config","id"],"sources":["../../src/vite/tempest-styles.ts"],"sourcesContent":["import { readdir, readFile } from \"node:fs/promises\";\nimport { readFileSync } from \"node:fs\";\nimport { dirname, join, resolve } from \"node:path\";\nimport { fileURLToPath } from \"node:url\";\n\nimport { narrowTokens } from \"./narrow-tokens\";\nimport type { TempestVitePlugin } from \"./tempest-pwa-manifest\";\n\n/** The stylesheet id an app imports to get exactly the CSS it uses. */\nexport const TEMPEST_STYLES_ID = \"tempest-react-sdk/styles/auto.css\";\n\nconst RESOLVED_ID = \"\\0tempest-styles/auto.css\";\n\n/** Package subpaths whose exports are components with stylesheets. */\nconst SDK_SPECIFIER = /^tempest-react-sdk(\\/(charts|editor|br|icons))?$/;\n\nconst SOURCE_FILE = /\\.[cm]?[jt]sx?$/;\n\n/**\n * The app's own stylesheets, scanned for token reads rather than for imports.\n *\n * An app is documented as free to read `--tempest-*` in CSS of its own, so cutting\n * the token sheet to what the SDK's components reach would drop tokens the app is\n * still reading — and a dropped token is not a smaller sheet, it is an unset\n * property. These files contribute reads to the closure and nothing else.\n */\nconst STYLE_FILE = /\\.(css|scss|sass|less)$/;\nconst SKIP_DIRS = new Set([\"node_modules\", \"dist\", \"build\", \"coverage\"]);\n\n/**\n * How much of the reset an app takes.\n *\n * The components are written against the reset — `.tempest_button` assumes\n * `button { background: none; border: 0; padding: 0 }`, every width assumes\n * `box-sizing: border-box` — so `\"none\"` is not \"unstyled document, styled\n * components\": it is components missing their box model. It exists for the app\n * that already ships an equivalent reset of its own.\n */\nexport type ResetMode = \"scoped\" | \"global\" | \"none\";\n\n/**\n * How much of the token sheet an app takes.\n *\n * `\"used\"` emits only the tokens the selected stylesheets — and the app's own CSS —\n * can reach, following token-to-token references. `\"all\"` emits `tokens.css` whole,\n * which is what to reach for when the app names tokens somewhere the scan cannot\n * see: a token read from a CSS-in-JS library, a sibling package's stylesheet, a\n * `<style>` block in `index.html`.\n */\nexport type TokenMode = \"used\" | \"all\";\n\n/** Shape of `dist/styles/manifest.json`. */\nexport interface StyleManifest {\n    /** The foundation sheet — tokens and reset together, the pre-split default. */\n    core: string;\n    /** Public export name → the stylesheets it needs, transitive closure included. */\n    components: Record<string, readonly string[]>;\n}\n\nexport interface TempestStylesOptions {\n    /** Directory to scan, relative to the Vite root. Default: `\"src\"`. */\n    dir?: string;\n    /**\n     * Which reset to emit alongside the tokens. Default: `\"scoped\"`.\n     *\n     * `\"scoped\"` confines the reset to `:where([class*=\"tempest_\"])`, so components\n     * keep the normalisation they are written against and the app keeps `html`,\n     * `body` and `#root`. `\"global\"` is the pre-split behaviour, correct when the\n     * SDK owns the whole page. `\"none\"` emits tokens only.\n     */\n    reset?: ResetMode;\n    /**\n     * Extra export names to style even when the scan cannot see them — a component\n     * reached only through a namespace import, or rendered by a sibling package.\n     */\n    include?: readonly string[];\n    /** Directory names to skip. Default: `node_modules`, `dist`, `build`, `coverage`. */\n    skipDirs?: readonly string[];\n    /**\n     * How much of the token sheet to emit. Default: `\"used\"`.\n     *\n     * The default falls back to the whole sheet on its own whenever a token name is\n     * assembled at runtime (`` `var(--tempest-${tone})` ``), so `\"all\"` is for the\n     * case the scan cannot see at all — a token read from outside `dir`.\n     */\n    tokens?: TokenMode;\n}\n\n/**\n * Collect the SDK export names a source file imports.\n *\n * Reads the import specifier rather than the JSX, because a bare `<Button>` in the\n * markup says nothing about where it came from — the app may well define its own.\n * Type-only bindings are dropped: they are erased before any component renders, so\n * paying for their CSS would be paying for nothing.\n *\n * @param code - File contents.\n * @returns The imported names, or `null` when the file namespace-imports the SDK\n *   and the set therefore cannot be known.\n */\nexport function scanStyleImports(code: string): string[] | null {\n    const names = new Set<string>();\n\n    for (const match of code.matchAll(\n        /\\bimport\\s+(type\\s+)?([^;'\"]*?)\\s+from\\s*[\"']([^\"']+)[\"']/g,\n    )) {\n        const [, typeOnly, clause, specifier] = match;\n        if (!SDK_SPECIFIER.test(specifier ?? \"\")) continue;\n        if (typeOnly) continue;\n        if (/^\\s*\\*\\s+as\\s/.test(clause ?? \"\")) return null;\n\n        const braces = /\\{([^}]*)\\}/.exec(clause ?? \"\");\n        if (!braces) continue;\n        for (const part of (braces[1] ?? \"\").split(\",\")) {\n            const binding = part.trim();\n            if (!binding || binding.startsWith(\"type \")) continue;\n            const name = binding.split(/\\s+as\\s+/)[0]?.trim();\n            if (name) names.add(name);\n        }\n    }\n    return [...names];\n}\n\n/**\n * Build the stylesheet for a set of export names.\n *\n * Emits `@import` statements rather than inlined rules so Vite's own CSS pipeline\n * resolves, deduplicates and minifies them — the same treatment a hand-written\n * list of imports gets, which is what this replaces.\n *\n * The narrowed token block is the exception, and it goes last for a reason the\n * cascade does not explain: `@import` is only valid before any rule, so a token\n * block written above the imports would make every one of them invalid and the\n * components would arrive with no CSS at all. Putting it last is safe because the\n * block declares custom properties and nothing else — resolving `var()` does not\n * depend on where in the document the declaration sits, only on which selector\n * wins, and no component sheet declares a token to compete with.\n *\n * @param names - Export names the app imports, or `null` to take everything.\n * @param manifest - The published style manifest.\n * @param reset - How much of the reset to emit.\n * @param tokenBlock - The narrowed token sheet, or `null` to `@import` it whole.\n * @returns CSS source.\n */\nexport function buildStyleEntry(\n    names: readonly string[] | null,\n    manifest: StyleManifest,\n    reset: ResetMode = \"scoped\",\n    tokenBlock: string | null = null,\n): string {\n    const banner = \"/* Generated by tempestStyles() — the CSS this app actually uses. */\\n\";\n    const tokenSheets = tokenBlock === null ? [\"tokens.css\"] : [];\n    const foundation =\n        reset === \"global\"\n            ? tokenBlock === null\n                ? [manifest.core]\n                : [...tokenSheets, \"base.css\"]\n            : reset === \"scoped\"\n              ? [...tokenSheets, \"scoped.css\"]\n              : tokenSheets;\n\n    const trailer = tokenBlock === null ? \"\" : `${tokenBlock}\\n`;\n\n    if (names === null) {\n        const whole =\n            reset === \"global\"\n                ? [manifest.core, \"../styles.css\"]\n                : [...foundation, \"../styles.css\"];\n        return `${banner}${whole.map((sheet) => `@import \"tempest-react-sdk/styles/${sheet}\";`).join(\"\\n\")}\\n${trailer}`;\n    }\n\n    const sheets = new Set<string>();\n    for (const name of names) {\n        for (const sheet of manifest.components[name] ?? []) sheets.add(sheet);\n    }\n    const lines = [...foundation, ...[...sheets].sort()].map(\n        (sheet) => `@import \"tempest-react-sdk/styles/${sheet}\";`,\n    );\n    return `${banner}${lines.join(\"\\n\")}\\n${trailer}`;\n}\n\n/**\n * The stylesheets an entry will load, by name, for the token closure to read.\n *\n * @param names - Export names the app imports, or `null` when unknowable.\n * @param manifest - The published style manifest.\n * @param reset - How much of the reset to emit.\n * @returns Stylesheet file names under `dist/styles/`.\n */\nexport function selectedSheets(\n    names: readonly string[] | null,\n    manifest: StyleManifest,\n    reset: ResetMode,\n): string[] {\n    if (names === null) return [\"../styles.css\"];\n    const sheets = new Set<string>();\n    if (reset === \"scoped\") sheets.add(\"scoped.css\");\n    if (reset === \"global\") sheets.add(\"base.css\");\n    for (const name of names) {\n        for (const sheet of manifest.components[name] ?? []) sheets.add(sheet);\n    }\n    return [...sheets].sort();\n}\n\n/**\n * Walk a directory and collect every source and stylesheet path.\n *\n * @param dir - Absolute directory to walk.\n * @param skip - Directory names to skip.\n * @returns Absolute file paths.\n */\nasync function collectSourceFiles(dir: string, skip: ReadonlySet<string>): Promise<string[]> {\n    const out: string[] = [];\n    let entries;\n    try {\n        entries = await readdir(dir, { withFileTypes: true });\n    } catch {\n        return out;\n    }\n    for (const entry of entries) {\n        if (entry.isDirectory()) {\n            if (skip.has(entry.name) || entry.name.startsWith(\".\")) continue;\n            out.push(...(await collectSourceFiles(join(dir, entry.name), skip)));\n        } else if (\n            entry.isFile() &&\n            (SOURCE_FILE.test(entry.name) || STYLE_FILE.test(entry.name))\n        ) {\n            out.push(join(dir, entry.name));\n        }\n    }\n    return out;\n}\n\n/**\n * Read the style manifest the installed package ships.\n *\n * Resolved by walking the filesystem rather than through `createRequire`, which\n * does not survive the trip: Vite bundles `vite.config.ts` into a temporary module\n * before running it, and in that bundle the `node:module` namespace import comes\n * back without the function — `(0, a.createRequire) is not a function`, at load\n * time, inside the build. The same rewrite is why `import.meta.url` is only the\n * fallback here and the app's `node_modules` is tried first.\n *\n * @param root - The Vite root, where the walk for `node_modules` starts.\n * @returns The manifest and the directory it was read from, which is also where the\n *   stylesheets it names live.\n * @throws If no installed copy carries one — an SDK older than the manifest.\n */\nfunction readManifest(root: string): { manifest: StyleManifest; dir: string } {\n    const relative = join(\"tempest-react-sdk\", \"dist\", \"styles\", \"manifest.json\");\n    const candidates: string[] = [];\n\n    let dir = resolve(root);\n    for (;;) {\n        candidates.push(join(dir, \"node_modules\", relative));\n        const parent = dirname(dir);\n        if (parent === dir) break;\n        dir = parent;\n    }\n    candidates.push(join(dirname(fileURLToPath(import.meta.url)), \"..\", \"styles\", \"manifest.json\"));\n\n    for (const candidate of candidates) {\n        try {\n            const manifest = JSON.parse(readFileSync(candidate, \"utf8\")) as StyleManifest;\n            return { manifest, dir: dirname(candidate) };\n        } catch {\n            continue;\n        }\n    }\n    throw new Error(\n        \"tempestStyles(): tempest-react-sdk/dist/styles/manifest.json not found — \" +\n            \"the installed SDK predates it. Upgrade, or drop the plugin and import \" +\n            \"tempest-react-sdk/styles.css.\",\n    );\n}\n\n/**\n * Import only the SDK stylesheets your app can actually reach.\n *\n * `styles.css` carries every component the SDK ships — measured at 236.71 kB raw\n * against the 38.94 kB an app mounting twelve of them can reach. The per-component\n * sheets under `styles/` have always closed that gap, but by hand: the app lists\n * them and keeps the list honest as it grows. This plugin makes the list the build's\n * problem, resolving it from the imports the source already writes.\n *\n * The closure matters more than the scan. A component pays for the CSS of every SDK\n * component it renders internally, so `<DataTable>` alone needs six sheets and\n * `<AIChat>` seven — a hand-kept list of one sheet per component the app names is\n * wrong in a way that only shows up as an unstyled child.\n *\n * The reset is the other half, and the half that breaks apps. `styles.css` claims\n * `html`, `body` and `#root`; an app with its own layout that imports it loses its\n * document surface, and an app that drops the import loses the box model its\n * components are written against — components render unstyled, which is what the\n * \"just remove the import\" fix actually costs. The default `reset: \"scoped\"` is the\n * third option: the same normalisation, confined to\n * `:where([class*=\"tempest_\"])`, so it reaches inside a Tempest component and\n * nowhere else.\n *\n * `tempest-react-sdk/styles/auto.css` is a real file, so it resolves without the\n * plugin too — to the complete sheet. Dropping the plugin costs bytes, never\n * correctness.\n *\n * @param options - Scan configuration.\n * @returns The Vite plugin.\n *\n * @example\n * // vite.config.ts\n * import { createViteConfig, tempestStyles } from \"tempest-react-sdk/vite\";\n *\n * export default createViteConfig({ plugins: [tempestStyles()] });\n *\n * @example\n * // src/main.tsx — the one import, instead of a maintained list\n * import \"tempest-react-sdk/styles/auto.css\";\n */\nexport function tempestStyles(options: TempestStylesOptions = {}): TempestVitePlugin {\n    const { dir = \"src\", include = [], skipDirs, reset = \"scoped\", tokens = \"used\" } = options;\n    const skip = new Set<string>(skipDirs ?? SKIP_DIRS);\n    let root = process.cwd();\n    let names: string[] | null = [...include];\n    let appStyleUsage = \"\";\n\n    /**\n     * Rescan the source tree, keeping the explicitly included names.\n     *\n     * @tempest-limits empty-catch — the scan races the editor and the file system:\n     * a file listed a moment ago can be renamed, deleted, or held by another process\n     * by the time it is read. An unreadable file contributes no names and the build\n     * continues; failing the whole scan would break `vite dev` over a temp file that\n     * no longer exists.\n     */\n    const rescan = async (): Promise<void> => {\n        const found = new Set<string>(include);\n        const usage: string[] = [];\n        let namespaced = false;\n        for (const file of await collectSourceFiles(resolve(root, dir), skip)) {\n            let code: string;\n            try {\n                code = await readFile(file, \"utf8\");\n            } catch {\n                continue;\n            }\n            if (code.includes(\"--tempest-\")) usage.push(code);\n            if (STYLE_FILE.test(file)) continue;\n            const scanned = scanStyleImports(code);\n            if (scanned === null) namespaced = true;\n            else for (const name of scanned) found.add(name);\n        }\n        appStyleUsage = usage.join(\"\\n\");\n        names = namespaced ? null : [...found];\n    };\n\n    /**\n     * The token block for this build, or `null` to `@import` the whole sheet.\n     *\n     * Reads the stylesheets the entry is about to load and closes over the tokens\n     * they consult, plus the ones the app's own CSS consults. Any read it cannot\n     * resolve statically — a name assembled at runtime, an unreadable sheet, a\n     * package too old to ship `tokens.css` — returns `null`, which costs bytes and\n     * never correctness. Serving a token sheet with a hole in it would do the\n     * opposite.\n     *\n     * @param manifest - The published style manifest.\n     * @param styleDir - Directory the manifest and its stylesheets live in.\n     * @returns The narrowed sheet, or `null`.\n     */\n    const narrowedTokens = (manifest: StyleManifest, styleDir: string): string | null => {\n        if (tokens === \"all\" || names === null) return null;\n        let tokensCss: string;\n        try {\n            tokensCss = readFileSync(join(styleDir, \"tokens.css\"), \"utf8\");\n        } catch {\n            return null;\n        }\n        const parts: string[] = [appStyleUsage];\n        for (const sheet of selectedSheets(names, manifest, reset)) {\n            try {\n                parts.push(readFileSync(join(styleDir, sheet), \"utf8\"));\n            } catch {\n                return null;\n            }\n        }\n        return narrowTokens(tokensCss, parts.join(\"\\n\"));\n    };\n\n    return {\n        name: \"tempest-styles\",\n        enforce: \"pre\",\n\n        configResolved(config: { root?: string }) {\n            root = config.root ?? root;\n        },\n\n        async buildStart() {\n            await rescan();\n        },\n\n        resolveId(id: string) {\n            return id === TEMPEST_STYLES_ID ? RESOLVED_ID : null;\n        },\n\n        load(id: string) {\n            if (id !== RESOLVED_ID) return null;\n            const { manifest, dir: styleDir } = readManifest(root);\n            return buildStyleEntry(names, manifest, reset, narrowedTokens(manifest, styleDir));\n        },\n    };\n}\n"],"mappings":";;;;;;AASA,IAAaA,IAAoB,qCAE3BC,IAAc,6BAGdC,IAAgB,oDAEhBC,IAAc,mBAUdC,IAAa,2BACbC,oBAAY,IAAI,IAAI;CAAC;CAAgB;CAAQ;CAAS;AAAU,CAAC;AAyEvE,SAAgBC,EAAiB,GAA+B;CAC5D,IAAMC,oBAAQ,IAAI,IAAY;CAE9B,KAAK,IAAMC,KAASC,EAAK,SACrB,4DACJ,GAAG;EACC,IAAM,GAAGC,GAAUC,GAAQC,KAAaJ;EAExC,IADI,CAACN,EAAc,KAAKU,KAAa,EAAE,KACnCF,GAAU;EACd,IAAI,gBAAgB,KAAKC,KAAU,EAAE,GAAG,OAAO;EAE/C,IAAME,IAAS,cAAc,KAAKF,KAAU,EAAE;EAC9C,IAAKE,GACL,KAAK,IAAMC,MAASD,EAAO,MAAM,GAAA,CAAI,MAAM,GAAG,GAAG;GAC7C,IAAME,IAAUD,EAAK,KAAK;GAC1B,IAAI,CAACC,KAAWA,EAAQ,WAAW,OAAO,GAAG;GAC7C,IAAMC,IAAOD,EAAQ,MAAM,UAAU,CAAC,CAAC,EAAE,EAAE,KAAK;GAChD,AAAIC,KAAMT,EAAM,IAAIS,CAAI;EAC5B;CACJ;CACA,OAAO,CAAC,GAAGT,CAAK;AACpB;AAuBA,SAAgBU,EACZ,GACA,GACA,IAAmB,UACnB,IAA4B,MACtB;CACN,IAAMC,IAAS,0EACTC,IAAcC,MAAe,OAAO,CAAC,YAAY,IAAI,CAAC,GACtDC,IACFC,MAAU,WACJF,MAAe,OACX,CAACG,EAAS,IAAI,IACd,CAAC,GAAGJ,GAAa,UAAU,IAC/BG,MAAU,WACR,CAAC,GAAGH,GAAa,YAAY,IAC7BA,GAENK,IAAUJ,MAAe,OAAO,KAAK,GAAGA,EAAW;CAEzD,IAAIb,MAAU,MAKV,OAAO,GAAGW,KAHNI,MAAU,WACJ,CAACC,EAAS,MAAM,eAAe,IAC/B,CAAC,GAAGF,GAAY,eAAe,EAAA,CAChB,KAAK,MAAU,qCAAqCI,EAAM,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,IAAID;CAG3G,IAAME,oBAAS,IAAI,IAAY;CAC/B,KAAK,IAAMV,KAAQT,GACf,KAAK,IAAMkB,KAASF,EAAS,WAAWP,MAAS,CAAC,GAAG,EAAO,IAAIS,CAAK;CAKzE,OAAO,GAAGP,IAHI,CAAC,GAAGG,GAAY,GAAG,CAAC,GAAGK,CAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAChD,MAAU,qCAAqCD,EAAM,GAEvC,CAAA,CAAM,KAAK,IAAI,EAAE,IAAID;AAC5C;AAUA,SAAgBG,EACZ,GACA,GACA,GACQ;CACR,IAAIpB,MAAU,MAAM,OAAO,CAAC,eAAe;CAC3C,IAAMmB,oBAAS,IAAI,IAAY;CAE/B,AADIJ,MAAU,YAAUI,EAAO,IAAI,YAAY,GAC3CJ,MAAU,YAAUI,EAAO,IAAI,UAAU;CAC7C,KAAK,IAAMV,KAAQT,GACf,KAAK,IAAMkB,KAASF,EAAS,WAAWP,MAAS,CAAC,GAAG,EAAO,IAAIS,CAAK;CAEzE,OAAO,CAAC,GAAGC,CAAM,CAAC,CAAC,KAAK;AAC5B;AASA,eAAeE,EAAmB,GAAa,GAA8C;CACzF,IAAMC,IAAgB,CAAC,GACnBC;CACJ,IAAI;EACA,IAAU,MAAMC,EAAQC,GAAK,EAAE,eAAe,GAAK,CAAC;CACxD,QAAQ;EACJ,OAAOH;CACX;CACA,KAAK,IAAMI,KAASH,GAChB,IAAIG,EAAM,YAAY,GAAG;EACrB,IAAIC,EAAK,IAAID,EAAM,IAAI,KAAKA,EAAM,KAAK,WAAW,GAAG,GAAG;EACxD,EAAI,KAAK,GAAI,MAAML,EAAmBO,EAAKH,GAAKC,EAAM,IAAI,GAAGC,CAAI,CAAE;CACvE,OAAO,AACHD,EAAM,OAAO,MACZ9B,EAAY,KAAK8B,EAAM,IAAI,KAAK7B,EAAW,KAAK6B,EAAM,IAAI,MAE3DJ,EAAI,KAAKM,EAAKH,GAAKC,EAAM,IAAI,CAAC;CAGtC,OAAOJ;AACX;AAiBA,SAASO,EAAa,GAAwD;CAC1E,IAAMC,IAAWF,EAAK,qBAAqB,QAAQ,UAAU,eAAe,GACtEG,IAAuB,CAAC,GAE1BN,IAAMO,EAAQC,CAAI;CACtB,SAAS;EACL,EAAW,KAAKL,EAAKH,GAAK,gBAAgBK,CAAQ,CAAC;EACnD,IAAMI,IAASC,EAAQV,CAAG;EAC1B,IAAIS,MAAWT,GAAK;EACpB,IAAMS;CACV;CACA,EAAW,KAAKN,EAAKO,EAAQC,EAAc,YAAY,GAAG,CAAC,GAAG,MAAM,UAAU,eAAe,CAAC;CAE9F,KAAK,IAAMC,KAAaN,GACpB,IAAI;EAEA,OAAO;GAAE,UADQ,KAAK,MAAMO,EAAaD,GAAW,MAAM,CACjD;GAAU,KAAKF,EAAQE,CAAS;EAAE;CAC/C,QAAQ;EACJ;CACJ;CAEJ,MAAU,MACN,8KAGJ;AACJ;AA0CA,SAAgBE,EAAc,IAAgC,CAAC,GAAsB;CACjF,IAAM,EAAE,SAAM,OAAO,aAAU,CAAC,GAAG,aAAU,WAAQ,UAAU,YAAS,WAAWC,GAC7Eb,IAAO,IAAI,IAAYc,KAAY3C,CAAS,GAC9CmC,IAAO,QAAQ,IAAI,GACnBjC,IAAyB,CAAC,GAAG0C,CAAO,GACpCC,IAAgB,IAWdC,IAAS,YAA2B;EACtC,IAAMC,IAAQ,IAAI,IAAYH,CAAO,GAC/BI,IAAkB,CAAC,GACrBC,IAAa;EACjB,KAAK,IAAMC,KAAQ,MAAM3B,EAAmBW,EAAQC,GAAMR,CAAG,GAAGE,CAAI,GAAG;GACnE,IAAIzB;GACJ,IAAI;IACA,IAAO,MAAM+C,EAASD,GAAM,MAAM;GACtC,QAAQ;IACJ;GACJ;GAEA,IADI9C,EAAK,SAAS,YAAY,KAAG4C,EAAM,KAAK5C,CAAI,GAC5CL,EAAW,KAAKmD,CAAI,GAAG;GAC3B,IAAME,IAAUnD,EAAiBG,CAAI;GACrC,IAAIgD,MAAY,MAAM,IAAa;QAC9B,KAAK,IAAMzC,KAAQyC,GAAS,EAAM,IAAIzC,CAAI;EACnD;EAEA,AADA,IAAgBqC,EAAM,KAAK,IAAI,GAC/B,IAAQC,IAAa,OAAO,CAAC,GAAGF,CAAK;CACzC,GAgBMM,KAAkB,GAAyB,MAAoC;EACjF,IAAIC,MAAW,SAASpD,MAAU,MAAM,OAAO;EAC/C,IAAIqD;EACJ,IAAI;GACA,IAAYf,EAAaV,EAAK0B,GAAU,YAAY,GAAG,MAAM;EACjE,QAAQ;GACJ,OAAO;EACX;EACA,IAAMC,IAAkB,CAACZ,CAAa;EACtC,KAAK,IAAMzB,KAASE,EAAepB,GAAOgB,GAAUD,CAAK,GACrD,IAAI;GACA,EAAM,KAAKuB,EAAaV,EAAK0B,GAAUpC,CAAK,GAAG,MAAM,CAAC;EAC1D,QAAQ;GACJ,OAAO;EACX;EAEJ,OAAOsC,EAAaH,GAAWE,EAAM,KAAK,IAAI,CAAC;CACnD;CAEA,OAAO;EACH,MAAM;EACN,SAAS;EAET,eAAe,GAA2B;GACtC,IAAOE,EAAO,QAAQxB;EAC1B;EAEA,MAAM,aAAa;GACf,MAAMW,EAAO;EACjB;EAEA,UAAU,GAAY;GAClB,OAAOc,MAAA,sCAA2BhE,IAAc;EACpD;EAEA,KAAK,GAAY;GACb,IAAIgE,MAAOhE,GAAa,OAAO;GAC/B,IAAM,EAAE,aAAU,KAAK4D,MAAazB,EAAaI,CAAI;GACrD,OAAOvB,EAAgBV,GAAOgB,GAAUD,GAAOoC,EAAenC,GAAUsC,CAAQ,CAAC;EACrF;CACJ;AACJ"}

package/dist/vite/tempest-vitest.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"tempest-vitest.cjs","names":[],"sources":["../../src/vite/tempest-vitest.ts"],"sourcesContent":["import type { TempestVitePlugin } from \"./tempest-pwa-manifest\";\n\n/**\n * The `server.deps.inline` entry that makes Vitest transform the SDK instead of\n * handing it to Node.\n *\n * Vitest matches a string entry as `/node_modules/tempest-react-sdk` anywhere in\n * the module id, which covers npm, Yarn and pnpm's\n * `.pnpm/<name>@<version>/node_modules/` layout alike, without catching an app\n * that merely lives in a folder of the same name — which a bare regex would.\n */\nconst TEMPEST_VITEST_INLINE = \"tempest-react-sdk\";\n\n/** The slice of a user config this plugin reads to stay out of the way. */\ninterface VitestUserConfig {\n    test?: { server?: { deps?: { inline?: unknown } } };\n}\n\n/**\n * Make Vitest load the SDK the way the app's bundler does.\n *\n * Every component module imports its own stylesheet. Vitest externalizes an ESM\n * package from `node_modules` to plain Node, and Node has no loader for `.css`, so\n * any test that imports the real barrel dies before running with\n * `TypeError: Unknown file extension \".css\"`. Inlining the package sends it through\n * Vite's pipeline, where the stylesheet import is processed like in the app.\n *\n * Measured with `tempest-react-sdk@0.70.0` and a one-line test importing `Button`:\n * Vitest 2.1.9, 3.2.7 and 4.1.11 all fail under the default config and pass with\n * this plugin.\n *\n * The entry is contributed through the `config` hook, so Vite concatenates it onto\n * whatever `test.server.deps.inline` list the app declares. The one value it must\n * not merge into is `true` (inline everything): Vite's merge would turn it into\n * `[true, \"tempest-react-sdk\"]`, and Vitest 4 then crashes with\n * `ex.test is not a function` matching ids against it. That config already inlines\n * the SDK, so the plugin contributes nothing.\n *\n * Outside Vitest the `test` key is ignored by Vite, so the plugin is inert in\n * `vite dev` and `vite build` — which is why `createViteConfig` always includes it.\n *\n * @returns A Vite plugin; add it to `plugins` in `vite.config.ts` or\n *   `vitest.config.ts`.\n *\n * @example\n * // vitest.config.ts\n * import { defineConfig } from \"vitest/config\";\n * import { tempestVitest } from \"tempest-react-sdk/vite\";\n *\n * export default defineConfig({\n *     plugins: [tempestVitest()],\n *     test: { environment: \"jsdom\" },\n * });\n */\nexport function tempestVitest(): TempestVitePlugin {\n    return {\n        name: \"tempest-vitest\",\n        config(userConfig: VitestUserConfig): VitestUserConfig | undefined {\n            if (userConfig.test?.server?.deps?.inline === true) return undefined;\n            return { test: { server: { deps: { inline: [TEMPEST_VITEST_INLINE] } } } };\n        },\n    };\n}\n"],"mappings":"AAsDA,SAAgB,GAAmC,CAC/C,MAAO,CACH,KAAM,iBACN,OAAO,EAA4D,CAC3D,KAAW,MAAM,QAAQ,MAAM,SAAW,GAC9C,MAAO,CAAE,KAAM,CAAE,OAAQ,CAAE,KAAM,CAAE,OAAQ,CAAC,mBAAqB,CAAE,CAAE,CAAE,CAAE,CAC7E,CACJ,CACJ"}
+{"version":3,"file":"tempest-vitest.cjs","names":["tempestVitest","userConfig"],"sources":["../../src/vite/tempest-vitest.ts"],"sourcesContent":["import type { TempestVitePlugin } from \"./tempest-pwa-manifest\";\n\n/**\n * The `server.deps.inline` entry that makes Vitest transform the SDK instead of\n * handing it to Node.\n *\n * Vitest matches a string entry as `/node_modules/tempest-react-sdk` anywhere in\n * the module id, which covers npm, Yarn and pnpm's\n * `.pnpm/<name>@<version>/node_modules/` layout alike, without catching an app\n * that merely lives in a folder of the same name — which a bare regex would.\n */\nconst TEMPEST_VITEST_INLINE = \"tempest-react-sdk\";\n\n/** The slice of a user config this plugin reads to stay out of the way. */\ninterface VitestUserConfig {\n    test?: { server?: { deps?: { inline?: unknown } } };\n}\n\n/**\n * Make Vitest load the SDK the way the app's bundler does.\n *\n * Every component module imports its own stylesheet. Vitest externalizes an ESM\n * package from `node_modules` to plain Node, and Node has no loader for `.css`, so\n * any test that imports the real barrel dies before running with\n * `TypeError: Unknown file extension \".css\"`. Inlining the package sends it through\n * Vite's pipeline, where the stylesheet import is processed like in the app.\n *\n * Measured with `tempest-react-sdk@0.70.0` and a one-line test importing `Button`:\n * Vitest 2.1.9, 3.2.7 and 4.1.11 all fail under the default config and pass with\n * this plugin.\n *\n * The entry is contributed through the `config` hook, so Vite concatenates it onto\n * whatever `test.server.deps.inline` list the app declares. The one value it must\n * not merge into is `true` (inline everything): Vite's merge would turn it into\n * `[true, \"tempest-react-sdk\"]`, and Vitest 4 then crashes with\n * `ex.test is not a function` matching ids against it. That config already inlines\n * the SDK, so the plugin contributes nothing.\n *\n * Outside Vitest the `test` key is ignored by Vite, so the plugin is inert in\n * `vite dev` and `vite build` — which is why `createViteConfig` always includes it.\n *\n * @returns A Vite plugin; add it to `plugins` in `vite.config.ts` or\n *   `vitest.config.ts`.\n *\n * @example\n * // vitest.config.ts\n * import { defineConfig } from \"vitest/config\";\n * import { tempestVitest } from \"tempest-react-sdk/vite\";\n *\n * export default defineConfig({\n *     plugins: [tempestVitest()],\n *     test: { environment: \"jsdom\" },\n * });\n */\nexport function tempestVitest(): TempestVitePlugin {\n    return {\n        name: \"tempest-vitest\",\n        config(userConfig: VitestUserConfig): VitestUserConfig | undefined {\n            if (userConfig.test?.server?.deps?.inline === true) return undefined;\n            return { test: { server: { deps: { inline: [TEMPEST_VITEST_INLINE] } } } };\n        },\n    };\n}\n"],"mappings":"AAsDA,SAAgBA,GAAmC,CAC/C,MAAO,CACH,KAAM,iBACN,OAAO,EAA4D,CAC/D,GAAIC,EAAW,MAAM,QAAQ,MAAM,SAAW,GAC9C,MAAO,CAAE,KAAM,CAAE,OAAQ,CAAE,KAAM,CAAE,OAAQ,CAAC,mBAAqB,CAAE,CAAE,CAAE,CAAE,CAC7E,CACJ,CACJ,C"}

package/dist/vite/tempest-vitest.js.map

@@ -1 +1 @@
-{"version":3,"file":"tempest-vitest.js","names":[],"sources":["../../src/vite/tempest-vitest.ts"],"sourcesContent":["import type { TempestVitePlugin } from \"./tempest-pwa-manifest\";\n\n/**\n * The `server.deps.inline` entry that makes Vitest transform the SDK instead of\n * handing it to Node.\n *\n * Vitest matches a string entry as `/node_modules/tempest-react-sdk` anywhere in\n * the module id, which covers npm, Yarn and pnpm's\n * `.pnpm/<name>@<version>/node_modules/` layout alike, without catching an app\n * that merely lives in a folder of the same name — which a bare regex would.\n */\nconst TEMPEST_VITEST_INLINE = \"tempest-react-sdk\";\n\n/** The slice of a user config this plugin reads to stay out of the way. */\ninterface VitestUserConfig {\n    test?: { server?: { deps?: { inline?: unknown } } };\n}\n\n/**\n * Make Vitest load the SDK the way the app's bundler does.\n *\n * Every component module imports its own stylesheet. Vitest externalizes an ESM\n * package from `node_modules` to plain Node, and Node has no loader for `.css`, so\n * any test that imports the real barrel dies before running with\n * `TypeError: Unknown file extension \".css\"`. Inlining the package sends it through\n * Vite's pipeline, where the stylesheet import is processed like in the app.\n *\n * Measured with `tempest-react-sdk@0.70.0` and a one-line test importing `Button`:\n * Vitest 2.1.9, 3.2.7 and 4.1.11 all fail under the default config and pass with\n * this plugin.\n *\n * The entry is contributed through the `config` hook, so Vite concatenates it onto\n * whatever `test.server.deps.inline` list the app declares. The one value it must\n * not merge into is `true` (inline everything): Vite's merge would turn it into\n * `[true, \"tempest-react-sdk\"]`, and Vitest 4 then crashes with\n * `ex.test is not a function` matching ids against it. That config already inlines\n * the SDK, so the plugin contributes nothing.\n *\n * Outside Vitest the `test` key is ignored by Vite, so the plugin is inert in\n * `vite dev` and `vite build` — which is why `createViteConfig` always includes it.\n *\n * @returns A Vite plugin; add it to `plugins` in `vite.config.ts` or\n *   `vitest.config.ts`.\n *\n * @example\n * // vitest.config.ts\n * import { defineConfig } from \"vitest/config\";\n * import { tempestVitest } from \"tempest-react-sdk/vite\";\n *\n * export default defineConfig({\n *     plugins: [tempestVitest()],\n *     test: { environment: \"jsdom\" },\n * });\n */\nexport function tempestVitest(): TempestVitePlugin {\n    return {\n        name: \"tempest-vitest\",\n        config(userConfig: VitestUserConfig): VitestUserConfig | undefined {\n            if (userConfig.test?.server?.deps?.inline === true) return undefined;\n            return { test: { server: { deps: { inline: [TEMPEST_VITEST_INLINE] } } } };\n        },\n    };\n}\n"],"mappings":"AAsDA,SAAgB,IAAmC;CAC/C,OAAO;EACH,MAAM;EACN,OAAO,GAA4D;GAC3D,MAAW,MAAM,QAAQ,MAAM,WAAW,IAC9C,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,mBAAqB,EAAE,EAAE,EAAE,EAAE;EAC7E;CACJ;AACJ"}
+{"version":3,"file":"tempest-vitest.js","names":["tempestVitest","userConfig"],"sources":["../../src/vite/tempest-vitest.ts"],"sourcesContent":["import type { TempestVitePlugin } from \"./tempest-pwa-manifest\";\n\n/**\n * The `server.deps.inline` entry that makes Vitest transform the SDK instead of\n * handing it to Node.\n *\n * Vitest matches a string entry as `/node_modules/tempest-react-sdk` anywhere in\n * the module id, which covers npm, Yarn and pnpm's\n * `.pnpm/<name>@<version>/node_modules/` layout alike, without catching an app\n * that merely lives in a folder of the same name — which a bare regex would.\n */\nconst TEMPEST_VITEST_INLINE = \"tempest-react-sdk\";\n\n/** The slice of a user config this plugin reads to stay out of the way. */\ninterface VitestUserConfig {\n    test?: { server?: { deps?: { inline?: unknown } } };\n}\n\n/**\n * Make Vitest load the SDK the way the app's bundler does.\n *\n * Every component module imports its own stylesheet. Vitest externalizes an ESM\n * package from `node_modules` to plain Node, and Node has no loader for `.css`, so\n * any test that imports the real barrel dies before running with\n * `TypeError: Unknown file extension \".css\"`. Inlining the package sends it through\n * Vite's pipeline, where the stylesheet import is processed like in the app.\n *\n * Measured with `tempest-react-sdk@0.70.0` and a one-line test importing `Button`:\n * Vitest 2.1.9, 3.2.7 and 4.1.11 all fail under the default config and pass with\n * this plugin.\n *\n * The entry is contributed through the `config` hook, so Vite concatenates it onto\n * whatever `test.server.deps.inline` list the app declares. The one value it must\n * not merge into is `true` (inline everything): Vite's merge would turn it into\n * `[true, \"tempest-react-sdk\"]`, and Vitest 4 then crashes with\n * `ex.test is not a function` matching ids against it. That config already inlines\n * the SDK, so the plugin contributes nothing.\n *\n * Outside Vitest the `test` key is ignored by Vite, so the plugin is inert in\n * `vite dev` and `vite build` — which is why `createViteConfig` always includes it.\n *\n * @returns A Vite plugin; add it to `plugins` in `vite.config.ts` or\n *   `vitest.config.ts`.\n *\n * @example\n * // vitest.config.ts\n * import { defineConfig } from \"vitest/config\";\n * import { tempestVitest } from \"tempest-react-sdk/vite\";\n *\n * export default defineConfig({\n *     plugins: [tempestVitest()],\n *     test: { environment: \"jsdom\" },\n * });\n */\nexport function tempestVitest(): TempestVitePlugin {\n    return {\n        name: \"tempest-vitest\",\n        config(userConfig: VitestUserConfig): VitestUserConfig | undefined {\n            if (userConfig.test?.server?.deps?.inline === true) return undefined;\n            return { test: { server: { deps: { inline: [TEMPEST_VITEST_INLINE] } } } };\n        },\n    };\n}\n"],"mappings":"AAsDA,SAAgBA,IAAmC;CAC/C,OAAO;EACH,MAAM;EACN,OAAO,GAA4D;GAC/D,IAAIC,EAAW,MAAM,QAAQ,MAAM,WAAW,IAC9C,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,mBAAqB,EAAE,EAAE,EAAE,EAAE;EAC7E;CACJ;AACJ"}

package/dist/vite.d.ts

@@ -117,9 +117,11 @@ export declare interface StyleManifest {
  * merge never loosens what the app wrote:
  *
  * - a directive it declares is kept verbatim, except `connect-src`, which gains
- *   the resolved origins (the list the plugin exists to maintain) unless it is
- *   `'none'` — declared or inherited from `default-src` — in which case the
- *   origins stay out and each one is reported as a build warning. Sources in
+ *   the resolved origins (the list the plugin exists to maintain) unless it
+ *   matches nothing — `'none'` in any letter case, or an empty list, declared or
+ *   inherited from `default-src` — in which case the origins stay out and each
+ *   one is reported as a build warning. Keywords are compared case-insensitively
+ *   throughout, as browsers do. Sources in
  *   {@link TempestCspOptions.directives} for a declared directive are not added
  *   (a build warning names them); `false` there removes it;
  * - a fetch directive it does not declare but already governs through the CSP3

package/dist/webrtc/link-stats.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"link-stats.cjs","names":[],"sources":["../../src/webrtc/link-stats.ts"],"sourcesContent":["/**\n * One link's outbound picture, in the shape a call UI actually renders.\n *\n * Everything here is derived, not reported: WebRTC hands out cumulative\n * counters and a graph of candidate pairs, and turning that into\n * `\"1,2 Mbps · 42 ms · 1080p60\"` is the work {@link createLinkStatsSampler}\n * does.\n */\nexport interface LinkStats {\n    /** Throughput since the previous sample. `0` on the first one — there is no delta yet. */\n    kbps: number;\n    /** Width of the largest stream being sent, or `0` before one is reported. */\n    width: number;\n    /** Height of the largest stream being sent, or `0` before one is reported. */\n    height: number;\n    /** Frame rate of the largest stream being sent, or `0` when the browser omits it. */\n    fps: number;\n    /** Round trip to the peer in milliseconds, or `null` before the first reading. */\n    rttMs: number | null;\n    /**\n     * Uplink the transport estimates for this path, in kbps, or `null`.\n     *\n     * `null` and not `0`, because the two mean opposite things: no estimate yet\n     * is the normal state for the first seconds of every call and the permanent\n     * state on an engine that publishes none, while `0` is indistinguishable\n     * from a path that died. A consumer that reads absence as zero drops the\n     * quality at the start of every call.\n     *\n     * This is the field that separates \"healthy at 2.5 Mbps\" from \"capped at\n     * 2.5 Mbps and drowning\" — `kbps` reports the cap being honoured either\n     * way, while the queue behind it grows.\n     */\n    availableKbps: number | null;\n    /**\n     * What the encoder says is holding the picture back, or `null` for nothing.\n     *\n     * `\"bandwidth\"` wins over the other values when senders disagree, because\n     * it is the only one a lower cap answers. Reacting to bandwidth on a\n     * machine that is actually CPU-bound buys a worse picture and no relief.\n     *\n     * The spec's `\"none\"` is reported as `null`: a consumer should not have to\n     * know that one of the truthy strings means \"nothing\".\n     */\n    limitedBy: RTCQualityLimitationReason | null;\n    /**\n     * Whether the link is travelling through a TURN relay.\n     *\n     * On a self-hosted mesh this is the hosting bill: a relayed stream goes up\n     * and down through the machine somebody is paying for, and the person who\n     * picked 4K is not that somebody.\n     *\n     * Resolved only from the pair the transport **names**, never from a merely\n     * `succeeded` one — guessing the route from a pair that carries nothing\n     * would report a cost nobody is paying.\n     */\n    relayed: boolean;\n}\n\n/** Which media a sampler counts. */\nexport type LinkStatsKind = \"video\" | \"audio\" | \"all\";\n\n/** Options for {@link createLinkStatsSampler}. */\nexport interface LinkStatsSamplerOptions {\n    /**\n     * Which media the throughput counts. Default `\"video\"`.\n     *\n     * Video is the default because it is what saturates an uplink — audio is an\n     * order of magnitude cheaper, and mixing it in moves the number by less than\n     * the noise between two samples. Use `\"all\"` when the figure is meant to be\n     * the connection's real cost rather than the picture's.\n     */\n    kind?: LinkStatsKind;\n}\n\n/**\n * A sampler bound to one connection.\n *\n * Holds the previous byte counter and timestamp, which is the whole reason this\n * is an object rather than a function: the rate is a delta, so somebody has to\n * remember the last reading. One sampler per link — sharing one across peers\n * subtracts one connection's counter from another's and reports nonsense.\n */\nexport interface LinkStatsSampler {\n    /**\n     * Reduce a report you already have.\n     *\n     * @param report - A report from `RTCPeerConnection.getStats()`.\n     * @returns The stats for this sample.\n     */\n    read: (report: RTCStatsReport) => LinkStats;\n    /**\n     * Fetch a report and reduce it.\n     *\n     * @param connection - The connection to sample.\n     * @returns The stats for this sample.\n     */\n    sample: (connection: RTCPeerConnection) => Promise<LinkStats>;\n    /**\n     * Drop the baseline the rate is derived from.\n     *\n     * Call it after an ICE restart, a reconnect, or a pause — otherwise the next\n     * sample divides the bytes of the whole gap by the whole gap and reports the\n     * average of a period nobody is asking about. The next reading comes back at\n     * `0` kbps and starts a fresh baseline; the resolution and round trip already\n     * on screen are kept, so the badge does not blank out.\n     */\n    reset: () => void;\n}\n\n/**\n * The three field readers below take an entry the collector has already\n * established is an object.\n *\n * A report is a `Map` whose values the browser fills, and nothing says they\n * have to be objects — a polyfill or a mock can put anything in there. That\n * check belongs at the door of the one loop that walks the report, not repeated\n * in each reader: three copies of the same guard means three branches no test\n * can reach past the first, and a reader that silently returns `null` for a\n * primitive hides the case instead of skipping it.\n */\ntype StatsEntry = Record<string, unknown>;\n\nfunction numberField(entry: StatsEntry, key: string): number | null {\n    const value: unknown = entry[key];\n    return typeof value === \"number\" && Number.isFinite(value) ? value : null;\n}\n\nfunction stringField(entry: StatsEntry, key: string): string | null {\n    const value: unknown = entry[key];\n    return typeof value === \"string\" ? value : null;\n}\n\nfunction booleanField(entry: StatsEntry, key: string): boolean | null {\n    const value: unknown = entry[key];\n    return typeof value === \"boolean\" ? value : null;\n}\n\n/**\n * Whether a string is one of the reasons the spec defines.\n *\n * `\"none\"` is deliberately not one of them here: the field it feeds reports\n * \"nothing is limiting\" as `null`, so a consumer never has to know that one of\n * the truthy strings means no.\n */\nfunction isLimitationReason(value: string | null): value is RTCQualityLimitationReason {\n    return value === \"bandwidth\" || value === \"cpu\" || value === \"other\";\n}\n\n/**\n * Resolve the media an RTP entry carries.\n *\n * `kind` is the standard field and `mediaType` is what older Chrome reported;\n * both are still in the wild, and a sampler that reads only one of them\n * silently counts nothing on the browser that uses the other.\n */\nfunction entryKind(entry: StatsEntry): string | null {\n    return stringField(entry, \"kind\") ?? stringField(entry, \"mediaType\");\n}\n\n/** What one candidate pair says about the path it describes. */\ninterface PairFacts {\n    id: string;\n    /** `true` when the browser marks this pair as the chosen one non-standardly. */\n    selected: boolean;\n    state: string | null;\n    rttMs: number | null;\n    availableKbps: number | null;\n    localCandidateId: string | null;\n}\n\n/** What one sender says about what it is sending. */\ninterface SenderFacts {\n    kind: string | null;\n    bytes: number;\n    width: number;\n    height: number;\n    fps: number;\n    limitedBy: RTCQualityLimitationReason | null;\n}\n\n/** Everything a single walk over a report yields. */\ninterface CollectedReport {\n    namedPairId: string | null;\n    pairs: PairFacts[];\n    relayCandidateIds: Set<string>;\n    senders: SenderFacts[];\n}\n\n/**\n * Reduce a report in **one** pass.\n *\n * One pass is the point rather than tidiness. Every field below lives in the\n * same report, and the pair the transport selected has to be resolved before\n * any of the path fields can be read — so a consumer that asks for round trip,\n * then throughput headroom, then whether the route is relayed, walks the same\n * report three times and resolves the same pair three times, per link, on every\n * tick. On a mesh of eight at one sample every two seconds that is the most\n * expensive recurring work in the call, on the device least able to pay it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The entries that matter, grouped.\n */\nfunction collect(report: RTCStatsReport): CollectedReport {\n    let namedPairId: string | null = null;\n    const pairs: PairFacts[] = [];\n    const relayCandidateIds = new Set<string>();\n    const senders: SenderFacts[] = [];\n\n    report.forEach((raw: unknown) => {\n        if (typeof raw !== \"object\" || raw === null) return;\n        const entry = raw as StatsEntry;\n        const type = stringField(entry, \"type\");\n        if (type === \"transport\") {\n            namedPairId = stringField(entry, \"selectedCandidatePairId\") ?? namedPairId;\n            return;\n        }\n        if (type === \"candidate-pair\") {\n            const seconds = numberField(entry, \"currentRoundTripTime\");\n            const bps = numberField(entry, \"availableOutgoingBitrate\");\n            pairs.push({\n                id: stringField(entry, \"id\") ?? \"\",\n                selected: booleanField(entry, \"selected\") === true,\n                state: stringField(entry, \"state\"),\n                rttMs: seconds === null ? null : seconds * 1000,\n                availableKbps: bps === null ? null : Math.round(bps / 1000),\n                localCandidateId: stringField(entry, \"localCandidateId\"),\n            });\n            return;\n        }\n        if (type === \"local-candidate\") {\n            const id = stringField(entry, \"id\");\n            if (id !== null && stringField(entry, \"candidateType\") === \"relay\") {\n                relayCandidateIds.add(id);\n            }\n            return;\n        }\n        if (type !== \"outbound-rtp\") return;\n        const reason = stringField(entry, \"qualityLimitationReason\");\n        senders.push({\n            kind: entryKind(entry),\n            bytes: numberField(entry, \"bytesSent\") ?? 0,\n            width: numberField(entry, \"frameWidth\") ?? 0,\n            height: numberField(entry, \"frameHeight\") ?? 0,\n            fps: Math.round(numberField(entry, \"framesPerSecond\") ?? 0),\n            limitedBy: isLimitationReason(reason) ? reason : null,\n        });\n    });\n\n    return { namedPairId, pairs, relayCandidateIds, senders };\n}\n\n/**\n * The candidate pair carrying the link, and how sure we are that it is.\n *\n * A connection routinely keeps several viable pairs alive at once — host,\n * server-reflexive, relayed — and only one of them carries traffic. Reading the\n * first `succeeded` pair makes a reading jump between paths that are not being\n * travelled: 8 ms on an idle host pair alternating with 180 ms on the TURN pair\n * doing the work.\n *\n * The chain is `transport.selectedCandidatePairId` → a pair flagged\n * `selected: true` → the first `succeeded` one. The middle step is not in the\n * spec and is there because an engine that fills neither the transport field\n * nor it does not appear to exist, while one that fills only the flag does: a\n * reader that skips straight to `succeeded` silently answers about the wrong\n * path there. The last step is a guess, and `named` says so — the fields where\n * guessing would report something false refuse it.\n *\n * @param collected - A collected report.\n * @returns The pair and whether the browser actually named it.\n */\nfunction carryingPair(collected: CollectedReport): { pair: PairFacts | null; named: boolean } {\n    const byId =\n        collected.namedPairId === null\n            ? undefined\n            : collected.pairs.find((pair) => pair.id === collected.namedPairId);\n    if (byId !== undefined) return { pair: byId, named: true };\n\n    const flagged = collected.pairs.find((pair) => pair.selected);\n    if (flagged !== undefined) return { pair: flagged, named: true };\n\n    const succeeded = collected.pairs.find((pair) => pair.state === \"succeeded\");\n    return { pair: succeeded ?? null, named: false };\n}\n\n/**\n * Read the round trip of the candidate pair actually carrying the link.\n *\n * A `succeeded` pair is kept as a last resort because not every browser names\n * the selected one — losing the reading entirely is worse than an occasionally\n * optimistic one. See {@link carryingPair} for the chain and why the middle\n * step exists.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns Round trip in milliseconds, rounded, or `null` when nothing reported\n *   one — which is the normal state before the connection settles.\n *\n * @example\n * const rttMs = readRoundTripMs(await pc.getStats());\n */\nexport function readRoundTripMs(report: RTCStatsReport): number | null {\n    return roundTripOf(collect(report));\n}\n\n/**\n * Read the uplink the transport estimates for this path, in kbps.\n *\n * This is the field that tells a cap being honoured apart from a cap that is\n * drowning: `bytesSent` reports the same 2500 kbps whether the path has room\n * for it or the queue behind it is growing. No fixed budget can stand in for it\n * — a domestic uplink of 1 Mbps and a fibre link differ by an order of\n * magnitude, and in Brazil the upload routinely is a tenth of the download\n * beside it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The estimate in kbps, or `null` while there is none. Every reader\n *   needs a fallback for that, not a default of zero.\n *\n * @example\n * const headroom = readAvailableOutgoingKbps(await pc.getStats());\n * if (headroom !== null && headroom < asked) lowerTheCap(headroom);\n */\nexport function readAvailableOutgoingKbps(report: RTCStatsReport): number | null {\n    return availableOf(collect(report));\n}\n\n/**\n * Read what the encoder says is holding the picture back.\n *\n * `\"bandwidth\"` wins when senders disagree, because it is the only reason a\n * lower cap answers. The spec's `\"none\"` comes back as `null`.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The reason, or `null` when nothing is limiting the picture.\n *\n * @example\n * if (readQualityLimitation(await pc.getStats()) === \"cpu\") stopBlurringTheBackground();\n */\nexport function readQualityLimitation(report: RTCStatsReport): RTCQualityLimitationReason | null {\n    return limitationOf(collect(report));\n}\n\n/**\n * Read whether the link is travelling through a TURN relay.\n *\n * Resolved only from the pair the browser names, never from a merely\n * `succeeded` one: a relayed route is somebody's hosting bill, and reporting\n * one from a pair that carries nothing bills a cost nobody is paying.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns `true` when the carrying pair's local candidate is a relay.\n *\n * @example\n * if (readRelayed(await pc.getStats())) capTheStreamThatCostsMoney();\n */\nexport function readRelayed(report: RTCStatsReport): boolean {\n    return relayedOf(collect(report));\n}\n\n/** Round trip of the carrying pair, in whole milliseconds. */\nfunction roundTripOf(collected: CollectedReport): number | null {\n    const withTiming: CollectedReport = {\n        ...collected,\n        pairs: collected.pairs.filter((pair) => pair.rttMs !== null),\n    };\n    const { pair } = carryingPair(withTiming);\n    return pair?.rttMs === undefined || pair.rttMs === null ? null : Math.round(pair.rttMs);\n}\n\n/** Estimated uplink of the carrying pair, in kbps. */\nfunction availableOf(collected: CollectedReport): number | null {\n    const { pair } = carryingPair(collected);\n    return pair?.availableKbps ?? null;\n}\n\n/** Whether the pair the browser named travels through a relay. */\nfunction relayedOf(collected: CollectedReport): boolean {\n    const { pair, named } = carryingPair(collected);\n    if (!named || pair === null || pair.localCandidateId === null) return false;\n    return collected.relayCandidateIds.has(pair.localCandidateId);\n}\n\n/** The strongest limitation any sender reports, with bandwidth winning. */\nfunction limitationOf(collected: CollectedReport): RTCQualityLimitationReason | null {\n    let found: RTCQualityLimitationReason | null = null;\n    for (const sender of collected.senders) {\n        if (sender.limitedBy === null) continue;\n        if (sender.limitedBy === \"bandwidth\") return \"bandwidth\";\n        found = found ?? sender.limitedBy;\n    }\n    return found;\n}\n\n/**\n * Track one link's throughput, resolution and round trip across samples.\n *\n * Every rate here is a **delta**. `bytesSent` is cumulative since the connection\n * opened, so dividing it by the session length gives the historical average —\n * a number that only ever falls and never shows what is happening now. The\n * previous reading is kept on the sampler and subtracted, which is the part\n * every hand-rolled copy of this ends up rewriting.\n *\n * Bytes are summed across every matching sender, because a peer publishing a\n * camera and a screen at once occupies one uplink with both — and the uplink is\n * what runs out. Resolution and frame rate come from the **largest** stream by\n * area, which is the one that dominates that bandwidth and the one somebody\n * watching the call is looking at.\n *\n * @param options - See {@link LinkStatsSamplerOptions}.\n * @returns A sampler. Use one per `RTCPeerConnection`.\n *\n * @example\n * const sampler = createLinkStatsSampler();\n *\n * setInterval(async () => {\n *   const stats = await sampler.sample(pc);\n *   badge.textContent = `${stats.kbps} kbps · ${stats.rttMs ?? \"—\"} ms`;\n * }, 2000);\n */\nexport function createLinkStatsSampler(options: LinkStatsSamplerOptions = {}): LinkStatsSampler {\n    const kind: LinkStatsKind = options.kind ?? \"video\";\n    let lastBytes: number | null = null;\n    let lastSampleAt = 0;\n    let last: LinkStats = {\n        kbps: 0,\n        width: 0,\n        height: 0,\n        fps: 0,\n        rttMs: null,\n        availableKbps: null,\n        limitedBy: null,\n        relayed: false,\n    };\n\n    function read(report: RTCStatsReport): LinkStats {\n        const now = performance.now();\n        const collected = collect(report);\n        const path = {\n            rttMs: roundTripOf(collected),\n            availableKbps: availableOf(collected),\n            limitedBy: limitationOf(collected),\n            relayed: relayedOf(collected),\n        };\n\n        let bytes = 0;\n        let sawSender = false;\n        let bestArea = 0;\n        let width = 0;\n        let height = 0;\n        let fps = 0;\n\n        for (const sender of collected.senders) {\n            if (kind !== \"all\" && sender.kind !== kind) continue;\n            sawSender = true;\n            bytes += sender.bytes;\n\n            const area = sender.width * sender.height;\n            if (area < bestArea) continue;\n            bestArea = area;\n            width = sender.width;\n            height = sender.height;\n            fps = sender.fps;\n        }\n\n        if (!sawSender) {\n            last = { ...last, ...path };\n            return last;\n        }\n\n        const elapsed = lastBytes === null ? 0 : (now - lastSampleAt) / 1000;\n        const delta = lastBytes === null ? 0 : bytes - lastBytes;\n        const kbps = elapsed > 0 && delta > 0 ? Math.round((delta * 8) / 1000 / elapsed) : 0;\n\n        lastBytes = bytes;\n        lastSampleAt = now;\n        last = {\n            kbps,\n            width: width > 0 ? width : last.width,\n            height: height > 0 ? height : last.height,\n            fps: fps > 0 ? fps : last.fps,\n            ...path,\n        };\n        return last;\n    }\n\n    return {\n        read,\n        sample: async (connection: RTCPeerConnection): Promise<LinkStats> =>\n            read(await connection.getStats()),\n        reset: (): void => {\n            lastBytes = null;\n            lastSampleAt = 0;\n            last = { ...last, kbps: 0 };\n        },\n    };\n}\n"],"mappings":"AA0HA,SAAS,EAAY,EAAmB,EAA4B,CAChE,IAAM,EAAiB,EAAM,GAC7B,OAAO,OAAO,GAAU,UAAY,OAAO,SAAS,CAAK,EAAI,EAAQ,IACzE,CAEA,SAAS,EAAY,EAAmB,EAA4B,CAChE,IAAM,EAAiB,EAAM,GAC7B,OAAO,OAAO,GAAU,SAAW,EAAQ,IAC/C,CAEA,SAAS,EAAa,EAAmB,EAA6B,CAClE,IAAM,EAAiB,EAAM,GAC7B,OAAO,OAAO,GAAU,UAAY,EAAQ,IAChD,CASA,SAAS,EAAmB,EAA2D,CACnF,OAAO,IAAU,aAAe,IAAU,OAAS,IAAU,OACjE,CASA,SAAS,EAAU,EAAkC,CACjD,OAAO,EAAY,EAAO,MAAM,GAAK,EAAY,EAAO,WAAW,CACvE,CA6CA,SAAS,EAAQ,EAAyC,CACtD,IAAI,EAA6B,KAC3B,EAAqB,CAAC,EACtB,EAAoB,IAAI,IACxB,EAAyB,CAAC,EA0ChC,OAxCA,EAAO,QAAS,GAAiB,CAC7B,GAAI,OAAO,GAAQ,WAAY,EAAc,OAC7C,IAAM,EAAQ,EACR,EAAO,EAAY,EAAO,MAAM,EACtC,GAAI,IAAS,YAAa,CACtB,EAAc,EAAY,EAAO,yBAAyB,GAAK,EAC/D,MACJ,CACA,GAAI,IAAS,iBAAkB,CAC3B,IAAM,EAAU,EAAY,EAAO,sBAAsB,EACnD,EAAM,EAAY,EAAO,0BAA0B,EACzD,EAAM,KAAK,CACP,GAAI,EAAY,EAAO,IAAI,GAAK,GAChC,SAAU,EAAa,EAAO,UAAU,IAAM,GAC9C,MAAO,EAAY,EAAO,OAAO,EACjC,MAAO,IAAY,KAAO,KAAO,EAAU,IAC3C,cAAe,IAAQ,KAAO,KAAO,KAAK,MAAM,EAAM,GAAI,EAC1D,iBAAkB,EAAY,EAAO,kBAAkB,CAC3D,CAAC,EACD,MACJ,CACA,GAAI,IAAS,kBAAmB,CAC5B,IAAM,EAAK,EAAY,EAAO,IAAI,EAC9B,IAAO,MAAQ,EAAY,EAAO,eAAe,IAAM,SACvD,EAAkB,IAAI,CAAE,EAE5B,MACJ,CACA,GAAI,IAAS,eAAgB,OAC7B,IAAM,EAAS,EAAY,EAAO,yBAAyB,EAC3D,EAAQ,KAAK,CACT,KAAM,EAAU,CAAK,EACrB,MAAO,EAAY,EAAO,WAAW,GAAK,EAC1C,MAAO,EAAY,EAAO,YAAY,GAAK,EAC3C,OAAQ,EAAY,EAAO,aAAa,GAAK,EAC7C,IAAK,KAAK,MAAM,EAAY,EAAO,iBAAiB,GAAK,CAAC,EAC1D,UAAW,EAAmB,CAAM,EAAI,EAAS,IACrD,CAAC,CACL,CAAC,EAEM,CAAE,cAAa,QAAO,oBAAmB,SAAQ,CAC5D,CAsBA,SAAS,EAAa,EAAwE,CAC1F,IAAM,EACF,EAAU,cAAgB,KACpB,IAAA,GACA,EAAU,MAAM,KAAM,GAAS,EAAK,KAAO,EAAU,WAAW,EAC1E,GAAI,IAAS,IAAA,GAAW,MAAO,CAAE,KAAM,EAAM,MAAO,EAAK,EAEzD,IAAM,EAAU,EAAU,MAAM,KAAM,GAAS,EAAK,QAAQ,EAI5D,OAHI,IAAY,IAAA,GAGT,CAAE,KADS,EAAU,MAAM,KAAM,GAAS,EAAK,QAAU,WACjD,GAAa,KAAM,MAAO,EAAM,EAHb,CAAE,KAAM,EAAS,MAAO,EAAK,CAInE,CAiBA,SAAgB,EAAgB,EAAuC,CACnE,OAAO,EAAY,EAAQ,CAAM,CAAC,CACtC,CAoBA,SAAgB,EAA0B,EAAuC,CAC7E,OAAO,EAAY,EAAQ,CAAM,CAAC,CACtC,CAcA,SAAgB,EAAsB,EAA2D,CAC7F,OAAO,EAAa,EAAQ,CAAM,CAAC,CACvC,CAeA,SAAgB,EAAY,EAAiC,CACzD,OAAO,EAAU,EAAQ,CAAM,CAAC,CACpC,CAGA,SAAS,EAAY,EAA2C,CAK5D,GAAM,CAAE,QAAS,EAAa,CAH1B,GAAG,EACH,MAAO,EAAU,MAAM,OAAQ,GAAS,EAAK,QAAU,IAAI,CAEjC,CAAU,EACxC,OAAO,GAAM,QAAU,IAAA,IAAa,EAAK,QAAU,KAAO,KAAO,KAAK,MAAM,EAAK,KAAK,CAC1F,CAGA,SAAS,EAAY,EAA2C,CAC5D,GAAM,CAAE,QAAS,EAAa,CAAS,EACvC,OAAO,GAAM,eAAiB,IAClC,CAGA,SAAS,EAAU,EAAqC,CACpD,GAAM,CAAE,OAAM,SAAU,EAAa,CAAS,EAE9C,MADI,CAAC,GAAS,IAAS,MAAQ,EAAK,mBAAqB,KAAa,GAC/D,EAAU,kBAAkB,IAAI,EAAK,gBAAgB,CAChE,CAGA,SAAS,EAAa,EAA+D,CACjF,IAAI,EAA2C,KAC/C,IAAK,IAAM,KAAU,EAAU,QACvB,KAAO,YAAc,KACzB,IAAI,EAAO,YAAc,YAAa,MAAO,YAC7C,IAAiB,EAAO,SADqB,CAGjD,OAAO,CACX,CA4BA,SAAgB,EAAuB,EAAmC,CAAC,EAAqB,CAC5F,IAAM,EAAsB,EAAQ,MAAQ,QACxC,EAA2B,KAC3B,EAAe,EACf,EAAkB,CAClB,KAAM,EACN,MAAO,EACP,OAAQ,EACR,IAAK,EACL,MAAO,KACP,cAAe,KACf,UAAW,KACX,QAAS,EACb,EAEA,SAAS,EAAK,EAAmC,CAC7C,IAAM,EAAM,YAAY,IAAI,EACtB,EAAY,EAAQ,CAAM,EAC1B,EAAO,CACT,MAAO,EAAY,CAAS,EAC5B,cAAe,EAAY,CAAS,EACpC,UAAW,EAAa,CAAS,EACjC,QAAS,EAAU,CAAS,CAChC,EAEI,EAAQ,EACR,EAAY,GACZ,EAAW,EACX,EAAQ,EACR,EAAS,EACT,EAAM,EAEV,IAAK,IAAM,KAAU,EAAU,QAAS,CACpC,GAAI,IAAS,OAAS,EAAO,OAAS,EAAM,SAC5C,EAAY,GACZ,GAAS,EAAO,MAEhB,IAAM,EAAO,EAAO,MAAQ,EAAO,OAC/B,EAAO,IACX,EAAW,EACX,EAAQ,EAAO,MACf,EAAS,EAAO,OAChB,EAAM,EAAO,IACjB,CAEA,GAAI,CAAC,EAED,MADA,GAAO,CAAE,GAAG,EAAM,GAAG,CAAK,EACnB,EAGX,IAAM,EAAU,IAAc,KAAO,GAAK,EAAM,GAAgB,IAC1D,EAAQ,IAAc,KAAO,EAAI,EAAQ,EACzC,EAAO,EAAU,GAAK,EAAQ,EAAI,KAAK,MAAO,EAAQ,EAAK,IAAO,CAAO,EAAI,EAWnF,MATA,GAAY,EACZ,EAAe,EACf,EAAO,CACH,OACA,MAAO,EAAQ,EAAI,EAAQ,EAAK,MAChC,OAAQ,EAAS,EAAI,EAAS,EAAK,OACnC,IAAK,EAAM,EAAI,EAAM,EAAK,IAC1B,GAAG,CACP,EACO,CACX,CAEA,MAAO,CACH,OACA,OAAQ,KAAO,IACX,EAAK,MAAM,EAAW,SAAS,CAAC,EACpC,UAAmB,CACf,EAAY,KACZ,EAAe,EACf,EAAO,CAAE,GAAG,EAAM,KAAM,CAAE,CAC9B,CACJ,CACJ"}
+{"version":3,"file":"link-stats.cjs","names":["numberField","value","entry","key","stringField","booleanField","isLimitationReason","entryKind","collect","namedPairId","pairs","relayCandidateIds","senders","report","raw","type","seconds","bps","id","reason","carryingPair","byId","collected","pair","flagged","readRoundTripMs","roundTripOf","readAvailableOutgoingKbps","availableOf","readQualityLimitation","limitationOf","readRelayed","relayedOf","named","found","sender","createLinkStatsSampler","kind","options","lastBytes","lastSampleAt","last","read","now","path","bytes","sawSender","bestArea","width","height","fps","area","elapsed","delta","kbps","connection"],"sources":["../../src/webrtc/link-stats.ts"],"sourcesContent":["/**\n * One link's outbound picture, in the shape a call UI actually renders.\n *\n * Everything here is derived, not reported: WebRTC hands out cumulative\n * counters and a graph of candidate pairs, and turning that into\n * `\"1,2 Mbps · 42 ms · 1080p60\"` is the work {@link createLinkStatsSampler}\n * does.\n */\nexport interface LinkStats {\n    /** Throughput since the previous sample. `0` on the first one — there is no delta yet. */\n    kbps: number;\n    /** Width of the largest stream being sent, or `0` before one is reported. */\n    width: number;\n    /** Height of the largest stream being sent, or `0` before one is reported. */\n    height: number;\n    /** Frame rate of the largest stream being sent, or `0` when the browser omits it. */\n    fps: number;\n    /** Round trip to the peer in milliseconds, or `null` before the first reading. */\n    rttMs: number | null;\n    /**\n     * Uplink the transport estimates for this path, in kbps, or `null`.\n     *\n     * `null` and not `0`, because the two mean opposite things: no estimate yet\n     * is the normal state for the first seconds of every call and the permanent\n     * state on an engine that publishes none, while `0` is indistinguishable\n     * from a path that died. A consumer that reads absence as zero drops the\n     * quality at the start of every call.\n     *\n     * This is the field that separates \"healthy at 2.5 Mbps\" from \"capped at\n     * 2.5 Mbps and drowning\" — `kbps` reports the cap being honoured either\n     * way, while the queue behind it grows.\n     */\n    availableKbps: number | null;\n    /**\n     * What the encoder says is holding the picture back, or `null` for nothing.\n     *\n     * `\"bandwidth\"` wins over the other values when senders disagree, because\n     * it is the only one a lower cap answers. Reacting to bandwidth on a\n     * machine that is actually CPU-bound buys a worse picture and no relief.\n     *\n     * The spec's `\"none\"` is reported as `null`: a consumer should not have to\n     * know that one of the truthy strings means \"nothing\".\n     */\n    limitedBy: RTCQualityLimitationReason | null;\n    /**\n     * Whether the link is travelling through a TURN relay.\n     *\n     * On a self-hosted mesh this is the hosting bill: a relayed stream goes up\n     * and down through the machine somebody is paying for, and the person who\n     * picked 4K is not that somebody.\n     *\n     * Resolved only from the pair the transport **names**, never from a merely\n     * `succeeded` one — guessing the route from a pair that carries nothing\n     * would report a cost nobody is paying.\n     */\n    relayed: boolean;\n}\n\n/** Which media a sampler counts. */\nexport type LinkStatsKind = \"video\" | \"audio\" | \"all\";\n\n/** Options for {@link createLinkStatsSampler}. */\nexport interface LinkStatsSamplerOptions {\n    /**\n     * Which media the throughput counts. Default `\"video\"`.\n     *\n     * Video is the default because it is what saturates an uplink — audio is an\n     * order of magnitude cheaper, and mixing it in moves the number by less than\n     * the noise between two samples. Use `\"all\"` when the figure is meant to be\n     * the connection's real cost rather than the picture's.\n     */\n    kind?: LinkStatsKind;\n}\n\n/**\n * A sampler bound to one connection.\n *\n * Holds the previous byte counter and timestamp, which is the whole reason this\n * is an object rather than a function: the rate is a delta, so somebody has to\n * remember the last reading. One sampler per link — sharing one across peers\n * subtracts one connection's counter from another's and reports nonsense.\n */\nexport interface LinkStatsSampler {\n    /**\n     * Reduce a report you already have.\n     *\n     * @param report - A report from `RTCPeerConnection.getStats()`.\n     * @returns The stats for this sample.\n     */\n    read: (report: RTCStatsReport) => LinkStats;\n    /**\n     * Fetch a report and reduce it.\n     *\n     * @param connection - The connection to sample.\n     * @returns The stats for this sample.\n     */\n    sample: (connection: RTCPeerConnection) => Promise<LinkStats>;\n    /**\n     * Drop the baseline the rate is derived from.\n     *\n     * Call it after an ICE restart, a reconnect, or a pause — otherwise the next\n     * sample divides the bytes of the whole gap by the whole gap and reports the\n     * average of a period nobody is asking about. The next reading comes back at\n     * `0` kbps and starts a fresh baseline; the resolution and round trip already\n     * on screen are kept, so the badge does not blank out.\n     */\n    reset: () => void;\n}\n\n/**\n * The three field readers below take an entry the collector has already\n * established is an object.\n *\n * A report is a `Map` whose values the browser fills, and nothing says they\n * have to be objects — a polyfill or a mock can put anything in there. That\n * check belongs at the door of the one loop that walks the report, not repeated\n * in each reader: three copies of the same guard means three branches no test\n * can reach past the first, and a reader that silently returns `null` for a\n * primitive hides the case instead of skipping it.\n */\ntype StatsEntry = Record<string, unknown>;\n\nfunction numberField(entry: StatsEntry, key: string): number | null {\n    const value: unknown = entry[key];\n    return typeof value === \"number\" && Number.isFinite(value) ? value : null;\n}\n\nfunction stringField(entry: StatsEntry, key: string): string | null {\n    const value: unknown = entry[key];\n    return typeof value === \"string\" ? value : null;\n}\n\nfunction booleanField(entry: StatsEntry, key: string): boolean | null {\n    const value: unknown = entry[key];\n    return typeof value === \"boolean\" ? value : null;\n}\n\n/**\n * Whether a string is one of the reasons the spec defines.\n *\n * `\"none\"` is deliberately not one of them here: the field it feeds reports\n * \"nothing is limiting\" as `null`, so a consumer never has to know that one of\n * the truthy strings means no.\n */\nfunction isLimitationReason(value: string | null): value is RTCQualityLimitationReason {\n    return value === \"bandwidth\" || value === \"cpu\" || value === \"other\";\n}\n\n/**\n * Resolve the media an RTP entry carries.\n *\n * `kind` is the standard field and `mediaType` is what older Chrome reported;\n * both are still in the wild, and a sampler that reads only one of them\n * silently counts nothing on the browser that uses the other.\n */\nfunction entryKind(entry: StatsEntry): string | null {\n    return stringField(entry, \"kind\") ?? stringField(entry, \"mediaType\");\n}\n\n/** What one candidate pair says about the path it describes. */\ninterface PairFacts {\n    id: string;\n    /** `true` when the browser marks this pair as the chosen one non-standardly. */\n    selected: boolean;\n    state: string | null;\n    rttMs: number | null;\n    availableKbps: number | null;\n    localCandidateId: string | null;\n}\n\n/** What one sender says about what it is sending. */\ninterface SenderFacts {\n    kind: string | null;\n    bytes: number;\n    width: number;\n    height: number;\n    fps: number;\n    limitedBy: RTCQualityLimitationReason | null;\n}\n\n/** Everything a single walk over a report yields. */\ninterface CollectedReport {\n    namedPairId: string | null;\n    pairs: PairFacts[];\n    relayCandidateIds: Set<string>;\n    senders: SenderFacts[];\n}\n\n/**\n * Reduce a report in **one** pass.\n *\n * One pass is the point rather than tidiness. Every field below lives in the\n * same report, and the pair the transport selected has to be resolved before\n * any of the path fields can be read — so a consumer that asks for round trip,\n * then throughput headroom, then whether the route is relayed, walks the same\n * report three times and resolves the same pair three times, per link, on every\n * tick. On a mesh of eight at one sample every two seconds that is the most\n * expensive recurring work in the call, on the device least able to pay it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The entries that matter, grouped.\n */\nfunction collect(report: RTCStatsReport): CollectedReport {\n    let namedPairId: string | null = null;\n    const pairs: PairFacts[] = [];\n    const relayCandidateIds = new Set<string>();\n    const senders: SenderFacts[] = [];\n\n    report.forEach((raw: unknown) => {\n        if (typeof raw !== \"object\" || raw === null) return;\n        const entry = raw as StatsEntry;\n        const type = stringField(entry, \"type\");\n        if (type === \"transport\") {\n            namedPairId = stringField(entry, \"selectedCandidatePairId\") ?? namedPairId;\n            return;\n        }\n        if (type === \"candidate-pair\") {\n            const seconds = numberField(entry, \"currentRoundTripTime\");\n            const bps = numberField(entry, \"availableOutgoingBitrate\");\n            pairs.push({\n                id: stringField(entry, \"id\") ?? \"\",\n                selected: booleanField(entry, \"selected\") === true,\n                state: stringField(entry, \"state\"),\n                rttMs: seconds === null ? null : seconds * 1000,\n                availableKbps: bps === null ? null : Math.round(bps / 1000),\n                localCandidateId: stringField(entry, \"localCandidateId\"),\n            });\n            return;\n        }\n        if (type === \"local-candidate\") {\n            const id = stringField(entry, \"id\");\n            if (id !== null && stringField(entry, \"candidateType\") === \"relay\") {\n                relayCandidateIds.add(id);\n            }\n            return;\n        }\n        if (type !== \"outbound-rtp\") return;\n        const reason = stringField(entry, \"qualityLimitationReason\");\n        senders.push({\n            kind: entryKind(entry),\n            bytes: numberField(entry, \"bytesSent\") ?? 0,\n            width: numberField(entry, \"frameWidth\") ?? 0,\n            height: numberField(entry, \"frameHeight\") ?? 0,\n            fps: Math.round(numberField(entry, \"framesPerSecond\") ?? 0),\n            limitedBy: isLimitationReason(reason) ? reason : null,\n        });\n    });\n\n    return { namedPairId, pairs, relayCandidateIds, senders };\n}\n\n/**\n * The candidate pair carrying the link, and how sure we are that it is.\n *\n * A connection routinely keeps several viable pairs alive at once — host,\n * server-reflexive, relayed — and only one of them carries traffic. Reading the\n * first `succeeded` pair makes a reading jump between paths that are not being\n * travelled: 8 ms on an idle host pair alternating with 180 ms on the TURN pair\n * doing the work.\n *\n * The chain is `transport.selectedCandidatePairId` → a pair flagged\n * `selected: true` → the first `succeeded` one. The middle step is not in the\n * spec and is there because an engine that fills neither the transport field\n * nor it does not appear to exist, while one that fills only the flag does: a\n * reader that skips straight to `succeeded` silently answers about the wrong\n * path there. The last step is a guess, and `named` says so — the fields where\n * guessing would report something false refuse it.\n *\n * @param collected - A collected report.\n * @returns The pair and whether the browser actually named it.\n */\nfunction carryingPair(collected: CollectedReport): { pair: PairFacts | null; named: boolean } {\n    const byId =\n        collected.namedPairId === null\n            ? undefined\n            : collected.pairs.find((pair) => pair.id === collected.namedPairId);\n    if (byId !== undefined) return { pair: byId, named: true };\n\n    const flagged = collected.pairs.find((pair) => pair.selected);\n    if (flagged !== undefined) return { pair: flagged, named: true };\n\n    const succeeded = collected.pairs.find((pair) => pair.state === \"succeeded\");\n    return { pair: succeeded ?? null, named: false };\n}\n\n/**\n * Read the round trip of the candidate pair actually carrying the link.\n *\n * A `succeeded` pair is kept as a last resort because not every browser names\n * the selected one — losing the reading entirely is worse than an occasionally\n * optimistic one. See {@link carryingPair} for the chain and why the middle\n * step exists.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns Round trip in milliseconds, rounded, or `null` when nothing reported\n *   one — which is the normal state before the connection settles.\n *\n * @example\n * const rttMs = readRoundTripMs(await pc.getStats());\n */\nexport function readRoundTripMs(report: RTCStatsReport): number | null {\n    return roundTripOf(collect(report));\n}\n\n/**\n * Read the uplink the transport estimates for this path, in kbps.\n *\n * This is the field that tells a cap being honoured apart from a cap that is\n * drowning: `bytesSent` reports the same 2500 kbps whether the path has room\n * for it or the queue behind it is growing. No fixed budget can stand in for it\n * — a domestic uplink of 1 Mbps and a fibre link differ by an order of\n * magnitude, and in Brazil the upload routinely is a tenth of the download\n * beside it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The estimate in kbps, or `null` while there is none. Every reader\n *   needs a fallback for that, not a default of zero.\n *\n * @example\n * const headroom = readAvailableOutgoingKbps(await pc.getStats());\n * if (headroom !== null && headroom < asked) lowerTheCap(headroom);\n */\nexport function readAvailableOutgoingKbps(report: RTCStatsReport): number | null {\n    return availableOf(collect(report));\n}\n\n/**\n * Read what the encoder says is holding the picture back.\n *\n * `\"bandwidth\"` wins when senders disagree, because it is the only reason a\n * lower cap answers. The spec's `\"none\"` comes back as `null`.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The reason, or `null` when nothing is limiting the picture.\n *\n * @example\n * if (readQualityLimitation(await pc.getStats()) === \"cpu\") stopBlurringTheBackground();\n */\nexport function readQualityLimitation(report: RTCStatsReport): RTCQualityLimitationReason | null {\n    return limitationOf(collect(report));\n}\n\n/**\n * Read whether the link is travelling through a TURN relay.\n *\n * Resolved only from the pair the browser names, never from a merely\n * `succeeded` one: a relayed route is somebody's hosting bill, and reporting\n * one from a pair that carries nothing bills a cost nobody is paying.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns `true` when the carrying pair's local candidate is a relay.\n *\n * @example\n * if (readRelayed(await pc.getStats())) capTheStreamThatCostsMoney();\n */\nexport function readRelayed(report: RTCStatsReport): boolean {\n    return relayedOf(collect(report));\n}\n\n/** Round trip of the carrying pair, in whole milliseconds. */\nfunction roundTripOf(collected: CollectedReport): number | null {\n    const withTiming: CollectedReport = {\n        ...collected,\n        pairs: collected.pairs.filter((pair) => pair.rttMs !== null),\n    };\n    const { pair } = carryingPair(withTiming);\n    return pair?.rttMs === undefined || pair.rttMs === null ? null : Math.round(pair.rttMs);\n}\n\n/** Estimated uplink of the carrying pair, in kbps. */\nfunction availableOf(collected: CollectedReport): number | null {\n    const { pair } = carryingPair(collected);\n    return pair?.availableKbps ?? null;\n}\n\n/** Whether the pair the browser named travels through a relay. */\nfunction relayedOf(collected: CollectedReport): boolean {\n    const { pair, named } = carryingPair(collected);\n    if (!named || pair === null || pair.localCandidateId === null) return false;\n    return collected.relayCandidateIds.has(pair.localCandidateId);\n}\n\n/** The strongest limitation any sender reports, with bandwidth winning. */\nfunction limitationOf(collected: CollectedReport): RTCQualityLimitationReason | null {\n    let found: RTCQualityLimitationReason | null = null;\n    for (const sender of collected.senders) {\n        if (sender.limitedBy === null) continue;\n        if (sender.limitedBy === \"bandwidth\") return \"bandwidth\";\n        found = found ?? sender.limitedBy;\n    }\n    return found;\n}\n\n/**\n * Track one link's throughput, resolution and round trip across samples.\n *\n * Every rate here is a **delta**. `bytesSent` is cumulative since the connection\n * opened, so dividing it by the session length gives the historical average —\n * a number that only ever falls and never shows what is happening now. The\n * previous reading is kept on the sampler and subtracted, which is the part\n * every hand-rolled copy of this ends up rewriting.\n *\n * Bytes are summed across every matching sender, because a peer publishing a\n * camera and a screen at once occupies one uplink with both — and the uplink is\n * what runs out. Resolution and frame rate come from the **largest** stream by\n * area, which is the one that dominates that bandwidth and the one somebody\n * watching the call is looking at.\n *\n * @param options - See {@link LinkStatsSamplerOptions}.\n * @returns A sampler. Use one per `RTCPeerConnection`.\n *\n * @example\n * const sampler = createLinkStatsSampler();\n *\n * setInterval(async () => {\n *   const stats = await sampler.sample(pc);\n *   badge.textContent = `${stats.kbps} kbps · ${stats.rttMs ?? \"—\"} ms`;\n * }, 2000);\n */\nexport function createLinkStatsSampler(options: LinkStatsSamplerOptions = {}): LinkStatsSampler {\n    const kind: LinkStatsKind = options.kind ?? \"video\";\n    let lastBytes: number | null = null;\n    let lastSampleAt = 0;\n    let last: LinkStats = {\n        kbps: 0,\n        width: 0,\n        height: 0,\n        fps: 0,\n        rttMs: null,\n        availableKbps: null,\n        limitedBy: null,\n        relayed: false,\n    };\n\n    function read(report: RTCStatsReport): LinkStats {\n        const now = performance.now();\n        const collected = collect(report);\n        const path = {\n            rttMs: roundTripOf(collected),\n            availableKbps: availableOf(collected),\n            limitedBy: limitationOf(collected),\n            relayed: relayedOf(collected),\n        };\n\n        let bytes = 0;\n        let sawSender = false;\n        let bestArea = 0;\n        let width = 0;\n        let height = 0;\n        let fps = 0;\n\n        for (const sender of collected.senders) {\n            if (kind !== \"all\" && sender.kind !== kind) continue;\n            sawSender = true;\n            bytes += sender.bytes;\n\n            const area = sender.width * sender.height;\n            if (area < bestArea) continue;\n            bestArea = area;\n            width = sender.width;\n            height = sender.height;\n            fps = sender.fps;\n        }\n\n        if (!sawSender) {\n            last = { ...last, ...path };\n            return last;\n        }\n\n        const elapsed = lastBytes === null ? 0 : (now - lastSampleAt) / 1000;\n        const delta = lastBytes === null ? 0 : bytes - lastBytes;\n        const kbps = elapsed > 0 && delta > 0 ? Math.round((delta * 8) / 1000 / elapsed) : 0;\n\n        lastBytes = bytes;\n        lastSampleAt = now;\n        last = {\n            kbps,\n            width: width > 0 ? width : last.width,\n            height: height > 0 ? height : last.height,\n            fps: fps > 0 ? fps : last.fps,\n            ...path,\n        };\n        return last;\n    }\n\n    return {\n        read,\n        sample: async (connection: RTCPeerConnection): Promise<LinkStats> =>\n            read(await connection.getStats()),\n        reset: (): void => {\n            lastBytes = null;\n            lastSampleAt = 0;\n            last = { ...last, kbps: 0 };\n        },\n    };\n}\n"],"mappings":"AA0HA,SAASA,EAAY,EAAmB,EAA4B,CAChE,IAAMC,EAAiBC,EAAMC,GAC7B,OAAO,OAAOF,GAAU,UAAY,OAAO,SAASA,CAAK,EAAIA,EAAQ,IACzE,CAEA,SAASG,EAAY,EAAmB,EAA4B,CAChE,IAAMH,EAAiBC,EAAMC,GAC7B,OAAO,OAAOF,GAAU,SAAWA,EAAQ,IAC/C,CAEA,SAASI,EAAa,EAAmB,EAA6B,CAClE,IAAMJ,EAAiBC,EAAMC,GAC7B,OAAO,OAAOF,GAAU,UAAYA,EAAQ,IAChD,CASA,SAASK,EAAmB,EAA2D,CACnF,OAAOL,IAAU,aAAeA,IAAU,OAASA,IAAU,OACjE,CASA,SAASM,EAAU,EAAkC,CACjD,OAAOH,EAAYF,EAAO,MAAM,GAAKE,EAAYF,EAAO,WAAW,CACvE,CA6CA,SAASM,EAAQ,EAAyC,CACtD,IAAIC,EAA6B,KAC3BC,EAAqB,CAAC,EACtBC,EAAoB,IAAI,IACxBC,EAAyB,CAAC,EA0ChC,OAxCAC,EAAO,QAAS,GAAiB,CAC7B,GAAI,OAAOC,GAAQ,WAAYA,EAAc,OAC7C,IAAMZ,EAAQY,EACRC,EAAOX,EAAYF,EAAO,MAAM,EACtC,GAAIa,IAAS,YAAa,CACtB,EAAcX,EAAYF,EAAO,yBAAyB,GAAKO,EAC/D,MACJ,CACA,GAAIM,IAAS,iBAAkB,CAC3B,IAAMC,EAAUhB,EAAYE,EAAO,sBAAsB,EACnDe,EAAMjB,EAAYE,EAAO,0BAA0B,EACzDQ,EAAM,KAAK,CACP,GAAIN,EAAYF,EAAO,IAAI,GAAK,GAChC,SAAUG,EAAaH,EAAO,UAAU,IAAM,GAC9C,MAAOE,EAAYF,EAAO,OAAO,EACjC,MAAOc,IAAY,KAAO,KAAOA,EAAU,IAC3C,cAAeC,IAAQ,KAAO,KAAO,KAAK,MAAMA,EAAM,GAAI,EAC1D,iBAAkBb,EAAYF,EAAO,kBAAkB,CAC3D,CAAC,EACD,MACJ,CACA,GAAIa,IAAS,kBAAmB,CAC5B,IAAMG,EAAKd,EAAYF,EAAO,IAAI,EAC9BgB,IAAO,MAAQd,EAAYF,EAAO,eAAe,IAAM,SACvDS,EAAkB,IAAIO,CAAE,EAE5B,MACJ,CACA,GAAIH,IAAS,eAAgB,OAC7B,IAAMI,EAASf,EAAYF,EAAO,yBAAyB,EAC3DU,EAAQ,KAAK,CACT,KAAML,EAAUL,CAAK,EACrB,MAAOF,EAAYE,EAAO,WAAW,GAAK,EAC1C,MAAOF,EAAYE,EAAO,YAAY,GAAK,EAC3C,OAAQF,EAAYE,EAAO,aAAa,GAAK,EAC7C,IAAK,KAAK,MAAMF,EAAYE,EAAO,iBAAiB,GAAK,CAAC,EAC1D,UAAWI,EAAmBa,CAAM,EAAIA,EAAS,IACrD,CAAC,CACL,CAAC,EAEM,CAAE,cAAa,QAAO,oBAAmB,SAAQ,CAC5D,CAsBA,SAASC,EAAa,EAAwE,CAC1F,IAAMC,EACFC,EAAU,cAAgB,KACpB,IAAA,GACAA,EAAU,MAAM,KAAM,GAASC,EAAK,KAAOD,EAAU,WAAW,EAC1E,GAAID,IAAS,IAAA,GAAW,MAAO,CAAE,KAAMA,EAAM,MAAO,EAAK,EAEzD,IAAMG,EAAUF,EAAU,MAAM,KAAM,GAASC,EAAK,QAAQ,EAI5D,OAHIC,IAAY,IAAA,GAGT,CAAE,KADSF,EAAU,MAAM,KAAM,GAASC,EAAK,QAAU,WACjD,GAAa,KAAM,MAAO,EAAM,EAHb,CAAE,KAAMC,EAAS,MAAO,EAAK,CAInE,CAiBA,SAAgBC,EAAgB,EAAuC,CACnE,OAAOC,EAAYlB,EAAQK,CAAM,CAAC,CACtC,CAoBA,SAAgBc,EAA0B,EAAuC,CAC7E,OAAOC,EAAYpB,EAAQK,CAAM,CAAC,CACtC,CAcA,SAAgBgB,EAAsB,EAA2D,CAC7F,OAAOC,EAAatB,EAAQK,CAAM,CAAC,CACvC,CAeA,SAAgBkB,EAAY,EAAiC,CACzD,OAAOC,EAAUxB,EAAQK,CAAM,CAAC,CACpC,CAGA,SAASa,EAAY,EAA2C,CAK5D,GAAM,CAAE,QAASN,EAAa,CAH1B,GAAGE,EACH,MAAOA,EAAU,MAAM,OAAQ,GAASC,EAAK,QAAU,IAAI,CAEjC,CAAU,EACxC,OAAOA,GAAM,QAAU,IAAA,IAAaA,EAAK,QAAU,KAAO,KAAO,KAAK,MAAMA,EAAK,KAAK,CAC1F,CAGA,SAASK,EAAY,EAA2C,CAC5D,GAAM,CAAE,QAASR,EAAaE,CAAS,EACvC,OAAOC,GAAM,eAAiB,IAClC,CAGA,SAASS,EAAU,EAAqC,CACpD,GAAM,CAAE,OAAM,SAAUZ,EAAaE,CAAS,EAE9C,MADI,CAACW,GAASV,IAAS,MAAQA,EAAK,mBAAqB,KAAa,GAC/DD,EAAU,kBAAkB,IAAIC,EAAK,gBAAgB,CAChE,CAGA,SAASO,EAAa,EAA+D,CACjF,IAAII,EAA2C,KAC/C,IAAK,IAAMC,KAAUb,EAAU,QAC3B,GAAIa,EAAO,YAAc,KACzB,IAAIA,EAAO,YAAc,YAAa,MAAO,YAC7C,IAAiBA,EAAO,SADqB,CAGjD,OAAOD,CACX,CA4BA,SAAgBE,EAAuB,EAAmC,CAAC,EAAqB,CAC5F,IAAMC,EAAsBC,EAAQ,MAAQ,QACxCC,EAA2B,KAC3BC,EAAe,EACfC,EAAkB,CAClB,KAAM,EACN,MAAO,EACP,OAAQ,EACR,IAAK,EACL,MAAO,KACP,cAAe,KACf,UAAW,KACX,QAAS,EACb,EAEA,SAASC,EAAK,EAAmC,CAC7C,IAAMC,EAAM,YAAY,IAAI,EACtBrB,EAAYd,EAAQK,CAAM,EAC1B+B,EAAO,CACT,MAAOlB,EAAYJ,CAAS,EAC5B,cAAeM,EAAYN,CAAS,EACpC,UAAWQ,EAAaR,CAAS,EACjC,QAASU,EAAUV,CAAS,CAChC,EAEIuB,EAAQ,EACRC,EAAY,GACZC,EAAW,EACXC,EAAQ,EACRC,EAAS,EACTC,EAAM,EAEV,IAAK,IAAMf,KAAUb,EAAU,QAAS,CACpC,GAAIe,IAAS,OAASF,EAAO,OAASE,EAAM,SAC5C,EAAY,GACZ,GAASF,EAAO,MAEhB,IAAMgB,EAAOhB,EAAO,MAAQA,EAAO,OAC/BgB,EAAOJ,IACX,EAAWI,EACX,EAAQhB,EAAO,MACf,EAASA,EAAO,OAChB,EAAMA,EAAO,IACjB,CAEA,GAAI,CAACW,EAED,MADA,GAAO,CAAE,GAAGL,EAAM,GAAGG,CAAK,EACnBH,EAGX,IAAMW,EAAUb,IAAc,KAAO,GAAKI,EAAMH,GAAgB,IAC1Da,EAAQd,IAAc,KAAO,EAAIM,EAAQN,EACzCe,EAAOF,EAAU,GAAKC,EAAQ,EAAI,KAAK,MAAOA,EAAQ,EAAK,IAAOD,CAAO,EAAI,EAWnF,MATA,GAAYP,EACZ,EAAeF,EACf,EAAO,CACH,OACA,MAAOK,EAAQ,EAAIA,EAAQP,EAAK,MAChC,OAAQQ,EAAS,EAAIA,EAASR,EAAK,OACnC,IAAKS,EAAM,EAAIA,EAAMT,EAAK,IAC1B,GAAGG,CACP,EACOH,CACX,CAEA,MAAO,CACH,OACA,OAAQ,KAAO,IACXC,EAAK,MAAMa,EAAW,SAAS,CAAC,EACpC,UAAmB,CACf,EAAY,KACZ,EAAe,EACf,EAAO,CAAE,GAAGd,EAAM,KAAM,CAAE,CAC9B,CACJ,CACJ,C"}

package/dist/webrtc/link-stats.js.map

@@ -1 +1 @@
-{"version":3,"file":"link-stats.js","names":[],"sources":["../../src/webrtc/link-stats.ts"],"sourcesContent":["/**\n * One link's outbound picture, in the shape a call UI actually renders.\n *\n * Everything here is derived, not reported: WebRTC hands out cumulative\n * counters and a graph of candidate pairs, and turning that into\n * `\"1,2 Mbps · 42 ms · 1080p60\"` is the work {@link createLinkStatsSampler}\n * does.\n */\nexport interface LinkStats {\n    /** Throughput since the previous sample. `0` on the first one — there is no delta yet. */\n    kbps: number;\n    /** Width of the largest stream being sent, or `0` before one is reported. */\n    width: number;\n    /** Height of the largest stream being sent, or `0` before one is reported. */\n    height: number;\n    /** Frame rate of the largest stream being sent, or `0` when the browser omits it. */\n    fps: number;\n    /** Round trip to the peer in milliseconds, or `null` before the first reading. */\n    rttMs: number | null;\n    /**\n     * Uplink the transport estimates for this path, in kbps, or `null`.\n     *\n     * `null` and not `0`, because the two mean opposite things: no estimate yet\n     * is the normal state for the first seconds of every call and the permanent\n     * state on an engine that publishes none, while `0` is indistinguishable\n     * from a path that died. A consumer that reads absence as zero drops the\n     * quality at the start of every call.\n     *\n     * This is the field that separates \"healthy at 2.5 Mbps\" from \"capped at\n     * 2.5 Mbps and drowning\" — `kbps` reports the cap being honoured either\n     * way, while the queue behind it grows.\n     */\n    availableKbps: number | null;\n    /**\n     * What the encoder says is holding the picture back, or `null` for nothing.\n     *\n     * `\"bandwidth\"` wins over the other values when senders disagree, because\n     * it is the only one a lower cap answers. Reacting to bandwidth on a\n     * machine that is actually CPU-bound buys a worse picture and no relief.\n     *\n     * The spec's `\"none\"` is reported as `null`: a consumer should not have to\n     * know that one of the truthy strings means \"nothing\".\n     */\n    limitedBy: RTCQualityLimitationReason | null;\n    /**\n     * Whether the link is travelling through a TURN relay.\n     *\n     * On a self-hosted mesh this is the hosting bill: a relayed stream goes up\n     * and down through the machine somebody is paying for, and the person who\n     * picked 4K is not that somebody.\n     *\n     * Resolved only from the pair the transport **names**, never from a merely\n     * `succeeded` one — guessing the route from a pair that carries nothing\n     * would report a cost nobody is paying.\n     */\n    relayed: boolean;\n}\n\n/** Which media a sampler counts. */\nexport type LinkStatsKind = \"video\" | \"audio\" | \"all\";\n\n/** Options for {@link createLinkStatsSampler}. */\nexport interface LinkStatsSamplerOptions {\n    /**\n     * Which media the throughput counts. Default `\"video\"`.\n     *\n     * Video is the default because it is what saturates an uplink — audio is an\n     * order of magnitude cheaper, and mixing it in moves the number by less than\n     * the noise between two samples. Use `\"all\"` when the figure is meant to be\n     * the connection's real cost rather than the picture's.\n     */\n    kind?: LinkStatsKind;\n}\n\n/**\n * A sampler bound to one connection.\n *\n * Holds the previous byte counter and timestamp, which is the whole reason this\n * is an object rather than a function: the rate is a delta, so somebody has to\n * remember the last reading. One sampler per link — sharing one across peers\n * subtracts one connection's counter from another's and reports nonsense.\n */\nexport interface LinkStatsSampler {\n    /**\n     * Reduce a report you already have.\n     *\n     * @param report - A report from `RTCPeerConnection.getStats()`.\n     * @returns The stats for this sample.\n     */\n    read: (report: RTCStatsReport) => LinkStats;\n    /**\n     * Fetch a report and reduce it.\n     *\n     * @param connection - The connection to sample.\n     * @returns The stats for this sample.\n     */\n    sample: (connection: RTCPeerConnection) => Promise<LinkStats>;\n    /**\n     * Drop the baseline the rate is derived from.\n     *\n     * Call it after an ICE restart, a reconnect, or a pause — otherwise the next\n     * sample divides the bytes of the whole gap by the whole gap and reports the\n     * average of a period nobody is asking about. The next reading comes back at\n     * `0` kbps and starts a fresh baseline; the resolution and round trip already\n     * on screen are kept, so the badge does not blank out.\n     */\n    reset: () => void;\n}\n\n/**\n * The three field readers below take an entry the collector has already\n * established is an object.\n *\n * A report is a `Map` whose values the browser fills, and nothing says they\n * have to be objects — a polyfill or a mock can put anything in there. That\n * check belongs at the door of the one loop that walks the report, not repeated\n * in each reader: three copies of the same guard means three branches no test\n * can reach past the first, and a reader that silently returns `null` for a\n * primitive hides the case instead of skipping it.\n */\ntype StatsEntry = Record<string, unknown>;\n\nfunction numberField(entry: StatsEntry, key: string): number | null {\n    const value: unknown = entry[key];\n    return typeof value === \"number\" && Number.isFinite(value) ? value : null;\n}\n\nfunction stringField(entry: StatsEntry, key: string): string | null {\n    const value: unknown = entry[key];\n    return typeof value === \"string\" ? value : null;\n}\n\nfunction booleanField(entry: StatsEntry, key: string): boolean | null {\n    const value: unknown = entry[key];\n    return typeof value === \"boolean\" ? value : null;\n}\n\n/**\n * Whether a string is one of the reasons the spec defines.\n *\n * `\"none\"` is deliberately not one of them here: the field it feeds reports\n * \"nothing is limiting\" as `null`, so a consumer never has to know that one of\n * the truthy strings means no.\n */\nfunction isLimitationReason(value: string | null): value is RTCQualityLimitationReason {\n    return value === \"bandwidth\" || value === \"cpu\" || value === \"other\";\n}\n\n/**\n * Resolve the media an RTP entry carries.\n *\n * `kind` is the standard field and `mediaType` is what older Chrome reported;\n * both are still in the wild, and a sampler that reads only one of them\n * silently counts nothing on the browser that uses the other.\n */\nfunction entryKind(entry: StatsEntry): string | null {\n    return stringField(entry, \"kind\") ?? stringField(entry, \"mediaType\");\n}\n\n/** What one candidate pair says about the path it describes. */\ninterface PairFacts {\n    id: string;\n    /** `true` when the browser marks this pair as the chosen one non-standardly. */\n    selected: boolean;\n    state: string | null;\n    rttMs: number | null;\n    availableKbps: number | null;\n    localCandidateId: string | null;\n}\n\n/** What one sender says about what it is sending. */\ninterface SenderFacts {\n    kind: string | null;\n    bytes: number;\n    width: number;\n    height: number;\n    fps: number;\n    limitedBy: RTCQualityLimitationReason | null;\n}\n\n/** Everything a single walk over a report yields. */\ninterface CollectedReport {\n    namedPairId: string | null;\n    pairs: PairFacts[];\n    relayCandidateIds: Set<string>;\n    senders: SenderFacts[];\n}\n\n/**\n * Reduce a report in **one** pass.\n *\n * One pass is the point rather than tidiness. Every field below lives in the\n * same report, and the pair the transport selected has to be resolved before\n * any of the path fields can be read — so a consumer that asks for round trip,\n * then throughput headroom, then whether the route is relayed, walks the same\n * report three times and resolves the same pair three times, per link, on every\n * tick. On a mesh of eight at one sample every two seconds that is the most\n * expensive recurring work in the call, on the device least able to pay it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The entries that matter, grouped.\n */\nfunction collect(report: RTCStatsReport): CollectedReport {\n    let namedPairId: string | null = null;\n    const pairs: PairFacts[] = [];\n    const relayCandidateIds = new Set<string>();\n    const senders: SenderFacts[] = [];\n\n    report.forEach((raw: unknown) => {\n        if (typeof raw !== \"object\" || raw === null) return;\n        const entry = raw as StatsEntry;\n        const type = stringField(entry, \"type\");\n        if (type === \"transport\") {\n            namedPairId = stringField(entry, \"selectedCandidatePairId\") ?? namedPairId;\n            return;\n        }\n        if (type === \"candidate-pair\") {\n            const seconds = numberField(entry, \"currentRoundTripTime\");\n            const bps = numberField(entry, \"availableOutgoingBitrate\");\n            pairs.push({\n                id: stringField(entry, \"id\") ?? \"\",\n                selected: booleanField(entry, \"selected\") === true,\n                state: stringField(entry, \"state\"),\n                rttMs: seconds === null ? null : seconds * 1000,\n                availableKbps: bps === null ? null : Math.round(bps / 1000),\n                localCandidateId: stringField(entry, \"localCandidateId\"),\n            });\n            return;\n        }\n        if (type === \"local-candidate\") {\n            const id = stringField(entry, \"id\");\n            if (id !== null && stringField(entry, \"candidateType\") === \"relay\") {\n                relayCandidateIds.add(id);\n            }\n            return;\n        }\n        if (type !== \"outbound-rtp\") return;\n        const reason = stringField(entry, \"qualityLimitationReason\");\n        senders.push({\n            kind: entryKind(entry),\n            bytes: numberField(entry, \"bytesSent\") ?? 0,\n            width: numberField(entry, \"frameWidth\") ?? 0,\n            height: numberField(entry, \"frameHeight\") ?? 0,\n            fps: Math.round(numberField(entry, \"framesPerSecond\") ?? 0),\n            limitedBy: isLimitationReason(reason) ? reason : null,\n        });\n    });\n\n    return { namedPairId, pairs, relayCandidateIds, senders };\n}\n\n/**\n * The candidate pair carrying the link, and how sure we are that it is.\n *\n * A connection routinely keeps several viable pairs alive at once — host,\n * server-reflexive, relayed — and only one of them carries traffic. Reading the\n * first `succeeded` pair makes a reading jump between paths that are not being\n * travelled: 8 ms on an idle host pair alternating with 180 ms on the TURN pair\n * doing the work.\n *\n * The chain is `transport.selectedCandidatePairId` → a pair flagged\n * `selected: true` → the first `succeeded` one. The middle step is not in the\n * spec and is there because an engine that fills neither the transport field\n * nor it does not appear to exist, while one that fills only the flag does: a\n * reader that skips straight to `succeeded` silently answers about the wrong\n * path there. The last step is a guess, and `named` says so — the fields where\n * guessing would report something false refuse it.\n *\n * @param collected - A collected report.\n * @returns The pair and whether the browser actually named it.\n */\nfunction carryingPair(collected: CollectedReport): { pair: PairFacts | null; named: boolean } {\n    const byId =\n        collected.namedPairId === null\n            ? undefined\n            : collected.pairs.find((pair) => pair.id === collected.namedPairId);\n    if (byId !== undefined) return { pair: byId, named: true };\n\n    const flagged = collected.pairs.find((pair) => pair.selected);\n    if (flagged !== undefined) return { pair: flagged, named: true };\n\n    const succeeded = collected.pairs.find((pair) => pair.state === \"succeeded\");\n    return { pair: succeeded ?? null, named: false };\n}\n\n/**\n * Read the round trip of the candidate pair actually carrying the link.\n *\n * A `succeeded` pair is kept as a last resort because not every browser names\n * the selected one — losing the reading entirely is worse than an occasionally\n * optimistic one. See {@link carryingPair} for the chain and why the middle\n * step exists.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns Round trip in milliseconds, rounded, or `null` when nothing reported\n *   one — which is the normal state before the connection settles.\n *\n * @example\n * const rttMs = readRoundTripMs(await pc.getStats());\n */\nexport function readRoundTripMs(report: RTCStatsReport): number | null {\n    return roundTripOf(collect(report));\n}\n\n/**\n * Read the uplink the transport estimates for this path, in kbps.\n *\n * This is the field that tells a cap being honoured apart from a cap that is\n * drowning: `bytesSent` reports the same 2500 kbps whether the path has room\n * for it or the queue behind it is growing. No fixed budget can stand in for it\n * — a domestic uplink of 1 Mbps and a fibre link differ by an order of\n * magnitude, and in Brazil the upload routinely is a tenth of the download\n * beside it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The estimate in kbps, or `null` while there is none. Every reader\n *   needs a fallback for that, not a default of zero.\n *\n * @example\n * const headroom = readAvailableOutgoingKbps(await pc.getStats());\n * if (headroom !== null && headroom < asked) lowerTheCap(headroom);\n */\nexport function readAvailableOutgoingKbps(report: RTCStatsReport): number | null {\n    return availableOf(collect(report));\n}\n\n/**\n * Read what the encoder says is holding the picture back.\n *\n * `\"bandwidth\"` wins when senders disagree, because it is the only reason a\n * lower cap answers. The spec's `\"none\"` comes back as `null`.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The reason, or `null` when nothing is limiting the picture.\n *\n * @example\n * if (readQualityLimitation(await pc.getStats()) === \"cpu\") stopBlurringTheBackground();\n */\nexport function readQualityLimitation(report: RTCStatsReport): RTCQualityLimitationReason | null {\n    return limitationOf(collect(report));\n}\n\n/**\n * Read whether the link is travelling through a TURN relay.\n *\n * Resolved only from the pair the browser names, never from a merely\n * `succeeded` one: a relayed route is somebody's hosting bill, and reporting\n * one from a pair that carries nothing bills a cost nobody is paying.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns `true` when the carrying pair's local candidate is a relay.\n *\n * @example\n * if (readRelayed(await pc.getStats())) capTheStreamThatCostsMoney();\n */\nexport function readRelayed(report: RTCStatsReport): boolean {\n    return relayedOf(collect(report));\n}\n\n/** Round trip of the carrying pair, in whole milliseconds. */\nfunction roundTripOf(collected: CollectedReport): number | null {\n    const withTiming: CollectedReport = {\n        ...collected,\n        pairs: collected.pairs.filter((pair) => pair.rttMs !== null),\n    };\n    const { pair } = carryingPair(withTiming);\n    return pair?.rttMs === undefined || pair.rttMs === null ? null : Math.round(pair.rttMs);\n}\n\n/** Estimated uplink of the carrying pair, in kbps. */\nfunction availableOf(collected: CollectedReport): number | null {\n    const { pair } = carryingPair(collected);\n    return pair?.availableKbps ?? null;\n}\n\n/** Whether the pair the browser named travels through a relay. */\nfunction relayedOf(collected: CollectedReport): boolean {\n    const { pair, named } = carryingPair(collected);\n    if (!named || pair === null || pair.localCandidateId === null) return false;\n    return collected.relayCandidateIds.has(pair.localCandidateId);\n}\n\n/** The strongest limitation any sender reports, with bandwidth winning. */\nfunction limitationOf(collected: CollectedReport): RTCQualityLimitationReason | null {\n    let found: RTCQualityLimitationReason | null = null;\n    for (const sender of collected.senders) {\n        if (sender.limitedBy === null) continue;\n        if (sender.limitedBy === \"bandwidth\") return \"bandwidth\";\n        found = found ?? sender.limitedBy;\n    }\n    return found;\n}\n\n/**\n * Track one link's throughput, resolution and round trip across samples.\n *\n * Every rate here is a **delta**. `bytesSent` is cumulative since the connection\n * opened, so dividing it by the session length gives the historical average —\n * a number that only ever falls and never shows what is happening now. The\n * previous reading is kept on the sampler and subtracted, which is the part\n * every hand-rolled copy of this ends up rewriting.\n *\n * Bytes are summed across every matching sender, because a peer publishing a\n * camera and a screen at once occupies one uplink with both — and the uplink is\n * what runs out. Resolution and frame rate come from the **largest** stream by\n * area, which is the one that dominates that bandwidth and the one somebody\n * watching the call is looking at.\n *\n * @param options - See {@link LinkStatsSamplerOptions}.\n * @returns A sampler. Use one per `RTCPeerConnection`.\n *\n * @example\n * const sampler = createLinkStatsSampler();\n *\n * setInterval(async () => {\n *   const stats = await sampler.sample(pc);\n *   badge.textContent = `${stats.kbps} kbps · ${stats.rttMs ?? \"—\"} ms`;\n * }, 2000);\n */\nexport function createLinkStatsSampler(options: LinkStatsSamplerOptions = {}): LinkStatsSampler {\n    const kind: LinkStatsKind = options.kind ?? \"video\";\n    let lastBytes: number | null = null;\n    let lastSampleAt = 0;\n    let last: LinkStats = {\n        kbps: 0,\n        width: 0,\n        height: 0,\n        fps: 0,\n        rttMs: null,\n        availableKbps: null,\n        limitedBy: null,\n        relayed: false,\n    };\n\n    function read(report: RTCStatsReport): LinkStats {\n        const now = performance.now();\n        const collected = collect(report);\n        const path = {\n            rttMs: roundTripOf(collected),\n            availableKbps: availableOf(collected),\n            limitedBy: limitationOf(collected),\n            relayed: relayedOf(collected),\n        };\n\n        let bytes = 0;\n        let sawSender = false;\n        let bestArea = 0;\n        let width = 0;\n        let height = 0;\n        let fps = 0;\n\n        for (const sender of collected.senders) {\n            if (kind !== \"all\" && sender.kind !== kind) continue;\n            sawSender = true;\n            bytes += sender.bytes;\n\n            const area = sender.width * sender.height;\n            if (area < bestArea) continue;\n            bestArea = area;\n            width = sender.width;\n            height = sender.height;\n            fps = sender.fps;\n        }\n\n        if (!sawSender) {\n            last = { ...last, ...path };\n            return last;\n        }\n\n        const elapsed = lastBytes === null ? 0 : (now - lastSampleAt) / 1000;\n        const delta = lastBytes === null ? 0 : bytes - lastBytes;\n        const kbps = elapsed > 0 && delta > 0 ? Math.round((delta * 8) / 1000 / elapsed) : 0;\n\n        lastBytes = bytes;\n        lastSampleAt = now;\n        last = {\n            kbps,\n            width: width > 0 ? width : last.width,\n            height: height > 0 ? height : last.height,\n            fps: fps > 0 ? fps : last.fps,\n            ...path,\n        };\n        return last;\n    }\n\n    return {\n        read,\n        sample: async (connection: RTCPeerConnection): Promise<LinkStats> =>\n            read(await connection.getStats()),\n        reset: (): void => {\n            lastBytes = null;\n            lastSampleAt = 0;\n            last = { ...last, kbps: 0 };\n        },\n    };\n}\n"],"mappings":";AA0HA,SAAS,EAAY,GAAmB,GAA4B;CAChE,IAAM,IAAiB,EAAM;CAC7B,OAAO,OAAO,KAAU,YAAY,OAAO,SAAS,CAAK,IAAI,IAAQ;AACzE;AAEA,SAAS,EAAY,GAAmB,GAA4B;CAChE,IAAM,IAAiB,EAAM;CAC7B,OAAO,OAAO,KAAU,WAAW,IAAQ;AAC/C;AAEA,SAAS,EAAa,GAAmB,GAA6B;CAClE,IAAM,IAAiB,EAAM;CAC7B,OAAO,OAAO,KAAU,YAAY,IAAQ;AAChD;AASA,SAAS,EAAmB,GAA2D;CACnF,OAAO,MAAU,eAAe,MAAU,SAAS,MAAU;AACjE;AASA,SAAS,EAAU,GAAkC;CACjD,OAAO,EAAY,GAAO,MAAM,KAAK,EAAY,GAAO,WAAW;AACvE;AA6CA,SAAS,EAAQ,GAAyC;CACtD,IAAI,IAA6B,MAC3B,IAAqB,CAAC,GACtB,oBAAoB,IAAI,IAAY,GACpC,IAAyB,CAAC;CA0ChC,OAxCA,EAAO,SAAS,MAAiB;EAC7B,IAAI,OAAO,KAAQ,aAAY,GAAc;EAC7C,IAAM,IAAQ,GACR,IAAO,EAAY,GAAO,MAAM;EACtC,IAAI,MAAS,aAAa;GACtB,IAAc,EAAY,GAAO,yBAAyB,KAAK;GAC/D;EACJ;EACA,IAAI,MAAS,kBAAkB;GAC3B,IAAM,IAAU,EAAY,GAAO,sBAAsB,GACnD,IAAM,EAAY,GAAO,0BAA0B;GACzD,EAAM,KAAK;IACP,IAAI,EAAY,GAAO,IAAI,KAAK;IAChC,UAAU,EAAa,GAAO,UAAU,MAAM;IAC9C,OAAO,EAAY,GAAO,OAAO;IACjC,OAAO,MAAY,OAAO,OAAO,IAAU;IAC3C,eAAe,MAAQ,OAAO,OAAO,KAAK,MAAM,IAAM,GAAI;IAC1D,kBAAkB,EAAY,GAAO,kBAAkB;GAC3D,CAAC;GACD;EACJ;EACA,IAAI,MAAS,mBAAmB;GAC5B,IAAM,IAAK,EAAY,GAAO,IAAI;GAClC,AAAI,MAAO,QAAQ,EAAY,GAAO,eAAe,MAAM,WACvD,EAAkB,IAAI,CAAE;GAE5B;EACJ;EACA,IAAI,MAAS,gBAAgB;EAC7B,IAAM,IAAS,EAAY,GAAO,yBAAyB;EAC3D,EAAQ,KAAK;GACT,MAAM,EAAU,CAAK;GACrB,OAAO,EAAY,GAAO,WAAW,KAAK;GAC1C,OAAO,EAAY,GAAO,YAAY,KAAK;GAC3C,QAAQ,EAAY,GAAO,aAAa,KAAK;GAC7C,KAAK,KAAK,MAAM,EAAY,GAAO,iBAAiB,KAAK,CAAC;GAC1D,WAAW,EAAmB,CAAM,IAAI,IAAS;EACrD,CAAC;CACL,CAAC,GAEM;EAAE;EAAa;EAAO;EAAmB;CAAQ;AAC5D;AAsBA,SAAS,EAAa,GAAwE;CAC1F,IAAM,IACF,EAAU,gBAAgB,OACpB,KAAA,IACA,EAAU,MAAM,MAAM,MAAS,EAAK,OAAO,EAAU,WAAW;CAC1E,IAAI,MAAS,KAAA,GAAW,OAAO;EAAE,MAAM;EAAM,OAAO;CAAK;CAEzD,IAAM,IAAU,EAAU,MAAM,MAAM,MAAS,EAAK,QAAQ;CAI5D,OAHI,MAAY,KAAA,IAGT;EAAE,MADS,EAAU,MAAM,MAAM,MAAS,EAAK,UAAU,WACjD,KAAa;EAAM,OAAO;CAAM,IAHb;EAAE,MAAM;EAAS,OAAO;CAAK;AAInE;AAiBA,SAAgB,EAAgB,GAAuC;CACnE,OAAO,EAAY,EAAQ,CAAM,CAAC;AACtC;AAoBA,SAAgB,EAA0B,GAAuC;CAC7E,OAAO,EAAY,EAAQ,CAAM,CAAC;AACtC;AAcA,SAAgB,EAAsB,GAA2D;CAC7F,OAAO,EAAa,EAAQ,CAAM,CAAC;AACvC;AAeA,SAAgB,EAAY,GAAiC;CACzD,OAAO,EAAU,EAAQ,CAAM,CAAC;AACpC;AAGA,SAAS,EAAY,GAA2C;CAK5D,IAAM,EAAE,YAAS,EAAa;EAH1B,GAAG;EACH,OAAO,EAAU,MAAM,QAAQ,MAAS,EAAK,UAAU,IAAI;CAEjC,CAAU;CACxC,OAAO,GAAM,UAAU,KAAA,KAAa,EAAK,UAAU,OAAO,OAAO,KAAK,MAAM,EAAK,KAAK;AAC1F;AAGA,SAAS,EAAY,GAA2C;CAC5D,IAAM,EAAE,YAAS,EAAa,CAAS;CACvC,OAAO,GAAM,iBAAiB;AAClC;AAGA,SAAS,EAAU,GAAqC;CACpD,IAAM,EAAE,SAAM,aAAU,EAAa,CAAS;CAE9C,OADI,CAAC,KAAS,MAAS,QAAQ,EAAK,qBAAqB,OAAa,KAC/D,EAAU,kBAAkB,IAAI,EAAK,gBAAgB;AAChE;AAGA,SAAS,EAAa,GAA+D;CACjF,IAAI,IAA2C;CAC/C,KAAK,IAAM,KAAU,EAAU,SACvB,MAAO,cAAc,MACzB;MAAI,EAAO,cAAc,aAAa,OAAO;EAC7C,MAAiB,EAAO;CADqB;CAGjD,OAAO;AACX;AA4BA,SAAgB,EAAuB,IAAmC,CAAC,GAAqB;CAC5F,IAAM,IAAsB,EAAQ,QAAQ,SACxC,IAA2B,MAC3B,IAAe,GACf,IAAkB;EAClB,MAAM;EACN,OAAO;EACP,QAAQ;EACR,KAAK;EACL,OAAO;EACP,eAAe;EACf,WAAW;EACX,SAAS;CACb;CAEA,SAAS,EAAK,GAAmC;EAC7C,IAAM,IAAM,YAAY,IAAI,GACtB,IAAY,EAAQ,CAAM,GAC1B,IAAO;GACT,OAAO,EAAY,CAAS;GAC5B,eAAe,EAAY,CAAS;GACpC,WAAW,EAAa,CAAS;GACjC,SAAS,EAAU,CAAS;EAChC,GAEI,IAAQ,GACR,IAAY,IACZ,IAAW,GACX,IAAQ,GACR,IAAS,GACT,IAAM;EAEV,KAAK,IAAM,KAAU,EAAU,SAAS;GACpC,IAAI,MAAS,SAAS,EAAO,SAAS,GAAM;GAE5C,AADA,IAAY,IACZ,KAAS,EAAO;GAEhB,IAAM,IAAO,EAAO,QAAQ,EAAO;GAC/B,IAAO,MACX,IAAW,GACX,IAAQ,EAAO,OACf,IAAS,EAAO,QAChB,IAAM,EAAO;EACjB;EAEA,IAAI,CAAC,GAED,OADA,IAAO;GAAE,GAAG;GAAM,GAAG;EAAK,GACnB;EAGX,IAAM,IAAU,MAAc,OAAO,KAAK,IAAM,KAAgB,KAC1D,IAAQ,MAAc,OAAO,IAAI,IAAQ,GACzC,IAAO,IAAU,KAAK,IAAQ,IAAI,KAAK,MAAO,IAAQ,IAAK,MAAO,CAAO,IAAI;EAWnF,OATA,IAAY,GACZ,IAAe,GACf,IAAO;GACH;GACA,OAAO,IAAQ,IAAI,IAAQ,EAAK;GAChC,QAAQ,IAAS,IAAI,IAAS,EAAK;GACnC,KAAK,IAAM,IAAI,IAAM,EAAK;GAC1B,GAAG;EACP,GACO;CACX;CAEA,OAAO;EACH;EACA,QAAQ,OAAO,MACX,EAAK,MAAM,EAAW,SAAS,CAAC;EACpC,aAAmB;GAGf,AAFA,IAAY,MACZ,IAAe,GACf,IAAO;IAAE,GAAG;IAAM,MAAM;GAAE;EAC9B;CACJ;AACJ"}
+{"version":3,"file":"link-stats.js","names":["numberField","value","entry","key","stringField","booleanField","isLimitationReason","entryKind","collect","namedPairId","pairs","relayCandidateIds","senders","report","raw","type","seconds","bps","id","reason","carryingPair","byId","collected","pair","flagged","readRoundTripMs","roundTripOf","readAvailableOutgoingKbps","availableOf","readQualityLimitation","limitationOf","readRelayed","relayedOf","named","found","sender","createLinkStatsSampler","kind","options","lastBytes","lastSampleAt","last","read","now","path","bytes","sawSender","bestArea","width","height","fps","area","elapsed","delta","kbps","connection"],"sources":["../../src/webrtc/link-stats.ts"],"sourcesContent":["/**\n * One link's outbound picture, in the shape a call UI actually renders.\n *\n * Everything here is derived, not reported: WebRTC hands out cumulative\n * counters and a graph of candidate pairs, and turning that into\n * `\"1,2 Mbps · 42 ms · 1080p60\"` is the work {@link createLinkStatsSampler}\n * does.\n */\nexport interface LinkStats {\n    /** Throughput since the previous sample. `0` on the first one — there is no delta yet. */\n    kbps: number;\n    /** Width of the largest stream being sent, or `0` before one is reported. */\n    width: number;\n    /** Height of the largest stream being sent, or `0` before one is reported. */\n    height: number;\n    /** Frame rate of the largest stream being sent, or `0` when the browser omits it. */\n    fps: number;\n    /** Round trip to the peer in milliseconds, or `null` before the first reading. */\n    rttMs: number | null;\n    /**\n     * Uplink the transport estimates for this path, in kbps, or `null`.\n     *\n     * `null` and not `0`, because the two mean opposite things: no estimate yet\n     * is the normal state for the first seconds of every call and the permanent\n     * state on an engine that publishes none, while `0` is indistinguishable\n     * from a path that died. A consumer that reads absence as zero drops the\n     * quality at the start of every call.\n     *\n     * This is the field that separates \"healthy at 2.5 Mbps\" from \"capped at\n     * 2.5 Mbps and drowning\" — `kbps` reports the cap being honoured either\n     * way, while the queue behind it grows.\n     */\n    availableKbps: number | null;\n    /**\n     * What the encoder says is holding the picture back, or `null` for nothing.\n     *\n     * `\"bandwidth\"` wins over the other values when senders disagree, because\n     * it is the only one a lower cap answers. Reacting to bandwidth on a\n     * machine that is actually CPU-bound buys a worse picture and no relief.\n     *\n     * The spec's `\"none\"` is reported as `null`: a consumer should not have to\n     * know that one of the truthy strings means \"nothing\".\n     */\n    limitedBy: RTCQualityLimitationReason | null;\n    /**\n     * Whether the link is travelling through a TURN relay.\n     *\n     * On a self-hosted mesh this is the hosting bill: a relayed stream goes up\n     * and down through the machine somebody is paying for, and the person who\n     * picked 4K is not that somebody.\n     *\n     * Resolved only from the pair the transport **names**, never from a merely\n     * `succeeded` one — guessing the route from a pair that carries nothing\n     * would report a cost nobody is paying.\n     */\n    relayed: boolean;\n}\n\n/** Which media a sampler counts. */\nexport type LinkStatsKind = \"video\" | \"audio\" | \"all\";\n\n/** Options for {@link createLinkStatsSampler}. */\nexport interface LinkStatsSamplerOptions {\n    /**\n     * Which media the throughput counts. Default `\"video\"`.\n     *\n     * Video is the default because it is what saturates an uplink — audio is an\n     * order of magnitude cheaper, and mixing it in moves the number by less than\n     * the noise between two samples. Use `\"all\"` when the figure is meant to be\n     * the connection's real cost rather than the picture's.\n     */\n    kind?: LinkStatsKind;\n}\n\n/**\n * A sampler bound to one connection.\n *\n * Holds the previous byte counter and timestamp, which is the whole reason this\n * is an object rather than a function: the rate is a delta, so somebody has to\n * remember the last reading. One sampler per link — sharing one across peers\n * subtracts one connection's counter from another's and reports nonsense.\n */\nexport interface LinkStatsSampler {\n    /**\n     * Reduce a report you already have.\n     *\n     * @param report - A report from `RTCPeerConnection.getStats()`.\n     * @returns The stats for this sample.\n     */\n    read: (report: RTCStatsReport) => LinkStats;\n    /**\n     * Fetch a report and reduce it.\n     *\n     * @param connection - The connection to sample.\n     * @returns The stats for this sample.\n     */\n    sample: (connection: RTCPeerConnection) => Promise<LinkStats>;\n    /**\n     * Drop the baseline the rate is derived from.\n     *\n     * Call it after an ICE restart, a reconnect, or a pause — otherwise the next\n     * sample divides the bytes of the whole gap by the whole gap and reports the\n     * average of a period nobody is asking about. The next reading comes back at\n     * `0` kbps and starts a fresh baseline; the resolution and round trip already\n     * on screen are kept, so the badge does not blank out.\n     */\n    reset: () => void;\n}\n\n/**\n * The three field readers below take an entry the collector has already\n * established is an object.\n *\n * A report is a `Map` whose values the browser fills, and nothing says they\n * have to be objects — a polyfill or a mock can put anything in there. That\n * check belongs at the door of the one loop that walks the report, not repeated\n * in each reader: three copies of the same guard means three branches no test\n * can reach past the first, and a reader that silently returns `null` for a\n * primitive hides the case instead of skipping it.\n */\ntype StatsEntry = Record<string, unknown>;\n\nfunction numberField(entry: StatsEntry, key: string): number | null {\n    const value: unknown = entry[key];\n    return typeof value === \"number\" && Number.isFinite(value) ? value : null;\n}\n\nfunction stringField(entry: StatsEntry, key: string): string | null {\n    const value: unknown = entry[key];\n    return typeof value === \"string\" ? value : null;\n}\n\nfunction booleanField(entry: StatsEntry, key: string): boolean | null {\n    const value: unknown = entry[key];\n    return typeof value === \"boolean\" ? value : null;\n}\n\n/**\n * Whether a string is one of the reasons the spec defines.\n *\n * `\"none\"` is deliberately not one of them here: the field it feeds reports\n * \"nothing is limiting\" as `null`, so a consumer never has to know that one of\n * the truthy strings means no.\n */\nfunction isLimitationReason(value: string | null): value is RTCQualityLimitationReason {\n    return value === \"bandwidth\" || value === \"cpu\" || value === \"other\";\n}\n\n/**\n * Resolve the media an RTP entry carries.\n *\n * `kind` is the standard field and `mediaType` is what older Chrome reported;\n * both are still in the wild, and a sampler that reads only one of them\n * silently counts nothing on the browser that uses the other.\n */\nfunction entryKind(entry: StatsEntry): string | null {\n    return stringField(entry, \"kind\") ?? stringField(entry, \"mediaType\");\n}\n\n/** What one candidate pair says about the path it describes. */\ninterface PairFacts {\n    id: string;\n    /** `true` when the browser marks this pair as the chosen one non-standardly. */\n    selected: boolean;\n    state: string | null;\n    rttMs: number | null;\n    availableKbps: number | null;\n    localCandidateId: string | null;\n}\n\n/** What one sender says about what it is sending. */\ninterface SenderFacts {\n    kind: string | null;\n    bytes: number;\n    width: number;\n    height: number;\n    fps: number;\n    limitedBy: RTCQualityLimitationReason | null;\n}\n\n/** Everything a single walk over a report yields. */\ninterface CollectedReport {\n    namedPairId: string | null;\n    pairs: PairFacts[];\n    relayCandidateIds: Set<string>;\n    senders: SenderFacts[];\n}\n\n/**\n * Reduce a report in **one** pass.\n *\n * One pass is the point rather than tidiness. Every field below lives in the\n * same report, and the pair the transport selected has to be resolved before\n * any of the path fields can be read — so a consumer that asks for round trip,\n * then throughput headroom, then whether the route is relayed, walks the same\n * report three times and resolves the same pair three times, per link, on every\n * tick. On a mesh of eight at one sample every two seconds that is the most\n * expensive recurring work in the call, on the device least able to pay it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The entries that matter, grouped.\n */\nfunction collect(report: RTCStatsReport): CollectedReport {\n    let namedPairId: string | null = null;\n    const pairs: PairFacts[] = [];\n    const relayCandidateIds = new Set<string>();\n    const senders: SenderFacts[] = [];\n\n    report.forEach((raw: unknown) => {\n        if (typeof raw !== \"object\" || raw === null) return;\n        const entry = raw as StatsEntry;\n        const type = stringField(entry, \"type\");\n        if (type === \"transport\") {\n            namedPairId = stringField(entry, \"selectedCandidatePairId\") ?? namedPairId;\n            return;\n        }\n        if (type === \"candidate-pair\") {\n            const seconds = numberField(entry, \"currentRoundTripTime\");\n            const bps = numberField(entry, \"availableOutgoingBitrate\");\n            pairs.push({\n                id: stringField(entry, \"id\") ?? \"\",\n                selected: booleanField(entry, \"selected\") === true,\n                state: stringField(entry, \"state\"),\n                rttMs: seconds === null ? null : seconds * 1000,\n                availableKbps: bps === null ? null : Math.round(bps / 1000),\n                localCandidateId: stringField(entry, \"localCandidateId\"),\n            });\n            return;\n        }\n        if (type === \"local-candidate\") {\n            const id = stringField(entry, \"id\");\n            if (id !== null && stringField(entry, \"candidateType\") === \"relay\") {\n                relayCandidateIds.add(id);\n            }\n            return;\n        }\n        if (type !== \"outbound-rtp\") return;\n        const reason = stringField(entry, \"qualityLimitationReason\");\n        senders.push({\n            kind: entryKind(entry),\n            bytes: numberField(entry, \"bytesSent\") ?? 0,\n            width: numberField(entry, \"frameWidth\") ?? 0,\n            height: numberField(entry, \"frameHeight\") ?? 0,\n            fps: Math.round(numberField(entry, \"framesPerSecond\") ?? 0),\n            limitedBy: isLimitationReason(reason) ? reason : null,\n        });\n    });\n\n    return { namedPairId, pairs, relayCandidateIds, senders };\n}\n\n/**\n * The candidate pair carrying the link, and how sure we are that it is.\n *\n * A connection routinely keeps several viable pairs alive at once — host,\n * server-reflexive, relayed — and only one of them carries traffic. Reading the\n * first `succeeded` pair makes a reading jump between paths that are not being\n * travelled: 8 ms on an idle host pair alternating with 180 ms on the TURN pair\n * doing the work.\n *\n * The chain is `transport.selectedCandidatePairId` → a pair flagged\n * `selected: true` → the first `succeeded` one. The middle step is not in the\n * spec and is there because an engine that fills neither the transport field\n * nor it does not appear to exist, while one that fills only the flag does: a\n * reader that skips straight to `succeeded` silently answers about the wrong\n * path there. The last step is a guess, and `named` says so — the fields where\n * guessing would report something false refuse it.\n *\n * @param collected - A collected report.\n * @returns The pair and whether the browser actually named it.\n */\nfunction carryingPair(collected: CollectedReport): { pair: PairFacts | null; named: boolean } {\n    const byId =\n        collected.namedPairId === null\n            ? undefined\n            : collected.pairs.find((pair) => pair.id === collected.namedPairId);\n    if (byId !== undefined) return { pair: byId, named: true };\n\n    const flagged = collected.pairs.find((pair) => pair.selected);\n    if (flagged !== undefined) return { pair: flagged, named: true };\n\n    const succeeded = collected.pairs.find((pair) => pair.state === \"succeeded\");\n    return { pair: succeeded ?? null, named: false };\n}\n\n/**\n * Read the round trip of the candidate pair actually carrying the link.\n *\n * A `succeeded` pair is kept as a last resort because not every browser names\n * the selected one — losing the reading entirely is worse than an occasionally\n * optimistic one. See {@link carryingPair} for the chain and why the middle\n * step exists.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns Round trip in milliseconds, rounded, or `null` when nothing reported\n *   one — which is the normal state before the connection settles.\n *\n * @example\n * const rttMs = readRoundTripMs(await pc.getStats());\n */\nexport function readRoundTripMs(report: RTCStatsReport): number | null {\n    return roundTripOf(collect(report));\n}\n\n/**\n * Read the uplink the transport estimates for this path, in kbps.\n *\n * This is the field that tells a cap being honoured apart from a cap that is\n * drowning: `bytesSent` reports the same 2500 kbps whether the path has room\n * for it or the queue behind it is growing. No fixed budget can stand in for it\n * — a domestic uplink of 1 Mbps and a fibre link differ by an order of\n * magnitude, and in Brazil the upload routinely is a tenth of the download\n * beside it.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The estimate in kbps, or `null` while there is none. Every reader\n *   needs a fallback for that, not a default of zero.\n *\n * @example\n * const headroom = readAvailableOutgoingKbps(await pc.getStats());\n * if (headroom !== null && headroom < asked) lowerTheCap(headroom);\n */\nexport function readAvailableOutgoingKbps(report: RTCStatsReport): number | null {\n    return availableOf(collect(report));\n}\n\n/**\n * Read what the encoder says is holding the picture back.\n *\n * `\"bandwidth\"` wins when senders disagree, because it is the only reason a\n * lower cap answers. The spec's `\"none\"` comes back as `null`.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns The reason, or `null` when nothing is limiting the picture.\n *\n * @example\n * if (readQualityLimitation(await pc.getStats()) === \"cpu\") stopBlurringTheBackground();\n */\nexport function readQualityLimitation(report: RTCStatsReport): RTCQualityLimitationReason | null {\n    return limitationOf(collect(report));\n}\n\n/**\n * Read whether the link is travelling through a TURN relay.\n *\n * Resolved only from the pair the browser names, never from a merely\n * `succeeded` one: a relayed route is somebody's hosting bill, and reporting\n * one from a pair that carries nothing bills a cost nobody is paying.\n *\n * @param report - A report from `RTCPeerConnection.getStats()`.\n * @returns `true` when the carrying pair's local candidate is a relay.\n *\n * @example\n * if (readRelayed(await pc.getStats())) capTheStreamThatCostsMoney();\n */\nexport function readRelayed(report: RTCStatsReport): boolean {\n    return relayedOf(collect(report));\n}\n\n/** Round trip of the carrying pair, in whole milliseconds. */\nfunction roundTripOf(collected: CollectedReport): number | null {\n    const withTiming: CollectedReport = {\n        ...collected,\n        pairs: collected.pairs.filter((pair) => pair.rttMs !== null),\n    };\n    const { pair } = carryingPair(withTiming);\n    return pair?.rttMs === undefined || pair.rttMs === null ? null : Math.round(pair.rttMs);\n}\n\n/** Estimated uplink of the carrying pair, in kbps. */\nfunction availableOf(collected: CollectedReport): number | null {\n    const { pair } = carryingPair(collected);\n    return pair?.availableKbps ?? null;\n}\n\n/** Whether the pair the browser named travels through a relay. */\nfunction relayedOf(collected: CollectedReport): boolean {\n    const { pair, named } = carryingPair(collected);\n    if (!named || pair === null || pair.localCandidateId === null) return false;\n    return collected.relayCandidateIds.has(pair.localCandidateId);\n}\n\n/** The strongest limitation any sender reports, with bandwidth winning. */\nfunction limitationOf(collected: CollectedReport): RTCQualityLimitationReason | null {\n    let found: RTCQualityLimitationReason | null = null;\n    for (const sender of collected.senders) {\n        if (sender.limitedBy === null) continue;\n        if (sender.limitedBy === \"bandwidth\") return \"bandwidth\";\n        found = found ?? sender.limitedBy;\n    }\n    return found;\n}\n\n/**\n * Track one link's throughput, resolution and round trip across samples.\n *\n * Every rate here is a **delta**. `bytesSent` is cumulative since the connection\n * opened, so dividing it by the session length gives the historical average —\n * a number that only ever falls and never shows what is happening now. The\n * previous reading is kept on the sampler and subtracted, which is the part\n * every hand-rolled copy of this ends up rewriting.\n *\n * Bytes are summed across every matching sender, because a peer publishing a\n * camera and a screen at once occupies one uplink with both — and the uplink is\n * what runs out. Resolution and frame rate come from the **largest** stream by\n * area, which is the one that dominates that bandwidth and the one somebody\n * watching the call is looking at.\n *\n * @param options - See {@link LinkStatsSamplerOptions}.\n * @returns A sampler. Use one per `RTCPeerConnection`.\n *\n * @example\n * const sampler = createLinkStatsSampler();\n *\n * setInterval(async () => {\n *   const stats = await sampler.sample(pc);\n *   badge.textContent = `${stats.kbps} kbps · ${stats.rttMs ?? \"—\"} ms`;\n * }, 2000);\n */\nexport function createLinkStatsSampler(options: LinkStatsSamplerOptions = {}): LinkStatsSampler {\n    const kind: LinkStatsKind = options.kind ?? \"video\";\n    let lastBytes: number | null = null;\n    let lastSampleAt = 0;\n    let last: LinkStats = {\n        kbps: 0,\n        width: 0,\n        height: 0,\n        fps: 0,\n        rttMs: null,\n        availableKbps: null,\n        limitedBy: null,\n        relayed: false,\n    };\n\n    function read(report: RTCStatsReport): LinkStats {\n        const now = performance.now();\n        const collected = collect(report);\n        const path = {\n            rttMs: roundTripOf(collected),\n            availableKbps: availableOf(collected),\n            limitedBy: limitationOf(collected),\n            relayed: relayedOf(collected),\n        };\n\n        let bytes = 0;\n        let sawSender = false;\n        let bestArea = 0;\n        let width = 0;\n        let height = 0;\n        let fps = 0;\n\n        for (const sender of collected.senders) {\n            if (kind !== \"all\" && sender.kind !== kind) continue;\n            sawSender = true;\n            bytes += sender.bytes;\n\n            const area = sender.width * sender.height;\n            if (area < bestArea) continue;\n            bestArea = area;\n            width = sender.width;\n            height = sender.height;\n            fps = sender.fps;\n        }\n\n        if (!sawSender) {\n            last = { ...last, ...path };\n            return last;\n        }\n\n        const elapsed = lastBytes === null ? 0 : (now - lastSampleAt) / 1000;\n        const delta = lastBytes === null ? 0 : bytes - lastBytes;\n        const kbps = elapsed > 0 && delta > 0 ? Math.round((delta * 8) / 1000 / elapsed) : 0;\n\n        lastBytes = bytes;\n        lastSampleAt = now;\n        last = {\n            kbps,\n            width: width > 0 ? width : last.width,\n            height: height > 0 ? height : last.height,\n            fps: fps > 0 ? fps : last.fps,\n            ...path,\n        };\n        return last;\n    }\n\n    return {\n        read,\n        sample: async (connection: RTCPeerConnection): Promise<LinkStats> =>\n            read(await connection.getStats()),\n        reset: (): void => {\n            lastBytes = null;\n            lastSampleAt = 0;\n            last = { ...last, kbps: 0 };\n        },\n    };\n}\n"],"mappings":";AA0HA,SAASA,EAAY,GAAmB,GAA4B;CAChE,IAAMC,IAAiBC,EAAMC;CAC7B,OAAO,OAAOF,KAAU,YAAY,OAAO,SAASA,CAAK,IAAIA,IAAQ;AACzE;AAEA,SAASG,EAAY,GAAmB,GAA4B;CAChE,IAAMH,IAAiBC,EAAMC;CAC7B,OAAO,OAAOF,KAAU,WAAWA,IAAQ;AAC/C;AAEA,SAASI,EAAa,GAAmB,GAA6B;CAClE,IAAMJ,IAAiBC,EAAMC;CAC7B,OAAO,OAAOF,KAAU,YAAYA,IAAQ;AAChD;AASA,SAASK,EAAmB,GAA2D;CACnF,OAAOL,MAAU,eAAeA,MAAU,SAASA,MAAU;AACjE;AASA,SAASM,EAAU,GAAkC;CACjD,OAAOH,EAAYF,GAAO,MAAM,KAAKE,EAAYF,GAAO,WAAW;AACvE;AA6CA,SAASM,EAAQ,GAAyC;CACtD,IAAIC,IAA6B,MAC3BC,IAAqB,CAAC,GACtBC,oBAAoB,IAAI,IAAY,GACpCC,IAAyB,CAAC;CA0ChC,OAxCAC,EAAO,SAAS,MAAiB;EAC7B,IAAI,OAAOC,KAAQ,aAAYA,GAAc;EAC7C,IAAMZ,IAAQY,GACRC,IAAOX,EAAYF,GAAO,MAAM;EACtC,IAAIa,MAAS,aAAa;GACtB,IAAcX,EAAYF,GAAO,yBAAyB,KAAKO;GAC/D;EACJ;EACA,IAAIM,MAAS,kBAAkB;GAC3B,IAAMC,IAAUhB,EAAYE,GAAO,sBAAsB,GACnDe,IAAMjB,EAAYE,GAAO,0BAA0B;GACzD,EAAM,KAAK;IACP,IAAIE,EAAYF,GAAO,IAAI,KAAK;IAChC,UAAUG,EAAaH,GAAO,UAAU,MAAM;IAC9C,OAAOE,EAAYF,GAAO,OAAO;IACjC,OAAOc,MAAY,OAAO,OAAOA,IAAU;IAC3C,eAAeC,MAAQ,OAAO,OAAO,KAAK,MAAMA,IAAM,GAAI;IAC1D,kBAAkBb,EAAYF,GAAO,kBAAkB;GAC3D,CAAC;GACD;EACJ;EACA,IAAIa,MAAS,mBAAmB;GAC5B,IAAMG,IAAKd,EAAYF,GAAO,IAAI;GAClC,AAAIgB,MAAO,QAAQd,EAAYF,GAAO,eAAe,MAAM,WACvDS,EAAkB,IAAIO,CAAE;GAE5B;EACJ;EACA,IAAIH,MAAS,gBAAgB;EAC7B,IAAMI,IAASf,EAAYF,GAAO,yBAAyB;EAC3D,EAAQ,KAAK;GACT,MAAMK,EAAUL,CAAK;GACrB,OAAOF,EAAYE,GAAO,WAAW,KAAK;GAC1C,OAAOF,EAAYE,GAAO,YAAY,KAAK;GAC3C,QAAQF,EAAYE,GAAO,aAAa,KAAK;GAC7C,KAAK,KAAK,MAAMF,EAAYE,GAAO,iBAAiB,KAAK,CAAC;GAC1D,WAAWI,EAAmBa,CAAM,IAAIA,IAAS;EACrD,CAAC;CACL,CAAC,GAEM;EAAE;EAAa;EAAO;EAAmB;CAAQ;AAC5D;AAsBA,SAASC,EAAa,GAAwE;CAC1F,IAAMC,IACFC,EAAU,gBAAgB,OACpB,KAAA,IACAA,EAAU,MAAM,MAAM,MAASC,EAAK,OAAOD,EAAU,WAAW;CAC1E,IAAID,MAAS,KAAA,GAAW,OAAO;EAAE,MAAMA;EAAM,OAAO;CAAK;CAEzD,IAAMG,IAAUF,EAAU,MAAM,MAAM,MAASC,EAAK,QAAQ;CAI5D,OAHIC,MAAY,KAAA,IAGT;EAAE,MADSF,EAAU,MAAM,MAAM,MAASC,EAAK,UAAU,WACjD,KAAa;EAAM,OAAO;CAAM,IAHb;EAAE,MAAMC;EAAS,OAAO;CAAK;AAInE;AAiBA,SAAgBC,EAAgB,GAAuC;CACnE,OAAOC,EAAYlB,EAAQK,CAAM,CAAC;AACtC;AAoBA,SAAgBc,EAA0B,GAAuC;CAC7E,OAAOC,EAAYpB,EAAQK,CAAM,CAAC;AACtC;AAcA,SAAgBgB,EAAsB,GAA2D;CAC7F,OAAOC,EAAatB,EAAQK,CAAM,CAAC;AACvC;AAeA,SAAgBkB,EAAY,GAAiC;CACzD,OAAOC,EAAUxB,EAAQK,CAAM,CAAC;AACpC;AAGA,SAASa,EAAY,GAA2C;CAK5D,IAAM,EAAE,YAASN,EAAa;EAH1B,GAAGE;EACH,OAAOA,EAAU,MAAM,QAAQ,MAASC,EAAK,UAAU,IAAI;CAEjC,CAAU;CACxC,OAAOA,GAAM,UAAU,KAAA,KAAaA,EAAK,UAAU,OAAO,OAAO,KAAK,MAAMA,EAAK,KAAK;AAC1F;AAGA,SAASK,EAAY,GAA2C;CAC5D,IAAM,EAAE,YAASR,EAAaE,CAAS;CACvC,OAAOC,GAAM,iBAAiB;AAClC;AAGA,SAASS,EAAU,GAAqC;CACpD,IAAM,EAAE,SAAM,aAAUZ,EAAaE,CAAS;CAE9C,OADI,CAACW,KAASV,MAAS,QAAQA,EAAK,qBAAqB,OAAa,KAC/DD,EAAU,kBAAkB,IAAIC,EAAK,gBAAgB;AAChE;AAGA,SAASO,EAAa,GAA+D;CACjF,IAAII,IAA2C;CAC/C,KAAK,IAAMC,KAAUb,EAAU,SAC3B,IAAIa,EAAO,cAAc,MACzB;MAAIA,EAAO,cAAc,aAAa,OAAO;EAC7C,MAAiBA,EAAO;CADqB;CAGjD,OAAOD;AACX;AA4BA,SAAgBE,EAAuB,IAAmC,CAAC,GAAqB;CAC5F,IAAMC,IAAsBC,EAAQ,QAAQ,SACxCC,IAA2B,MAC3BC,IAAe,GACfC,IAAkB;EAClB,MAAM;EACN,OAAO;EACP,QAAQ;EACR,KAAK;EACL,OAAO;EACP,eAAe;EACf,WAAW;EACX,SAAS;CACb;CAEA,SAASC,EAAK,GAAmC;EAC7C,IAAMC,IAAM,YAAY,IAAI,GACtBrB,IAAYd,EAAQK,CAAM,GAC1B+B,IAAO;GACT,OAAOlB,EAAYJ,CAAS;GAC5B,eAAeM,EAAYN,CAAS;GACpC,WAAWQ,EAAaR,CAAS;GACjC,SAASU,EAAUV,CAAS;EAChC,GAEIuB,IAAQ,GACRC,IAAY,IACZC,IAAW,GACXC,IAAQ,GACRC,IAAS,GACTC,IAAM;EAEV,KAAK,IAAMf,KAAUb,EAAU,SAAS;GACpC,IAAIe,MAAS,SAASF,EAAO,SAASE,GAAM;GAE5C,AADA,IAAY,IACZ,KAASF,EAAO;GAEhB,IAAMgB,IAAOhB,EAAO,QAAQA,EAAO;GACnC,AAAIgB,IAAOJ,MACX,IAAWI,GACX,IAAQhB,EAAO,OACf,IAASA,EAAO,QAChB,IAAMA,EAAO;EACjB;EAEA,IAAI,CAACW,GAED,OADA,IAAO;GAAE,GAAGL;GAAM,GAAGG;EAAK,GACnBH;EAGX,IAAMW,IAAUb,MAAc,OAAO,KAAKI,IAAMH,KAAgB,KAC1Da,IAAQd,MAAc,OAAO,IAAIM,IAAQN,GACzCe,IAAOF,IAAU,KAAKC,IAAQ,IAAI,KAAK,MAAOA,IAAQ,IAAK,MAAOD,CAAO,IAAI;EAWnF,OATA,IAAYP,GACZ,IAAeF,GACf,IAAO;GACH;GACA,OAAOK,IAAQ,IAAIA,IAAQP,EAAK;GAChC,QAAQQ,IAAS,IAAIA,IAASR,EAAK;GACnC,KAAKS,IAAM,IAAIA,IAAMT,EAAK;GAC1B,GAAGG;EACP,GACOH;CACX;CAEA,OAAO;EACH;EACA,QAAQ,OAAO,MACXC,EAAK,MAAMa,EAAW,SAAS,CAAC;EACpC,aAAmB;GAGf,AAFA,IAAY,MACZ,IAAe,GACf,IAAO;IAAE,GAAGd;IAAM,MAAM;GAAE;EAC9B;CACJ;AACJ"}

package/dist/webrtc/mesh-quality.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"mesh-quality.cjs","names":[],"sources":["../../src/webrtc/mesh-quality.ts"],"sourcesContent":["import { setSenderBitrate } from \"./sender-bitrate\";\nimport type { MeshQuality, MeshSlot } from \"./mesh-types\";\n\n/** Uplink assumed available when the caller names no budget, in kbps. */\nconst DEFAULT_UPLINK_BUDGET_KBPS = 6000;\n\n/** Floor a video slot keeps after the division, in kbps. */\nconst DEFAULT_MIN_VIDEO_KBPS = 300;\n\n/** Budget below which `maintain-framerate` stops being worth holding, in kbps. */\nconst DEFAULT_FLUID_FLOOR_KBPS = 900;\n\n/**\n * Divide the video caps by the size of the room.\n *\n * A mesh sends one copy of everything per participant, so the uplink is the\n * shared resource and the caps are what compete for it. Nothing is divided while\n * the caller is alone with one peer — that is the case the largest sizes exist\n * for, and dividing a budget that is not being shared would make them\n * unreachable in the only call where they fit.\n *\n * The floor is what keeps the division honest: without it a busy room allocates\n * tens of kbps per stream, and everybody loses the picture instead of the excess\n * giving way.\n *\n * @param quality - The caps as asked for.\n * @param peers - How many links are live.\n * @returns The caps to actually apply. The input is never mutated, so a room\n *     that empties out climbs back to what was asked for.\n */\nexport function scaleForRoom(quality: MeshQuality, peers: number): MeshQuality {\n    const video = quality.video ?? {};\n    if (peers <= 1) return quality;\n\n    const asked = Object.values(video).reduce<number>((sum, cap) => sum + (cap ?? 0), 0);\n    if (asked === 0) return quality;\n\n    const perPeer = (quality.uplinkBudgetKbps ?? DEFAULT_UPLINK_BUDGET_KBPS) / peers;\n    if (asked <= perPeer) return quality;\n\n    const floor = quality.minVideoKbps ?? DEFAULT_MIN_VIDEO_KBPS;\n    const factor = perPeer / asked;\n    const scaled: Record<string, number | null> = {};\n    for (const [slot, cap] of Object.entries(video)) {\n        scaled[slot] = cap === null ? null : Math.max(floor, Math.round(cap * factor));\n    }\n    return { ...quality, video: scaled };\n}\n\n/**\n * Decide what the encoder gives up, letting physics override the preference.\n *\n * `maintain-framerate` is honoured while there are bits enough for the frames to\n * be worth keeping. Once the room's division has taken the budget below the\n * fluid floor, holding the rate halves what each frame receives and the picture\n * is worse than the lower rate it replaced — so below that line the preference\n * is overridden rather than obeyed.\n *\n * Two things decide *which* budget answers that question:\n *\n * - **`null` is the most generous case, not the absent one.** A slot with no cap\n *   is unbounded, which is exactly where fluidity should hold. Reading it as\n *   missing — and then deciding from a modest camera beside it — is the answer\n *   backwards.\n * - **{@link MeshQuality.degradationAnchor} names the slot the choice was\n *   about.** Without it the largest cap across the video slots answers, which\n *   is right when the slots are interchangeable and wrong when they are not.\n *\n * @param quality - What was asked for, including the anchor and the floor.\n * @param effective - What the room's share actually allows.\n * @returns The degradation preference to write onto the senders, or `undefined`\n *     when the caller expressed no preference.\n */\nexport function resolveDegradation(\n    quality: MeshQuality,\n    effective: MeshQuality,\n): RTCDegradationPreference | undefined {\n    const asked = quality.degradationPreference;\n    if (asked !== \"maintain-framerate\") return asked;\n\n    const video = effective.video ?? {};\n    const floor = quality.fluidFloorKbps ?? DEFAULT_FLUID_FLOOR_KBPS;\n    const anchor = quality.degradationAnchor;\n\n    if (anchor !== undefined) {\n        if (!(anchor in video)) return asked;\n        const cap = video[anchor];\n        if (cap === null) return asked;\n        return cap >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n    }\n\n    const caps = Object.values(video);\n    if (caps.length === 0) return asked;\n    if (caps.some((cap) => cap === null)) return asked;\n\n    const budget = Math.max(...caps.filter((cap): cap is number => cap !== null));\n    return budget >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n}\n\n/**\n * Read a video sender's parameters back with the motion settings written on.\n *\n * Read fresh on every call because `setParameters` only accepts the object the\n * **same** sender's `getParameters` returned, so a rejected attempt cannot be\n * retried with the object that was rejected.\n *\n * @param sender - The video sender to read from.\n * @param degradation - What to give up first, or `undefined` to leave it alone.\n * @param fps - Frame ceiling, or `undefined` to leave it alone.\n * @returns Parameters ready to be written back to `sender`.\n */\nfunction videoParameters(\n    sender: RTCRtpSender,\n    degradation: RTCDegradationPreference | undefined,\n    fps: number | undefined,\n): RTCRtpSendParameters {\n    const params = sender.getParameters();\n    if (degradation !== undefined) params.degradationPreference = degradation;\n    if (fps !== undefined) {\n        for (const encoding of params.encodings ?? []) encoding.maxFramerate = fps;\n    }\n    return params;\n}\n\n/**\n * Write the quality settings onto one link's senders.\n *\n * `degradationPreference` goes only on video: it describes trading resolution\n * against frame rate, which an audio sender has no analogue for, and some\n * browsers reject it outright there.\n *\n * The retry without `degradationPreference` is for Firefox, which rejects the\n * member entirely — sending both together would lose the frame-rate cap to an\n * objection about something else.\n *\n * @param transceivers - The link's transceivers, in slot order.\n * @param slots - The slot list those transceivers were allocated from.\n * @param effective - Caps after the room's division.\n * @param degradation - Already resolved against the fluid floor.\n */\nexport async function applyQualityToLink(\n    transceivers: readonly RTCRtpTransceiver[],\n    slots: readonly MeshSlot[],\n    effective: MeshQuality,\n    degradation: RTCDegradationPreference | undefined,\n): Promise<void> {\n    for (const [index, slot] of slots.entries()) {\n        const sender = transceivers[index]?.sender;\n        if (!sender) continue;\n\n        if (slot.kind === \"audio\") {\n            const bps = effective.audio?.[slot.name];\n            if (bps !== undefined) await setSenderBitrate(sender, bps);\n            continue;\n        }\n\n        const kbps = effective.video?.[slot.name];\n        if (kbps !== undefined) await setSenderBitrate(sender, kbps === null ? null : kbps * 1000);\n\n        if (degradation === undefined && effective.maxFramerate === undefined) continue;\n        try {\n            await sender.setParameters(\n                videoParameters(sender, degradation, effective.maxFramerate),\n            );\n        } catch {\n            try {\n                await sender.setParameters(\n                    videoParameters(sender, undefined, effective.maxFramerate),\n                );\n            } catch {\n                /* the sender refused both; the bitrate cap above still applies */\n            }\n        }\n    }\n}\n"],"mappings":"wCAIA,IAAM,EAA6B,IAG7B,EAAyB,IAGzB,EAA2B,IAoBjC,SAAgB,EAAa,EAAsB,EAA4B,CAC3E,IAAM,EAAQ,EAAQ,OAAS,CAAC,EAChC,GAAI,GAAS,EAAG,OAAO,EAEvB,IAAM,EAAQ,OAAO,OAAO,CAAK,CAAC,CAAC,QAAgB,EAAK,IAAQ,GAAO,GAAO,GAAI,CAAC,EACnF,GAAI,IAAU,EAAG,OAAO,EAExB,IAAM,GAAW,EAAQ,kBAAoB,GAA8B,EAC3E,GAAI,GAAS,EAAS,OAAO,EAE7B,IAAM,EAAQ,EAAQ,cAAgB,EAChC,EAAS,EAAU,EACnB,EAAwC,CAAC,EAC/C,IAAK,GAAM,CAAC,EAAM,KAAQ,OAAO,QAAQ,CAAK,EAC1C,EAAO,GAAQ,IAAQ,KAAO,KAAO,KAAK,IAAI,EAAO,KAAK,MAAM,EAAM,CAAM,CAAC,EAEjF,MAAO,CAAE,GAAG,EAAS,MAAO,CAAO,CACvC,CA0BA,SAAgB,EACZ,EACA,EACoC,CACpC,IAAM,EAAQ,EAAQ,sBACtB,GAAI,IAAU,qBAAsB,OAAO,EAE3C,IAAM,EAAQ,EAAU,OAAS,CAAC,EAC5B,EAAQ,EAAQ,gBAAkB,EAClC,EAAS,EAAQ,kBAEvB,GAAI,IAAW,IAAA,GAAW,CACtB,GAAI,EAAE,KAAU,GAAQ,OAAO,EAC/B,IAAM,EAAM,EAAM,GAElB,OADI,IAAQ,KAAa,EAClB,GAAO,EAAQ,qBAAuB,qBACjD,CAEA,IAAM,EAAO,OAAO,OAAO,CAAK,EAKhC,OAJI,EAAK,SAAW,GAChB,EAAK,KAAM,GAAQ,IAAQ,IAAI,EAAU,EAE9B,KAAK,IAAI,GAAG,EAAK,OAAQ,GAAuB,IAAQ,IAAI,CACpE,GAAU,EAAQ,qBAAuB,qBACpD,CAcA,SAAS,EACL,EACA,EACA,EACoB,CACpB,IAAM,EAAS,EAAO,cAAc,EAEpC,GADI,IAAgB,IAAA,KAAW,EAAO,sBAAwB,GAC1D,IAAQ,IAAA,GACR,IAAK,IAAM,KAAY,EAAO,WAAa,CAAC,EAAG,EAAS,aAAe,EAE3E,OAAO,CACX,CAkBA,eAAsB,EAClB,EACA,EACA,EACA,EACa,CACb,IAAK,GAAM,CAAC,EAAO,KAAS,EAAM,QAAQ,EAAG,CACzC,IAAM,EAAS,EAAa,EAAM,EAAE,OACpC,GAAI,CAAC,EAAQ,SAEb,GAAI,EAAK,OAAS,QAAS,CACvB,IAAM,EAAM,EAAU,QAAQ,EAAK,MAC/B,IAAQ,IAAA,IAAW,MAAM,EAAA,iBAAiB,EAAQ,CAAG,EACzD,QACJ,CAEA,IAAM,EAAO,EAAU,QAAQ,EAAK,MACpC,GAAI,IAAS,IAAA,IAAW,MAAM,EAAA,iBAAiB,EAAQ,IAAS,KAAO,KAAO,EAAO,GAAI,EAErF,IAAgB,IAAA,IAAa,EAAU,eAAiB,IAAA,GAC5D,GAAI,CACA,MAAM,EAAO,cACT,EAAgB,EAAQ,EAAa,EAAU,YAAY,CAC/D,CACJ,MAAQ,CACJ,GAAI,CACA,MAAM,EAAO,cACT,EAAgB,EAAQ,IAAA,GAAW,EAAU,YAAY,CAC7D,CACJ,MAAQ,CAER,CACJ,CACJ,CACJ"}
+{"version":3,"file":"mesh-quality.cjs","names":["setSenderBitrate","require_sender_bitrate","DEFAULT_UPLINK_BUDGET_KBPS","DEFAULT_MIN_VIDEO_KBPS","DEFAULT_FLUID_FLOOR_KBPS","scaleForRoom","video","quality","peers","asked","sum","cap","perPeer","floor","factor","scaled","slot","resolveDegradation","effective","anchor","caps","videoParameters","params","sender","degradation","fps","encoding","applyQualityToLink","index","slots","transceivers","bps","kbps"],"sources":["../../src/webrtc/mesh-quality.ts"],"sourcesContent":["import { setSenderBitrate } from \"./sender-bitrate\";\nimport type { MeshQuality, MeshSlot } from \"./mesh-types\";\n\n/** Uplink assumed available when the caller names no budget, in kbps. */\nconst DEFAULT_UPLINK_BUDGET_KBPS = 6000;\n\n/** Floor a video slot keeps after the division, in kbps. */\nconst DEFAULT_MIN_VIDEO_KBPS = 300;\n\n/** Budget below which `maintain-framerate` stops being worth holding, in kbps. */\nconst DEFAULT_FLUID_FLOOR_KBPS = 900;\n\n/**\n * Divide the video caps by the size of the room.\n *\n * A mesh sends one copy of everything per participant, so the uplink is the\n * shared resource and the caps are what compete for it. Nothing is divided while\n * the caller is alone with one peer — that is the case the largest sizes exist\n * for, and dividing a budget that is not being shared would make them\n * unreachable in the only call where they fit.\n *\n * The floor is what keeps the division honest: without it a busy room allocates\n * tens of kbps per stream, and everybody loses the picture instead of the excess\n * giving way.\n *\n * @param quality - The caps as asked for.\n * @param peers - How many links are live.\n * @returns The caps to actually apply. The input is never mutated, so a room\n *     that empties out climbs back to what was asked for.\n */\nexport function scaleForRoom(quality: MeshQuality, peers: number): MeshQuality {\n    const video = quality.video ?? {};\n    if (peers <= 1) return quality;\n\n    const asked = Object.values(video).reduce<number>((sum, cap) => sum + (cap ?? 0), 0);\n    if (asked === 0) return quality;\n\n    const perPeer = (quality.uplinkBudgetKbps ?? DEFAULT_UPLINK_BUDGET_KBPS) / peers;\n    if (asked <= perPeer) return quality;\n\n    const floor = quality.minVideoKbps ?? DEFAULT_MIN_VIDEO_KBPS;\n    const factor = perPeer / asked;\n    const scaled: Record<string, number | null> = {};\n    for (const [slot, cap] of Object.entries(video)) {\n        scaled[slot] = cap === null ? null : Math.max(floor, Math.round(cap * factor));\n    }\n    return { ...quality, video: scaled };\n}\n\n/**\n * Decide what the encoder gives up, letting physics override the preference.\n *\n * `maintain-framerate` is honoured while there are bits enough for the frames to\n * be worth keeping. Once the room's division has taken the budget below the\n * fluid floor, holding the rate halves what each frame receives and the picture\n * is worse than the lower rate it replaced — so below that line the preference\n * is overridden rather than obeyed.\n *\n * Two things decide *which* budget answers that question:\n *\n * - **`null` is the most generous case, not the absent one.** A slot with no cap\n *   is unbounded, which is exactly where fluidity should hold. Reading it as\n *   missing — and then deciding from a modest camera beside it — is the answer\n *   backwards.\n * - **{@link MeshQuality.degradationAnchor} names the slot the choice was\n *   about.** Without it the largest cap across the video slots answers, which\n *   is right when the slots are interchangeable and wrong when they are not.\n *\n * @param quality - What was asked for, including the anchor and the floor.\n * @param effective - What the room's share actually allows.\n * @returns The degradation preference to write onto the senders, or `undefined`\n *     when the caller expressed no preference.\n */\nexport function resolveDegradation(\n    quality: MeshQuality,\n    effective: MeshQuality,\n): RTCDegradationPreference | undefined {\n    const asked = quality.degradationPreference;\n    if (asked !== \"maintain-framerate\") return asked;\n\n    const video = effective.video ?? {};\n    const floor = quality.fluidFloorKbps ?? DEFAULT_FLUID_FLOOR_KBPS;\n    const anchor = quality.degradationAnchor;\n\n    if (anchor !== undefined) {\n        if (!(anchor in video)) return asked;\n        const cap = video[anchor];\n        if (cap === null) return asked;\n        return cap >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n    }\n\n    const caps = Object.values(video);\n    if (caps.length === 0) return asked;\n    if (caps.some((cap) => cap === null)) return asked;\n\n    const budget = Math.max(...caps.filter((cap): cap is number => cap !== null));\n    return budget >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n}\n\n/**\n * Read a video sender's parameters back with the motion settings written on.\n *\n * Read fresh on every call because `setParameters` only accepts the object the\n * **same** sender's `getParameters` returned, so a rejected attempt cannot be\n * retried with the object that was rejected.\n *\n * @param sender - The video sender to read from.\n * @param degradation - What to give up first, or `undefined` to leave it alone.\n * @param fps - Frame ceiling, or `undefined` to leave it alone.\n * @returns Parameters ready to be written back to `sender`.\n */\nfunction videoParameters(\n    sender: RTCRtpSender,\n    degradation: RTCDegradationPreference | undefined,\n    fps: number | undefined,\n): RTCRtpSendParameters {\n    const params = sender.getParameters();\n    if (degradation !== undefined) params.degradationPreference = degradation;\n    if (fps !== undefined) {\n        for (const encoding of params.encodings ?? []) encoding.maxFramerate = fps;\n    }\n    return params;\n}\n\n/**\n * Write the quality settings onto one link's senders.\n *\n * `degradationPreference` goes only on video: it describes trading resolution\n * against frame rate, which an audio sender has no analogue for, and some\n * browsers reject it outright there.\n *\n * The retry without `degradationPreference` is for Firefox, which rejects the\n * member entirely — sending both together would lose the frame-rate cap to an\n * objection about something else.\n *\n * @param transceivers - The link's transceivers, in slot order.\n * @param slots - The slot list those transceivers were allocated from.\n * @param effective - Caps after the room's division.\n * @param degradation - Already resolved against the fluid floor.\n */\nexport async function applyQualityToLink(\n    transceivers: readonly RTCRtpTransceiver[],\n    slots: readonly MeshSlot[],\n    effective: MeshQuality,\n    degradation: RTCDegradationPreference | undefined,\n): Promise<void> {\n    for (const [index, slot] of slots.entries()) {\n        const sender = transceivers[index]?.sender;\n        if (!sender) continue;\n\n        if (slot.kind === \"audio\") {\n            const bps = effective.audio?.[slot.name];\n            if (bps !== undefined) await setSenderBitrate(sender, bps);\n            continue;\n        }\n\n        const kbps = effective.video?.[slot.name];\n        if (kbps !== undefined) await setSenderBitrate(sender, kbps === null ? null : kbps * 1000);\n\n        if (degradation === undefined && effective.maxFramerate === undefined) continue;\n        try {\n            await sender.setParameters(\n                videoParameters(sender, degradation, effective.maxFramerate),\n            );\n        } catch {\n            try {\n                await sender.setParameters(\n                    videoParameters(sender, undefined, effective.maxFramerate),\n                );\n            } catch {\n                /* the sender refused both; the bitrate cap above still applies */\n            }\n        }\n    }\n}\n"],"mappings":"A,wCAIA,IAAME,EAA6B,IAG7BC,EAAyB,IAGzBC,EAA2B,IAoBjC,SAAgBC,EAAa,EAAsB,EAA4B,CAC3E,IAAMC,EAAQC,EAAQ,OAAS,CAAC,EAChC,GAAIC,GAAS,EAAG,OAAOD,EAEvB,IAAME,EAAQ,OAAO,OAAOH,CAAK,CAAC,CAAC,QAAgB,EAAK,IAAQI,GAAOC,GAAO,GAAI,CAAC,EACnF,GAAIF,IAAU,EAAG,OAAOF,EAExB,IAAMK,GAAWL,EAAQ,kBAAoBL,GAA8BM,EAC3E,GAAIC,GAASG,EAAS,OAAOL,EAE7B,IAAMM,EAAQN,EAAQ,cAAgBJ,EAChCW,EAASF,EAAUH,EACnBM,EAAwC,CAAC,EAC/C,IAAK,GAAM,CAACC,EAAML,KAAQ,OAAO,QAAQL,CAAK,EAC1C,EAAOU,GAAQL,IAAQ,KAAO,KAAO,KAAK,IAAIE,EAAO,KAAK,MAAMF,EAAMG,CAAM,CAAC,EAEjF,MAAO,CAAE,GAAGP,EAAS,MAAOQ,CAAO,CACvC,CA0BA,SAAgBE,EACZ,EACA,EACoC,CACpC,IAAMR,EAAQF,EAAQ,sBACtB,GAAIE,IAAU,qBAAsB,OAAOA,EAE3C,IAAMH,EAAQY,EAAU,OAAS,CAAC,EAC5BL,EAAQN,EAAQ,gBAAkBH,EAClCe,EAASZ,EAAQ,kBAEvB,GAAIY,IAAW,IAAA,GAAW,CACtB,GAAI,EAAEA,KAAUb,GAAQ,OAAOG,EAC/B,IAAME,EAAML,EAAMa,GAElB,OADIR,IAAQ,KAAaF,EAClBE,GAAOE,EAAQ,qBAAuB,qBACjD,CAEA,IAAMO,EAAO,OAAO,OAAOd,CAAK,EAKhC,OAJIc,EAAK,SAAW,GAChBA,EAAK,KAAM,GAAQT,IAAQ,IAAI,EAAUF,EAE9B,KAAK,IAAI,GAAGW,EAAK,OAAQ,GAAuBT,IAAQ,IAAI,CACpE,GAAUE,EAAQ,qBAAuB,qBACpD,CAcA,SAASQ,EACL,EACA,EACA,EACoB,CACpB,IAAMC,EAASC,EAAO,cAAc,EAEpC,GADIC,IAAgB,IAAA,KAAW,EAAO,sBAAwBA,GAC1DC,IAAQ,IAAA,GACR,IAAK,IAAMC,KAAYJ,EAAO,WAAa,CAAC,EAAG,EAAS,aAAeG,EAE3E,OAAOH,CACX,CAkBA,eAAsBK,EAClB,EACA,EACA,EACA,EACa,CACb,IAAK,GAAM,CAACC,EAAOZ,KAASa,EAAM,QAAQ,EAAG,CACzC,IAAMN,EAASO,EAAaF,EAAM,EAAE,OACpC,GAAI,CAACL,EAAQ,SAEb,GAAIP,EAAK,OAAS,QAAS,CACvB,IAAMe,EAAMb,EAAU,QAAQF,EAAK,MAC/Be,IAAQ,IAAA,IAAW,MAAM/B,EAAAA,iBAAiBuB,EAAQQ,CAAG,EACzD,QACJ,CAEA,IAAMC,EAAOd,EAAU,QAAQF,EAAK,MAGpC,GAFIgB,IAAS,IAAA,IAAW,MAAMhC,EAAAA,iBAAiBuB,EAAQS,IAAS,KAAO,KAAOA,EAAO,GAAI,EAErFR,IAAgB,IAAA,IAAaN,EAAU,eAAiB,IAAA,GAC5D,GAAI,CACA,MAAMK,EAAO,cACTF,EAAgBE,EAAQC,EAAaN,EAAU,YAAY,CAC/D,CACJ,MAAQ,CACJ,GAAI,CACA,MAAMK,EAAO,cACTF,EAAgBE,EAAQ,IAAA,GAAWL,EAAU,YAAY,CAC7D,CACJ,MAAQ,CAER,CACJ,CACJ,CACJ,C"}

package/dist/webrtc/mesh-quality.js.map

@@ -1 +1 @@
-{"version":3,"file":"mesh-quality.js","names":[],"sources":["../../src/webrtc/mesh-quality.ts"],"sourcesContent":["import { setSenderBitrate } from \"./sender-bitrate\";\nimport type { MeshQuality, MeshSlot } from \"./mesh-types\";\n\n/** Uplink assumed available when the caller names no budget, in kbps. */\nconst DEFAULT_UPLINK_BUDGET_KBPS = 6000;\n\n/** Floor a video slot keeps after the division, in kbps. */\nconst DEFAULT_MIN_VIDEO_KBPS = 300;\n\n/** Budget below which `maintain-framerate` stops being worth holding, in kbps. */\nconst DEFAULT_FLUID_FLOOR_KBPS = 900;\n\n/**\n * Divide the video caps by the size of the room.\n *\n * A mesh sends one copy of everything per participant, so the uplink is the\n * shared resource and the caps are what compete for it. Nothing is divided while\n * the caller is alone with one peer — that is the case the largest sizes exist\n * for, and dividing a budget that is not being shared would make them\n * unreachable in the only call where they fit.\n *\n * The floor is what keeps the division honest: without it a busy room allocates\n * tens of kbps per stream, and everybody loses the picture instead of the excess\n * giving way.\n *\n * @param quality - The caps as asked for.\n * @param peers - How many links are live.\n * @returns The caps to actually apply. The input is never mutated, so a room\n *     that empties out climbs back to what was asked for.\n */\nexport function scaleForRoom(quality: MeshQuality, peers: number): MeshQuality {\n    const video = quality.video ?? {};\n    if (peers <= 1) return quality;\n\n    const asked = Object.values(video).reduce<number>((sum, cap) => sum + (cap ?? 0), 0);\n    if (asked === 0) return quality;\n\n    const perPeer = (quality.uplinkBudgetKbps ?? DEFAULT_UPLINK_BUDGET_KBPS) / peers;\n    if (asked <= perPeer) return quality;\n\n    const floor = quality.minVideoKbps ?? DEFAULT_MIN_VIDEO_KBPS;\n    const factor = perPeer / asked;\n    const scaled: Record<string, number | null> = {};\n    for (const [slot, cap] of Object.entries(video)) {\n        scaled[slot] = cap === null ? null : Math.max(floor, Math.round(cap * factor));\n    }\n    return { ...quality, video: scaled };\n}\n\n/**\n * Decide what the encoder gives up, letting physics override the preference.\n *\n * `maintain-framerate` is honoured while there are bits enough for the frames to\n * be worth keeping. Once the room's division has taken the budget below the\n * fluid floor, holding the rate halves what each frame receives and the picture\n * is worse than the lower rate it replaced — so below that line the preference\n * is overridden rather than obeyed.\n *\n * Two things decide *which* budget answers that question:\n *\n * - **`null` is the most generous case, not the absent one.** A slot with no cap\n *   is unbounded, which is exactly where fluidity should hold. Reading it as\n *   missing — and then deciding from a modest camera beside it — is the answer\n *   backwards.\n * - **{@link MeshQuality.degradationAnchor} names the slot the choice was\n *   about.** Without it the largest cap across the video slots answers, which\n *   is right when the slots are interchangeable and wrong when they are not.\n *\n * @param quality - What was asked for, including the anchor and the floor.\n * @param effective - What the room's share actually allows.\n * @returns The degradation preference to write onto the senders, or `undefined`\n *     when the caller expressed no preference.\n */\nexport function resolveDegradation(\n    quality: MeshQuality,\n    effective: MeshQuality,\n): RTCDegradationPreference | undefined {\n    const asked = quality.degradationPreference;\n    if (asked !== \"maintain-framerate\") return asked;\n\n    const video = effective.video ?? {};\n    const floor = quality.fluidFloorKbps ?? DEFAULT_FLUID_FLOOR_KBPS;\n    const anchor = quality.degradationAnchor;\n\n    if (anchor !== undefined) {\n        if (!(anchor in video)) return asked;\n        const cap = video[anchor];\n        if (cap === null) return asked;\n        return cap >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n    }\n\n    const caps = Object.values(video);\n    if (caps.length === 0) return asked;\n    if (caps.some((cap) => cap === null)) return asked;\n\n    const budget = Math.max(...caps.filter((cap): cap is number => cap !== null));\n    return budget >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n}\n\n/**\n * Read a video sender's parameters back with the motion settings written on.\n *\n * Read fresh on every call because `setParameters` only accepts the object the\n * **same** sender's `getParameters` returned, so a rejected attempt cannot be\n * retried with the object that was rejected.\n *\n * @param sender - The video sender to read from.\n * @param degradation - What to give up first, or `undefined` to leave it alone.\n * @param fps - Frame ceiling, or `undefined` to leave it alone.\n * @returns Parameters ready to be written back to `sender`.\n */\nfunction videoParameters(\n    sender: RTCRtpSender,\n    degradation: RTCDegradationPreference | undefined,\n    fps: number | undefined,\n): RTCRtpSendParameters {\n    const params = sender.getParameters();\n    if (degradation !== undefined) params.degradationPreference = degradation;\n    if (fps !== undefined) {\n        for (const encoding of params.encodings ?? []) encoding.maxFramerate = fps;\n    }\n    return params;\n}\n\n/**\n * Write the quality settings onto one link's senders.\n *\n * `degradationPreference` goes only on video: it describes trading resolution\n * against frame rate, which an audio sender has no analogue for, and some\n * browsers reject it outright there.\n *\n * The retry without `degradationPreference` is for Firefox, which rejects the\n * member entirely — sending both together would lose the frame-rate cap to an\n * objection about something else.\n *\n * @param transceivers - The link's transceivers, in slot order.\n * @param slots - The slot list those transceivers were allocated from.\n * @param effective - Caps after the room's division.\n * @param degradation - Already resolved against the fluid floor.\n */\nexport async function applyQualityToLink(\n    transceivers: readonly RTCRtpTransceiver[],\n    slots: readonly MeshSlot[],\n    effective: MeshQuality,\n    degradation: RTCDegradationPreference | undefined,\n): Promise<void> {\n    for (const [index, slot] of slots.entries()) {\n        const sender = transceivers[index]?.sender;\n        if (!sender) continue;\n\n        if (slot.kind === \"audio\") {\n            const bps = effective.audio?.[slot.name];\n            if (bps !== undefined) await setSenderBitrate(sender, bps);\n            continue;\n        }\n\n        const kbps = effective.video?.[slot.name];\n        if (kbps !== undefined) await setSenderBitrate(sender, kbps === null ? null : kbps * 1000);\n\n        if (degradation === undefined && effective.maxFramerate === undefined) continue;\n        try {\n            await sender.setParameters(\n                videoParameters(sender, degradation, effective.maxFramerate),\n            );\n        } catch {\n            try {\n                await sender.setParameters(\n                    videoParameters(sender, undefined, effective.maxFramerate),\n                );\n            } catch {\n                /* the sender refused both; the bitrate cap above still applies */\n            }\n        }\n    }\n}\n"],"mappings":";;AAIA,IAAM,IAA6B,KAG7B,IAAyB,KAGzB,IAA2B;AAoBjC,SAAgB,EAAa,GAAsB,GAA4B;CAC3E,IAAM,IAAQ,EAAQ,SAAS,CAAC;CAChC,IAAI,KAAS,GAAG,OAAO;CAEvB,IAAM,IAAQ,OAAO,OAAO,CAAK,CAAC,CAAC,QAAgB,GAAK,MAAQ,KAAO,KAAO,IAAI,CAAC;CACnF,IAAI,MAAU,GAAG,OAAO;CAExB,IAAM,KAAW,EAAQ,oBAAoB,KAA8B;CAC3E,IAAI,KAAS,GAAS,OAAO;CAE7B,IAAM,IAAQ,EAAQ,gBAAgB,GAChC,IAAS,IAAU,GACnB,IAAwC,CAAC;CAC/C,KAAK,IAAM,CAAC,GAAM,MAAQ,OAAO,QAAQ,CAAK,GAC1C,EAAO,KAAQ,MAAQ,OAAO,OAAO,KAAK,IAAI,GAAO,KAAK,MAAM,IAAM,CAAM,CAAC;CAEjF,OAAO;EAAE,GAAG;EAAS,OAAO;CAAO;AACvC;AA0BA,SAAgB,EACZ,GACA,GACoC;CACpC,IAAM,IAAQ,EAAQ;CACtB,IAAI,MAAU,sBAAsB,OAAO;CAE3C,IAAM,IAAQ,EAAU,SAAS,CAAC,GAC5B,IAAQ,EAAQ,kBAAkB,GAClC,IAAS,EAAQ;CAEvB,IAAI,MAAW,KAAA,GAAW;EACtB,IAAI,EAAE,KAAU,IAAQ,OAAO;EAC/B,IAAM,IAAM,EAAM;EAElB,OADI,MAAQ,OAAa,IAClB,KAAO,IAAQ,uBAAuB;CACjD;CAEA,IAAM,IAAO,OAAO,OAAO,CAAK;CAKhC,OAJI,EAAK,WAAW,KAChB,EAAK,MAAM,MAAQ,MAAQ,IAAI,IAAU,IAE9B,KAAK,IAAI,GAAG,EAAK,QAAQ,MAAuB,MAAQ,IAAI,CACpE,KAAU,IAAQ,uBAAuB;AACpD;AAcA,SAAS,EACL,GACA,GACA,GACoB;CACpB,IAAM,IAAS,EAAO,cAAc;CAEpC,IADI,MAAgB,KAAA,MAAW,EAAO,wBAAwB,IAC1D,MAAQ,KAAA,GACR,KAAK,IAAM,KAAY,EAAO,aAAa,CAAC,GAAG,EAAS,eAAe;CAE3E,OAAO;AACX;AAkBA,eAAsB,EAClB,GACA,GACA,GACA,GACa;CACb,KAAK,IAAM,CAAC,GAAO,MAAS,EAAM,QAAQ,GAAG;EACzC,IAAM,IAAS,EAAa,EAAM,EAAE;EACpC,IAAI,CAAC,GAAQ;EAEb,IAAI,EAAK,SAAS,SAAS;GACvB,IAAM,IAAM,EAAU,QAAQ,EAAK;GACnC,AAAI,MAAQ,KAAA,KAAW,MAAM,EAAiB,GAAQ,CAAG;GACzD;EACJ;EAEA,IAAM,IAAO,EAAU,QAAQ,EAAK;EACpC,IAAI,MAAS,KAAA,KAAW,MAAM,EAAiB,GAAQ,MAAS,OAAO,OAAO,IAAO,GAAI,GAErF,MAAgB,KAAA,KAAa,EAAU,iBAAiB,KAAA,GAC5D,IAAI;GACA,MAAM,EAAO,cACT,EAAgB,GAAQ,GAAa,EAAU,YAAY,CAC/D;EACJ,QAAQ;GACJ,IAAI;IACA,MAAM,EAAO,cACT,EAAgB,GAAQ,KAAA,GAAW,EAAU,YAAY,CAC7D;GACJ,QAAQ,CAER;EACJ;CACJ;AACJ"}
+{"version":3,"file":"mesh-quality.js","names":["DEFAULT_UPLINK_BUDGET_KBPS","DEFAULT_MIN_VIDEO_KBPS","DEFAULT_FLUID_FLOOR_KBPS","scaleForRoom","video","quality","peers","asked","sum","cap","perPeer","floor","factor","scaled","slot","resolveDegradation","effective","anchor","caps","videoParameters","params","sender","degradation","fps","encoding","applyQualityToLink","index","slots","transceivers","bps","setSenderBitrate","kbps"],"sources":["../../src/webrtc/mesh-quality.ts"],"sourcesContent":["import { setSenderBitrate } from \"./sender-bitrate\";\nimport type { MeshQuality, MeshSlot } from \"./mesh-types\";\n\n/** Uplink assumed available when the caller names no budget, in kbps. */\nconst DEFAULT_UPLINK_BUDGET_KBPS = 6000;\n\n/** Floor a video slot keeps after the division, in kbps. */\nconst DEFAULT_MIN_VIDEO_KBPS = 300;\n\n/** Budget below which `maintain-framerate` stops being worth holding, in kbps. */\nconst DEFAULT_FLUID_FLOOR_KBPS = 900;\n\n/**\n * Divide the video caps by the size of the room.\n *\n * A mesh sends one copy of everything per participant, so the uplink is the\n * shared resource and the caps are what compete for it. Nothing is divided while\n * the caller is alone with one peer — that is the case the largest sizes exist\n * for, and dividing a budget that is not being shared would make them\n * unreachable in the only call where they fit.\n *\n * The floor is what keeps the division honest: without it a busy room allocates\n * tens of kbps per stream, and everybody loses the picture instead of the excess\n * giving way.\n *\n * @param quality - The caps as asked for.\n * @param peers - How many links are live.\n * @returns The caps to actually apply. The input is never mutated, so a room\n *     that empties out climbs back to what was asked for.\n */\nexport function scaleForRoom(quality: MeshQuality, peers: number): MeshQuality {\n    const video = quality.video ?? {};\n    if (peers <= 1) return quality;\n\n    const asked = Object.values(video).reduce<number>((sum, cap) => sum + (cap ?? 0), 0);\n    if (asked === 0) return quality;\n\n    const perPeer = (quality.uplinkBudgetKbps ?? DEFAULT_UPLINK_BUDGET_KBPS) / peers;\n    if (asked <= perPeer) return quality;\n\n    const floor = quality.minVideoKbps ?? DEFAULT_MIN_VIDEO_KBPS;\n    const factor = perPeer / asked;\n    const scaled: Record<string, number | null> = {};\n    for (const [slot, cap] of Object.entries(video)) {\n        scaled[slot] = cap === null ? null : Math.max(floor, Math.round(cap * factor));\n    }\n    return { ...quality, video: scaled };\n}\n\n/**\n * Decide what the encoder gives up, letting physics override the preference.\n *\n * `maintain-framerate` is honoured while there are bits enough for the frames to\n * be worth keeping. Once the room's division has taken the budget below the\n * fluid floor, holding the rate halves what each frame receives and the picture\n * is worse than the lower rate it replaced — so below that line the preference\n * is overridden rather than obeyed.\n *\n * Two things decide *which* budget answers that question:\n *\n * - **`null` is the most generous case, not the absent one.** A slot with no cap\n *   is unbounded, which is exactly where fluidity should hold. Reading it as\n *   missing — and then deciding from a modest camera beside it — is the answer\n *   backwards.\n * - **{@link MeshQuality.degradationAnchor} names the slot the choice was\n *   about.** Without it the largest cap across the video slots answers, which\n *   is right when the slots are interchangeable and wrong when they are not.\n *\n * @param quality - What was asked for, including the anchor and the floor.\n * @param effective - What the room's share actually allows.\n * @returns The degradation preference to write onto the senders, or `undefined`\n *     when the caller expressed no preference.\n */\nexport function resolveDegradation(\n    quality: MeshQuality,\n    effective: MeshQuality,\n): RTCDegradationPreference | undefined {\n    const asked = quality.degradationPreference;\n    if (asked !== \"maintain-framerate\") return asked;\n\n    const video = effective.video ?? {};\n    const floor = quality.fluidFloorKbps ?? DEFAULT_FLUID_FLOOR_KBPS;\n    const anchor = quality.degradationAnchor;\n\n    if (anchor !== undefined) {\n        if (!(anchor in video)) return asked;\n        const cap = video[anchor];\n        if (cap === null) return asked;\n        return cap >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n    }\n\n    const caps = Object.values(video);\n    if (caps.length === 0) return asked;\n    if (caps.some((cap) => cap === null)) return asked;\n\n    const budget = Math.max(...caps.filter((cap): cap is number => cap !== null));\n    return budget >= floor ? \"maintain-framerate\" : \"maintain-resolution\";\n}\n\n/**\n * Read a video sender's parameters back with the motion settings written on.\n *\n * Read fresh on every call because `setParameters` only accepts the object the\n * **same** sender's `getParameters` returned, so a rejected attempt cannot be\n * retried with the object that was rejected.\n *\n * @param sender - The video sender to read from.\n * @param degradation - What to give up first, or `undefined` to leave it alone.\n * @param fps - Frame ceiling, or `undefined` to leave it alone.\n * @returns Parameters ready to be written back to `sender`.\n */\nfunction videoParameters(\n    sender: RTCRtpSender,\n    degradation: RTCDegradationPreference | undefined,\n    fps: number | undefined,\n): RTCRtpSendParameters {\n    const params = sender.getParameters();\n    if (degradation !== undefined) params.degradationPreference = degradation;\n    if (fps !== undefined) {\n        for (const encoding of params.encodings ?? []) encoding.maxFramerate = fps;\n    }\n    return params;\n}\n\n/**\n * Write the quality settings onto one link's senders.\n *\n * `degradationPreference` goes only on video: it describes trading resolution\n * against frame rate, which an audio sender has no analogue for, and some\n * browsers reject it outright there.\n *\n * The retry without `degradationPreference` is for Firefox, which rejects the\n * member entirely — sending both together would lose the frame-rate cap to an\n * objection about something else.\n *\n * @param transceivers - The link's transceivers, in slot order.\n * @param slots - The slot list those transceivers were allocated from.\n * @param effective - Caps after the room's division.\n * @param degradation - Already resolved against the fluid floor.\n */\nexport async function applyQualityToLink(\n    transceivers: readonly RTCRtpTransceiver[],\n    slots: readonly MeshSlot[],\n    effective: MeshQuality,\n    degradation: RTCDegradationPreference | undefined,\n): Promise<void> {\n    for (const [index, slot] of slots.entries()) {\n        const sender = transceivers[index]?.sender;\n        if (!sender) continue;\n\n        if (slot.kind === \"audio\") {\n            const bps = effective.audio?.[slot.name];\n            if (bps !== undefined) await setSenderBitrate(sender, bps);\n            continue;\n        }\n\n        const kbps = effective.video?.[slot.name];\n        if (kbps !== undefined) await setSenderBitrate(sender, kbps === null ? null : kbps * 1000);\n\n        if (degradation === undefined && effective.maxFramerate === undefined) continue;\n        try {\n            await sender.setParameters(\n                videoParameters(sender, degradation, effective.maxFramerate),\n            );\n        } catch {\n            try {\n                await sender.setParameters(\n                    videoParameters(sender, undefined, effective.maxFramerate),\n                );\n            } catch {\n                /* the sender refused both; the bitrate cap above still applies */\n            }\n        }\n    }\n}\n"],"mappings":";;AAIA,IAAMA,IAA6B,KAG7BC,IAAyB,KAGzBC,IAA2B;AAoBjC,SAAgBC,EAAa,GAAsB,GAA4B;CAC3E,IAAMC,IAAQC,EAAQ,SAAS,CAAC;CAChC,IAAIC,KAAS,GAAG,OAAOD;CAEvB,IAAME,IAAQ,OAAO,OAAOH,CAAK,CAAC,CAAC,QAAgB,GAAK,MAAQI,KAAOC,KAAO,IAAI,CAAC;CACnF,IAAIF,MAAU,GAAG,OAAOF;CAExB,IAAMK,KAAWL,EAAQ,oBAAoBL,KAA8BM;CAC3E,IAAIC,KAASG,GAAS,OAAOL;CAE7B,IAAMM,IAAQN,EAAQ,gBAAgBJ,GAChCW,IAASF,IAAUH,GACnBM,IAAwC,CAAC;CAC/C,KAAK,IAAM,CAACC,GAAML,MAAQ,OAAO,QAAQL,CAAK,GAC1C,EAAOU,KAAQL,MAAQ,OAAO,OAAO,KAAK,IAAIE,GAAO,KAAK,MAAMF,IAAMG,CAAM,CAAC;CAEjF,OAAO;EAAE,GAAGP;EAAS,OAAOQ;CAAO;AACvC;AA0BA,SAAgBE,EACZ,GACA,GACoC;CACpC,IAAMR,IAAQF,EAAQ;CACtB,IAAIE,MAAU,sBAAsB,OAAOA;CAE3C,IAAMH,IAAQY,EAAU,SAAS,CAAC,GAC5BL,IAAQN,EAAQ,kBAAkBH,GAClCe,IAASZ,EAAQ;CAEvB,IAAIY,MAAW,KAAA,GAAW;EACtB,IAAI,EAAEA,KAAUb,IAAQ,OAAOG;EAC/B,IAAME,IAAML,EAAMa;EAElB,OADIR,MAAQ,OAAaF,IAClBE,KAAOE,IAAQ,uBAAuB;CACjD;CAEA,IAAMO,IAAO,OAAO,OAAOd,CAAK;CAKhC,OAJIc,EAAK,WAAW,KAChBA,EAAK,MAAM,MAAQT,MAAQ,IAAI,IAAUF,IAE9B,KAAK,IAAI,GAAGW,EAAK,QAAQ,MAAuBT,MAAQ,IAAI,CACpE,KAAUE,IAAQ,uBAAuB;AACpD;AAcA,SAASQ,EACL,GACA,GACA,GACoB;CACpB,IAAMC,IAASC,EAAO,cAAc;CAEpC,IADIC,MAAgB,KAAA,MAAW,EAAO,wBAAwBA,IAC1DC,MAAQ,KAAA,GACR,KAAK,IAAMC,KAAYJ,EAAO,aAAa,CAAC,GAAG,EAAS,eAAeG;CAE3E,OAAOH;AACX;AAkBA,eAAsBK,EAClB,GACA,GACA,GACA,GACa;CACb,KAAK,IAAM,CAACC,GAAOZ,MAASa,EAAM,QAAQ,GAAG;EACzC,IAAMN,IAASO,EAAaF,EAAM,EAAE;EACpC,IAAI,CAACL,GAAQ;EAEb,IAAIP,EAAK,SAAS,SAAS;GACvB,IAAMe,IAAMb,EAAU,QAAQF,EAAK;GACnC,AAAIe,MAAQ,KAAA,KAAW,MAAMC,EAAiBT,GAAQQ,CAAG;GACzD;EACJ;EAEA,IAAME,IAAOf,EAAU,QAAQF,EAAK;EAGpC,IAFIiB,MAAS,KAAA,KAAW,MAAMD,EAAiBT,GAAQU,MAAS,OAAO,OAAOA,IAAO,GAAI,GAErFT,MAAgB,KAAA,KAAaN,EAAU,iBAAiB,KAAA,GAC5D,IAAI;GACA,MAAMK,EAAO,cACTF,EAAgBE,GAAQC,GAAaN,EAAU,YAAY,CAC/D;EACJ,QAAQ;GACJ,IAAI;IACA,MAAMK,EAAO,cACTF,EAAgBE,GAAQ,KAAA,GAAWL,EAAU,YAAY,CAC7D;GACJ,QAAQ,CAER;EACJ;CACJ;AACJ"}