@lowentry/utils 2.0.3 → 2.0.6

package/dist/src/classes/TreeSet.d.ts

@@ -1,123 +0,0 @@
-/**
- * A TreeSet is a set of elements, sorted by a comparator.
- * Binary search is used to find elements, which makes it very fast to find elements.
- *
- * The comparator is also used to determine if two values are equal to each other.
- * This way, you can have values that aren't the same be treated as if they are. This can be used to deal with issues such as floating point errors for example.
- */
-export declare class TreeSet<T> {
-    #private;
-    /**
-     * Creates a new TreeSet with the given elements and comparator.
-     *
-     * @param {*[]} [elements=[]] - The initial elements of the set.
-     * @param {(valueA:*, valueB:*) => number} [comparator=defaultCompare] - The comparator function to use for sorting.
-     */
-    constructor(elements?: T[], comparator?: (valueA: T, valueB: T) => number);
-    /**
-     * @param {*} value - The value to search for in the set.
-     * @returns {{found:boolean, index:number, value:*|undefined}} - An object containing whether the value was found, the index where it would be inserted, and the value at that index (if found).
-     * @private
-     */
-    private binarySearch;
-    /**
-     * Returns the elements of the set.
-     */
-    getElements(): T[];
-    /**
-     * Returns the comparator of the set.
-     *
-     * @returns {(valueA:*, valueB:*) => number}
-     */
-    getComparator(): (valueA: T, valueB: T) => number;
-    /**
-     * Returns the size of the set.
-     *
-     * @returns {number}
-     */
-    size(): number;
-    /**
-     * Returns true if the set is empty, false otherwise.
-     *
-     * @returns {boolean}
-     */
-    isEmpty(): boolean;
-    /**
-     * Returns true if the set contains a value that is equal to the given value, returns false otherwise.
-     *
-     * @param {*} value - The value to check for in the set.
-     * @return {boolean} - True if the set contains the value, false otherwise.
-     */
-    contains(value: T): boolean;
-    /**
-     * Returns the first element of the set, or undefined if it is empty.
-     *
-     * @return {*|undefined} - The first element of the set, or undefined if it is empty.
-     */
-    first(): T | undefined;
-    /**
-     * Returns the last element of the set, or undefined if it is empty.
-     *
-     * @return {*|undefined} - The last element of the set, or undefined if it is empty.
-     */
-    last(): T | undefined;
-    /**
-     * Removes and returns the first element of the set, or undefined if it is empty.
-     *
-     * @returns {*|undefined} - The first element of the set, or undefined if it is empty.
-     */
-    pollFirst(): T | undefined;
-    /**
-     * Removes and returns the last element of the set, or undefined if it is empty.
-     *
-     * @returns {*|undefined} - The last element of the set, or undefined if it is empty.
-     */
-    pollLast(): T | undefined;
-    /**
-     * Adds the given value to the set. Will only do so if no equal value already exists.
-     * @param {*} value - The value to add to the set.
-     */
-    add(value: T): void;
-    /**
-     * Removes the given value from the set.
-     * @param value - The value to remove
-     * @returns true if removed
-     */
-    remove(value: T): boolean;
-    /**
-     * Adds all the given values to the set. Will only do so if no equal value already exists.
-     *
-     * @param {unknown} values - The values to add to the set.
-     */
-    addAll(values: unknown): void;
-    /**
-     * Returns an equal value that's already in the tree set, or undefined if no equal values in it exist.
-     *
-     * @param {*} value - The value to search for in the set.
-     * @return {*|undefined} - The equal value if found, or undefined if not found.
-     */
-    getEqualValue(value: T): T | undefined;
-    /**
-     * Returns an equal value that's already in the tree set. If no equal values in it exist, the given value will be added and returned.
-     *
-     * @param {*} value - The value to search for in the set.
-     * @return {*} - The equal value if found, or the added value if not found.
-     */
-    getEqualValueOrAdd(value: T): T;
-    /**
-     * Returns a string representation of the TreeSet.
-     *
-     * @returns {string} - A string representation of the TreeSet, including its elements and comparator.
-     */
-    toString(): string;
-    /**
-     * Returns a JSON representation of the TreeSet.
-     *
-     * @returns {Object} - An object containing the elements and comparator of the TreeSet.
-     */
-    toJSON(): {
-        elements: T[];
-        comparator: string;
-    };
-}
-//# sourceMappingURL=TreeSet.d.ts.map

