reactor-core-ts 3.2.2 → 3.2.4

package/README.md

@@ -442,6 +442,7 @@ Every row below includes a minimal example.
 | `skipUntilOther` | Drop values until another publisher signals. | `Flux.interval(100).skipUntilOther(Mono.delay(300))` |
 | `distinct` | Keep the first value for each key. | `Flux.just(1, 1, 2).distinct()` |
 | `distinctUntilChanged` | Drop only adjacent duplicates. | `Flux.just(1, 1, 2, 1).distinctUntilChanged()` |
+| `distinctUntilChangedDeep` | Drop adjacent values with equal nested state. | `users.distinctUntilChangedDeep()` |
 | `elementAt` | Pick a value by index. | `Flux.just("a", "b").elementAt(1)` |
 | `defaultIfEmpty` | Emit a fallback value if empty. | `Flux.empty<number>().defaultIfEmpty(0)` |
 | `switchIfEmpty` | Switch to another source if empty. | `Flux.empty<number>().switchIfEmpty(Flux.just(1))` |
@@ -452,6 +453,10 @@ Every row below includes a minimal example.
 | `transformDeferredContextual` | Transform per subscription with `Context`. | `Flux.just(1).transformDeferredContextual((f, ctx) => f.map(v => [v, ctx.get("id")]))` |
 | `hide` | Hide implementation identity. | `Flux.just(1).hide()` |
 
+`distinctUntilChangedDeep` snapshots arrays, enumerable properties of ordinary
+objects, and local `Date`, `RegExp`, `Map` and `Set` values. Other object types
+keep identity-comparison semantics.
+
 ### Flux Flattening And Combining Methods
 
 | Method | What it does and why | Example |

package/dist/core/demand.d.ts

@@ -2,8 +2,12 @@
  * @packageDocumentation
  * Reactive Streams core contracts and disposable helpers.
  */
+/** Demand sentinel used when a subscriber can consume the whole source without batching. */
+export declare const UNBOUNDED_DEMAND: number;
 /** Validates and normalizes a Reactive Streams request amount. */
 export declare function normalizeRequest(n: number): number;
 /** Adds demand values with saturation at positive infinity. */
 export declare function addCap(a: number, b: number): number;
+/** Multiplies demand values with saturation at positive infinity. */
+export declare function multiplyCap(a: number, b: number): number;
 //# sourceMappingURL=demand.d.ts.map

