reactor-core-ts 3.2.1 → 3.2.3

package/LICENSE.md

@@ -0,0 +1,56 @@
+GNU LESSER GENERAL PUBLIC LICENSE
+Version 3, 29 June 2007
+
+Copyright © 2007 Free Software Foundation, Inc. <https://fsf.org/>
+
+Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
+
+This version of the GNU Lesser General Public License incorporates the terms and conditions of version 3 of the GNU General Public License, supplemented by the additional permissions listed below.
+
+0. Additional Definitions.
+As used herein, “this License” refers to version 3 of the GNU Lesser General Public License, and the “GNU GPL” refers to version 3 of the GNU General Public License.
+
+“The Library” refers to a covered work governed by this License, other than an Application or a Combined Work as defined below.
+
+An “Application” is any work that makes use of an interface provided by the Library, but which is not otherwise based on the Library. Defining a subclass of a class defined by the Library is deemed a mode of using an interface provided by the Library.
+
+A “Combined Work” is a work produced by combining or linking an Application with the Library. The particular version of the Library with which the Combined Work was made is also called the “Linked Version”.
+
+The “Minimal Corresponding Source” for a Combined Work means the Corresponding Source for the Combined Work, excluding any source code for portions of the Combined Work that, considered in isolation, are based on the Application, and not on the Linked Version.
+
+The “Corresponding Application Code” for a Combined Work means the object code and/or source code for the Application, including any data and utility programs needed for reproducing the Combined Work from the Application, but excluding the System Libraries of the Combined Work.
+
+1. Exception to Section 3 of the GNU GPL.
+You may convey a covered work under sections 3 and 4 of this License without being bound by section 3 of the GNU GPL.
+
+2. Conveying Modified Versions.
+If you modify a copy of the Library, and, in your modifications, a facility refers to a function or data to be supplied by an Application that uses the facility (other than as an argument passed when the facility is invoked), then you may convey a copy of the modified version:
+
+a) under this License, provided that you make a good faith effort to ensure that, in the event an Application does not supply the function or data, the facility still operates, and performs whatever part of its purpose remains meaningful, or
+b) under the GNU GPL, with none of the additional permissions of this License applicable to that copy.
+3. Object Code Incorporating Material from Library Header Files.
+The object code form of an Application may incorporate material from a header file that is part of the Library. You may convey such object code under terms of your choice, provided that, if the incorporated material is not limited to numerical parameters, data structure layouts and accessors, or small macros, inline functions and templates (ten or fewer lines in length), you do both of the following:
+
+a) Give prominent notice with each copy of the object code that the Library is used in it and that the Library and its use are covered by this License.
+b) Accompany the object code with a copy of the GNU GPL and this license document.
+4. Combined Works.
+You may convey a Combined Work under terms of your choice that, taken together, effectively do not restrict modification of the portions of the Library contained in the Combined Work and reverse engineering for debugging such modifications, if you also do each of the following:
+
+a) Give prominent notice with each copy of the Combined Work that the Library is used in it and that the Library and its use are covered by this License.
+b) Accompany the Combined Work with a copy of the GNU GPL and this license document.
+c) For a Combined Work that displays copyright notices during execution, include the copyright notice for the Library among these notices, as well as a reference directing the user to the copies of the GNU GPL and this license document.
+d) Do one of the following:
+0) Convey the Minimal Corresponding Source under the terms of this License, and the Corresponding Application Code in a form suitable for, and under terms that permit, the user to recombine or relink the Application with a modified version of the Linked Version to produce a modified Combined Work, in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source.
+1) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (a) uses at run time a copy of the Library already present on the user's computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version.
+e) Provide Installation Information, but only if you would otherwise be required to provide such information under section 6 of the GNU GPL, and only to the extent that such information is necessary to install and execute a modified version of the Combined Work produced by recombining or relinking the Application with a modified version of the Linked Version. (If you use option 4d0, the Installation Information must accompany the Minimal Corresponding Source and Corresponding Application Code. If you use option 4d1, you must provide the Installation Information in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source.)
+5. Combined Libraries.
+You may place library facilities that are a work based on the Library side by side in a single library together with other library facilities that are not Applications and are not covered by this License, and convey such a combined library under terms of your choice, if you do both of the following:
+
+a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities, conveyed under the terms of this License.
+b) Give prominent notice with the combined library that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work.
+6. Revised Versions of the GNU Lesser General Public License.
+The Free Software Foundation may publish revised and/or new versions of the GNU Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Library as you received it specifies that a certain numbered version of the GNU Lesser General Public License “or any later version” applies to it, you have the option of following the terms and conditions either of that published version or of any later version published by the Free Software Foundation. If the Library as you received it does not specify a version number of the GNU Lesser General Public License, you may choose any version of the GNU Lesser General Public License ever published by the Free Software Foundation.
+
+If the Library as you received it specifies that a proxy can decide whether future versions of the GNU Lesser General Public License shall apply, that proxy's public statement of acceptance of any version is permanent authorization for you to choose that version for the Library.

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.js