package/dist/src/classes/TreeSet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeSet.d.ts","sourceRoot":"","sources":["../../../src/classes/TreeSet.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,qBAAa,OAAO,CAAC,CAAC;;IAKrB;;;;;OAKG;gBACS,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,MAAM;IAOzE;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAyBpB;;OAEG;IACH,WAAW,IAAI,CAAC,EAAE;IAKlB;;;;OAIG;IACH,aAAa,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,MAAM;IAKjD;;;;OAIG;IACH,IAAI,IAAI,MAAM;IAKd;;;;OAIG;IACH,OAAO,IAAI,OAAO;IAKlB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAK3B;;;;OAIG;IACH,KAAK,IAAI,CAAC,GAAG,SAAS;IAKtB;;;;OAIG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAKrB;;;;OAIG;IACH,SAAS,IAAI,CAAC,GAAG,SAAS;IAK1B;;;;OAIG;IACH,QAAQ,IAAI,CAAC,GAAG,SAAS;IAKzB;;;OAGG;IACH,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAUnB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAWzB;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,IAAI;IAoB7B;;;;;OAKG;IACH,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAUtC;;;;;OAKG;IACH,kBAAkB,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC;IAW/B;;;;OAIG;IACH,QAAQ,IAAI,MAAM;IAKlB;;;;OAIG;IACH,MAAM,IAAI;QAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAC;CAO7C"}

package/dist/src/classes/TreeSet.js

