@swf2es/render 0.0.0-stage → 0.1.1

package/dist/webgl/kernels.js

@@ -0,0 +1,160 @@
+import { linkProgram, ShaderError } from "@swf2es/context3d/device";
+import { CLAMP } from "../scene.js";
+/**
+ * The first unit a kernel's own images are bound to, as many as
+ * kernel-shaders.ts's KERNEL_IMAGES: past every unit the other programs
+ * use (programs.ts's, and the filter passes' 4 to 6), as WebGL 2 has 32
+ * for a draw's programs together.
+ */
+export const KERNEL_UNIT = 16;
+/** The most kernels' programs kept, the one used longest ago deleted for another. */
+const KERNEL_PROGRAMS = 32;
+/**
+ * The programs of Pixel Bender kernels, a ShaderFilter's, a blend
+ * shader's or a shader fill's, by their fragment shaders, each a use's
+ * own and so with one vertex shader:
+ * linked as first used, the one used longest ago deleted past
+ * KERNEL_PROGRAMS; null for one the GPU would not link, which its user
+ * draws otherwise. One for the backend, which its users share.
+ */
+export class KernelPrograms {
+    gl;
+    state;
+    programs = new Map();
+    ints = new Int32Array(4);
+    constructor(gl, state) {
+        this.gl = gl;
+        this.state = state;
+    }
+    /**
+     * The program of `vertex` and `fragment`, in use; null where it would
+     * not link. `prepare` is told it as it is linked, to set its samplers.
+     */
+    use(vertex, fragment, prepare) {
+        const gl = this.gl;
+        // By the fragment shader alone, a use's own, which a frame gives again as the same string.
+        const key = fragment;
+        let kernel = this.programs.get(key);
+        if (kernel !== undefined) {
+            // Used last now.
+            this.programs.delete(key);
+        }
+        else {
+            if (this.programs.size >= KERNEL_PROGRAMS) {
+                const [oldest, old] = this.programs.entries().next().value;
+                if (old) {
+                    gl.deleteProgram(old.program);
+                }
+                this.programs.delete(oldest);
+            }
+            kernel = null;
+            try {
+                const program = linkProgram(gl, vertex, fragment);
+                const uniforms = new Map();
+                kernel = {
+                    program,
+                    uniforms,
+                    told: new Map(),
+                    at(name) {
+                        let location = uniforms.get(name);
+                        if (location === undefined) {
+                            location = gl.getUniformLocation(program, name);
+                            uniforms.set(name, location);
+                        }
+                        return location;
+                    },
+                };
+                this.state.useProgram(program);
+                prepare(program);
+            }
+            catch (e) {
+                if (!(e instanceof ShaderError)) {
+                    throw e;
+                }
+            }
+        }
+        this.programs.set(key, kernel);
+        if (kernel) {
+            this.state.useProgram(kernel.program);
+        }
+        return kernel;
+    }
+    /** Texture `id` bound to a kernel's own image unit `k`, which its sampler at `location` names. */
+    bindImage(location, k, id, host) {
+        this.state.bindTexture(KERNEL_UNIT + k, host.texture(id));
+        // Nearest: a float texture with a linear sampler is incomplete, and texelFetch reads either.
+        this.state.bindSampler(KERNEL_UNIT + k, host.sampler(CLAMP));
+        this.gl.uniform1i(location, KERNEL_UNIT + k);
+    }
+    /** `count` ints of `source` from `at` set as the ivec4 array at `location`, its program in use. */
+    setInts(location, source, at, count) {
+        let values = this.ints;
+        if (count > values.length) {
+            values = new Int32Array(count);
+        }
+        values.set(source.subarray(at, at + count));
+        this.gl.uniform4iv(location, values, 0, count);
+    }
+    /** What readImages reads into, its records kept from call to call. */
+    images = [];
+    /**
+     * The images of the kernel at entry `i` of `filters`, a blend shader's
+     * or a shader fill's, its values laid out as a ShaderFilter's
+     * (filters.ts, SHADER): -1 for what is below, -2 for the layer blended.
+     * Null where a texture of its own is gone, as such a kernel is left out.
+     */
+    readImages(filters, i, host) {
+        const v = filters.values;
+        const at = filters.start[i];
+        const count = v[at + 7];
+        const images = this.images;
+        for (let k = 0; k < count; k++) {
+            const id = v[at + 9 + k * 3];
+            if (id >= 0 && !host.texture(id)) {
+                return null;
+            }
+            if (!images[k]) {
+                images[k] = { texture: 0, layer: false, float: false, back: false };
+            }
+            const image = images[k];
+            image.texture = v[at + 8 + k * 3];
+            image.layer = id < 0;
+            image.back = id === -1;
+            image.float = v[at + 10 + k * 3] > 0;
+        }
+        images.length = count;
+        return images;
+    }
+    /** The parameters and own images of the kernel at entry `i` of `filters` set on `kernel`, in use. */
+    setUniforms(kernel, filters, i, host) {
+        const v = filters.values;
+        const at = filters.start[i];
+        const count = v[at + 7];
+        let unit = 0;
+        for (let k = 0; k < count; k++) {
+            const id = v[at + 9 + k * 3];
+            if (id >= 0) {
+                this.bindImage(kernel.at(`pbImage${v[at + 8 + k * 3]}`), unit++, id, host);
+            }
+        }
+        const floats = at + 8 + count * 3;
+        if (v[floats] > 0) {
+            this.gl.uniform4fv(kernel.at("pbFloats"), v, floats + 1, v[floats]);
+        }
+        const ints = filters.intStart[i];
+        const n = filters.intStart[i + 1] - ints;
+        if (n > 0) {
+            this.setInts(kernel.at("pbInts"), filters.ints, ints, n);
+        }
+    }
+    /** Every program deleted, as the backend goes; none kept, as a lost context comes back. */
+    clear() {
+        for (const kernel of this.programs.values()) {
+            if (kernel) {
+                this.gl.deleteProgram(kernel.program);
+            }
+        }
+        this.programs.clear();
+    }
+}
+//# sourceMappingURL=kernels.js.map

