@woosh/meep-engine 2.96.0 → 2.98.0

package/src/core/parser/simple/readIdentifierToken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readIdentifierToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readIdentifierToken.js"],"names":[],"mappings":"AAYA;;;;;;GAMG;AACH,0CALW,MAAM,UACN,MAAM,UACN,MAAM,SA0BhB;AApCD;;;GAGG;AACH,uCAFU,MAAM,CAEqC"}
+{"version":3,"file":"readIdentifierToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readIdentifierToken.js"],"names":[],"mappings":"AAaA;;;;;;GAMG;AACH,0CALW,MAAM,UACN,MAAM,UACN,MAAM,SA8BhB;AAxCD;;;GAGG;AACH,uCAFU,MAAM,CAEqC"}

package/src/core/parser/simple/readIdentifierToken.js

@@ -1,7 +1,8 @@
+import { assert } from "../../assert.js";
+import DataType from "./DataType.js";
 import ParserError from "./ParserError.js";
 import Token from "./Token.js";
 import TokenType from "./TokenType.js";
-import DataType from "./DataType.js";
 
 const RX_IDENTIFIER_CHAR = /^[a-zA-Z0-9_]/;
 /**
@@ -18,6 +19,10 @@ export const RX_IDENTIFIER_FIRST_CHAR = /^[a-zA-Z_]/;
  * @returns {Token}
  */
 export function readIdentifierToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     let i = cursor;
 
 

package/src/core/parser/simple/readLiteralToken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readLiteralToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readLiteralToken.js"],"names":[],"mappings":"AA0DA;;;;;;GAMG;AACH,uCALW,MAAM,UACN,MAAM,UACN,MAAM,SA+BhB"}
+{"version":3,"file":"readLiteralToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readLiteralToken.js"],"names":[],"mappings":"AA2DA;;;;;;GAMG;AACH,uCALW,MAAM,UACN,MAAM,UACN,MAAM,SAmChB"}

package/src/core/parser/simple/readLiteralToken.js

@@ -1,10 +1,11 @@
-import { skipWhitespace } from "./skipWhitespace.js";
-import Token from "./Token.js";
+import { assert } from "../../assert.js";
 import DataType from "./DataType.js";
 import ParserError from "./ParserError.js";
 import { readBooleanToken } from "./readBooleanToken.js";
-import { readStringToken } from "./readStringToken.js";
 import { readNumberToken } from "./readNumberToken.js";
+import { readStringToken } from "./readStringToken.js";
+import { skipWhitespace } from "./skipWhitespace.js";
+import Token from "./Token.js";
 
 /**
  *
@@ -64,6 +65,10 @@ function readArrayLiteral(text, cursor, length) {
  * @returns {Token}
  */
 function readLiteralToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     const firstChar = text.charAt(cursor);
 
     switch (firstChar) {

package/src/core/parser/simple/readNumberToken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readNumberToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readNumberToken.js"],"names":[],"mappings":"AAOA;;;;;;GAMG;AACH,sCALW,MAAM,UACN,MAAM,UACN,MAAM,SA6DhB"}
+{"version":3,"file":"readNumberToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readNumberToken.js"],"names":[],"mappings":"AAQA;;;;;;GAMG;AACH,sCALW,MAAM,UACN,MAAM,UACN,MAAM,SAiEhB"}

package/src/core/parser/simple/readNumberToken.js

@@ -1,9 +1,10 @@
-import { skipWhitespace } from "./skipWhitespace.js";
+import { assert } from "../../assert.js";
+import DataType from "./DataType.js";
 import { readHexToken } from "./readHexToken.js";
 import { readUnsignedIntegerToken } from "./readUnsignedIntegerToken.js";
+import { skipWhitespace } from "./skipWhitespace.js";
 import Token from "./Token.js";
 import TokenType from "./TokenType.js";
-import DataType from "./DataType.js";
 
 /**
  *
@@ -13,6 +14,10 @@ import DataType from "./DataType.js";
  * @returns {Token}
  */
 export function readNumberToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     let i = cursor;
 
     //read optional sign