@@ -5,8 +5,8 @@
 */
 /** Validates and normalizes a Reactive Streams request amount. */
 function normalizeRequest(n) {
-	if (!Number.isFinite(n)) return Number.POSITIVE_INFINITY;
-	if (!Number.isInteger(n) || n <= 0) throw new RangeError("request amount must be a strictly positive integer");
+	if (n === Number.POSITIVE_INFINITY) return Number.POSITIVE_INFINITY;
+	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. */

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 (!Number.isFinite(n)) {\n        return Number.POSITIVE_INFINITY;\n    }\n    if (!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,CAAC,OAAO,SAAS,CAAC,GAClB,OAAO,OAAO;CAElB,IAAI,CAAC,OAAO,UAAU,CAAC,KAAK,KAAK,GAC7B,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/** 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"}

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/publisher/flux.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"flux.d.ts","sourceRoot":"","sources":["../../src/publisher/flux.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAC,OAAO,EAAC,MAAM,sBAAsB,CAAC;AAC7C,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,2BAA2B,CAAC;AAK3D,OAAO,EAGH,KAAK,WAAW,EAKnB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EAAc,KAAK,oBAAoB,EAAkB,MAAM,gCAAgC,CAAC;AACvG,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAGxD,OAAO,KAAK,EAAC,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAC,MAAM,sBAAsB,CAAC;AAE1F,OAAO,KAAK,EAAC,aAAa,EAAE,SAAS,EAAC,MAAM,uBAAuB,CAAC;AAEpE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,8BAA8B,CAAC;AAG7D,2EAA2E;AAC3E,qBAAa,IAAI,CAAC,CAAC,CAAE,YAAW,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;IAC1D,4EAA4E;IAC5E,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAmB;IAEjD,iDAAiD;IACjD,YAAmB,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,EAEjD;IAED,wEAAwE;IACxE,OAAc,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQtD;IAED,6DAA6D;IAC7D,OAAc,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAMxD;IAED,4EAA4E;IAC5E,OAAc,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAG9E;IAED,iDAAiD;IACjD,OAAc,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAM1D;IAED,4FAA4F;IAC5F,OAAc,SAAS,CAAC,CAAC,SAAS,MAAM,cAAc,EAClD,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,EACP,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,8FAA8F;IAC9F,OAAc,SAAS,CAAC,CAAC,SAAS,MAAM,gBAAgB,EACpD,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,CAAC,EACP,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,iGAAiG;IACjG,OAAc,SAAS,CAAC,CAAC,SAAS,MAAM,mBAAmB,EACvD,MAAM,EAAE,WAAW,EACnB,IAAI,EAAE,CAAC,EACP,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,8FAA8F;IAC9F,OAAc,SAAS,CAAC,MAAM,SAAS,KAAK,GAAG,KAAK,EAChD,MAAM,EAAE,WAAW,EACnB,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,MAAM,CAAC,CAAC;IAUhB,4DAA4D;IAC5D,OAAc,aAAa,CAAC,CAAC,GAAG,OAAO,EACnC,GAAG,EAAE,MAAM,GAAG,GAAG,EACjB,OAAO,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,oBAAoB,GACnD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,4DAA4D;IAC5D,OAAc,aAAa,CAAC,CAAC,GAAG,OAAO,EACnC,MAAM,EAAE,SAAS,EACjB,OAAO,CAAC,EAAE,oBAAoB,GAC/B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IASzB,kFAAkF;IAClF,OAAc,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAuBvD;IAED,6DAA6D;IAC7D,OAAc,KAAK,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAExC;IAED,oEAAoE;IACpE,OAAc,KAAK,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAExC;IAED,8DAA8D;IAC9D,OAAc,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAIxE;IAED,sDAAsD;IACtD,OAAc,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAEjE;IAED,iEAAiE;IACjE,OAAc,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,WAAW,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE/F;IAED,0EAA0E;IAC1E,OAAc,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CA+C9D;IAED,uFAAuF;IACvF,OAAc,IAAI,CAAC,CAAC,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE5D;IAED,8EAA8E;IAC9E,OAAc,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE;QACxC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACrB,QAAQ,IAAI,IAAI,CAAC;QACjB,KAAK,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAA;KAC9B,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAmCnB;IAED,sCAAsC;IACtC,OAAc,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAY9D;IAED,gEAAgE;IAChE,OAAc,QAAQ,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,GAAE,SAAgC,GAAG,IAAI,CAAC,MAAM,CAAC,CAWvG;IAED,8CAA8C;IAC9C,OAAc,KAAK,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQxE;IAED,gGAAgG;IAChG,OAAc,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQlF;IAED,6EAA6E;IAC7E,OAAc,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAElF;IAED,4FAA4F;IAC5F,OAAc,yBAAyB,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAE5F;IAED,2EAA2E;IAC3E,OAAc,cAAc,CAAC,CAAC,EAC1B,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAGT;IAED,4FAA4F;IAC5F,OAAc,wBAAwB,CAAC,CAAC,EACpC,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAGT;IAED,wEAAwE;IACxE,OAAc,YAAY,CAAC,CAAC,EACxB,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,oDAAoD;IACpD,OAAc,aAAa,CAAC,CAAC,EACzB,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,yEAAyE;IACzE,OAAc,uBAAuB,CAAC,CAAC,EACnC,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,oDAAoD;IACpD,OAAc,MAAM,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAiBzE;IAED,6GAA6G;IAC7G,OAAc,gBAAgB,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQnF;IAED,qDAAqD;IACrD,OAAc,KAAK,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAExE;IAED,qDAAqD;IACrD,OAAc,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CA+ClF;IAED,iFAAiF;IACjF,OAAc,cAAc,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAiCjF;IAED,+DAA+D;IAC/D,OAAc,GAAG,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EACjD,OAAO,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE,EACjD,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAC9B,IAAI,CAAC,CAAC,CAAC,CAqCT;IAED,iFAAiF;IACjF,OAAc,aAAa,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EAC3D,OAAO,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE,EACjD,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAC9B,IAAI,CAAC,CAAC,CAAC,CA0CT;IAED,2EAA2E;IAC3E,OAAc,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAkDjF;IAED,2FAA2F;IAC3F,OAAc,KAAK,CAAC,CAAC,EAAE,CAAC,EACpB,gBAAgB,EAAE,MAAM,CAAC,EACzB,aAAa,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EACjD,eAAe,GAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,IAA6C,GAChF,IAAI,CAAC,CAAC,CAAC,CAWT;IAED,yFAAyF;IACzF,OAAc,SAAS,CAAC,CAAC,EAAE,CAAC,EACxB,gBAAgB,EAAE,cAAc,CAAC,CAAC,CAAC,EACnC,aAAa,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EACjD,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,OAAO,CAAC,EACxD,UAAU,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,KAAK,cAAc,CAAC,OAAO,CAAC,EACrE,WAAW,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,OAAO,CAAC,GACvD,IAAI,CAAC,CAAC,CAAC,CAyBT;IAED,qDAAqD;IAC9C,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClD,0DAA0D;IACnD,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,EAAE,UAAU,CAAC,EAAE,MAAM,IAAI,GAAG,UAAU,CAAC;IA4BvH,wEAAwE;IACxE,SAAS,CAAC,eAAe,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAMzD;IAED,qFAAqF;IAC9E,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,GAAE,OAAyB,GAAG,WAAW,CAAC,CAAC,CAAC,CAEtF;IAED,gDAAgD;IACzC,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAoBhD;IAED,8CAA8C;IACvC,UAAU,IAAI,aAAa,CAAC,CAAC,CAAC,CAEpC;IAED,yCAAyC;IAC5B,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAEnC;IAED,4EAA4E;IAC/D,SAAS,IAAI,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAE/C;CACJ"}
+{"version":3,"file":"flux.d.ts","sourceRoot":"","sources":["../../src/publisher/flux.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAC,OAAO,EAAC,MAAM,sBAAsB,CAAC;AAC7C,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,2BAA2B,CAAC;AAK3D,OAAO,EAGH,KAAK,WAAW,EAKnB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EAAc,KAAK,oBAAoB,EAAkB,MAAM,gCAAgC,CAAC;AACvG,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,0BAA0B,CAAC;AAGxD,OAAO,KAAK,EAAC,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAC,MAAM,sBAAsB,CAAC;AAE1F,OAAO,KAAK,EAAC,aAAa,EAAE,SAAS,EAAC,MAAM,uBAAuB,CAAC;AAEpE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,8BAA8B,CAAC;AAG7D,2EAA2E;AAC3E,qBAAa,IAAI,CAAC,CAAC,CAAE,YAAW,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;IAC1D,4EAA4E;IAC5E,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAmB;IAEjD,iDAAiD;IACjD,YAAmB,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,EAEjD;IAED,wEAAwE;IACxE,OAAc,IAAI,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQtD;IAED,6DAA6D;IAC7D,OAAc,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAMxD;IAED,4EAA4E;IAC5E,OAAc,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAG9E;IAED,iDAAiD;IACjD,OAAc,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAM1D;IAED,4FAA4F;IAC5F,OAAc,SAAS,CAAC,CAAC,SAAS,MAAM,cAAc,EAClD,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,EACP,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,8FAA8F;IAC9F,OAAc,SAAS,CAAC,CAAC,SAAS,MAAM,gBAAgB,EACpD,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,CAAC,EACP,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,iGAAiG;IACjG,OAAc,SAAS,CAAC,CAAC,SAAS,MAAM,mBAAmB,EACvD,MAAM,EAAE,WAAW,EACnB,IAAI,EAAE,CAAC,EACP,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,8FAA8F;IAC9F,OAAc,SAAS,CAAC,MAAM,SAAS,KAAK,GAAG,KAAK,EAChD,MAAM,EAAE,WAAW,EACnB,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,OAAO,GAAG,uBAAuB,GAC5C,IAAI,CAAC,MAAM,CAAC,CAAC;IAUhB,4DAA4D;IAC5D,OAAc,aAAa,CAAC,CAAC,GAAG,OAAO,EACnC,GAAG,EAAE,MAAM,GAAG,GAAG,EACjB,OAAO,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,oBAAoB,GACnD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,4DAA4D;IAC5D,OAAc,aAAa,CAAC,CAAC,GAAG,OAAO,EACnC,MAAM,EAAE,SAAS,EACjB,OAAO,CAAC,EAAE,oBAAoB,GAC/B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IASzB,kFAAkF;IAClF,OAAc,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAuBvD;IAED,6DAA6D;IAC7D,OAAc,KAAK,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAExC;IAED,oEAAoE;IACpE,OAAc,KAAK,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAExC;IAED,8DAA8D;IAC9D,OAAc,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAIxE;IAED,sDAAsD;IACtD,OAAc,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAEjE;IAED,iEAAiE;IACjE,OAAc,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,WAAW,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE/F;IAED,0EAA0E;IAC1E,OAAc,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CA+C9D;IAED,uFAAuF;IACvF,OAAc,IAAI,CAAC,CAAC,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE5D;IAED,8EAA8E;IAC9E,OAAc,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE;QACxC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACrB,QAAQ,IAAI,IAAI,CAAC;QACjB,KAAK,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAA;KAC9B,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAmCnB;IAED,sCAAsC;IACtC,OAAc,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAY9D;IAED,gEAAgE;IAChE,OAAc,QAAQ,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,GAAE,SAAgC,GAAG,IAAI,CAAC,MAAM,CAAC,CAWvG;IAED,8CAA8C;IAC9C,OAAc,KAAK,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQxE;IAED,gGAAgG;IAChG,OAAc,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQlF;IAED,6EAA6E;IAC7E,OAAc,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAElF;IAED,4FAA4F;IAC5F,OAAc,yBAAyB,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAE5F;IAED,2EAA2E;IAC3E,OAAc,cAAc,CAAC,CAAC,EAC1B,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAGT;IAED,4FAA4F;IAC5F,OAAc,wBAAwB,CAAC,CAAC,EACpC,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAGT;IAED,wEAAwE;IACxE,OAAc,YAAY,CAAC,CAAC,EACxB,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,oDAAoD;IACpD,OAAc,aAAa,CAAC,CAAC,EACzB,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,yEAAyE;IACzE,OAAc,uBAAuB,CAAC,CAAC,EACnC,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,EACxE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GACzC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,oDAAoD;IACpD,OAAc,MAAM,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAiBzE;IAED,6GAA6G;IAC7G,OAAc,gBAAgB,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAQnF;IAED,qDAAqD;IACrD,OAAc,KAAK,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAExE;IAED,qDAAqD;IACrD,OAAc,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CA+ClF;IAED,iFAAiF;IACjF,OAAc,cAAc,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAiCjF;IAED,+DAA+D;IAC/D,OAAc,GAAG,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EACjD,OAAO,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE,EACjD,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAC9B,IAAI,CAAC,CAAC,CAAC,CAqCT;IAED,iFAAiF;IACjF,OAAc,aAAa,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EAC3D,OAAO,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE,EACjD,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAC9B,IAAI,CAAC,CAAC,CAAC,CA0CT;IAED,2EAA2E;IAC3E,OAAc,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAkDjF;IAED,2FAA2F;IAC3F,OAAc,KAAK,CAAC,CAAC,EAAE,CAAC,EACpB,gBAAgB,EAAE,MAAM,CAAC,EACzB,aAAa,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EACjD,eAAe,GAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,IAA6C,GAChF,IAAI,CAAC,CAAC,CAAC,CAWT;IAED,yFAAyF;IACzF,OAAc,SAAS,CAAC,CAAC,EAAE,CAAC,EACxB,gBAAgB,EAAE,cAAc,CAAC,CAAC,CAAC,EACnC,aAAa,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EACjD,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,OAAO,CAAC,EACxD,UAAU,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,KAAK,cAAc,CAAC,OAAO,CAAC,EACrE,WAAW,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,OAAO,CAAC,GACvD,IAAI,CAAC,CAAC,CAAC,CAyBT;IAED,qDAAqD;IAC9C,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClD,0DAA0D;IACnD,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,EAAE,UAAU,CAAC,EAAE,MAAM,IAAI,GAAG,UAAU,CAAC;IA4BvH,wEAAwE;IACxE,SAAS,CAAC,eAAe,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAMzD;IAED,qFAAqF;IAC9E,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,GAAE,OAAyB,GAAG,WAAW,CAAC,CAAC,CAAC,CAEtF;IAED,gDAAgD;IACzC,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAoBhD;IAED,8CAA8C;IACvC,UAAU,IAAI,aAAa,CAAC,CAAC,CAAC,CAEpC;IAED,yCAAyC;IAC5B,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAEnC;IAED,4EAA4E;IAC/D,SAAS,IAAI,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAE/C;CACJ"}

package/dist/publisher/flux.js

@@ -3,6 +3,7 @@ import { Context } from "../context/context.js";
 import { EMPTY_ITERABLE, closeAsyncIterator, isAsyncIterable, isIterable, neverIterable, toAsyncIterator } from "../internal/iterable.js";
 import { mapIterable } from "../internal/iterable-transform.js";
 import { BooleanDisposable } from "../core/boolean-disposable.js";
+import { addCap } from "../core/demand.js";
 import { CompositeError } from "../errors/classes.js";
 import { asError, throwIfNullish } from "../errors/helpers.js";
 import { firstValueFrom, raceWithAbort } from "../internal/abort.js";
@@ -65,9 +66,9 @@ var Flux = class Flux {
 	static from(input) {
 		throwIfNullish(input, "input");
 		if (input instanceof Flux) return input;
+		if (typeof input.subscribe === "function") return fromPublisher(input);
 		if (isAsyncIterable(input)) return new Flux(() => input);
 		if (isIterable(input)) return Flux.fromIterable(input);
-		if (typeof input.subscribe === "function") return fromPublisher(input);
 		if (typeof input.then === "function") return new Flux(async function* (signal) {
 			const value = await raceWithAbort(Promise.resolve(input), signal);
 			if (value !== void 0 && value !== null) yield value;
@@ -552,31 +553,100 @@ function throwUnhandledSubscriberError(error) {
 }
 /** Adapts a Reactive Streams publisher to the Flux async-iteration model. */
 function fromPublisher(publisher) {
-	return new Flux((signal, context) => {
-		const queue = new AsyncQueue(signal);
+	return new PublisherFlux(publisher);
+}
+/** Flux adapter that keeps Reactive Streams subscriptions on their native demand path. */
+var PublisherFlux = class extends Flux {
+	/** Creates a direct Flux adapter for a Reactive Streams publisher. */
+	constructor(publisher) {
+		super((signal) => publisherAsyncIterable(publisher, signal));
+		_defineProperty(this, "publisher", void 0);
+		this.publisher = publisher;
+	}
+	/** Subscribes directly so request amounts are not converted to iterator pulls. */
+	subscribeActual(subscriber) {
+		this.publisher.subscribe(subscriber);
+	}
+};
+/** Adapts a publisher to pull-based async iteration without requesting it unboundedly. */
+function publisherAsyncIterable(publisher, signal) {
+	return { 
+	/** Creates one pull-based iterator and its dedicated publisher subscription. */
+[Symbol.asyncIterator]() {
+		const queue = new AsyncQueue();
 		let subscription;
-		publisher.subscribe({
-			/** Captures upstream subscription and requests unbounded demand. */
-			onSubscribe(nextSubscription) {
-				subscription = nextSubscription;
-				nextSubscription.request(Number.POSITIVE_INFINITY);
-			},
-			/** Pushes upstream values into the bridge queue. */
-			onNext(value) {
-				queue.push(value);
-			},
-			/** Fails the bridge queue with the upstream error. */
-			onError(error) {
+		let pendingDemand = 0;
+		let terminated = signal.aborted;
+		const cleanup = () => signal.removeEventListener("abort", cancel);
+		const cancel = () => {
+			if (terminated) return;
+			terminated = true;
+			cleanup();
+			subscription?.cancel();
+			queue.return();
+		};
+		if (terminated) queue.complete();
+		else {
+			signal.addEventListener("abort", cancel, { once: true });
+			try {
+				publisher.subscribe({
+					/** Stores the upstream and drains any pulls made before onSubscribe. */
+					onSubscribe(nextSubscription) {
+						if (subscription || terminated) {
+							nextSubscription.cancel();
+							return;
+						}
+						subscription = nextSubscription;
+						if (pendingDemand > 0) {
+							const request = pendingDemand;
+							pendingDemand = 0;
+							nextSubscription.request(request);
+						}
+					},
+					/** Queues one publisher value for an async iterator pull. */
+					onNext(value) {
+						queue.push(value);
+					},
+					/** Propagates the terminal publisher error to the iterator. */
+					onError(error) {
+						if (terminated) return;
+						terminated = true;
+						cleanup();
+						queue.error(error);
+					},
+					/** Completes the iterator when the publisher completes. */
+					onComplete() {
+						if (terminated) return;
+						terminated = true;
+						cleanup();
+						queue.complete();
+					}
+				});
+			} catch (error) {
+				terminated = true;
+				cleanup();
 				queue.error(error);
+			}
+		}
+		return {
+			/** Requests exactly one upstream item for one iterator pull. */
+			next() {
+				if (!terminated) if (subscription) subscription.request(1);
+				else pendingDemand = addCap(pendingDemand, 1);
+				return queue.next();
 			},
-			/** Completes the bridge queue when upstream completes. */
-			onComplete() {
-				queue.complete();
+			/** Cancels upstream when iteration stops early. */
+			return() {
+				cancel();
+				return queue.return();
+			},
+			/** Cancels upstream and rejects the iterator with the supplied error. */
+			throw(error) {
+				cancel();
+				return Promise.reject(error);
 			}
-		});
-		signal.addEventListener("abort", () => subscription?.cancel(), { once: true });
-		return queue;
-	});
+		};
+	} };
 }
 /** Adapts publisher inputs to Flux instances without callback allocation. */
 function toFluxArray(sources) {