package/dist/webgl/kernels.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kernels.js","sourceRoot":"","sources":["../../src/webgl/kernels.ts"],"names":[],"mappings":"AAAA,OAAO,EAAgB,WAAW,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAGlF,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAoBpC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAC;AAE9B,qFAAqF;AACrF,MAAM,eAAe,GAAG,EAAE,CAAC;AAE3B;;;;;;;GAOG;AACH,MAAM,OAAO,cAAc;IAKN,EAAE;IACF,KAAK;IALP,QAAQ,GAAG,IAAI,GAAG,EAAgC,CAAC;IACnD,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAE1C,YACmB,EAA0B,EAC1B,KAAc;kBADd,EAAE;qBACF,KAAK;IACrB,CAAC;IAEJ;;;OAGG;IACH,GAAG,CACD,MAAc,EACd,QAAgB,EAChB,OAAwC;QAExC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,2FAA2F;QAC3F,MAAM,GAAG,GAAG,QAAQ,CAAC;QACrB,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,iBAAiB;YACjB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,eAAe,EAAE,CAAC;gBAC1C,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAGpD,CAAC;gBACF,IAAI,GAAG,EAAE,CAAC;oBACR,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAChC,CAAC;gBAED,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;YAED,MAAM,GAAG,IAAI,CAAC;YACd,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuC,CAAC;gBAChE,MAAM,GAAG;oBACP,OAAO;oBACP,QAAQ;oBACR,IAAI,EAAE,IAAI,GAAG,EAAE;oBACf,EAAE,CAAC,IAAI;wBACL,IAAI,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;4BAC3B,QAAQ,GAAG,EAAE,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;4BAChD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBAC/B,CAAC;wBAED,OAAO,QAAQ,CAAC;oBAClB,CAAC;iBACF,CAAC;gBACF,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC/B,OAAO,CAAC,OAAO,CAAC,CAAC;YACnB,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,IAAI,CAAC,CAAC,CAAC,YAAY,WAAW,CAAC,EAAE,CAAC;oBAChC,MAAM,CAAC,CAAC;gBACV,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC/B,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kGAAkG;IAClG,SAAS,CAAC,QAAqC,EAAE,CAAS,EAAE,EAAU,EAAE,IAAgB;QACtF,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,WAAW,GAAG,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,6FAA6F;QAC7F,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,WAAW,GAAG,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,mGAAmG;IACnG,OAAO,CAAC,QAAqC,EAAE,MAAkB,EAAE,EAAU,EAAE,KAAa;QAC1F,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IAED,sEAAsE;IACrD,MAAM,GAAkB,EAAE,CAAC;IAE5C;;;;;OAKG;IACH,UAAU,CAAC,OAAgB,EAAE,CAAS,EAAE,IAAgB;QACtD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjC,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YACtE,CAAC;YAED,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAClC,KAAK,CAAC,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;YACrB,KAAK,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,qGAAqG;IACrG,WAAW,CAAC,MAAqB,EAAE,OAAgB,EAAE,CAAS,EAAE,IAAgB;QAC9E,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,2FAA2F;IAC3F,KAAK;QACH,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/webgl/pool.d.ts

