@woosh/meep-engine 2.96.0 → 2.98.0

package/src/core/collection/queue/Deque.js

@@ -1,7 +1,8 @@
+import { assert } from "../../assert.js";
 import { ceilPowerOfTwo } from "../../binary/operations/ceilPowerOfTwo.js";
+import { UINT32_MAX } from "../../binary/UINT32_MAX.js";
 import { max2 } from "../../math/max2.js";
 import { array_copy } from "../array/array_copy.js";
-import { assert } from "../../assert.js";
 
 const DEFAULT_SIZE = 16;
 
@@ -16,12 +17,13 @@ const STATUS_NORMAL = 2;
 export class Deque {
     /**
      * @template T
+     * @param {number} [min_size]
      */
-    constructor(minSize = DEFAULT_SIZE) {
+    constructor(min_size = DEFAULT_SIZE) {
 
-        assert.isNonNegativeInteger(minSize, 'minSize');
+        assert.isNonNegativeInteger(min_size, 'minSize');
 
-        const size = ceilPowerOfTwo(max2(1, minSize));
+        const size = ceilPowerOfTwo(max2(1, min_size));
 
         /**
          * Using static array allocator to preserve data locality.
@@ -32,15 +34,31 @@ export class Deque {
          */
         this.__data = new Array(size);
 
+        /**
+         *
+         * @type {number}
+         * @private
+         */
         this.__head = 0;
+        /**
+         *
+         * @type {number}
+         * @private
+         */
         this.__tail = 0;
 
+        /**
+         *
+         * @type {number}
+         * @private
+         */
         this.__status = STATUS_EMPTY;
     }
 
     /**
      *
      * @param {boolean} adding
+     * @private
      */
     resetStatus(adding) {
         const head = this.__head;
@@ -59,11 +77,12 @@ export class Deque {
      * @returns {number}
      * @private
      */
-    __circularBiggerPos(current) {
-        // TODO this can be done faster using mod operator (%)
+    __circular_next_position(current) {
         const next = current + 1;
 
-        return (next >= this.__data.length) ? 0 : next;
+        const length = this.__data.length;
+
+        return (next >= length) ? 0 : next;
     }
 
     /**
@@ -72,43 +91,57 @@ export class Deque {
      * @returns {number}
      * @private
      */
-    __circularSmallerPos(current) {
+    __circular_previous_position(current) {
         const prev = current - 1;
         return (prev < 0) ? (this.__data.length - 1) : prev;
     }
 
-    __checkAndExpand() {
+    __check_and_expand() {
         const status = this.__status;
+
         if (status !== STATUS_FULL) {
+            // queue still has space, we're done
             return;
         }
+
         const length = this.__data.length;
 
-        if (Number.MAX_SAFE_INTEGER === length) {
+        if (UINT32_MAX === length) {
             throw new Error('Maximum array size exceeded');
         }
 
-        let newLength = length * 2;
+        let new_length = length * 2;
+
         // bigger than Integer.MAX_VALUE
-        if (newLength < 0) {
-            newLength = Number.MAX_SAFE_INTEGER;
+        if (new_length > UINT32_MAX) {
+            new_length = UINT32_MAX;
         }
 
-        const newElements = new Array(newLength);
+        /**
+         *
+         * @type {T[]}
+         */
+        const new_data = new Array(new_length);
 
-        // copy front portion of data
         const head = this.__head;
 
-        array_copy(this.__data, head, newElements, 0, length - head);
-        array_copy(this.__data, 0, newElements, length - head, head);
+        // copy the front portion
+        array_copy(this.__data, head, new_data, 0, length - head);
+        // copy the remainder
+        array_copy(this.__data, 0, new_data, length - head, head);
 
         this.__head = 0;
         this.__tail = length;
+
         this.__status = STATUS_NORMAL;
 
-        this.__data = newElements;
+        this.__data = new_data;
     }
 
+    /**
+     *
+     * @return {boolean}
+     */
     isEmpty() {
         return this.size() === 0;
     }
@@ -120,7 +153,7 @@ export class Deque {
 
             do {
                 this.__data[cursor] = undefined;
-                cursor = this.__circularBiggerPos(cursor);
+                cursor = this.__circular_next_position(cursor);
             } while (cursor !== tail);
 
             this.__status = STATUS_EMPTY;
@@ -149,32 +182,45 @@ export class Deque {
     /**
      *
      * @param {number} current
-     * @param {boolean} frontShift
+     * @param {boolean} shift_front should we shift elements before the removed element or after?
      * @private
      */
-    __removeInternal(current, frontShift) {
+    __remove_internal(current, shift_front) {
         let cursor = current;
-        if (frontShift) {
+
+        if (shift_front) {
+
+            // shift towards tail
+
             const head = this.__head;
+
             while (cursor !== head) {
-                const next = this.__circularSmallerPos(cursor);
+                const next = this.__circular_previous_position(cursor);
                 this.__data[cursor] = this.__data[next];
                 cursor = next;
             }
-            this.__head = this.__circularBiggerPos(head);
+
+            this.__head = this.__circular_next_position(head);
+
         } else {
+
+            // shift towards head
+
             const tail = this.__tail;
 
             while (cursor !== tail) {
-                const next = this.__circularBiggerPos(cursor);
+                const next = this.__circular_next_position(cursor);
                 this.__data[cursor] = this.__data[next];
                 cursor = next;
             }
 
-            this.__tail = this.__circularSmallerPos(tail);
+            this.__tail = this.__circular_previous_position(tail);
+
         }
 
+        // fill in slot of last moved element
         this.__data[cursor] = undefined;
+
         this.resetStatus(false);
     }
 
@@ -190,7 +236,7 @@ export class Deque {
             return false;
         }
 
-        this.__removeInternal(i, true);
+        this.__remove_internal(i, true);
 
         return true;
     }
@@ -234,20 +280,20 @@ export class Deque {
      * @param {T} e
      */
     addFirst(e) {
-        this.__checkAndExpand();
-        this.__head = this.__circularSmallerPos(this.__head);
+        this.__check_and_expand();
+        this.__head = this.__circular_previous_position(this.__head);
         this.__data[this.__head] = e;
         this.resetStatus(true);
     }
 
     /**
      * Remove element from the front of the queue
-     * @returns {T}
+     * @returns {T|undefined}
      */
     removeFirst() {
         const element = this.__data[this.__head];
         this.__data[this.__head] = undefined;
-        this.__head = this.__circularBiggerPos(this.__head);
+        this.__head = this.__circular_next_position(this.__head);
         this.resetStatus(false);
         return element;
     }
@@ -265,9 +311,9 @@ export class Deque {
      * @param {T} e
      */
     addLast(e) {
-        this.__checkAndExpand();
+        this.__check_and_expand();
         this.__data[this.__tail] = e;
-        this.__tail = this.__circularBiggerPos(this.__tail);
+        this.__tail = this.__circular_next_position(this.__tail);
         this.resetStatus(true);
     }
 
@@ -276,7 +322,7 @@ export class Deque {
      * @returns {T}
      */
     removeLast() {
-        const last = this.__circularSmallerPos(this.__tail);
+        const last = this.__circular_previous_position(this.__tail);
         const element = this.__data[last];
         this.__data[last] = undefined;
         this.__tail = last;
@@ -287,10 +333,10 @@ export class Deque {
 
     /**
      * Peek element from the end of the queue without removing it
-     * @returns {T}
+     * @returns {T|undefined}
      */
     getLast() {
-        const last = this.__circularSmallerPos(this.__tail);
+        const last = this.__circular_previous_position(this.__tail);
         return this.__data[last];
     }
 }

package/src/core/geom/3d/aabb/aabb3_intersects_ray.js

@@ -1,4 +1,4 @@
-const fabsf = Math.abs;
+const abs = Math.abs;
 
 /**
  * NOTES:
@@ -35,7 +35,7 @@ export function aabb3_intersects_ray(
     const diff_x = origin_x - center_x;
 
 
-    if (diff_x * direction_x >= 0.0 && fabsf(diff_x) > extents_x) {
+    if (diff_x * direction_x >= 0.0 && abs(diff_x) > extents_x) {
         return false;
     }
 
@@ -47,7 +47,7 @@ export function aabb3_intersects_ray(
     const diff_y = origin_y - center_y;
 
 
-    if (diff_y * direction_y >= 0.0 && fabsf(diff_y) > extents_y) {
+    if (diff_y * direction_y >= 0.0 && abs(diff_y) > extents_y) {
         return false;
     }
 
@@ -59,28 +59,28 @@ export function aabb3_intersects_ray(
     const diff_z = origin_z - center_z;
 
 
-    if (diff_z * direction_z >= 0.0 && fabsf(diff_z) > extents_z) {
+    if (diff_z * direction_z >= 0.0 && abs(diff_z) > extents_z) {
         return false;
     }
 
-    const abs_direction_y = fabsf(direction_y);
-    const abs_direction_z = fabsf(direction_z);
+    const abs_direction_y = abs(direction_y);
+    const abs_direction_z = abs(direction_z);
 
-    const f0 = fabsf(direction_y * diff_z - direction_z * diff_y);
+    const f0 = abs(direction_y * diff_z - direction_z * diff_y);
 
     if (f0 > extents_y * abs_direction_z + extents_z * abs_direction_y) {
         return false;
     }
 
-    const abs_direction_x = fabsf(direction_x);
+    const abs_direction_x = abs(direction_x);
 
-    const f1 = fabsf(direction_z * diff_x - direction_x * diff_z);
+    const f1 = abs(direction_z * diff_x - direction_x * diff_z);
 
     if (f1 > extents_x * abs_direction_z + extents_z * abs_direction_x) {
         return false;
     }
 
-    const f2 = fabsf(direction_x * diff_y - direction_y * diff_x);
+    const f2 = abs(direction_x * diff_y - direction_y * diff_x);
 
     return f2 <= extents_x * abs_direction_y + extents_y * abs_direction_x;
 }

package/src/core/graph/v2/Graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/v2/Graph.js"],"names":[],"mappings":"AAyBA;;GAEG;AACH;IAEI;;;;;OAKG;IACH,yBAAoB;IACpB;;;;;OAKG;IACH,yBAAoB;IAEpB;;OAEG;IACH;QACI;;WAEG;mBADO,OAAO,CAAC,EAAC,IAAI,CAAC;QAGxB;;WAEG;qBADO,OAAO,CAAC,EAAC,IAAI,CAAC;;;MAK1B;IAGF;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAenB;IAED;;;;OAIG;IACH,iBAHW,CAAC,GACC,OAAO,CAiBnB;IAED;;;;OAIG;IACH,8BAHoB,CAAC,+BAOpB;IAED,wBAEC;IAED;;;OAGG;IACH,gBAFa,MAAM,CAIlB;IAED;;;;;OAKG;IACH,wBAJoB,CAAC,KAAE,OAAO,kBAEjB,CAAC,GAAC,SAAS,CAgBvB;IAED;;;;OAIG;IACH,uBAHW,CAAC,GACC,cAAc,CAAC,CAAC,GAAC,SAAS,CAItC;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACA,MAAM,CAUjB;IAED;;;OAGG;IACH,iBAEC;IAED;;;OAGG;IACH,YAFY,SAAS,CAAC,CAAC,CAItB;IAED;;;OAGG;IACH,YAFY,IAAI,KAAK,CAAC,CAAC,CAAC,CAIvB;IAED;;;;;;OAMG;IACH,mBALW,CAAC,UACD,CAAC,cACD,iBAAiB,GACf,KAAK,CAAC,CAAC,CAgBnB;IAED;;;;;OAKG;IACH,cAJW,KAAK,CAAC,CAAC,GACL,OAAO,CA4BnB;IAED;;;;OAIG;IACH,iBAHW,KAAK,CAAC,CAAC,GACL,OAAO,CAwBnB;IAED;;;;OAIG;IACH,cAHW,KAAK,CAAC,CAAC,GACL,OAAO,CAQnB;IAED;;;;OAIG;IACH,8BAHoB,KAAK,CAAC,CAAC,+BAO1B;IAED,wBAEC;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,OAAO,CAWnB;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,KAAK,CAAC,CAAC,GAAC,SAAS,CAiB7B;IAED;;;;;OAKG;IACH,yBAJW,CAAC,MACD,CAAC,GACC,KAAK,CAAC,CAAC,GAAC,SAAS,CAU7B;IAED;;;;;OAKG;IACH,yBAJW,KAAK,CAAC,CAAC,EAAE,QACT,CAAC,GACC,MAAM,CA2BlB;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACC,CAAC,EAAE,CAUf;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACC,OAAO,CAYnB;IAED;;;;;OAKG;IACH,gBAJW,CAAC,QACD,CAAC,GACC,IAAI,GAAC,CAAC,EAAE,CAmEpB;IAED;;OAEG;IACH,cAGC;IAED;;;OAGG;IACH,YAFW,MAAM,CAAC,CAAC,QAOlB;IAED;;OAEG;IACH,SAFa,MAAM,CAAC,CAAC,CAQpB;CACJ;mBA7hBkB,+BAA+B;8BAEpB,oBAAoB;qBADV,YAAY;kCAAZ,YAAY"}
+{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/v2/Graph.js"],"names":[],"mappings":"AAyBA;;GAEG;AACH;IAEI;;;;;OAKG;IACH,yBAAoB;IACpB;;;;;OAKG;IACH,yBAAoB;IAEpB;;OAEG;IACH;QACI;;WAEG;mBADO,OAAO,CAAC,EAAC,IAAI,CAAC;QAGxB;;WAEG;qBADO,OAAO,CAAC,EAAC,IAAI,CAAC;;;MAK1B;IAGF;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAenB;IAED;;;;OAIG;IACH,iBAHW,CAAC,GACC,OAAO,CAiBnB;IAED;;;;OAIG;IACH,8BAHoB,CAAC,+BAOpB;IAED,wBAEC;IAED;;;OAGG;IACH,gBAFa,MAAM,CAIlB;IAED;;;;;OAKG;IACH,wBAJoB,CAAC,KAAE,OAAO,kBAEjB,CAAC,GAAC,SAAS,CAgBvB;IAED;;;;OAIG;IACH,uBAHW,CAAC,GACC,cAAc,CAAC,CAAC,GAAC,SAAS,CAItC;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACA,MAAM,CAUjB;IAED;;;OAGG;IACH,iBAEC;IAED;;;OAGG;IACH,YAFY,SAAS,CAAC,CAAC,CAItB;IAED;;;OAGG;IACH,YAFY,IAAI,KAAK,CAAC,CAAC,CAAC,CAIvB;IAED;;;;;;OAMG;IACH,mBALW,CAAC,UACD,CAAC,cACD,iBAAiB,GACf,KAAK,CAAC,CAAC,CAgBnB;IAED;;;;;OAKG;IACH,cAJW,KAAK,CAAC,CAAC,GACL,OAAO,CA4BnB;IAED;;;;OAIG;IACH,iBAHW,KAAK,CAAC,CAAC,GACL,OAAO,CAwBnB;IAED;;;;OAIG;IACH,cAHW,KAAK,CAAC,CAAC,GACL,OAAO,CAQnB;IAED;;;;OAIG;IACH,8BAHoB,KAAK,CAAC,CAAC,+BAO1B;IAED,wBAEC;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,OAAO,CAWnB;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,KAAK,CAAC,CAAC,GAAC,SAAS,CAiB7B;IAED;;;;;OAKG;IACH,yBAJW,CAAC,MACD,CAAC,GACC,KAAK,CAAC,CAAC,GAAC,SAAS,CAU7B;IAED;;;;;OAKG;IACH,yBAJW,KAAK,CAAC,CAAC,EAAE,QACT,CAAC,GACC,MAAM,CA2BlB;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACC,CAAC,EAAE,CAUf;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACC,OAAO,CAYnB;IAED;;;;;OAKG;IACH,gBAJW,CAAC,QACD,CAAC,GACC,IAAI,GAAC,CAAC,EAAE,CA4EpB;IAED;;OAEG;IACH,cAGC;IAED;;;OAGG;IACH,YAFW,MAAM,CAAC,CAAC,QAOlB;IAED;;OAEG;IACH,SAFa,MAAM,CAAC,CAAC,CAQpB;CACJ;mBAtiBkB,+BAA+B;8BAEpB,oBAAoB;qBADV,YAAY;kCAAZ,YAAY"}

package/src/core/graph/v2/Graph.js

@@ -446,8 +446,17 @@ export class Graph {
      */
     findPath(start, goal) {
         const start_node_container = this.__nodes.get(start);
+
+        if (start_node_container === undefined) {
+            throw new Error(`Start node not found in the graph '${start}'`);
+        }
+
         const goal_node_container = this.__nodes.get(goal);
 
+        if (goal_node_container === undefined) {
+            throw new Error(`Goal node not found in the graph '${goal}'`);
+        }
+
         const open = new Set();
         open.add(start_node_container);
 

package/src/core/math/spline/computeNonuniformCaltmullRomSplineDerivative.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Computes derivative of Catmull Rom spline
+ * @param {number[]} result_value
+ * @param {number} result_value_offset
+ * @param {number[]} result_derivative
+ * @param {number} result_derivative_offset
+ * @param {number[]} p0 spline point 0
+ * @param {number[]} p1 spline point 1
+ * @param {number[]} p2 spline point 2
+ * @param {number[]} p3 spline point 3
+ * @param {number} dimensions number of dimensions in the input and output vectors
+ * @param {number} f between 0..1
+ * @param {number} alpha between 0..1
+ */
+export function computeNonuniformCaltmullRomSplineDerivative(result_value: number[], result_value_offset: number, result_derivative: number[], result_derivative_offset: number, p0: number[], p1: number[], p2: number[], p3: number[], dimensions: number, f: number, alpha: number): void;
+//# sourceMappingURL=computeNonuniformCaltmullRomSplineDerivative.d.ts.map

package/src/core/math/spline/computeNonuniformCaltmullRomSplineDerivative.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"computeNonuniformCaltmullRomSplineDerivative.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/spline/computeNonuniformCaltmullRomSplineDerivative.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AACH,2EAZW,MAAM,EAAE,uBACR,MAAM,qBACN,MAAM,EAAE,4BACR,MAAM,MACN,MAAM,EAAE,MACR,MAAM,EAAE,MACR,MAAM,EAAE,MACR,MAAM,EAAE,cACR,MAAM,KACN,MAAM,SACN,MAAM,QA2EhB"}

package/src/core/math/spline/computeNonuniformCaltmullRomSplineDerivative.js

@@ -0,0 +1,90 @@
+import { catmull_rom_compute_T } from "./catmull_rom_compute_T.js";
+
+/**
+ * Computes derivative of Catmull Rom spline
+ * @param {number[]} result_value
+ * @param {number} result_value_offset
+ * @param {number[]} result_derivative
+ * @param {number} result_derivative_offset
+ * @param {number[]} p0 spline point 0
+ * @param {number[]} p1 spline point 1
+ * @param {number[]} p2 spline point 2
+ * @param {number[]} p3 spline point 3
+ * @param {number} dimensions number of dimensions in the input and output vectors
+ * @param {number} f between 0..1
+ * @param {number} alpha between 0..1
+ */
+export function computeNonuniformCaltmullRomSplineDerivative(
+    result_value, result_value_offset,
+    result_derivative, result_derivative_offset,
+    p0, p1, p2, p3,
+    dimensions, f, alpha
+) {
+    /*
+    @see https://math.stackexchange.com/questions/843595/how-can-i-calculate-the-derivative-of-a-catmull-rom-spline-with-nonuniform-param
+    @see http://denkovacs.com/2016/02/catmull-rom-spline-derivatives/
+    @see https://en.wikipedia.org/wiki/Centripetal_Catmull%E2%80%93Rom_spline
+     */
+
+    const half_alpha = alpha * 0.5;
+
+    // calculate T
+    const t0 = 0;
+    let t_01 = catmull_rom_compute_T(p0, p1, dimensions, half_alpha);
+    let t_02 = catmull_rom_compute_T(p1, p2, dimensions, half_alpha);
+    let t_03 = catmull_rom_compute_T(p2, p3, dimensions, half_alpha);
+
+    // safety check for repeated points, to prevent division by 0
+    if (t_01 < 1e-4) {
+        t_01 = 1;
+    }
+    if (t_02 < 1e-4) {
+        t_02 = t_01;
+    }
+    if (t_03 < 1e-4) {
+        t_03 = t_02;
+    }
+
+    const t1 = t_01 + t0;
+    const t2 = t_02 + t1;
+    const t3 = t_03 + t2;
+
+    /**
+     * Interpolation between points 1 and 2
+     * @type {number}
+     */
+    const t = t1 * (1 - f) + t2 * f;
+
+    for (let i = 0; i < dimensions; i++) {
+        // read vector values for the dimension
+        const v0 = p0[i];
+        const v1 = p1[i];
+        const v2 = p2[i];
+        const v3 = p3[i];
+
+        const A1 = (t1 - t) / (t1 - t0) * v0 + (t - t0) / (t1 - t0) * v1;
+        const A2 = (t2 - t) / (t2 - t1) * v1 + (t - t1) / (t2 - t1) * v2;
+        const A3 = (t3 - t) / (t3 - t2) * v2 + (t - t2) / (t3 - t2) * v3;
+
+        const B1 = (t2 - t) / (t2 - t0) * A1 + (t - t0) / (t2 - t0) * A2;
+        const B2 = (t3 - t) / (t3 - t1) * A2 + (t - t1) / (t3 - t1) * A3;
+
+        const C = (t2 - t) / (t2 - t1) * B1 + (t - t1) / (t2 - t1) * B2;
+
+        result_value[result_value_offset + i] = C;
+
+        // derivatives
+
+        const dA1 = (v1 - v0) / (t1 - t0)
+        const dA2 = (v2 - v1) / (t2 - t1);
+        const dA3 = (v3 - v2) / (t3 - t2);
+
+        const dB1 = (A2 - A1) / (t2 - t0) + dA1 * (t2 - t) / (t2 - t0) + dA2 * (t - t0) / (t2 - t0);
+        const dB2 = (A3 - A2) / (t3 - t1) + dA2 * (t3 - t) / (t3 - t1) + dA3 * (t - t1) / (t3 - t1);
+
+        const dC = (B2 - B1) / (t2 - t1) + dB1 * (t2 - t) / (t2 - t1) + dB2 * (t - t1) / (t2 - t1);
+
+        result_derivative[result_derivative_offset + i] = dC;
+    }
+
+}

package/src/core/parser/simple/ParserError.d.ts

@@ -1,9 +1,14 @@
 export default ParserError;
-declare function ParserError(position: any, message: any, input: any): void;
-declare class ParserError {
-    constructor(position: any, message: any, input: any);
-    position: any;
-    message: any;
-    input: any;
+declare class ParserError extends Error {
+    /**
+     *
+     * @param {number} position
+     * @param {string} message
+     * @param {string} input
+     */
+    constructor(position: number, message: string, input: string);
+    position: number;
+    input: string;
+    getDetails(): string;
 }
 //# sourceMappingURL=ParserError.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"ParserError.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/ParserError.js"],"names":[],"mappings":";AAAA,4EAIC;;IAJD,qDAIC;IAHG,cAAwB;IACxB,aAAsB;IACtB,WAAkB"}
+{"version":3,"file":"ParserError.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/ParserError.js"],"names":[],"mappings":";AAKA;IACI;;;;;OAKG;IACH,sBAJW,MAAM,WACN,MAAM,SACN,MAAM,EAiBhB;IAHG,iBAAwB;IAExB,cAAkB;IAGtB,qBAiBC;CAKJ"}

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

@@ -1,7 +1,54 @@
-function ParserError(position, message, input) {
-    this.position = position;
-    this.message = message;
-    this.input = input;
+import { assert } from "../../assert.js";
+import { max2 } from "../../math/max2.js";
+import { min2 } from "../../math/min2.js";
+import { string_repeat } from "../../primitives/strings/string_repeat.js";
+
+class ParserError extends Error {
+    /**
+     *
+     * @param {number} position
+     * @param {string} message
+     * @param {string} input
+     */
+    constructor(
+        position,
+        message,
+        input
+    ) {
+
+        super();
+
+        assert.isNonNegativeInteger(position, 'position');
+        assert.isString(message, 'message');
+        assert.isString(input, 'input');
+
+        this.position = position;
+        this.message = message;
+        this.input = input;
+    }
+
+    getDetails() {
+        const input = this.input;
+        const position = this.position;
+
+        // get snippet around where the problem has occurred
+        const input_start = max2(0, position - 10);
+
+        const input_end = min2(input.length, position + 10);
+
+        const snippet = input.slice(input_start, input_end);
+
+        const offset_into_snippet = position - input_start;
+
+        // a piece of text with marker to show where the error occurs
+        const arrow_text = string_repeat(" ", offset_into_snippet) + "^"
+
+        return snippet + "\n" + arrow_text;
+    }
+
+    toString() {
+        return `[ParseError] ${this.message}. Error at position ${this.position} near:\n${this.getDetails()}`
+    }
 }
 
 export default ParserError;

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

@@ -1 +1 @@
-{"version":3,"file":"Token.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/Token.js"],"names":[],"mappings":";AAAA;IACI;;;;;;;OAOG;IACH,6BALW,MAAM,OACN,MAAM,QACN,MAAM,WAgChB;IA5BG;;;OAGG;IACH,kBAAkB;IAClB;;;;OAIG;IACH,gBAFU,MAAM,CAEE;IAClB;;;;OAIG;IACH,cAFU,MAAM,CAEF;IACd;;;OAGG;IACH,eAFU,MAAM,CAEA;IAChB;;;;OAIG;IACH,iBAAgB;IAGpB;;;;OAIG;IACH,cAHW,KAAK,GACH,OAAO,CASnB;IAED;;;OAGG;IACH,QAFY,MAAM,CAKjB;CACJ"}
+{"version":3,"file":"Token.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/Token.js"],"names":[],"mappings":";AAEA;IACI;;;;;;;OAOG;IACH,6BALW,MAAM,OACN,MAAM,QACN,MAAM,WAqChB;IA5BG;;;OAGG;IACH,kBAAkB;IAClB;;;;OAIG;IACH,gBAFU,MAAM,CAEE;IAClB;;;;OAIG;IACH,cAFU,MAAM,CAEF;IACd;;;OAGG;IACH,eAFU,MAAM,CAEA;IAChB;;;;OAIG;IACH,iBAAgB;IAGpB;;;;OAIG;IACH,cAHW,KAAK,GACH,OAAO,CASnB;IAED;;;OAGG;IACH,QAFY,MAAM,CAIjB;CACJ"}

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

@@ -1,3 +1,5 @@
+import { assert } from "../../assert.js";
+
 class Token {
     /**
      * @template V,T
@@ -8,6 +10,11 @@ class Token {
      * @param {T} type
      */
     constructor(value, start, end, name, type) {
+
+        assert.isNonNegativeInteger(start, 'start');
+        assert.isNonNegativeInteger(end, 'end');
+        assert.isString(name, 'name');
+
         /**
          * @readonly
          * @type {V}
@@ -57,8 +64,7 @@ class Token {
      * @return {number}
      */
     hash() {
-        // TODO make an actual hash
-        return 0;
+        return this.start ^ (this.end << 16);
     }
 }
 

package/src/core/parser/simple/TokenType.d.ts

@@ -1,9 +1,5 @@
 export default TokenType;
-type TokenType = {
-    LiteralString: string;
-    LiteralNumber: string;
-    LiteralBoolean: string;
-};
+type TokenType = string;
 declare namespace TokenType {
     let LiteralString: string;
     let LiteralNumber: string;

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

@@ -1 +1 @@
-{"version":3,"file":"TokenType.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/TokenType.js"],"names":[],"mappings":";iBACU;IAAC,aAAa,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,MAAM,CAAA;CAAC"}
+{"version":3,"file":"TokenType.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/TokenType.js"],"names":[],"mappings":";iBACU,MAAM"}

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

@@ -1,5 +1,5 @@
 /**
- * @enum {{LiteralString: string, LiteralNumber: string, LiteralBoolean: string}}
+ * @enum {string}
  */
 const TokenType = {
     LiteralString: "literal-string",

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

@@ -1 +1 @@
-{"version":3,"file":"readBooleanToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readBooleanToken.js"],"names":[],"mappings":"AAKA;;;;;;GAMG;AACH,uCALW,MAAM,UACN,MAAM,UACN,MAAM,SA4BhB"}
+{"version":3,"file":"readBooleanToken.d.ts","sourceRoot":"","sources":["../../../../../src/core/parser/simple/readBooleanToken.js"],"names":[],"mappings":"AAMA;;;;;;GAMG;AACH,uCALW,MAAM,UACN,MAAM,UACN,MAAM,SAgChB"}

package/src/core/parser/simple/readBooleanToken.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";
 
 /**
  *
@@ -11,6 +12,10 @@ import DataType from "./DataType.js";
  * @returns {Token}
  */
 export function readBooleanToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     const firstChar = text.charAt(cursor);
 
     let value;

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

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

package/src/core/parser/simple/readHexToken.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 readHexToken(text, cursor, length) {
+    assert.isString(text, 'text');
+    assert.isNonNegativeInteger(cursor, 'cursor');
+    assert.isNonNegativeInteger(length, 'length');
+
     const c0 = text.charAt(cursor);
     const c1 = text.charAt(cursor + 1);
 
@@ -91,5 +96,5 @@ export function readHexToken(text, cursor, length) {
     }
 
 
-    return new Token(value, cursor, i, null, DataType.Number);
+    return new Token(value, cursor, i, "uint", DataType.Number);
 }