@woosh/meep-engine 3.9.0 → 3.11.0

package/src/engine/asset/loaders/image/jpeg/idct8x8_fixed.js

@@ -1,214 +0,0 @@
-// IDCT constants (20.12 fixed point format)
-const dctCos1 = 4017;   // cos(pi/16)
-const dctSin1 = 799;   // sin(pi/16)
-const dctCos3 = 3406;   // cos(3*pi/16)
-const dctSin3 = 2276;   // sin(3*pi/16)
-const dctCos6 = 1567;   // cos(6*pi/16)
-const dctSin6 = 3784;   // sin(6*pi/16)
-const dctSqrt2 = 5793;   // sqrt(2)
-const dctSqrt1d2 = 2896;  // sqrt(2) / 2
-
-/**
- * Used internally for transformation
- * @type {Int32Array}
- */
-const p = new Int32Array(64);
-
-/**
- * Decode 8x8 block quantized DCT coefficients and inverse DCT transform.
- * This is a fixed-point implementation of the IDCT algorithm.
- *
- * This IDCT algorithm is taken from:
- *    Y. A. Reznik, A. T. Hinds, L. Yu, Z. Ni, and C-X. Zhang,
- *    "Efficient fixed-point approximations of the 8x8 inverse discrete
- *    cosine transform" (invited paper), Proc. SPIE Vol. 6696, Sep. 24, 2007.
- *
- * which is based on:
- *   Christoph Loeffler, Adriaan Ligtenberg, George S. Moschytz,
- *   "Practical Fast 1-D DCT Algorithms with 11 Multiplications",
- *   IEEE Intl. Conf. on Acoustics, Speech & Signal Processing, 1989,
- *   988-991.
- *
- * The stage numbers mentioned in the comments refer to Figure 1 in the Loeffler paper.
- *
- * @param {Int32Array} qt quantization table
- * @param {Int32Array} zz zigzag-ordered coefficients
- * @param {Uint8Array|Uint8ClampedArray} dataOut
- */
-export function idct8x8_fixed(
-    qt,
-    zz,
-    dataOut,
-) {
-
-    // TODO check https://github.com/ONLYOFFICE/core/blob/f6c835668482d70e59202394434314c8863fc1cf/PdfFile/lib/xpdf/Stream.cc#L3582
-
-    let v0, v1, v2, v3, v4, v5, v6, v7, t;
-    let i;
-
-    // dequant
-    for (i = 0; i < 64; i++) {
-        p[i] = zz[i] * qt[i];
-    }
-
-    // inverse DCT on rows
-    for (i = 0; i < 8; ++i) {
-        const row = 8 * i;
-
-        // check for all-zero AC coefficients
-        if (p[1 + row] === 0
-            && p[2 + row] === 0
-            && p[3 + row] === 0
-            && p[4 + row] === 0
-            && p[5 + row] === 0
-            && p[6 + row] === 0
-            && p[7 + row] === 0
-        ) {
-
-            t = (dctSqrt2 * p[0 + row] + 512) >> 10;
-
-            p[0 + row] = t;
-            p[1 + row] = t;
-            p[2 + row] = t;
-            p[3 + row] = t;
-            p[4 + row] = t;
-            p[5 + row] = t;
-            p[6 + row] = t;
-            p[7 + row] = t;
-
-            continue;
-        }
-
-        // stage 4
-        v0 = (dctSqrt2 * p[0 + row] + 128) >> 8;
-        v1 = (dctSqrt2 * p[4 + row] + 128) >> 8;
-        v2 = p[2 + row];
-        v3 = p[6 + row];
-        v4 = (dctSqrt1d2 * (p[1 + row] - p[7 + row]) + 128) >> 8;
-        v7 = (dctSqrt1d2 * (p[1 + row] + p[7 + row]) + 128) >> 8;
-        v5 = p[3 + row] << 4;
-        v6 = p[5 + row] << 4;
-
-        // stage 3
-        t = (v0 - v1 + 1) >> 1;
-        v0 = (v0 + v1 + 1) >> 1;
-        v1 = t;
-        t = (v2 * dctSin6 + v3 * dctCos6 + 128) >> 8;
-        v2 = (v2 * dctCos6 - v3 * dctSin6 + 128) >> 8;
-        v3 = t;
-        t = (v4 - v6 + 1) >> 1;
-        v4 = (v4 + v6 + 1) >> 1;
-        v6 = t;
-        t = (v7 + v5 + 1) >> 1;
-        v5 = (v7 - v5 + 1) >> 1;
-        v7 = t;
-
-        // stage 2
-        t = (v0 - v3 + 1) >> 1;
-        v0 = (v0 + v3 + 1) >> 1;
-        v3 = t;
-        t = (v1 - v2 + 1) >> 1;
-        v1 = (v1 + v2 + 1) >> 1;
-        v2 = t;
-        t = (v4 * dctSin3 + v7 * dctCos3 + 2048) >> 12;
-        v4 = (v4 * dctCos3 - v7 * dctSin3 + 2048) >> 12;
-        v7 = t;
-        t = (v5 * dctSin1 + v6 * dctCos1 + 2048) >> 12;
-        v5 = (v5 * dctCos1 - v6 * dctSin1 + 2048) >> 12;
-        v6 = t;
-
-        // stage 1
-        p[0 + row] = v0 + v7;
-        p[7 + row] = v0 - v7;
-        p[1 + row] = v1 + v6;
-        p[6 + row] = v1 - v6;
-        p[2 + row] = v2 + v5;
-        p[5 + row] = v2 - v5;
-        p[3 + row] = v3 + v4;
-        p[4 + row] = v3 - v4;
-    }
-
-    // inverse DCT on columns
-    for (i = 0; i < 8; ++i) {
-        const col = i;
-
-        // check for all-zero AC coefficients
-        if (p[1 * 8 + col] === 0
-            && p[2 * 8 + col] === 0
-            && p[3 * 8 + col] === 0
-            && p[4 * 8 + col] === 0
-            && p[5 * 8 + col] === 0
-            && p[6 * 8 + col] === 0
-            && p[7 * 8 + col] === 0
-        ) {
-
-            t = (dctSqrt2 * p[i + 0] + 8192) >> 14;
-
-            p[0 * 8 + col] = t;
-            p[1 * 8 + col] = t;
-            p[2 * 8 + col] = t;
-            p[3 * 8 + col] = t;
-            p[4 * 8 + col] = t;
-            p[5 * 8 + col] = t;
-            p[6 * 8 + col] = t;
-            p[7 * 8 + col] = t;
-            continue;
-        }
-
-        // stage 4
-        v0 = (dctSqrt2 * p[0 * 8 + col] + 2048) >> 12;
-        v1 = (dctSqrt2 * p[4 * 8 + col] + 2048) >> 12;
-        v2 = p[2 * 8 + col];
-        v3 = p[6 * 8 + col];
-        v4 = (dctSqrt1d2 * (p[1 * 8 + col] - p[7 * 8 + col]) + 2048) >> 12;
-        v7 = (dctSqrt1d2 * (p[1 * 8 + col] + p[7 * 8 + col]) + 2048) >> 12;
-        v5 = p[3 * 8 + col];
-        v6 = p[5 * 8 + col];
-
-        // stage 3
-        t = (v0 - v1 + 1) >> 1;
-        v0 = (v0 + v1 + 1) >> 1;
-        v1 = t;
-        t = (v2 * dctSin6 + v3 * dctCos6 + 2048) >> 12;
-        v2 = (v2 * dctCos6 - v3 * dctSin6 + 2048) >> 12;
-        v3 = t;
-        t = (v4 - v6 + 1) >> 1;
-        v4 = (v4 + v6 + 1) >> 1;
-        v6 = t;
-        t = (v7 + v5 + 1) >> 1;
-        v5 = (v7 - v5 + 1) >> 1;
-        v7 = t;
-
-        // stage 2
-        t = (v0 - v3 + 1) >> 1;
-        v0 = (v0 + v3 + 1) >> 1;
-        v3 = t;
-        t = (v1 - v2 + 1) >> 1;
-        v1 = (v1 + v2 + 1) >> 1;
-        v2 = t;
-        t = (v4 * dctSin3 + v7 * dctCos3 + 2048) >> 12;
-        v4 = (v4 * dctCos3 - v7 * dctSin3 + 2048) >> 12;
-        v7 = t;
-        t = (v5 * dctSin1 + v6 * dctCos1 + 2048) >> 12;
-        v5 = (v5 * dctCos1 - v6 * dctSin1 + 2048) >> 12;
-        v6 = t;
-
-        // stage 1
-        p[0 * 8 + col] = v0 + v7;
-        p[7 * 8 + col] = v0 - v7;
-        p[1 * 8 + col] = v1 + v6;
-        p[6 * 8 + col] = v1 - v6;
-        p[2 * 8 + col] = v2 + v5;
-        p[5 * 8 + col] = v2 - v5;
-        p[3 * 8 + col] = v3 + v4;
-        p[4 * 8 + col] = v3 - v4;
-    }
-
-    // convert to 8-bit integers
-    for (i = 0; i < 64; ++i) {
-        const q = p[i];
-
-        // clip to 8-bit range
-        dataOut[i] = (q <= -2056) ? 0 : (q >= 2024) ? 255 : (q + 2056) >> 4;
-    }
-}