@@ -0,0 +1,71 @@
+/**
+ * What a pool holds: its size, and the frame it was last freed in; where
+ * it may be used as smaller than it is, its own size, which it is pooled by.
+ */
+export interface Pooled {
+    width: number;
+    height: number;
+    textureWidth?: number;
+    textureHeight?: number;
+    usedAt: number;
+}
+/**
+ * Free targets kept by their size (and samples) for the next to take them:
+ * an exact one found at once, a larger one among the sizes there are, each
+ * size's list in the order they were freed. A frame's end lets go of those
+ * idle too long, then of the least lately freed past a budget, oldest first
+ * from the lists' heads, as the frame's own working set may pass it for a
+ * while without what it gives back being made again.
+ */
+export declare class SizedPool<T extends Pooled> {
+    private readonly lists;
+    private readonly bytesOf;
+    /** The bytes all held take together. */
+    bytes: number;
+    constructor(bytesOf: (item: T) => number);
+    /** One of just `width` by `height` (and `samples`), the latest freed; none for none. */
+    take(width: number, height: number, samples?: number): T | null;
+    /** The smallest target that fits, at these samples and within `maxArea`; none for none. */
+    takeFitting(width: number, height: number, samples?: number, maxArea?: number): T | null;
+    private takeAt;
+    /** `item` free again, freed in frame `frame`, of `samples` where they count. */
+    give(item: T, frame: number, samples?: number): void;
+    /**
+     * Those freed more than `idle` frames before `frame` let go of, then the
+     * least lately freed till they take `budget` bytes at most, each `drop`ped.
+     */
+    trim(frame: number, idle: number, budget: number, drop: (item: T) => void): void;
+    /** Those freed more than `idle` frames before `frame` let go of, each `drop`ped. */
+    trimIdle(frame: number, idle: number, drop: (item: T) => void): void;
+    /**
+     * The key of the list whose head goes first past a budget: the least
+     * lately freed, and of those freed in one frame the largest, so that as
+     * few go as may; -1 for none.
+     */
+    firstOut(): number;
+    /** The head of list `key` (firstOut), as `firstOut` found it. */
+    headOf(key: number): T;
+    /** The head of list `key` (firstOut) let go of, `drop`ped. */
+    dropHead(key: number, drop: (item: T) => void): void;
+    /** The bytes those freed in frame `frame` take, which that frame drew with. */
+    bytesFreedIn(frame: number): number;
+    /** The bytes `item` takes, as this pool counts them. */
+    bytesFor(item: T): number;
+    /** Every one held let go of, as the context goes. */
+    clear(drop: (item: T) => void): void;
+}
+/** A pool and how what it lets go of is deleted. */
+interface Trimmed {
+    pool: SizedPool<any>;
+    drop: (item: any) => void;
+}
+/**
+ * `pools` let go of till together they take `budget` bytes at most: the
+ * least lately freed of all first, of those freed in one frame the
+ * largest. One budget for all, as trimming one pool against what another
+ * holds dropped a frame's own small layers while large multisampled
+ * buffers idle for many frames stayed, each frame making them again.
+ */
+export declare function trimTogether(pools: readonly Trimmed[], budget: number): void;
+export {};
+//# sourceMappingURL=pool.d.ts.map

package/dist/webgl/pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.d.ts","sourceRoot":"","sources":["../../src/webgl/pool.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,WAAW,MAAM;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;CAChB;AAMD;;;;;;;GAOG;AACH,qBAAa,SAAS,CAAC,CAAC,SAAS,MAAM;IACrC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA0B;IAChD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAsB;IAC9C,wCAAwC;IACxC,KAAK,SAAK;IAEV,YAAY,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,EAEvC;IAED,wFAAwF;IACxF,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,SAAI,GAAG,CAAC,GAAG,IAAI,CAEzD;IAED,2FAA2F;IAC3F,WAAW,CACT,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,OAAO,SAAI,EACX,OAAO,SAA2B,GACjC,CAAC,GAAG,IAAI,CAoBV;IAED,OAAO,CAAC,MAAM;IAgBd,gFAAgF;IAChF,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,SAAI,GAAG,IAAI,CAc9C;IAED;;;OAGG;IACH,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI,CAG/E;IAED,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI,CAenE;IAED;;;;OAIG;IACH,QAAQ,IAAI,MAAM,CAejB;IAED,iEAAiE;IACjE,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAErB;IAED,8DAA8D;IAC9D,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI,CAQnD;IAED,+EAA+E;IAC/E,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CASlC;IAED,wDAAwD;IACxD,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAExB;IAED,qDAAqD;IACrD,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI,CASnC;CACF;AAED,oDAAoD;AACpD,UAAU,OAAO;IAEf,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC;IAErB,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,IAAI,CAAC;CAC3B;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAkC5E"}