package/src/core/parser/simple/readReferenceToken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readReferenceToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readReferenceToken.js"],"names":[],"mappings":"AAMA;;;;;;GAMG;AACH,yDAJW,MAAM,UACN,MAAM,SAmChB"}
+{"version":3,"file":"readReferenceToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readReferenceToken.js"],"names":[],"mappings":"AAOA;;;;;;GAMG;AACH,yDAJW,MAAM,UACN,MAAM,SAuChB"}

package/src/core/parser/simple/readReferenceToken.js

@@ -1,7 +1,8 @@
+import { assert } from "../../assert.js";
 import DataType from "./DataType.js";
+import { readIdentifierToken } from "./readIdentifierToken.js";
 import Token from "./Token.js";
 import TokenType from "./TokenType.js";
-import { readIdentifierToken } from "./readIdentifierToken.js";
 
 
 /**
@@ -12,6 +13,10 @@ import { readIdentifierToken } from "./readIdentifierToken.js";
  * @returns {Token}
  */
 export function readReferenceToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     let i = cursor;
 
     const identifiers = [];

package/src/core/parser/simple/readStringToken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readStringToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readStringToken.js"],"names":[],"mappings":"AAqBA;;;;;;GAMG;AACH,sCALW,MAAM,UACN,MAAM,UACN,MAAM,SAoEhB"}
+{"version":3,"file":"readStringToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readStringToken.js"],"names":[],"mappings":"AAsBA;;;;;;GAMG;AACH,sCALW,MAAM,UACN,MAAM,UACN,MAAM,SAwEhB"}

package/src/core/parser/simple/readStringToken.js

@@ -1,7 +1,8 @@
+import { assert } from "../../assert.js";
+import DataType from "./DataType.js";
 import ParserError from "./ParserError.js";
 import Token from "./Token.js";
 import TokenType from "./TokenType.js";
-import DataType from "./DataType.js";
 
 /**
  *
@@ -27,6 +28,10 @@ function readQuote(text, cursor) {
  * @returns {Token}
  */
 export function readStringToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     let i = cursor;
 
     const openingQuote = readQuote(text, i);

package/src/core/parser/simple/readUnsignedIntegerToken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readUnsignedIntegerToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readUnsignedIntegerToken.js"],"names":[],"mappings":"AAIA;;;;;;GAMG;AACH,+CALW,MAAM,UACN,MAAM,UACN,MAAM,SAwDhB"}
+{"version":3,"file":"readUnsignedIntegerToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readUnsignedIntegerToken.js"],"names":[],"mappings":"AAKA;;;;;;GAMG;AACH,+CALW,MAAM,UACN,MAAM,UACN,MAAM,SA4DhB"}

package/src/core/parser/simple/readUnsignedIntegerToken.js

@@ -1,6 +1,7 @@
+import { assert } from "../../assert.js";
+import DataType from "./DataType.js";
 import ParserError from "./ParserError.js";
 import Token from "./Token.js";
-import DataType from "./DataType.js";
 
 /**
  *
@@ -10,6 +11,10 @@ import DataType from "./DataType.js";
  * @returns {Token}
  */
 export function readUnsignedIntegerToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     let i = cursor;
 
     let value = 0;
@@ -61,6 +66,6 @@ export function readUnsignedIntegerToken(text, cursor, length) {
     }
 
 
-    return new Token(value, cursor, i, null, DataType.Number);
+    return new Token(value, cursor, i, "uint", DataType.Number);
 }
 

package/src/core/parser/simple/skipWhitespace.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"skipWhitespace.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/skipWhitespace.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,qCALW,MAAM,UACN,MAAM,UACN,MAAM,GACJ,MAAM,CAelB"}
+{"version":3,"file":"skipWhitespace.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/skipWhitespace.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,qCALW,MAAM,UACN,MAAM,UACN,MAAM,GACJ,MAAM,CAqBlB"}

package/src/core/parser/simple/skipWhitespace.js