package/src/engine/asset/loaders/image/png/inflate.d.ts

@@ -1,7 +0,0 @@
-/**
- *
- * @param {Uint8Array} encoded_chunk
- * @returns {ArrayBuffer}
- */
-export function inflate(encoded_chunk: Uint8Array): ArrayBuffer;
-//# sourceMappingURL=inflate.d.ts.map

package/src/engine/asset/loaders/image/png/inflate.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"inflate.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/asset/loaders/image/png/inflate.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,uCAHW,UAAU,GACR,WAAW,CAcvB"}

package/src/engine/asset/loaders/image/png/inflate.js

@@ -1,20 +0,0 @@
-import zlib from "pako";
-
-/**
- *
- * @param {Uint8Array} encoded_chunk
- * @returns {ArrayBuffer}
- */
-export function inflate(encoded_chunk) {
-    const inflator = new zlib.Inflate();
-
-
-    inflator.push(encoded_chunk);
-
-    if (inflator.err) {
-        throw new Error(inflator.err);
-    }
-
-
-    return inflator.result.buffer;
-}

package/src/engine/save/GameStateLoader.d.ts

@@ -1,49 +0,0 @@
-export default GameStateLoader;
-declare class GameStateLoader extends EnginePlugin {
-    /**
-     *
-     * @type {Storage}
-     */
-    storage: Storage;
-    startup(): Promise<void>;
-    save(name: any, resolve: any, reject: any, progress: any): void;
-    /**
-     * @deprecated
-     * @param {string} name
-     * @param {function} resolve
-     * @param {function} reject
-     * @param {function} progress
-     */
-    legacyLoad(name: string, resolve: Function, reject: Function, progress: Function): void;
-    /**
-     * @deprecated
-     * @param name
-     * @param resolve
-     * @param reject
-     */
-    legacyExists(name: any, resolve: any, reject: any): void;
-    /**
-     *
-     * @param {string} name
-     * @param {function(ArrayBuffer)} resolve
-     * @param {(reason: *) => void} reject
-     * @param {function(number)} [progress]
-     */
-    load(name: string, resolve: (arg0: ArrayBuffer) => any, reject: (reason: any) => void, progress?: (arg0: number) => any): void;
-    /**
-     *
-     * @param {string} name
-     * @param {function(number)} resolve
-     * @param {function} reject
-     */
-    count(name: string, resolve: (arg0: number) => any, reject: Function): void;
-    /**
-     *
-     * @param {string} name
-     * @param {function(boolean)} resolve
-     * @param {function} reject
-     */
-    exists(name: string, resolve: (arg0: boolean) => any, reject: Function): void;
-}
-import { EnginePlugin } from "../plugin/EnginePlugin.js";
-//# sourceMappingURL=GameStateLoader.d.ts.map