package/dist/webgl/pool.js

@@ -0,0 +1,192 @@
+/** What a size, and samples where they count, are keyed by. */
+const SIZE_KEY = 65536;
+const SAMPLES_KEY = 32;
+/**
+ * Free targets kept by their size (and samples) for the next to take them:
+ * an exact one found at once, a larger one among the sizes there are, each
+ * size's list in the order they were freed. A frame's end lets go of those
+ * idle too long, then of the least lately freed past a budget, oldest first
+ * from the lists' heads, as the frame's own working set may pass it for a
+ * while without what it gives back being made again.
+ */
+export class SizedPool {
+    lists = new Map();
+    bytesOf;
+    /** The bytes all held take together. */
+    bytes = 0;
+    constructor(bytesOf) {
+        this.bytesOf = bytesOf;
+    }
+    /** One of just `width` by `height` (and `samples`), the latest freed; none for none. */
+    take(width, height, samples = 0) {
+        return this.takeAt((width * SIZE_KEY + height) * SAMPLES_KEY + samples);
+    }
+    /** The smallest target that fits, at these samples and within `maxArea`; none for none. */
+    takeFitting(width, height, samples = 0, maxArea = Number.POSITIVE_INFINITY) {
+        let best = -1;
+        let least = Number.POSITIVE_INFINITY;
+        for (const key of this.lists.keys()) {
+            const size = Math.floor(key / SAMPLES_KEY);
+            const w = Math.floor(size / SIZE_KEY);
+            const h = size % SIZE_KEY;
+            if (key % SAMPLES_KEY === samples &&
+                w >= width &&
+                h >= height &&
+                w * h <= maxArea &&
+                w * h < least) {
+                least = w * h;
+                best = key;
+            }
+        }
+        return best < 0 ? null : this.takeAt(best);
+    }
+    takeAt(key) {
+        const list = this.lists.get(key);
+        const item = list?.pop() ?? null;
+        if (!item) {
+            return null;
+        }
+        // An emptied size goes, so that finding a larger one looks at those held alone.
+        if (list.length === 0) {
+            this.lists.delete(key);
+        }
+        this.bytes -= this.bytesOf(item);
+        return item;
+    }
+    /** `item` free again, freed in frame `frame`, of `samples` where they count. */
+    give(item, frame, samples = 0) {
+        item.usedAt = frame;
+        const key = ((item.textureWidth ?? item.width) * SIZE_KEY + (item.textureHeight ?? item.height)) *
+            SAMPLES_KEY +
+            samples;
+        let list = this.lists.get(key);
+        if (!list) {
+            list = [];
+            this.lists.set(key, list);
+        }
+        list.push(item);
+        this.bytes += this.bytesOf(item);
+    }
+    /**
+     * Those freed more than `idle` frames before `frame` let go of, then the
+     * least lately freed till they take `budget` bytes at most, each `drop`ped.
+     */
+    trim(frame, idle, budget, drop) {
+        this.trimIdle(frame, idle, drop);
+        trimTogether([{ pool: this, drop }], budget);
+    }
+    /** Those freed more than `idle` frames before `frame` let go of, each `drop`ped. */
+    trimIdle(frame, idle, drop) {
+        for (const [key, list] of this.lists) {
+            let gone = 0;
+            while (gone < list.length && frame - list[gone].usedAt > idle) {
+                this.bytes -= this.bytesOf(list[gone]);
+                drop(list[gone]);
+                gone++;
+            }
+            if (gone === list.length) {
+                this.lists.delete(key);
+            }
+            else if (gone > 0) {
+                list.splice(0, gone);
+            }
+        }
+    }
+    /**
+     * The key of the list whose head goes first past a budget: the least
+     * lately freed, and of those freed in one frame the largest, so that as
+     * few go as may; -1 for none.
+     */
+    firstOut() {
+        let best = -1;
+        let bestAt = 0;
+        let bestBytes = 0;
+        for (const [key, list] of this.lists) {
+            const head = list[0];
+            const bytes = this.bytesOf(head);
+            if (best < 0 || head.usedAt < bestAt || (head.usedAt === bestAt && bytes > bestBytes)) {
+                best = key;
+                bestAt = head.usedAt;
+                bestBytes = bytes;
+            }
+        }
+        return best;
+    }
+    /** The head of list `key` (firstOut), as `firstOut` found it. */
+    headOf(key) {
+        return this.lists.get(key)[0];
+    }
+    /** The head of list `key` (firstOut) let go of, `drop`ped. */
+    dropHead(key, drop) {
+        const list = this.lists.get(key);
+        const item = list.shift();
+        this.bytes -= this.bytesOf(item);
+        drop(item);
+        if (list.length === 0) {
+            this.lists.delete(key);
+        }
+    }
+    /** The bytes those freed in frame `frame` take, which that frame drew with. */
+    bytesFreedIn(frame) {
+        let bytes = 0;
+        for (const list of this.lists.values()) {
+            for (let i = list.length - 1; i >= 0 && list[i].usedAt === frame; i--) {
+                bytes += this.bytesOf(list[i]);
+            }
+        }
+        return bytes;
+    }
+    /** The bytes `item` takes, as this pool counts them. */
+    bytesFor(item) {
+        return this.bytesOf(item);
+    }
+    /** Every one held let go of, as the context goes. */
+    clear(drop) {
+        for (const list of this.lists.values()) {
+            for (const item of list) {
+                drop(item);
+            }
+        }
+        this.lists.clear();
+        this.bytes = 0;
+    }
+}
+/**
+ * `pools` let go of till together they take `budget` bytes at most: the
+ * least lately freed of all first, of those freed in one frame the
+ * largest. One budget for all, as trimming one pool against what another
+ * holds dropped a frame's own small layers while large multisampled
+ * buffers idle for many frames stayed, each frame making them again.
+ */
+export function trimTogether(pools, budget) {
+    let bytes = 0;
+    for (const { pool } of pools) {
+        bytes += pool.bytes;
+    }
+    while (bytes > budget) {
+        let from = null;
+        let key = -1;
+        let at = 0;
+        let size = 0;
+        for (const trimmed of pools) {
+            const k = trimmed.pool.firstOut();
+            if (k < 0) {
+                continue;
+            }
+            const head = trimmed.pool.headOf(k);
+            const headBytes = trimmed.pool.bytesFor(head);
+            if (!from || head.usedAt < at || (head.usedAt === at && headBytes > size)) {
+                from = trimmed;
+                key = k;
+                at = head.usedAt;
+                size = headBytes;
+            }
+        }
+        if (!from) {
+            break;
+        }
+        bytes -= size;
+        from.pool.dropHead(key, from.drop);
+    }
+}
+//# sourceMappingURL=pool.js.map