@@ -1,3 +1,5 @@
+import { assert } from "../../assert.js";
+
 /**
  *
  * @param {string} text
@@ -6,8 +8,13 @@
  * @returns {number}
  */
 export function skipWhitespace(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     let i = cursor;
     let char;
+
     while (i < length) {
         char = text.charAt(i);
 
@@ -17,5 +24,6 @@ export function skipWhitespace(text, cursor, length) {
             break;
         }
     }
+
     return i;
 }

package/src/core/primitives/strings/string_jaro_distance.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Calculate Jaro distance between two strings, this is a measure of string similarity. Higher value means more similarity.
+ * @param {string} first
+ * @param {string} second
+ * @param {number} first_length
+ * @param {number} second_length
+ * @return {number}
+ */
+export function string_jaro_distance(first: string, second: string, first_length: number, second_length: number): number;
+//# sourceMappingURL=string_jaro_distance.d.ts.map

package/src/core/primitives/strings/string_jaro_distance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"string_jaro_distance.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/string_jaro_distance.js"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AACH,4CANW,MAAM,UACN,MAAM,gBACN,MAAM,iBACN,MAAM,GACL,MAAM,CAmBjB"}

package/src/core/primitives/strings/string_jaro_distance.js

@@ -0,0 +1,127 @@
+import { BitSet } from "../../binary/BitSet.js";
+import { max2 } from "../../math/max2.js";
+import { min2 } from "../../math/min2.js";
+
+/**
+ * Calculate Jaro distance between two strings, this is a measure of string similarity. Higher value means more similarity.
+ * @param {string} first
+ * @param {string} second
+ * @param {number} first_length
+ * @param {number} second_length
+ * @return {number}
+ */
+export function string_jaro_distance(
+    first, second,
+    first_length, second_length
+) {
+
+    const matches1 = BitSet.fixedSize(first_length);
+    const matches2 = BitSet.fixedSize(second_length);
+
+    const matches = getMatching(first, second, matches1, matches2);
+
+    if (matches <= 0) {
+        return 0;
+    }
+
+    const transpositions = getTranspositions(first, second, matches1, matches2);
+    return (matches / first_length + matches / second_length + (matches - transpositions) / matches) / 3;
+
+}
+
+/**
+ * Find matching characters in both strings according to Jaro algorithm
+ * @param {string} a1
+ * @param {string} a2
+ * @param {BitSet} matches1
+ * @param {BitSet} matches2
+ * @return {number}
+ */
+function getMatching(a1, a2, matches1, matches2) {
+    const a1_length = a1.length;
+    const a2_length = a2.length;
+
+    // Window is modified to work with string of length 1
+    const matchWindow = max2(
+        0,
+        Math.floor(max2(a1_length, a2_length) * 0.5) - 1
+    );
+
+    let matches = 0;
+
+    // Loop to find matched characters:
+    for (let index1 = 0; index1 < a1_length; index1++) {
+
+        // Use the highest of the window diff and the min of the window and string 2 length:
+        const start = max2(0, index1 - matchWindow);
+        const end = min2(index1 + matchWindow + 1, a2_length);
+
+        // Iterate second string index:
+        for (let index2 = start; index2 < end; index2++) {
+
+            // If second string character already matched, skip:
+            if (matches2.get(index2)) {
+                continue;
+            }
+
+            // If the characters don't match, skip:
+            if (a1.charAt(index1) !== a2.charAt(index2)) {
+                continue;
+            }
+
+            // Assume match if the above 2 checks don't continue:
+            matches1.set(index1, true);
+            matches2.set(index2, true);
+
+            // Add matches by 1, break inner loop:
+            ++matches;
+            break;
+        }
+    }
+
+    return matches;
+}
+
+/**
+ * Calculate the number of transpositions between the two words
+ * @param {string} a1 The first string to compare
+ * @param {string} a2 The second string to compare
+ * @param {BitSet} matches1
+ * @param {BitSet} matches2
+ * @returns {number}
+ */
+function getTranspositions(
+    a1, a2,
+    matches1, matches2
+) {
+    let transpositions = 0;
+
+    // Loop to find transpositions:
+    const a1_length = a1.length;
+    const a2_length = a2.length;
+
+    for (let i1 = 0, i2 = 0; i1 < a1_length; i1++) {
+        // If a non-matching character was found, skip:
+        if (matches1.get(i1) === false) {
+            continue;
+        }
+
+        // Move i2 index to the next match:
+        while (
+            i2 < a2_length
+            && matches2.get(i2) === false
+            ) {
+            i2++;
+        }
+
+        // If the characters don't match, increase transposition:
+        if (a1.charAt(i1) !== a2.charAt(i2)) {
+            transpositions++;
+        }
+
+        // Iterate i2 index normally:
+        i2++;
+    }
+
+    return Math.floor(transpositions * 0.5);
+}