package/dist/core/demand.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"demand.d.ts","sourceRoot":"","sources":["../../src/core/demand.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,kEAAkE;AAClE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQlD;AAED,+DAA+D;AAC/D,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMnD"}
+{"version":3,"file":"demand.d.ts","sourceRoot":"","sources":["../../src/core/demand.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,4FAA4F;AAC5F,eAAO,MAAM,gBAAgB,QAA2B,CAAC;AAEzD,kEAAkE;AAClE,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQlD;AAED,+DAA+D;AAC/D,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMnD;AAED,qEAAqE;AACrE,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMxD"}

package/dist/core/demand.js

@@ -3,19 +3,27 @@
 * @packageDocumentation
 * Reactive Streams core contracts and disposable helpers.
 */
+/** Demand sentinel used when a subscriber can consume the whole source without batching. */
+var UNBOUNDED_DEMAND = Number.POSITIVE_INFINITY;
 /** Validates and normalizes a Reactive Streams request amount. */
 function normalizeRequest(n) {
-	if (n === Number.POSITIVE_INFINITY) return Number.POSITIVE_INFINITY;
+	if (n === UNBOUNDED_DEMAND) return UNBOUNDED_DEMAND;
 	if (!Number.isFinite(n) || !Number.isInteger(n) || n <= 0) throw new RangeError("request amount must be a strictly positive integer");
 	return n;
 }
 /** Adds demand values with saturation at positive infinity. */
 function addCap(a, b) {
-	if (a === Number.POSITIVE_INFINITY || b === Number.POSITIVE_INFINITY) return Number.POSITIVE_INFINITY;
+	if (a === UNBOUNDED_DEMAND || b === UNBOUNDED_DEMAND) return UNBOUNDED_DEMAND;
 	const next = a + b;
-	return next >= Number.MAX_SAFE_INTEGER ? Number.POSITIVE_INFINITY : next;
+	return next >= Number.MAX_SAFE_INTEGER ? UNBOUNDED_DEMAND : next;
+}
+/** Multiplies demand values with saturation at positive infinity. */
+function multiplyCap(a, b) {
+	if (a === UNBOUNDED_DEMAND || b === UNBOUNDED_DEMAND) return UNBOUNDED_DEMAND;
+	const next = a * b;
+	return next >= Number.MAX_SAFE_INTEGER ? UNBOUNDED_DEMAND : next;
 }
 //#endregion
-export { addCap, normalizeRequest };
+export { UNBOUNDED_DEMAND, addCap, multiplyCap, normalizeRequest };
 
 //# sourceMappingURL=demand.js.map

package/dist/core/demand.js.map

@@ -1 +1 @@
-{"version":3,"file":"demand.js","names":[],"sources":["../../src/core/demand.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Reactive Streams core contracts and disposable helpers.\n */\n/** Validates and normalizes a Reactive Streams request amount. */\nexport function normalizeRequest(n: number): number {\n    if (n === Number.POSITIVE_INFINITY) {\n        return Number.POSITIVE_INFINITY;\n    }\n    if (!Number.isFinite(n) || !Number.isInteger(n) || n <= 0) {\n        throw new RangeError(\"request amount must be a strictly positive integer\");\n    }\n    return n;\n}\n\n/** Adds demand values with saturation at positive infinity. */\nexport function addCap(a: number, b: number): number {\n    if (a === Number.POSITIVE_INFINITY || b === Number.POSITIVE_INFINITY) {\n        return Number.POSITIVE_INFINITY;\n    }\n    const next = a + b;\n    return next >= Number.MAX_SAFE_INTEGER ? Number.POSITIVE_INFINITY : next;\n}\n"],"mappings":";;;;;;AAKA,SAAgB,iBAAiB,GAAmB;CAChD,IAAI,MAAM,OAAO,mBACb,OAAO,OAAO;CAElB,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,KAAK,GACpD,MAAM,IAAI,WAAW,oDAAoD;CAE7E,OAAO;AACX;;AAGA,SAAgB,OAAO,GAAW,GAAmB;CACjD,IAAI,MAAM,OAAO,qBAAqB,MAAM,OAAO,mBAC/C,OAAO,OAAO;CAElB,MAAM,OAAO,IAAI;CACjB,OAAO,QAAQ,OAAO,mBAAmB,OAAO,oBAAoB;AACxE"}
+{"version":3,"file":"demand.js","names":[],"sources":["../../src/core/demand.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Reactive Streams core contracts and disposable helpers.\n */\n/** Demand sentinel used when a subscriber can consume the whole source without batching. */\nexport const UNBOUNDED_DEMAND = Number.POSITIVE_INFINITY;\n\n/** Validates and normalizes a Reactive Streams request amount. */\nexport function normalizeRequest(n: number): number {\n    if (n === UNBOUNDED_DEMAND) {\n        return UNBOUNDED_DEMAND;\n    }\n    if (!Number.isFinite(n) || !Number.isInteger(n) || n <= 0) {\n        throw new RangeError(\"request amount must be a strictly positive integer\");\n    }\n    return n;\n}\n\n/** Adds demand values with saturation at positive infinity. */\nexport function addCap(a: number, b: number): number {\n    if (a === UNBOUNDED_DEMAND || b === UNBOUNDED_DEMAND) {\n        return UNBOUNDED_DEMAND;\n    }\n    const next = a + b;\n    return next >= Number.MAX_SAFE_INTEGER ? UNBOUNDED_DEMAND : next;\n}\n\n/** Multiplies demand values with saturation at positive infinity. */\nexport function multiplyCap(a: number, b: number): number {\n    if (a === UNBOUNDED_DEMAND || b === UNBOUNDED_DEMAND) {\n        return UNBOUNDED_DEMAND;\n    }\n    const next = a * b;\n    return next >= Number.MAX_SAFE_INTEGER ? UNBOUNDED_DEMAND : next;\n}\n"],"mappings":";;;;;;AAKA,IAAa,mBAAmB,OAAO;;AAGvC,SAAgB,iBAAiB,GAAmB;CAChD,IAAI,MAAM,kBACN,OAAO;CAEX,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,KAAK,GACpD,MAAM,IAAI,WAAW,oDAAoD;CAE7E,OAAO;AACX;;AAGA,SAAgB,OAAO,GAAW,GAAmB;CACjD,IAAI,MAAM,oBAAoB,MAAM,kBAChC,OAAO;CAEX,MAAM,OAAO,IAAI;CACjB,OAAO,QAAQ,OAAO,mBAAmB,mBAAmB;AAChE;;AAGA,SAAgB,YAAY,GAAW,GAAmB;CACtD,IAAI,MAAM,oBAAoB,MAAM,kBAChC,OAAO;CAEX,MAAM,OAAO,IAAI;CACjB,OAAO,QAAQ,OAAO,mBAAmB,mBAAmB;AAChE"}

package/dist/internal/deep-value.d.ts

@@ -0,0 +1,9 @@
+/**
+ * @packageDocumentation
+ * Internal helpers for snapshotting and comparing nested JavaScript values.
+ */
+/** Creates a detached snapshot of nested enumerable state and supported mutable value types. */
+export declare function snapshotDeep(value: unknown): unknown;
+/** Compares nested enumerable state, supported mutable values, cycles and shared references. */
+export declare function deepEqual(left: unknown, right: unknown): boolean;
+//# sourceMappingURL=deep-value.d.ts.map

package/dist/internal/deep-value.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deep-value.d.ts","sourceRoot":"","sources":["../../src/internal/deep-value.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,gGAAgG;AAChG,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAkEpD;AAED,gGAAgG;AAChG,wBAAgB,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAyEhE"}

package/dist/internal/deep-value.js

@@ -0,0 +1,159 @@
+//#region src/internal/deep-value.ts
+/** Retains reliable kind metadata for snapshots whose prototypes may contain stateful getters. */
+var SNAPSHOT_KINDS = /* @__PURE__ */ new WeakMap();
+/** Creates a detached snapshot of nested enumerable state and supported mutable value types. */
+function snapshotDeep(value) {
+	const snapshots = /* @__PURE__ */ new Map();
+	function snapshotValue(current) {
+		if (!isObject(current) || typeof current === "function") return current;
+		if (snapshots.has(current)) return snapshots.get(current);
+		const kind = valueKind(current);
+		let snapshot;
+		switch (kind) {
+			case "array":
+				snapshot = new Array(current.length);
+				break;
+			case "date":
+				snapshot = new Date(current.getTime());
+				break;
+			case "regexp": {
+				const source = current;
+				const regexp = new RegExp(source.source, source.flags);
+				regexp.lastIndex = source.lastIndex;
+				snapshot = regexp;
+				break;
+			}
+			case "map":
+				snapshot = /* @__PURE__ */ new Map();
+				break;
+			case "set":
+				snapshot = /* @__PURE__ */ new Set();
+				break;
+			case "record":
+				snapshot = Object.create(Object.getPrototypeOf(current));
+				break;
+			case "opaque": return current;
+		}
+		if (kind === "array") Object.setPrototypeOf(snapshot, Object.getPrototypeOf(current));
+		SNAPSHOT_KINDS.set(snapshot, kind);
+		snapshots.set(current, snapshot);
+		if (kind === "map") {
+			const source = current;
+			const target = snapshot;
+			for (const [key, entryValue] of source) target.set(snapshotValue(key), snapshotValue(entryValue));
+		} else if (kind === "set") {
+			const source = current;
+			const target = snapshot;
+			for (const entryValue of source) target.add(snapshotValue(entryValue));
+		}
+		copyEnumerableState(current, snapshot, snapshotValue);
+		return snapshot;
+	}
+	return snapshotValue(value);
+}
+/** Compares nested enumerable state, supported mutable values, cycles and shared references. */
+function deepEqual(left, right) {
+	const leftToRight = /* @__PURE__ */ new Map();
+	const rightToLeft = /* @__PURE__ */ new Map();
+	function equal(leftValue, rightValue) {
+		if (Object.is(leftValue, rightValue)) {
+			if (isObject(leftValue)) {
+				if (leftToRight.has(leftValue) || rightToLeft.has(leftValue)) return leftToRight.get(leftValue) === leftValue && rightToLeft.get(leftValue) === leftValue;
+				leftToRight.set(leftValue, leftValue);
+				rightToLeft.set(leftValue, leftValue);
+			}
+			return true;
+		}
+		if (!isObject(leftValue) || !isObject(rightValue)) return false;
+		if (typeof leftValue === "function" || typeof rightValue === "function") return false;
+		if (Object.getPrototypeOf(leftValue) !== Object.getPrototypeOf(rightValue)) return false;
+		const kind = valueKind(leftValue);
+		if (kind === "opaque" || kind !== valueKind(rightValue)) return false;
+		if (leftToRight.has(leftValue) || rightToLeft.has(rightValue)) return leftToRight.get(leftValue) === rightValue && rightToLeft.get(rightValue) === leftValue;
+		leftToRight.set(leftValue, rightValue);
+		rightToLeft.set(rightValue, leftValue);
+		switch (kind) {
+			case "array":
+				if (leftValue.length !== rightValue.length) return false;
+				break;
+			case "date":
+				if (!Object.is(leftValue.getTime(), rightValue.getTime())) return false;
+				break;
+			case "regexp": {
+				const leftRegExp = leftValue;
+				const rightRegExp = rightValue;
+				if (leftRegExp.source !== rightRegExp.source || leftRegExp.flags !== rightRegExp.flags || leftRegExp.lastIndex !== rightRegExp.lastIndex) return false;
+				break;
+			}
+			case "map":
+				if (!equalMap(leftValue, rightValue, equal)) return false;
+				break;
+			case "set":
+				if (!equalSet(leftValue, rightValue, equal)) return false;
+				break;
+			case "record": break;
+		}
+		return equalEnumerableState(leftValue, rightValue, equal);
+	}
+	return equal(left, right);
+}
+/** Returns true for non-null object and function values. */
+function isObject(value) {
+	return typeof value === "object" && value !== null || typeof value === "function";
+}
+/** Classifies values with observable state supported by the deep snapshot. */
+function valueKind(value) {
+	const snapshotKind = SNAPSHOT_KINDS.get(value);
+	if (snapshotKind) return snapshotKind;
+	if (Array.isArray(value)) return "array";
+	const prototype = Object.getPrototypeOf(value);
+	if (value instanceof Date && prototype === Date.prototype) return "date";
+	if (value instanceof RegExp && prototype === RegExp.prototype) return "regexp";
+	if (value instanceof Map && prototype === Map.prototype) return "map";
+	if (value instanceof Set && prototype === Set.prototype) return "set";
+	return Object.prototype.toString.call(value) === "[object Object]" ? "record" : "opaque";
+}
+/** Copies enumerable own properties without retaining nested object references. */
+function copyEnumerableState(source, target, snapshot) {
+	for (const key of enumerableKeys(source)) if (!Object.prototype.hasOwnProperty.call(target, key)) Object.defineProperty(target, key, {
+		configurable: true,
+		enumerable: true,
+		value: snapshot(Reflect.get(source, key)),
+		writable: true
+	});
+}
+/** Compares enumerable own properties in linear time. */
+function equalEnumerableState(left, right, equal) {
+	const leftKeys = enumerableKeys(left);
+	if (leftKeys.length !== enumerableKeys(right).length) return false;
+	for (const key of leftKeys) if (!Object.prototype.propertyIsEnumerable.call(right, key) || !equal(Reflect.get(left, key), Reflect.get(right, key))) return false;
+	return true;
+}
+/** Lists enumerable string and symbol properties owned by a value. */
+function enumerableKeys(value) {
+	return Reflect.ownKeys(value).filter((key) => Object.prototype.propertyIsEnumerable.call(value, key));
+}
+/** Compares Maps in their observable iteration order. */
+function equalMap(left, right, equal) {
+	if (left.size !== right.size) return false;
+	const rightEntries = right.entries();
+	for (const [leftKey, leftValue] of left) {
+		const rightEntry = rightEntries.next();
+		if (rightEntry.done || !equal(leftKey, rightEntry.value[0]) || !equal(leftValue, rightEntry.value[1])) return false;
+	}
+	return true;
+}
+/** Compares Sets in their observable iteration order. */
+function equalSet(left, right, equal) {
+	if (left.size !== right.size) return false;
+	const rightValues = right.values();
+	for (const leftValue of left) {
+		const rightValue = rightValues.next();
+		if (rightValue.done || !equal(leftValue, rightValue.value)) return false;
+	}
+	return true;
+}
+//#endregion
+export { deepEqual, snapshotDeep };
+
+//# sourceMappingURL=deep-value.js.map

package/dist/internal/deep-value.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deep-value.js","names":[],"sources":["../../src/internal/deep-value.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Internal helpers for snapshotting and comparing nested JavaScript values.\n */\n\n/** Value categories whose mutable state can be captured without retaining the source object. */\ntype DeepValueKind = \"array\" | \"date\" | \"regexp\" | \"map\" | \"set\" | \"record\" | \"opaque\";\n\n/** Retains reliable kind metadata for snapshots whose prototypes may contain stateful getters. */\nconst SNAPSHOT_KINDS = new WeakMap<object, DeepValueKind>();\n\n/** Creates a detached snapshot of nested enumerable state and supported mutable value types. */\nexport function snapshotDeep(value: unknown): unknown {\n    const snapshots = new Map<object, unknown>();\n\n    function snapshotValue(current: unknown): unknown {\n        if (!isObject(current) || typeof current === \"function\") {\n            return current;\n        }\n\n        if (snapshots.has(current)) {\n            return snapshots.get(current);\n        }\n\n        const kind = valueKind(current);\n        let snapshot: object;\n        switch (kind) {\n            case \"array\":\n                snapshot = new Array((current as unknown[]).length);\n                break;\n            case \"date\":\n                snapshot = new Date((current as unknown as Date).getTime());\n                break;\n            case \"regexp\": {\n                const source = current as unknown as RegExp;\n                const regexp = new RegExp(source.source, source.flags);\n                regexp.lastIndex = source.lastIndex;\n                snapshot = regexp;\n                break;\n            }\n            case \"map\":\n                snapshot = new Map();\n                break;\n            case \"set\":\n                snapshot = new Set();\n                break;\n            case \"record\":\n                snapshot = Object.create(Object.getPrototypeOf(current)) as object;\n                break;\n            case \"opaque\":\n                return current;\n        }\n\n        if (kind === \"array\") {\n            Object.setPrototypeOf(snapshot, Object.getPrototypeOf(current));\n        }\n        SNAPSHOT_KINDS.set(snapshot, kind);\n        snapshots.set(current, snapshot);\n\n        if (kind === \"map\") {\n            const source = current as unknown as Map<unknown, unknown>;\n            const target = snapshot as Map<unknown, unknown>;\n            for (const [key, entryValue] of source) {\n                target.set(snapshotValue(key), snapshotValue(entryValue));\n            }\n        } else if (kind === \"set\") {\n            const source = current as unknown as Set<unknown>;\n            const target = snapshot as Set<unknown>;\n            for (const entryValue of source) {\n                target.add(snapshotValue(entryValue));\n            }\n        }\n\n        copyEnumerableState(current, snapshot, snapshotValue);\n        return snapshot;\n    }\n\n    return snapshotValue(value);\n}\n\n/** Compares nested enumerable state, supported mutable values, cycles and shared references. */\nexport function deepEqual(left: unknown, right: unknown): boolean {\n    const leftToRight = new Map<object, object>();\n    const rightToLeft = new Map<object, object>();\n\n    function equal(leftValue: unknown, rightValue: unknown): boolean {\n        if (Object.is(leftValue, rightValue)) {\n            if (isObject(leftValue)) {\n                if (leftToRight.has(leftValue) || rightToLeft.has(leftValue)) {\n                    return leftToRight.get(leftValue) === leftValue && rightToLeft.get(leftValue) === leftValue;\n                }\n                leftToRight.set(leftValue, leftValue);\n                rightToLeft.set(leftValue, leftValue);\n            }\n            return true;\n        }\n        if (!isObject(leftValue) || !isObject(rightValue)) {\n            return false;\n        }\n        if (typeof leftValue === \"function\" || typeof rightValue === \"function\") {\n            return false;\n        }\n        if (Object.getPrototypeOf(leftValue) !== Object.getPrototypeOf(rightValue)) {\n            return false;\n        }\n\n        const kind = valueKind(leftValue);\n        if (kind === \"opaque\" || kind !== valueKind(rightValue)) {\n            return false;\n        }\n        if (leftToRight.has(leftValue) || rightToLeft.has(rightValue)) {\n            return leftToRight.get(leftValue) === rightValue && rightToLeft.get(rightValue) === leftValue;\n        }\n        leftToRight.set(leftValue, rightValue);\n        rightToLeft.set(rightValue, leftValue);\n\n        switch (kind) {\n            case \"array\":\n                if ((leftValue as unknown[]).length !== (rightValue as unknown[]).length) {\n                    return false;\n                }\n                break;\n            case \"date\":\n                if (!Object.is((leftValue as Date).getTime(), (rightValue as Date).getTime())) {\n                    return false;\n                }\n                break;\n            case \"regexp\": {\n                const leftRegExp = leftValue as RegExp;\n                const rightRegExp = rightValue as RegExp;\n                if (leftRegExp.source !== rightRegExp.source\n                    || leftRegExp.flags !== rightRegExp.flags\n                    || leftRegExp.lastIndex !== rightRegExp.lastIndex) {\n                    return false;\n                }\n                break;\n            }\n            case \"map\":\n                if (!equalMap(leftValue as Map<unknown, unknown>, rightValue as Map<unknown, unknown>, equal)) {\n                    return false;\n                }\n                break;\n            case \"set\":\n                if (!equalSet(leftValue as Set<unknown>, rightValue as Set<unknown>, equal)) {\n                    return false;\n                }\n                break;\n            case \"record\":\n                break;\n        }\n        return equalEnumerableState(leftValue, rightValue, equal);\n    }\n\n    return equal(left, right);\n}\n\n/** Returns true for non-null object and function values. */\nfunction isObject(value: unknown): value is object {\n    return (typeof value === \"object\" && value !== null) || typeof value === \"function\";\n}\n\n/** Classifies values with observable state supported by the deep snapshot. */\nfunction valueKind(value: object): DeepValueKind {\n    const snapshotKind = SNAPSHOT_KINDS.get(value);\n    if (snapshotKind) {\n        return snapshotKind;\n    }\n    if (Array.isArray(value)) {\n        return \"array\";\n    }\n    const prototype = Object.getPrototypeOf(value);\n    if (value instanceof Date && prototype === Date.prototype) {\n        return \"date\";\n    }\n    if (value instanceof RegExp && prototype === RegExp.prototype) {\n        return \"regexp\";\n    }\n    if (value instanceof Map && prototype === Map.prototype) {\n        return \"map\";\n    }\n    if (value instanceof Set && prototype === Set.prototype) {\n        return \"set\";\n    }\n    return Object.prototype.toString.call(value) === \"[object Object]\" ? \"record\" : \"opaque\";\n}\n\n/** Copies enumerable own properties without retaining nested object references. */\nfunction copyEnumerableState(source: object, target: object, snapshot: (value: unknown) => unknown): void {\n    for (const key of enumerableKeys(source)) {\n        if (!Object.prototype.hasOwnProperty.call(target, key)) {\n            Object.defineProperty(target, key, {\n                configurable: true,\n                enumerable: true,\n                value: snapshot(Reflect.get(source, key)),\n                writable: true\n            });\n        }\n    }\n}\n\n/** Compares enumerable own properties in linear time. */\nfunction equalEnumerableState(\n    left: object,\n    right: object,\n    equal: (left: unknown, right: unknown) => boolean\n): boolean {\n    const leftKeys = enumerableKeys(left);\n    if (leftKeys.length !== enumerableKeys(right).length) {\n        return false;\n    }\n    for (const key of leftKeys) {\n        if (!Object.prototype.propertyIsEnumerable.call(right, key)\n            || !equal(Reflect.get(left, key), Reflect.get(right, key))) {\n            return false;\n        }\n    }\n    return true;\n}\n\n/** Lists enumerable string and symbol properties owned by a value. */\nfunction enumerableKeys(value: object): PropertyKey[] {\n    return Reflect.ownKeys(value).filter(key => Object.prototype.propertyIsEnumerable.call(value, key));\n}\n\n/** Compares Maps in their observable iteration order. */\nfunction equalMap(\n    left: Map<unknown, unknown>,\n    right: Map<unknown, unknown>,\n    equal: (left: unknown, right: unknown) => boolean\n): boolean {\n    if (left.size !== right.size) {\n        return false;\n    }\n    const rightEntries = right.entries();\n    for (const [leftKey, leftValue] of left) {\n        const rightEntry = rightEntries.next();\n        if (rightEntry.done || !equal(leftKey, rightEntry.value[0]) || !equal(leftValue, rightEntry.value[1])) {\n            return false;\n        }\n    }\n    return true;\n}\n\n/** Compares Sets in their observable iteration order. */\nfunction equalSet(\n    left: Set<unknown>,\n    right: Set<unknown>,\n    equal: (left: unknown, right: unknown) => boolean\n): boolean {\n    if (left.size !== right.size) {\n        return false;\n    }\n    const rightValues = right.values();\n    for (const leftValue of left) {\n        const rightValue = rightValues.next();\n        if (rightValue.done || !equal(leftValue, rightValue.value)) {\n            return false;\n        }\n    }\n    return true;\n}\n"],"mappings":";;AASA,IAAM,iCAAiB,IAAI,QAA+B;;AAG1D,SAAgB,aAAa,OAAyB;CAClD,MAAM,4BAAY,IAAI,IAAqB;CAE3C,SAAS,cAAc,SAA2B;EAC9C,IAAI,CAAC,SAAS,OAAO,KAAK,OAAO,YAAY,YACzC,OAAO;EAGX,IAAI,UAAU,IAAI,OAAO,GACrB,OAAO,UAAU,IAAI,OAAO;EAGhC,MAAM,OAAO,UAAU,OAAO;EAC9B,IAAI;EACJ,QAAQ,MAAR;GACI,KAAK;IACD,WAAW,IAAI,MAAO,QAAsB,MAAM;IAClD;GACJ,KAAK;IACD,WAAW,IAAI,KAAM,QAA4B,QAAQ,CAAC;IAC1D;GACJ,KAAK,UAAU;IACX,MAAM,SAAS;IACf,MAAM,SAAS,IAAI,OAAO,OAAO,QAAQ,OAAO,KAAK;IACrD,OAAO,YAAY,OAAO;IAC1B,WAAW;IACX;GACJ;GACA,KAAK;IACD,2BAAW,IAAI,IAAI;IACnB;GACJ,KAAK;IACD,2BAAW,IAAI,IAAI;IACnB;GACJ,KAAK;IACD,WAAW,OAAO,OAAO,OAAO,eAAe,OAAO,CAAC;IACvD;GACJ,KAAK,UACD,OAAO;EACf;EAEA,IAAI,SAAS,SACT,OAAO,eAAe,UAAU,OAAO,eAAe,OAAO,CAAC;EAElE,eAAe,IAAI,UAAU,IAAI;EACjC,UAAU,IAAI,SAAS,QAAQ;EAE/B,IAAI,SAAS,OAAO;GAChB,MAAM,SAAS;GACf,MAAM,SAAS;GACf,KAAK,MAAM,CAAC,KAAK,eAAe,QAC5B,OAAO,IAAI,cAAc,GAAG,GAAG,cAAc,UAAU,CAAC;EAEhE,OAAO,IAAI,SAAS,OAAO;GACvB,MAAM,SAAS;GACf,MAAM,SAAS;GACf,KAAK,MAAM,cAAc,QACrB,OAAO,IAAI,cAAc,UAAU,CAAC;EAE5C;EAEA,oBAAoB,SAAS,UAAU,aAAa;EACpD,OAAO;CACX;CAEA,OAAO,cAAc,KAAK;AAC9B;;AAGA,SAAgB,UAAU,MAAe,OAAyB;CAC9D,MAAM,8BAAc,IAAI,IAAoB;CAC5C,MAAM,8BAAc,IAAI,IAAoB;CAE5C,SAAS,MAAM,WAAoB,YAA8B;EAC7D,IAAI,OAAO,GAAG,WAAW,UAAU,GAAG;GAClC,IAAI,SAAS,SAAS,GAAG;IACrB,IAAI,YAAY,IAAI,SAAS,KAAK,YAAY,IAAI,SAAS,GACvD,OAAO,YAAY,IAAI,SAAS,MAAM,aAAa,YAAY,IAAI,SAAS,MAAM;IAEtF,YAAY,IAAI,WAAW,SAAS;IACpC,YAAY,IAAI,WAAW,SAAS;GACxC;GACA,OAAO;EACX;EACA,IAAI,CAAC,SAAS,SAAS,KAAK,CAAC,SAAS,UAAU,GAC5C,OAAO;EAEX,IAAI,OAAO,cAAc,cAAc,OAAO,eAAe,YACzD,OAAO;EAEX,IAAI,OAAO,eAAe,SAAS,MAAM,OAAO,eAAe,UAAU,GACrE,OAAO;EAGX,MAAM,OAAO,UAAU,SAAS;EAChC,IAAI,SAAS,YAAY,SAAS,UAAU,UAAU,GAClD,OAAO;EAEX,IAAI,YAAY,IAAI,SAAS,KAAK,YAAY,IAAI,UAAU,GACxD,OAAO,YAAY,IAAI,SAAS,MAAM,cAAc,YAAY,IAAI,UAAU,MAAM;EAExF,YAAY,IAAI,WAAW,UAAU;EACrC,YAAY,IAAI,YAAY,SAAS;EAErC,QAAQ,MAAR;GACI,KAAK;IACD,IAAK,UAAwB,WAAY,WAAyB,QAC9D,OAAO;IAEX;GACJ,KAAK;IACD,IAAI,CAAC,OAAO,GAAI,UAAmB,QAAQ,GAAI,WAAoB,QAAQ,CAAC,GACxE,OAAO;IAEX;GACJ,KAAK,UAAU;IACX,MAAM,aAAa;IACnB,MAAM,cAAc;IACpB,IAAI,WAAW,WAAW,YAAY,UAC/B,WAAW,UAAU,YAAY,SACjC,WAAW,cAAc,YAAY,WACxC,OAAO;IAEX;GACJ;GACA,KAAK;IACD,IAAI,CAAC,SAAS,WAAoC,YAAqC,KAAK,GACxF,OAAO;IAEX;GACJ,KAAK;IACD,IAAI,CAAC,SAAS,WAA2B,YAA4B,KAAK,GACtE,OAAO;IAEX;GACJ,KAAK,UACD;EACR;EACA,OAAO,qBAAqB,WAAW,YAAY,KAAK;CAC5D;CAEA,OAAO,MAAM,MAAM,KAAK;AAC5B;;AAGA,SAAS,SAAS,OAAiC;CAC/C,OAAQ,OAAO,UAAU,YAAY,UAAU,QAAS,OAAO,UAAU;AAC7E;;AAGA,SAAS,UAAU,OAA8B;CAC7C,MAAM,eAAe,eAAe,IAAI,KAAK;CAC7C,IAAI,cACA,OAAO;CAEX,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO;CAEX,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,IAAI,iBAAiB,QAAQ,cAAc,KAAK,WAC5C,OAAO;CAEX,IAAI,iBAAiB,UAAU,cAAc,OAAO,WAChD,OAAO;CAEX,IAAI,iBAAiB,OAAO,cAAc,IAAI,WAC1C,OAAO;CAEX,IAAI,iBAAiB,OAAO,cAAc,IAAI,WAC1C,OAAO;CAEX,OAAO,OAAO,UAAU,SAAS,KAAK,KAAK,MAAM,oBAAoB,WAAW;AACpF;;AAGA,SAAS,oBAAoB,QAAgB,QAAgB,UAA6C;CACtG,KAAK,MAAM,OAAO,eAAe,MAAM,GACnC,IAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GACjD,OAAO,eAAe,QAAQ,KAAK;EAC/B,cAAc;EACd,YAAY;EACZ,OAAO,SAAS,QAAQ,IAAI,QAAQ,GAAG,CAAC;EACxC,UAAU;CACd,CAAC;AAGb;;AAGA,SAAS,qBACL,MACA,OACA,OACO;CACP,MAAM,WAAW,eAAe,IAAI;CACpC,IAAI,SAAS,WAAW,eAAe,KAAK,CAAC,CAAC,QAC1C,OAAO;CAEX,KAAK,MAAM,OAAO,UACd,IAAI,CAAC,OAAO,UAAU,qBAAqB,KAAK,OAAO,GAAG,KACnD,CAAC,MAAM,QAAQ,IAAI,MAAM,GAAG,GAAG,QAAQ,IAAI,OAAO,GAAG,CAAC,GACzD,OAAO;CAGf,OAAO;AACX;;AAGA,SAAS,eAAe,OAA8B;CAClD,OAAO,QAAQ,QAAQ,KAAK,CAAC,CAAC,QAAO,QAAO,OAAO,UAAU,qBAAqB,KAAK,OAAO,GAAG,CAAC;AACtG;;AAGA,SAAS,SACL,MACA,OACA,OACO;CACP,IAAI,KAAK,SAAS,MAAM,MACpB,OAAO;CAEX,MAAM,eAAe,MAAM,QAAQ;CACnC,KAAK,MAAM,CAAC,SAAS,cAAc,MAAM;EACrC,MAAM,aAAa,aAAa,KAAK;EACrC,IAAI,WAAW,QAAQ,CAAC,MAAM,SAAS,WAAW,MAAM,EAAE,KAAK,CAAC,MAAM,WAAW,WAAW,MAAM,EAAE,GAChG,OAAO;CAEf;CACA,OAAO;AACX;;AAGA,SAAS,SACL,MACA,OACA,OACO;CACP,IAAI,KAAK,SAAS,MAAM,MACpB,OAAO;CAEX,MAAM,cAAc,MAAM,OAAO;CACjC,KAAK,MAAM,aAAa,MAAM;EAC1B,MAAM,aAAa,YAAY,KAAK;EACpC,IAAI,WAAW,QAAQ,CAAC,MAAM,WAAW,WAAW,KAAK,GACrD,OAAO;CAEf;CACA,OAAO;AACX"}