package/dist/webgl/pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.js","sourceRoot":"","sources":["../../src/webgl/pool.ts"],"names":[],"mappings":"AAYA,+DAA+D;AAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC;AACvB,MAAM,WAAW,GAAG,EAAE,CAAC;AAEvB;;;;;;;GAOG;AACH,MAAM,OAAO,SAAS;IACH,KAAK,GAAG,IAAI,GAAG,EAAe,CAAC;IAC/B,OAAO,CAAsB;IAC9C,wCAAwC;IACxC,KAAK,GAAG,CAAC,CAAC;IAEV,YAAY,OAA4B;QACtC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,wFAAwF;IACxF,IAAI,CAAC,KAAa,EAAE,MAAc,EAAE,OAAO,GAAG,CAAC;QAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC,CAAC;IAC1E,CAAC;IAED,2FAA2F;IAC3F,WAAW,CACT,KAAa,EACb,MAAc,EACd,OAAO,GAAG,CAAC,EACX,OAAO,GAAG,MAAM,CAAC,iBAAiB;QAElC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,WAAW,CAAC,CAAC;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;YACtC,MAAM,CAAC,GAAG,IAAI,GAAG,QAAQ,CAAC;YAC1B,IACE,GAAG,GAAG,WAAW,KAAK,OAAO;gBAC7B,CAAC,IAAI,KAAK;gBACV,CAAC,IAAI,MAAM;gBACX,CAAC,GAAG,CAAC,IAAI,OAAO;gBAChB,CAAC,GAAG,CAAC,GAAG,KAAK,EACb,CAAC;gBACD,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,IAAI,GAAG,GAAG,CAAC;YACb,CAAC;QACH,CAAC;QAED,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAEO,MAAM,CAAC,GAAW;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;QAED,gFAAgF;QAChF,IAAK,IAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QAED,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gFAAgF;IAChF,IAAI,CAAC,IAAO,EAAE,KAAa,EAAE,OAAO,GAAG,CAAC;QACtC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,MAAM,GAAG,GACP,CAAC,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC;YAClF,WAAW;YACb,OAAO,CAAC;QACV,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;YACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,KAAa,EAAE,IAAY,EAAE,MAAc,EAAE,IAAuB;QACvE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED,oFAAoF;IACpF,QAAQ,CAAC,KAAa,EAAE,IAAY,EAAE,IAAuB;QAC3D,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;gBAC9D,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBACjB,IAAI,EAAE,CAAC;YACT,CAAC;YAED,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;iBAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC;gBACtF,IAAI,GAAG,GAAG,CAAC;gBACX,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBACrB,SAAS,GAAG,KAAK,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iEAAiE;IACjE,MAAM,CAAC,GAAW;QAChB,OAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAS,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,8DAA8D;IAC9D,QAAQ,CAAC,GAAW,EAAE,IAAuB;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAQ,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAO,CAAC;QAC/B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,YAAY,CAAC,KAAa;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtE,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,wDAAwD;IACxD,QAAQ,CAAC,IAAO;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,qDAAqD;IACrD,KAAK,CAAC,IAAuB;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,KAAyB,EAAE,MAAc;IACpE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC7B,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED,OAAO,KAAK,GAAG,MAAM,EAAE,CAAC;QACtB,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QACb,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,IAAI,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC;gBAC1E,IAAI,GAAG,OAAO,CAAC;gBACf,GAAG,GAAG,CAAC,CAAC;gBACR,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;gBACjB,IAAI,GAAG,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM;QACR,CAAC;QAED,KAAK,IAAI,IAAI,CAAC;QACd,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;AACH,CAAC"}