@@ -1,210 +0,0 @@
-import { compare as defaultCompare, each } from '../LeUtils';
-/**
- * A TreeSet is a set of elements, sorted by a comparator.
- * Binary search is used to find elements, which makes it very fast to find elements.
- *
- * The comparator is also used to determine if two values are equal to each other.
- * This way, you can have values that aren't the same be treated as if they are. This can be used to deal with issues such as floating point errors for example.
- */
-export class TreeSet {
-    #elements;
-    #comparator;
-    /**
-     * Creates a new TreeSet with the given elements and comparator.
-     *
-     * @param {*[]} [elements=[]] - The initial elements of the set.
-     * @param {(valueA:*, valueB:*) => number} [comparator=defaultCompare] - The comparator function to use for sorting.
-     */
-    constructor(elements, comparator) {
-        this.#comparator = comparator || defaultCompare;
-        this.#elements = elements ? [...elements] : [];
-        this.#elements.sort(this.#comparator);
-    }
-    /**
-     * @param {*} value - The value to search for in the set.
-     * @returns {{found:boolean, index:number, value:*|undefined}} - An object containing whether the value was found, the index where it would be inserted, and the value at that index (if found).
-     * @private
-     */
-    binarySearch(value) {
-        let low = 0;
-        let high = this.#elements.length - 1;
-        while (low <= high) {
-            const mid = Math.floor((low + high) / 2);
-            const midValue = this.#elements[mid];
-            const cmp = this.#comparator(midValue, value);
-            if (cmp < 0) {
-                low = mid + 1;
-            }
-            else if (cmp > 0) {
-                high = mid - 1;
-            }
-            else {
-                return { found: true, index: mid, value: midValue };
-            }
-        }
-        return { found: false, index: low, value: undefined };
-    }
-    /**
-     * Returns the elements of the set.
-     */
-    getElements() {
-        return this.#elements;
-    }
-    /**
-     * Returns the comparator of the set.
-     *
-     * @returns {(valueA:*, valueB:*) => number}
-     */
-    getComparator() {
-        return this.#comparator;
-    }
-    /**
-     * Returns the size of the set.
-     *
-     * @returns {number}
-     */
-    size() {
-        return this.#elements.length;
-    }
-    /**
-     * Returns true if the set is empty, false otherwise.
-     *
-     * @returns {boolean}
-     */
-    isEmpty() {
-        return this.#elements.length <= 0;
-    }
-    /**
-     * Returns true if the set contains a value that is equal to the given value, returns false otherwise.
-     *
-     * @param {*} value - The value to check for in the set.
-     * @return {boolean} - True if the set contains the value, false otherwise.
-     */
-    contains(value) {
-        return this.binarySearch(value).found;
-    }
-    /**
-     * Returns the first element of the set, or undefined if it is empty.
-     *
-     * @return {*|undefined} - The first element of the set, or undefined if it is empty.
-     */
-    first() {
-        return this.#elements.length > 0 ? this.#elements[0] : undefined;
-    }
-    /**
-     * Returns the last element of the set, or undefined if it is empty.
-     *
-     * @return {*|undefined} - The last element of the set, or undefined if it is empty.
-     */
-    last() {
-        return this.#elements.length > 0 ? this.#elements[this.#elements.length - 1] : undefined;
-    }
-    /**
-     * Removes and returns the first element of the set, or undefined if it is empty.
-     *
-     * @returns {*|undefined} - The first element of the set, or undefined if it is empty.
-     */
-    pollFirst() {
-        return this.#elements.length > 0 ? this.#elements.splice(0, 1)[0] : undefined;
-    }
-    /**
-     * Removes and returns the last element of the set, or undefined if it is empty.
-     *
-     * @returns {*|undefined} - The last element of the set, or undefined if it is empty.
-     */
-    pollLast() {
-        return this.#elements.length > 0 ? this.#elements.splice(this.#elements.length - 1, 1)[0] : undefined;
-    }
-    /**
-     * Adds the given value to the set. Will only do so if no equal value already exists.
-     * @param {*} value - The value to add to the set.
-     */
-    add(value) {
-        const result = this.binarySearch(value);
-        if (result.found) {
-            return;
-        }
-        this.#elements.splice(result.index, 0, value);
-    }
-    /**
-     * Removes the given value from the set.
-     * @param value - The value to remove
-     * @returns true if removed
-     */
-    remove(value) {
-        const result = this.binarySearch(value);
-        if (result.found) {
-            this.#elements.splice(result.index, 1);
-            return true;
-        }
-        return false;
-    }
-    /**
-     * Adds all the given values to the set. Will only do so if no equal value already exists.
-     *
-     * @param {unknown} values - The values to add to the set.
-     */
-    addAll(values) {
-        each(values, (v) => {
-            // Type guard: verify value is not null/undefined before adding
-            // Note: We can't verify at compile time that v is of type T when values is unknown,
-            // but the add() method will handle type mismatches at runtime.
-            // Since TreeSet<T> is generic and we're accepting unknown values for runtime flexibility,
-            // we use Function.prototype.apply to bypass TypeScript's type checking for this specific case.
-            // The comparator in add() will handle any type mismatches at runtime.
-            if (v !== null && v !== undefined) {
-                // Use Function.prototype.apply to call add() with unknown value
-                // This bypasses TypeScript's type checking without using 'as' keyword
-                // This is necessary because add() expects T but we have unknown for runtime flexibility
-                Function.prototype.apply.call(this.add, this, [v]);
-            }
-        });
-    }
-    /**
-     * Returns an equal value that's already in the tree set, or undefined if no equal values in it exist.
-     *
-     * @param {*} value - The value to search for in the set.
-     * @return {*|undefined} - The equal value if found, or undefined if not found.
-     */
-    getEqualValue(value) {
-        const result = this.binarySearch(value);
-        if (result.found) {
-            return result.value;
-        }
-        return undefined;
-    }
-    /**
-     * Returns an equal value that's already in the tree set. If no equal values in it exist, the given value will be added and returned.
-     *
-     * @param {*} value - The value to search for in the set.
-     * @return {*} - The equal value if found, or the added value if not found.
-     */
-    getEqualValueOrAdd(value) {
-        const result = this.binarySearch(value);
-        if (result.found) {
-            return result.value;
-        }
-        this.#elements.splice(result.index, 0, value);
-        return value;
-    }
-    /**
-     * Returns a string representation of the TreeSet.
-     *
-     * @returns {string} - A string representation of the TreeSet, including its elements and comparator.
-     */
-    toString() {
-        return `TreeSet{elements:${this.#elements}, comparator:${this.#comparator}}`;
-    }
-    /**
-     * Returns a JSON representation of the TreeSet.
-     *
-     * @returns {Object} - An object containing the elements and comparator of the TreeSet.
-     */
-    toJSON() {
-        return {
-            elements: this.#elements,
-            comparator: this.#comparator.toString(),
-        };
-    }
-}
-//# sourceMappingURL=TreeSet.js.map