package/src/engine/save/GameStateLoader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"GameStateLoader.d.ts","sourceRoot":"","sources":["../../../../src/engine/save/GameStateLoader.js"],"names":[],"mappings":";AAIA;IAII;;;OAGG;IACH,SAFU,OAAO,CAEF;IAEf,yBAEC;IAED,gEAeC;IAED;;;;;;OAMG;IACH,iBALW,MAAM,iEAShB;IAED;;;;;OAKG;IACH,yDAIC;IAED;;;;;;OAMG;IACH,WALW,MAAM,kBACG,WAAW,mCACL,IAAI,oBACV,MAAM,gBA6CzB;IAED;;;;;OAKG;IACH,YAJW,MAAM,kBACG,MAAM,kCAoBzB;IAED;;;;;OAKG;IACH,aAJW,MAAM,kBACG,OAAO,kCAwB1B;CACJ;6BAnK4B,2BAA2B"}

package/src/engine/save/GameStateLoader.js

@@ -1,168 +0,0 @@
-import { GameSaveStateMetadata } from "../../../../view/game/save/GameSaveStateMetadata.js";
-import { array_pick_best_element } from "../../core/collection/array/array_pick_best_element.js";
-import { EnginePlugin } from "../plugin/EnginePlugin.js";
-
-class GameStateLoader extends EnginePlugin {
-
-    id = 'game-state-loader';
-
-    /**
-     *
-     * @type {Storage}
-     */
-    storage = null;
-
-    async startup() {
-        this.storage = this.engine.storage;
-    }
-
-    save(name, resolve, reject, progress) {
-        const engine = this.engine;
-
-        const currentScene = engine.sceneManager.current_scene;
-
-
-        /**
-         *
-         * @type {GameSaveStateManager}
-         */
-        const gameSaves = engine.plugins.getById('game-save-state-manager');
-
-        const saveComplete = gameSaves.store({ scene: currentScene, name });
-        saveComplete.then(resolve, reject);
-
-    }
-
-    /**
-     * @deprecated
-     * @param {string} name
-     * @param {function} resolve
-     * @param {function} reject
-     * @param {function} progress
-     */
-    legacyLoad(name, resolve, reject, progress) {
-        console.warn('legacyLoad', name);
-
-        this.storage.loadBinary(name, resolve, reject, progress);
-    }
-
-    /**
-     * @deprecated
-     * @param name
-     * @param resolve
-     * @param reject
-     */
-    legacyExists(name, resolve, reject) {
-        console.warn('legacyExists', name);
-
-        this.storage.contains(name, resolve, reject);
-    }
-
-    /**
-     *
-     * @param {string} name
-     * @param {function(ArrayBuffer)} resolve
-     * @param {(reason: *) => void} reject
-     * @param {function(number)} [progress]
-     */
-    load(name, resolve, reject, progress) {
-        const engine = this.engine;
-
-
-        /**
-         *
-         * @type {GameSaveStateManager}
-         */
-        const gameSaves = engine.plugins.getById('game-save-state-manager');
-
-        gameSaves.update()
-            .then(() => {
-                /**
-                 *
-                 * @type {Array<GameSaveStateMetadata>}
-                 */
-                const matches = gameSaves.data.filter(m => {
-
-                    if (m.locked) {
-                        return false;
-                    }
-
-                    if (m.name === name) {
-                        return true;
-                    } else {
-                        return false;
-                    }
-                });
-
-                //find most recent
-                const mostRecent = array_pick_best_element(matches, m => m.timestamp);
-
-
-                if (mostRecent === undefined) {
-                    //try legacy
-                    return new Promise((lResolve, lReject) => this.legacyLoad(name, lResolve, lReject, progress));
-
-                } else {
-
-                    return gameSaves.loadData(mostRecent.id);
-                }
-
-            }).then(resolve, reject);
-    }
-
-    /**
-     *
-     * @param {string} name
-     * @param {function(number)} resolve
-     * @param {function} reject
-     */
-    count(name, resolve, reject) {
-        const engine = this.engine;
-
-        /**
-         *
-         * @type {GameSaveStateManager}
-         */
-        const gameSaves = engine.plugins.getById('game-save-state-manager');
-
-        gameSaves.update()
-            .then(() => {
-
-                const matches = gameSaves.data.filter(m => m.name === name);
-
-                resolve(matches.length);
-
-            });
-    }
-
-    /**
-     *
-     * @param {string} name
-     * @param {function(boolean)} resolve
-     * @param {function} reject
-     */
-    exists(name, resolve, reject) {
-        const engine = this.engine;
-
-        /**
-         *
-         * @type {GameSaveStateManager}
-         */
-        const gameSaves = engine.plugins.getById('game-save-state-manager');
-
-        gameSaves.update()
-            .then(() => {
-                const exists = gameSaves.data.some(m => !m.locked && (m.name === name));
-
-                if (!exists) {
-                    //try legacy
-                    this.legacyExists(name, resolve, reject);
-                } else {
-                    resolve(exists);
-                }
-
-            }).catch(reject);
-    }
-}
-
-export default GameStateLoader;