package/dist/webgl/programs.d.ts

@@ -0,0 +1,130 @@
+/** Texels a row (ROW_FLOATS over four). */
+export declare const ROW_TEXELS = 4;
+/**
+ * The vertex atlas' attributes, where both the fill and the mesh programs
+ * read them: a mesh's depth is the four bytes of its colour, as a float.
+ */
+export declare const POSITION_AT = 0;
+export declare const TEXEL_AT = 1;
+export declare const COLOR_AT = 2;
+export declare const DEPTH_AT = 3;
+/** Advanced text's glyph quads' attributes past their position (GeometryData.glyphs), in theirs. */
+export declare const ORIGIN_AT = 4;
+export declare const GLYPH_AT = 5;
+export declare const RUN_AT = 6;
+export declare const TINT_AT = 7;
+/** The most cutoff table entries a text's draw takes, as the player's text/saffron.ts builds them. */
+export declare const TABLE_ENTRIES = 48;
+/** Segments a row of the outlines' texture, as the player's text/saffron.ts stores them. */
+export declare const OUTLINE_ROW = 1024;
+/**
+ * The most draws a multi-draw of the fill program makes, their rows in its
+ * integer texture, a line of it. A power of two: the vertex shader splits a
+ * draw's place in the table into column and line with a mask and a shift.
+ */
+export declare const RUN_MOST = 256;
+/** Textures the fill program samples in one draw call, each on a unit of its own. */
+export declare const FILL_TEXTURES = 8;
+/**
+ * A fill draw's row and how it is drawn, in one int: the row in the bits
+ * below FILL_SLOT, then which of the fill program's textures it samples, one
+ * past its index or 0 for none, then SNAP_BIT where it snaps (SNAP). Rows
+ * are fewer: ROWS_A_LINE to a line of a texture of at most 16384 lines.
+ */
+export declare const FILL_SLOT = 24;
+export declare const SNAP_BIT: number;
+/** The texture unit a mesh's texture is bound to, and textures are uploaded on; the rows are on 0. */
+export declare const TEXTURE_UNIT = 1;
+/** The units a composite reads its layer and what is below from. */
+export declare const LAYER_UNIT = 2;
+export declare const BACK_UNIT = 3;
+/** The unit advanced text's outlines are on (uploadOutlines); the filters take 4 to 6. */
+export declare const OUTLINE_UNIT = 7;
+/** The first of the units the fill program's textures are bound to (FILL_TEXTURES). */
+export declare const FILL_UNIT = 8;
+/** The multi-draw row table's unit, past the fill textures. */
+export declare const RUN_UNIT: number;
+/**
+ * Places a vertex by its row's transform, on a quarter of a pixel of
+ * Flash's (uUnit of them a stage pixel, from the stage's origin) where it
+ * snaps (SNAP), then on the target by uView (scale and offset into clip
+ * space), and passes on its straight colour, the row's colour transform
+ * and the texture it samples. uRow names the draw's row (FILL_SLOT); with
+ * `multi` (WEBGL_multi_draw), uRunTable names each draw's of a multi-draw by
+ * gl_DrawID, which is 0 in a draw of its own.
+ */
+export declare const fillVertex: (multi: boolean) => string;
+/**
+ * Flash's colour transform on the straight colour, clamped, then
+ * premultiplied for blending: the vertex' colour, or with a texture the
+ * texel's (premultiplied in the texture) times it, as the colour batcher
+ * did, a clear texel staying clear.
+ */
+export declare const fillFragment: string;
+/**
+ * drawTriangles' textured triangles (MESH), placed as fills are, their u
+ * and v carried times their depth t, and t, which the GPU interpolates
+ * straight across the screen for each pixel to divide.
+ */
+export declare const meshVertex: string;
+/**
+ * drawTriangles' bitmap as adl samples it: u and v from 0 to 1 onto the first
+ * texel's centre to the last's, wrapped into that or clamped to it, read
+ * once a pixel of Flash's, at its top left corner; not smoothed, the nearer
+ * texel, the lower of two as near; smoothed, the four around, weighed.
+ * uFrag takes a fragment to the target's pixels from the stage's origin,
+ * down (x + uFrag.x, uFrag.y + uFrag.z * y), and is a pixel of Flash's
+ * that many of them (w). uMode: whether it repeats, whether it is smoothed,
+ * and whether it is a 3D object's quad (PLANE), which reads its bitmap
+ * otherwise. The colour transform then as on a fill.
+ */
+export declare const meshFragment = "#version 300 es\nprecision highp float;\nin vec3 vUVT;\nflat in vec4 vMul;\nflat in vec4 vAdd;\nuniform sampler2D uTexture;\nuniform vec4 uFrag;\nuniform ivec3 uMode;\nout vec4 finalColor;\n\nvec4 texel(ivec2 at) {\n  return texelFetch(uTexture, at, 0);\n}\n\nvoid main(void) {\n  float pixel = uFrag.w;\n  vec2 f = vec2(gl_FragCoord.x + uFrag.x, uFrag.y + uFrag.z * gl_FragCoord.y);\n  vec2 size = vec2(textureSize(uTexture, 0));\n  if (uMode.z != 0) {\n    // A 3D object's quad (PLANE): its bitmap read smoothed at the pixel's centre, in its texels.\n    vec2 centre = (floor(f / pixel) + 0.5) * pixel;\n    vec3 at = vUVT + dFdx(vUVT) * (centre.x - f.x) + dFdy(vUVT) * ((centre.y - f.y) * uFrag.z);\n    vec4 shown = texture(uTexture, (at.z != 0.0 ? at.xy / at.z : vec2(0.0)) / size);\n    if (shown.a == 0.0) {\n      finalColor = vec4(0.0);\n      return;\n    }\n\n    vec4 s = clamp(vec4(shown.rgb / shown.a, shown.a) * vMul + vAdd, 0.0, 1.0);\n    finalColor = vec4(s.rgb * s.a, s.a);\n    return;\n  }\n\n  vec2 corner = floor(f / pixel) * pixel;\n  vec3 uvt = vUVT + dFdx(vUVT) * (corner.x - f.x) + dFdy(vUVT) * ((corner.y - f.y) * uFrag.z);\n  vec2 uv = uvt.z != 0.0 ? uvt.xy / uvt.z : vec2(0.0);\n  // As adl draws one, a bitmap a texel high shows its first texel throughout.\n  if (size.y == 1.0) {\n    uv = vec2(0.0);\n  }\n\n  // A hair nearer 0, as adl's come out, stepped across the triangle in fixed point: 1 wraps to\n  // the last texel, not the first, and a corner halfway between texels takes the one nearer 0.\n  uv -= sign(uv) / 16384.0;\n  uv = uMode.x != 0 ? fract(uv) : clamp(uv, 0.0, 1.0);\n  vec2 p = uv * (size - 1.0);\n  vec4 color;\n  if (uMode.y != 0) {\n    vec2 below = floor(p);\n    vec2 w = p - below;\n    ivec2 a = ivec2(below);\n    ivec2 b = min(a + 1, ivec2(size) - 1);\n    color = mix(\n      mix(texel(a), texel(ivec2(b.x, a.y)), w.x),\n      mix(texel(ivec2(a.x, b.y)), texel(b), w.x),\n      w.y\n    );\n  } else {\n    color = texel(ivec2(floor(p + 0.5)));\n  }\n\n  if (color.a == 0.0) {\n    finalColor = vec4(0.0);\n    return;\n  }\n\n  vec4 c = clamp(vec4(color.rgb / color.a, color.a) * vMul + vAdd, 0.0, 1.0);\n  finalColor = vec4(c.rgb * c.a, c.a);\n}\n";
+/**
+ * Advanced text's glyph quads (player's text/saffron.ts), placed by the
+ * row's transform: the text's
+ * pixels to Flash's, uUnit of them a stage pixel, on their grid from the
+ * stage's origin, a BitmapData's in a draw. A glyph's pen stands where its
+ * text's origin, at a whole pixel, puts it, snapped as its grid fits it
+ * (uMode: gridFitType 0 none, 1 pixel, 2 subpixel, thickness, sharpness),
+ * and its quad reaches out past its outline by the furthest cutoff. Its
+ * colour is drawn under the row's colour transform, light or dark as adl
+ * chooses its table. aOrigin: the pen, and its light and dark tables, each
+ * its first entry plus 64 times its entries; aGlyph: a corner of its
+ * outline's bounds and the way out from it; aRun: its segments, first and
+ * count, the pixels of a unit of its outline, and its size.
+ */
+export declare const glyphsVertex: string;
+/**
+ * Each pixel of Flash's a glyph's quad covers, by its signed distance to
+ * the glyph's outline (the segments of its run in uSegments, the nearest
+ * and, by parity, whether it is inside), between the cutoffs, as Saffron
+ * covers it. Nothing outside: in a mask, which
+ * writes the stencil wherever it draws, a glyph is its shape.
+ */
+export declare const glyphsFragment: string;
+/**
+ * Two triangles over a layer's rectangle of the target, uRect its corners
+ * in clip space: a rasteriser then steps over those pixels alone, as a
+ * software one does not for a triangle over the whole target cut by the
+ * scissor.
+ */
+export declare const compositeVertex = "#version 300 es\nuniform vec4 uRect;\nvoid main(void) {\n  int k = gl_VertexID;\n  vec2 p = vec2(k == 1 || k == 2 || k == 4 ? 1.0 : 0.0, k == 2 || k == 4 || k == 5 ? 1.0 : 0.0);\n  gl_Position = vec4(mix(uRect.xy, uRect.zw, p), 0.0, 1.0);\n}\n";
+/** A composited layer's pixel, `front`, coloured by its row's colour transform where it has one (uRow not -1). */
+export declare const LAYER_COLOR: string;
+/**
+ * A layer composited onto what is below over its rectangle, pixel for
+ * pixel: its rows run down, as the filters read them, and the target's up
+ * where it is the canvas (uFlip), from uOffset in its framebuffer. Coloured
+ * by its row's colour transform where it has one (uRow not -1), on its
+ * straight colour where it covers anything; then blended by its mode
+ * (BLEND_FRONT).
+ */
+export declare const compositeFragment: string;
+/**
+ * A fill drawn straight onto what is below it in a blend mode, where its
+ * layer would hold it alone (a flat fill, GeometryData.flat): its pixel as
+ * fillFragment has it, then as compositeFragment composites its layer's,
+ * coloured by the layer's row (uLayerRow, -1 for none) and blended by uMode.
+ */
+export declare const blendFillFragment: string;
+//# sourceMappingURL=programs.d.ts.map