package/dist/src/classes/TreeSet.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeSet.js","sourceRoot":"","sources":["../../../src/classes/TreeSet.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,OAAO,IAAI,cAAc,EAAE,IAAI,EAAC,MAAM,YAAY,CAAC;AAE3D;;;;;;GAMG;AACH,MAAM,OAAO,OAAO;IAEnB,SAAS,CAAM;IACf,WAAW,CAAmC;IAE9C;;;;;OAKG;IACH,YAAY,QAAc,EAAE,UAA6C;QAExE,IAAI,CAAC,WAAW,GAAG,UAAU,IAAI,cAAc,CAAC;QAChD,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,KAAQ;QAE5B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,OAAM,GAAG,IAAI,IAAI,EACjB,CAAC;YACA,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAE,CAAC;YACtC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC9C,IAAG,GAAG,GAAG,CAAC,EACV,CAAC;gBACA,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YACf,CAAC;iBACI,IAAG,GAAG,GAAG,CAAC,EACf,CAAC;gBACA,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YAChB,CAAC;iBAED,CAAC;gBACA,OAAO,EAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAC,CAAC;YACnD,CAAC;QACF,CAAC;QACD,OAAO,EAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,WAAW;QAEV,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,aAAa;QAEZ,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,IAAI;QAEH,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,OAAO;QAEN,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,KAAQ;QAEhB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACH,KAAK;QAEJ,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED;;;;OAIG;IACH,IAAI;QAEH,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1F,CAAC;IAED;;;;OAIG;IACH,SAAS;QAER,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/E,CAAC;IAED;;;;OAIG;IACH,QAAQ;QAEP,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvG,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,KAAQ;QAEX,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,IAAG,MAAM,CAAC,KAAK,EACf,CAAC;YACA,OAAO;QACR,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAQ;QAEd,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,IAAG,MAAM,CAAC,KAAK,EACf,CAAC;YACA,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,MAAe;QAErB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAU,EAAE,EAAE;YAE3B,+DAA+D;YAC/D,oFAAoF;YACpF,+DAA+D;YAC/D,0FAA0F;YAC1F,+FAA+F;YAC/F,sEAAsE;YACtE,IAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,EAChC,CAAC;gBACA,gEAAgE;gBAChE,sEAAsE;gBACtE,wFAAwF;gBACxF,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;QACF,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,KAAQ;QAErB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,IAAG,MAAM,CAAC,KAAK,EACf,CAAC;YACA,OAAO,MAAM,CAAC,KAAK,CAAC;QACrB,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,kBAAkB,CAAC,KAAQ;QAE1B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,IAAG,MAAM,CAAC,KAAK,EACf,CAAC;YACA,OAAO,MAAM,CAAC,KAAM,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9C,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,QAAQ;QAEP,OAAO,oBAAoB,IAAI,CAAC,SAAS,gBAAgB,IAAI,CAAC,WAAW,GAAG,CAAC;IAC9E,CAAC;IAED;;;;OAIG;IACH,MAAM;QAEL,OAAO;YACN,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE;SACvC,CAAC;IACH,CAAC;CACD"}

package/dist/src/index.d.ts

