ts-data-forge 5.1.0 → 6.0.0

package/README.md

@@ -171,7 +171,7 @@ const maybeValue = Optional.some(42);
 
 const doubled = Optional.map(maybeValue, (x) => x * 2);
 
-assert(Optional.unwrapOr(doubled, 0) === 84);
+assert.isTrue(Optional.unwrapOr(doubled, 0) === 84);
 
 // Result for error handling
 const success = Result.ok(42);
@@ -201,19 +201,19 @@ const handleStatus = (status: Status, data?: string): string =>
         error: 'An error occurred',
     });
 
-assert(handleStatus('loading') === 'Please wait...');
+assert.isTrue(handleStatus('loading') === 'Please wait...');
 
-assert(handleStatus('success', 'Hello') === 'Data: Hello');
+assert.isTrue(handleStatus('success', 'Hello') === 'Data: Hello');
 
-assert(handleStatus('error') === 'An error occurred');
+assert.isTrue(handleStatus('error') === 'An error occurred');
 
 // Pattern matching with Result
 const processResult = (result: Result<number, string>): string =>
     Result.isOk(result) ? `Success: ${result.value}` : `Error: ${result.value}`;
 
-assert(processResult(Result.ok(42)) === 'Success: 42');
+assert.isTrue(processResult(Result.ok(42)) === 'Success: 42');
 
-assert(processResult(Result.err('Failed')) === 'Error: Failed');
+assert.isTrue(processResult(Result.err('Failed')) === 'Error: Failed');
 ```
 
 ### 3. Number Utilities with `Num` and Branded Number Types
@@ -224,34 +224,34 @@ The `Num` object provides safe and convenient functions for numerical operations
 import { Num } from 'ts-data-forge';
 
 // Basic conversions
-assert(Num.from('123') === 123);
+assert.isTrue(Num.from('123') === 123);
 
-assert(Number.isNaN(Num.from('abc')));
+assert.isTrue(Number.isNaN(Num.from('abc')));
 
 // Range checking
 const inRange = Num.isInRange(0, 10);
 
-assert(inRange(5));
+assert.isTrue(inRange(5));
 
-assert(inRange(0)); // (inclusive lower bound)
+assert.isTrue(inRange(0)); // (inclusive lower bound)
 
-assert(!inRange(10)); // (exclusive upper bound)
+assert.isFalse(inRange(10)); // (exclusive upper bound)
 
 // Clamping values
 const clamp = Num.clamp(0, 100);
 
-assert(clamp(150) === 100);
+assert.isTrue(clamp(150) === 100);
 
-assert(clamp(-10) === 0);
+assert.isTrue(clamp(-10) === 0);
 
 // Rounding utilities
 const round2 = Num.round(2);
 
-assert(round2(3.141_59) === 3.14);
+assert.isTrue(round2(3.141_59) === 3.14);
 
-assert(Num.roundAt(3.141_59, 3) === 3.142);
+assert.isTrue(Num.roundAt(3.141_59, 3) === 3.142);
 
-assert(Num.roundToInt(3.7) === 4);
+assert.isTrue(Num.roundToInt(3.7) === 4);
 
 // Type guards
 const value = 5; // example value
@@ -260,7 +260,7 @@ if (Num.isNonZero(value)) {
     // value is guaranteed to be non-zero
     const result = Num.div(10, value); // Safe division
 
-    assert(result === 2);
+    assert.isTrue(result === 2);
 }
 ```
 
@@ -291,13 +291,13 @@ const finite = asFiniteNumber(3.14); // FiniteNumber - finite floating-point
 
 const safeInt = asSafeInt(42); // SafeInt - integer in safe range
 
-assert(integer === 42);
+assert.isTrue(integer === 42);
 
-assert(unsigned === 42);
+assert.isTrue(unsigned === 42);
 
-assert(finite === 3.14);
+assert.isTrue(finite === 3.14);
 