package/dist/webgl/programs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"programs.d.ts","sourceRoot":"","sources":["../../src/webgl/programs.ts"],"names":[],"mappings":"AAkBA,2CAA2C;AAC3C,eAAO,MAAM,UAAU,IAAI,CAAC;AAE5B;;;GAGG;AACH,eAAO,MAAM,WAAW,IAAI,CAAC;AAC7B,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,oGAAoG;AACpG,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,eAAO,MAAM,MAAM,IAAI,CAAC;AACxB,eAAO,MAAM,OAAO,IAAI,CAAC;AAEzB,sGAAsG;AACtG,eAAO,MAAM,aAAa,KAAK,CAAC;AAChC,4FAA4F;AAC5F,eAAO,MAAM,WAAW,OAAO,CAAC;AAEhC;;;;GAIG;AACH,eAAO,MAAM,QAAQ,MAAM,CAAC;AAE5B,qFAAqF;AACrF,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B;;;;;GAKG;AACH,eAAO,MAAM,SAAS,KAAK,CAAC;AAC5B,eAAO,MAAM,QAAQ,QAAU,CAAC;AAEhC,sGAAsG;AACtG,eAAO,MAAM,YAAY,IAAI,CAAC;AAC9B,oEAAoE;AACpE,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,0FAA0F;AAC1F,eAAO,MAAM,YAAY,IAAI,CAAC;AAC9B,uFAAuF;AACvF,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,+DAA+D;AAC/D,eAAO,MAAM,QAAQ,QAA4B,CAAC;AAElD;;;;;;;;GAQG;AACH,eAAO,MAAM,UAAU,UAAW,OAAO,WAkCxC,CAAC;AAaF;;;;;GAKG;AACH,eAAO,MAAM,YAAY,QAiCxB,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,UAAU,QAsBtB,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,YAAY,0qEAqExB,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,YAAY,QAmGxB,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,QAwD1B,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,eAAe,wPAO3B,CAAC;AAeF,kHAAkH;AAClH,eAAO,MAAM,WAAW,QAAqB,CAAC;AAuD9C;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,QAmB7B,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,QAyC7B,CAAC"}