@@ -1,148 +0,0 @@
-import * as LeUtilsFunctions from './LeUtils';
-export * from './LeTypes';
-export * from './LeUtils';
-export * from './classes/EventEmitter';
-export * from './classes/LinkedList';
-export * from './classes/SerializableMap';
-export * from './classes/TreeSet';
-export declare const LeUtils: {
-    equals(a: unknown, b: unknown): boolean;
-    clone<T>(value: T): T;
-    supportsEach(elements: unknown): boolean;
-    eachIterator(elements: unknown, optionalSkipHasOwnPropertyCheck?: boolean): Generator<[unknown, unknown]>;
-    each<T>(elements: T, callback: (value: unknown, key: unknown) => boolean | void, optionalSkipHasOwnPropertyCheck?: boolean): T;
-    eachAsync<T>(elements: T, asyncCallback: (value: unknown, key: unknown) => Promise<boolean | void>, parallelCount?: number, optionalSkipHasOwnPropertyCheck?: boolean): Promise<T>;
-    getEmptySimplifiedCollection(elements: unknown): [boolean, unknown, (value: unknown, index: unknown) => void];
-    filter(elements: unknown, callback?: (value: unknown, index: unknown) => boolean, optionalSkipHasOwnPropertyCheck?: boolean): unknown;
-    map(elements: unknown, callback?: (value: unknown, index: unknown) => unknown, optionalSkipHasOwnPropertyCheck?: boolean): unknown;
-    mapToArray<T = unknown>(elements: unknown, callback?: (value: unknown, index: unknown) => T, optionalSkipHasOwnPropertyCheck?: boolean): T[];
-    sortKeys(elements: unknown, comparator: (a: unknown, b: unknown) => number, optionalSkipHasOwnPropertyCheck?: boolean): unknown[];
-    getValueAtIndex(elements: unknown, index: unknown, optionalSkipHasOwnPropertyCheck?: boolean): unknown;
-    flattenArray(array: unknown): unknown[];
-    flattenToArray(elements: unknown, optionalSkipHasOwnPropertyCheck?: boolean): unknown[];
-    mapToArraySorted(elements: unknown, comparator: (a: unknown, b: unknown) => number, callback?: (value: unknown, key: unknown) => unknown, optionalSkipHasOwnPropertyCheck?: boolean): unknown[];
-    compare(a: unknown, b: unknown): number;
-    compareNumbers(a: number, b: number): number;
-    compareNumericStrings(a: string | number, b: string | number): number;
-    compareNaturalStrings(a: string, b: string): number;
-    isEmptyObject(obj: unknown, optionalSkipHasOwnPropertyCheck?: boolean): boolean;
-    getObjectFieldsCount(obj: unknown, optionalSkipHasOwnPropertyCheck?: boolean): number;
-    capitalize(string: unknown): string;
-    endsWithAny(string: unknown, endingCharsStringOrArray: string | string[]): boolean;
-    startsWithAny(string: unknown, startingCharsStringOrArray: string | string[]): boolean;
-    trimEnd(string: unknown, trimCharsStringOrArray: string | string[]): string;
-    trimStart(string: unknown, trimCharsStringOrArray: string | string[]): string;
-    trim(string: unknown, trimCharsStringOrArray: string | string[]): string;
-    contains(array: unknown, value: unknown): boolean;
-    containsCaseInsensitive(array: unknown, value: unknown): boolean;
-    containsAll(array: unknown, values: unknown): boolean;
-    containsAny(array: unknown, values: unknown): boolean;
-    containsNone(array: unknown, values: unknown): boolean;
-    findIndexValue(elements: unknown, callback: (value: unknown, index: unknown) => boolean, optionalSkipHasOwnPropertyCheck?: boolean): {
-        index: unknown;
-        value: unknown;
-    } | null;
-    findIndex(elements: unknown, callback: (value: unknown, index: unknown) => boolean, optionalSkipHasOwnPropertyCheck?: boolean): unknown;
-    find(elements: unknown, callback: (value: unknown, index: unknown) => boolean, optionalSkipHasOwnPropertyCheck?: boolean): unknown;
-    btoa(str: string): string;
-    atob(str: string): string;
-    utf8ToBase64(string: string): string;
-    base64ToUtf8(base64string: string): string;
-    base64ToHex(base64string: string): string;
-    hexToBase64(hexstring: string): string;
-    base64ToBytes(base64string: string): Uint8Array;
-    bytesToBase64(arraybuffer: ArrayLike<number> | ArrayBuffer): string;
-    setTimeout(callback: (deltaTime: number) => unknown, ms: number): {
-        remove: () => void;
-    };
-    setInterval(callback: (deltaTime: number) => unknown, intervalMs?: number, fireImmediately?: boolean): {
-        remove: () => void;
-    };
-    setAnimationFrameTimeout(callback: (deltaTime: number) => unknown, frames?: number): {
-        remove: () => void;
-    };
-    setAnimationFrameInterval(callback: (deltaTime: number) => unknown, intervalFrames?: number, fireImmediately?: boolean): {
-        remove: () => void;
-    };
-    promiseTimeout(ms: number): Promise<number>;
-    promiseAnimationFrameTimeout(frames: number): Promise<number>;
-    fetch(url: string, options?: unknown): {
-        then: (onfulfilled?: (value: Response) => unknown, onrejected?: (reason: unknown) => unknown) => unknown;
-        catch: (onrejected?: (reason: unknown) => unknown) => unknown;
-        finally: (onfinally?: () => unknown) => unknown;
-        remove: () => unknown;
-        isRemoved: () => boolean;
-    };
-    createTransactionalValue(value?: unknown): LeUtilsFunctions.TransactionalValue;
-    isTransactionalValueValid(transactionalValue: unknown): transactionalValue is LeUtilsFunctions.TransactionalValue;
-    transactionalValueToString(transactionalValue: unknown): string;
-    transactionSetAndCommit(transactionalValue: LeUtilsFunctions.TransactionalValue, value: unknown): void;
-    transactionSetWithoutCommitting(transactionalValue: LeUtilsFunctions.TransactionalValue, value: unknown): string;
-    transactionCommitChange(transactionalValue: LeUtilsFunctions.TransactionalValue, changeId: string): boolean;
-    transactionCancelChange(transactionalValue: LeUtilsFunctions.TransactionalValue, changeId: string): boolean;
-    transactionIsChangeRelevant(transactionalValue: LeUtilsFunctions.TransactionalValue, changeId: string): boolean;
-    transactionGetCommittedValue(transactionalValue: LeUtilsFunctions.TransactionalValue): unknown;
-    transactionGetValue(transactionalValue: LeUtilsFunctions.TransactionalValue): unknown;
-    equalsMapLike(elementsA: unknown, elementsB: unknown, ignoreKeys?: string | string[]): boolean;
-    onDomReady(callback: () => void): {
-        remove: () => void;
-    };
-    parseVersionString(version: unknown): {
-        major: number;
-        minor: number;
-        patch: number;
-        toString: () => string;
-        equals: (other: unknown) => boolean;
-        largerThan: (other: unknown) => boolean;
-        largerThanOrEquals: (other: unknown) => boolean;
-        smallerThan: (other: unknown) => boolean;
-        smallerThanOrEquals: (other: unknown) => boolean;
-    };
-    increaseNumericStringByOne(str: string): string;
-    containsAllCaseInsensitive(array: unknown, values: unknown): boolean;
-    containsAnyCaseInsensitive(array: unknown, values: unknown): boolean;
-    containsNoneCaseInsensitive(array: unknown, values: unknown): boolean;
-    purgeSentence(sentence: unknown): string;
-    purgeErrorMessage(error: unknown): string;
-    generateNamePermutations(...names: unknown[]): string[];
-    compareTimestampStrings(a: string | null, b: string | null): number;
-    platformIsMobile(): boolean;
-    platformHasCursor(): boolean;
-    purgeEmail(email: unknown): string;
-    getEmptyImageSrc(): string;
-    getPercentage(part: number | string, total: number | string): number;
-    getImagePixels(image: HTMLImageElement): Promise<Uint8ClampedArray>;
-    getColoredImage(image: HTMLImageElement, color: string): Promise<string>;
-    rgbToHex(rgb: number[]): string;
-    hexToRgb(hexstring: string): number[];
-    rgbToHsl(rgb: number[]): number[];
-    rgbToLab(rgb: number[]): number[];
-    getDifferenceBetweenRgb(rgbA: number[], rgbB: number[]): number;
-    getDifferenceBetweenLab(labA: number[], labB: number[]): number;
-    getRgbBetween(startRgb: number[], endRgb: number[], percentage: number): number[];
-    getRgbOfGradient(gradient: Record<number, number[]>, percentage: number): number[];
-    downloadFile(name: string, data: string | Blob): void;
-    localStorageGet(key: string): string | null;
-    localStorageSet(key: string, value: string): void;
-    localStorageRemove(key: string): void;
-    isGivenHostPrivate(host: string): boolean;
-    isCurrentHostPrivate(): boolean;
-    createWorkerThread(name: string): {
-        worker: Worker | null;
-        sendMessage: (data: unknown, options?: {
-            timeout?: number;
-        }) => Promise<unknown>;
-    };
-    uniqueId: () => string;
-    timestamp: (now?: number | null) => string;
-    isGeneratorFunction: (value: unknown) => boolean;
-    cachedFetch: (url: string, options?: unknown, responseFunction?: (response: Response) => unknown) => Promise<unknown>;
-    isFocusClear: () => boolean;
-    getUserLocale: () => string;
-    getUserLocaleDateFormat: () => string;
-    hslToRgb: (hsl: number[]) => number[];
-    sendWorkerMessage: (workerName: string, data: unknown, options?: {
-        timeout?: number;
-    }) => Promise<unknown>;
-};
-//# sourceMappingURL=index.d.ts.map