package/src/core/primitives/strings/string_jaro_winkler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"string_jaro_winkler.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/string_jaro_winkler.js"],"names":[],"mappings":"AAKA;;;;;GAKG;AACH,2CAJW,MAAM,UACN,MAAM,GACJ,MAAM,CA6BlB"}
+{"version":3,"file":"string_jaro_winkler.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/string_jaro_winkler.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,2CAJW,MAAM,UACN,MAAM,GACJ,MAAM,CAwBlB"}

package/src/core/primitives/strings/string_jaro_winkler.js

@@ -1,7 +1,5 @@
-import { BitSet } from "../../binary/BitSet.js";
-import { max2 } from "../../math/max2.js";
-import { min2 } from "../../math/min2.js";
 import { min3 } from "../../math/min3.js";
+import { string_jaro_distance } from "./string_jaro_distance.js";
 
 /**
  * Calculate the Jaro-Winkler distance between two strings
@@ -18,19 +16,14 @@ export function string_jaro_winkler(first, second) {
         return 1;
     }
 
-    const matches1 = BitSet.fixedSize(l1);
-    const matches2 = BitSet.fixedSize(l2);
-
-    const matches = getMatching(first, second, matches1, matches2);
+    // Calculate the Jaro distance:
+    const similarity = string_jaro_distance(first, second, l1, l2);
 
-    if (matches <= 0) {
+    if (similarity === 0) {
+        // no similarity at all
         return 0;
     }
 
-    // Calculate the Jaro distance:
-    const transpositions = getTranspositions(first, second, matches1, matches2);
-    const similarity = (matches / l1 + matches / l2 + (matches - transpositions) / matches) / 3;
-
     // Transform to Jaro-Winkler:
     // Prefix scale gives more favorable ratings to strings that share common prefixes:
     const prefix_scale = 0.1;
@@ -38,99 +31,6 @@ export function string_jaro_winkler(first, second) {
     return similarity + prefix * prefix_scale * (1 - similarity);
 }
 
-/**
- * Find matching characters in both strings according to Jaro algorithm
- * @param {string} a1
- * @param {string} a2
- * @param {BitSet} matches1
- * @param {BitSet} matches2
- * @return {number}
- */
-function getMatching(a1, a2, matches1, matches2) {
-    const a1_length = a1.length;
-    const a2_length = a2.length;
-
-    // Window is modified to work with string of length 1
-    const matchWindow = max2(
-        0,
-        Math.floor(max2(a1_length, a2_length) * 0.5) - 1
-    );
-
-    let matches = 0;
-
-    // Loop to find matched characters:
-    for (let index1 = 0; index1 < a1_length; index1++) {
-
-        // Use the highest of the window diff and the min of the window and string 2 length:
-        const start = max2(0, index1 - matchWindow);
-        const end = min2(index1 + matchWindow + 1, a2_length);
-
-        // Iterate second string index:
-        for (let index2 = start; index2 < end; index2++) {
-
-            // If second string character already matched, skip:
-            if (matches2.get(index2)) {
-                continue;
-            }
-
-            // If the characters don't match, skip:
-            if (a1.charAt(index1) !== a2.charAt(index2)) {
-                continue;
-            }
-
-            // Assume match if the above 2 checks don't continue:
-            matches1.set(index1, true);
-            matches2.set(index2, true);
-
-            // Add matches by 1, break inner loop:
-            ++matches;
-            break;
-        }
-    }
-
-    return matches;
-}
-
-/**
- * Calculate the number of transpositions between the two words
- * @param {string} a1 The first string to compare
- * @param {string} a2 The second string to compare
- * @param {BitSet} matches1
- * @param {BitSet} matches2
- */
-function getTranspositions(a1, a2, matches1, matches2) {
-    let transpositions = 0;
-
-    // Loop to find transpositions:
-    const a1_length = a1.length;
-    const a2_length = a2.length;
-
-    for (let i1 = 0, i2 = 0; i1 < a1_length; i1++) {
-        // If a non-matching character was found, skip:
-        if (matches1.get(i1) === false) {
-            continue;
-        }
-
-        // Move i2 index to the next match:
-        while (
-            i2 < a2_length
-            && matches2.get(i2) === false
-            ) {
-            i2++;
-        }
-
-        // If the characters don't match, increase transposition:
-        if (a1.charAt(i1) !== a2.charAt(i2)) {
-            transpositions++;
-        }
-
-        // Iterate i2 index normally:
-        i2++;
-    }
-
-    return Math.floor(transpositions * 0.5);
-}
-
 /**
  * Counts the number of common characters at the beginning
  * of each word up to a maximum of 4

package/src/core/primitives/strings/string_repeat.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Repeat a given piece of text a {@link count} times
+ * @example "ABC_" repeated 2 times results in "ABC_ABC_"
+ * @param {string} what
+ * @param {number} count
+ * @return {string}
+ */
+export function string_repeat(what: string, count: number): string;
+//# sourceMappingURL=string_repeat.d.ts.map

