@nejs/basic-extensions 2.4.0 → 2.6.0

package/dist/mjs/setextensions.js

@@ -1,201 +1,203 @@
 import { Patch } from '@nejs/extension';
 export const SetPrototypeExtensions = new Patch(Set.prototype, {
-    /**
-     * Merges multiple iterables into the set. Each element from the iterables
-     * is added to the set, ensuring uniqueness of all elements. This method
-     * mutates the original set.
-     *
-     * @param {...Iterable} iterables - One or more iterable objects (like Set
-     * or Array) whose elements will be added to the set.
-     */
-    concat(...iterables) {
-        for (const iterable of iterables) {
-            if (typeof iterable === 'string' ||
-                !Reflect.has(iterable, Symbol.iterator)) {
-                this.add(iterable);
-                continue;
+    [Patch.kMutablyHidden]: {
+        /**
+         * Merges multiple iterables into the set. Each element from the iterables
+         * is added to the set, ensuring uniqueness of all elements. This method
+         * mutates the original set.
+         *
+         * @param {...Iterable} iterables - One or more iterable objects (like Set
+         * or Array) whose elements will be added to the set.
+         */
+        concat(...iterables) {
+            for (const iterable of iterables) {
+                if (typeof iterable === 'string' ||
+                    !Reflect.has(iterable, Symbol.iterator)) {
+                    this.add(iterable);
+                    continue;
+                }
+                for (const element of iterable) {
+                    this.add(element);
+                }
             }
-            for (const element of iterable) {
-                this.add(element);
+        },
+        /**
+         * Checks to see if any value within the `Set` loosely equals the supplied
+         * value.
+         *
+         * @param {*} value any value that might be loosely equal to an item in the
+         * set, as opposed to {@link Set.has} which is the equivalent of a strict or
+         * triple equals (`===`) check
+         * @returns {boolean} `true` if any value within the set is loosely equal to
+         * the supplied value, `false` otherwise
+         */
+        contains(value) {
+            for (const element of this) {
+                if (value == element) {
+                    return true;
+                }
             }
-        }
-    },
-    /**
-     * Checks to see if any value within the `Set` loosely equals the supplied
-     * value.
-     *
-     * @param {*} value any value that might be loosely equal to an item in the
-     * set, as opposed to {@link Set.has} which is the equivalent of a strict or
-     * triple equals (`===`) check
-     * @returns {boolean} `true` if any value within the set is loosely equal to
-     * the supplied value, `false` otherwise
-     */
-    contains(value) {
-        for (const element of this) {
-            if (value == element) {
-                return true;
+            return false;
+        },
+        /**
+         * Checks if every element in the set passes the test implemented by the
+         * provided function. The function is called with each element of the set.
+         * Note: Since sets do not have indices, the index parameter is always NaN.
+         *
+         * @param {Function} everyFn - The function to test each element. Receives
+         * the element, index (always NaN), and the set itself.
+         * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
+         * `everyFn`.
+         * @throws {TypeError} If `everyFn` is not a function.
+         * @returns {boolean} True if every element passes the test, false otherwise.
+         */
+        every(everyFn, thisArg) {
+            if (typeof everyFn !== 'function') {
+                throw new TypeError(`everyFn must be a function! Received ${String(everyFn)}`);
             }
-        }
-        return false;
-    },
-    /**
-     * Checks if every element in the set passes the test implemented by the
-     * provided function. The function is called with each element of the set.
-     * Note: Since sets do not have indices, the index parameter is always NaN.
-     *
-     * @param {Function} everyFn - The function to test each element. Receives
-     * the element, index (always NaN), and the set itself.
-     * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
-     * `everyFn`.
-     * @throws {TypeError} If `everyFn` is not a function.
-     * @returns {boolean} True if every element passes the test, false otherwise.
-     */
-    every(everyFn, thisArg) {
-        if (typeof everyFn !== 'function') {
-            throw new TypeError(`everyFn must be a function! Received ${String(everyFn)}`);
-        }
-        let found = 0;
-        for (const element of this) {
-            if (everyFn.call(thisArg, element, NaN, this)) {
-                found++;
+            let found = 0;
+            for (const element of this) {
+                if (everyFn.call(thisArg, element, NaN, this)) {
+                    found++;
+                }
             }
-        }
-        return (found === this.size);
-    },
-    /**
-     * Finds the first element in the set satisfying the provided testing
-     * function. If no elements satisfy the testing function, undefined is
-     * returned. The function is called with each element of the set.
-     * Note: Since sets do not have indices, the index parameter is always NaN.
-     *
-     * @param {Function} findFn - The function to execute on each element. It
-     * receives the element, index (always NaN), and the set itself.
-     * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
-     * `findFn`.
-     * @throws {TypeError} If `findFn` is not a function.
-     * @returns {*} The first element that satisfies `findFn`, or undefined.
-     */
-    find(findFn, thisArg) {
-        if (typeof findFn !== 'function') {
-            throw new TypeError(`findFn must be a function! Received ${String(findFn)}`);
-        }
-        for (const element of this) {
-            const match = findFn.call(thisArg, element, NaN, this);
-            if (match) {
-                return element;
+            return (found === this.size);
+        },
+        /**
+         * Finds the first element in the set satisfying the provided testing
+         * function. If no elements satisfy the testing function, undefined is
+         * returned. The function is called with each element of the set.
+         * Note: Since sets do not have indices, the index parameter is always NaN.
+         *
+         * @param {Function} findFn - The function to execute on each element. It
+         * receives the element, index (always NaN), and the set itself.
+         * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
+         * `findFn`.
+         * @throws {TypeError} If `findFn` is not a function.
+         * @returns {*} The first element that satisfies `findFn`, or undefined.
+         */
+        find(findFn, thisArg) {
+            if (typeof findFn !== 'function') {
+                throw new TypeError(`findFn must be a function! Received ${String(findFn)}`);
             }
-        }
-        return undefined;
-    },
-    /**
-     * Finds the last element in the set satisfying the provided testing function.
-     * If no elements satisfy the testing function, undefined is returned. The
-     * function is called with each element of the set in reverse order.
-     * Note: Since sets do not have indices, the index parameter is always NaN.
-     *
-     * @param {Function} findFn - The function to execute on each element. It
-     * receives the element, index (always NaN), and the set itself.
-     * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
-     * `findFn`.
-     * @throws {TypeError} If `findFn` is not a function.
-     * @returns {*} The last element that satisfies `findFn`, or undefined.
-     */
-    findLast(findFn, thisArg) {
-        if (typeof findFn !== 'function') {
-            throw new TypeError(`findFn must be a function! Received ${String(findFn)}`);
-        }
-        const found = [];
-        for (const element of this) {
-            const match = findFn.call(thisArg, element, NaN, this);
-            if (match) {
-                found.push(element);
+            for (const element of this) {
+                const match = findFn.call(thisArg, element, NaN, this);
+                if (match) {
+                    return element;
+                }
             }
-        }
-        if (found.length) {
-            return found[found.length - 1];
-        }
-        return undefined;
-    },
-    /**
-     * A getter property that returns the number of elements in the set.
-     * This is an alias for the `size` property of the set.
-     *
-     * @returns {number} The number of elements in the set.
-     */
-    get length() {
-        return this.size;
-    },
-    /**
-     * Creates a new array populated with the results of calling the provided
-     * function on every element in the set. The function is called with each
-     * element of the set. Note: Since sets do not have indices, the index
-     * parameter is always NaN.
-     *
-     * @param {Function} mapFn - The function to execute on each element. It
-     * receives the element, index (always NaN), and the set itself.
-     * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
-     * `mapFn`.
-     * @throws {TypeError} If `mapFn` is not a function.
-     * @returns {Array} A new array with each element being the result of the
-     * `mapFn`.
-     */
-    map(mapFn, thisArg) {
-        if (typeof mapFn !== 'function') {
-            throw new TypeError(`mapFn must be a function! Received ${String(mapFn)}`);
-        }
-        const transformed = [];
-        for (const element of this) {
-            transformed.push(mapFn.call(thisArg, element, NaN, this));
-        }
-        return transformed;
-    },
-    /**
-     * Applies a function against an accumulator and each element in the set to
-     * reduce it to a single value. The function is called with each element of
-     * the set. Note: Since sets do not have indices, the index parameter is
-     * always NaN.
-     *
-     * @param {Function} reduceFn - The function to execute on each element. It
-     * receives the accumulator, element, index (always NaN), and the set itself.
-     * @param {*} initialValue - The initial value to start reducing from.
-     * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
-     * `reduceFn`.
-     * @throws {TypeError} If `reduceFn` is not a function.
-     * @returns {*} The reduced value.
-     */
-    reduce(reduceFn, initialValue, thisArg) {
-        if (typeof reduceFn !== 'function') {
-            throw new TypeError(`reduceFn must be a Function! Received ${String(reduceFn)}`);
-        }
-        let accumulator = initialValue;
-        for (const element of this) {
-            accumulator = reduceFn.call(thisArg, accumulator, element, NaN, this);
-        }
-        return accumulator;
-    },
-    /**
-     * Tests whether at least one element in the set passes the test implemented
-     * by the provided function. The function is called with each element of the
-     * set. Note: Since sets do not have indices, the index parameter is always NaN.
-     *
-     * @param {Function} someFn - The function to test each element. It receives
-     * the element, index (always NaN), and the set itself.
-     * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
-     * `someFn`.
-     * @throws {TypeError} If `someFn` is not a function.
-     * @returns {boolean} True if at least one element passes the test, false
-     * otherwise.
-     */
-    some(someFn, thisArg) {
-        if (typeof someFn !== 'function') {
-            throw new TypeError(`someFn must be a function! Received ${String(someFn)}`);
-        }
-        for (const element of this) {
-            if (someFn.call(thisArg, element, NaN, this)) {
-                return true;
+            return undefined;
+        },
+        /**
+         * Finds the last element in the set satisfying the provided testing function.
+         * If no elements satisfy the testing function, undefined is returned. The
+         * function is called with each element of the set in reverse order.
+         * Note: Since sets do not have indices, the index parameter is always NaN.
+         *
+         * @param {Function} findFn - The function to execute on each element. It
+         * receives the element, index (always NaN), and the set itself.
+         * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
+         * `findFn`.
+         * @throws {TypeError} If `findFn` is not a function.
+         * @returns {*} The last element that satisfies `findFn`, or undefined.
+         */
+        findLast(findFn, thisArg) {
+            if (typeof findFn !== 'function') {
+                throw new TypeError(`findFn must be a function! Received ${String(findFn)}`);
+            }
+            const found = [];
+            for (const element of this) {
+                const match = findFn.call(thisArg, element, NaN, this);
+                if (match) {
+                    found.push(element);
+                }
+            }
+            if (found.length) {
+                return found[found.length - 1];
+            }
+            return undefined;
+        },
+        /**
+         * A getter property that returns the number of elements in the set.
+         * This is an alias for the `size` property of the set.
+         *
+         * @returns {number} The number of elements in the set.
+         */
+        get length() {
+            return this.size;
+        },
+        /**
+         * Creates a new array populated with the results of calling the provided
+         * function on every element in the set. The function is called with each
+         * element of the set. Note: Since sets do not have indices, the index
+         * parameter is always NaN.
+         *
+         * @param {Function} mapFn - The function to execute on each element. It
+         * receives the element, index (always NaN), and the set itself.
+         * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
+         * `mapFn`.
+         * @throws {TypeError} If `mapFn` is not a function.
+         * @returns {Array} A new array with each element being the result of the
+         * `mapFn`.
+         */
+        map(mapFn, thisArg) {
+            if (typeof mapFn !== 'function') {
+                throw new TypeError(`mapFn must be a function! Received ${String(mapFn)}`);
+            }
+            const transformed = [];
+            for (const element of this) {
+                transformed.push(mapFn.call(thisArg, element, NaN, this));
+            }
+            return transformed;
+        },
+        /**
+         * Applies a function against an accumulator and each element in the set to
+         * reduce it to a single value. The function is called with each element of
+         * the set. Note: Since sets do not have indices, the index parameter is
+         * always NaN.
+         *
+         * @param {Function} reduceFn - The function to execute on each element. It
+         * receives the accumulator, element, index (always NaN), and the set itself.
+         * @param {*} initialValue - The initial value to start reducing from.
+         * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
+         * `reduceFn`.
+         * @throws {TypeError} If `reduceFn` is not a function.
+         * @returns {*} The reduced value.
+         */
+        reduce(reduceFn, initialValue, thisArg) {
+            if (typeof reduceFn !== 'function') {
+                throw new TypeError(`reduceFn must be a Function! Received ${String(reduceFn)}`);
+            }
+            let accumulator = initialValue;
+            for (const element of this) {
+                accumulator = reduceFn.call(thisArg, accumulator, element, NaN, this);
+            }
+            return accumulator;
+        },
+        /**
+         * Tests whether at least one element in the set passes the test implemented
+         * by the provided function. The function is called with each element of the
+         * set. Note: Since sets do not have indices, the index parameter is always NaN.
+         *
+         * @param {Function} someFn - The function to test each element. It receives
+         * the element, index (always NaN), and the set itself.
+         * @param {Object} [thisArg] - Optional. Value to use as `this` when executing
+         * `someFn`.
+         * @throws {TypeError} If `someFn` is not a function.
+         * @returns {boolean} True if at least one element passes the test, false
+         * otherwise.
+         */
+        some(someFn, thisArg) {
+            if (typeof someFn !== 'function') {
+                throw new TypeError(`someFn must be a function! Received ${String(someFn)}`);
+            }
+            for (const element of this) {
+                if (someFn.call(thisArg, element, NaN, this)) {
+                    return true;
+                }
             }
-        }
-        return false;
+            return false;
+        },
     },
 });
 //# sourceMappingURL=setextensions.js.map

package/dist/mjs/setextensions.js.map

@@ -1 +1 @@
-{"version":3,"file":"setextensions.js","sourceRoot":"","sources":["../../src/setextensions.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE;IAC7D;;;;;;;OAOG;IACH,MAAM,CAAC,GAAG,SAAS;QACjB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IACE,OAAO,QAAQ,KAAK,QAAQ;gBAC5B,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,EACvC,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAClB,SAAQ;YACV,CAAC;YAED,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACH,QAAQ,CAAC,KAAK;QACZ,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,KAAK,IAAI,OAAO,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,OAAO,EAAE,OAAO;QACpB,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;YAClC,MAAM,IAAI,SAAS,CACjB,wCAAwC,MAAM,CAAC,OAAO,CAAC,EAAE,CAC1D,CAAA;QACH,CAAC;QAED,IAAI,KAAK,GAAG,CAAC,CAAA;QAEb,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC9C,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;QAED,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,CAAA;IAC9B,CAAC;IAGD;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,MAAM,EAAE,OAAO;QAClB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,SAAS,CACjB,uCAAuC,MAAM,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;QACH,CAAC;QAED,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;YACtD,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,OAAO,CAAA;YAChB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,MAAM,EAAE,OAAO;QACtB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,SAAS,CACjB,uCAAuC,MAAM,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;QACH,CAAC;QAED,MAAM,KAAK,GAAG,EAAE,CAAA;QAEhB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;YACtD,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACrB,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAChC,CAAC;QAED,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;;;OAKG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,GAAG,CAAC,KAAK,EAAE,OAAO;QAChB,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;YAChC,MAAM,IAAI,SAAS,CACjB,sCAAsC,MAAM,CAAC,KAAK,CAAC,EAAE,CACtD,CAAA;QACH,CAAC;QAED,MAAM,WAAW,GAAG,EAAE,CAAA;QAEtB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;QAC3D,CAAC;QAED,OAAO,WAAW,CAAA;IACpB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,QAAQ,EAAE,YAAY,EAAE,OAAO;QACpC,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE,CAAC;YACnC,MAAM,IAAI,SAAS,CACjB,yCAAyC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAC5D,CAAA;QACH,CAAC;QAED,IAAI,WAAW,GAAG,YAAY,CAAA;QAC9B,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;QACvE,CAAC;QAED,OAAO,WAAW,CAAA;IACpB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,MAAM,EAAE,OAAO;QAClB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,SAAS,CACjB,uCAAuC,MAAM,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;QACH,CAAC;QAED,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;CACF,CAAC,CAAA"}
+{"version":3,"file":"setextensions.js","sourceRoot":"","sources":["../../src/setextensions.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE;IAC7D,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE;QACtB;;;;;;;WAOG;QACH,MAAM,CAAC,GAAG,SAAS;YACjB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IACE,OAAO,QAAQ,KAAK,QAAQ;oBAC5B,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,EACvC,CAAC;oBACD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;oBAClB,SAAQ;gBACV,CAAC;gBAED,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;oBAC/B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QAED;;;;;;;;;WASG;QACH,QAAQ,CAAC,KAAK;YACZ,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,IAAI,KAAK,IAAI,OAAO,EAAE,CAAC;oBACrB,OAAO,IAAI,CAAA;gBACb,CAAC;YACH,CAAC;YAED,OAAO,KAAK,CAAA;QACd,CAAC;QAED;;;;;;;;;;;WAWG;QACH,KAAK,CAAC,OAAO,EAAE,OAAO;YACpB,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;gBAClC,MAAM,IAAI,SAAS,CACjB,wCAAwC,MAAM,CAAC,OAAO,CAAC,EAAE,CAC1D,CAAA;YACH,CAAC;YAED,IAAI,KAAK,GAAG,CAAC,CAAA;YAEb,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC9C,KAAK,EAAE,CAAA;gBACT,CAAC;YACH,CAAC;YAED,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;QAGD;;;;;;;;;;;;WAYG;QACH,IAAI,CAAC,MAAM,EAAE,OAAO;YAClB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;gBACjC,MAAM,IAAI,SAAS,CACjB,uCAAuC,MAAM,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;YACH,CAAC;YAED,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;gBACtD,IAAI,KAAK,EAAE,CAAC;oBACV,OAAO,OAAO,CAAA;gBAChB,CAAC;YACH,CAAC;YAED,OAAO,SAAS,CAAA;QAClB,CAAC;QAED;;;;;;;;;;;;WAYG;QACH,QAAQ,CAAC,MAAM,EAAE,OAAO;YACtB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;gBACjC,MAAM,IAAI,SAAS,CACjB,uCAAuC,MAAM,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;YACH,CAAC;YAED,MAAM,KAAK,GAAG,EAAE,CAAA;YAEhB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;gBACtD,IAAI,KAAK,EAAE,CAAC;oBACV,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBACrB,CAAC;YACH,CAAC;YAED,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAChC,CAAC;YAED,OAAO,SAAS,CAAA;QAClB,CAAC;QAED;;;;;WAKG;QACH,IAAI,MAAM;YACR,OAAO,IAAI,CAAC,IAAI,CAAA;QAClB,CAAC;QAED;;;;;;;;;;;;;WAaG;QACH,GAAG,CAAC,KAAK,EAAE,OAAO;YAChB,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;gBAChC,MAAM,IAAI,SAAS,CACjB,sCAAsC,MAAM,CAAC,KAAK,CAAC,EAAE,CACtD,CAAA;YACH,CAAC;YAED,MAAM,WAAW,GAAG,EAAE,CAAA;YAEtB,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;YAC3D,CAAC;YAED,OAAO,WAAW,CAAA;QACpB,CAAC;QAED;;;;;;;;;;;;;WAaG;QACH,MAAM,CAAC,QAAQ,EAAE,YAAY,EAAE,OAAO;YACpC,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE,CAAC;gBACnC,MAAM,IAAI,SAAS,CACjB,yCAAyC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAC5D,CAAA;YACH,CAAC;YAED,IAAI,WAAW,GAAG,YAAY,CAAA;YAC9B,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAA;YACvE,CAAC;YAED,OAAO,WAAW,CAAA;QACpB,CAAC;QAED;;;;;;;;;;;;WAYG;QACH,IAAI,CAAC,MAAM,EAAE,OAAO;YAClB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;gBACjC,MAAM,IAAI,SAAS,CACjB,uCAAuC,MAAM,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;YACH,CAAC;YAED,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC7C,OAAO,IAAI,CAAA;gBACb,CAAC;YACH,CAAC;YAED,OAAO,KAAK,CAAA;QACd,CAAC;KACF;CACF,CAAC,CAAA"}

package/dist/mjs/stringextensions.js

@@ -79,75 +79,77 @@ export const StringExtensions = new Patch(String, {
  * making string manipulation tasks more convenient and expressive.
  */
 export const StringPrototypeExtensions = new Patch(String.prototype, {
-    /**
-     * Extracts a substring from the current string, starting at a given offset
-     * and bounded by specified opening and closing tokens. This method is
-     * particularly useful for parsing nested structures or quoted strings,
-     * where the level of nesting or the presence of escape characters must
-     * be considered.
-     *
-     * @param {number} offset The position in the string from which to start the
-     * search for the substring.
-     * @param {[string, string]} tokens An array containing two strings: the
-     * opening and closing tokens that define the boundaries of the substring
-     * to be extracted.
-     * @returns {Object} An object with two properties: `extracted`, the
-     * extracted substring, and `newOffset`, the position in the original
-     * string immediately after the end of the extracted substring. If no
-     * substring is found, `extracted` is `null` and `newOffset` is the same
-     * as the input offset.
-     */
-    extractSubstring(offset = 0, tokens = parenthesisPair) {
-        let [openToken, closeToken] = tokens;
-        let depth = 0;
-        let start = -1;
-        let end = -1;
-        let leadingToken = '';
-        let firstToken = 0;
-        for (let i = offset; i < this.length; i++) {
-            const char = this[i];
-            if (char === openToken) {
-                depth++;
-                if (start === -1)
-                    start = i;
-            }
-            else if (char === closeToken) {
-                depth--;
-                if (depth === 0) {
-                    end = i;
-                    break;
+    [Patch.kMutablyHidden]: {
+        /**
+         * Extracts a substring from the current string, starting at a given offset
+         * and bounded by specified opening and closing tokens. This method is
+         * particularly useful for parsing nested structures or quoted strings,
+         * where the level of nesting or the presence of escape characters must
+         * be considered.
+         *
+         * @param {number} offset The position in the string from which to start the
+         * search for the substring.
+         * @param {[string, string]} tokens An array containing two strings: the
+         * opening and closing tokens that define the boundaries of the substring
+         * to be extracted.
+         * @returns {Object} An object with two properties: `extracted`, the
+         * extracted substring, and `newOffset`, the position in the original
+         * string immediately after the end of the extracted substring. If no
+         * substring is found, `extracted` is `null` and `newOffset` is the same
+         * as the input offset.
+         */
+        extractSubstring(offset = 0, tokens = parenthesisPair) {
+            let [openToken, closeToken] = tokens;
+            let depth = 0;
+            let start = -1;
+            let end = -1;
+            let leadingToken = '';
+            let firstToken = 0;
+            for (let i = offset; i < this.length; i++) {
+                const char = this[i];
+                if (char === openToken) {
+                    depth++;
+                    if (start === -1)
+                        start = i;
+                }
+                else if (char === closeToken) {
+                    depth--;
+                    if (depth === 0) {
+                        end = i;
+                        break;
+                    }
                 }
             }
-        }
-        let lRange = [
-            Math.max(0, start - 100),
-            start
-        ];
-        let leading = [...this.substring(lRange[0], lRange[1])].reverse().join('');
-        let reversedLeadingToken;
-        try {
-            reversedLeadingToken = /([^ \,\"\'\`]+)/.exec(leading)[1] ?? '';
-            leadingToken = [...reversedLeadingToken].reverse().join('');
-        }
-        catch (ignored) { }
-        if (start !== -1 && end !== -1) {
-            const sliceRange = [start, end + 1];
-            const extracted = this.slice(sliceRange[0], sliceRange[1]);
-            return {
-                extracted,
-                range: [start, end],
-                newOffset: end + 1,
-                leadingToken,
-            };
-        }
-        else {
-            return {
-                extracted: null,
-                range: [start, end],
-                newOffset: offset,
-                leadingToken,
-            };
-        }
+            let lRange = [
+                Math.max(0, start - 100),
+                start
+            ];
+            let leading = [...this.substring(lRange[0], lRange[1])].reverse().join('');
+            let reversedLeadingToken;
+            try {
+                reversedLeadingToken = /([^ \,\"\'\`]+)/.exec(leading)[1] ?? '';
+                leadingToken = [...reversedLeadingToken].reverse().join('');
+            }
+            catch (ignored) { }
+            if (start !== -1 && end !== -1) {
+                const sliceRange = [start, end + 1];
+                const extracted = this.slice(sliceRange[0], sliceRange[1]);
+                return {
+                    extracted,
+                    range: [start, end],
+                    newOffset: end + 1,
+                    leadingToken,
+                };
+            }
+            else {
+                return {
+                    extracted: null,
+                    range: [start, end],
+                    newOffset: offset,
+                    leadingToken,
+                };
+            }
+        },
     },
 });
 //# sourceMappingURL=stringextensions.js.map

package/dist/mjs/stringextensions.js.map

@@ -1 +1 @@
-{"version":3,"file":"stringextensions.js","sourceRoot":"","sources":["../../src/stringextensions.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAEnC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,KAAK,CAAC,MAAM,EAAE;IAChD;;;;;;OAMG;IACH,QAAQ,CAAC,KAAK;QACZ,IAAI,KAAK,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,YAAY,MAAM,CAAC,EAAE,CAAC;YACpE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QACzB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,eAAe;QACjB,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAI,kBAAkB;QACpB,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,iBAAiB;QACnB,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;CACF,CAAC,CAAC;AAEH;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE;IACnE;;;;;;;;;;;;;;;;;OAiBG;IACH,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,eAAe;QACnD,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,MAAM,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QACf,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QACb,IAAI,YAAY,GAAG,EAAE,CAAC;QACtB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAErB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,KAAK,EAAE,CAAC;gBACR,IAAI,KAAK,KAAK,CAAC,CAAC;oBACd,KAAK,GAAG,CAAC,CAAC;YACd,CAAC;iBACI,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC7B,KAAK,EAAE,CAAC;gBACR,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;oBAChB,GAAG,GAAG,CAAC,CAAC;oBACR,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,GAAG;YACX,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC;YACxB,KAAK;SACN,CAAC;QACF,IAAI,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1E,IAAI,oBAAoB,CAAC;QAEzB,IAAI,CAAC;YACH,oBAAoB,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAChE,YAAY,GAAG,CAAC,GAAG,oBAAoB,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,OAAM,OAAO,EAAE,CAAC,CAAC,CAAC;QAElB,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAE3D,OAAO;gBACL,SAAS;gBACT,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;gBACnB,SAAS,EAAE,GAAG,GAAG,CAAC;gBAClB,YAAY;aACb,CAAC;QACJ,CAAC;aACI,CAAC;YACJ,OAAO;gBACL,SAAS,EAAE,IAAI;gBACf,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;gBACnB,SAAS,EAAE,MAAM;gBACjB,YAAY;aACb,CAAC;QACJ,CAAC;IACH,CAAC;CACF,CAAC,CAAA"}
+{"version":3,"file":"stringextensions.js","sourceRoot":"","sources":["../../src/stringextensions.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAEnC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,KAAK,CAAC,MAAM,EAAE;IAChD;;;;;;OAMG;IACH,QAAQ,CAAC,KAAK;QACZ,IAAI,KAAK,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,YAAY,MAAM,CAAC,EAAE,CAAC;YACpE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QACzB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,eAAe;QACjB,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAI,kBAAkB;QACpB,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAI,iBAAiB;QACnB,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;CACF,CAAC,CAAC;AAEH;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE;IACnE,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE;QACtB;;;;;;;;;;;;;;;;;WAiBG;QACH,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,eAAe;YACnD,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,MAAM,CAAC;YACrC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;YACb,IAAI,YAAY,GAAG,EAAE,CAAC;YACtB,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAErB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,KAAK,EAAE,CAAC;oBACR,IAAI,KAAK,KAAK,CAAC,CAAC;wBACd,KAAK,GAAG,CAAC,CAAC;gBACd,CAAC;qBACI,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;oBAC7B,KAAK,EAAE,CAAC;oBACR,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;wBAChB,GAAG,GAAG,CAAC,CAAC;wBACR,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,MAAM,GAAG;gBACX,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC;gBACxB,KAAK;aACN,CAAC;YACF,IAAI,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC1E,IAAI,oBAAoB,CAAC;YAEzB,IAAI,CAAC;gBACH,oBAAoB,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChE,YAAY,GAAG,CAAC,GAAG,oBAAoB,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9D,CAAC;YACD,OAAM,OAAO,EAAE,CAAC,CAAC,CAAC;YAElB,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC/B,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBACpC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE3D,OAAO;oBACL,SAAS;oBACT,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;oBACnB,SAAS,EAAE,GAAG,GAAG,CAAC;oBAClB,YAAY;iBACb,CAAC;YACJ,CAAC;iBACI,CAAC;gBACJ,OAAO;oBACL,SAAS,EAAE,IAAI;oBACf,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC;oBACnB,SAAS,EAAE,MAAM;oBACjB,YAAY;iBACb,CAAC;YACJ,CAAC;QACH,CAAC;KACF;CACF,CAAC,CAAA"}