data-structure-typed 1.12.11 → 1.15.0

package/dist/data-structures/matrix/matrix.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class MatrixNTI2D<T = number> {
     private readonly _matrix;

package/dist/data-structures/matrix/matrix.js

@@ -2,8 +2,11 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MatrixNTI2D = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 // todo need to be improved
 var MatrixNTI2D = /** @class */ (function () {

package/dist/data-structures/matrix/matrix2d.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import Vector2D from './vector2d';
 export declare class Matrix2D {

package/dist/data-structures/matrix/matrix2d.js

@@ -5,8 +5,11 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Matrix2D = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var vector2d_1 = __importDefault(require("./vector2d"));
 var Matrix2D = /** @class */ (function () {

package/dist/data-structures/matrix/navigator.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import type { Direction, NavigatorParams, Turning } from '../types';
 export declare class Character {

package/dist/data-structures/matrix/vector2d.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class Vector2D {
     x: number;

package/dist/data-structures/matrix/vector2d.js

@@ -2,8 +2,11 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Vector2D = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var Vector2D = /** @class */ (function () {
     function Vector2D(x, y, w // needed for matrix multiplication

package/dist/data-structures/priority-queue/max-priority-queue.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
 import type { PriorityQueueOptions } from '../types';

package/dist/data-structures/priority-queue/max-priority-queue.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MaxPriorityQueue = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var priority_queue_1 = require("./priority-queue");
 var MaxPriorityQueue = /** @class */ (function (_super) {

package/dist/data-structures/priority-queue/min-priority-queue.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
 import type { PriorityQueueOptions } from '../types';

package/dist/data-structures/priority-queue/min-priority-queue.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MinPriorityQueue = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var priority_queue_1 = require("./priority-queue");
 var MinPriorityQueue = /** @class */ (function (_super) {

package/dist/data-structures/priority-queue/priority-queue.d.ts

@@ -1,10 +1,19 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import type { PriorityQueueComparator, PriorityQueueDFSOrderPattern, PriorityQueueOptions } from '../types';
 export declare class PriorityQueue<T = number> {
-    protected nodes: T[];
+    protected _nodes: T[];
+    get nodes(): T[];
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getNodes(): T[];
+    protected set nodes(value: T[]);
     /**
      * The constructor initializes a priority queue with the given options, including an array of nodes and a comparator
      * function.
@@ -29,11 +38,11 @@ export declare class PriorityQueue<T = number> {
      */
     static isPriorityQueueified<T>(options: Omit<PriorityQueueOptions<T>, 'isFix'>): boolean;
     /**
-     * The "offer" function adds a node to the heap and ensures that the heap property is maintained.
+     * The "add" function adds a node to the heap and ensures that the heap property is maintained.
      * @param {T} node - The parameter "node" is of type T, which means it can be any data type. It represents the node
      * that needs to be added to the heap.
      */
-    offer(node: T): void;
+    add(node: T): void;
     /**
      * The `peek` function returns the first element of the `nodes` array if it exists, otherwise it returns `null`.
      * @returns The `peek()` function is returning the first element (`T`) of the `nodes` array if the `size` is not zero.

package/dist/data-structures/priority-queue/priority-queue.js

@@ -44,7 +44,7 @@ var PriorityQueue = /** @class */ (function () {
      * @param options - The `options` parameter is an object that contains the following properties:
      */
     function PriorityQueue(options) {
-        this.nodes = [];
+        this._nodes = [];
         this._comparator = function (a, b) {
             var aKey = a, bKey = b;
             return aKey - bKey;
@@ -53,10 +53,26 @@ var PriorityQueue = /** @class */ (function () {
         this._comparator = comparator;
         if (nodes && nodes instanceof Array && nodes.length > 0) {
             // TODO support distinct
-            this.nodes = Array.isArray(nodes) ? __spreadArray([], __read(nodes), false) : [];
+            this._nodes = Array.isArray(nodes) ? __spreadArray([], __read(nodes), false) : [];
             isFix && this._fix();
         }
     }
+    Object.defineProperty(PriorityQueue.prototype, "nodes", {
+        get: function () {
+            return this._nodes;
+        },
+        set: function (value) {
+            this._nodes = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    PriorityQueue.prototype.getNodes = function () {
+        return this._nodes;
+    };
     Object.defineProperty(PriorityQueue.prototype, "size", {
         get: function () {
             return this.nodes.length;
@@ -87,11 +103,11 @@ var PriorityQueue = /** @class */ (function () {
         return new PriorityQueue(__assign(__assign({}, options), { isFix: true })).isValid();
     };
     /**
-     * The "offer" function adds a node to the heap and ensures that the heap property is maintained.
+     * The "add" function adds a node to the heap and ensures that the heap property is maintained.
      * @param {T} node - The parameter "node" is of type T, which means it can be any data type. It represents the node
      * that needs to be added to the heap.
      */
-    PriorityQueue.prototype.offer = function (node) {
+    PriorityQueue.prototype.add = function (node) {
         this.nodes.push(node);
         this._heapifyUp(this.size - 1);
     };

package/dist/data-structures/queue/deque.d.ts

@@ -1,22 +1,36 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { DoublyLinkedList } from '../linked-list';
 export declare class Deque<T> extends DoublyLinkedList<T> {
 }
 export declare class ObjectDeque<T> {
-    protected _nodes: {
-        [key: number]: T;
+    private _nodes;
+    get nodes(): {
+        [p: number]: T;
     };
-    protected _capacity: number;
-    protected _first: number;
-    protected _last: number;
-    protected _size: number;
+    protected set nodes(value: {
+        [p: number]: T;
+    });
+    private _capacity;
+    get capacity(): number;
+    set capacity(value: number);
+    private _first;
+    get first(): number;
+    set first(value: number);
+    private _last;
+    get last(): number;
+    set last(value: number);
+    private _size;
+    get size(): number;
+    protected set size(value: number);
     constructor(capacity?: number);
-    size(): number;
-    offerFirst(value: T): void;
-    offerLast(value: T): void;
+    addFirst(value: T): void;
+    addLast(value: T): void;
     pollFirst(): T | undefined;
     peekFirst(): T | undefined;
     pollLast(): T | undefined;
@@ -28,11 +42,11 @@ export declare class ArrayDeque<T> {
     protected _nodes: T[];
     get size(): number;
     /**
-     * The function "offerLast" adds a value to the end of an array.
+     * The function "addLast" adds a value to the end of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the end of the array.
      * @returns The return value is the new length of the array after the value has been added.
      */
-    offerLast(value: T): number;
+    addLast(value: T): number;
     /**
      * The function "pollLast" returns and removes the last element from an array, or returns null if the array is empty.
      * @returns The method `pollLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
@@ -45,12 +59,12 @@ export declare class ArrayDeque<T> {
      */
     pollFirst(): T | null;
     /**
-     * The function "offerFirst" adds a value to the beginning of an array.
+     * The function "addFirst" adds a value to the beginning of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `offerFirst` function is the new length of the array `_nodes` after adding the
+     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
      * `value` at the beginning.
      */
-    offerFirst(value: T): number;
+    addFirst(value: T): number;
     /**
      * The `peekFirst` function returns the first element of an array or null if the array is empty.
      * @returns The function `peekFirst()` is returning the first element (`T`) of the `_nodes` array. If the array is

package/dist/data-structures/queue/deque.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var linked_list_1 = require("../linked-list");
 // O(n) time complexity of obtaining the value
@@ -44,10 +47,57 @@ var ObjectDeque = /** @class */ (function () {
         if (capacity !== undefined)
             this._capacity = capacity;
     }
-    ObjectDeque.prototype.size = function () {
-        return this._size;
-    };
-    ObjectDeque.prototype.offerFirst = function (value) {
+    Object.defineProperty(ObjectDeque.prototype, "nodes", {
+        get: function () {
+            return this._nodes;
+        },
+        set: function (value) {
+            this._nodes = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "capacity", {
+        get: function () {
+            return this._capacity;
+        },
+        set: function (value) {
+            this._capacity = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "first", {
+        get: function () {
+            return this._first;
+        },
+        set: function (value) {
+            this._first = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "last", {
+        get: function () {
+            return this._last;
+        },
+        set: function (value) {
+            this._last = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(ObjectDeque.prototype, "size", {
+        get: function () {
+            return this._size;
+        },
+        set: function (value) {
+            this._size = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    ObjectDeque.prototype.addFirst = function (value) {
         if (this._size === 0) {
             var mid = Math.floor(this._capacity / 2);
             this._first = mid;
@@ -59,7 +109,7 @@ var ObjectDeque = /** @class */ (function () {
         this._nodes[this._first] = value;
         this._size++;
     };
-    ObjectDeque.prototype.offerLast = function (value) {
+    ObjectDeque.prototype.addLast = function (value) {
         if (this._size === 0) {
             var mid = Math.floor(this._capacity / 2);
             this._first = mid;
@@ -120,11 +170,11 @@ var ArrayDeque = /** @class */ (function () {
         configurable: true
     });
     /**
-     * The function "offerLast" adds a value to the end of an array.
+     * The function "addLast" adds a value to the end of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the end of the array.
      * @returns The return value is the new length of the array after the value has been added.
      */
-    ArrayDeque.prototype.offerLast = function (value) {
+    ArrayDeque.prototype.addLast = function (value) {
         return this._nodes.push(value);
     };
     /**
@@ -145,12 +195,12 @@ var ArrayDeque = /** @class */ (function () {
         return (_a = this._nodes.shift()) !== null && _a !== void 0 ? _a : null;
     };
     /**
-     * The function "offerFirst" adds a value to the beginning of an array.
+     * The function "addFirst" adds a value to the beginning of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `offerFirst` function is the new length of the array `_nodes` after adding the
+     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
      * `value` at the beginning.
      */
-    ArrayDeque.prototype.offerFirst = function (value) {
+    ArrayDeque.prototype.addFirst = function (value) {
         return this._nodes.unshift(value);
     };
     /**

package/dist/data-structures/queue/queue.d.ts

@@ -1,6 +1,6 @@
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 export declare class Queue<T> {
@@ -23,11 +23,11 @@ export declare class Queue<T> {
      */
     static fromArray<T>(elements: T[]): Queue<T>;
     /**
-     * The offer function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The add function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
      * @param {T} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `offer` method is returning a `Queue<T>` object.
+     * @returns The `add` method is returning a `Queue<T>` object.
      */
-    offer(element: T): Queue<T>;
+    add(element: T): Queue<T>;
     /**
      * The `poll` function removes and returns the first element in the queue, and adjusts the internal data structure if
      * necessary to optimize performance.

package/dist/data-structures/queue/queue.js

@@ -3,7 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Queue = void 0;
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 var Queue = /** @class */ (function () {
@@ -29,11 +29,11 @@ var Queue = /** @class */ (function () {
         return new Queue(elements);
     };
     /**
-     * The offer function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The add function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
      * @param {T} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `offer` method is returning a `Queue<T>` object.
+     * @returns The `add` method is returning a `Queue<T>` object.
      */
-    Queue.prototype.offer = function (element) {
+    Queue.prototype.add = function (element) {
         this._nodes.push(element);
         return this;
     };

package/dist/data-structures/stack/stack.d.ts

@@ -1,6 +1,6 @@
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 export declare class Stack<T> {

package/dist/data-structures/stack/stack.js

@@ -3,7 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Stack = void 0;
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 var Stack = /** @class */ (function () {

package/dist/data-structures/trie/trie.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class TrieNode {
     protected _value: string;
@@ -19,7 +22,7 @@ export declare class Trie {
     protected _root: TrieNode;
     get root(): TrieNode;
     set root(v: TrieNode);
-    put(word: string): boolean;
+    add(word: string): boolean;
     has(input: string): boolean;
     remove(word: string): boolean;
     /**

package/dist/data-structures/trie/trie.js

@@ -13,8 +13,11 @@ var __values = (this && this.__values) || function(o) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Trie = exports.TrieNode = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var TrieNode = /** @class */ (function () {
     function TrieNode(v) {
@@ -63,7 +66,7 @@ var Trie = /** @class */ (function () {
             try {
                 for (var words_1 = __values(words), words_1_1 = words_1.next(); !words_1_1.done; words_1_1 = words_1.next()) {
                     var i = words_1_1.value;
-                    this.put(i);
+                    this.add(i);
                 }
             }
             catch (e_1_1) { e_1 = { error: e_1_1 }; }
@@ -85,7 +88,7 @@ var Trie = /** @class */ (function () {
         enumerable: false,
         configurable: true
     });
-    Trie.prototype.put = function (word) {
+    Trie.prototype.add = function (word) {
         var e_2, _a;
         var cur = this._root;
         try {

package/dist/data-structures/types/abstract-graph.d.ts

@@ -8,7 +8,7 @@ export type DijkstraResult<V> = {
     minPath: V[];
 } | null;
 export interface IGraph<V, E> {
-    containsVertex(vertexOrId: V | VertexId): boolean;
+    hasVertex(vertexOrId: V | VertexId): boolean;
     getVertex(vertexOrId: VertexId | V): V | null;
     getVertexId(vertexOrId: V | VertexId): VertexId;
     vertexSet(): Map<VertexId, V>;
@@ -17,7 +17,7 @@ export interface IGraph<V, E> {
     removeAllVertices(vertices: V[] | VertexId[]): boolean;
     degreeOf(vertexOrId: V | VertexId): number;
     edgesOf(vertexOrId: V | VertexId): E[];
-    containsEdge(src: V | VertexId, dest: V | VertexId): boolean;
+    hasEdge(src: V | VertexId, dest: V | VertexId): boolean;
     getEdge(srcOrId: V | VertexId, destOrId: V | VertexId): E | null;
     edgeSet(): E[];
     addEdge(edge: E): boolean;

package/dist/utils/index.d.ts

@@ -1 +1,2 @@
 export * from './utils';
+export * from './types';

package/dist/utils/index.js

@@ -15,3 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./utils"), exports);
+__exportStar(require("./types"), exports);

package/dist/utils/types/utils.d.ts

@@ -1,3 +1,10 @@
+export type JSONSerializable = {
+    [key: string]: any;
+};
+export type JSONValue = string | number | boolean | undefined | JSONObject;
+export interface JSONObject {
+    [key: string]: JSONValue;
+}
 export type AnyFunction<A extends any[] = any[], R = any> = (...args: A) => R;
 export type Primitive = number | string | boolean | symbol | undefined | null | void | AnyFunction | Date;
 export type Cast<T, TComplex> = {
@@ -6,13 +13,6 @@ export type Cast<T, TComplex> = {
 export type DeepLeavesWrap<T, TComplex> = T extends string ? Cast<string, TComplex> : T extends number ? Cast<number, TComplex> : T extends boolean ? Cast<boolean, TComplex> : T extends undefined ? Cast<undefined, TComplex> : T extends null ? Cast<null, TComplex> : T extends void ? Cast<void, TComplex> : T extends symbol ? Cast<symbol, TComplex> : T extends AnyFunction ? Cast<AnyFunction, TComplex> : T extends Date ? Cast<Date, TComplex> : {
     [K in keyof T]: T[K] extends (infer U)[] ? DeepLeavesWrap<U, TComplex>[] : DeepLeavesWrap<T[K], TComplex>;
 };
-export type JSONSerializable = {
-    [key: string]: any;
-};
-export type JSONValue = string | number | boolean | undefined | JSONObject;
-export interface JSONObject {
-    [key: string]: JSONValue;
-}
 export type TypeName<T> = T extends string ? 'string' : T extends number ? 'number' : T extends boolean ? 'boolean' : T extends undefined ? 'undefined' : T extends AnyFunction ? 'function' : 'object';
 export type JsonKeys<T> = keyof {
     [P in keyof T]: number;
@@ -51,10 +51,8 @@ export type DeepProxyOnChange = (target: any, property: string | symbol, value:
 export type DeepProxyOnGet = (target: any, property: string | symbol, value: any, receiver: any, descriptor: any, result: any) => void;
 export type CurryFunc<T> = T extends (...args: infer Args) => infer R ? Args extends [infer Arg, ...infer RestArgs] ? (arg: Arg) => CurryFunc<(...args: RestArgs) => R> : R : T;
 export type ToThunkFn = () => ReturnType<TrlFn>;
-declare const THUNK_SYMBOL: unique symbol;
 export type Thunk = () => ReturnType<ToThunkFn> & {
-    __THUNK__: typeof THUNK_SYMBOL;
+    __THUNK__: Symbol;
 };
 export type TrlFn = (...args: any[]) => any;
 export type TrlAsyncFn = (...args: any[]) => any;
-export {};

package/dist/utils/types/utils.js

@@ -52,4 +52,3 @@ var TreeNode = /** @class */ (function () {
     return TreeNode;
 }());
 exports.TreeNode = TreeNode;
-var THUNK_SYMBOL = Symbol('thunk');