package/src/core/primitives/strings/string_repeat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"string_repeat.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/string_repeat.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,oCAJW,MAAM,SACN,MAAM,GACL,MAAM,CAkBjB"}

package/src/core/primitives/strings/string_repeat.js

@@ -0,0 +1,26 @@
+import { assert } from "../../assert.js";
+
+/**
+ * Repeat a given piece of text a {@link count} times
+ * @example "ABC_" repeated 2 times results in "ABC_ABC_"
+ * @param {string} what
+ * @param {number} count
+ * @return {string}
+ */
+export function string_repeat(what, count) {
+    assert.isString(what, 'what');
+    assert.isNonNegativeInteger(count, 'count');
+
+    if (count <= 0) {
+        // special case
+        return "";
+    }
+
+    let out = what;
+
+    for (let i = 1; i < count; i++) {
+        out += what;
+    }
+
+    return out;
+}

package/src/engine/asset/AssetManager.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AssetManager.d.ts","sourceRoot":"","sources":["../../../../src/engine/asset/AssetManager.js"],"names":[],"mappings":"AAiDA;;;;GAIG;AACH;IAgII;;;;;OAKG;IACH,oCAJW,GAAG,EAYb;IA7ID;;;;OAIG;IACH,eAEG;IAEH;;;OAGG;IACH,iBAA6C;IAe7C;;;;;;OAMG;IACH,kBAFU,MAAM,CAEY;IAyB5B;;;;OAIG;IACH,iBAAc;IAEd;;;OAGG;IACH,mBAFU,iBAAiB,CAEiB;IAwE5C,gBAQC;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACL,QAAQ,IAAI,CAAC,CAexB;IAED;;;;;OAKG;IACH,oCAFa,OAAO,CAOnB;IAED;;OAEG;IACH,cAEC;IAED,8BAEC;IAED;;;;;;OAMG;IACH,4DAJW,iBAAiB,GAEf,cAAc,CAY1B;IAED;;;;;;;;;OASG;IACH,qFAsCC;IAED;;;;;OAKG;IACH,aAJW,MAAM,QACN,MAAM,sBAehB;IAsQD;;;;;OAKG;IACH,sBA2BC;IAGD;;;;OAIG;IACH,uBAHW,MAAM,GACL,OAAO,CAIlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,GACJ,wBAAY,SAAS,CAMjC;IAaD;;;;OAIG;IACH,+BAHW,MAAM,4CAqBhB;IAED;;;;OAIG;IACH,iCAHW,MAAM,+CAyBhB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,iEAwChB;IAED;;;OAGG;IACH,uBAFW,MAAM,iBAkBhB;IAED;;;;;;OAMG;IACH,yCAFa,aAAS,IAAI,CAYzB;IAED;;;;;OAKG;IACH,eAJW,MAAM,QACN,MAAM,GACJ,OAAO,CAMnB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,mBAAiB,CAa5B;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,gBAAgB,GAAC,SAAS,CAQrC;IAED;;;;;OAKG;IACH,mBAJW,MAAM,QACN,MAAM,QACN,MAAM,QAUhB;IAGL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;;CANpC;kCA50BiC,6BAA6B;kCAD7B,wBAAwB;4BAE9B,0BAA0B;iCALrB,uBAAuB"}
+{"version":3,"file":"AssetManager.d.ts","sourceRoot":"","sources":["../../../../src/engine/asset/AssetManager.js"],"names":[],"mappings":"AAiDA;;;;GAIG;AACH;IAgII;;;;;OAKG;IACH,oCAJW,GAAG,EAYb;IA7ID;;;;OAIG;IACH,eAEG;IAEH;;;OAGG;IACH,aAFU,YAAY,gBAAgB,EAAE,YAAY,CAAC,CAER;IAe7C;;;;;;OAMG;IACH,kBAFU,MAAM,CAEY;IAyB5B;;;;OAIG;IACH,iBAAc;IAEd;;;OAGG;IACH,mBAFU,iBAAiB,CAEiB;IAwE5C,gBAQC;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACL,QAAQ,IAAI,CAAC,CAexB;IAED;;;;;OAKG;IACH,oCAFa,OAAO,CAOnB;IAED;;OAEG;IACH,cAEC;IAED,8BAEC;IAED;;;;;;OAMG;IACH,4DAJW,iBAAiB,GAEf,cAAc,CAY1B;IAED;;;;;;;;;OASG;IACH,qFAsCC;IAED;;;;;OAKG;IACH,aAJW,MAAM,QACN,MAAM,sBAehB;IAsQD;;;;;OAKG;IACH,sBA2BC;IAGD;;;;OAIG;IACH,uBAHW,MAAM,GACL,OAAO,CAIlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,GACJ,wBAAY,SAAS,CAMjC;IAaD;;;;OAIG;IACH,+BAHW,MAAM,4CAqBhB;IAED;;;;OAIG;IACH,iCAHW,MAAM,+CAyBhB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,iEAwChB;IAED;;;OAGG;IACH,uBAFW,MAAM,iBAkBhB;IAED;;;;;;OAMG;IACH,yCAFa,aAAS,IAAI,CAYzB;IAED;;;;;OAKG;IACH,eAJW,MAAM,QACN,MAAM,GACJ,OAAO,CAMnB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,mBAAiB,CAa5B;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,gBAAgB,GAAC,SAAS,CAQrC;IAED;;;;;OAKG;IACH,mBAJW,MAAM,QACN,MAAM,QACN,MAAM,QAUhB;IAGL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;;CANpC;4BAv1B2B,0CAA0C;iCAOrC,uBAAuB;6BAM3B,mBAAmB;kCAFd,6BAA6B;kCAD7B,wBAAwB;4BAE9B,0BAA0B"}

