@develia/commons 0.4.15 → 0.4.16

package/dist/cjs/array.js

@@ -4,6 +4,7 @@ exports.pull = pull;
 exports.chunk = chunk;
 exports.clear = clear;
 exports.remove = remove;
+exports.pushIfAbsent = pushIfAbsent;
 /**
  * Removes all given values from the provided array and returns the number of removed elements.
  * The operation mutates the original array.
@@ -67,4 +68,19 @@ function remove(array, predicate) {
     }
     return removed;
 }
+/**
+ * Adds an element to the array if it's not already present.
+ * The operation mutates the original array.
+ * @template T
+ * @param {Array<T>} array - The array to modify.
+ * @param {T} element - The element to add if absent.
+ * @return {boolean} True if the element was added, false otherwise.
+ */
+function pushIfAbsent(array, element) {
+    if (!array.includes(element)) {
+        array.push(element);
+        return true;
+    }
+    return false;
+}
 //# sourceMappingURL=array.js.map

package/dist/cjs/array.js.map

@@ -1 +1 @@
-{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":";;AAUA,oBAWC;AASD,sBAOC;AAOD,sBAEC;AAQD,wBAcC;AAlED;;;;;;;GAOG;AACH,SAAgB,IAAI,CAAI,KAAe,EAAE,GAAG,KAAe;IAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,KAAK,CAAI,KAAe,EAAE,IAAY;IAClD,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,SAAgB,KAAK,CAAI,KAAe;IACpC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,KAAe,EAAC,SAAuB;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;QACxC,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC","sourcesContent":["import type {Predicate} from \"./types.js\";\r\n\r\n/**\r\n * Removes all given values from the provided array and returns the number of removed elements.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify by removing specified items.\r\n * @param {...T} items - The values to remove from the array.\r\n * @return {number} The number of elements removed from the array.\r\n */\r\nexport function pull<T>(array: Array<T>, ...items: Array<T>): number {\r\n\r\n    let output = 0;\r\n    for (const item of items) {\r\n        const index = array.indexOf(item);\r\n        if (index !== -1) {\r\n            array.splice(index, 1);\r\n            output++;\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of a given size.\r\n * @template T\r\n * @param {Array<T>} array - The array to split.\r\n * @param {number} size - The size of each chunk.\r\n * @return {Array<Array<T>>} The array of chunks.\r\n */\r\nexport function chunk<T>(array: Array<T>, size: number): Array<Array<T>> {\r\n    if (size <= 0) throw new Error(\"Size must be greater than 0\");\r\n    const result: Array<Array<T>> = [];\r\n    for (let i = 0; i < array.length; i += size) {\r\n        result.push(array.slice(i, i + size));\r\n    }\r\n    return result;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array, mutating it.\r\n * @template T\r\n * @param {Array<T>} array - The array to clear.\r\n */\r\nexport function clear<T>(array: Array<T>): void {\r\n    array.length = 0;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array that satisfy the predicate.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @return {Array<T>} An array of removed elements.\r\n */\r\nexport function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {\r\n    const removed: Array<T> = [];\r\n    let i = 0;\r\n\r\n    while (i < array.length) {\r\n        if (predicate(array[i])) {\r\n            removed.push(array[i]);\r\n            array.splice(i, 1); // muta el array\r\n        } else {\r\n            i++;\r\n        }\r\n    }\r\n\r\n    return removed;\r\n}"]}
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":";;AAUA,oBAWC;AASD,sBAOC;AAOD,sBAEC;AAQD,wBAcC;AAUD,oCAMC;AAlFD;;;;;;;GAOG;AACH,SAAgB,IAAI,CAAI,KAAe,EAAE,GAAG,KAAe;IAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,KAAK,CAAI,KAAe,EAAE,IAAY;IAClD,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,SAAgB,KAAK,CAAI,KAAe;IACpC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,KAAe,EAAC,SAAuB;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;QACxC,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAI,KAAe,EAAE,OAAU;IACvD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC","sourcesContent":["import type {Predicate} from \"./types.js\";\r\n\r\n/**\r\n * Removes all given values from the provided array and returns the number of removed elements.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify by removing specified items.\r\n * @param {...T} items - The values to remove from the array.\r\n * @return {number} The number of elements removed from the array.\r\n */\r\nexport function pull<T>(array: Array<T>, ...items: Array<T>): number {\r\n\r\n    let output = 0;\r\n    for (const item of items) {\r\n        const index = array.indexOf(item);\r\n        if (index !== -1) {\r\n            array.splice(index, 1);\r\n            output++;\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of a given size.\r\n * @template T\r\n * @param {Array<T>} array - The array to split.\r\n * @param {number} size - The size of each chunk.\r\n * @return {Array<Array<T>>} The array of chunks.\r\n */\r\nexport function chunk<T>(array: Array<T>, size: number): Array<Array<T>> {\r\n    if (size <= 0) throw new Error(\"Size must be greater than 0\");\r\n    const result: Array<Array<T>> = [];\r\n    for (let i = 0; i < array.length; i += size) {\r\n        result.push(array.slice(i, i + size));\r\n    }\r\n    return result;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array, mutating it.\r\n * @template T\r\n * @param {Array<T>} array - The array to clear.\r\n */\r\nexport function clear<T>(array: Array<T>): void {\r\n    array.length = 0;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array that satisfy the predicate.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @return {Array<T>} An array of removed elements.\r\n */\r\nexport function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {\r\n    const removed: Array<T> = [];\r\n    let i = 0;\r\n\r\n    while (i < array.length) {\r\n        if (predicate(array[i])) {\r\n            removed.push(array[i]);\r\n            array.splice(i, 1); // muta el array\r\n        } else {\r\n            i++;\r\n        }\r\n    }\r\n\r\n    return removed;\r\n}\r\n\r\n/**\r\n * Adds an element to the array if it's not already present.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify.\r\n * @param {T} element - The element to add if absent.\r\n * @return {boolean} True if the element was added, false otherwise.\r\n */\r\nexport function pushIfAbsent<T>(array: Array<T>, element: T): boolean {\r\n    if (!array.includes(element)) {\r\n        array.push(element);\r\n        return true;\r\n    }\r\n    return false;\r\n}"]}

package/dist/cjs/index.js

@@ -18,7 +18,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.formToObject = exports.submitForm = exports.ajaxSubmission = exports.ajaxSubmit = exports.CleanURLSearchParams = exports.draft = exports.Event = exports.EventBus = exports.from = exports.Lazy = exports.AsyncPoolExecutor = exports.Stopwatch = exports.TimeSpan = exports.Timer = exports.Order = exports.KeyValuePair = exports.CancellablePromise = exports.TypeCode = exports.Type = void 0;
+exports.formToObject = exports.submitForm = exports.ajaxSubmission = exports.ajaxSubmit = exports.CleanURLSearchParams = exports.draft = exports.Range = exports.Event = exports.EventBus = exports.from = exports.Lazy = exports.AsyncPoolExecutor = exports.Stopwatch = exports.TimeSpan = exports.Timer = exports.Order = exports.KeyValuePair = exports.CancellablePromise = exports.TypeCode = exports.Type = void 0;
 // ─── Types ───────────────────────────────────────────
 __exportStar(require("./types.js"), exports);
 var type_js_1 = require("./type.js");