package/dist/internal/iterable-transform.d.ts

@@ -3,6 +3,13 @@
  * Internal iterable transformation helpers.
  */
 import { type AnyIterable } from "./iterable.js";
+/** Defines how adjacent selected keys are compared and retained. */
+export interface DistinctUntilChangedStrategy<K> {
+    /** Returns true when adjacent keys represent the same state. */
+    equals(previous: unknown, current: K): boolean;
+    /** Captures the state retained for the next comparison. */
+    snapshot(value: K): unknown;
+}
 /** Maps an iterable, preserving synchronous iteration when possible. */
 export declare function mapIterable<T, R>(source: AnyIterable<T>, mapper: (value: T) => R): AnyIterable<R>;
 /** Filters an iterable, preserving synchronous iteration when possible. */
@@ -18,7 +25,7 @@ export declare function skipWhileIterable<T>(source: AnyIterable<T>, predicate:
 /** Keeps the first value for every selected key, preserving synchronous iteration when possible. */
 export declare function distinctIterable<T, K>(source: AnyIterable<T>, keySelector: (value: T) => K): AnyIterable<T>;
 /** Keeps values whose selected key differs from the previous key. */
-export declare function distinctUntilChangedIterable<T, K>(source: AnyIterable<T>, keySelector: (value: T) => K): AnyIterable<T>;
+export declare function distinctUntilChangedIterable<T, K>(source: AnyIterable<T>, keySelector: (value: T) => K, strategy?: DistinctUntilChangedStrategy<K>): AnyIterable<T>;
 /** Emits a fallback value when the source is empty. */
 export declare function defaultIfEmptyIterable<T>(source: AnyIterable<T>, defaultValue: T): AnyIterable<T>;
 //# sourceMappingURL=iterable-transform.d.ts.map

package/dist/internal/iterable-transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"iterable-transform.d.ts","sourceRoot":"","sources":["../../src/internal/iterable-transform.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAC,KAAK,WAAW,EAAkB,MAAM,wBAAwB,CAAC;AAEzE,wEAAwE;AACxE,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAajG;AAED,2EAA2E;AAC3E,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAiB1G;AAED,mGAAmG;AACnG,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAmB7G;AAED,mGAAmG;AACnG,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAmB7G;AAED,sFAAsF;AACtF,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAuBrF;AAED,mGAAmG;AACnG,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAuB7G;AAED,oGAAoG;AACpG,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAuB3G;AAED,qEAAqE;AACrE,wBAAgB,4BAA4B,CAAC,CAAC,EAAE,CAAC,EAC7C,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EACtB,WAAW,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAC7B,WAAW,CAAC,CAAC,CAAC,CA2BhB;AAED,uDAAuD;AACvD,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAuBjG"}
+{"version":3,"file":"iterable-transform.d.ts","sourceRoot":"","sources":["../../src/internal/iterable-transform.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAC,KAAK,WAAW,EAAkB,MAAM,wBAAwB,CAAC;AAEzE,oEAAoE;AACpE,MAAM,WAAW,4BAA4B,CAAC,CAAC;IAC3C,gEAAgE;IAChE,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE/C,2DAA2D;IAC3D,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;CAC/B;AAED,wEAAwE;AACxE,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAajG;AAED,2EAA2E;AAC3E,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAiB1G;AAED,mGAAmG;AACnG,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAmB7G;AAED,mGAAmG;AACnG,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAmB7G;AAED,sFAAsF;AACtF,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAuBrF;AAED,mGAAmG;AACnG,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAuB7G;AAED,oGAAoG;AACpG,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAuB3G;AAED,qEAAqE;AACrE,wBAAgB,4BAA4B,CAAC,CAAC,EAAE,CAAC,EAC7C,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EACtB,WAAW,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,EAC5B,QAAQ,CAAC,EAAE,4BAA4B,CAAC,CAAC,CAAC,GAC3C,WAAW,CAAC,CAAC,CAAC,CA6BhB;AAED,uDAAuD;AACvD,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAuBjG"}

package/dist/internal/iterable-transform.js

@@ -108,15 +108,17 @@ function distinctIterable(source, keySelector) {
 	})();
 }
 /** Keeps values whose selected key differs from the previous key. */