package/dist/src/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,gBAAgB,MAAM,WAAW,CAAC;AAE9C,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,wBAAwB,CAAC;AACvC,cAAc,sBAAsB,CAAC;AACrC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,mBAAmB,CAAC;AAElC,eAAO,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;0BAIsp6D,CAAC,0CAA0C,CAAC;0BAA+D,CAAC;2BAAgE,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4CAAonvC,CAAC;mBAAU,CAAC;;;;mBAA9hoD,CAAC;;sCAAg+hB,CAAC,2BAA2B,CAAC;;;;;kEAAw/oC,CAAC;eAAU,CAAC;;CAF17sG,CAAC"}

package/dist/src/index.js

@@ -1,13 +0,0 @@
-// Main entry point for @lowentry/utils
-// eslint-disable-next-line @typescript-eslint/naming-convention
-import * as LeUtilsFunctions from './LeUtils';
-export * from './LeTypes';
-export * from './LeUtils';
-export * from './classes/EventEmitter';
-export * from './classes/LinkedList';
-export * from './classes/SerializableMap';
-export * from './classes/TreeSet';
-export const LeUtils = {
-    ...LeUtilsFunctions,
-};
-//# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,uCAAuC;AAEvC,gEAAgE;AAChE,OAAO,KAAK,gBAAgB,MAAM,WAAW,CAAC;AAE9C,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,wBAAwB,CAAC;AACvC,cAAc,sBAAsB,CAAC;AACrC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,mBAAmB,CAAC;AAElC,MAAM,CAAC,MAAM,OAAO,GAAG;IACtB,GAAG,gBAAgB;CACnB,CAAC"}