@@ -53,6 +53,8 @@ Object.defineProperty(exports, "from", { enumerable: true, get: function () { re
 var event_bus_js_1 = require("./event-bus.js");
 Object.defineProperty(exports, "EventBus", { enumerable: true, get: function () { return event_bus_js_1.EventBus; } });
 Object.defineProperty(exports, "Event", { enumerable: true, get: function () { return event_bus_js_1.Event; } });
+var range_js_1 = require("./range.js");
+Object.defineProperty(exports, "Range", { enumerable: true, get: function () { return __importDefault(range_js_1).default; } });
 // ─── Draft ────────────────────────────────────────
 var draft_js_1 = require("./draft.js");
 Object.defineProperty(exports, "draft", { enumerable: true, get: function () { return __importDefault(draft_js_1).default; } });

package/dist/cjs/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";AAAA,eAAe;;;;;;;;;;;;;;;;;;;;AAEf,wDAAwD;AACxD,6CAA2B;AAC3B,qCAA0C;AAAlC,gHAAA,OAAO,OAAQ;AACvB,+CAAmD;AAA3C,yHAAA,OAAO,OAAY;AAE3B,wDAAwD;AACxD,iDAA+B;AAC/B,8CAA4B;AAC5B,4CAA0B;AAC1B,mEAAuE;AAA/D,6IAAA,OAAO,OAAsB;AAErC,uDAAuD;AACvD,yDAA4D;AAApD,kIAAA,OAAO,OAAgB;AAC/B,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AAExB,uDAAuD;AACvD,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AACxB,6CAAkD;AAA1C,wHAAA,OAAO,OAAY;AAC3B,+CAAoD;AAA5C,0HAAA,OAAO,OAAa;AAC5B,mEAAsE;AAA9D,4IAAA,OAAO,OAAqB;AAEpC,wDAAwD;AACxD,qCAA0C;AAAlC,gHAAA,OAAO,OAAQ;AACvB,iDAAsD;AAA9C,gHAAA,OAAO,OAAQ;AACvB,+CAA+C;AAAvC,wGAAA,QAAQ,OAAA;AAAE,qGAAA,KAAK,OAAA;AAEvB,qDAAqD;AACrD,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AAExB,wDAAwD;AACxD,2EAA6E;AAArE,mJAAA,OAAO,OAAwB;AACvC,mBAAmB;AACnB,+CAAwF;AAAhF,sGAAA,UAAU,OAAA;AAAE,0GAAA,cAAc,OAAA;AAAE,sGAAA,UAAU,OAAA;AAAE,wGAAA,YAAY,OAAA;AAI5D,wDAAwD;AACxD,mBAAmB;AACnB,6CAA2B;AAC3B,mBAAmB;AACnB,yDAAuC","sourcesContent":["// src/index.ts\r\n\r\n// ─── Types ───────────────────────────────────────────\r\nexport * from './types.js';\r\nexport {default as Type} from './type.js';\r\nexport {default as TypeCode} from './type-code.js';\r\n\r\n// ─── Utilities ───────────────────────────────────────\r\nexport * from './utilities.js';\r\nexport * from './string.js';\r\nexport * from './math.js';\r\nexport {default as CancellablePromise} from \"./cancellable-promise.js\";\r\n\r\n// ─── Data Structures ────────────────────────────────\r\nexport {default as KeyValuePair} from './key-value-pair.js';\r\nexport {default as Order} from './order.js';\r\n\r\n// ─── Async & Timing ─────────────────────────────────\r\nexport {default as Timer} from './timer.js';\r\nexport {default as TimeSpan} from './timespan.js';\r\nexport {default as Stopwatch} from './stopwatch.js';\r\nexport {default as AsyncPoolExecutor} from './async-pool-executor.js';\r\n\r\n// ─── Patterns ────────────────────────────────────────\r\nexport {default as Lazy} from './lazy.js';\r\nexport {default as from} from './collections/from.js';\r\nexport {EventBus, Event} from './event-bus.js';\r\n\r\n// ─── Draft ────────────────────────────────────────\r\nexport {default as draft} from './draft.js';\r\n\r\n// ─── Web ─────────────────────────────────────────────\r\nexport {default as CleanURLSearchParams} from './clean-url-search-params.js';\r\n/** @deprecated  */\r\nexport {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';\r\n\r\n\r\n\r\n// ─── Deprecated ──────────────────────────────────────\r\n/** @deprecated  */\r\nexport * from './array.js';\r\n/** @deprecated  */\r\nexport * from './collections/index.js';"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";AAAA,eAAe;;;;;;;;;;;;;;;;;;;;AAEf,wDAAwD;AACxD,6CAA2B;AAC3B,qCAA0C;AAAlC,gHAAA,OAAO,OAAQ;AACvB,+CAAmD;AAA3C,yHAAA,OAAO,OAAY;AAE3B,wDAAwD;AACxD,iDAA+B;AAC/B,8CAA4B;AAC5B,4CAA0B;AAC1B,mEAAuE;AAA/D,6IAAA,OAAO,OAAsB;AAErC,uDAAuD;AACvD,yDAA4D;AAApD,kIAAA,OAAO,OAAgB;AAC/B,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AAExB,uDAAuD;AACvD,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AACxB,6CAAkD;AAA1C,wHAAA,OAAO,OAAY;AAC3B,+CAAoD;AAA5C,0HAAA,OAAO,OAAa;AAC5B,mEAAsE;AAA9D,4IAAA,OAAO,OAAqB;AAEpC,wDAAwD;AACxD,qCAA0C;AAAlC,gHAAA,OAAO,OAAQ;AACvB,iDAAsD;AAA9C,gHAAA,OAAO,OAAQ;AACvB,+CAA+C;AAAvC,wGAAA,QAAQ,OAAA;AAAE,qGAAA,KAAK,OAAA;AACvB,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AAExB,qDAAqD;AACrD,uCAA4C;AAApC,kHAAA,OAAO,OAAS;AAExB,wDAAwD;AACxD,2EAA6E;AAArE,mJAAA,OAAO,OAAwB;AACvC,mBAAmB;AACnB,+CAAwF;AAAhF,sGAAA,UAAU,OAAA;AAAE,0GAAA,cAAc,OAAA;AAAE,sGAAA,UAAU,OAAA;AAAE,wGAAA,YAAY,OAAA;AAI5D,wDAAwD;AACxD,mBAAmB;AACnB,6CAA2B;AAC3B,mBAAmB;AACnB,yDAAuC","sourcesContent":["// src/index.ts\n\n// ─── Types ───────────────────────────────────────────\nexport * from './types.js';\nexport {default as Type} from './type.js';\nexport {default as TypeCode} from './type-code.js';\n\n// ─── Utilities ───────────────────────────────────────\nexport * from './utilities.js';\nexport * from './string.js';\nexport * from './math.js';\nexport {default as CancellablePromise} from \"./cancellable-promise.js\";\n\n// ─── Data Structures ────────────────────────────────\nexport {default as KeyValuePair} from './key-value-pair.js';\nexport {default as Order} from './order.js';\n\n// ─── Async & Timing ─────────────────────────────────\nexport {default as Timer} from './timer.js';\nexport {default as TimeSpan} from './timespan.js';\nexport {default as Stopwatch} from './stopwatch.js';\nexport {default as AsyncPoolExecutor} from './async-pool-executor.js';\n\n// ─── Patterns ────────────────────────────────────────\nexport {default as Lazy} from './lazy.js';\nexport {default as from} from './collections/from.js';\nexport {EventBus, Event} from './event-bus.js';\nexport {default as Range} from './range.js';\n\n// ─── Draft ────────────────────────────────────────\nexport {default as draft} from './draft.js';\n\n// ─── Web ─────────────────────────────────────────────\nexport {default as CleanURLSearchParams} from './clean-url-search-params.js';\n/** @deprecated  */\nexport {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';\n\n\n\n// ─── Deprecated ──────────────────────────────────────\n/** @deprecated  */\nexport * from './array.js';\n/** @deprecated  */\nexport * from './collections/index.js';"]}

package/dist/cjs/range.js

@@ -0,0 +1,154 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+class Range {
+    /**
+     * Range constructor.
+     * @param start
+     * @param end
+     */
+    constructor(start, end) {
+        this.start = start;
+        this.end = end;
+    }
+    /**
+     * Finds the intersection between two ranges.
+     *
+     * @param other The Range object to intersect with.
+     * @returns The intersected Range object, or null if there is no intersection.
+     */
+    intersect(other) {
+        const start = (this.start > other.start) ? this.start : other.start;
+        const end = (this.end < other.end) ? this.end : other.end;
+        if (start < end) {
+            return new Range(start, end);
+        }
+        else {
+            return null;
+        }
+    }
+    /**
+     * Subtract the given range from this range.
+     *
+     * @param other The range to subtract from this range.
+     * @returns An array of Range objects representing the result of the subtraction.
+     */
+    subtract(other) {
+        const result = [];
+        if (this.start >= other.end || this.end <= other.start) {
+            result.push(new Range(this.start, this.end));
+        }
+        else if (other.start <= this.start && other.end >= this.end) {
+            return result;
+        }
+        else {
+            if (this.start < other.start) {
+                result.push(new Range(this.start, other.start));
+            }
+            if (this.end > other.end) {
+                result.push(new Range(other.end, this.end));
+            }
+        }
+        return result;
+    }
+    /**
+     * Determines if the given range overlaps with the current range.
+     *
+     * @param other The range to be checked for overlap.
+     * @returns Returns true if there is an overlap between the ranges, false otherwise.
+     */
+    overlaps(other) {
+        const s1 = this.start;
+        const e1 = this.end;
+        const s2 = other.start;
+        const e2 = other.end;
+        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||
+            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||
+            (s1 === s2 && e1 === e2);
+    }
+    /**
+     * Determines whether the specified value is within the range defined by the start and end values.
+     *
+     * @param obj The value to check if it is within the range.
+     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.
+     * @returns Returns true if the specified value is within the range, false otherwise.
+     */
+    contains(obj, inclusive = true) {
+        return inclusive ?
+            (this.start <= obj && this.end >= obj) :
+            (this.start < obj && this.end > obj);
+    }
+    /**
+     * @returns T
+     */
+    getStart() {
+        return this.start;
+    }
+    /**
+     * @returns T
+     */
+    getEnd() {
+        return this.end;
+    }
+    /**
+     * Finds the intersection between two sets of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static intersectRanges(ranges1, ranges2) {
+        const result = [];
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                const intersection = r1.intersect(r2);
+                if (intersection !== null) {
+                    result.push(intersection);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Determines if any range in the first set overlaps with any range in the second set.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static overlapsAny(ranges1, ranges2) {
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                if (r1.overlaps(r2)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Subtracts the second set of ranges from the first set of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static subtractRanges(ranges1, ranges2) {
+        let currentRanges = ranges1;
+        for (const r2 of ranges2) {
+            const nextRanges = [];
+            for (const r1 of currentRanges) {
+                const subtracted = r1.subtract(r2);
+                for (const s of subtracted) {
+                    nextRanges.push(s);
+                }
+            }
+            currentRanges = nextRanges;
+            if (currentRanges.length === 0) {
+                break;
+            }
+        }
+        return currentRanges;
+    }
+}
+exports.default = Range;
+//# sourceMappingURL=range.js.map

package/dist/cjs/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/range.ts"],"names":[],"mappings":";;AAAA,MAAqB,KAAK;IAKtB;;;;OAIG;IACH,YAAY,KAAQ,EAAE,GAAM;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,KAAe;QAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;QACpE,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAE1D,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;YACd,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAe;QAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5D,OAAO,MAAM,CAAC;QAClB,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpD,CAAC;YAED,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAe;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC;QAErB,OAAO,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC7C,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC1C,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACI,QAAQ,CAAC,GAAM,EAAE,YAAqB,IAAI;QAC7C,OAAO,SAAS,CAAC,CAAC;YACd,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACI,QAAQ;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,MAAM;QACT,OAAO,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,eAAe,CAAI,OAAmB,EAAE,OAAmB;QACrE,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvB,MAAM,YAAY,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,WAAW,CAAI,OAAmB,EAAE,OAAmB;QACjE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvB,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAClB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,cAAc,CAAI,OAAmB,EAAE,OAAmB;QACpE,IAAI,aAAa,GAAG,OAAO,CAAC;QAC5B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACnC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBACzB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACL,CAAC;YACD,aAAa,GAAG,UAAU,CAAC;YAC3B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,aAAa,CAAC;IACzB,CAAC;CACJ;AApKD,wBAoKC","sourcesContent":["export default class Range<T> {\n\n    private readonly start: T;\n    private readonly end: T;\n\n    /**\n     * Range constructor.\n     * @param start\n     * @param end\n     */\n    constructor(start: T, end: T) {\n        this.start = start;\n        this.end = end;\n    }\n\n    /**\n     * Finds the intersection between two ranges.\n     *\n     * @param other The Range object to intersect with.\n     * @returns The intersected Range object, or null if there is no intersection.\n     */\n    public intersect(other: Range<T>): Range<T> | null {\n        const start = (this.start > other.start) ? this.start : other.start;\n        const end = (this.end < other.end) ? this.end : other.end;\n\n        if (start < end) {\n            return new Range(start, end);\n        } else {\n            return null;\n        }\n    }\n\n    /**\n     * Subtract the given range from this range.\n     *\n     * @param other The range to subtract from this range.\n     * @returns An array of Range objects representing the result of the subtraction.\n     */\n    public subtract(other: Range<T>): Range<T>[] {\n        const result: Range<T>[] = [];\n\n        if (this.start >= other.end || this.end <= other.start) {\n            result.push(new Range(this.start, this.end));\n        } else if (other.start <= this.start && other.end >= this.end) {\n            return result;\n        } else {\n            if (this.start < other.start) {\n                result.push(new Range(this.start, other.start));\n            }\n\n            if (this.end > other.end) {\n                result.push(new Range(other.end, this.end));\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Determines if the given range overlaps with the current range.\n     *\n     * @param other The range to be checked for overlap.\n     * @returns Returns true if there is an overlap between the ranges, false otherwise.\n     */\n    public overlaps(other: Range<T>): boolean {\n        const s1 = this.start;\n        const e1 = this.end;\n        const s2 = other.start;\n        const e2 = other.end;\n\n        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||\n            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||\n            (s1 === s2 && e1 === e2);\n    }\n\n    /**\n     * Determines whether the specified value is within the range defined by the start and end values.\n     *\n     * @param obj The value to check if it is within the range.\n     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.\n     * @returns Returns true if the specified value is within the range, false otherwise.\n     */\n    public contains(obj: T, inclusive: boolean = true): boolean {\n        return inclusive ?\n            (this.start <= obj && this.end >= obj) :\n            (this.start < obj && this.end > obj);\n    }\n\n    /**\n     * @returns T\n     */\n    public getStart(): T {\n        return this.start;\n    }\n\n    /**\n     * @returns T\n     */\n    public getEnd(): T {\n        return this.end;\n    }\n\n    /**\n     * Finds the intersection between two sets of ranges.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static intersectRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {\n        const result: Range<T>[] = [];\n        for (const r1 of ranges1) {\n            for (const r2 of ranges2) {\n                const intersection = r1.intersect(r2);\n                if (intersection !== null) {\n                    result.push(intersection);\n                }\n            }\n        }\n        return result;\n    }\n\n    /**\n     * Determines if any range in the first set overlaps with any range in the second set.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static overlapsAny<T>(ranges1: Range<T>[], ranges2: Range<T>[]): boolean {\n        for (const r1 of ranges1) {\n            for (const r2 of ranges2) {\n                if (r1.overlaps(r2)) {\n                    return true;\n                }\n            }\n        }\n        return false;\n    }\n\n    /**\n     * Subtracts the second set of ranges from the first set of ranges.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static subtractRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {\n        let currentRanges = ranges1;\n        for (const r2 of ranges2) {\n            const nextRanges: Range<T>[] = [];\n            for (const r1 of currentRanges) {\n                const subtracted = r1.subtract(r2);\n                for (const s of subtracted) {\n                    nextRanges.push(s);\n                }\n            }\n            currentRanges = nextRanges;\n            if (currentRanges.length === 0) {\n                break;\n            }\n        }\n        return currentRanges;\n    }\n}\n"]}

package/dist/esm/array.js

@@ -61,4 +61,19 @@ export function remove(array, predicate) {
     }
     return removed;
 }
+/**
+ * Adds an element to the array if it's not already present.
+ * The operation mutates the original array.
+ * @template T
+ * @param {Array<T>} array - The array to modify.
+ * @param {T} element - The element to add if absent.
+ * @return {boolean} True if the element was added, false otherwise.
+ */
+export function pushIfAbsent(array, element) {
+    if (!array.includes(element)) {
+        array.push(element);
+        return true;
+    }
+    return false;
+}
 //# sourceMappingURL=array.js.map

package/dist/esm/array.js.map

@@ -1 +1 @@
-{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe,EAAE,GAAG,KAAe;IAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe,EAAE,IAAY;IAClD,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe;IACpC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAC,SAAuB;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;QACxC,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC","sourcesContent":["import type {Predicate} from \"./types.js\";\r\n\r\n/**\r\n * Removes all given values from the provided array and returns the number of removed elements.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify by removing specified items.\r\n * @param {...T} items - The values to remove from the array.\r\n * @return {number} The number of elements removed from the array.\r\n */\r\nexport function pull<T>(array: Array<T>, ...items: Array<T>): number {\r\n\r\n    let output = 0;\r\n    for (const item of items) {\r\n        const index = array.indexOf(item);\r\n        if (index !== -1) {\r\n            array.splice(index, 1);\r\n            output++;\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of a given size.\r\n * @template T\r\n * @param {Array<T>} array - The array to split.\r\n * @param {number} size - The size of each chunk.\r\n * @return {Array<Array<T>>} The array of chunks.\r\n */\r\nexport function chunk<T>(array: Array<T>, size: number): Array<Array<T>> {\r\n    if (size <= 0) throw new Error(\"Size must be greater than 0\");\r\n    const result: Array<Array<T>> = [];\r\n    for (let i = 0; i < array.length; i += size) {\r\n        result.push(array.slice(i, i + size));\r\n    }\r\n    return result;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array, mutating it.\r\n * @template T\r\n * @param {Array<T>} array - The array to clear.\r\n */\r\nexport function clear<T>(array: Array<T>): void {\r\n    array.length = 0;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array that satisfy the predicate.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @return {Array<T>} An array of removed elements.\r\n */\r\nexport function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {\r\n    const removed: Array<T> = [];\r\n    let i = 0;\r\n\r\n    while (i < array.length) {\r\n        if (predicate(array[i])) {\r\n            removed.push(array[i]);\r\n            array.splice(i, 1); // muta el array\r\n        } else {\r\n            i++;\r\n        }\r\n    }\r\n\r\n    return removed;\r\n}"]}
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe,EAAE,GAAG,KAAe;IAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe,EAAE,IAAY;IAClD,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe;IACpC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAC,SAAuB;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;QACxC,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAI,KAAe,EAAE,OAAU;IACvD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC","sourcesContent":["import type {Predicate} from \"./types.js\";\r\n\r\n/**\r\n * Removes all given values from the provided array and returns the number of removed elements.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify by removing specified items.\r\n * @param {...T} items - The values to remove from the array.\r\n * @return {number} The number of elements removed from the array.\r\n */\r\nexport function pull<T>(array: Array<T>, ...items: Array<T>): number {\r\n\r\n    let output = 0;\r\n    for (const item of items) {\r\n        const index = array.indexOf(item);\r\n        if (index !== -1) {\r\n            array.splice(index, 1);\r\n            output++;\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of a given size.\r\n * @template T\r\n * @param {Array<T>} array - The array to split.\r\n * @param {number} size - The size of each chunk.\r\n * @return {Array<Array<T>>} The array of chunks.\r\n */\r\nexport function chunk<T>(array: Array<T>, size: number): Array<Array<T>> {\r\n    if (size <= 0) throw new Error(\"Size must be greater than 0\");\r\n    const result: Array<Array<T>> = [];\r\n    for (let i = 0; i < array.length; i += size) {\r\n        result.push(array.slice(i, i + size));\r\n    }\r\n    return result;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array, mutating it.\r\n * @template T\r\n * @param {Array<T>} array - The array to clear.\r\n */\r\nexport function clear<T>(array: Array<T>): void {\r\n    array.length = 0;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array that satisfy the predicate.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @return {Array<T>} An array of removed elements.\r\n */\r\nexport function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {\r\n    const removed: Array<T> = [];\r\n    let i = 0;\r\n\r\n    while (i < array.length) {\r\n        if (predicate(array[i])) {\r\n            removed.push(array[i]);\r\n            array.splice(i, 1); // muta el array\r\n        } else {\r\n            i++;\r\n        }\r\n    }\r\n\r\n    return removed;\r\n}\r\n\r\n/**\r\n * Adds an element to the array if it's not already present.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify.\r\n * @param {T} element - The element to add if absent.\r\n * @return {boolean} True if the element was added, false otherwise.\r\n */\r\nexport function pushIfAbsent<T>(array: Array<T>, element: T): boolean {\r\n    if (!array.includes(element)) {\r\n        array.push(element);\r\n        return true;\r\n    }\r\n    return false;\r\n}"]}

package/dist/esm/index.js

@@ -20,6 +20,7 @@ export { default as AsyncPoolExecutor } from './async-pool-executor.js';
 export { default as Lazy } from './lazy.js';
 export { default as from } from './collections/from.js';
 export { EventBus, Event } from './event-bus.js';
+export { default as Range } from './range.js';
 // ─── Draft ────────────────────────────────────────
 export { default as draft } from './draft.js';
 // ─── Web ─────────────────────────────────────────────

package/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,eAAe;AAEf,wDAAwD;AACxD,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAEnD,wDAAwD;AACxD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAC,OAAO,IAAI,kBAAkB,EAAC,MAAM,0BAA0B,CAAC;AAEvE,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,eAAe,CAAC;AAClD,OAAO,EAAC,OAAO,IAAI,SAAS,EAAC,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAEtE,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,MAAM,gBAAgB,CAAC;AAE/C,qDAAqD;AACrD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,oBAAoB,EAAC,MAAM,8BAA8B,CAAC;AAC7E,mBAAmB;AACnB,OAAO,EAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAIxF,wDAAwD;AACxD,mBAAmB;AACnB,cAAc,YAAY,CAAC;AAC3B,mBAAmB;AACnB,cAAc,wBAAwB,CAAC","sourcesContent":["// src/index.ts\r\n\r\n// ─── Types ───────────────────────────────────────────\r\nexport * from './types.js';\r\nexport {default as Type} from './type.js';\r\nexport {default as TypeCode} from './type-code.js';\r\n\r\n// ─── Utilities ───────────────────────────────────────\r\nexport * from './utilities.js';\r\nexport * from './string.js';\r\nexport * from './math.js';\r\nexport {default as CancellablePromise} from \"./cancellable-promise.js\";\r\n\r\n// ─── Data Structures ────────────────────────────────\r\nexport {default as KeyValuePair} from './key-value-pair.js';\r\nexport {default as Order} from './order.js';\r\n\r\n// ─── Async & Timing ─────────────────────────────────\r\nexport {default as Timer} from './timer.js';\r\nexport {default as TimeSpan} from './timespan.js';\r\nexport {default as Stopwatch} from './stopwatch.js';\r\nexport {default as AsyncPoolExecutor} from './async-pool-executor.js';\r\n\r\n// ─── Patterns ────────────────────────────────────────\r\nexport {default as Lazy} from './lazy.js';\r\nexport {default as from} from './collections/from.js';\r\nexport {EventBus, Event} from './event-bus.js';\r\n\r\n// ─── Draft ────────────────────────────────────────\r\nexport {default as draft} from './draft.js';\r\n\r\n// ─── Web ─────────────────────────────────────────────\r\nexport {default as CleanURLSearchParams} from './clean-url-search-params.js';\r\n/** @deprecated  */\r\nexport {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';\r\n\r\n\r\n\r\n// ─── Deprecated ──────────────────────────────────────\r\n/** @deprecated  */\r\nexport * from './array.js';\r\n/** @deprecated  */\r\nexport * from './collections/index.js';"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,eAAe;AAEf,wDAAwD;AACxD,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAEnD,wDAAwD;AACxD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAC,OAAO,IAAI,kBAAkB,EAAC,MAAM,0BAA0B,CAAC;AAEvE,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,eAAe,CAAC;AAClD,OAAO,EAAC,OAAO,IAAI,SAAS,EAAC,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAEtE,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,qDAAqD;AACrD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,oBAAoB,EAAC,MAAM,8BAA8B,CAAC;AAC7E,mBAAmB;AACnB,OAAO,EAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAIxF,wDAAwD;AACxD,mBAAmB;AACnB,cAAc,YAAY,CAAC;AAC3B,mBAAmB;AACnB,cAAc,wBAAwB,CAAC","sourcesContent":["// src/index.ts\n\n// ─── Types ───────────────────────────────────────────\nexport * from './types.js';\nexport {default as Type} from './type.js';\nexport {default as TypeCode} from './type-code.js';\n\n// ─── Utilities ───────────────────────────────────────\nexport * from './utilities.js';\nexport * from './string.js';\nexport * from './math.js';\nexport {default as CancellablePromise} from \"./cancellable-promise.js\";\n\n// ─── Data Structures ────────────────────────────────\nexport {default as KeyValuePair} from './key-value-pair.js';\nexport {default as Order} from './order.js';\n\n// ─── Async & Timing ─────────────────────────────────\nexport {default as Timer} from './timer.js';\nexport {default as TimeSpan} from './timespan.js';\nexport {default as Stopwatch} from './stopwatch.js';\nexport {default as AsyncPoolExecutor} from './async-pool-executor.js';\n\n// ─── Patterns ────────────────────────────────────────\nexport {default as Lazy} from './lazy.js';\nexport {default as from} from './collections/from.js';\nexport {EventBus, Event} from './event-bus.js';\nexport {default as Range} from './range.js';\n\n// ─── Draft ────────────────────────────────────────\nexport {default as draft} from './draft.js';\n\n// ─── Web ─────────────────────────────────────────────\nexport {default as CleanURLSearchParams} from './clean-url-search-params.js';\n/** @deprecated  */\nexport {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';\n\n\n\n// ─── Deprecated ──────────────────────────────────────\n/** @deprecated  */\nexport * from './array.js';\n/** @deprecated  */\nexport * from './collections/index.js';"]}

package/dist/esm/range.js

@@ -0,0 +1,151 @@
+export default class Range {
+    /**
+     * Range constructor.
+     * @param start
+     * @param end
+     */
+    constructor(start, end) {
+        this.start = start;
+        this.end = end;
+    }
+    /**
+     * Finds the intersection between two ranges.
+     *
+     * @param other The Range object to intersect with.
+     * @returns The intersected Range object, or null if there is no intersection.
+     */
+    intersect(other) {
+        const start = (this.start > other.start) ? this.start : other.start;
+        const end = (this.end < other.end) ? this.end : other.end;
+        if (start < end) {
+            return new Range(start, end);
+        }
+        else {
+            return null;
+        }
+    }
+    /**
+     * Subtract the given range from this range.
+     *
+     * @param other The range to subtract from this range.
+     * @returns An array of Range objects representing the result of the subtraction.
+     */
+    subtract(other) {
+        const result = [];
+        if (this.start >= other.end || this.end <= other.start) {
+            result.push(new Range(this.start, this.end));
+        }
+        else if (other.start <= this.start && other.end >= this.end) {
+            return result;
+        }
+        else {
+            if (this.start < other.start) {
+                result.push(new Range(this.start, other.start));
+            }
+            if (this.end > other.end) {
+                result.push(new Range(other.end, this.end));
+            }
+        }
+        return result;
+    }
+    /**
+     * Determines if the given range overlaps with the current range.
+     *
+     * @param other The range to be checked for overlap.
+     * @returns Returns true if there is an overlap between the ranges, false otherwise.
+     */
+    overlaps(other) {
+        const s1 = this.start;
+        const e1 = this.end;
+        const s2 = other.start;
+        const e2 = other.end;
+        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||
+            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||
+            (s1 === s2 && e1 === e2);
+    }
+    /**
+     * Determines whether the specified value is within the range defined by the start and end values.
+     *
+     * @param obj The value to check if it is within the range.
+     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.
+     * @returns Returns true if the specified value is within the range, false otherwise.
+     */
+    contains(obj, inclusive = true) {
+        return inclusive ?
+            (this.start <= obj && this.end >= obj) :
+            (this.start < obj && this.end > obj);
+    }
+    /**
+     * @returns T
+     */
+    getStart() {
+        return this.start;
+    }
+    /**
+     * @returns T
+     */
+    getEnd() {
+        return this.end;
+    }
+    /**
+     * Finds the intersection between two sets of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static intersectRanges(ranges1, ranges2) {
+        const result = [];
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                const intersection = r1.intersect(r2);
+                if (intersection !== null) {
+                    result.push(intersection);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Determines if any range in the first set overlaps with any range in the second set.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static overlapsAny(ranges1, ranges2) {
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                if (r1.overlaps(r2)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Subtracts the second set of ranges from the first set of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static subtractRanges(ranges1, ranges2) {
+        let currentRanges = ranges1;
+        for (const r2 of ranges2) {
+            const nextRanges = [];
+            for (const r1 of currentRanges) {
+                const subtracted = r1.subtract(r2);
+                for (const s of subtracted) {
+                    nextRanges.push(s);
+                }
+            }
+            currentRanges = nextRanges;
+            if (currentRanges.length === 0) {
+                break;
+            }
+        }
+        return currentRanges;
+    }
+}
+//# sourceMappingURL=range.js.map

package/dist/esm/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/range.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,OAAO,KAAK;IAKtB;;;;OAIG;IACH,YAAY,KAAQ,EAAE,GAAM;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,KAAe;QAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;QACpE,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAE1D,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;YACd,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAe;QAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5D,OAAO,MAAM,CAAC;QAClB,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpD,CAAC;YAED,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAe;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC;QAErB,OAAO,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC7C,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC1C,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACI,QAAQ,CAAC,GAAM,EAAE,YAAqB,IAAI;QAC7C,OAAO,SAAS,CAAC,CAAC;YACd,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACI,QAAQ;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,MAAM;QACT,OAAO,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,eAAe,CAAI,OAAmB,EAAE,OAAmB;QACrE,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvB,MAAM,YAAY,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,WAAW,CAAI,OAAmB,EAAE,OAAmB;QACjE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvB,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAClB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,cAAc,CAAI,OAAmB,EAAE,OAAmB;QACpE,IAAI,aAAa,GAAG,OAAO,CAAC;QAC5B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACnC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBACzB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACL,CAAC;YACD,aAAa,GAAG,UAAU,CAAC;YAC3B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,aAAa,CAAC;IACzB,CAAC;CACJ","sourcesContent":["export default class Range<T> {\n\n    private readonly start: T;\n    private readonly end: T;\n\n    /**\n     * Range constructor.\n     * @param start\n     * @param end\n     */\n    constructor(start: T, end: T) {\n        this.start = start;\n        this.end = end;\n    }\n\n    /**\n     * Finds the intersection between two ranges.\n     *\n     * @param other The Range object to intersect with.\n     * @returns The intersected Range object, or null if there is no intersection.\n     */\n    public intersect(other: Range<T>): Range<T> | null {\n        const start = (this.start > other.start) ? this.start : other.start;\n        const end = (this.end < other.end) ? this.end : other.end;\n\n        if (start < end) {\n            return new Range(start, end);\n        } else {\n            return null;\n        }\n    }\n\n    /**\n     * Subtract the given range from this range.\n     *\n     * @param other The range to subtract from this range.\n     * @returns An array of Range objects representing the result of the subtraction.\n     */\n    public subtract(other: Range<T>): Range<T>[] {\n        const result: Range<T>[] = [];\n\n        if (this.start >= other.end || this.end <= other.start) {\n            result.push(new Range(this.start, this.end));\n        } else if (other.start <= this.start && other.end >= this.end) {\n            return result;\n        } else {\n            if (this.start < other.start) {\n                result.push(new Range(this.start, other.start));\n            }\n\n            if (this.end > other.end) {\n                result.push(new Range(other.end, this.end));\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Determines if the given range overlaps with the current range.\n     *\n     * @param other The range to be checked for overlap.\n     * @returns Returns true if there is an overlap between the ranges, false otherwise.\n     */\n    public overlaps(other: Range<T>): boolean {\n        const s1 = this.start;\n        const e1 = this.end;\n        const s2 = other.start;\n        const e2 = other.end;\n\n        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||\n            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||\n            (s1 === s2 && e1 === e2);\n    }\n\n    /**\n     * Determines whether the specified value is within the range defined by the start and end values.\n     *\n     * @param obj The value to check if it is within the range.\n     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.\n     * @returns Returns true if the specified value is within the range, false otherwise.\n     */\n    public contains(obj: T, inclusive: boolean = true): boolean {\n        return inclusive ?\n            (this.start <= obj && this.end >= obj) :\n            (this.start < obj && this.end > obj);\n    }\n\n    /**\n     * @returns T\n     */\n    public getStart(): T {\n        return this.start;\n    }\n\n    /**\n     * @returns T\n     */\n    public getEnd(): T {\n        return this.end;\n    }\n\n    /**\n     * Finds the intersection between two sets of ranges.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static intersectRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {\n        const result: Range<T>[] = [];\n        for (const r1 of ranges1) {\n            for (const r2 of ranges2) {\n                const intersection = r1.intersect(r2);\n                if (intersection !== null) {\n                    result.push(intersection);\n                }\n            }\n        }\n        return result;\n    }\n\n    /**\n     * Determines if any range in the first set overlaps with any range in the second set.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static overlapsAny<T>(ranges1: Range<T>[], ranges2: Range<T>[]): boolean {\n        for (const r1 of ranges1) {\n            for (const r2 of ranges2) {\n                if (r1.overlaps(r2)) {\n                    return true;\n                }\n            }\n        }\n        return false;\n    }\n\n    /**\n     * Subtracts the second set of ranges from the first set of ranges.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static subtractRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {\n        let currentRanges = ranges1;\n        for (const r2 of ranges2) {\n            const nextRanges: Range<T>[] = [];\n            for (const r1 of currentRanges) {\n                const subtracted = r1.subtract(r2);\n                for (const s of subtracted) {\n                    nextRanges.push(s);\n                }\n            }\n            currentRanges = nextRanges;\n            if (currentRanges.length === 0) {\n                break;\n            }\n        }\n        return currentRanges;\n    }\n}\n"]}

package/dist/types/array.d.ts

@@ -29,4 +29,13 @@ export declare function clear<T>(array: Array<T>): void;
  * @return {Array<T>} An array of removed elements.
  */
 export declare function remove<T>(array: Array<T>, predicate: Predicate<T>): Array<T>;
+/**
+ * Adds an element to the array if it's not already present.
+ * The operation mutates the original array.
+ * @template T
+ * @param {Array<T>} array - The array to modify.
+ * @param {T} element - The element to add if absent.
+ * @return {boolean} True if the element was added, false otherwise.
+ */
+export declare function pushIfAbsent<T>(array: Array<T>, element: T): boolean;
 //# sourceMappingURL=array.d.ts.map

package/dist/types/array.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,YAAY,CAAC;AAE1C;;;;;;;GAOG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAWnE;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAOvE;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAE9C;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAc3E"}
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,YAAY,CAAC;AAE1C;;;;;;;GAOG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAWnE;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAOvE;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAE9C;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAc3E;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,OAAO,CAMpE"}

package/dist/types/index.d.ts

@@ -14,6 +14,7 @@ export { default as AsyncPoolExecutor } from './async-pool-executor.js';
 export { default as Lazy } from './lazy.js';
 export { default as from } from './collections/from.js';
 export { EventBus, Event } from './event-bus.js';
+export { default as Range } from './range.js';
 export { default as draft } from './draft.js';
 export { default as CleanURLSearchParams } from './clean-url-search-params.js';
 /** @deprecated  */

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAGA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAGnD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAC,OAAO,IAAI,kBAAkB,EAAC,MAAM,0BAA0B,CAAC;AAGvE,OAAO,EAAC,OAAO,IAAI,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAG5C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,eAAe,CAAC;AAClD,OAAO,EAAC,OAAO,IAAI,SAAS,EAAC,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAGtE,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,MAAM,gBAAgB,CAAC;AAG/C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAG5C,OAAO,EAAC,OAAO,IAAI,oBAAoB,EAAC,MAAM,8BAA8B,CAAC;AAC7E,mBAAmB;AACnB,OAAO,EAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAKxF,mBAAmB;AACnB,cAAc,YAAY,CAAC;AAC3B,mBAAmB;AACnB,cAAc,wBAAwB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAGA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAGnD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAC,OAAO,IAAI,kBAAkB,EAAC,MAAM,0BAA0B,CAAC;AAGvE,OAAO,EAAC,OAAO,IAAI,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAG5C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,eAAe,CAAC;AAClD,OAAO,EAAC,OAAO,IAAI,SAAS,EAAC,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAGtE,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAG5C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAG5C,OAAO,EAAC,OAAO,IAAI,oBAAoB,EAAC,MAAM,8BAA8B,CAAC;AAC7E,mBAAmB;AACnB,OAAO,EAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAKxF,mBAAmB;AACnB,cAAc,YAAY,CAAC;AAC3B,mBAAmB;AACnB,cAAc,wBAAwB,CAAC"}

package/dist/types/range.d.ts

@@ -0,0 +1,72 @@
+export default class Range<T> {
+    private readonly start;
+    private readonly end;
+    /**
+     * Range constructor.
+     * @param start
+     * @param end
+     */
+    constructor(start: T, end: T);
+    /**
+     * Finds the intersection between two ranges.
+     *
+     * @param other The Range object to intersect with.
+     * @returns The intersected Range object, or null if there is no intersection.
+     */
+    intersect(other: Range<T>): Range<T> | null;
+    /**
+     * Subtract the given range from this range.
+     *
+     * @param other The range to subtract from this range.
+     * @returns An array of Range objects representing the result of the subtraction.
+     */
+    subtract(other: Range<T>): Range<T>[];
+    /**
+     * Determines if the given range overlaps with the current range.
+     *
+     * @param other The range to be checked for overlap.
+     * @returns Returns true if there is an overlap between the ranges, false otherwise.
+     */
+    overlaps(other: Range<T>): boolean;
+    /**
+     * Determines whether the specified value is within the range defined by the start and end values.
+     *
+     * @param obj The value to check if it is within the range.
+     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.
+     * @returns Returns true if the specified value is within the range, false otherwise.
+     */
+    contains(obj: T, inclusive?: boolean): boolean;
+    /**
+     * @returns T
+     */
+    getStart(): T;
+    /**
+     * @returns T
+     */
+    getEnd(): T;
+    /**
+     * Finds the intersection between two sets of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static intersectRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[];
+    /**
+     * Determines if any range in the first set overlaps with any range in the second set.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static overlapsAny<T>(ranges1: Range<T>[], ranges2: Range<T>[]): boolean;
+    /**
+     * Subtracts the second set of ranges from the first set of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static subtractRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[];
+}
+//# sourceMappingURL=range.d.ts.map

package/dist/types/range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.d.ts","sourceRoot":"","sources":["../../src/range.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,OAAO,KAAK,CAAC,CAAC;IAExB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAI;IAC1B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAI;IAExB;;;;OAIG;gBACS,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;IAK5B;;;;;OAKG;IACI,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;IAWlD;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE;IAoB5C;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO;IAWzC;;;;;;OAMG;IACI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAM3D;;OAEG;IACI,QAAQ,IAAI,CAAC;IAIpB;;OAEG;IACI,MAAM,IAAI,CAAC;IAIlB;;;;;;OAMG;WACW,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE;IAatF;;;;;;OAMG;WACW,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO;IAW/E;;;;;;OAMG;WACW,cAAc,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE;CAiBxF"}

package/dist/web/array.js

@@ -61,4 +61,19 @@ export function remove(array, predicate) {
     }
     return removed;
 }
+/**
+ * Adds an element to the array if it's not already present.
+ * The operation mutates the original array.
+ * @template T
+ * @param {Array<T>} array - The array to modify.
+ * @param {T} element - The element to add if absent.
+ * @return {boolean} True if the element was added, false otherwise.
+ */
+export function pushIfAbsent(array, element) {
+    if (!array.includes(element)) {
+        array.push(element);
+        return true;
+    }
+    return false;
+}
 //# sourceMappingURL=array.js.map

package/dist/web/array.js.map

@@ -1 +1 @@
-{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe,EAAE,GAAG,KAAe;IAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe,EAAE,IAAY;IAClD,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe;IACpC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAC,SAAuB;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;QACxC,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC","sourcesContent":["import type {Predicate} from \"./types.js\";\r\n\r\n/**\r\n * Removes all given values from the provided array and returns the number of removed elements.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify by removing specified items.\r\n * @param {...T} items - The values to remove from the array.\r\n * @return {number} The number of elements removed from the array.\r\n */\r\nexport function pull<T>(array: Array<T>, ...items: Array<T>): number {\r\n\r\n    let output = 0;\r\n    for (const item of items) {\r\n        const index = array.indexOf(item);\r\n        if (index !== -1) {\r\n            array.splice(index, 1);\r\n            output++;\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of a given size.\r\n * @template T\r\n * @param {Array<T>} array - The array to split.\r\n * @param {number} size - The size of each chunk.\r\n * @return {Array<Array<T>>} The array of chunks.\r\n */\r\nexport function chunk<T>(array: Array<T>, size: number): Array<Array<T>> {\r\n    if (size <= 0) throw new Error(\"Size must be greater than 0\");\r\n    const result: Array<Array<T>> = [];\r\n    for (let i = 0; i < array.length; i += size) {\r\n        result.push(array.slice(i, i + size));\r\n    }\r\n    return result;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array, mutating it.\r\n * @template T\r\n * @param {Array<T>} array - The array to clear.\r\n */\r\nexport function clear<T>(array: Array<T>): void {\r\n    array.length = 0;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array that satisfy the predicate.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @return {Array<T>} An array of removed elements.\r\n */\r\nexport function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {\r\n    const removed: Array<T> = [];\r\n    let i = 0;\r\n\r\n    while (i < array.length) {\r\n        if (predicate(array[i])) {\r\n            removed.push(array[i]);\r\n            array.splice(i, 1); // muta el array\r\n        } else {\r\n            i++;\r\n        }\r\n    }\r\n\r\n    return removed;\r\n}"]}
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/array.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,IAAI,CAAI,KAAe,EAAE,GAAG,KAAe;IAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe,EAAE,IAAY;IAClD,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAI,KAAe;IACpC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAI,KAAe,EAAC,SAAuB;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB;QACxC,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAI,KAAe,EAAE,OAAU;IACvD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC","sourcesContent":["import type {Predicate} from \"./types.js\";\r\n\r\n/**\r\n * Removes all given values from the provided array and returns the number of removed elements.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify by removing specified items.\r\n * @param {...T} items - The values to remove from the array.\r\n * @return {number} The number of elements removed from the array.\r\n */\r\nexport function pull<T>(array: Array<T>, ...items: Array<T>): number {\r\n\r\n    let output = 0;\r\n    for (const item of items) {\r\n        const index = array.indexOf(item);\r\n        if (index !== -1) {\r\n            array.splice(index, 1);\r\n            output++;\r\n        }\r\n    }\r\n    return output;\r\n}\r\n\r\n/**\r\n * Splits an array into chunks of a given size.\r\n * @template T\r\n * @param {Array<T>} array - The array to split.\r\n * @param {number} size - The size of each chunk.\r\n * @return {Array<Array<T>>} The array of chunks.\r\n */\r\nexport function chunk<T>(array: Array<T>, size: number): Array<Array<T>> {\r\n    if (size <= 0) throw new Error(\"Size must be greater than 0\");\r\n    const result: Array<Array<T>> = [];\r\n    for (let i = 0; i < array.length; i += size) {\r\n        result.push(array.slice(i, i + size));\r\n    }\r\n    return result;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array, mutating it.\r\n * @template T\r\n * @param {Array<T>} array - The array to clear.\r\n */\r\nexport function clear<T>(array: Array<T>): void {\r\n    array.length = 0;\r\n}\r\n\r\n/**\r\n * Removes all elements from the array that satisfy the predicate.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @return {Array<T>} An array of removed elements.\r\n */\r\nexport function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {\r\n    const removed: Array<T> = [];\r\n    let i = 0;\r\n\r\n    while (i < array.length) {\r\n        if (predicate(array[i])) {\r\n            removed.push(array[i]);\r\n            array.splice(i, 1); // muta el array\r\n        } else {\r\n            i++;\r\n        }\r\n    }\r\n\r\n    return removed;\r\n}\r\n\r\n/**\r\n * Adds an element to the array if it's not already present.\r\n * The operation mutates the original array.\r\n * @template T\r\n * @param {Array<T>} array - The array to modify.\r\n * @param {T} element - The element to add if absent.\r\n * @return {boolean} True if the element was added, false otherwise.\r\n */\r\nexport function pushIfAbsent<T>(array: Array<T>, element: T): boolean {\r\n    if (!array.includes(element)) {\r\n        array.push(element);\r\n        return true;\r\n    }\r\n    return false;\r\n}"]}

package/dist/web/index.js

@@ -20,6 +20,7 @@ export { default as AsyncPoolExecutor } from './async-pool-executor.js';
 export { default as Lazy } from './lazy.js';
 export { default as from } from './collections/from.js';
 export { EventBus, Event } from './event-bus.js';
+export { default as Range } from './range.js';
 // ─── Draft ────────────────────────────────────────
 export { default as draft } from './draft.js';
 // ─── Web ─────────────────────────────────────────────

package/dist/web/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,eAAe;AAEf,wDAAwD;AACxD,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAEnD,wDAAwD;AACxD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAC,OAAO,IAAI,kBAAkB,EAAC,MAAM,0BAA0B,CAAC;AAEvE,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,eAAe,CAAC;AAClD,OAAO,EAAC,OAAO,IAAI,SAAS,EAAC,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAEtE,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,MAAM,gBAAgB,CAAC;AAE/C,qDAAqD;AACrD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,oBAAoB,EAAC,MAAM,8BAA8B,CAAC;AAC7E,mBAAmB;AACnB,OAAO,EAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAIxF,wDAAwD;AACxD,mBAAmB;AACnB,cAAc,YAAY,CAAC;AAC3B,mBAAmB;AACnB,cAAc,wBAAwB,CAAC","sourcesContent":["// src/index.ts\r\n\r\n// ─── Types ───────────────────────────────────────────\r\nexport * from './types.js';\r\nexport {default as Type} from './type.js';\r\nexport {default as TypeCode} from './type-code.js';\r\n\r\n// ─── Utilities ───────────────────────────────────────\r\nexport * from './utilities.js';\r\nexport * from './string.js';\r\nexport * from './math.js';\r\nexport {default as CancellablePromise} from \"./cancellable-promise.js\";\r\n\r\n// ─── Data Structures ────────────────────────────────\r\nexport {default as KeyValuePair} from './key-value-pair.js';\r\nexport {default as Order} from './order.js';\r\n\r\n// ─── Async & Timing ─────────────────────────────────\r\nexport {default as Timer} from './timer.js';\r\nexport {default as TimeSpan} from './timespan.js';\r\nexport {default as Stopwatch} from './stopwatch.js';\r\nexport {default as AsyncPoolExecutor} from './async-pool-executor.js';\r\n\r\n// ─── Patterns ────────────────────────────────────────\r\nexport {default as Lazy} from './lazy.js';\r\nexport {default as from} from './collections/from.js';\r\nexport {EventBus, Event} from './event-bus.js';\r\n\r\n// ─── Draft ────────────────────────────────────────\r\nexport {default as draft} from './draft.js';\r\n\r\n// ─── Web ─────────────────────────────────────────────\r\nexport {default as CleanURLSearchParams} from './clean-url-search-params.js';\r\n/** @deprecated  */\r\nexport {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';\r\n\r\n\r\n\r\n// ─── Deprecated ──────────────────────────────────────\r\n/** @deprecated  */\r\nexport * from './array.js';\r\n/** @deprecated  */\r\nexport * from './collections/index.js';"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,eAAe;AAEf,wDAAwD;AACxD,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAEnD,wDAAwD;AACxD,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAC,OAAO,IAAI,kBAAkB,EAAC,MAAM,0BAA0B,CAAC;AAEvE,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,uDAAuD;AACvD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,eAAe,CAAC;AAClD,OAAO,EAAC,OAAO,IAAI,SAAS,EAAC,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAEtE,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAC,OAAO,IAAI,IAAI,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,qDAAqD;AACrD,OAAO,EAAC,OAAO,IAAI,KAAK,EAAC,MAAM,YAAY,CAAC;AAE5C,wDAAwD;AACxD,OAAO,EAAC,OAAO,IAAI,oBAAoB,EAAC,MAAM,8BAA8B,CAAC;AAC7E,mBAAmB;AACnB,OAAO,EAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAIxF,wDAAwD;AACxD,mBAAmB;AACnB,cAAc,YAAY,CAAC;AAC3B,mBAAmB;AACnB,cAAc,wBAAwB,CAAC","sourcesContent":["// src/index.ts\n\n// ─── Types ───────────────────────────────────────────\nexport * from './types.js';\nexport {default as Type} from './type.js';\nexport {default as TypeCode} from './type-code.js';\n\n// ─── Utilities ───────────────────────────────────────\nexport * from './utilities.js';\nexport * from './string.js';\nexport * from './math.js';\nexport {default as CancellablePromise} from \"./cancellable-promise.js\";\n\n// ─── Data Structures ────────────────────────────────\nexport {default as KeyValuePair} from './key-value-pair.js';\nexport {default as Order} from './order.js';\n\n// ─── Async & Timing ─────────────────────────────────\nexport {default as Timer} from './timer.js';\nexport {default as TimeSpan} from './timespan.js';\nexport {default as Stopwatch} from './stopwatch.js';\nexport {default as AsyncPoolExecutor} from './async-pool-executor.js';\n\n// ─── Patterns ────────────────────────────────────────\nexport {default as Lazy} from './lazy.js';\nexport {default as from} from './collections/from.js';\nexport {EventBus, Event} from './event-bus.js';\nexport {default as Range} from './range.js';\n\n// ─── Draft ────────────────────────────────────────\nexport {default as draft} from './draft.js';\n\n// ─── Web ─────────────────────────────────────────────\nexport {default as CleanURLSearchParams} from './clean-url-search-params.js';\n/** @deprecated  */\nexport {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';\n\n\n\n// ─── Deprecated ──────────────────────────────────────\n/** @deprecated  */\nexport * from './array.js';\n/** @deprecated  */\nexport * from './collections/index.js';"]}

package/dist/web/range.js

@@ -0,0 +1,151 @@
+export default class Range {
+    /**
+     * Range constructor.
+     * @param start
+     * @param end
+     */
+    constructor(start, end) {
+        this.start = start;
+        this.end = end;
+    }
+    /**
+     * Finds the intersection between two ranges.
+     *
+     * @param other The Range object to intersect with.
+     * @returns The intersected Range object, or null if there is no intersection.
+     */
+    intersect(other) {
+        const start = (this.start > other.start) ? this.start : other.start;
+        const end = (this.end < other.end) ? this.end : other.end;
+        if (start < end) {
+            return new Range(start, end);
+        }
+        else {
+            return null;
+        }
+    }
+    /**
+     * Subtract the given range from this range.
+     *
+     * @param other The range to subtract from this range.
+     * @returns An array of Range objects representing the result of the subtraction.
+     */
+    subtract(other) {
+        const result = [];
+        if (this.start >= other.end || this.end <= other.start) {
+            result.push(new Range(this.start, this.end));
+        }
+        else if (other.start <= this.start && other.end >= this.end) {
+            return result;
+        }
+        else {
+            if (this.start < other.start) {
+                result.push(new Range(this.start, other.start));
+            }
+            if (this.end > other.end) {
+                result.push(new Range(other.end, this.end));
+            }
+        }
+        return result;
+    }
+    /**
+     * Determines if the given range overlaps with the current range.
+     *
+     * @param other The range to be checked for overlap.
+     * @returns Returns true if there is an overlap between the ranges, false otherwise.
+     */
+    overlaps(other) {
+        const s1 = this.start;
+        const e1 = this.end;
+        const s2 = other.start;
+        const e2 = other.end;
+        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||
+            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||
+            (s1 === s2 && e1 === e2);
+    }
+    /**
+     * Determines whether the specified value is within the range defined by the start and end values.
+     *
+     * @param obj The value to check if it is within the range.
+     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.
+     * @returns Returns true if the specified value is within the range, false otherwise.
+     */
+    contains(obj, inclusive = true) {
+        return inclusive ?
+            (this.start <= obj && this.end >= obj) :
+            (this.start < obj && this.end > obj);
+    }
+    /**
+     * @returns T
+     */
+    getStart() {
+        return this.start;
+    }
+    /**
+     * @returns T
+     */
+    getEnd() {
+        return this.end;
+    }
+    /**
+     * Finds the intersection between two sets of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static intersectRanges(ranges1, ranges2) {
+        const result = [];
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                const intersection = r1.intersect(r2);
+                if (intersection !== null) {
+                    result.push(intersection);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Determines if any range in the first set overlaps with any range in the second set.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static overlapsAny(ranges1, ranges2) {
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                if (r1.overlaps(r2)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Subtracts the second set of ranges from the first set of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    static subtractRanges(ranges1, ranges2) {
+        let currentRanges = ranges1;
+        for (const r2 of ranges2) {
+            const nextRanges = [];
+            for (const r1 of currentRanges) {
+                const subtracted = r1.subtract(r2);
+                for (const s of subtracted) {
+                    nextRanges.push(s);
+                }
+            }
+            currentRanges = nextRanges;
+            if (currentRanges.length === 0) {
+                break;
+            }
+        }
+        return currentRanges;
+    }
+}
+//# sourceMappingURL=range.js.map

package/dist/web/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/range.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,OAAO,KAAK;IAKtB;;;;OAIG;IACH,YAAY,KAAQ,EAAE,GAAM;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,KAAe;QAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;QACpE,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAE1D,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;YACd,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAe;QAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5D,OAAO,MAAM,CAAC;QAClB,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACpD,CAAC;YAED,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,KAAe;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC;QAErB,OAAO,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC7C,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC1C,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACI,QAAQ,CAAC,GAAM,EAAE,YAAqB,IAAI;QAC7C,OAAO,SAAS,CAAC,CAAC;YACd,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACI,QAAQ;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,MAAM;QACT,OAAO,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,eAAe,CAAI,OAAmB,EAAE,OAAmB;QACrE,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvB,MAAM,YAAY,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,WAAW,CAAI,OAAmB,EAAE,OAAmB;QACjE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvB,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAClB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,cAAc,CAAI,OAAmB,EAAE,OAAmB;QACpE,IAAI,aAAa,GAAG,OAAO,CAAC;QAC5B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACnC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBACzB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACL,CAAC;YACD,aAAa,GAAG,UAAU,CAAC;YAC3B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,aAAa,CAAC;IACzB,CAAC;CACJ","sourcesContent":["export default class Range<T> {\n\n    private readonly start: T;\n    private readonly end: T;\n\n    /**\n     * Range constructor.\n     * @param start\n     * @param end\n     */\n    constructor(start: T, end: T) {\n        this.start = start;\n        this.end = end;\n    }\n\n    /**\n     * Finds the intersection between two ranges.\n     *\n     * @param other The Range object to intersect with.\n     * @returns The intersected Range object, or null if there is no intersection.\n     */\n    public intersect(other: Range<T>): Range<T> | null {\n        const start = (this.start > other.start) ? this.start : other.start;\n        const end = (this.end < other.end) ? this.end : other.end;\n\n        if (start < end) {\n            return new Range(start, end);\n        } else {\n            return null;\n        }\n    }\n\n    /**\n     * Subtract the given range from this range.\n     *\n     * @param other The range to subtract from this range.\n     * @returns An array of Range objects representing the result of the subtraction.\n     */\n    public subtract(other: Range<T>): Range<T>[] {\n        const result: Range<T>[] = [];\n\n        if (this.start >= other.end || this.end <= other.start) {\n            result.push(new Range(this.start, this.end));\n        } else if (other.start <= this.start && other.end >= this.end) {\n            return result;\n        } else {\n            if (this.start < other.start) {\n                result.push(new Range(this.start, other.start));\n            }\n\n            if (this.end > other.end) {\n                result.push(new Range(other.end, this.end));\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Determines if the given range overlaps with the current range.\n     *\n     * @param other The range to be checked for overlap.\n     * @returns Returns true if there is an overlap between the ranges, false otherwise.\n     */\n    public overlaps(other: Range<T>): boolean {\n        const s1 = this.start;\n        const e1 = this.end;\n        const s2 = other.start;\n        const e2 = other.end;\n\n        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||\n            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||\n            (s1 === s2 && e1 === e2);\n    }\n\n    /**\n     * Determines whether the specified value is within the range defined by the start and end values.\n     *\n     * @param obj The value to check if it is within the range.\n     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.\n     * @returns Returns true if the specified value is within the range, false otherwise.\n     */\n    public contains(obj: T, inclusive: boolean = true): boolean {\n        return inclusive ?\n            (this.start <= obj && this.end >= obj) :\n            (this.start < obj && this.end > obj);\n    }\n\n    /**\n     * @returns T\n     */\n    public getStart(): T {\n        return this.start;\n    }\n\n    /**\n     * @returns T\n     */\n    public getEnd(): T {\n        return this.end;\n    }\n\n    /**\n     * Finds the intersection between two sets of ranges.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static intersectRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {\n        const result: Range<T>[] = [];\n        for (const r1 of ranges1) {\n            for (const r2 of ranges2) {\n                const intersection = r1.intersect(r2);\n                if (intersection !== null) {\n                    result.push(intersection);\n                }\n            }\n        }\n        return result;\n    }\n\n    /**\n     * Determines if any range in the first set overlaps with any range in the second set.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static overlapsAny<T>(ranges1: Range<T>[], ranges2: Range<T>[]): boolean {\n        for (const r1 of ranges1) {\n            for (const r2 of ranges2) {\n                if (r1.overlaps(r2)) {\n                    return true;\n                }\n            }\n        }\n        return false;\n    }\n\n    /**\n     * Subtracts the second set of ranges from the first set of ranges.\n     *\n     * @param ranges1\n     * @param ranges2\n     * @returns\n     */\n    public static subtractRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {\n        let currentRanges = ranges1;\n        for (const r2 of ranges2) {\n            const nextRanges: Range<T>[] = [];\n            for (const r1 of currentRanges) {\n                const subtracted = r1.subtract(r2);\n                for (const s of subtracted) {\n                    nextRanges.push(s);\n                }\n            }\n            currentRanges = nextRanges;\n            if (currentRanges.length === 0) {\n                break;\n            }\n        }\n        return currentRanges;\n    }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@develia/commons",
-  "version": "0.4.15",
+  "version": "0.4.16",
   "author": {
     "name": "Antonio Gil Espinosa",
     "email": "antonio.gil.espinosa@gmail.com",

package/src/array.ts

@@ -66,4 +66,20 @@ export function remove<T>(array: Array<T>,predicate: Predicate<T>): Array<T> {
     }
 
     return removed;
+}
+
+/**
+ * Adds an element to the array if it's not already present.
+ * The operation mutates the original array.
+ * @template T
+ * @param {Array<T>} array - The array to modify.
+ * @param {T} element - The element to add if absent.
+ * @return {boolean} True if the element was added, false otherwise.
+ */
+export function pushIfAbsent<T>(array: Array<T>, element: T): boolean {
+    if (!array.includes(element)) {
+        array.push(element);
+        return true;
+    }
+    return false;
 }

package/src/index.ts

@@ -1,43 +1,44 @@
-// src/index.ts
-
-// ─── Types ───────────────────────────────────────────
-export * from './types.js';
-export {default as Type} from './type.js';
-export {default as TypeCode} from './type-code.js';
-
-// ─── Utilities ───────────────────────────────────────
-export * from './utilities.js';
-export * from './string.js';
-export * from './math.js';
-export {default as CancellablePromise} from "./cancellable-promise.js";
-
-// ─── Data Structures ────────────────────────────────
-export {default as KeyValuePair} from './key-value-pair.js';
-export {default as Order} from './order.js';
-
-// ─── Async & Timing ─────────────────────────────────
-export {default as Timer} from './timer.js';
-export {default as TimeSpan} from './timespan.js';
-export {default as Stopwatch} from './stopwatch.js';
-export {default as AsyncPoolExecutor} from './async-pool-executor.js';
-
-// ─── Patterns ────────────────────────────────────────
-export {default as Lazy} from './lazy.js';
-export {default as from} from './collections/from.js';
-export {EventBus, Event} from './event-bus.js';
-
-// ─── Draft ────────────────────────────────────────
-export {default as draft} from './draft.js';
-
-// ─── Web ─────────────────────────────────────────────
-export {default as CleanURLSearchParams} from './clean-url-search-params.js';
-/** @deprecated  */
-export {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';
-
-
-
-// ─── Deprecated ──────────────────────────────────────
-/** @deprecated  */
-export * from './array.js';
-/** @deprecated  */
+// src/index.ts
+
+// ─── Types ───────────────────────────────────────────
+export * from './types.js';
+export {default as Type} from './type.js';
+export {default as TypeCode} from './type-code.js';
+
+// ─── Utilities ───────────────────────────────────────
+export * from './utilities.js';
+export * from './string.js';
+export * from './math.js';
+export {default as CancellablePromise} from "./cancellable-promise.js";
+
+// ─── Data Structures ────────────────────────────────
+export {default as KeyValuePair} from './key-value-pair.js';
+export {default as Order} from './order.js';
+
+// ─── Async & Timing ─────────────────────────────────
+export {default as Timer} from './timer.js';
+export {default as TimeSpan} from './timespan.js';
+export {default as Stopwatch} from './stopwatch.js';
+export {default as AsyncPoolExecutor} from './async-pool-executor.js';
+
+// ─── Patterns ────────────────────────────────────────
+export {default as Lazy} from './lazy.js';
+export {default as from} from './collections/from.js';
+export {EventBus, Event} from './event-bus.js';
+export {default as Range} from './range.js';
+
+// ─── Draft ────────────────────────────────────────
+export {default as draft} from './draft.js';
+
+// ─── Web ─────────────────────────────────────────────
+export {default as CleanURLSearchParams} from './clean-url-search-params.js';
+/** @deprecated  */
+export {ajaxSubmit, ajaxSubmission, submitForm, formToObject} from './browser/index.js';
+
+
+
+// ─── Deprecated ──────────────────────────────────────
+/** @deprecated  */
+export * from './array.js';
+/** @deprecated  */
 export * from './collections/index.js';

package/src/range.ts

@@ -0,0 +1,165 @@
+export default class Range<T> {
+
+    private readonly start: T;
+    private readonly end: T;
+
+    /**
+     * Range constructor.
+     * @param start
+     * @param end
+     */
+    constructor(start: T, end: T) {
+        this.start = start;
+        this.end = end;
+    }
+
+    /**
+     * Finds the intersection between two ranges.
+     *
+     * @param other The Range object to intersect with.
+     * @returns The intersected Range object, or null if there is no intersection.
+     */
+    public intersect(other: Range<T>): Range<T> | null {
+        const start = (this.start > other.start) ? this.start : other.start;
+        const end = (this.end < other.end) ? this.end : other.end;
+
+        if (start < end) {
+            return new Range(start, end);
+        } else {
+            return null;
+        }
+    }
+
+    /**
+     * Subtract the given range from this range.
+     *
+     * @param other The range to subtract from this range.
+     * @returns An array of Range objects representing the result of the subtraction.
+     */
+    public subtract(other: Range<T>): Range<T>[] {
+        const result: Range<T>[] = [];
+
+        if (this.start >= other.end || this.end <= other.start) {
+            result.push(new Range(this.start, this.end));
+        } else if (other.start <= this.start && other.end >= this.end) {
+            return result;
+        } else {
+            if (this.start < other.start) {
+                result.push(new Range(this.start, other.start));
+            }
+
+            if (this.end > other.end) {
+                result.push(new Range(other.end, this.end));
+            }
+        }
+
+        return result;
+    }
+
+    /**
+     * Determines if the given range overlaps with the current range.
+     *
+     * @param other The range to be checked for overlap.
+     * @returns Returns true if there is an overlap between the ranges, false otherwise.
+     */
+    public overlaps(other: Range<T>): boolean {
+        const s1 = this.start;
+        const e1 = this.end;
+        const s2 = other.start;
+        const e2 = other.end;
+
+        return (s2 > s1 && s2 < e1 || e2 > s1 && e2 < e1) ||
+            (s1 > s2 && s1 < e2 || e1 > s2 && e1 < e2) ||
+            (s1 === s2 && e1 === e2);
+    }
+
+    /**
+     * Determines whether the specified value is within the range defined by the start and end values.
+     *
+     * @param obj The value to check if it is within the range.
+     * @param inclusive Optional. If set to true, the range boundaries are considered inclusive.
+     * @returns Returns true if the specified value is within the range, false otherwise.
+     */
+    public contains(obj: T, inclusive: boolean = true): boolean {
+        return inclusive ?
+            (this.start <= obj && this.end >= obj) :
+            (this.start < obj && this.end > obj);
+    }
+
+    /**
+     * @returns T
+     */
+    public getStart(): T {
+        return this.start;
+    }
+
+    /**
+     * @returns T
+     */
+    public getEnd(): T {
+        return this.end;
+    }
+
+    /**
+     * Finds the intersection between two sets of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    public static intersectRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {
+        const result: Range<T>[] = [];
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                const intersection = r1.intersect(r2);
+                if (intersection !== null) {
+                    result.push(intersection);
+                }
+            }
+        }
+        return result;
+    }
+
+    /**
+     * Determines if any range in the first set overlaps with any range in the second set.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    public static overlapsAny<T>(ranges1: Range<T>[], ranges2: Range<T>[]): boolean {
+        for (const r1 of ranges1) {
+            for (const r2 of ranges2) {
+                if (r1.overlaps(r2)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+
+    /**
+     * Subtracts the second set of ranges from the first set of ranges.
+     *
+     * @param ranges1
+     * @param ranges2
+     * @returns
+     */
+    public static subtractRanges<T>(ranges1: Range<T>[], ranges2: Range<T>[]): Range<T>[] {
+        let currentRanges = ranges1;
+        for (const r2 of ranges2) {
+            const nextRanges: Range<T>[] = [];
+            for (const r1 of currentRanges) {
+                const subtracted = r1.subtract(r2);
+                for (const s of subtracted) {
+                    nextRanges.push(s);
+                }
+            }
+            currentRanges = nextRanges;
+            if (currentRanges.length === 0) {
+                break;
+            }
+        }
+        return currentRanges;
+    }
+}