-function distinctUntilChangedIterable(source, keySelector) {
+function distinctUntilChangedIterable(source, keySelector, strategy) {
+	const equals = strategy?.equals ?? Object.is;
+	const snapshot = strategy?.snapshot ?? ((value) => value);
 	if (isAsyncIterable(source)) return (async function* () {
 		let hasPrevious = false;
 		let previous;
 		for await (const value of source) {
 			const key = keySelector(value);
-			if (!hasPrevious || !Object.is(previous, key)) {
+			if (!hasPrevious || !equals(previous, key)) {
 				hasPrevious = true;
-				previous = key;
+				previous = snapshot(key);
 				yield value;
 			}
 		}
@@ -126,9 +128,9 @@ function distinctUntilChangedIterable(source, keySelector) {
 		let previous;
 		for (const value of source) {
 			const key = keySelector(value);
-			if (!hasPrevious || !Object.is(previous, key)) {
+			if (!hasPrevious || !equals(previous, key)) {
 				hasPrevious = true;
-				previous = key;
+				previous = snapshot(key);
 				yield value;
 			}
 		}

package/dist/internal/iterable-transform.js.map

@@ -1 +1 @@
-{"version":3,"file":"iterable-transform.js","names":[],"sources":["../../src/internal/iterable-transform.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Internal iterable transformation helpers.\n */\nimport {type AnyIterable, isAsyncIterable} from \"@/internal/iterable.js\";\n\n/** Maps an iterable, preserving synchronous iteration when possible. */\nexport function mapIterable<T, R>(source: AnyIterable<T>, mapper: (value: T) => R): AnyIterable<R> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                yield mapper(value);\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            yield mapper(value);\n        }\n    })();\n}\n\n/** Filters an iterable, preserving synchronous iteration when possible. */\nexport function filterIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                if (predicate(value)) {\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            if (predicate(value)) {\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Takes values while a predicate returns true, preserving synchronous iteration when possible. */\nexport function takeWhileIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                if (!predicate(value)) {\n                    return;\n                }\n                yield value;\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            if (!predicate(value)) {\n                return;\n            }\n            yield value;\n        }\n    })();\n}\n\n/** Takes values until a predicate returns true, preserving synchronous iteration when possible. */\nexport function takeUntilIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                yield value;\n                if (predicate(value)) {\n                    return;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            yield value;\n            if (predicate(value)) {\n                return;\n            }\n        }\n    })();\n}\n\n/** Skips a fixed number of values, preserving synchronous iteration when possible. */\nexport function skipIterable<T>(source: AnyIterable<T>, count: number): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let skipped = 0;\n            for await (const value of source) {\n                if (skipped < count) {\n                    skipped += 1;\n                } else {\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        let skipped = 0;\n        for (const value of source) {\n            if (skipped < count) {\n                skipped += 1;\n            } else {\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Skips values while a predicate returns true, preserving synchronous iteration when possible. */\nexport function skipWhileIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let skipping = true;\n            for await (const value of source) {\n                if (skipping && predicate(value)) {\n                    continue;\n                }\n                skipping = false;\n                yield value;\n            }\n        })();\n    }\n    return (function* () {\n        let skipping = true;\n        for (const value of source) {\n            if (skipping && predicate(value)) {\n                continue;\n            }\n            skipping = false;\n            yield value;\n        }\n    })();\n}\n\n/** Keeps the first value for every selected key, preserving synchronous iteration when possible. */\nexport function distinctIterable<T, K>(source: AnyIterable<T>, keySelector: (value: T) => K): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            const seen = new Set<K>();\n            for await (const value of source) {\n                const key = keySelector(value);\n                if (!seen.has(key)) {\n                    seen.add(key);\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        const seen = new Set<K>();\n        for (const value of source) {\n            const key = keySelector(value);\n            if (!seen.has(key)) {\n                seen.add(key);\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Keeps values whose selected key differs from the previous key. */\nexport function distinctUntilChangedIterable<T, K>(\n    source: AnyIterable<T>,\n    keySelector: (value: T) => K\n): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let hasPrevious = false;\n            let previous: K | undefined;\n            for await (const value of source) {\n                const key = keySelector(value);\n                if (!hasPrevious || !Object.is(previous, key)) {\n                    hasPrevious = true;\n                    previous = key;\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        let hasPrevious = false;\n        let previous: K | undefined;\n        for (const value of source) {\n            const key = keySelector(value);\n            if (!hasPrevious || !Object.is(previous, key)) {\n                hasPrevious = true;\n                previous = key;\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Emits a fallback value when the source is empty. */\nexport function defaultIfEmptyIterable<T>(source: AnyIterable<T>, defaultValue: T): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let empty = true;\n            for await (const value of source) {\n                empty = false;\n                yield value;\n            }\n            if (empty) {\n                yield defaultValue;\n            }\n        })();\n    }\n    return (function* () {\n        let empty = true;\n        for (const value of source) {\n            empty = false;\n            yield value;\n        }\n        if (empty) {\n            yield defaultValue;\n        }\n    })();\n}\n"],"mappings":";;;;;;;AAOA,SAAgB,YAAkB,QAAwB,QAAyC;CAC/F,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QACtB,MAAM,OAAO,KAAK;CAE1B,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAChB,MAAM,OAAO,KAAK;CAE1B,EAAA,CAAG;AACP;;AAGA,SAAgB,eAAkB,QAAwB,WAAkD;CACxG,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QACtB,IAAI,UAAU,KAAK,GACf,MAAM;CAGlB,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAChB,IAAI,UAAU,KAAK,GACf,MAAM;CAGlB,EAAA,CAAG;AACP;;AAGA,SAAgB,kBAAqB,QAAwB,WAAkD;CAC3G,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QAAQ;GAC9B,IAAI,CAAC,UAAU,KAAK,GAChB;GAEJ,MAAM;EACV;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAAQ;GACxB,IAAI,CAAC,UAAU,KAAK,GAChB;GAEJ,MAAM;EACV;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,kBAAqB,QAAwB,WAAkD;CAC3G,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QAAQ;GAC9B,MAAM;GACN,IAAI,UAAU,KAAK,GACf;EAER;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAAQ;GACxB,MAAM;GACN,IAAI,UAAU,KAAK,GACf;EAER;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,aAAgB,QAAwB,OAA+B;CACnF,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,UAAU;EACd,WAAW,MAAM,SAAS,QACtB,IAAI,UAAU,OACV,WAAW;OAEX,MAAM;CAGlB,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,QAChB,IAAI,UAAU,OACV,WAAW;OAEX,MAAM;CAGlB,EAAA,CAAG;AACP;;AAGA,SAAgB,kBAAqB,QAAwB,WAAkD;CAC3G,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,WAAW;EACf,WAAW,MAAM,SAAS,QAAQ;GAC9B,IAAI,YAAY,UAAU,KAAK,GAC3B;GAEJ,WAAW;GACX,MAAM;EACV;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,WAAW;EACf,KAAK,MAAM,SAAS,QAAQ;GACxB,IAAI,YAAY,UAAU,KAAK,GAC3B;GAEJ,WAAW;GACX,MAAM;EACV;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,iBAAuB,QAAwB,aAA8C;CACzG,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,MAAM,uBAAO,IAAI,IAAO;EACxB,WAAW,MAAM,SAAS,QAAQ;GAC9B,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAChB,KAAK,IAAI,GAAG;IACZ,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,MAAM,uBAAO,IAAI,IAAO;EACxB,KAAK,MAAM,SAAS,QAAQ;GACxB,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAChB,KAAK,IAAI,GAAG;IACZ,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,6BACZ,QACA,aACc;CACd,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,cAAc;EAClB,IAAI;EACJ,WAAW,MAAM,SAAS,QAAQ;GAC9B,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,eAAe,CAAC,OAAO,GAAG,UAAU,GAAG,GAAG;IAC3C,cAAc;IACd,WAAW;IACX,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,cAAc;EAClB,IAAI;EACJ,KAAK,MAAM,SAAS,QAAQ;GACxB,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,eAAe,CAAC,OAAO,GAAG,UAAU,GAAG,GAAG;IAC3C,cAAc;IACd,WAAW;IACX,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,uBAA0B,QAAwB,cAAiC;CAC/F,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,QAAQ;EACZ,WAAW,MAAM,SAAS,QAAQ;GAC9B,QAAQ;GACR,MAAM;EACV;EACA,IAAI,OACA,MAAM;CAEd,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,QAAQ;GACxB,QAAQ;GACR,MAAM;EACV;EACA,IAAI,OACA,MAAM;CAEd,EAAA,CAAG;AACP"}
+{"version":3,"file":"iterable-transform.js","names":[],"sources":["../../src/internal/iterable-transform.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Internal iterable transformation helpers.\n */\nimport {type AnyIterable, isAsyncIterable} from \"@/internal/iterable.js\";\n\n/** Defines how adjacent selected keys are compared and retained. */\nexport interface DistinctUntilChangedStrategy<K> {\n    /** Returns true when adjacent keys represent the same state. */\n    equals(previous: unknown, current: K): boolean;\n\n    /** Captures the state retained for the next comparison. */\n    snapshot(value: K): unknown;\n}\n\n/** Maps an iterable, preserving synchronous iteration when possible. */\nexport function mapIterable<T, R>(source: AnyIterable<T>, mapper: (value: T) => R): AnyIterable<R> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                yield mapper(value);\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            yield mapper(value);\n        }\n    })();\n}\n\n/** Filters an iterable, preserving synchronous iteration when possible. */\nexport function filterIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                if (predicate(value)) {\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            if (predicate(value)) {\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Takes values while a predicate returns true, preserving synchronous iteration when possible. */\nexport function takeWhileIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                if (!predicate(value)) {\n                    return;\n                }\n                yield value;\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            if (!predicate(value)) {\n                return;\n            }\n            yield value;\n        }\n    })();\n}\n\n/** Takes values until a predicate returns true, preserving synchronous iteration when possible. */\nexport function takeUntilIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            for await (const value of source) {\n                yield value;\n                if (predicate(value)) {\n                    return;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        for (const value of source) {\n            yield value;\n            if (predicate(value)) {\n                return;\n            }\n        }\n    })();\n}\n\n/** Skips a fixed number of values, preserving synchronous iteration when possible. */\nexport function skipIterable<T>(source: AnyIterable<T>, count: number): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let skipped = 0;\n            for await (const value of source) {\n                if (skipped < count) {\n                    skipped += 1;\n                } else {\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        let skipped = 0;\n        for (const value of source) {\n            if (skipped < count) {\n                skipped += 1;\n            } else {\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Skips values while a predicate returns true, preserving synchronous iteration when possible. */\nexport function skipWhileIterable<T>(source: AnyIterable<T>, predicate: (value: T) => boolean): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let skipping = true;\n            for await (const value of source) {\n                if (skipping && predicate(value)) {\n                    continue;\n                }\n                skipping = false;\n                yield value;\n            }\n        })();\n    }\n    return (function* () {\n        let skipping = true;\n        for (const value of source) {\n            if (skipping && predicate(value)) {\n                continue;\n            }\n            skipping = false;\n            yield value;\n        }\n    })();\n}\n\n/** Keeps the first value for every selected key, preserving synchronous iteration when possible. */\nexport function distinctIterable<T, K>(source: AnyIterable<T>, keySelector: (value: T) => K): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            const seen = new Set<K>();\n            for await (const value of source) {\n                const key = keySelector(value);\n                if (!seen.has(key)) {\n                    seen.add(key);\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        const seen = new Set<K>();\n        for (const value of source) {\n            const key = keySelector(value);\n            if (!seen.has(key)) {\n                seen.add(key);\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Keeps values whose selected key differs from the previous key. */\nexport function distinctUntilChangedIterable<T, K>(\n    source: AnyIterable<T>,\n    keySelector: (value: T) => K,\n    strategy?: DistinctUntilChangedStrategy<K>\n): AnyIterable<T> {\n    const equals = strategy?.equals ?? Object.is;\n    const snapshot = strategy?.snapshot ?? ((value: K): unknown => value);\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let hasPrevious = false;\n            let previous: unknown;\n            for await (const value of source) {\n                const key = keySelector(value);\n                if (!hasPrevious || !equals(previous, key)) {\n                    hasPrevious = true;\n                    previous = snapshot(key);\n                    yield value;\n                }\n            }\n        })();\n    }\n    return (function* () {\n        let hasPrevious = false;\n        let previous: unknown;\n        for (const value of source) {\n            const key = keySelector(value);\n            if (!hasPrevious || !equals(previous, key)) {\n                hasPrevious = true;\n                previous = snapshot(key);\n                yield value;\n            }\n        }\n    })();\n}\n\n/** Emits a fallback value when the source is empty. */\nexport function defaultIfEmptyIterable<T>(source: AnyIterable<T>, defaultValue: T): AnyIterable<T> {\n    if (isAsyncIterable<T>(source)) {\n        return (async function* () {\n            let empty = true;\n            for await (const value of source) {\n                empty = false;\n                yield value;\n            }\n            if (empty) {\n                yield defaultValue;\n            }\n        })();\n    }\n    return (function* () {\n        let empty = true;\n        for (const value of source) {\n            empty = false;\n            yield value;\n        }\n        if (empty) {\n            yield defaultValue;\n        }\n    })();\n}\n"],"mappings":";;;;;;;AAgBA,SAAgB,YAAkB,QAAwB,QAAyC;CAC/F,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QACtB,MAAM,OAAO,KAAK;CAE1B,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAChB,MAAM,OAAO,KAAK;CAE1B,EAAA,CAAG;AACP;;AAGA,SAAgB,eAAkB,QAAwB,WAAkD;CACxG,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QACtB,IAAI,UAAU,KAAK,GACf,MAAM;CAGlB,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAChB,IAAI,UAAU,KAAK,GACf,MAAM;CAGlB,EAAA,CAAG;AACP;;AAGA,SAAgB,kBAAqB,QAAwB,WAAkD;CAC3G,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QAAQ;GAC9B,IAAI,CAAC,UAAU,KAAK,GAChB;GAEJ,MAAM;EACV;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAAQ;GACxB,IAAI,CAAC,UAAU,KAAK,GAChB;GAEJ,MAAM;EACV;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,kBAAqB,QAAwB,WAAkD;CAC3G,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,WAAW,MAAM,SAAS,QAAQ;GAC9B,MAAM;GACN,IAAI,UAAU,KAAK,GACf;EAER;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,KAAK,MAAM,SAAS,QAAQ;GACxB,MAAM;GACN,IAAI,UAAU,KAAK,GACf;EAER;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,aAAgB,QAAwB,OAA+B;CACnF,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,UAAU;EACd,WAAW,MAAM,SAAS,QACtB,IAAI,UAAU,OACV,WAAW;OAEX,MAAM;CAGlB,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,QAChB,IAAI,UAAU,OACV,WAAW;OAEX,MAAM;CAGlB,EAAA,CAAG;AACP;;AAGA,SAAgB,kBAAqB,QAAwB,WAAkD;CAC3G,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,WAAW;EACf,WAAW,MAAM,SAAS,QAAQ;GAC9B,IAAI,YAAY,UAAU,KAAK,GAC3B;GAEJ,WAAW;GACX,MAAM;EACV;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,WAAW;EACf,KAAK,MAAM,SAAS,QAAQ;GACxB,IAAI,YAAY,UAAU,KAAK,GAC3B;GAEJ,WAAW;GACX,MAAM;EACV;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,iBAAuB,QAAwB,aAA8C;CACzG,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,MAAM,uBAAO,IAAI,IAAO;EACxB,WAAW,MAAM,SAAS,QAAQ;GAC9B,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAChB,KAAK,IAAI,GAAG;IACZ,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,MAAM,uBAAO,IAAI,IAAO;EACxB,KAAK,MAAM,SAAS,QAAQ;GACxB,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAChB,KAAK,IAAI,GAAG;IACZ,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,6BACZ,QACA,aACA,UACc;CACd,MAAM,SAAS,UAAU,UAAU,OAAO;CAC1C,MAAM,WAAW,UAAU,cAAc,UAAsB;CAC/D,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,cAAc;EAClB,IAAI;EACJ,WAAW,MAAM,SAAS,QAAQ;GAC9B,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,eAAe,CAAC,OAAO,UAAU,GAAG,GAAG;IACxC,cAAc;IACd,WAAW,SAAS,GAAG;IACvB,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,cAAc;EAClB,IAAI;EACJ,KAAK,MAAM,SAAS,QAAQ;GACxB,MAAM,MAAM,YAAY,KAAK;GAC7B,IAAI,CAAC,eAAe,CAAC,OAAO,UAAU,GAAG,GAAG;IACxC,cAAc;IACd,WAAW,SAAS,GAAG;IACvB,MAAM;GACV;EACJ;CACJ,EAAA,CAAG;AACP;;AAGA,SAAgB,uBAA0B,QAAwB,cAAiC;CAC/F,IAAI,gBAAmB,MAAM,GACzB,QAAQ,mBAAmB;EACvB,IAAI,QAAQ;EACZ,WAAW,MAAM,SAAS,QAAQ;GAC9B,QAAQ;GACR,MAAM;EACV;EACA,IAAI,OACA,MAAM;CAEd,EAAA,CAAG;CAEP,QAAQ,aAAa;EACjB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,QAAQ;GACxB,QAAQ;GACR,MAAM;EACV;EACA,IAAI,OACA,MAAM;CAEd,EAAA,CAAG;AACP"}

package/dist/internal/iteration-demand.d.ts

@@ -0,0 +1,18 @@
+/** Internal subscriber hook that exposes an already-known upstream demand batch. */
+export declare const ITERATION_DEMAND_HINT: unique symbol;
+/** Subscriber shape that can propagate a demand hint before source assembly. */
+export interface IterationDemandAware {
+    /** Returns the demand batch that this subscriber will request upstream. */
+    [ITERATION_DEMAND_HINT]?(): number | undefined;
+}
+/** Marks nested iteration as an unbounded terminal drain. */
+export declare function markUnboundedIteration(signal: AbortSignal): void;
+/** Marks a signal when a subscriber already knows it will request unbounded demand. */
+export declare function applyIterationDemandHint(signal: AbortSignal, subscriber: unknown): void;
+/** Reads an internal demand hint without exposing it through the public Subscriber contract. */
+export declare function iterationDemandHint(subscriber: unknown): number | undefined;
+/** Returns true when nested Publisher bridges may request unbounded demand once. */
+export declare function isUnboundedIteration(signal: AbortSignal): boolean;
+/** Propagates unbounded iteration metadata to a derived cancellation signal. */
+export declare function inheritIterationDemand(parent: AbortSignal, child: AbortSignal): void;
+//# sourceMappingURL=iteration-demand.d.ts.map

package/dist/internal/iteration-demand.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"iteration-demand.d.ts","sourceRoot":"","sources":["../../src/internal/iteration-demand.ts"],"names":[],"mappings":"AAMA,oFAAoF;AACpF,eAAO,MAAM,qBAAqB,eAAkC,CAAC;AAErE,gFAAgF;AAChF,MAAM,WAAW,oBAAoB;IACjC,2EAA2E;IAC3E,CAAC,qBAAqB,CAAC,CAAC,IAAI,MAAM,GAAG,SAAS,CAAC;CAClD;AAKD,6DAA6D;AAC7D,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,CAEhE;AAED,uFAAuF;AACvF,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,GAAG,IAAI,CAKvF;AAED,gGAAgG;AAChG,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,CAE3E;AAED,oFAAoF;AACpF,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAEjE;AAED,gFAAgF;AAChF,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CAIpF"}

package/dist/internal/iteration-demand.js

@@ -0,0 +1,34 @@
+import { UNBOUNDED_DEMAND } from "../core/demand.js";
+//#region src/internal/iteration-demand.ts
+/**
+* @packageDocumentation
+* Internal demand metadata propagated through nested iterable operator paths.
+*/
+/** Internal subscriber hook that exposes an already-known upstream demand batch. */
+var ITERATION_DEMAND_HINT = Symbol("iteration-demand-hint");
+/** Signals whose enclosing subscriber requested unbounded demand. */
+var UNBOUNDED_SIGNALS = /* @__PURE__ */ new WeakSet();
+/** Marks nested iteration as an unbounded terminal drain. */
+function markUnboundedIteration(signal) {
+	UNBOUNDED_SIGNALS.add(signal);
+}
+/** Marks a signal when a subscriber already knows it will request unbounded demand. */
+function applyIterationDemandHint(signal, subscriber) {
+	if (iterationDemandHint(subscriber) === UNBOUNDED_DEMAND) markUnboundedIteration(signal);
+}
+/** Reads an internal demand hint without exposing it through the public Subscriber contract. */
+function iterationDemandHint(subscriber) {
+	return subscriber?.[ITERATION_DEMAND_HINT]?.();
+}
+/** Returns true when nested Publisher bridges may request unbounded demand once. */
+function isUnboundedIteration(signal) {
+	return UNBOUNDED_SIGNALS.has(signal);
+}
+/** Propagates unbounded iteration metadata to a derived cancellation signal. */
+function inheritIterationDemand(parent, child) {
+	if (isUnboundedIteration(parent)) markUnboundedIteration(child);
+}
+//#endregion
+export { ITERATION_DEMAND_HINT, applyIterationDemandHint, inheritIterationDemand, isUnboundedIteration, iterationDemandHint, markUnboundedIteration };
+
+//# sourceMappingURL=iteration-demand.js.map

package/dist/internal/iteration-demand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iteration-demand.js","names":[],"sources":["../../src/internal/iteration-demand.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Internal demand metadata propagated through nested iterable operator paths.\n */\nimport {UNBOUNDED_DEMAND} from \"@/core/demand.js\";\n\n/** Internal subscriber hook that exposes an already-known upstream demand batch. */\nexport const ITERATION_DEMAND_HINT = Symbol(\"iteration-demand-hint\");\n\n/** Subscriber shape that can propagate a demand hint before source assembly. */\nexport interface IterationDemandAware {\n    /** Returns the demand batch that this subscriber will request upstream. */\n    [ITERATION_DEMAND_HINT]?(): number | undefined;\n}\n\n/** Signals whose enclosing subscriber requested unbounded demand. */\nconst UNBOUNDED_SIGNALS = new WeakSet<AbortSignal>();\n\n/** Marks nested iteration as an unbounded terminal drain. */\nexport function markUnboundedIteration(signal: AbortSignal): void {\n    UNBOUNDED_SIGNALS.add(signal);\n}\n\n/** Marks a signal when a subscriber already knows it will request unbounded demand. */\nexport function applyIterationDemandHint(signal: AbortSignal, subscriber: unknown): void {\n    const demand = iterationDemandHint(subscriber);\n    if (demand === UNBOUNDED_DEMAND) {\n        markUnboundedIteration(signal);\n    }\n}\n\n/** Reads an internal demand hint without exposing it through the public Subscriber contract. */\nexport function iterationDemandHint(subscriber: unknown): number | undefined {\n    return (subscriber as IterationDemandAware | null | undefined)?.[ITERATION_DEMAND_HINT]?.();\n}\n\n/** Returns true when nested Publisher bridges may request unbounded demand once. */\nexport function isUnboundedIteration(signal: AbortSignal): boolean {\n    return UNBOUNDED_SIGNALS.has(signal);\n}\n\n/** Propagates unbounded iteration metadata to a derived cancellation signal. */\nexport function inheritIterationDemand(parent: AbortSignal, child: AbortSignal): void {\n    if (isUnboundedIteration(parent)) {\n        markUnboundedIteration(child);\n    }\n}\n"],"mappings":";;;;;;;AAOA,IAAa,wBAAwB,OAAO,uBAAuB;;AASnE,IAAM,oCAAoB,IAAI,QAAqB;;AAGnD,SAAgB,uBAAuB,QAA2B;CAC9D,kBAAkB,IAAI,MAAM;AAChC;;AAGA,SAAgB,yBAAyB,QAAqB,YAA2B;CAErF,IADe,oBAAoB,UAC/B,MAAW,kBACX,uBAAuB,MAAM;AAErC;;AAGA,SAAgB,oBAAoB,YAAyC;CACzE,OAAQ,aAAyD,sBAAsB,GAAG;AAC9F;;AAGA,SAAgB,qBAAqB,QAA8B;CAC/D,OAAO,kBAAkB,IAAI,MAAM;AACvC;;AAGA,SAAgB,uBAAuB,QAAqB,OAA0B;CAClF,IAAI,qBAAqB,MAAM,GAC3B,uBAAuB,KAAK;AAEpC"}

package/dist/internal/publisher-terminal.d.ts

@@ -0,0 +1,25 @@
+/**
+ * @packageDocumentation
+ * Direct Publisher terminal-consumption primitives.
+ */
+import type { Context } from "../context/context.js";
+import type { Publisher } from "../publisher/publisher.js";
+/** Stateful terminal reduction performed directly from Publisher signals. */
+export interface TerminalCollector<T, R> {
+    /** Consumes one value and returns true when the terminal result is already known. */
+    onNext(value: T): boolean;
+    /** Produces the terminal result after completion or an early match. */
+    result(): R;
+}
+/**
+ * Subscribes directly to a Publisher, requests one configured batch and reduces
+ * signals without crossing the pull-based async-iterator bridge.
+ */
+export declare function consumePublisher<T, R>(publisher: Publisher<T>, signal: AbortSignal, context: Context, request: number, collector: TerminalCollector<T, R>): Promise<R>;
+/** Collects every Publisher value with one unbounded upstream request. */
+export declare function collectPublisher<T>(publisher: Publisher<T>, signal: AbortSignal, context: Context): Promise<T[]>;
+/** Returns the last Publisher value after consuming it with unbounded demand. */
+export declare function lastPublisherValue<T>(publisher: Publisher<T>, signal: AbortSignal, context: Context): Promise<T | undefined>;
+/** Consumes and discards every Publisher value with one unbounded request. */
+export declare function drainPublisher(publisher: Publisher<unknown>, signal: AbortSignal, context: Context): Promise<void>;
+//# sourceMappingURL=publisher-terminal.d.ts.map

package/dist/internal/publisher-terminal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"publisher-terminal.d.ts","sourceRoot":"","sources":["../../src/internal/publisher-terminal.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAC,OAAO,EAAC,MAAM,sBAAsB,CAAC;AAIlD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAIxD,6EAA6E;AAC7E,MAAM,WAAW,iBAAiB,CAAC,CAAC,EAAE,CAAC;IACnC,qFAAqF;IACrF,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAE1B,uEAAuE;IACvE,MAAM,IAAI,CAAC,CAAC;CACf;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EACjC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,GACnC,OAAO,CAAC,CAAC,CAAC,CA0GZ;AAED,0EAA0E;AAC1E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAUhH;AAED,iFAAiF;AACjF,wBAAgB,kBAAkB,CAAC,CAAC,EAChC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,OAAO,GACjB,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAUxB;AAED,8EAA8E;AAC9E,wBAAgB,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAKlH"}

package/dist/internal/publisher-terminal.js

@@ -0,0 +1,128 @@
+import { UNBOUNDED_DEMAND } from "../core/demand.js";
+import { CancelledError } from "../errors/classes.js";
+import { ITERATION_DEMAND_HINT } from "./iteration-demand.js";
+//#region src/internal/publisher-terminal.ts
+/**
+* Subscribes directly to a Publisher, requests one configured batch and reduces
+* signals without crossing the pull-based async-iterator bridge.
+*/
+function consumePublisher(publisher, signal, context, request, collector) {
+	return new Promise((resolve, reject) => {
+		let subscription;
+		let subscribed = false;
+		let terminated = false;
+		const cleanup = () => signal.removeEventListener("abort", onAbort);
+		const terminate = () => {
+			if (terminated) return false;
+			terminated = true;
+			cleanup();
+			return true;
+		};
+		const cancelUpstream = () => {
+			try {
+				subscription?.cancel();
+			} catch {}
+		};
+		const fail = (error, cancel) => {
+			if (!terminate()) return;
+			if (cancel) cancelUpstream();
+			reject(error);
+		};
+		const complete = (cancel) => {
+			if (!terminate()) return;
+			if (cancel) cancelUpstream();
+			try {
+				resolve(collector.result());
+			} catch (error) {
+				reject(error);
+			}
+		};
+		function onAbort() {
+			fail(new CancelledError(), true);
+		}
+		if (signal.aborted) {
+			reject(new CancelledError());
+			return;
+		}
+		signal.addEventListener("abort", onAbort, { once: true });
+		const subscriber = {
+			/** Propagates the configured terminal batch through nested iterable operators. */
+			[ITERATION_DEMAND_HINT]: () => request,
+			/** Exposes the downstream context to context-aware Publisher sources. */
+			currentContext: () => context,
+			/** Stores the subscription and starts the configured terminal batch. */
+			onSubscribe(nextSubscription) {
+				if (subscribed || terminated) {
+					try {
+						nextSubscription.cancel();
+					} catch {}
+					return;
+				}
+				subscribed = true;
+				subscription = nextSubscription;
+				try {
+					nextSubscription.request(request);
+				} catch (error) {
+					fail(error, true);
+				}
+			},
+			/** Reduces a value and cancels immediately when the result is known. */
+			onNext(value) {
+				if (terminated) return;
+				try {
+					if (collector.onNext(value)) complete(true);
+				} catch (error) {
+					fail(error, true);
+				}
+			},
+			/** Forwards the first Publisher failure. */
+			onError(error) {
+				fail(error, false);
+			},
+			/** Produces the collected result after normal completion. */
+			onComplete() {
+				complete(false);
+			}
+		};
+		try {
+			publisher.subscribe(subscriber);
+		} catch (error) {
+			fail(error, true);
+		}
+	});
+}
+/** Collects every Publisher value with one unbounded upstream request. */
+function collectPublisher(publisher, signal, context) {
+	const values = [];
+	return consumePublisher(publisher, signal, context, UNBOUNDED_DEMAND, {
+		/** Appends one source value to the result array. */
+		onNext(value) {
+			values.push(value);
+			return false;
+		},
+		result: () => values
+	});
+}
+/** Returns the last Publisher value after consuming it with unbounded demand. */
+function lastPublisherValue(publisher, signal, context) {
+	let last;
+	return consumePublisher(publisher, signal, context, UNBOUNDED_DEMAND, {
+		/** Replaces the previously observed last value. */
+		onNext(value) {
+			last = value;
+			return false;
+		},
+		result: () => last
+	});
+}
+/** Consumes and discards every Publisher value with one unbounded request. */
+function drainPublisher(publisher, signal, context) {
+	return consumePublisher(publisher, signal, context, UNBOUNDED_DEMAND, {
+		onNext: () => false,
+		result: () => void 0
+	});
+}
+//#endregion
+export { collectPublisher, consumePublisher, drainPublisher, lastPublisherValue };
+
+//# sourceMappingURL=publisher-terminal.js.map