-assert(safeInt === 42);
+assert.isTrue(safeInt === 42);
 
 // This line would cause a runtime error:
 assert.throw(() => {
@@ -309,39 +309,39 @@ const int16 = asInt16(1000); // Int16: [-32768, 32767]
 
 const uint32 = asUint32(3_000_000_000); // Uint32: [0, 4294967295]
 
-assert(int16 === 1000);
+assert.isTrue(int16 === 1000);
 
-assert(uint32 === 3_000_000_000);
+assert.isTrue(uint32 === 3_000_000_000);
 
 // Non-zero and positive variants
 const nonZeroInt = asNonZeroInt(5); // NonZeroInt - excludes zero
 
 const positiveInt = asPositiveInt(10); // PositiveInt - excludes zero and negatives
 
-assert(nonZeroInt === 5);
+assert.isTrue(nonZeroInt === 5);
 
-assert(positiveInt === 10);
+assert.isTrue(positiveInt === 10);
 
 // Type-safe arithmetic with automatic clamping
 const sum = Int16.add(int16, asInt16(2000)); // Int16 (3000)
 
 const clamped = Int16.clamp(100_000); // Int16 (32767 - clamped to MAX_VALUE)
 
-assert(sum === 3000);
+assert.isTrue(sum === 3000);
 
-assert(clamped === 32_767);
+assert.isTrue(clamped === 32_767);
 
 // Safe division with non-zero types
 const ratio = NonZeroInt.div(asNonZeroInt(10), nonZeroInt); // No division by zero risk
 
-assert(ratio === 2);
+assert.isTrue(ratio === 2);
 
 // Random generation within type constraints
 const randomInt16 = Int16.random(); // Int16 (random value in valid range)
 
-assert(-32_768 <= randomInt16);
+assert.isTrue(-32_768 <= randomInt16);
 
-assert(randomInt16 <= 32_767);
+assert.isTrue(randomInt16 <= 32_767);
 ```
 
 ### 4. Array Utilities with `Arr`
@@ -356,14 +356,14 @@ const numbers: readonly number[] = [1, 2, 3, 4, 5, 2, 3];
 // Reduction
 const sum = Arr.sum(numbers);
 
-assert(sum === 20);
+assert.isTrue(sum === 20);
 
 // Type-safe length checking
 if (Arr.isArrayAtLeastLength(numbers, 2)) {
     // numbers is now guaranteed to have at least 2 elements
     expectType<typeof numbers, readonly [number, number, ...number[]]>('=');
 
-    assert(numbers[1] === 2); // Safe access to index 1
+    assert.isTrue(numbers[1] === 2); // Safe access to index 1
 }
 
 // Take first n elements
@@ -400,7 +400,7 @@ assert.deepStrictEqual(
 );
 
 if (Optional.isSome(oldestPerson)) {
-    assert(oldestPerson.value.name === 'Charlie');
+    assert.isTrue(oldestPerson.value.name === 'Charlie');
 }
 ```
 
@@ -419,11 +419,11 @@ const mapWithOne = originalMap.set('one', 1);
 const mapWithTwo = mapWithOne.set('two', 2);
 
 // Original map is unchanged
-assert(originalMap.size === 0);
+assert.isTrue(originalMap.size === 0);
 
 assert.deepStrictEqual(mapWithTwo.get('one'), Optional.some(1));
 
-assert(!mapWithTwo.has('three'));
+assert.isFalse(mapWithTwo.has('three'));
 
 // Using pipe for fluent updates
 const sequence = Arr.seq(10); // [0, 1, 2, ..., 9]
@@ -436,7 +436,7 @@ const skipped = Arr.skip(pairs, 1); // [[1, "1"], ..., [9, "9"]]
 
 const idMap = IMap.create<number, string>(skipped);
 
-assert(idMap.size === 9);
+assert.isTrue(idMap.size === 9);
 
 // Efficient batch updates with withMutations
 const idMapUpdated = idMap.withMutations([
@@ -445,18 +445,18 @@ const idMapUpdated = idMap.withMutations([
     { type: 'delete', key: 4 },
 ]);
 
-assert(idMapUpdated.size === 9);
+assert.isTrue(idMapUpdated.size === 9);
 
 // ISet usage
 const originalSet = ISet.create<number>([]);
 
 const setWithItems = originalSet.add(1).add(2).add(1); // Duplicate ignored
 
-assert(originalSet.size === 0); // (unchanged)
+assert.isTrue(originalSet.size === 0); // (unchanged)
 
-assert(setWithItems.has(1));
+assert.isTrue(setWithItems.has(1));
 
-assert(setWithItems.size === 2);
+assert.isTrue(setWithItems.size === 2);
 ```
 
 ### 6. Type Guards
@@ -488,11 +488,11 @@ if (isNonNullObject(value)) {
 }
 
 // Example usage
-assert(processData({ name: 'Alice' }) === 'Hello, Alice!');
+assert.isTrue(processData({ name: 'Alice' }) === 'Hello, Alice!');
 
-assert(processData({ age: 30 }) === undefined);
+assert.isTrue(processData({ age: 30 }) === undefined);
 
-assert(processData('not an object') === undefined);
+assert.isTrue(processData('not an object') === undefined);
 ```
 
 ### 7. Iteration with `range`
@@ -591,6 +591,8 @@ assert.deepStrictEqual(initialState.items, ['item1', 'item2']);
 assert.deepStrictEqual(updatedState.items, ['newItem1', 'newItem2']);
 ```
 
+**Note**: While [immer](https://immerjs.github.io/immer/) provides `castDraft` with similar usage, it recursively converts types to mutable, resulting in a more complex (fat) type implementation. When you only need shallow mutability conversion, using `castMutable` can potentially reduce type-checking computation overhead.
+
 ## Modules Overview
 
 - **`expect-type`**: Compile-time type assertion utilities for testing and verification.
@@ -609,7 +611,7 @@ assert.deepStrictEqual(updatedState.items, ['newItem1', 'newItem2']);
 - **Type Safety**: All utilities are designed with TypeScript's type system in mind, providing compile-time guarantees.
 - **Immutability**: Data structures and operations promote immutable patterns for safer, more predictable code.
 - **Functional Programming**: Support for functional programming paradigms with utilities like `Optional`, `Result`, and `pipe`.
-- **Zero Runtime Dependencies**: The library has no external runtime dependencies, keeping your bundle size minimal.
+- **Zero Runtime Dependencies**: The library has no external runtime dependencies except for [@sindresorhus/is](https://github.com/sindresorhus/is), keeping your bundle size minimal.
 - **Comprehensive Testing**: All utilities are thoroughly tested with both runtime and compile-time tests.
 
 **Important Notes:**

package/dist/array/impl/array-utils-modification.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"array-utils-modification.d.mts","sourceRoot":"","sources":["../../../src/array/impl/array-utils-modification.mts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;GAYG;AACH,wBAAgB,GAAG,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAC3E,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC,EACxB,QAAQ,EAAE,CAAC,GACV,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACjC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAC7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAGlC,wBAAgB,GAAG,CAAC,KAAK,CAAC,CAAC,EACzB,KAAK,EAAE,QAAQ,CAAC,MAAM,EACtB,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAC7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAuBlC;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,SAAS,CACvB,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACnC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAEpB,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC,EACxB,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAC/B,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACjC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAC7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAGlC,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,EACtC,KAAK,EAAE,QAAQ,CAAC,MAAM,EACtB,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GACtB,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,CAAC,EAAE,EAC/B,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAC7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AA2BlC;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,UAAU,CACxB,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACnC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAEpB,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,yBAAyB,CAAC,EAAE,CAAC,EACpC,QAAQ,EAAE,CAAC,GACV,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACjC,aAAa,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GACpE,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAGlC,wBAAgB,UAAU,CAAC,KAAK,CAAC,CAAC,EAChC,KAAK,EAAE,QAAQ,CAAC,kBAAkB,EAClC,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,aAAa,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GACpE,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AA+BlC,KAAK,YAAY,CAAC,CAAC,IAAI,CAAC,SAAS,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC;AAEpD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC3D,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,yBAAyB,CAAC,EAAE,CAAC,GACnC,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;AAEzB,wBAAgB,SAAS,CACvB,KAAK,EAAE,QAAQ,CAAC,kBAAkB,GACjC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,CAAC;AAsB5C;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACnE,KAAK,EAAE,EAAE,EACT,QAAQ,EAAE,CAAC,GACV,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AAEvB,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAC9B,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AAwB3E;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACtE,KAAK,EAAE,EAAE,EACT,QAAQ,EAAE,CAAC,GACV,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAEvB,wBAAgB,WAAW,CAAC,KAAK,CAAC,CAAC,EACjC,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAqB3E;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACnE,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,CAAC,GACP,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACjC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,GAC9B,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,CAAC,CAAC,GAChB,SAAS,CAAC,EAAE,CAAC;AAGnB,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAC9B,KAAK,EAAE,CAAC,GACP,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,GAC9B,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,CAAC,CAAC,GAChB,SAAS,CAAC,EAAE,CAAC;AAoBnB;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACxE,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,SAAS;IAClB,KAAK,EAAE,yBAAyB,CAAC,EAAE,CAAC;IACpC,GAAG,EAAE,yBAAyB,CAAC,EAAE,CAAC;CACnC,GACA,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACjC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAC3C,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAC7B,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;AAGlC,wBAAgB,aAAa,CAAC,KAAK,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,SAAS;IAClB,KAAK,EAAE,QAAQ,CAAC,kBAAkB;IAClC,GAAG,EAAE,QAAQ,CAAC,kBAAkB;CACjC,GACA,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAC3C,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAC7B,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC"}
+{"version":3,"file":"array-utils-modification.d.mts","sourceRoot":"","sources":["../../../src/array/impl/array-utils-modification.mts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;GAYG;AACH,wBAAgB,GAAG,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAC3E,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC,EACxB,QAAQ,EAAE,CAAC,GACV,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEjC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAE/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAE7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAGlC,wBAAgB,GAAG,CAAC,KAAK,CAAC,CAAC,EACzB,KAAK,EAAE,QAAQ,CAAC,MAAM,EACtB,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEnC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAE/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAE7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAuBlC;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,SAAS,CACvB,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACnC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAEpB,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC,EACxB,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAC/B,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEjC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAE/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAE7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAGlC,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,EACtC,KAAK,EAAE,QAAQ,CAAC,MAAM,EACtB,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GACtB,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,CAAC,EAAE,EAC/B,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,QAAQ,CAAC;KAAG,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC,GACxC,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAC7B,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AA2BlC;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,UAAU,CACxB,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACnC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAEpB,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,yBAAyB,CAAC,EAAE,CAAC,EACpC,QAAQ,EAAE,CAAC,GACV,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEjC,aAAa,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAEpE,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAGlC,wBAAgB,UAAU,CAAC,KAAK,CAAC,CAAC,EAChC,KAAK,EAAE,QAAQ,CAAC,kBAAkB,EAClC,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEnC,aAAa,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAEpE,aAAa,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AA+BlC,KAAK,YAAY,CAAC,CAAC,IAAI,CAAC,SAAS,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC;AAEpD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAC3D,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,yBAAyB,CAAC,EAAE,CAAC,GACnC,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;AAEzB,wBAAgB,SAAS,CACvB,KAAK,EAAE,QAAQ,CAAC,kBAAkB,GACjC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,CAAC;AAsB5C;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACnE,KAAK,EAAE,EAAE,EACT,QAAQ,EAAE,CAAC,GACV,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AAEvB,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAC9B,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AAwB3E;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACtE,KAAK,EAAE,EAAE,EACT,QAAQ,EAAE,CAAC,GACV,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAEvB,wBAAgB,WAAW,CAAC,KAAK,CAAC,CAAC,EACjC,QAAQ,EAAE,CAAC,GACV,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAqB3E;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACnE,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,CAAC,GACP,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACjC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,GAC9B,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,CAAC,CAAC,GAChB,SAAS,CAAC,EAAE,CAAC;AAGnB,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAC9B,KAAK,EAAE,CAAC,GACP,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GACnC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,GAC9B,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAC/B,aAAa,CAAC,CAAC,CAAC,GAChB,SAAS,CAAC,EAAE,CAAC;AAoBnB;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,EACxE,KAAK,EAAE,EAAE,EACT,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,SAAS;IAClB,KAAK,EAAE,yBAAyB,CAAC,EAAE,CAAC;IACpC,GAAG,EAAE,yBAAyB,CAAC,EAAE,CAAC;CACnC,GACA,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEjC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAC3C,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAE/B,aAAa,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAE7B,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;AAGlC,wBAAgB,aAAa,CAAC,KAAK,CAAC,CAAC,EACnC,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,SAAS;IAClB,KAAK,EAAE,QAAQ,CAAC,kBAAkB;IAClC,GAAG,EAAE,QAAQ,CAAC,kBAAkB;CACjC,GACA,CAAC,KAAK,CAAC,EAAE,SAAS,SAAS,OAAO,EAAE,EACrC,KAAK,EAAE,EAAE,KACN,iBAAiB,CAAC,EAAE,CAAC,SAAS,IAAI,GAEnC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAC3C,EAAE,SAAS,aAAa,CAAC,OAAO,CAAC,GAE/B,aAAa,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,GAE7B,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC"}

package/dist/array/impl/array-utils-modification.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"array-utils-modification.mjs","sources":["../../../src/array/impl/array-utils-modification.mts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCM,SAAU,GAAG,CACjB,GAAG,IAE+C,EAAA;AAElD,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;YAGrC,OAAQ,KAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC;QACnD;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;AAE9B,YAAA,OAAO,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC;QAC/C;;AAEJ;AA+CM,SAAU,SAAS,CACvB,GAAG,IAM2D,EAAA;AAE9D,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,IAAI;;AAGpC,YAAA,OAAQ,KAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,CAAC;QACjE;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,IAAI;AAE7B,YAAA,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC;QACpD;;AAEJ;AAwCM,SAAU,UAAU,CACxB,GAAG,IAM2D,EAAA;AAE9D,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;YAGrC,OAAQ,KAA4B,CAAC,SAAS,CAC5C,KAAK,EACL,CAAC,EACD,QAAQ,CAC0B;QACtC;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;AAE9B,YAAA,OAAO,CAAC,KAAK,KAAK,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC;QACtD;;AAEJ;AA8BM,SAAU,SAAS,CACvB,GAAG,IAE8C,EAAA;AAEjD,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI;YAE3B,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QAClC;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;YAEpB,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC;QAC3C;;AAEJ;AA4BM,SAAU,QAAQ,CACtB,GAAG,IAAgE,EAAA;AAEnE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;AAG9B,YAAA,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAG/C;QACH;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI;YAEvB,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;QAC7C;;AAEJ;AA4BM,SAAU,WAAW,CACzB,GAAG,IAAgE,EAAA;AAEnE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;YAG9B,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAmC;QAC1E;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI;YAEvB,OAAO,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC;QAChD;;AAEJ;AAuCM,SAAU,QAAQ,CACtB,GAAG,IAAoE,EAAA;AAEvE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI;YAE3B,OAAO,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC;QACtD;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;YAEpB,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;QAC1C;;AAEJ;AA+CM,SAAU,aAAa,CAC3B,GAAG,IAeE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;YAEzC,MAAM,MAAM,GAAc,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAElD,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC;AAE9B,YAAA,OAAO,MAAM;QACf;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAE/B,YAAA,OAAO,CAAC,KAAK,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC;QAC1D;;AAEJ;;;;"}
+{"version":3,"file":"array-utils-modification.mjs","sources":["../../../src/array/impl/array-utils-modification.mts"],"sourcesContent":[null],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CM,SAAU,GAAG,CACjB,GAAG,IAE+C,EAAA;AAElD,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;YAGrC,OAAQ,KAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC;QACnD;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;AAE9B,YAAA,OAAO,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC;QAC/C;;AAEJ;AAkDM,SAAU,SAAS,CACvB,GAAG,IAM2D,EAAA;AAE9D,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,IAAI;;AAGpC,YAAA,OAAQ,KAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,CAAC;QACjE;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,IAAI;AAE7B,YAAA,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC;QACpD;;AAEJ;AA4CM,SAAU,UAAU,CACxB,GAAG,IAM2D,EAAA;AAE9D,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;YACN,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;YAGrC,OAAQ,KAA4B,CAAC,SAAS,CAC5C,KAAK,EACL,CAAC,EACD,QAAQ,CAC0B;QACtC;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;AAE9B,YAAA,OAAO,CAAC,KAAK,KAAK,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC;QACtD;;AAEJ;AA8BM,SAAU,SAAS,CACvB,GAAG,IAE8C,EAAA;AAEjD,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI;YAE3B,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QAClC;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;YAEpB,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC;QAC3C;;AAEJ;AA4BM,SAAU,QAAQ,CACtB,GAAG,IAAgE,EAAA;AAEnE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;AAG9B,YAAA,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAG/C;QACH;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI;YAEvB,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;QAC7C;;AAEJ;AA4BM,SAAU,WAAW,CACzB,GAAG,IAAgE,EAAA;AAEnE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI;;YAG9B,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAmC;QAC1E;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI;YAEvB,OAAO,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC;QAChD;;AAEJ;AAuCM,SAAU,QAAQ,CACtB,GAAG,IAAoE,EAAA;AAEvE,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAI;YAE3B,OAAO,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC;QACtD;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;YAEpB,OAAO,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;QAC1C;;AAEJ;AAqDM,SAAU,aAAa,CAC3B,GAAG,IAeE,EAAA;AAEL,IAAA,QAAQ,IAAI,CAAC,MAAM;QACjB,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;YAEzC,MAAM,MAAM,GAAc,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAElD,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC;AAE9B,YAAA,OAAO,MAAM;QACf;QAEA,KAAK,CAAC,EAAE;AACN,YAAA,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,GAAG,IAAI;AAE/B,YAAA,OAAO,CAAC,KAAK,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC;QAC1D;;AAEJ;;;;"}

package/dist/array/impl/array-utils-reducing-value.d.mts

@@ -109,9 +109,9 @@ export declare function maxBy<const Ar extends readonly unknown[], V>(array: Ar,
  *
  * const withCurried = Arr.count<string>((word) => word.includes('a'))(words);
  *
- * assert(longWords === 2);
+ * assert.isTrue(longWords === 2);
  *
- * assert(withCurried === 2);
+ * assert.isTrue(withCurried === 2);
  * ```
  */
 export declare function count<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>) => boolean): SizeType.Arr;
@@ -150,9 +150,9 @@ export declare function countBy<E, G extends MapSetKeyType>(grouper: (value: E,
  *   'items',
  * )(words);
  *
- * assert(totalLength === 11);
+ * assert.isTrue(totalLength === 11);
  *
- * assert(concat === 'items-Ada-Lovelace');
+ * assert.isTrue(concat === 'items-Ada-Lovelace');
  * ```
  */
 export declare function foldl<const Ar extends readonly unknown[], P>(array: Ar, callbackfn: (previousValue: P, currentValue: Ar[number], currentIndex: ArrayIndex<Ar>) => P, initialValue: P): P;
@@ -172,9 +172,9 @@ export declare function foldl<E, P>(callbackfn: (previousValue: P, currentValue:
  *   '',
  * )(numbers);
  *
- * assert(subtractRight === -6);
+ * assert.isTrue(subtractRight === -6);
  *
- * assert(joinFromRight === '321');
+ * assert.isTrue(joinFromRight === '321');
  * ```
  */
 export declare function foldr<const Ar extends readonly unknown[], P>(array: Ar, callbackfn: (previousValue: P, currentValue: Ar[number], currentIndex: ArrayIndex<Ar>) => P, initialValue: P): P;
@@ -193,9 +193,9 @@ export declare function foldr<E, P>(callbackfn: (previousValue: P, currentValue:
  *
  * const totalNegatives = Arr.sum(negatives);
  *
- * assert(total === 10);
+ * assert.isTrue(total === 10);
  *
- * assert(totalNegatives === 6);
+ * assert.isTrue(totalNegatives === 6);
  * ```
  */
 export declare function sum(array: readonly []): 0;

package/dist/array/impl/array-utils-search.d.mts

@@ -56,9 +56,9 @@ export declare function findLast<E>(predicate: (value: E, index: SizeType.Arr, a
  *   letters,
  * );
  *
- * assert(indexOfB === 1);
+ * assert.isTrue(indexOfB === 1);
  *
- * assert(indexOfMissing === -1);
+ * assert.isTrue(indexOfMissing === -1);
  * ```
  */
 export declare function findIndex<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean): ArrayIndex<Ar> | -1;
@@ -76,9 +76,9 @@ export declare function findIndex<E>(predicate: (value: E, index: SizeType.Arr,
  * // eslint-disable-next-line unicorn/prefer-array-index-of
  * const notFound = Arr.findLastIndex<string>((letter) => letter === 'z')(letters);
  *
- * assert(lastIndexOfB === 3);
+ * assert.isTrue(lastIndexOfB === 3);
  *
- * assert(notFound === -1);
+ * assert.isTrue(notFound === -1);
  * ```
  */
 export declare function findLastIndex<const Ar extends readonly unknown[]>(array: Ar, predicate: (value: Ar[number], index: ArrayIndex<Ar>, arr: Ar) => boolean): ArrayIndex<Ar> | -1;

package/dist/array/impl/array-utils-set-op.d.mts

@@ -10,9 +10,9 @@
  *
  * const differentNumbers = [1, 2, 4] as const;
  *
- * assert.ok(Arr.eq(numbers, sameNumbers));
+ * assert.isTrue(Arr.eq(numbers, sameNumbers));
  *
- * assert.notOk(Arr.eq(numbers, differentNumbers));
+ * assert.isFalse(Arr.eq(numbers, differentNumbers));
  * ```
  */
 export declare const eq: <E>(array1: readonly E[], array2: readonly E[], equality?: (a: E, b: E) => boolean) => boolean;
@@ -34,9 +34,9 @@ export declare const equal: <E>(array1: readonly E[], array2: readonly E[], equa
  *
  * const notSubset = [2, 4] as const;
  *
- * assert.ok(Arr.isSubset(subset, superset));
+ * assert.isTrue(Arr.isSubset(subset, superset));
  *
- * assert.notOk(Arr.isSubset(notSubset, superset));
+ * assert.isFalse(Arr.isSubset(notSubset, superset));
  * ```
  */
 export declare const isSubset: <E1 extends Primitive, E2 extends Primitive = E1>(array1: readonly E1[], array2: readonly E2[]) => boolean;
@@ -52,11 +52,11 @@ export declare const isSubset: <E1 extends Primitive, E2 extends Primitive = E1>
  *
  * const notSuperset = ['a', 'd'] as const;
  *
- * assert.ok(Arr.isSuperset(potentialSuperset, subset));
+ * assert.isTrue(Arr.isSuperset(potentialSuperset, subset));
  *
- * assert.notOk(Arr.isSuperset(subset, potentialSuperset));
+ * assert.isFalse(Arr.isSuperset(subset, potentialSuperset));
  *
- * assert.notOk(Arr.isSuperset(potentialSuperset, notSuperset));
+ * assert.isFalse(Arr.isSuperset(potentialSuperset, notSuperset));
  * ```
  */
 export declare const isSuperset: <E1 extends Primitive, E2 extends Primitive = E1>(array1: readonly E1[], array2: readonly E2[]) => boolean;

package/dist/array/impl/array-utils-set-op.mjs

@@ -10,9 +10,9 @@
  *
  * const differentNumbers = [1, 2, 4] as const;
  *
- * assert.ok(Arr.eq(numbers, sameNumbers));
+ * assert.isTrue(Arr.eq(numbers, sameNumbers));
  *
- * assert.notOk(Arr.eq(numbers, differentNumbers));
+ * assert.isFalse(Arr.eq(numbers, differentNumbers));
  * ```
  */
 const eq = (array1, array2, equality = Object.is) => array1.length === array2.length &&
@@ -36,9 +36,9 @@ const equal = eq;
  *
  * const notSubset = [2, 4] as const;
  *
- * assert.ok(Arr.isSubset(subset, superset));
+ * assert.isTrue(Arr.isSubset(subset, superset));
  *
- * assert.notOk(Arr.isSubset(notSubset, superset));
+ * assert.isFalse(Arr.isSubset(notSubset, superset));
  * ```
  */
 const isSubset = (array1, array2) => array1.every((a) => 
@@ -56,11 +56,11 @@ array2.includes(a));
  *
  * const notSuperset = ['a', 'd'] as const;
  *
- * assert.ok(Arr.isSuperset(potentialSuperset, subset));
+ * assert.isTrue(Arr.isSuperset(potentialSuperset, subset));
  *
- * assert.notOk(Arr.isSuperset(subset, potentialSuperset));
+ * assert.isFalse(Arr.isSuperset(subset, potentialSuperset));
  *
- * assert.notOk(Arr.isSuperset(potentialSuperset, notSuperset));
+ * assert.isFalse(Arr.isSuperset(potentialSuperset, notSuperset));
  * ```
  */
 const isSuperset = (array1, array2) => isSubset(array2, array1);

package/dist/array/impl/array-utils-size.d.mts

@@ -12,9 +12,9 @@
  *
  * const sizeOfLetters = Arr.size(letters);
  *
- * assert(sizeOfNumbers === 3);
+ * assert.isTrue(sizeOfNumbers === 3);
  *
- * assert(sizeOfLetters === 0);
+ * assert.isTrue(sizeOfLetters === 0);
  * ```
  */
 export declare const size: <const Ar extends readonly unknown[]>(array: Ar) => Ar extends NonEmptyArray<unknown> ? IntersectBrand<PositiveNumber, SizeType.Arr> : SizeType.Arr;

package/dist/array/impl/array-utils-size.mjs

@@ -12,9 +12,9 @@
  *
  * const sizeOfLetters = Arr.size(letters);
  *
- * assert(sizeOfNumbers === 3);
+ * assert.isTrue(sizeOfNumbers === 3);
  *
- * assert(sizeOfLetters === 0);
+ * assert.isTrue(sizeOfLetters === 0);
  * ```
  */
 const size = (array) => 

package/dist/array/impl/array-utils-slicing.d.mts

@@ -11,7 +11,7 @@
  *
  *   assert.deepStrictEqual(remainder, ['Grace', 'Katherine']);
  *
- *   assert(remainder.length === 2);
+ *   assert.isTrue(remainder.length === 2);
  * }
  *
  * {
@@ -40,7 +40,7 @@ export declare const tail: <const Ar extends readonly unknown[]>(array: Ar) => L
  *
  * assert.deepStrictEqual(withoutLast, ['task-1', 'task-2']);
  *
- * assert(withoutLast.length === 2);
+ * assert.isTrue(withoutLast.length === 2);
  * ```
  */
 export declare const butLast: <const Ar extends readonly unknown[]>(array: Ar) => List.ButLast<Ar>;

package/dist/array/impl/array-utils-slicing.mjs

@@ -45,7 +45,7 @@ import { isEmpty } from './array-utils-validation.mjs';
  *
  *   assert.deepStrictEqual(remainder, ['Grace', 'Katherine']);
  *
- *   assert(remainder.length === 2);
+ *   assert.isTrue(remainder.length === 2);
  * }
  *
  * {
@@ -76,7 +76,7 @@ array.slice(1);
  *
  * assert.deepStrictEqual(withoutLast, ['task-1', 'task-2']);
  *
- * assert(withoutLast.length === 2);
+ * assert.isTrue(withoutLast.length === 2);
  * ```
  */
 const butLast = (array) => 

package/dist/array/impl/array-utils-validation.d.mts

@@ -8,9 +8,9 @@
  *
  * const maybeValue: unknown = 'Ada';
  *
- * assert.ok(Arr.isArray(maybeArray));
+ * assert.isTrue(Arr.isArray(maybeArray));
  *
- * assert.notOk(Arr.isArray(maybeValue));
+ * assert.isFalse(Arr.isArray(maybeValue));
  *
  * if (Arr.isArray(maybeArray)) {
  *   assert.deepStrictEqual(maybeArray, [1, 2, 3]);
@@ -30,9 +30,9 @@ type Cast<A, B> = A extends B ? A : never;
  *
  * const words = ['Ada', 'Lovelace'] as const;
  *
- * assert.ok(Arr.isEmpty(emptyNumbers));
+ * assert.isTrue(Arr.isEmpty(emptyNumbers));
  *
- * assert.notOk(Arr.isEmpty(words));
+ * assert.isFalse(Arr.isEmpty(words));
  *
  * if (Arr.isEmpty(emptyNumbers)) {
  *   assert.deepStrictEqual(emptyNumbers, []);
@@ -50,9 +50,9 @@ export declare const isEmpty: <E>(array: readonly E[]) => array is readonly [];
  *
  * const emptyUsers: readonly { id: number }[] = [];
  *
- * assert.ok(Arr.isNonEmpty(users));
+ * assert.isTrue(Arr.isNonEmpty(users));
  *
- * assert.notOk(Arr.isNonEmpty(emptyUsers));
+ * assert.isFalse(Arr.isNonEmpty(emptyUsers));
  *
  * if (Arr.isNonEmpty(users)) {
  *   assert.deepStrictEqual(users[0], { id: 1 });
@@ -70,9 +70,9 @@ export declare const isNonEmpty: <E>(array: readonly E[]) => array is NonEmptyAr
  *
  * const triple: readonly number[] = [1, 2, 3];
  *
- * assert.ok(Arr.isArrayOfLength(pair, 2));
+ * assert.isTrue(Arr.isArrayOfLength(pair, 2));
  *
- * assert.notOk(Arr.isArrayOfLength(triple, 2));
+ * assert.isFalse(Arr.isArrayOfLength(triple, 2));
  *
  * if (Arr.isArrayOfLength(pair, 2)) {
  *   assert.deepStrictEqual(pair, [1, 2]);
@@ -90,12 +90,12 @@ export declare const isArrayOfLength: <E, N extends SizeType.ArgArr>(array: read
  *
  * const emptyQueue: readonly string[] = [];
  *
- * assert.ok(Arr.isArrayAtLeastLength(queue, 1));
+ * assert.isTrue(Arr.isArrayAtLeastLength(queue, 1));
  *
- * assert.notOk(Arr.isArrayAtLeastLength(emptyQueue, 1));
+ * assert.isFalse(Arr.isArrayAtLeastLength(emptyQueue, 1));
  *
  * if (Arr.isArrayAtLeastLength(queue, 1)) {
- *   assert(queue[0] === 'task-1');
+ *   assert.isTrue(queue[0] === 'task-1');
  * }
  * ```
  */
@@ -114,9 +114,9 @@ export declare const isArrayAtLeastLength: <E, N extends SizeType.ArgArr>(array:
  *
  * const allStartWithA = Arr.every(words, (value) => value.startsWith('A'));
  *
- * assert.ok(allEven);
+ * assert.isTrue(allEven);
  *
- * assert.notOk(allStartWithA);
+ * assert.isFalse(allStartWithA);
  * ```
  */
 export declare function every<E, S extends E>(array: readonly E[], predicate: (a: E, index: SizeType.Arr) => a is S): array is readonly S[];
@@ -137,9 +137,9 @@ export declare function every<E>(predicate: (a: E, index: SizeType.Arr) => boole
  *
  * const hasShortName = Arr.some(words, (value) => value.length <= 3);
  *
- * assert.notOk(hasEven);
+ * assert.isFalse(hasEven);
  *
- * assert.ok(hasShortName);
+ * assert.isTrue(hasShortName);
  * ```
  */
 export declare function some<const Ar extends readonly unknown[]>(array: Ar, predicate: (a: Ar[number], index: ArrayIndex<Ar>) => boolean): boolean;
@@ -152,12 +152,12 @@ export declare function some<E>(predicate: (a: E, index: SizeType.Arr) => boolea
  * ```ts
  * const items = ['Ada', 'Grace', 'Katherine'] as const;
  *
- * assert.ok(Arr.indexIsInRange(items, 1));
+ * assert.isTrue(Arr.indexIsInRange(items, 1));
  *
- * assert.notOk(Arr.indexIsInRange(items, 3));
+ * assert.isFalse(Arr.indexIsInRange(items, 3));
  *
  * if (Arr.indexIsInRange(items, 2)) {
- *   assert(items[2] === 'Katherine');
+ *   assert.isTrue(items[2] === 'Katherine');
  * }
  * ```
  */