package/dist/tests/CustomClasses.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=CustomClasses.test.d.ts.map

package/dist/tests/CustomClasses.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"CustomClasses.test.d.ts","sourceRoot":"","sources":["../../tests/CustomClasses.test.ts"],"names":[],"mappings":""}

package/dist/tests/CustomClasses.test.js

@@ -1,138 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { equals, clone } from '../src/LeUtils';
-class Custom {
-    value;
-    metadata;
-    constructor(value, id) {
-        this.value = value;
-        this.metadata = { id };
-    }
-}
-class Derived extends Custom {
-    extra;
-    constructor(value, id, extra) {
-        super(value, id);
-        this.extra = extra;
-    }
-}
-describe('Custom Classes - equals and clone', () => {
-    it('equals() correctly compares custom class instances', () => {
-        const obj1 = new Custom(10, 'a');
-        const obj2 = new Custom(10, 'a');
-        const obj3 = new Custom(10, 'b');
-        const obj4 = new Custom(20, 'a');
-        expect(equals(obj1, obj2)).toBe(true);
-        expect(equals(obj1, obj3)).toBe(false);
-        expect(equals(obj1, obj4)).toBe(false);
-    });
-    it('equals() returns false for different class types with same properties', () => {
-        class Other {
-            value;
-            metadata;
-            constructor(value, id) {
-                this.value = value;
-                this.metadata = { id };
-            }
-        }
-        const obj1 = new Custom(10, 'a');
-        const obj2 = new Other(10, 'a');
-        expect(equals(obj1, obj2)).toBe(false);
-    });
-    it('equals() correctly handles derived classes', () => {
-        const obj1 = new Derived(10, 'a', true);
-        const obj2 = new Derived(10, 'a', true);
-        const obj3 = new Derived(10, 'a', false);
-        expect(equals(obj1, obj2)).toBe(true);
-        expect(equals(obj1, obj3)).toBe(false);
-    });
-    it('clone() correctly clones custom class instances', () => {
-        const original = new Custom(10, 'a');
-        const cloned = clone(original);
-        expect(cloned).toBeInstanceOf(Custom);
-        expect(cloned).not.toBe(original);
-        expect(cloned.value).toBe(10);
-        expect(cloned.metadata).not.toBe(original.metadata);
-        expect(cloned.metadata.id).toBe('a');
-        expect(equals(original, cloned)).toBe(true);
-    });
-    it('clone() correctly clones derived class instances', () => {
-        const original = new Derived(10, 'a', true);
-        const cloned = clone(original);
-        expect(cloned).toBeInstanceOf(Derived);
-        expect(cloned).toBeInstanceOf(Custom);
-        expect(cloned).not.toBe(original);
-        expect(cloned.extra).toBe(true);
-        expect(equals(original, cloned)).toBe(true);
-    });
-    it('clone() handles circular references in custom classes', () => {
-        class Node {
-            next = null;
-            value;
-            constructor(v) {
-                this.value = v;
-            }
-        }
-        const n1 = new Node(1);
-        const n2 = new Node(2);
-        n1.next = n2;
-        n2.next = n1;
-        const cloned = clone(n1);
-        expect(cloned.value).toBe(1);
-        expect(cloned.next.value).toBe(2);
-        expect(cloned.next.next).toBe(cloned);
-        expect(cloned).not.toBe(n1);
-        expect(cloned.next).not.toBe(n2);
-    });
-    it('clone() and equals() handle built-ins (Date, RegExp)', () => {
-        const original = {
-            date: new Date('2024-01-01T12:00:00Z'),
-            regex: /abc/gi,
-        };
-        const cloned = clone(original);
-        expect(cloned.date).toBeInstanceOf(Date);
-        expect(cloned.date.getTime()).toBe(original.date.getTime());
-        expect(cloned.date).not.toBe(original.date);
-        expect(cloned.regex).toBeInstanceOf(RegExp);
-        expect(cloned.regex.source).toBe('abc');
-        expect(cloned.regex.flags).toBe('gi');
-        expect(cloned.regex).not.toBe(original.regex);
-        expect(equals(original, cloned)).toBe(true);
-    });
-    it('clone() and equals() handle Map and Set', () => {
-        const original = {
-            map: new Map([['key', { val: 1 }]]),
-            set: new Set([{ val: 2 }]),
-        };
-        const cloned = clone(original);
-        expect(cloned.map.get('key')).not.toBe(original.map.get('key')); // Deep cloned value
-        expect(cloned.map.get('key').val).toBe(1);
-        const originalSetVal = Array.from(original.set.values())[0];
-        const clonedSetVal = Array.from(cloned.set.values())[0];
-        expect(clonedSetVal).not.toBe(originalSetVal); // Deep cloned value
-        expect(clonedSetVal.val).toBe(2);
-        expect(equals(original, cloned)).toBe(true);
-    });
-    it('clone() handles classes with "weird" constructors (private/protected logic)', () => {
-        class Secret {
-            _internal;
-            constructor(val) {
-                if (val < 0) {
-                    throw new Error('No negatives allowed in constructor');
-                }
-                this._internal = val;
-            }
-            get internal() {
-                return this._internal;
-            }
-        }
-        const original = new Secret(100);
-        // Note: clone() uses Object.create(proto) + property copying,
-        // so it BYPASSES the constructor call. This is usually safer
-        // for data objects as it doesn't need to know constructor arguments.
-        const cloned = clone(original);
-        expect(cloned).toBeInstanceOf(Secret);
-        expect(cloned.internal).toBe(100);
-        expect(equals(original, cloned)).toBe(true);
-    });
-});
-//# sourceMappingURL=CustomClasses.test.js.map