@bldrs-ai/conway 0.17.852 → 0.17.882

package/compiled/src/indexing/interpolation_search_table_32.js

@@ -11,9 +11,7 @@ const littleEndian = uInt8[0] === 0x44;
  * @param end The end of the buffer.
  * @return {number} The closest found location.
  */
-function keySearch32(searchValue, buffer, 
-// eslint-disable-next-line default-param-last
-offset = 0, end) {
+function keySearch32(searchValue, buffer, offset = 0, end) {
     let right = (end ?? buffer.length) >>> 0;
     searchValue >>>= 0;
     while (offset < right) {
@@ -36,9 +34,7 @@ offset = 0, end) {
  * @param end The end of the buffer.
  * @return {number} The closest found location.
  */
-function keyProbe32(searchValue, buffer, 
-// eslint-disable-next-line default-param-last
-offset = 0, end) {
+function keyProbe32(searchValue, buffer, offset = 0, end) {
     const right = (end ?? buffer.length) >>> 0;
     searchValue >>>= 0;
     while (offset < right) {
@@ -55,6 +51,14 @@ offset = 0, end) {
  * to 32bit unsigned integers.
  */
 export default class InterpolationSearchTable32 {
+    /**
+     * Get the number of items in this.
+     *
+     * @return {number} The number of itmes in this.
+     */
+    get size() {
+        return this.keyValues_.length >>> 1;
+    }
     /**
      * Construct the interpolation search table
      *
@@ -63,6 +67,7 @@ export default class InterpolationSearchTable32 {
      * and so on.
      *
      * This will be mutated in-place, so copy if you do not wish the array to be mutated.
+     * @param alreadySorted Are the keys already sorted?
      */
     constructor(keyValues_, alreadySorted = false) {
         this.keyValues_ = keyValues_;
@@ -123,14 +128,6 @@ export default class InterpolationSearchTable32 {
             interpolationTable[bucketIndex + 1] += interpolationTable[bucketIndex];
         }
     }
-    /**
-     * Get the number of items in this.
-     *
-     * @return {number} The number of itmes in this.
-     */
-    get size() {
-        return this.keyValues_.length >>> 1;
-    }
     /**
      * Implements Map Foreach.
      *
@@ -139,6 +136,7 @@ export default class InterpolationSearchTable32 {
      */
     forEach(callbackfn, thisArg) {
         const keyValues = this.keyValues_;
+        // eslint-disable-next-line @typescript-eslint/no-this-alias
         thisArg ??= this;
         for (let where = 0, end = keyValues.length; where < end; where += 2) {
             const value = keyValues[where];

package/compiled/src/indexing/interpolation_search_table_32.test.js

@@ -44,7 +44,6 @@ const notInsertSet = [];
     }
 }
 const matchingMap = new Map();
-// eslint-disable-next-line no-magic-numbers
 for (let where = 0; where < insertSet.length; where += 2) {
     matchingMap.set(insertSet[where + 1], insertSet[where]);
 }

package/compiled/src/indexing/minimal_perfect_hash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"minimal_perfect_hash.d.ts","sourceRoot":"","sources":["../../../src/indexing/minimal_perfect_hash.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,cAAc,CAAA;AAGpC;;GAEG;AACH,MAAM,CAAC,OAAO,OAAO,kBAAkB,CAAE,SAAS,SAAS,MAAM,CAAG,YAClE,WAAW,CAAE,UAAU,EAAE,SAAS,CAAE,EAAE,SAAS,CAAE,SAAS,CAAE;IAc1D,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,aAAa;IAC9B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAd3B;;;;;;;;;OASG;gBAEgB,KAAK,EAAE,UAAU,EACjB,aAAa,EAAE,WAAW,EAC1B,QAAQ,EAAE,UAAU,EACpB,QAAQ,EAAE,UAAU;IAGvC;;;;OAIG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAIrE;;;;OAIG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACI,OAAO,CACV,UAAU,EAAE,CACR,KAAK,EAAE,SAAS,EAChB,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,kBAAkB,CAAE,SAAS,CAAE,KAAK,IAAI,EACjD,OAAO,CAAC,EAAE,GAAG,GAAI,IAAI;IAkBzB;;;;;;OAMG;IACK,OAAO,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAgB5D;;;;;OAKG;IACK,IAAI,IAAI,gBAAgB,CAAC,UAAU,CAAC;IAgB5C;;;;;OAKG;IACK,MAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC;IAY7C;;;;;;;OAOG;IACI,GAAG,CAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAI,OAAO;IAIxE;;;;;;;;OAQG;IACI,GAAG,CAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAI,SAAS,GAAG,SAAS;CAqCvF"}
+{"version":3,"file":"minimal_perfect_hash.d.ts","sourceRoot":"","sources":["../../../src/indexing/minimal_perfect_hash.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,cAAc,CAAA;AAGpC;;GAEG;AACH,MAAM,CAAC,OAAO,OAAO,kBAAkB,CAAE,SAAS,SAAS,MAAM,CAAG,YAClE,WAAW,CAAE,UAAU,EAAE,SAAS,CAAE,EAAE,SAAS,CAAE,SAAS,CAAE;IAc1D,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,aAAa;IAC9B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAd3B;;;;;;;;;OASG;gBAEgB,KAAK,EAAE,UAAU,EACjB,aAAa,EAAE,WAAW,EAC1B,QAAQ,EAAE,UAAU,EACpB,QAAQ,EAAE,UAAU;IAGvC;;;;OAIG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAIrE;;;;OAIG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACI,OAAO,CACV,UAAU,EAAE,CACR,KAAK,EAAE,SAAS,EAChB,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,kBAAkB,CAAE,SAAS,CAAE,KAAK,IAAI,EACjD,OAAO,CAAC,EAAE,GAAG,GAAI,IAAI;IAmBzB;;;;;;OAMG;IACK,OAAO,IAAI,gBAAgB,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAgB5D;;;;;OAKG;IACK,IAAI,IAAI,gBAAgB,CAAC,UAAU,CAAC;IAgB5C;;;;;OAKG;IACK,MAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC;IAY7C;;;;;;;OAOG;IACI,GAAG,CAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAI,OAAO;IAIxE;;;;;;;;OAQG;IACI,GAAG,CAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAI,SAAS,GAAG,SAAS;CAqCvF"}

package/compiled/src/indexing/minimal_perfect_hash.js

@@ -3,7 +3,6 @@ import { blobEquals, fnv1a as fnv1A, fnv1a24 as fnv1A24 } from './hashing';
  * A minimal perfect hash indexing lookup that
  */
 export default class MinimalPerfectHash {
-    /* eslint-disable no-useless-constructor, no-empty-function */
     /**
      *
      * @param gMap_ The G mapping (see minimum perfect hashing algorithm)
@@ -20,7 +19,6 @@ export default class MinimalPerfectHash {
         this.slotMap_ = slotMap_;
         this.keyBlob_ = keyBlob_;
     }
-    /* eslint-enable no-useless-constructor, no-empty-function */
     /**
      * Iterates through this (alias for this.entries() that works with for of loop).
      *
@@ -47,6 +45,7 @@ export default class MinimalPerfectHash {
         const slotMap = this.slotMap_;
         const keyPrefixSum = this.keyPrefixSum_;
         const keyBlob = this.keyBlob_;
+        // eslint-disable-next-line @typescript-eslint/no-this-alias
         thisArg ??= this;
         for (let where = 0, end = slotMap.length; where < end; ++where) {
             const slotValue = slotMap[where];

package/compiled/src/indexing/multi_index_set.js

@@ -5,7 +5,6 @@ import { SingleIndexSetCursor } from './single_index_set_cursor';
  * A set of indices each associated with a number identifier.
  */
 export class MultiIndexSet {
-    /* eslint-disable no-useless-constructor, no-empty-function */
     /**
      * Construct this with a prefix sum table and matching elements table.
      *
@@ -21,7 +20,6 @@ export class MultiIndexSet {
         this.prefixSumTable_ = prefixSumTable_;
         this.elements_ = elements_;
     }
-    /* eslint-enable no-useless-constructor, no-empty-function */
     /**
      * All the types with a non-zero size in the index.
      *
@@ -47,9 +45,7 @@ export class MultiIndexSet {
             return false;
         }
         const prefixSum = this.prefixSumTable_;
-        // eslint-disable-next-line no-magic-numbers
         const indexOffset = prefixSum[indexType] * 2;
-        // eslint-disable-next-line no-magic-numbers
         const indexEnd = prefixSum[indexType + 1] * 2;
         return indexSetPointQuery32(denseIndex, this.elements_, indexOffset, indexEnd);
     }

package/compiled/src/indexing/multi_index_set_cursor_or.d.ts

@@ -39,6 +39,7 @@ export declare class MultiIndexSetCursorOr implements IIndexSetCursor {
     /**
      * Allocate a MultiIndexSetCursorOr, re-using freed ones in the pool.
      *
+     * @param buffer
      * @return {MultiIndexSetCursorOr} The allocated cursor.
      */
     static allocate(buffer: Uint32Array): MultiIndexSetCursorOr;

package/compiled/src/indexing/multi_index_set_cursor_or.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"multi_index_set_cursor_or.d.ts","sourceRoot":"","sources":["../../../src/indexing/multi_index_set_cursor_or.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAO5D;;;;;GAKG;AACH,qBAAa,qBAAsB,YAAW,eAAe;IAC3D,OAAO,CAAC,OAAO,CAAC,CAAa;IAC7B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,eAAe,CAAY;IACnC,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,IAAI,CAAY;IAExB;;OAEG;IACH,OAAO;IAIP;;;;;OAKG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACH,IAAW,GAAG,IAAI,MAAM,CAEvB;IAED;;;;;OAKG;IACI,IAAI,IAAI,OAAO;IAqDtB;;;;OAIG;WACW,QAAQ,CAAE,MAAM,EAAE,WAAW,GAAI,qBAAqB;IAepE;;;;;OAKG;IACI,QAAQ,CAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAI,IAAI;IAsBjD;;OAEG;IACI,IAAI,IAAI,IAAI;CAIpB"}
+{"version":3,"file":"multi_index_set_cursor_or.d.ts","sourceRoot":"","sources":["../../../src/indexing/multi_index_set_cursor_or.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAO5D;;;;;GAKG;AACH,qBAAa,qBAAsB,YAAW,eAAe;IAC3D,OAAO,CAAC,OAAO,CAAC,CAAa;IAC7B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,eAAe,CAAY;IACnC,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,IAAI,CAAY;IAExB;;OAEG;IACH,OAAO;IAIP;;;;;OAKG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACH,IAAW,GAAG,IAAI,MAAM,CAEvB;IAED;;;;;OAKG;IACI,IAAI,IAAI,OAAO;IAqDtB;;;;;OAKG;WACW,QAAQ,CAAE,MAAM,EAAE,WAAW,GAAI,qBAAqB;IAepE;;;;;OAKG;IACI,QAAQ,CAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAI,IAAI;IAsBjD;;OAEG;IACI,IAAI,IAAI,IAAI;CAIpB"}

package/compiled/src/indexing/multi_index_set_cursor_or.js

@@ -48,7 +48,6 @@ export class MultiIndexSetCursorOr {
         const setEnd = this.currentOpCount_ << 1;
         const buffer = this.buffer_;
         let result = false;
-        // eslint-disable-next-line no-magic-numbers
         for (let where = 0; where < setEnd; where += 2) {
             const opPosition = cursorSet[where];
             const opEnd = cursorSet[where + 1];
@@ -64,14 +63,12 @@ export class MultiIndexSetCursorOr {
             return false;
         }
         let currentLow = 0;
-        // eslint-disable-next-line no-magic-numbers
         for (let where = 0; where < setEnd; where += 2) {
             const opPosition = cursorSet[where];
             const opEnd = cursorSet[where + 1];
             if (opPosition < opEnd) {
                 const bufferHigh = buffer[opPosition] & MASK_TOPBITS;
                 if (lowestHigh === bufferHigh) {
-                    // eslint-disable-next-line no-magic-numbers
                     this.cursorSet_[where] = opPosition + 2;
                     currentLow |= buffer[opPosition + 1];
                 }
@@ -84,6 +81,7 @@ export class MultiIndexSetCursorOr {
     /**
      * Allocate a MultiIndexSetCursorOr, re-using freed ones in the pool.
      *
+     * @param buffer
      * @return {MultiIndexSetCursorOr} The allocated cursor.
      */
     static allocate(buffer) {
@@ -106,17 +104,14 @@ export class MultiIndexSetCursorOr {
      */
     addRange(from, to) {
         if ((this.cursorSet_.length >>> 1) <= this.currentOpCount_) {
-            // eslint-disable-next-line no-magic-numbers
             const newLength = this.currentOpCount_ * 4;
             const newCursorSet = new Uint32Array(newLength);
             newCursorSet.set(this.cursorSet_);
             this.cursorSet_ = newCursorSet;
         }
-        /* eslint-disable no-magic-numbers */
         const opIndex = this.currentOpCount_ * 2;
         this.cursorSet_[opIndex] = from * 2;
         this.cursorSet_[opIndex + 1] = to * 2;
-        /* eslint-enable no-magic-numbers */
         ++this.currentOpCount_;
     }
     /**

package/compiled/src/indexing/multi_index_set_cursor_xor.d.ts

@@ -40,6 +40,7 @@ export declare class MultiIndexSetCursorXor implements IIndexSetCursor {
     /**
      * Allocate a MultiIndexSetCursorXor, re-using freed ones in the pool.
      *
+     * @param buffer
      * @return {MultiIndexSetCursorXor} The allocated cursor.
      */
     static allocate(buffer: Uint32Array): MultiIndexSetCursorXor;

package/compiled/src/indexing/multi_index_set_cursor_xor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"multi_index_set_cursor_xor.d.ts","sourceRoot":"","sources":["../../../src/indexing/multi_index_set_cursor_xor.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAQ5D;;;;;;GAMG;AACH,qBAAa,sBAAuB,YAAW,eAAe;IAC5D,OAAO,CAAC,OAAO,CAAC,CAAa;IAC7B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,eAAe,CAAY;IACnC,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,IAAI,CAAY;IAExB;;OAEG;IACH,OAAO;IAIP;;;;;OAKG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACH,IAAW,GAAG,IAAI,MAAM,CAEvB;IAED;;;;;OAKG;IACI,IAAI,IAAI,OAAO;IA6DtB;;;;OAIG;WACW,QAAQ,CAAE,MAAM,EAAE,WAAW,GAAI,sBAAsB;IAerE;;;;;OAKG;IACI,QAAQ,CAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAI,IAAI;IAmBjD;;OAEG;IACI,IAAI,IAAI,IAAI;CAIpB"}
+{"version":3,"file":"multi_index_set_cursor_xor.d.ts","sourceRoot":"","sources":["../../../src/indexing/multi_index_set_cursor_xor.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAQ5D;;;;;;GAMG;AACH,qBAAa,sBAAuB,YAAW,eAAe;IAC5D,OAAO,CAAC,OAAO,CAAC,CAAa;IAC7B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,eAAe,CAAY;IACnC,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,IAAI,CAAY;IAExB;;OAEG;IACH,OAAO;IAIP;;;;;OAKG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACH,IAAW,GAAG,IAAI,MAAM,CAEvB;IAED;;;;;OAKG;IACI,IAAI,IAAI,OAAO;IA6DtB;;;;;OAKG;WACW,QAAQ,CAAE,MAAM,EAAE,WAAW,GAAI,sBAAsB;IAerE;;;;;OAKG;IACI,QAAQ,CAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAI,IAAI;IAmBjD;;OAEG;IACI,IAAI,IAAI,IAAI;CAIpB"}

package/compiled/src/indexing/multi_index_set_cursor_xor.js

@@ -55,7 +55,6 @@ export class MultiIndexSetCursorXor {
             const cursorSet = this.cursorSet_;
             const setEnd = this.currentOpCount_ << 1;
             const buffer = this.buffer_;
-            // eslint-disable-next-line no-magic-numbers
             for (let where = 0; where < setEnd; where += 2) {
                 const opPosition = cursorSet[where];
                 const opEnd = cursorSet[where + 1];
@@ -70,14 +69,12 @@ export class MultiIndexSetCursorXor {
             if (!result) {
                 return false;
             }
-            // eslint-disable-next-line no-magic-numbers
             for (let where = 0; where < setEnd; where += 2) {
                 const opPosition = cursorSet[where];
                 const opEnd = cursorSet[where + 1];
                 if (opPosition < opEnd) {
                     const bufferHigh = buffer[opPosition] & MASK_TOPBITS;
                     if (lowestHigh === bufferHigh) {
-                        // eslint-disable-next-line no-magic-numbers
                         this.cursorSet_[where] = opPosition + 2;
                         currentLow ^= buffer[opPosition + 1];
                     }
@@ -91,6 +88,7 @@ export class MultiIndexSetCursorXor {
     /**
      * Allocate a MultiIndexSetCursorXor, re-using freed ones in the pool.
      *
+     * @param buffer
      * @return {MultiIndexSetCursorXor} The allocated cursor.
      */
     static allocate(buffer) {
@@ -113,7 +111,6 @@ export class MultiIndexSetCursorXor {
      */
     addRange(from, to) {
         if ((this.cursorSet_.length >>> 1) <= this.currentOpCount_) {
-            /* eslint-disable no-magic-numbers */
             const newLength = this.currentOpCount_ * 4;
             const newCursorSet = new Uint32Array(newLength);
             newCursorSet.set(this.cursorSet_);
@@ -122,7 +119,6 @@ export class MultiIndexSetCursorXor {
         const opIndex = this.currentOpCount_ * 2;
         this.cursorSet_[opIndex] = from * 2;
         this.cursorSet_[opIndex + 1] = to * 2;
-        /* eslint-enable no-magic-numbers */
     }
     /**
      * Free this back to the pool.

package/compiled/src/indexing/search_operations.d.ts

@@ -15,7 +15,7 @@ export declare function indexSetSearch32(searchValue: number, buffer: Uint32Arra
  * @param buffer The index set to search in.
  * @param offset The offset to the start of the range to search
  * @param end The end of the buffer.
- * @return {number} The closest found location.
+ * @return {boolean} True if the item is in the set.
  */
 export declare function indexSetPointQuery32(searchValue: number, buffer: Uint32Array, offset?: number, end?: number): boolean;
 //# sourceMappingURL=search_operations.d.ts.map

package/compiled/src/indexing/search_operations.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search_operations.d.ts","sourceRoot":"","sources":["../../../src/indexing/search_operations.ts"],"names":[],"mappings":"AAMA;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC5B,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EAEnB,MAAM,GAAE,MAAU,EAClB,GAAG,CAAC,EAAE,MAAM,GAAI,MAAM,CAkBzB;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAChC,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EAEnB,MAAM,GAAE,MAAU,EAClB,GAAG,CAAC,EAAE,MAAM,GAAI,OAAO,CAQ1B"}
+{"version":3,"file":"search_operations.d.ts","sourceRoot":"","sources":["../../../src/indexing/search_operations.ts"],"names":[],"mappings":"AAMA;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC5B,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EAEnB,MAAM,GAAE,MAAU,EAClB,GAAG,CAAC,EAAE,MAAM,GAAI,MAAM,CAkBzB;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAChC,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EACnB,MAAM,GAAE,MAAU,EAClB,GAAG,CAAC,EAAE,MAAM,GAAI,OAAO,CAQ1B"}

package/compiled/src/indexing/search_operations.js

@@ -10,16 +10,13 @@ const MASK_TOPBITS = IndexSetConstants.MASK_TOPBITS;
  * @param end The end of the buffer.
  * @return {number} The closest found location.
  */
-export function indexSetSearch32(searchValue, buffer, 
-// eslint-disable-next-line default-param-last
-offset = 0, end) {
+export function indexSetSearch32(searchValue, buffer, offset = 0, end) {
     let right = end ?? buffer.length;
     searchValue &= MASK_TOPBITS;
     searchValue >>>= 0;
     while (offset < right) {
         const mid = ((offset + right) >>> 1) & (~1 >>> 0);
         if (buffer[mid] < searchValue) {
-            // eslint-disable-next-line no-magic-numbers
             offset = mid + 2;
         }
         else {
@@ -35,11 +32,9 @@ offset = 0, end) {
  * @param buffer The index set to search in.
  * @param offset The offset to the start of the range to search
  * @param end The end of the buffer.
- * @return {number} The closest found location.
+ * @return {boolean} True if the item is in the set.
  */
-export function indexSetPointQuery32(searchValue, buffer, 
-// eslint-disable-next-line default-param-last
-offset = 0, end) {
+export function indexSetPointQuery32(searchValue, buffer, offset = 0, end) {
     const newOffset = indexSetSearch32(searchValue, buffer, offset, end);
     const lowPartOneHot = (1 << (searchValue & MASK_BOTTOMBITS)) >>> 0;
     return (newOffset < buffer.length &&

package/compiled/src/indexing/single_index_set.d.ts

@@ -10,6 +10,8 @@ export declare class SingleIndexSet {
     /**
      * Construct this with a matching elements table.
      *
+     * @param start_
+     * @param end_
      * @param elements_ The elements in the index, matching the start->end indices * 2,
      * where there's 2 elements in the array for each item,
      * packed (first has the bottom 5 bits masked out, and is the top bits, the second
@@ -26,16 +28,14 @@ export declare class SingleIndexSet {
     /**
      * Does the set have a particular index for a particular type.
      *
-     * @param indexType The index type to check for.
      * @param denseIndex The dense index in the set to check.
      * @return {boolean} True if it has the type.
      */
     has(denseIndex: number): boolean;
     /**
-     * Get a cursor that lets you iterate over the union of the sets of multiple indices.
+     * Get a cursor that lets you iterate over the items in this set.
      *
-     * @param indexTypes The list of types to build a cursor out of.
-     * @return {IIndexSetCursor} The cursor for the list of types.
+     * @return {IIndexSetCursor} The returned cursor.
      */
     cursor(): IIndexSetCursor;
     /**

package/compiled/src/indexing/single_index_set.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"single_index_set.d.ts","sourceRoot":"","sources":["../../../src/indexing/single_index_set.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAA;AAWlE;;GAEG;AACH,qBAAa,cAAc;IAYvB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAZ5B;;;;;;;;OAQG;gBAEgB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,WAAW;IAGzC;;;;OAIG;IACH,IAAW,MAAM,IAAI,mBAAmB,CAEvC;IAED;;;;;;OAMG;IACI,GAAG,CAAE,UAAU,EAAE,MAAM,GAAI,OAAO;IAIzC;;;;;OAKG;IACI,MAAM,IAAI,eAAe;IAMhC;;;;;OAKG;WACW,uBAAuB,CAAE,OAAO,EAAE,MAAM,GAAI,cAAc;IAgBxE;;;;;OAKG;WACW,kBAAkB,CAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,mBAAmB,GAAI,cAAc;CA0B7F"}
+{"version":3,"file":"single_index_set.d.ts","sourceRoot":"","sources":["../../../src/indexing/single_index_set.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAA;AAWlE;;GAEG;AACH,qBAAa,cAAc;IAcvB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAd5B;;;;;;;;;;OAUG;gBAEgB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,WAAW;IAGzC;;;;OAIG;IACH,IAAW,MAAM,IAAI,mBAAmB,CAEvC;IAED;;;;;OAKG;IACI,GAAG,CAAE,UAAU,EAAE,MAAM,GAAI,OAAO;IAIzC;;;;OAIG;IACI,MAAM,IAAI,eAAe;IAMhC;;;;;OAKG;WACW,uBAAuB,CAAE,OAAO,EAAE,MAAM,GAAI,cAAc;IAgBxE;;;;;OAKG;WACW,kBAAkB,CAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,mBAAmB,GAAI,cAAc;CA0B7F"}

package/compiled/src/indexing/single_index_set.js

@@ -1,16 +1,16 @@
 import { addCompactedElement32State, addCompactedElementCount32State, initCountCompactedElements32State } from './bit_operations';
 import { indexSetPointQuery32 } from './search_operations';
 import { SingleIndexSetCursor } from './single_index_set_cursor';
-// eslint-disable-next-line no-magic-numbers
 const localState = new Int32Array(2);
 /**
  * A single set of indices
  */
 export class SingleIndexSet {
-    /* eslint-disable no-useless-constructor, no-empty-function */
     /**
      * Construct this with a matching elements table.
      *
+     * @param start_
+     * @param end_
      * @param elements_ The elements in the index, matching the start->end indices * 2,
      * where there's 2 elements in the array for each item,
      * packed (first has the bottom 5 bits masked out, and is the top bits, the second
@@ -22,7 +22,6 @@ export class SingleIndexSet {
         this.end_ = end_;
         this.elements_ = elements_;
     }
-    /* eslint-enable no-useless-constructor, no-empty-function */
     /**
      * Get the buffer elements from this (treat as immutable)
      *
@@ -34,7 +33,6 @@ export class SingleIndexSet {
     /**
      * Does the set have a particular index for a particular type.
      *
-     * @param indexType The index type to check for.
      * @param denseIndex The dense index in the set to check.
      * @return {boolean} True if it has the type.
      */
@@ -42,10 +40,9 @@ export class SingleIndexSet {
         return indexSetPointQuery32(denseIndex, this.elements_, this.start_, this.end_ << 1);
     }
     /**
-     * Get a cursor that lets you iterate over the union of the sets of multiple indices.
+     * Get a cursor that lets you iterate over the items in this set.
      *
-     * @param indexTypes The list of types to build a cursor out of.
-     * @return {IIndexSetCursor} The cursor for the list of types.
+     * @return {IIndexSetCursor} The returned cursor.
      */
     cursor() {
         return SingleIndexSetCursor.allocate(this.elements_, this.start_, this.end_);

package/compiled/src/indexing/single_index_set.test.js

@@ -1,12 +1,12 @@
 import { describe, expect, test } from '@jest/globals';
 import { SingleIndexSet } from './single_index_set';
 import { cursorIterator } from './cursor_utilities';
+// Test file is number heavy - CS
 /* eslint-disable no-magic-numbers */
 const ID_SET = [
     9, 17, 31, 102, 103, 1042, 1045, 1046,
     63212, 68993, 68994, (1 << 24) + 1023, (1 << 24) + 1024,
 ];
-/* eslint-enable no-magic-numbers */
 const PERMUTE_CONSTANT = 237;
 /**
  * Build a single id set from an array of mock local IDs and test

package/compiled/src/indexing/single_index_set_cursor.d.ts

@@ -36,6 +36,9 @@ export declare class SingleIndexSetCursor implements IIndexSetCursor {
     /**
      * Allocate a SingleIndexSetCursor, re-using freed ones in the pool.
      *
+     * @param buffer
+     * @param currentIndex
+     * @param end
      * @return {SingleIndexSetCursor} The allocated cursor.
      */
     static allocate(buffer: Uint32Array, currentIndex?: number, // note, ? is default undefined

package/compiled/src/indexing/single_index_set_cursor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"single_index_set_cursor.d.ts","sourceRoot":"","sources":["../../../src/indexing/single_index_set_cursor.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAK5D;;GAEG;AACH,qBAAa,oBAAqB,YAAW,eAAe;IAC1D,OAAO,CAAC,OAAO,CAAC,CAAa;IAE7B,OAAO,CAAC,aAAa,CAAY;IACjC,OAAO,CAAC,IAAI,CAAY;IAExB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,IAAI,CAAY;IAGxB;;OAEG;IACH,OAAO;IAGP;;;;;OAKG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACH,IAAW,GAAG,IAAI,MAAM,CAEvB;IAED;;;;;OAKG;IACI,IAAI,IAAI,OAAO;IAkBtB;;;;OAIG;WACW,QAAQ,CAClB,MAAM,EAAE,WAAW,EAEnB,YAAY,GAAE,MAAU,EAAE,+BAA+B;IACzD,GAAG,CAAC,EAAE,MAAM,GAAI,oBAAoB;IAsBxC;;OAEG;IACI,IAAI,IAAI,IAAI;CAIpB"}
+{"version":3,"file":"single_index_set_cursor.d.ts","sourceRoot":"","sources":["../../../src/indexing/single_index_set_cursor.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAA;AAK5D;;GAEG;AACH,qBAAa,oBAAqB,YAAW,eAAe;IAC1D,OAAO,CAAC,OAAO,CAAC,CAAa;IAE7B,OAAO,CAAC,aAAa,CAAY;IACjC,OAAO,CAAC,IAAI,CAAY;IAExB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,IAAI,CAAY;IAGxB;;OAEG;IACH,OAAO;IAGP;;;;;OAKG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;OAKG;IACH,IAAW,GAAG,IAAI,MAAM,CAEvB;IAED;;;;;OAKG;IACI,IAAI,IAAI,OAAO;IAkBtB;;;;;;;OAOG;WACW,QAAQ,CAClB,MAAM,EAAE,WAAW,EACnB,YAAY,GAAE,MAAU,EAAE,+BAA+B;IACzD,GAAG,CAAC,EAAE,MAAM,GAAI,oBAAoB;IAsBxC;;OAEG;IACI,IAAI,IAAI,IAAI;CAIpB"}

package/compiled/src/indexing/single_index_set_cursor.js

@@ -3,7 +3,6 @@ const pool = [];
  * Cursor to a single index set span for queries.
  */
 export class SingleIndexSetCursor {
-    /* eslint-disable no-useless-constructor, no-empty-function */
     /**
      * Construct this, not accessible.
      */
@@ -13,7 +12,6 @@ export class SingleIndexSetCursor {
         this.high_ = 0;
         this.low_ = 0;
     }
-    /* eslint-enable no-useless-constructor, no-empty-function */
     /**
      * Get the current high 27 bits, as a regular number with the lower 5 bits
      * padded to zero.
@@ -46,18 +44,18 @@ export class SingleIndexSetCursor {
         }
         this.high_ = buffer[currentIndex];
         this.low_ = buffer[currentIndex + 1];
-        // eslint-disable-next-line no-magic-numbers
         this.currentIndex_ = currentIndex + 2;
         return true;
     }
     /**
      * Allocate a SingleIndexSetCursor, re-using freed ones in the pool.
      *
+     * @param buffer
+     * @param currentIndex
+     * @param end
      * @return {SingleIndexSetCursor} The allocated cursor.
      */
-    static allocate(buffer, 
-    // eslint-disable-next-line default-param-last
-    currentIndex = 0, // note, ? is default undefined
+    static allocate(buffer, currentIndex = 0, // note, ? is default undefined
     end) {
         end ??= buffer.length >>> 1;
         let result;
@@ -68,9 +66,7 @@ export class SingleIndexSetCursor {
             result = new SingleIndexSetCursor();
         }
         result.buffer_ = buffer;
-        // eslint-disable-next-line no-magic-numbers
         result.currentIndex_ = currentIndex * 2;
-        // eslint-disable-next-line no-magic-numbers
         result.end_ = end * 2;
         return result;
     }

package/compiled/src/loaders/conway_model_loader.d.ts

@@ -0,0 +1,18 @@
+import { Model } from '../core/model';
+import { Scene } from '../core/scene';
+/**
+ * Static class for loading a model from a Uint 8 array...
+ *
+ * note this is only the initial model parse, no geometry extraction has been performed.
+ */
+export declare class ConwayModelLoader {
+    /**
+     * Load a model using the format detector
+     *
+     * @param data The buffer to load from.
+     * @param modelID The model id to use for statistics (or 0 if none is provided)
+     * @return {Promise<[Model, Scene]>} A promise to return the loaded model and scene.
+     */
+    static loadModelWithScene(data: Uint8Array, modelID?: number): Promise<[Model, Scene]>;
+}
+//# sourceMappingURL=conway_model_loader.d.ts.map

package/compiled/src/loaders/conway_model_loader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conway_model_loader.d.ts","sourceRoot":"","sources":["../../../src/loaders/conway_model_loader.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AAcrC;;;;GAIG;AACH,qBAAa,iBAAiB;IAE5B;;;;;;OAMG;WACiB,kBAAkB,CAClC,IAAI,EAAE,UAAU,EAChB,OAAO,GAAE,MAAU,GAAI,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;CAkXnD"}