package/src/engine/development/performance/RingBufferMetric.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RingBufferMetric.d.ts","sourceRoot":"","sources":["../../../../../src/engine/development/performance/RingBufferMetric.js"],"names":[],"mappings":"AAOA;IACI,2BAUC;IAPG;;;;;OAKG;IACH,wBAAkC;IAGtC;;;OAGG;IACH,aAFW,MAAM,QAIhB;IAED,mBAEC;IAED,yBAEC;CAsCJ;+BAxE8B,qBAAqB"}
+{"version":3,"file":"RingBufferMetric.d.ts","sourceRoot":"","sources":["../../../../../src/engine/development/performance/RingBufferMetric.js"],"names":[],"mappings":"AAOA;IACI,2BAUC;IAPG;;;;;OAKG;IACH,wBAAkC;IAGtC;;;OAGG;IACH,aAFW,MAAM,QAIhB;IAED,mBAEC;IAED,yBAEC;CAsCJ;+BAnE8B,qBAAqB"}

package/src/engine/development/performance/RingBufferMetric.js

@@ -1,9 +1,9 @@
-import { AbstractMetric } from "./AbstractMetric.js";
+import { array_compute_max } from "../../../core/collection/array/array_compute_max.js";
+import { array_compute_min } from "../../../core/collection/array/array_compute_min.js";
 import { RingBuffer } from "../../../core/collection/RingBuffer.js";
 import { computeStatisticalMean } from "../../../core/math/statistics/computeStatisticalMean.js";
 import { computeStatisticalPartialMedian } from "../../../core/math/statistics/computeStatisticalPartialMedian.js";
