iterable-linq-utility 0.2.0 → 0.4.0

package/README.md

@@ -1,6 +1,9 @@
-[![](https://data.jsdelivr.com/v1/package/npm/iterable-linq-utility/badge)](https://www.jsdelivr.com/package/npm/iterable-linq-utility)
-[![](https://img.shields.io/npm/v/iterable-linq-utility.svg)](https://npmjs.org/package/iterable-linq-utility)
-[![](https://img.shields.io/npm/dm/iterable-linq-utility.svg)](https://npmjs.org/package/iterable-linq-utility)
+| | |
+| --- | --- |
+| **Package** | [![npm version](https://img.shields.io/npm/v/iterable-linq-utility.svg)](https://npmjs.org/package/iterable-linq-utility) [![npm downloads](https://img.shields.io/npm/dm/iterable-linq-utility.svg)](https://npmjs.org/package/iterable-linq-utility) [![jsDelivr hits](https://data.jsdelivr.com/v1/package/npm/iterable-linq-utility/badge)](https://www.jsdelivr.com/package/npm/iterable-linq-utility) |
+| **Quality** | [![CI status](https://github.com/Amebus/iterable-linq-utility/actions/workflows/build-test.yml/badge.svg?branch=main&event=push)](https://github.com/Amebus/iterable-linq-utility/actions/workflows/build-test.yml?query=branch%3Amain+event%3Apush) [![Coverage](https://codecov.io/gh/Amebus/iterable-linq-utility/branch/main/graph/badge.svg)](https://codecov.io/gh/Amebus/iterable-linq-utility) |
+| **Activity** | [![Commits since the latest release](https://img.shields.io/github/commits-since/Amebus/iterable-linq-utility/latest)](https://amebus.github.io/iterable-linq-utility/next/) [![Latest release date](https://img.shields.io/github/release-date/Amebus/iterable-linq-utility)](https://github.com/Amebus/iterable-linq-utility/releases/latest) [![Open issues](https://img.shields.io/github/issues/Amebus/iterable-linq-utility)](https://github.com/Amebus/iterable-linq-utility/issues) [![Open pull requests](https://img.shields.io/github/issues-pr/Amebus/iterable-linq-utility)](https://github.com/Amebus/iterable-linq-utility/pulls) |
+| **Community** | [![GitHub stars](https://img.shields.io/github/stars/Amebus/iterable-linq-utility)](https://github.com/Amebus/iterable-linq-utility/stargazers) [![Forks](https://img.shields.io/github/forks/Amebus/iterable-linq-utility)](https://github.com/Amebus/iterable-linq-utility/forks) |
 
 A [.NET Linq to Objects](https://learn.microsoft.com/it-it/dotnet/csharp/programming-guide/concepts/linq/linq-to-objects) porting with javacript naming conventions (e.g.: `Select` as been ranamed to `map`) and some new features (e.g.: [memoize](https://amebus.github.io/iterable-linq-utility/api-reference/transformations.md#memoize) and [materialize](https://amebus.github.io/iterable-linq-utility/api-reference/actions.md#materialize)).
 
@@ -85,11 +88,11 @@ A difference smaller than the `rme` of the two rows is noise.
 Create `test/bench/functions/<name>.bench.ts` or `test/bench/chains/<scenario>.bench.ts`:
 
 ```ts
-import * as IterableLinq from 'iterable-linq-utility';
 import { test } from 'vitest';
-
 import * as Helpers from '../helpers';
 
+import * as IterableLinq from 'iterable-linq-utility';
+
 // Read the exports once: an imported binding goes through a module runner getter on every read.
 const { from } = IterableLinq;
 const { cases, numbers, sum } = Helpers;

package/dist/index.d.cts

@@ -98,6 +98,24 @@ declare function empty_2<T>(): Iterable<T>;
  */
 export declare function extend<K extends Extract<keyof IIterableLinq<unknown>, string>>(name: K, implementation: ChainMethod): void;
 
+/**
+ * Lazily keeps the values accepted by a type guard and narrows their type.
+ * If `predicate` throws, the source is closed and the error propagates.
+ * @operation `Transformation`
+ * @param iterable - the source `Iterable`
+ * @param predicate - a type guard called with each value and its index; return `true` to keep the value
+ * @returns a lazy, re-runnable `Iterable` of the narrowed values
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `predicate` is not a function
+ * @example
+ * ```ts
+ * const values: (number | string)[] = [1, 'two', 3];
+ * const strings = Functions.filter(values, (v): v is string => typeof v === 'string');
+ * Array.from(strings); // string[], ['two']
+ * ```
+ * @since 0.4.0
+ */
+declare function filter<T, S extends T>(iterable: Iterable<T>, predicate: (value: T, index: number) => value is S): Iterable<S>;
+
 /**
  * Lazily keeps only the values that satisfy `predicate`.
  * If `predicate` throws, the source is closed and the error propagates.
@@ -241,7 +259,9 @@ declare namespace Functions {
         range,
         reduce,
         repeat_2 as repeat,
+        skip,
         some,
+        take,
         tap,
         tapChain
     }
@@ -294,6 +314,21 @@ export declare interface IIterableLinqBase<T> {
      * @since 0.0.1
      */
     collectToArray(): T[];
+    /**
+     * Keeps the values accepted by a type guard and narrows their type.
+     * If `predicate` throws, the source is closed and the error propagates.
+     * @operation `Transformation`
+     * @param predicate - a type guard called with each value and its index; return `true` to keep the value
+     * @returns a new chain with the narrowed values
+     * @throws Error if `predicate` is not a function
+     * @example
+     * ```ts
+     * const values: (number | string)[] = [1, 'two', 3];
+     * IterableLinq.from(values).filter((v): v is string => typeof v === 'string').collectToArray(); // string[], ['two']
+     * ```
+     * @since 0.4.0
+     */
+    filter<S extends T>(predicate: (value: T, index: number) => value is S): IIterableLinq<S>;
     /**
      * Keeps only the values that satisfy `predicate`.
      * If `predicate` throws, the source is closed and the error propagates.
@@ -460,19 +495,57 @@ export declare interface IIterableLinqBase<T> {
      * @since 0.0.10
      */
     reduce<R>(neutralElement: R, reducer: Reducer<T, R>): R;
+    /**
+     * Lazily skips the first `count` values and yields the rest.
+     * @operation `Transformation`
+     * @param count - how many values to skip; must be a non-negative integer
+     * @returns a lazy, re-runnable chain of the remaining values
+     * @throws Error if `count` is negative, not an integer, `NaN` or `Infinity`
+     * @example
+     * ```ts
+     * IterableLinq.from([1, 2, 3, 4, 5]).skip(2).collectToArray(); // [3, 4, 5]
+     * ```
+     * @since 0.3.0
+     */
+    skip(count: number): IIterableLinq<T>;
+    /**
+     * Runs the chain until its first value, then stops and closes the source.
+     * @operation `Action`
+     * @returns `true` if the chain contains a value; `false` when it is empty
+     * @example
+     * ```ts
+     * IterableLinq.from([1, 2, 3]).some(); // true
+     * ```
+     * @since 0.3.0
+     */
+    some(): boolean;
     /**
      * Runs the chain until a value satisfies `predicate`, then stops and closes the source.
      * @operation `Action`
-     * @param predicate - called with each value and its index
-     * @returns `true` if at least one value satisfies `predicate`; `false` when the chain is empty
-     * @throws Error if `predicate` is not a function
+     * @param predicate - called with each value and its index; `undefined` checks only whether a value exists
+     * @returns `true` if at least one value satisfies `predicate`; `false` otherwise
+     * @throws Error if a provided `predicate` is not a function
      * @example
      * ```ts
      * IterableLinq.from([1, 2, 3]).some(v => v > 2); // true
      * ```
      * @since 0.0.1
      */
-    some(predicate: Predicate<T>): boolean;
+    some(predicate: Predicate<T> | undefined): boolean;
+    /**
+     * Yields the first `count` values, then closes the source.
+     * The source is never read past the `count`-th value, so `take` also ends an infinite chain.
+     * @operation `Transformation`
+     * @param count - how many values to yield; must be a non-negative integer
+     * @returns a new chain with at most `count` values
+     * @throws Error if `count` is negative, not an integer, `NaN` or `Infinity`
+     * @example
+     * ```ts
+     * IterableLinq.from([1, 2, 3, 4, 5]).take(3).collectToArray(); // [1, 2, 3]
+     * ```
+     * @since 0.3.0
+     */
+    take(count: number): IIterableLinq<T>;
     /**
      * Calls `tapper` on each value as it flows through the chain, without changing it.
      * If `tapper` throws, the source is closed and the error propagates.
@@ -515,11 +588,12 @@ export declare interface IIterableLinqBase<T> {
      * @example
      * ```ts
      * let evens: IIterableLinq<number> | undefined;
-     * IterableLinq.fromRange(10)
+     * const evensByTen = IterableLinq.fromRange(10)
      * 	.filter(v => v % 2 === 0)
      * 	.tapChainCreation(chain => { evens = chain; return unit(); })
      * 	.map(v => v * 10);
      * evens?.collectToArray(); // [0, 2, 4, 6, 8]
+     * evensByTen.collectToArray(); // [0, 20, 40, 60, 80]
      * ```
      * @since 0.0.10
      */
@@ -785,20 +859,65 @@ export declare function repeat<T>(value: T, count: number): IIterableLinq<T>;
  */
 declare function repeat_2<T>(value: T, count: number): Iterable<T>;
 
+/**
+ * Lazily skips the first `count` values and yields the rest.
+ * @operation `Transformation`
+ * @param iterable - the source `Iterable`
+ * @param count - how many values to skip; must be a non-negative integer
+ * @returns a lazy, re-runnable `Iterable` of the remaining values
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `count` is negative, not an integer, `NaN` or `Infinity`
+ * @example
+ * ```ts
+ * Array.from(Functions.skip([1, 2, 3, 4, 5], 2)); // [3, 4, 5]
+ * ```
+ * @since 0.3.0
+ */
+declare function skip<T>(iterable: Iterable<T>, count: number): Iterable<T>;
+
+/**
+ * Tells whether `iterable` contains a value; reads one value, then closes the source.
+ * @operation `Action`
+ * @param iterable - the source `Iterable`
+ * @returns `true` if `iterable` contains a value; `false` when it is empty
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`
+ * @example
+ * ```ts
+ * Functions.some([1, 2, 3]); // true
+ * ```
+ * @since 0.3.0
+ */
+declare function some<T>(iterable: Iterable<T>): boolean;
+
 /**
  * Tells whether at least one value satisfies `predicate`; stops and closes the source at the first match.
  * @operation `Action`
  * @param iterable - the source `Iterable`
- * @param predicate - called with each value and its index
- * @returns `true` if a value satisfies `predicate`; `false` when `iterable` is empty
- * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `predicate` is not a function
+ * @param predicate - called with each value and its index; `undefined` checks only whether a value exists
+ * @returns `true` if a value satisfies `predicate`; `false` otherwise
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if a provided `predicate` is not a function
  * @example
  * ```ts
  * Functions.some([1, 2, 3], v => v > 2); // true
  * ```
  * @since 0.0.10
  */
-declare function some<T>(iterable: Iterable<T>, predicate: Predicate<T>): boolean;
+declare function some<T>(iterable: Iterable<T>, predicate: Predicate<T> | undefined): boolean;
+
+/**
+ * Lazily yields the first `count` values, then closes the source.
+ * The source is never read past the `count`-th value, so `take` also ends an infinite source.
+ * @operation `Transformation`
+ * @param iterable - the source `Iterable`
+ * @param count - how many values to yield; must be a non-negative integer
+ * @returns a lazy, re-runnable `Iterable` of at most `count` values
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `count` is negative, not an integer, `NaN` or `Infinity`
+ * @example
+ * ```ts
+ * Array.from(Functions.take([1, 2, 3, 4, 5], 3)); // [1, 2, 3]
+ * ```
+ * @since 0.3.0
+ */
+declare function take<T>(iterable: Iterable<T>, count: number): Iterable<T>;
 
 /**
  * Lazily calls `tapper` on each value as it flows through, without changing it.

package/dist/index.d.ts

@@ -98,6 +98,24 @@ declare function empty_2<T>(): Iterable<T>;
  */
 export declare function extend<K extends Extract<keyof IIterableLinq<unknown>, string>>(name: K, implementation: ChainMethod): void;
 
+/**
+ * Lazily keeps the values accepted by a type guard and narrows their type.
+ * If `predicate` throws, the source is closed and the error propagates.
+ * @operation `Transformation`
+ * @param iterable - the source `Iterable`
+ * @param predicate - a type guard called with each value and its index; return `true` to keep the value
+ * @returns a lazy, re-runnable `Iterable` of the narrowed values
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `predicate` is not a function
+ * @example
+ * ```ts
+ * const values: (number | string)[] = [1, 'two', 3];
+ * const strings = Functions.filter(values, (v): v is string => typeof v === 'string');
+ * Array.from(strings); // string[], ['two']
+ * ```
+ * @since 0.4.0
+ */
+declare function filter<T, S extends T>(iterable: Iterable<T>, predicate: (value: T, index: number) => value is S): Iterable<S>;
+
 /**
  * Lazily keeps only the values that satisfy `predicate`.
  * If `predicate` throws, the source is closed and the error propagates.
@@ -241,7 +259,9 @@ declare namespace Functions {
         range,
         reduce,
         repeat_2 as repeat,
+        skip,
         some,
+        take,
         tap,
         tapChain
     }
@@ -294,6 +314,21 @@ export declare interface IIterableLinqBase<T> {
      * @since 0.0.1
      */
     collectToArray(): T[];
+    /**
+     * Keeps the values accepted by a type guard and narrows their type.
+     * If `predicate` throws, the source is closed and the error propagates.
+     * @operation `Transformation`
+     * @param predicate - a type guard called with each value and its index; return `true` to keep the value
+     * @returns a new chain with the narrowed values
+     * @throws Error if `predicate` is not a function
+     * @example
+     * ```ts
+     * const values: (number | string)[] = [1, 'two', 3];
+     * IterableLinq.from(values).filter((v): v is string => typeof v === 'string').collectToArray(); // string[], ['two']
+     * ```
+     * @since 0.4.0
+     */
+    filter<S extends T>(predicate: (value: T, index: number) => value is S): IIterableLinq<S>;
     /**
      * Keeps only the values that satisfy `predicate`.
      * If `predicate` throws, the source is closed and the error propagates.
@@ -460,19 +495,57 @@ export declare interface IIterableLinqBase<T> {
      * @since 0.0.10
      */
     reduce<R>(neutralElement: R, reducer: Reducer<T, R>): R;
+    /**
+     * Lazily skips the first `count` values and yields the rest.
+     * @operation `Transformation`
+     * @param count - how many values to skip; must be a non-negative integer
+     * @returns a lazy, re-runnable chain of the remaining values
+     * @throws Error if `count` is negative, not an integer, `NaN` or `Infinity`
+     * @example
+     * ```ts
+     * IterableLinq.from([1, 2, 3, 4, 5]).skip(2).collectToArray(); // [3, 4, 5]
+     * ```
+     * @since 0.3.0
+     */
+    skip(count: number): IIterableLinq<T>;
+    /**
+     * Runs the chain until its first value, then stops and closes the source.
+     * @operation `Action`
+     * @returns `true` if the chain contains a value; `false` when it is empty
+     * @example
+     * ```ts
+     * IterableLinq.from([1, 2, 3]).some(); // true
+     * ```
+     * @since 0.3.0
+     */
+    some(): boolean;
     /**
      * Runs the chain until a value satisfies `predicate`, then stops and closes the source.
      * @operation `Action`
-     * @param predicate - called with each value and its index
-     * @returns `true` if at least one value satisfies `predicate`; `false` when the chain is empty
-     * @throws Error if `predicate` is not a function
+     * @param predicate - called with each value and its index; `undefined` checks only whether a value exists
+     * @returns `true` if at least one value satisfies `predicate`; `false` otherwise
+     * @throws Error if a provided `predicate` is not a function
      * @example
      * ```ts
      * IterableLinq.from([1, 2, 3]).some(v => v > 2); // true
      * ```
      * @since 0.0.1
      */
-    some(predicate: Predicate<T>): boolean;
+    some(predicate: Predicate<T> | undefined): boolean;
+    /**
+     * Yields the first `count` values, then closes the source.
+     * The source is never read past the `count`-th value, so `take` also ends an infinite chain.
+     * @operation `Transformation`
+     * @param count - how many values to yield; must be a non-negative integer
+     * @returns a new chain with at most `count` values
+     * @throws Error if `count` is negative, not an integer, `NaN` or `Infinity`
+     * @example
+     * ```ts
+     * IterableLinq.from([1, 2, 3, 4, 5]).take(3).collectToArray(); // [1, 2, 3]
+     * ```
+     * @since 0.3.0
+     */
+    take(count: number): IIterableLinq<T>;
     /**
      * Calls `tapper` on each value as it flows through the chain, without changing it.
      * If `tapper` throws, the source is closed and the error propagates.
@@ -515,11 +588,12 @@ export declare interface IIterableLinqBase<T> {
      * @example
      * ```ts
      * let evens: IIterableLinq<number> | undefined;
-     * IterableLinq.fromRange(10)
+     * const evensByTen = IterableLinq.fromRange(10)
      * 	.filter(v => v % 2 === 0)
      * 	.tapChainCreation(chain => { evens = chain; return unit(); })
      * 	.map(v => v * 10);
      * evens?.collectToArray(); // [0, 2, 4, 6, 8]
+     * evensByTen.collectToArray(); // [0, 20, 40, 60, 80]
      * ```
      * @since 0.0.10
      */
@@ -785,20 +859,65 @@ export declare function repeat<T>(value: T, count: number): IIterableLinq<T>;
  */
 declare function repeat_2<T>(value: T, count: number): Iterable<T>;
 
+/**
+ * Lazily skips the first `count` values and yields the rest.
+ * @operation `Transformation`
+ * @param iterable - the source `Iterable`
+ * @param count - how many values to skip; must be a non-negative integer
+ * @returns a lazy, re-runnable `Iterable` of the remaining values
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `count` is negative, not an integer, `NaN` or `Infinity`
+ * @example
+ * ```ts
+ * Array.from(Functions.skip([1, 2, 3, 4, 5], 2)); // [3, 4, 5]
+ * ```
+ * @since 0.3.0
+ */
+declare function skip<T>(iterable: Iterable<T>, count: number): Iterable<T>;
+
+/**
+ * Tells whether `iterable` contains a value; reads one value, then closes the source.
+ * @operation `Action`
+ * @param iterable - the source `Iterable`
+ * @returns `true` if `iterable` contains a value; `false` when it is empty
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`
+ * @example
+ * ```ts
+ * Functions.some([1, 2, 3]); // true
+ * ```
+ * @since 0.3.0
+ */
+declare function some<T>(iterable: Iterable<T>): boolean;
+
 /**
  * Tells whether at least one value satisfies `predicate`; stops and closes the source at the first match.
  * @operation `Action`
  * @param iterable - the source `Iterable`
- * @param predicate - called with each value and its index
- * @returns `true` if a value satisfies `predicate`; `false` when `iterable` is empty
- * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `predicate` is not a function
+ * @param predicate - called with each value and its index; `undefined` checks only whether a value exists
+ * @returns `true` if a value satisfies `predicate`; `false` otherwise
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if a provided `predicate` is not a function
  * @example
  * ```ts
  * Functions.some([1, 2, 3], v => v > 2); // true
  * ```
  * @since 0.0.10
  */
-declare function some<T>(iterable: Iterable<T>, predicate: Predicate<T>): boolean;
+declare function some<T>(iterable: Iterable<T>, predicate: Predicate<T> | undefined): boolean;
+
+/**
+ * Lazily yields the first `count` values, then closes the source.
+ * The source is never read past the `count`-th value, so `take` also ends an infinite source.
+ * @operation `Transformation`
+ * @param iterable - the source `Iterable`
+ * @param count - how many values to yield; must be a non-negative integer
+ * @returns a lazy, re-runnable `Iterable` of at most `count` values
+ * @throws Error if `iterable` is missing or does not implement `[Symbol.iterator]`, or if `count` is negative, not an integer, `NaN` or `Infinity`
+ * @example
+ * ```ts
+ * Array.from(Functions.take([1, 2, 3, 4, 5], 3)); // [1, 2, 3]
+ * ```
+ * @since 0.3.0
+ */
+declare function take<T>(iterable: Iterable<T>, count: number): Iterable<T>;
 
 /**
  * Lazily calls `tapper` on each value as it flows through, without changing it.

package/dist/iterable-linq-utility.js

@@ -57,10 +57,10 @@ function c(e) {
 function l(e, t) {
 	if (!n(e)) throw Error(`The "${t}" function must be provided`);
 }
-function ee(e, t) {
+function u(e, t) {
 	if (!Number.isInteger(e) || e < 0) throw Error(`The "${t}" parameter must be a non-negative integer`);
 }
-function u(e, t) {
+function ee(e, t) {
 	if (!Number.isFinite(e) || e === 0) throw Error(`The "${t}" parameter must be a finite number other than 0`);
 }
 function te(e, t) {
@@ -143,9 +143,9 @@ function _() {
 //#endregion
 //#region src/functions/filter.ts
 function v(e, t) {
-	return c(e), l(t, "predicate"), new p(() => new y(e, t));
+	return c(e), l(t, "predicate"), new p(() => new re(e, t));
 }
-var y = class extends m {
+var re = class extends m {
 	predicate;
 	constructor(e, t) {
 		super(e), this.predicate = t;
@@ -165,10 +165,10 @@ var y = class extends m {
 };
 //#endregion
 //#region src/functions/flatMap.ts
-function b(e, t) {
-	return c(e), l(t, "mapper"), new p(() => new re(e, t));
+function y(e, t) {
+	return c(e), l(t, "mapper"), new p(() => new ie(e, t));
 }
-var re = class e extends m {
+var ie = class e extends m {
 	mapper;
 	static steps = {
 		outer: (t) => {
@@ -229,7 +229,7 @@ var re = class e extends m {
 			throw e.inner = void 0, e.closeAfterCallbackError(), t;
 		}
 	}
-}, x = class e {
+}, b = class e {
 	static instance = e.createFrozen();
 	constructor() {}
 	static createFrozen() {
@@ -237,29 +237,29 @@ var re = class e extends m {
 		return Object.freeze(t), t;
 	}
 };
-function S() {
-	return x.instance;
+function x() {
+	return b.instance;
 }
 //#endregion
 //#region src/functions/forEach.ts
-function C(e, t) {
+function S(e, t) {
 	c(e), l(t, "action");
 	let n = 0;
 	for (let r of e) t(r, n++);
-	return S();
+	return x();
 }
-async function w(e, t) {
+async function C(e, t) {
 	c(e), l(t, "action");
 	let n = 0;
 	for (let r of e) await t(r, n++);
-	return S();
+	return x();
 }
 //#endregion
 //#region src/functions/map.ts
-function T(e, t) {
-	return c(e), l(t, "mapper"), new p(() => new E(e, t));
+function w(e, t) {
+	return c(e), l(t, "mapper"), new p(() => new ae(e, t));
 }
-var E = class extends m {
+var ae = class extends m {
 	mapper;
 	constructor(e, t) {
 		super(e), this.mapper = t;
@@ -278,18 +278,18 @@ var E = class extends m {
 };
 //#endregion
 //#region src/collections/linkedList.ts
-function D(e) {
+function T(e) {
 	c(e);
-	let t = new ie();
+	let t = new oe();
 	for (let n of e) t.addLast(n);
 	return t;
 }
-var ie = class {
+var oe = class {
 	internalSize = 0;
 	head = null;
 	tail = null;
 	[Symbol.iterator]() {
-		return new ae(this.head);
+		return new se(this.head);
 	}
 	addFirst(e) {
 		let t = {
@@ -308,7 +308,7 @@ var ie = class {
 	size() {
 		return this.internalSize;
 	}
-}, ae = class extends f {
+}, se = class extends f {
 	current;
 	constructor(e) {
 		super(), this.current = e;
@@ -320,13 +320,13 @@ var ie = class {
 };
 //#endregion
 //#region src/functions/materialize.ts
-function O(e) {
-	return c(e), e instanceof k ? e : new k(e);
+function E(e) {
+	return c(e), e instanceof D ? e : new D(e);
 }
-var k = class {
+var D = class {
 	source;
 	constructor(e) {
-		this.source = D(e);
+		this.source = T(e);
 	}
 	[Symbol.iterator]() {
 		return this.source[Symbol.iterator]();
@@ -334,29 +334,29 @@ var k = class {
 };
 //#endregion
 //#region src/functions/max.ts
-function A(e, t) {
+function O(e, t) {
 	return c(e), a(e, i(t), 1);
 }
 //#endregion
 //#region src/functions/memoize.ts
-function j() {
+function k() {
 	return { allowPartialMemoization: !0 };
 }
-function M(e, t) {
+function A(e, t) {
 	c(e);
 	let n = {
-		...j(),
+		...k(),
 		...t
 	}.allowPartialMemoization;
-	return e instanceof F ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof I ? n ? e : e.changePartialMemoizationBehaviour() : n ? new I(e) : new F(e);
+	return e instanceof N ? n ? e.changePartialMemoizationBehaviour() : e : e instanceof P ? n ? e : e.changePartialMemoizationBehaviour() : n ? new P(e) : new N(e);
 }
-function N() {
+function j() {
 	return {
 		values: [],
 		finished: !1
 	};
 }
-function P(e, t) {
+function M(e, t) {
 	if (t.error) throw t.error.value;
 	if (t.finished) return !1;
 	t.source ??= e[Symbol.iterator]();
@@ -368,31 +368,31 @@ function P(e, t) {
 	}
 	return n.done === !0 ? (t.finished = !0, t.source = void 0, !1) : (t.values.push(n.value), !0);
 }
-var F = class {
+var N = class {
 	source;
-	cache = N();
+	cache = j();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new L(this.source, this.cache, !0);
+		return new F(this.source, this.cache, !0);
 	}
 	changePartialMemoizationBehaviour() {
-		return new I(this.source);
+		return new P(this.source);
 	}
-}, I = class {
+}, P = class {
 	source;
-	cache = N();
+	cache = j();
 	constructor(e) {
 		this.source = e;
 	}
 	[Symbol.iterator]() {
-		return new L(this.source, this.cache, !1);
+		return new F(this.source, this.cache, !1);
 	}
 	changePartialMemoizationBehaviour() {
-		return new F(this.source);
+		return new N(this.source);
 	}
-}, L = class extends f {
+}, F = class extends f {
 	source;
 	cache;
 	drainFirst;
@@ -401,28 +401,28 @@ var F = class {
 		super(), this.source = e, this.cache = t, this.drainFirst = n;
 	}
 	advance() {
-		if (this.drainFirst) for (; P(this.source, this.cache););
-		return this.index < this.cache.values.length || P(this.source, this.cache) ? o(this.cache.values[this.index++]) : s();
+		if (this.drainFirst) for (; M(this.source, this.cache););
+		return this.index < this.cache.values.length || M(this.source, this.cache) ? o(this.cache.values[this.index++]) : s();
 	}
 };
 //#endregion
 //#region src/functions/min.ts
-function R(e, t) {
+function I(e, t) {
 	return c(e), a(e, i(t), -1);
 }
 //#endregion
 //#region src/functions/range.ts
-function z(e, t, n) {
+function L(e, t, n) {
 	let r = typeof t == "number", i = r ? e : 0, a = r ? t : e;
 	if (!r && n !== void 0) throw Error("The \"options\" parameter must be the second argument when \"start\" is omitted");
 	let o = r ? n : t;
 	o !== void 0 && te(o, "options");
 	let { step: s = 1, reverse: c = !1 } = o ?? {};
-	u(s, "step");
-	let l = oe(i, a, Math.abs(s), c);
-	return l.length > 0 ? new p(() => new se(l.first, l.step, l.length)) : _();
+	ee(s, "step");
+	let l = ce(i, a, Math.abs(s), c);
+	return l.length > 0 ? new p(() => new le(l.first, l.step, l.length)) : _();
 }
-function oe(e, t, n, r) {
+function ce(e, t, n, r) {
 	let i = t < e ? -n : n, a = Math.ceil(Math.abs(t - e) / n);
 	return r ? {
 		first: e + (a - 1) * i,
@@ -434,7 +434,7 @@ function oe(e, t, n, r) {
 		length: a
 	};
 }
-var se = class extends f {
+var le = class extends f {
 	first;
 	step;
 	length;
@@ -448,15 +448,15 @@ var se = class extends f {
 };
 //#endregion
 //#region src/functions/reduce.ts
-function B(e, ...t) {
-	if (c(e), t.length === 1) return V(e, t[0]);
+function R(e, ...t) {
+	if (c(e), t.length === 1) return z(e, t[0]);
 	let [n, r] = t;
 	l(r, "reducer");
 	let i = n, a = 0;
 	for (let t of e) i = r(i, t, a++);
 	return i;
 }
-function V(e, t) {
+function z(e, t) {
 	l(t, "reducer");
 	let n, r = 0;
 	for (let i of e) n = r === 0 ? i : t(n, i, r), r++;
@@ -465,23 +465,62 @@ function V(e, t) {
 }
 //#endregion
 //#region src/functions/repeat.ts
-function H(e, t) {
-	return ee(t, "count"), h(t, (t) => t > 0 ? [e, t - 1] : void 0);
+function B(e, t) {
+	return u(t, "count"), h(t, (t) => t > 0 ? [e, t - 1] : void 0);
 }
 //#endregion
+//#region src/functions/skip.ts
+function V(e, t) {
+	return c(e), u(t, "count"), new p(() => new H(e, t));
+}
+var H = class extends m {
+	count;
+	constructor(e, t) {
+		super(e), this.count = t;
+	}
+	advance() {
+		for (; this.index < this.count;) {
+			let e = this.source.next();
+			if (e.done === !0) return e;
+			this.index++;
+		}
+		return this.source.next();
+	}
+};
+//#endregion
 //#region src/functions/some.ts
 function U(e, t) {
-	c(e), l(t, "predicate");
+	if (c(e), t === void 0) {
+		for (let t of e) return !0;
+		return !1;
+	}
+	l(t, "predicate");
 	let n = 0;
 	for (let r of e) if (t(r, n++)) return !0;
 	return !1;
 }
 //#endregion
-//#region src/functions/tap.ts
+//#region src/functions/take.ts
 function W(e, t) {
-	return c(e), l(t, "tapper"), new p(() => new G(e, t));
+	return c(e), u(t, "count"), new p(() => new ue(e, t));
+}
+var ue = class extends m {
+	count;
+	constructor(e, t) {
+		super(e), this.count = t;
+	}
+	advance() {
+		if (this.index >= this.count) return this.source.return?.(), s();
+		let e = this.source.next();
+		return e.done === !0 ? e : (this.index++, o(e.value));
+	}
+};
+//#endregion
+//#region src/functions/tap.ts
+function G(e, t) {
+	return c(e), l(t, "tapper"), new p(() => new de(e, t));
 }
-var G = class extends m {
+var de = class extends m {
 	tapper;
 	constructor(e, t) {
 		super(e), this.tapper = t;
@@ -504,24 +543,26 @@ function K(e, t) {
 }
 //#endregion
 //#region src/functions/index.ts
-var ce = /* @__PURE__ */ t({
+var fe = /* @__PURE__ */ t({
 	collectToArray: () => d,
 	empty: () => _,
 	filter: () => v,
-	flatMap: () => b,
-	forEach: () => C,
-	forEachAsync: () => w,
-	getMemoizeDefaultOptions: () => j,
-	map: () => T,
-	materialize: () => O,
-	max: () => A,
-	memoize: () => M,
-	min: () => R,
-	range: () => z,
-	reduce: () => B,
-	repeat: () => H,
+	flatMap: () => y,
+	forEach: () => S,
+	forEachAsync: () => C,
+	getMemoizeDefaultOptions: () => k,
+	map: () => w,
+	materialize: () => E,
+	max: () => O,
+	memoize: () => A,
+	min: () => I,
+	range: () => L,
+	reduce: () => R,
+	repeat: () => B,
+	skip: () => V,
 	some: () => U,
-	tap: () => W,
+	take: () => W,
+	tap: () => G,
 	tapChain: () => K
 }), q = Symbol.for("iterable-linq-utility.IIterableLinq");
 //#endregion
@@ -544,38 +585,44 @@ var Y = class {
 		return J(v(this.iterable, e));
 	}
 	flatMap(e) {
-		return J(b(this.iterable, e));
+		return J(y(this.iterable, e));
 	}
 	forEach(e) {
-		return C(this.iterable, e);
+		return S(this.iterable, e);
 	}
 	forEachAsync(e) {
-		return w(this.iterable, e);
+		return C(this.iterable, e);
 	}
 	map(e) {
-		return J(T(this.iterable, e));
+		return J(w(this.iterable, e));
 	}
 	materialize() {
-		return J(O(this.iterable));
+		return J(E(this.iterable));
 	}
 	max(e) {
-		return A(this.iterable, e);
+		return O(this.iterable, e);
 	}
 	memoize(e) {
-		return J(M(this.iterable, e));
+		return J(A(this.iterable, e));
 	}
 	min(e) {
-		return R(this.iterable, e);
+		return I(this.iterable, e);
 	}
 	reduce(...e) {
-		return e.length === 1 ? B(this.iterable, e[0]) : B(this.iterable, e[0], e[1]);
+		return e.length === 1 ? R(this.iterable, e[0]) : R(this.iterable, e[0], e[1]);
+	}
+	skip(e) {
+		return J(V(this.iterable, e));
 	}
 	some(e) {
 		return U(this.iterable, e);
 	}
-	tap(e) {
+	take(e) {
 		return J(W(this.iterable, e));
 	}
+	tap(e) {
+		return J(G(this.iterable, e));
+	}
 	tapChain(e) {
 		return J(K(this.iterable, e));
 	}
@@ -596,7 +643,7 @@ Object.defineProperty(Y.prototype, q, {
 function X() {
 	return Y.prototype;
 }
-function le(e) {
+function pe(e) {
 	return typeof e == "object" && !!e && e[q] === !0;
 }
 function Z(e, t) {
@@ -611,11 +658,11 @@ function Z(e, t) {
 function Q(e, t) {
 	ne(e, "name"), l(t, "implementation");
 }
-function ue(e, t) {
+function me(e, t) {
 	if (Q(e, t), e in J([])) throw Error(`"${e}" already exists on IIterableLinq: use override() to replace it`);
 	Z(e, t);
 }
-function de(e, t) {
+function he(e, t) {
 	Q(e, t);
 	let n = e;
 	if (!(n !== "constructor" && Object.prototype.hasOwnProperty.call(X(), n))) throw Error(`"${n}" is not a method of IIterableLinq: use extend() to add it`);
@@ -623,19 +670,19 @@ function de(e, t) {
 }
 //#endregion
 //#region src/index.ts
-function fe() {
+function ge() {
 	return $(_());
 }
 function $(e) {
 	return c(e), J(e);
 }
-function pe(e, t, n) {
-	if (typeof t == "number") return $(z(e, t, n));
+function _e(e, t, n) {
+	if (typeof t == "number") return $(L(e, t, n));
 	if (n !== void 0) throw Error("The \"options\" parameter must be the second argument when \"start\" is omitted");
-	return $(z(e, t));
+	return $(L(e, t));
 }
-function me(e, t) {
-	return $(H(e, t));
+function ve(e, t) {
+	return $(B(e, t));
 }
 //#endregion
-export { ce as Functions, x as Unit, fe as empty, ue as extend, $ as from, pe as fromRange, le as isIterableLinq, de as override, me as repeat, S as unit };
+export { fe as Functions, b as Unit, ge as empty, me as extend, $ as from, _e as fromRange, pe as isIterableLinq, he as override, ve as repeat, x as unit };

package/dist/iterable-linq-utility.umd.cjs

@@ -1 +1 @@
-(function(e,t){typeof exports==`object`&&typeof module<`u`?t(exports):typeof define==`function`&&define.amd?define([`exports`],t):(e=typeof globalThis<`u`?globalThis:e||self,t(e.IterableLinq={}))})(this,function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});var t=Object.defineProperty,n=(e,n)=>{let r={};for(var i in e)t(r,i,{get:e[i],enumerable:!0});return n||t(r,Symbol.toStringTag,{value:`Module`}),r};function r(e){return typeof e==`function`}function i(e,t){return e<t?-1:e===t?0:1}function a(e){if(e==null)return i;if(r(e))return e;let t=Array.isArray(e)?e:[e];return(e,n)=>{for(let r of t){let t=i(e[r],n[r]);if(t!==0)return t}return 0}}function o(e,t,n){let r,i=!1;for(let a of e)!i||r==null&&a!=null?(r=a,i=!0):a!=null&&n*t(r,a)<0&&(r=a);return r}function s(e){return{done:!1,value:e}}function c(e){return{done:!0,value:e}}function l(e){if(e==null)throw Error(`The "sourceIterable" must be provided`);if(!r(e[Symbol.iterator]))throw Error(`The provided "sourceIterable" does not conform to the iterator protocol https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#the_iterable_protocol. It must implement the "[Symbol.iterator]" function.`)}function u(e,t){if(!r(e))throw Error(`The "${t}" function must be provided`)}function d(e,t){if(!Number.isInteger(e)||e<0)throw Error(`The "${t}" parameter must be a non-negative integer`)}function ee(e,t){if(!Number.isFinite(e)||e===0)throw Error(`The "${t}" parameter must be a finite number other than 0`)}function te(e,t){if(typeof e!=`object`||!e)throw Error(`The "${t}" parameter must be an object`)}function ne(e,t){if(typeof e!=`string`||e.length===0)throw Error(`The "${t}" parameter must be a non-empty string`)}function f(e){if(l(e),Array.isArray(e)||e instanceof Set)return Array.from(e);let t=[];for(let n of e)t.push(n);return t}var p=class{done=!1;next(){if(this.done)return c();let e=this.advance();return e.done===!0&&(this.done=!0),e}return(e){return this.done||(this.done=!0,this.onReturn(e)),c(e)}[Symbol.iterator](){return this}onReturn(e){}closeAfterCallbackError(){if(!this.done){this.done=!0;try{this.onReturn()}catch{}}}},m=class{createIterator;constructor(e){this.createIterator=e}[Symbol.iterator](){return this.createIterator()}},h=class extends p{source;index=0;constructor(e){super(),this.source=e[Symbol.iterator]()}onReturn(e){this.source.return?.(e)}};function g(e,t){return new m(()=>new re(e,t))}var re=class extends p{state;step;constructor(e,t){super(),this.state=e,this.step=t}advance(){let e=this.step(this.state);return e===void 0?c():(this.state=e[1],s(e[0]))}};function _(){return g(void 0,()=>void 0)}function v(e,t){return l(e),u(t,`predicate`),new m(()=>new ie(e,t))}var ie=class extends h{predicate;constructor(e,t){super(e),this.predicate=t}advance(){for(let e=this.source.next();;e=this.source.next()){if(e.done===!0)return e;let t;try{t=this.predicate(e.value,this.index++)}catch(e){throw this.closeAfterCallbackError(),e}if(t)return e}}};function y(e,t){return l(e),u(t,`mapper`),new m(()=>new ae(e,t))}var ae=class e extends h{mapper;static steps={outer:t=>{let n=t.source.next();if(n.done===!0)return n;let r=e.mapNext(t,n.value);if(r===void 0){t.state=`inner`;return}if(r.length!==0)return t.array=r,t.position=1,t.state=`array`,s(r[0])},inner:t=>{let n=e.nextInner(t);if(n.done!==!0)return n;t.inner=void 0,t.state=`outer`},array:e=>{if(e.position<e.array.length)return s(e.array[e.position++]);e.array=void 0,e.state=`outer`}};state=`outer`;inner;array;position=0;constructor(e,t){super(e),this.mapper=t}advance(){for(;;){let t=e.steps[this.state](this);if(t!==void 0)return t}}onReturn(e){this.array=void 0;try{this.inner?.return?.(e)}finally{super.onReturn(e)}}static mapNext(e,t){try{let n=e.mapper(t,e.index++);if(Array.isArray(n))return n;e.inner=n[Symbol.iterator]();return}catch(t){throw e.closeAfterCallbackError(),t}}static nextInner(e){try{return e.inner.next()}catch(t){throw e.inner=void 0,e.closeAfterCallbackError(),t}}},b=class e{static instance=e.createFrozen();constructor(){}static createFrozen(){let t=new e;return Object.freeze(t),t}};function x(){return b.instance}function S(e,t){l(e),u(t,`action`);let n=0;for(let r of e)t(r,n++);return x()}async function C(e,t){l(e),u(t,`action`);let n=0;for(let r of e)await t(r,n++);return x()}function w(e,t){return l(e),u(t,`mapper`),new m(()=>new T(e,t))}var T=class extends h{mapper;constructor(e,t){super(e),this.mapper=t}advance(){let e=this.source.next();if(e.done===!0)return e;let t;try{t=this.mapper(e.value,this.index++)}catch(e){throw this.closeAfterCallbackError(),e}return s(t)}};function E(e){l(e);let t=new D;for(let n of e)t.addLast(n);return t}var D=class{internalSize=0;head=null;tail=null;[Symbol.iterator](){return new oe(this.head)}addFirst(e){let t={data:e,nextNode:this.head};return this.tail===null&&(this.tail=t),this.head=t,this.internalSize++,this}addLast(e){let t={data:e,nextNode:null};return this.tail===null?this.head=t:this.tail.nextNode=t,this.tail=t,this.internalSize++,this}size(){return this.internalSize}},oe=class extends p{current;constructor(e){super(),this.current=e}advance(){let e=this.current;return e===null?c():(this.current=e.nextNode,s(e.data))}};function O(e){return l(e),e instanceof k?e:new k(e)}var k=class{source;constructor(e){this.source=E(e)}[Symbol.iterator](){return this.source[Symbol.iterator]()}};function A(e,t){return l(e),o(e,a(t),1)}function j(){return{allowPartialMemoization:!0}}function M(e,t){l(e);let n={...j(),...t}.allowPartialMemoization;return e instanceof F?n?e.changePartialMemoizationBehaviour():e:e instanceof I?n?e:e.changePartialMemoizationBehaviour():n?new I(e):new F(e)}function N(){return{values:[],finished:!1}}function P(e,t){if(t.error)throw t.error.value;if(t.finished)return!1;t.source??=e[Symbol.iterator]();let n;try{n=t.source.next()}catch(e){throw t.error={value:e},t.source=void 0,e}return n.done===!0?(t.finished=!0,t.source=void 0,!1):(t.values.push(n.value),!0)}var F=class{source;cache=N();constructor(e){this.source=e}[Symbol.iterator](){return new L(this.source,this.cache,!0)}changePartialMemoizationBehaviour(){return new I(this.source)}},I=class{source;cache=N();constructor(e){this.source=e}[Symbol.iterator](){return new L(this.source,this.cache,!1)}changePartialMemoizationBehaviour(){return new F(this.source)}},L=class extends p{source;cache;drainFirst;index=0;constructor(e,t,n){super(),this.source=e,this.cache=t,this.drainFirst=n}advance(){if(this.drainFirst)for(;P(this.source,this.cache););return this.index<this.cache.values.length||P(this.source,this.cache)?s(this.cache.values[this.index++]):c()}};function R(e,t){return l(e),o(e,a(t),-1)}function z(e,t,n){let r=typeof t==`number`,i=r?e:0,a=r?t:e;if(!r&&n!==void 0)throw Error(`The "options" parameter must be the second argument when "start" is omitted`);let o=r?n:t;o!==void 0&&te(o,`options`);let{step:s=1,reverse:c=!1}=o??{};ee(s,`step`);let l=se(i,a,Math.abs(s),c);return l.length>0?new m(()=>new B(l.first,l.step,l.length)):_()}function se(e,t,n,r){let i=t<e?-n:n,a=Math.ceil(Math.abs(t-e)/n);return r?{first:e+(a-1)*i,step:-i,length:a}:{first:e,step:i,length:a}}var B=class extends p{first;step;length;index=0;constructor(e,t,n){super(),this.first=e,this.step=t,this.length=n}advance(){return this.index>=this.length?c():s(this.first+this.index++*this.step)}};function V(e,...t){if(l(e),t.length===1)return H(e,t[0]);let[n,r]=t;u(r,`reducer`);let i=n,a=0;for(let t of e)i=r(i,t,a++);return i}function H(e,t){u(t,`reducer`);let n,r=0;for(let i of e)n=r===0?i:t(n,i,r),r++;if(r===0)throw Error(`The "sourceIterable" must not be empty when "reduce" has no seed`);return n}function U(e,t){return d(t,`count`),g(t,t=>t>0?[e,t-1]:void 0)}function W(e,t){l(e),u(t,`predicate`);let n=0;for(let r of e)if(t(r,n++))return!0;return!1}function G(e,t){return l(e),u(t,`tapper`),new m(()=>new ce(e,t))}var ce=class extends h{tapper;constructor(e,t){super(e),this.tapper=t}advance(){let e=this.source.next();if(e.done===!0)return e;try{this.tapper(e.value,this.index++)}catch(e){throw this.closeAfterCallbackError(),e}return e}};function K(e,t){return l(e),u(t,`tapper`),new m(()=>(t(e,0),e[Symbol.iterator]()))}var le=n({collectToArray:()=>f,empty:()=>_,filter:()=>v,flatMap:()=>y,forEach:()=>S,forEachAsync:()=>C,getMemoizeDefaultOptions:()=>j,map:()=>w,materialize:()=>O,max:()=>A,memoize:()=>M,min:()=>R,range:()=>z,reduce:()=>V,repeat:()=>U,some:()=>W,tap:()=>G,tapChain:()=>K}),q=Symbol.for(`iterable-linq-utility.IIterableLinq`);function J(e){return new Y(e)}var Y=class{iterable;constructor(e){this.iterable=e}[Symbol.iterator](){return this.iterable[Symbol.iterator]()}collectToArray(){return f(this.iterable)}filter(e){return J(v(this.iterable,e))}flatMap(e){return J(y(this.iterable,e))}forEach(e){return S(this.iterable,e)}forEachAsync(e){return C(this.iterable,e)}map(e){return J(w(this.iterable,e))}materialize(){return J(O(this.iterable))}max(e){return A(this.iterable,e)}memoize(e){return J(M(this.iterable,e))}min(e){return R(this.iterable,e)}reduce(...e){return e.length===1?V(this.iterable,e[0]):V(this.iterable,e[0],e[1])}some(e){return W(this.iterable,e)}tap(e){return J(G(this.iterable,e))}tapChain(e){return J(K(this.iterable,e))}tapChainCreation(e){u(e,`chainCreationTapper`);let t=this;return e(t),t}};Object.defineProperty(Y.prototype,q,{value:!0,enumerable:!1,writable:!1,configurable:!1});function X(){return Y.prototype}function ue(e){return typeof e==`object`&&!!e&&e[q]===!0}function Z(e,t){let n=Object.getOwnPropertyDescriptor(X(),e);Object.defineProperty(X(),e,{value:t,enumerable:!1,writable:n?.writable??!1,configurable:!0})}function Q(e,t){ne(e,`name`),u(t,`implementation`)}function de(e,t){if(Q(e,t),e in J([]))throw Error(`"${e}" already exists on IIterableLinq: use override() to replace it`);Z(e,t)}function fe(e,t){Q(e,t);let n=e;if(!(n!==`constructor`&&Object.prototype.hasOwnProperty.call(X(),n)))throw Error(`"${n}" is not a method of IIterableLinq: use extend() to add it`);Z(n,t)}function pe(){return $(_())}function $(e){return l(e),J(e)}function me(e,t,n){if(typeof t==`number`)return $(z(e,t,n));if(n!==void 0)throw Error(`The "options" parameter must be the second argument when "start" is omitted`);return $(z(e,t))}function he(e,t){return $(U(e,t))}Object.defineProperty(e,"Functions",{enumerable:!0,get:function(){return le}}),e.Unit=b,e.empty=pe,e.extend=de,e.from=$,e.fromRange=me,e.isIterableLinq=ue,e.override=fe,e.repeat=he,e.unit=x});
+(function(e,t){typeof exports==`object`&&typeof module<`u`?t(exports):typeof define==`function`&&define.amd?define([`exports`],t):(e=typeof globalThis<`u`?globalThis:e||self,t(e.IterableLinq={}))})(this,function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});var t=Object.defineProperty,n=(e,n)=>{let r={};for(var i in e)t(r,i,{get:e[i],enumerable:!0});return n||t(r,Symbol.toStringTag,{value:`Module`}),r};function r(e){return typeof e==`function`}function i(e,t){return e<t?-1:e===t?0:1}function a(e){if(e==null)return i;if(r(e))return e;let t=Array.isArray(e)?e:[e];return(e,n)=>{for(let r of t){let t=i(e[r],n[r]);if(t!==0)return t}return 0}}function o(e,t,n){let r,i=!1;for(let a of e)!i||r==null&&a!=null?(r=a,i=!0):a!=null&&n*t(r,a)<0&&(r=a);return r}function s(e){return{done:!1,value:e}}function c(e){return{done:!0,value:e}}function l(e){if(e==null)throw Error(`The "sourceIterable" must be provided`);if(!r(e[Symbol.iterator]))throw Error(`The provided "sourceIterable" does not conform to the iterator protocol https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#the_iterable_protocol. It must implement the "[Symbol.iterator]" function.`)}function u(e,t){if(!r(e))throw Error(`The "${t}" function must be provided`)}function d(e,t){if(!Number.isInteger(e)||e<0)throw Error(`The "${t}" parameter must be a non-negative integer`)}function f(e,t){if(!Number.isFinite(e)||e===0)throw Error(`The "${t}" parameter must be a finite number other than 0`)}function ee(e,t){if(typeof e!=`object`||!e)throw Error(`The "${t}" parameter must be an object`)}function te(e,t){if(typeof e!=`string`||e.length===0)throw Error(`The "${t}" parameter must be a non-empty string`)}function p(e){if(l(e),Array.isArray(e)||e instanceof Set)return Array.from(e);let t=[];for(let n of e)t.push(n);return t}var m=class{done=!1;next(){if(this.done)return c();let e=this.advance();return e.done===!0&&(this.done=!0),e}return(e){return this.done||(this.done=!0,this.onReturn(e)),c(e)}[Symbol.iterator](){return this}onReturn(e){}closeAfterCallbackError(){if(!this.done){this.done=!0;try{this.onReturn()}catch{}}}},h=class{createIterator;constructor(e){this.createIterator=e}[Symbol.iterator](){return this.createIterator()}},g=class extends m{source;index=0;constructor(e){super(),this.source=e[Symbol.iterator]()}onReturn(e){this.source.return?.(e)}};function _(e,t){return new h(()=>new ne(e,t))}var ne=class extends m{state;step;constructor(e,t){super(),this.state=e,this.step=t}advance(){let e=this.step(this.state);return e===void 0?c():(this.state=e[1],s(e[0]))}};function v(){return _(void 0,()=>void 0)}function y(e,t){return l(e),u(t,`predicate`),new h(()=>new re(e,t))}var re=class extends g{predicate;constructor(e,t){super(e),this.predicate=t}advance(){for(let e=this.source.next();;e=this.source.next()){if(e.done===!0)return e;let t;try{t=this.predicate(e.value,this.index++)}catch(e){throw this.closeAfterCallbackError(),e}if(t)return e}}};function b(e,t){return l(e),u(t,`mapper`),new h(()=>new ie(e,t))}var ie=class e extends g{mapper;static steps={outer:t=>{let n=t.source.next();if(n.done===!0)return n;let r=e.mapNext(t,n.value);if(r===void 0){t.state=`inner`;return}if(r.length!==0)return t.array=r,t.position=1,t.state=`array`,s(r[0])},inner:t=>{let n=e.nextInner(t);if(n.done!==!0)return n;t.inner=void 0,t.state=`outer`},array:e=>{if(e.position<e.array.length)return s(e.array[e.position++]);e.array=void 0,e.state=`outer`}};state=`outer`;inner;array;position=0;constructor(e,t){super(e),this.mapper=t}advance(){for(;;){let t=e.steps[this.state](this);if(t!==void 0)return t}}onReturn(e){this.array=void 0;try{this.inner?.return?.(e)}finally{super.onReturn(e)}}static mapNext(e,t){try{let n=e.mapper(t,e.index++);if(Array.isArray(n))return n;e.inner=n[Symbol.iterator]();return}catch(t){throw e.closeAfterCallbackError(),t}}static nextInner(e){try{return e.inner.next()}catch(t){throw e.inner=void 0,e.closeAfterCallbackError(),t}}},x=class e{static instance=e.createFrozen();constructor(){}static createFrozen(){let t=new e;return Object.freeze(t),t}};function S(){return x.instance}function C(e,t){l(e),u(t,`action`);let n=0;for(let r of e)t(r,n++);return S()}async function w(e,t){l(e),u(t,`action`);let n=0;for(let r of e)await t(r,n++);return S()}function T(e,t){return l(e),u(t,`mapper`),new h(()=>new ae(e,t))}var ae=class extends g{mapper;constructor(e,t){super(e),this.mapper=t}advance(){let e=this.source.next();if(e.done===!0)return e;let t;try{t=this.mapper(e.value,this.index++)}catch(e){throw this.closeAfterCallbackError(),e}return s(t)}};function oe(e){l(e);let t=new se;for(let n of e)t.addLast(n);return t}var se=class{internalSize=0;head=null;tail=null;[Symbol.iterator](){return new ce(this.head)}addFirst(e){let t={data:e,nextNode:this.head};return this.tail===null&&(this.tail=t),this.head=t,this.internalSize++,this}addLast(e){let t={data:e,nextNode:null};return this.tail===null?this.head=t:this.tail.nextNode=t,this.tail=t,this.internalSize++,this}size(){return this.internalSize}},ce=class extends m{current;constructor(e){super(),this.current=e}advance(){let e=this.current;return e===null?c():(this.current=e.nextNode,s(e.data))}};function E(e){return l(e),e instanceof D?e:new D(e)}var D=class{source;constructor(e){this.source=oe(e)}[Symbol.iterator](){return this.source[Symbol.iterator]()}};function O(e,t){return l(e),o(e,a(t),1)}function k(){return{allowPartialMemoization:!0}}function A(e,t){l(e);let n={...k(),...t}.allowPartialMemoization;return e instanceof N?n?e.changePartialMemoizationBehaviour():e:e instanceof P?n?e:e.changePartialMemoizationBehaviour():n?new P(e):new N(e)}function j(){return{values:[],finished:!1}}function M(e,t){if(t.error)throw t.error.value;if(t.finished)return!1;t.source??=e[Symbol.iterator]();let n;try{n=t.source.next()}catch(e){throw t.error={value:e},t.source=void 0,e}return n.done===!0?(t.finished=!0,t.source=void 0,!1):(t.values.push(n.value),!0)}var N=class{source;cache=j();constructor(e){this.source=e}[Symbol.iterator](){return new F(this.source,this.cache,!0)}changePartialMemoizationBehaviour(){return new P(this.source)}},P=class{source;cache=j();constructor(e){this.source=e}[Symbol.iterator](){return new F(this.source,this.cache,!1)}changePartialMemoizationBehaviour(){return new N(this.source)}},F=class extends m{source;cache;drainFirst;index=0;constructor(e,t,n){super(),this.source=e,this.cache=t,this.drainFirst=n}advance(){if(this.drainFirst)for(;M(this.source,this.cache););return this.index<this.cache.values.length||M(this.source,this.cache)?s(this.cache.values[this.index++]):c()}};function I(e,t){return l(e),o(e,a(t),-1)}function L(e,t,n){let r=typeof t==`number`,i=r?e:0,a=r?t:e;if(!r&&n!==void 0)throw Error(`The "options" parameter must be the second argument when "start" is omitted`);let o=r?n:t;o!==void 0&&ee(o,`options`);let{step:s=1,reverse:c=!1}=o??{};f(s,`step`);let l=le(i,a,Math.abs(s),c);return l.length>0?new h(()=>new ue(l.first,l.step,l.length)):v()}function le(e,t,n,r){let i=t<e?-n:n,a=Math.ceil(Math.abs(t-e)/n);return r?{first:e+(a-1)*i,step:-i,length:a}:{first:e,step:i,length:a}}var ue=class extends m{first;step;length;index=0;constructor(e,t,n){super(),this.first=e,this.step=t,this.length=n}advance(){return this.index>=this.length?c():s(this.first+this.index++*this.step)}};function R(e,...t){if(l(e),t.length===1)return de(e,t[0]);let[n,r]=t;u(r,`reducer`);let i=n,a=0;for(let t of e)i=r(i,t,a++);return i}function de(e,t){u(t,`reducer`);let n,r=0;for(let i of e)n=r===0?i:t(n,i,r),r++;if(r===0)throw Error(`The "sourceIterable" must not be empty when "reduce" has no seed`);return n}function z(e,t){return d(t,`count`),_(t,t=>t>0?[e,t-1]:void 0)}function B(e,t){return l(e),d(t,`count`),new h(()=>new V(e,t))}var V=class extends g{count;constructor(e,t){super(e),this.count=t}advance(){for(;this.index<this.count;){let e=this.source.next();if(e.done===!0)return e;this.index++}return this.source.next()}};function H(e,t){if(l(e),t===void 0){for(let t of e)return!0;return!1}u(t,`predicate`);let n=0;for(let r of e)if(t(r,n++))return!0;return!1}function U(e,t){return l(e),d(t,`count`),new h(()=>new fe(e,t))}var fe=class extends g{count;constructor(e,t){super(e),this.count=t}advance(){if(this.index>=this.count)return this.source.return?.(),c();let e=this.source.next();return e.done===!0?e:(this.index++,s(e.value))}};function W(e,t){return l(e),u(t,`tapper`),new h(()=>new pe(e,t))}var pe=class extends g{tapper;constructor(e,t){super(e),this.tapper=t}advance(){let e=this.source.next();if(e.done===!0)return e;try{this.tapper(e.value,this.index++)}catch(e){throw this.closeAfterCallbackError(),e}return e}};function G(e,t){return l(e),u(t,`tapper`),new h(()=>(t(e,0),e[Symbol.iterator]()))}var me=n({collectToArray:()=>p,empty:()=>v,filter:()=>y,flatMap:()=>b,forEach:()=>C,forEachAsync:()=>w,getMemoizeDefaultOptions:()=>k,map:()=>T,materialize:()=>E,max:()=>O,memoize:()=>A,min:()=>I,range:()=>L,reduce:()=>R,repeat:()=>z,skip:()=>B,some:()=>H,take:()=>U,tap:()=>W,tapChain:()=>G}),K=Symbol.for(`iterable-linq-utility.IIterableLinq`);function q(e){return new J(e)}var J=class{iterable;constructor(e){this.iterable=e}[Symbol.iterator](){return this.iterable[Symbol.iterator]()}collectToArray(){return p(this.iterable)}filter(e){return q(y(this.iterable,e))}flatMap(e){return q(b(this.iterable,e))}forEach(e){return C(this.iterable,e)}forEachAsync(e){return w(this.iterable,e)}map(e){return q(T(this.iterable,e))}materialize(){return q(E(this.iterable))}max(e){return O(this.iterable,e)}memoize(e){return q(A(this.iterable,e))}min(e){return I(this.iterable,e)}reduce(...e){return e.length===1?R(this.iterable,e[0]):R(this.iterable,e[0],e[1])}skip(e){return q(B(this.iterable,e))}some(e){return H(this.iterable,e)}take(e){return q(U(this.iterable,e))}tap(e){return q(W(this.iterable,e))}tapChain(e){return q(G(this.iterable,e))}tapChainCreation(e){u(e,`chainCreationTapper`);let t=this;return e(t),t}};Object.defineProperty(J.prototype,K,{value:!0,enumerable:!1,writable:!1,configurable:!1});function Y(){return J.prototype}function he(e){return typeof e==`object`&&!!e&&e[K]===!0}function X(e,t){let n=Object.getOwnPropertyDescriptor(Y(),e);Object.defineProperty(Y(),e,{value:t,enumerable:!1,writable:n?.writable??!1,configurable:!0})}function Z(e,t){te(e,`name`),u(t,`implementation`)}function Q(e,t){if(Z(e,t),e in q([]))throw Error(`"${e}" already exists on IIterableLinq: use override() to replace it`);X(e,t)}function ge(e,t){Z(e,t);let n=e;if(!(n!==`constructor`&&Object.prototype.hasOwnProperty.call(Y(),n)))throw Error(`"${n}" is not a method of IIterableLinq: use extend() to add it`);X(n,t)}function _e(){return $(v())}function $(e){return l(e),q(e)}function ve(e,t,n){if(typeof t==`number`)return $(L(e,t,n));if(n!==void 0)throw Error(`The "options" parameter must be the second argument when "start" is omitted`);return $(L(e,t))}function ye(e,t){return $(z(e,t))}Object.defineProperty(e,"Functions",{enumerable:!0,get:function(){return me}}),e.Unit=x,e.empty=_e,e.extend=Q,e.from=$,e.fromRange=ve,e.isIterableLinq=he,e.override=ge,e.repeat=ye,e.unit=S});

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "iterable-linq-utility",
-  "version": "0.2.0",
+  "version": "0.4.0",
   "description": "An Iterable mutation utility inspired by .net Linq and Javascript Array interface",
   "type": "module",
   "main": "./dist/iterable-linq-utility.umd.cjs",
@@ -25,6 +25,7 @@
     "build": "tsc -p tsconfig.build.json && vite build && cp dist/index.d.ts dist/index.d.cts",
     "check:package": "attw --pack .",
     "check:changeset": "changeset status --since=origin/main",
+    "check:commits": "node scripts/check-commits.ts",
     "check:since": "node scripts/check-since.ts",
     "check:instructions": "node scripts/check-instructions.ts",
     "check:structure": "node scripts/check-structure.ts",
@@ -65,6 +66,7 @@
     "@vitest/coverage-istanbul": "^5.0.2",
     "@vitest/ui": "^5.0.2",
     "eslint": "^10.11.0",
+    "eslint-plugin-perfectionist": "^5.12.1",
     "eslint-plugin-tsdoc": "^0.5.3",
     "globals": "^17.12.0",
     "typescript": "^6.0.3",
@@ -73,5 +75,5 @@
     "vite-plugin-dts": "^5.1.1",
     "vitest": "^5.0.2"
   },
-  "packageManager": "pnpm@11.24.0"
+  "packageManager": "pnpm@12.8.1"
 }