-import { computeArrayMax } from "../../../core/collection/array/computeArrayMax.js";
-import { computeArrayMin } from "../../../core/collection/array/computeArrayMin.js";
+import { AbstractMetric } from "./AbstractMetric.js";
 
 export class RingBufferMetric extends AbstractMetric {
     constructor(size = 100) {
@@ -59,8 +59,8 @@ export class RingBufferMetric extends AbstractMetric {
 
             result.mean = computeStatisticalMean(array, 0, data_count);
             result.median = computeStatisticalPartialMedian(array, 0, data_count - 1);
-            result.max = computeArrayMax(array, 0, data_count);
-            result.min = computeArrayMin(array, 0, data_count);
+            result.max = array_compute_max(array, 0, data_count);
+            result.min = array_compute_min(array, 0, data_count);
 
             return true;
 

package/src/engine/ecs/terrain/ecs/BuildLightTexture.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BuildLightTexture.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/ecs/terrain/ecs/BuildLightTexture.js"],"names":[],"mappings":"AAmEA;;;;;;;;GAQG;AACH,gGAPW,MAAM,WAAW,gBAoC3B"}
+{"version":3,"file":"BuildLightTexture.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/ecs/terrain/ecs/BuildLightTexture.js"],"names":[],"mappings":"AAmEA;;;;;;;;GAQG;AACH,gGAPW,MAAM,WAAW,gBA6B3B"}

package/src/engine/ecs/terrain/ecs/BuildLightTexture.js

@@ -1,8 +1,8 @@
-import normalMap2AOMap from "../../grid/NormalMap2AOMap.js";
-import heightMap2NormalMap from "../../grid/HeightMap2NormalMap.js";
-import { WebGLRendererPool } from "../../../graphics/render/RendererPool.js";
 import Vector2 from "../../../../core/geom/Vector2.js";
+import { WebGLRendererPool } from "../../../graphics/render/RendererPool.js";
 import { writeSample2DDataToDataTexture } from "../../../graphics/texture/sampler/writeSampler2DDataToDataTexture.js";
+import heightMap2NormalMap from "../../grid/HeightMap2NormalMap.js";
+import normalMap2AOMap from "../../grid/NormalMap2AOMap.js";
 
 /**
  *
@@ -77,30 +77,23 @@ function promiseSamplerAO(
 export function buildLightTexture({
                                       texture,
                                       heightSampler,
-                                      resolution= new Vector2(texture.image.width, texture.image.height),
+                                      resolution = new Vector2(texture.image.width, texture.image.height),
                                       rayLength = 11,
                                       worldSize = resolution
                                   }) {
 
-    const renderer = WebGLRendererPool.global.get();
+    return WebGLRendererPool.global.useAsync(async renderer => {
+        const normal = promiseSamplerNormal(renderer, heightSampler);
 
-    const normal = promiseSamplerNormal(renderer, heightSampler);
-    const ao = promiseSamplerAO({
-        renderer: renderer,
-        pSamplerNormal: normal,
-        samplerHeight: heightSampler,
-        resolution: resolution,
-        rayLength: rayLength,
-        worldSize
-    });
+        const ao = await promiseSamplerAO({
+            renderer: renderer,
+            pSamplerNormal: normal,
+            samplerHeight: heightSampler,
+            resolution: resolution,
+            rayLength: rayLength,
+            worldSize
+        });
 
-    const promise = ao.then(sampler => {
-        writeSample2DDataToDataTexture(sampler, texture);
+        writeSample2DDataToDataTexture(ao, texture);
     });
-
-    Promise.all([normal, ao]).finally(() => {
-        WebGLRendererPool.global.release(renderer);
-    });
-
-    return promise;
 }

package/src/engine/graphics/ecs/camera/Camera.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Camera.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/ecs/camera/Camera.js"],"names":[],"mappings":"AAkBA;;GAEG;AACH;IA4II;;;;;;;OAOG;IACH,0BANW,MAAM,GAAC,MAAM,iBAAiB,GAAC,MAAM,kBAAkB,KACvD,MAAM,KACN,MAAM,UACN,OAAO,aACP,OAAO,QAwCjB;IAxLG;;;OAGG;IACH,UAFU,OAAO,CAEI;IAErB;;;OAGG;IACH,oBAFU,MAAM,CAEc;IAE9B,YAAkB;IAElB;;;OAGG;IACH,KAFU,OAAO,CAES;IAE1B;;;OAGG;IACH,gBAFU,aAAa,cAAc,CAAC,CAE4C;IAElF;;;OAGG;IACH,QAFU,eAAe,CAEc;IAEvC;;;;OAIG;IACH,mBAAqB;IAErB;;;;OAIG;IACH,oBAAsB;IAG1B;;;;OAIG;IACH,mEAEC;IAMD,0BAMC;IAVD,uBAEC;IAcD,2BAMC;IAVD,wBAEC;IAUD,uBAaC;IAED,2DAEC;IAED;;;OAGG;IACH,YAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,SAFa,MAAM,CAQlB;IAED;;;MAKC;IAED,0BAQC;IAkDD;;;OAGG;IACH,kDAUC;IAED;;;;;;;;;;OAUG;IACH,0BATW,OAAO,YACP,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,QAyBhB;IAED;;;;;;OAMG;IACH,kCALW,MAAM,KACN,MAAM,KACN,MAAM,UACN,OAAO,QAqBjB;CACJ;;;;;oBAvRmB,kCAAkC;yBAG7B,wCAAwC;+BAGpC,qBAAqB;4BAJtB,2CAA2C;oBADnD,kCAAkC"}
+{"version":3,"file":"Camera.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/ecs/camera/Camera.js"],"names":[],"mappings":"AAkBA;;GAEG;AACH;IA4II;;;;;;;OAOG;IACH,0BANW,MAAM,GAAC,MAAM,iBAAiB,GAAC,MAAM,kBAAkB,KACvD,MAAM,KACN,MAAM,cACN,OAAO,iBACP,OAAO,QA+CjB;IA/LG;;;OAGG;IACH,UAFU,OAAO,CAEI;IAErB;;;OAGG;IACH,oBAFU,MAAM,CAEc;IAE9B,YAAkB;IAElB;;;OAGG;IACH,KAFU,OAAO,CAES;IAE1B;;;OAGG;IACH,gBAFU,aAAa,cAAc,CAAC,CAE4C;IAElF;;;OAGG;IACH,QAFU,eAAe,CAEc;IAEvC;;;;OAIG;IACH,mBAAqB;IAErB;;;;OAIG;IACH,oBAAsB;IAG1B;;;;OAIG;IACH,mEAEC;IAMD,0BAMC;IAVD,uBAEC;IAcD,2BAMC;IAVD,wBAEC;IAUD,uBAaC;IAED,2DAEC;IAED;;;OAGG;IACH,YAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,SAFa,MAAM,CAQlB;IAED;;;MAKC;IAED,0BAQC;IAyDD;;;OAGG;IACH,kDAUC;IAED;;;;;;;;;;OAUG;IACH,0BATW,OAAO,YACP,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,QAyBhB;IAED;;;;;;OAMG;IACH,kCALW,MAAM,KACN,MAAM,KACN,MAAM,UACN,OAAO,QAqBjB;CACJ;;;;;oBA9RmB,kCAAkC;yBAG7B,wCAAwC;+BAGlC,qBAAqB;4BAJxB,2CAA2C;oBADnD,kCAAkC"}