@vielzeug/flux 26.11.12 → 26.11.13

package/dist/operators/filtering.js

@@ -1,11 +1,10 @@
 import { link as e } from "../_link.js";
 import { assertDuration as t, assertNonNegativeInteger as n } from "../_numeric.js";
-import { defaultScheduler as r } from "../_scheduler.js";
-import { stream as i } from "../core.js";
-import { FluxTimeoutError as a } from "../errors.js";
+import { stream as r } from "../core.js";
+import { FluxTimeoutError as i } from "../errors.js";
 // src/operators/filtering.ts
 function take(t) {
-	return n(t, "take count"), (n) => i((r, i) => {
+	return n(t, "take count"), (n) => r((r, i) => {
 		if (t === 0) {
 			r.complete();
 			return;
@@ -24,7 +23,7 @@ function isAbortSignal(e) {
 	return typeof e.aborted == "boolean" && typeof e.addEventListener == "function" && typeof e.removeEventListener == "function";
 }
 function takeUntil(t) {
-	return (n) => i((r, i) => {
+	return (n) => r((r, i) => {
 		let a, o, removeNotifier = () => {}, complete = () => {
 			a?.unsubscribe(), o?.unsubscribe(), r.complete();
 		};
@@ -48,42 +47,45 @@ function takeUntil(t) {
 	});
 }
 function debounce(n) {
-	return t(n, "Debounce duration"), (t) => i((i, a) => {
-		let o, s, c = !1, flush = () => {
-			o = void 0, c && (c = !1, i.next(s));
-		}, l = e(t, {
+	return t(n, "Debounce duration"), (t) => r((r, i) => {
+		let cancel, a, o = !1, flush = () => {
+			cancel = void 0, o && (o = !1, r.next(a));
+		}, s = e(t, {
 			complete() {
-				o?.(), flush(), i.complete();
+				cancel?.(), flush(), r.complete();
 			},
-			error: i.error,
+			error: r.error,
 			next(e) {
-				s = e, c = !0, o?.(), o = r.delay(flush, n);
+				a = e, o = !0, cancel?.();
+				let t = setTimeout(flush, n);
+				cancel = () => clearTimeout(t);
 			}
-		}, a);
+		}, i);
 		return () => {
-			o?.(), l.unsubscribe();
+			cancel?.(), s.unsubscribe();
 		};
 	});
 }
 function timeout(n) {
-	return t(n, "Timeout duration"), (t) => i((i, o) => {
-		let s, start = () => {
-			s = r.delay(() => i.error(new a(n)), n);
+	return t(n, "Timeout duration"), (t) => r((r, a) => {
+		let cancel, start = () => {
+			let e = setTimeout(() => r.error(new i(n)), n);
+			cancel = () => clearTimeout(e);
 		};
 		start();
-		let c = e(t, {
+		let o = e(t, {
 			complete() {
-				s(), i.complete();
+				cancel(), r.complete();
 			},
 			error(e) {
-				s(), i.error(e);
+				cancel(), r.error(e);
 			},
 			next(e) {
-				s(), start(), i.next(e);
+				cancel(), start(), r.next(e);
 			}
-		}, o);
+		}, a);
 		return () => {
-			s(), c.unsubscribe();
+			cancel(), o.unsubscribe();
 		};
 	});
 }

package/dist/operators/filtering.js.map

@@ -1 +1 @@
-{"version":3,"file":"filtering.js","names":["assertNonNegativeInteger","count","stream","seen","subscriptionRef","link","source","sink","value","signal","sourceSubscription","notifierSubscription","notifier","assertDuration","duration","cancel","pending","hasPending","subscription","defaultScheduler","FluxTimeoutError","reason"],"sources":["../../src/operators/filtering.ts"],"sourcesContent":["import { link } from '../_link.js';\nimport { assertDuration, assertNonNegativeInteger } from '../_numeric.js';\nimport { defaultScheduler } from '../_scheduler.js';\nimport { stream } from '../core.js';\nimport { FluxTimeoutError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport function take<T>(count: number): Operator<T, T> {\n  assertNonNegativeInteger(count, 'take count');\n\n  return (source) =>\n    stream((sink, signal) => {\n      if (count === 0) {\n        sink.complete();\n\n        return;\n      }\n\n      let seen = 0;\n      const subscriptionRef: { current?: Subscription } = {};\n\n      subscriptionRef.current = link(\n        source,\n        {\n          complete: sink.complete,\n          error: sink.error,\n          next(value) {\n            sink.next(value);\n            seen++;\n\n            if (seen === count) {\n              sink.complete();\n              subscriptionRef.current?.unsubscribe();\n            }\n          },\n        },\n        signal,\n      );\n\n      return () => subscriptionRef.current?.unsubscribe();\n    });\n}\n\nfunction isAbortSignal(value: AbortSignal | Stream<unknown>): value is AbortSignal {\n  return (\n    typeof (value as AbortSignal).aborted === 'boolean' &&\n    typeof (value as AbortSignal).addEventListener === 'function' &&\n    typeof (value as AbortSignal).removeEventListener === 'function'\n  );\n}\n\nexport function takeUntil<T>(notifier: AbortSignal | Stream<unknown>): Operator<T, T> {\n  return (source) =>\n    stream((sink, signal) => {\n      let sourceSubscription: Subscription | undefined;\n      let notifierSubscription: Subscription | undefined;\n      let removeNotifier = (): void => {};\n\n      const complete = (): void => {\n        sourceSubscription?.unsubscribe();\n        notifierSubscription?.unsubscribe();\n        sink.complete();\n      };\n\n      if (isAbortSignal(notifier)) {\n        if (notifier.aborted) {\n          sink.complete();\n\n          return;\n        }\n\n        notifier.addEventListener('abort', complete, { once: true });\n        removeNotifier = (): void => notifier.removeEventListener('abort', complete);\n      } else {\n        notifierSubscription = link(notifier, { error: sink.error, next: complete }, signal);\n      }\n\n      if (!signal.aborted) {\n        sourceSubscription = link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next: sink.next,\n          },\n          signal,\n        );\n      }\n\n      return () => {\n        removeNotifier();\n        sourceSubscription?.unsubscribe();\n        notifierSubscription?.unsubscribe();\n      };\n    });\n}\n\nexport function debounce<T>(duration: number): Operator<T, T> {\n  assertDuration(duration, 'Debounce duration');\n\n  return (source) =>\n    stream((sink, signal) => {\n      let cancel: (() => void) | undefined;\n      let pending: T | undefined;\n      let hasPending = false;\n\n      const flush = (): void => {\n        cancel = undefined;\n\n        if (!hasPending) return;\n\n        hasPending = false;\n        sink.next(pending as T);\n      };\n\n      const subscription = link(\n        source,\n        {\n          complete() {\n            cancel?.();\n            flush();\n            sink.complete();\n          },\n          error: sink.error,\n          next(value) {\n            pending = value;\n            hasPending = true;\n            cancel?.();\n            cancel = defaultScheduler.delay(flush, duration);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        cancel?.();\n        subscription.unsubscribe();\n      };\n    });\n}\n\nexport function timeout<T>(duration: number): Operator<T, T> {\n  assertDuration(duration, 'Timeout duration');\n\n  return (source) =>\n    stream((sink, signal) => {\n      let cancel: () => void;\n\n      const start = (): void => {\n        cancel = defaultScheduler.delay(() => sink.error(new FluxTimeoutError(duration)), duration);\n      };\n\n      start();\n\n      const subscription = link(\n        source,\n        {\n          complete() {\n            cancel();\n            sink.complete();\n          },\n          error(reason) {\n            cancel();\n            sink.error(reason);\n          },\n          next(value) {\n            cancel();\n            start();\n            sink.next(value);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        cancel();\n        subscription.unsubscribe();\n      };\n    });\n}\n"],"mappings":";;;;;;AAOA,SAAgB,KAAQ,GAA+B;CAGrD,OAFAA,EAAyBC,GAAO,YAAY,IAEpC,MACNC,GAAQ,GAAM,MAAW;EACvB,IAAID,MAAU,GAAG;GACf,EAAK,SAAS;GAEd;EACF;EAEA,IAAIE,IAAO,GACLC,IAA8C,CAAC;EAoBrD,OAlBA,EAAgB,UAAUC,EACxBC,GACA;GACE,UAAUC,EAAK;GACf,OAAOA,EAAK;GACZ,KAAK,GAAO;IAIV,AAHAA,EAAK,KAAKC,CAAK,GACf,KAEIL,MAASF,MACXM,EAAK,SAAS,GACdH,EAAgB,SAAS,YAAY;GAEzC;EACF,GACAK,CACF,SAEaL,EAAgB,SAAS,YAAY;CACpD,CAAC;AACL;AAEA,SAAS,cAAc,GAA4D;CACjF,OACE,OAAQI,EAAsB,WAAY,aAC1C,OAAQA,EAAsB,oBAAqB,cACnD,OAAQA,EAAsB,uBAAwB;AAE1D;AAEA,SAAgB,UAAa,GAAyD;CACpF,QAAQ,MACNN,GAAQ,GAAM,MAAW;EACvB,IAAIQ,GACAC,GACA,uBAA6B,CAAC,GAE5B,iBAAuB;GAG3B,AAFAD,GAAoB,YAAY,GAChCC,GAAsB,YAAY,GAClCJ,EAAK,SAAS;EAChB;EAEA,IAAI,cAAcK,CAAQ,GAAG;GAC3B,IAAIA,EAAS,SAAS;IACpB,EAAK,SAAS;IAEd;GACF;GAGA,AADAA,EAAS,iBAAiB,SAAS,UAAU,EAAE,MAAM,GAAK,CAAC,GAC3D,uBAA6BA,EAAS,oBAAoB,SAAS,QAAQ;EAC7E,OACE,IAAuBP,EAAKO,GAAU;GAAE,OAAOL,EAAK;GAAO,MAAM;EAAS,GAAGE,CAAM;EAerF,OAZKA,EAAO,YACV,IAAqBJ,EACnBC,GACA;GACE,UAAUC,EAAK;GACf,OAAOA,EAAK;GACZ,MAAMA,EAAK;EACb,GACAE,CACF,UAGW;GAGX,AAFA,eAAe,GACfC,GAAoB,YAAY,GAChCC,GAAsB,YAAY;EACpC;CACF,CAAC;AACL;AAEA,SAAgB,SAAY,GAAkC;CAG5D,OAFAE,EAAeC,GAAU,mBAAmB,IAEpC,MACNZ,GAAQ,GAAM,MAAW;EACvB,IAAIa,GACAC,GACAC,IAAa,IAEX,cAAoB;GAGxB,AAFA,IAAS,KAAA,GAEJA,MAEL,IAAa,IACbV,EAAK,KAAKS,CAAY;EACxB,GAEME,IAAeb,EACnBC,GACA;GACE,WAAW;IAGT,AAFAS,IAAS,GACT,MAAM,GACNR,EAAK,SAAS;GAChB;GACA,OAAOA,EAAK;GACZ,KAAK,GAAO;IAIV,AAHA,IAAUC,GACV,IAAa,IACbO,IAAS,GACT,IAASI,EAAiB,MAAM,OAAOL,CAAQ;GACjD;EACF,GACAL,CACF;EAEA,aAAa;GAEX,AADAM,IAAS,GACTG,EAAa,YAAY;EAC3B;CACF,CAAC;AACL;AAEA,SAAgB,QAAW,GAAkC;CAG3D,OAFAL,EAAeC,GAAU,kBAAkB,IAEnC,MACNZ,GAAQ,GAAM,MAAW;EACvB,IAAIa,GAEE,cAAoB;GACxB,IAASI,EAAiB,YAAYZ,EAAK,MAAM,IAAIa,EAAiBN,CAAQ,CAAC,GAAGA,CAAQ;EAC5F;EAEA,MAAM;EAEN,IAAMI,IAAeb,EACnBC,GACA;GACE,WAAW;IAET,AADAS,EAAO,GACPR,EAAK,SAAS;GAChB;GACA,MAAM,GAAQ;IAEZ,AADAQ,EAAO,GACPR,EAAK,MAAMc,CAAM;GACnB;GACA,KAAK,GAAO;IAGV,AAFAN,EAAO,GACP,MAAM,GACNR,EAAK,KAAKC,CAAK;GACjB;EACF,GACAC,CACF;EAEA,aAAa;GAEX,AADAM,EAAO,GACPG,EAAa,YAAY;EAC3B;CACF,CAAC;AACL"}
+{"version":3,"file":"filtering.js","names":["assertNonNegativeInteger","count","stream","seen","subscriptionRef","link","source","sink","value","signal","sourceSubscription","notifierSubscription","notifier","assertDuration","duration","pending","hasPending","subscription","id","FluxTimeoutError","reason"],"sources":["../../src/operators/filtering.ts"],"sourcesContent":["import { link } from '../_link.js';\nimport { assertDuration, assertNonNegativeInteger } from '../_numeric.js';\nimport { stream } from '../core.js';\nimport { FluxTimeoutError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport function take<T>(count: number): Operator<T, T> {\n  assertNonNegativeInteger(count, 'take count');\n\n  return (source) =>\n    stream((sink, signal) => {\n      if (count === 0) {\n        sink.complete();\n\n        return;\n      }\n\n      let seen = 0;\n      const subscriptionRef: { current?: Subscription } = {};\n\n      subscriptionRef.current = link(\n        source,\n        {\n          complete: sink.complete,\n          error: sink.error,\n          next(value) {\n            sink.next(value);\n            seen++;\n\n            if (seen === count) {\n              sink.complete();\n              subscriptionRef.current?.unsubscribe();\n            }\n          },\n        },\n        signal,\n      );\n\n      return () => subscriptionRef.current?.unsubscribe();\n    });\n}\n\nfunction isAbortSignal(value: AbortSignal | Stream<unknown>): value is AbortSignal {\n  return (\n    typeof (value as AbortSignal).aborted === 'boolean' &&\n    typeof (value as AbortSignal).addEventListener === 'function' &&\n    typeof (value as AbortSignal).removeEventListener === 'function'\n  );\n}\n\nexport function takeUntil<T>(notifier: AbortSignal | Stream<unknown>): Operator<T, T> {\n  return (source) =>\n    stream((sink, signal) => {\n      let sourceSubscription: Subscription | undefined;\n      let notifierSubscription: Subscription | undefined;\n      let removeNotifier = (): void => {};\n\n      const complete = (): void => {\n        sourceSubscription?.unsubscribe();\n        notifierSubscription?.unsubscribe();\n        sink.complete();\n      };\n\n      if (isAbortSignal(notifier)) {\n        if (notifier.aborted) {\n          sink.complete();\n\n          return;\n        }\n\n        notifier.addEventListener('abort', complete, { once: true });\n        removeNotifier = (): void => notifier.removeEventListener('abort', complete);\n      } else {\n        notifierSubscription = link(notifier, { error: sink.error, next: complete }, signal);\n      }\n\n      if (!signal.aborted) {\n        sourceSubscription = link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next: sink.next,\n          },\n          signal,\n        );\n      }\n\n      return () => {\n        removeNotifier();\n        sourceSubscription?.unsubscribe();\n        notifierSubscription?.unsubscribe();\n      };\n    });\n}\n\nexport function debounce<T>(duration: number): Operator<T, T> {\n  assertDuration(duration, 'Debounce duration');\n\n  return (source) =>\n    stream((sink, signal) => {\n      let cancel: (() => void) | undefined;\n      let pending: T | undefined;\n      let hasPending = false;\n\n      const flush = (): void => {\n        cancel = undefined;\n\n        if (!hasPending) return;\n\n        hasPending = false;\n        sink.next(pending as T);\n      };\n\n      const subscription = link(\n        source,\n        {\n          complete() {\n            cancel?.();\n            flush();\n            sink.complete();\n          },\n          error: sink.error,\n          next(value) {\n            pending = value;\n            hasPending = true;\n            cancel?.();\n            const id = setTimeout(flush, duration);\n            cancel = () => clearTimeout(id);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        cancel?.();\n        subscription.unsubscribe();\n      };\n    });\n}\n\nexport function timeout<T>(duration: number): Operator<T, T> {\n  assertDuration(duration, 'Timeout duration');\n\n  return (source) =>\n    stream((sink, signal) => {\n      let cancel: () => void;\n\n      const start = (): void => {\n        const id = setTimeout(() => sink.error(new FluxTimeoutError(duration)), duration);\n        cancel = () => clearTimeout(id);\n      };\n\n      start();\n\n      const subscription = link(\n        source,\n        {\n          complete() {\n            cancel();\n            sink.complete();\n          },\n          error(reason) {\n            cancel();\n            sink.error(reason);\n          },\n          next(value) {\n            cancel();\n            start();\n            sink.next(value);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        cancel();\n        subscription.unsubscribe();\n      };\n    });\n}\n"],"mappings":";;;;;AAMA,SAAgB,KAAQ,GAA+B;CAGrD,OAFAA,EAAyBC,GAAO,YAAY,IAEpC,MACNC,GAAQ,GAAM,MAAW;EACvB,IAAID,MAAU,GAAG;GACf,EAAK,SAAS;GAEd;EACF;EAEA,IAAIE,IAAO,GACLC,IAA8C,CAAC;EAoBrD,OAlBA,EAAgB,UAAUC,EACxBC,GACA;GACE,UAAUC,EAAK;GACf,OAAOA,EAAK;GACZ,KAAK,GAAO;IAIV,AAHAA,EAAK,KAAKC,CAAK,GACf,KAEIL,MAASF,MACXM,EAAK,SAAS,GACdH,EAAgB,SAAS,YAAY;GAEzC;EACF,GACAK,CACF,SAEaL,EAAgB,SAAS,YAAY;CACpD,CAAC;AACL;AAEA,SAAS,cAAc,GAA4D;CACjF,OACE,OAAQI,EAAsB,WAAY,aAC1C,OAAQA,EAAsB,oBAAqB,cACnD,OAAQA,EAAsB,uBAAwB;AAE1D;AAEA,SAAgB,UAAa,GAAyD;CACpF,QAAQ,MACNN,GAAQ,GAAM,MAAW;EACvB,IAAIQ,GACAC,GACA,uBAA6B,CAAC,GAE5B,iBAAuB;GAG3B,AAFAD,GAAoB,YAAY,GAChCC,GAAsB,YAAY,GAClCJ,EAAK,SAAS;EAChB;EAEA,IAAI,cAAcK,CAAQ,GAAG;GAC3B,IAAIA,EAAS,SAAS;IACpB,EAAK,SAAS;IAEd;GACF;GAGA,AADAA,EAAS,iBAAiB,SAAS,UAAU,EAAE,MAAM,GAAK,CAAC,GAC3D,uBAA6BA,EAAS,oBAAoB,SAAS,QAAQ;EAC7E,OACE,IAAuBP,EAAKO,GAAU;GAAE,OAAOL,EAAK;GAAO,MAAM;EAAS,GAAGE,CAAM;EAerF,OAZKA,EAAO,YACV,IAAqBJ,EACnBC,GACA;GACE,UAAUC,EAAK;GACf,OAAOA,EAAK;GACZ,MAAMA,EAAK;EACb,GACAE,CACF,UAGW;GAGX,AAFA,eAAe,GACfC,GAAoB,YAAY,GAChCC,GAAsB,YAAY;EACpC;CACF,CAAC;AACL;AAEA,SAAgB,SAAY,GAAkC;CAG5D,OAFAE,EAAeC,GAAU,mBAAmB,IAEpC,MACNZ,GAAQ,GAAM,MAAW;EACvB,IAAI,QACAa,GACAC,IAAa,IAEX,cAAoB;GAGxB,AAFA,SAAS,KAAA,GAEJA,MAEL,IAAa,IACbT,EAAK,KAAKQ,CAAY;EACxB,GAEME,IAAeZ,EACnBC,GACA;GACE,WAAW;IAGT,AAFA,SAAS,GACT,MAAM,GACNC,EAAK,SAAS;GAChB;GACA,OAAOA,EAAK;GACZ,KAAK,GAAO;IAGV,AAFA,IAAUC,GACV,IAAa,IACb,SAAS;IACT,IAAMU,IAAK,WAAW,OAAOJ,CAAQ;IACrC,eAAe,aAAaI,CAAE;GAChC;EACF,GACAT,CACF;EAEA,aAAa;GAEX,AADA,SAAS,GACTQ,EAAa,YAAY;EAC3B;CACF,CAAC;AACL;AAEA,SAAgB,QAAW,GAAkC;CAG3D,OAFAJ,EAAeC,GAAU,kBAAkB,IAEnC,MACNZ,GAAQ,GAAM,MAAW;EACvB,IAAI,QAEE,cAAoB;GACxB,IAAMgB,IAAK,iBAAiBX,EAAK,MAAM,IAAIY,EAAiBL,CAAQ,CAAC,GAAGA,CAAQ;GAChF,eAAe,aAAaI,CAAE;EAChC;EAEA,MAAM;EAEN,IAAMD,IAAeZ,EACnBC,GACA;GACE,WAAW;IAET,AADA,OAAO,GACPC,EAAK,SAAS;GAChB;GACA,MAAM,GAAQ;IAEZ,AADA,OAAO,GACPA,EAAK,MAAMa,CAAM;GACnB;GACA,KAAK,GAAO;IAGV,AAFA,OAAO,GACP,MAAM,GACNb,EAAK,KAAKC,CAAK;GACjB;EACF,GACAC,CACF;EAEA,aAAa;GAEX,AADA,OAAO,GACPQ,EAAa,YAAY;EAC3B;CACF,CAAC;AACL"}

package/dist/operators/transformation.cjs

@@ -1,2 +1,2 @@
-const e=require("../_link.cjs"),t=require("../_numeric.cjs"),n=require("../_safe.cjs"),r=require("../core.cjs"),i=require("../errors.cjs");function map(t){return i=>r.stream((r,a)=>e.link(i,{complete:r.complete,error:r.error,next(e){n.tryCall(()=>r.next(t(e)),r.error)}},a).unsubscribe)}function filter(t){return i=>r.stream((r,a)=>e.link(i,{complete:r.complete,error:r.error,next(e){n.tryCall(()=>{t(e)&&r.next(e)},r.error)}},a).unsubscribe)}function scan(t,i){return a=>r.stream((r,o)=>{let s=i;return e.link(a,{complete:r.complete,error:r.error,next(e){n.tryCall(()=>{s=t(s,e),r.next(s)},r.error)}},o).unsubscribe})}function switchMap(t){return i=>r.stream((r,a)=>{let o=!1,s,finish=()=>{o&&!s&&r.complete()},c=e.link(i,{complete(){o=!0,finish()},error:r.error,next(i){s?.unsubscribe(),s=void 0,n.tryCall(()=>{let n=e.link(t(i),{complete(){s=void 0,finish()},error:r.error,next:r.next},a);s=n.closed?void 0:n},r.error)}},a);return()=>{c.unsubscribe(),s?.unsubscribe()}})}function flatten(a,o){let s=o.concurrency===1/0;return s||(t.assertPositiveInteger(o.concurrency,`mergeMap concurrency`),t.assertPositiveInteger(o.capacity,`mergeMap capacity`)),t=>r.stream((r,c)=>{let l=[],u=new Set,d=!1,f={},finish=()=>{d&&u.size===0&&l.length===0&&r.complete()},startInner=t=>{n.tryCall(()=>{let n={};n.current=e.link(a(t),{complete(){n.current&&u.delete(n.current),drain()},error:r.error,next:r.next},c),n.current.closed?drain():u.add(n.current)},r.error)},drain=()=>{if(!c.aborted){for(;l.length>0&&(s||u.size<o.concurrency);){let e=l.shift();startInner(e)}finish()}};return f.current=e.link(t,{complete(){d=!0,finish()},error:r.error,next(e){!s&&l.length>=o.capacity?(f.current?.unsubscribe(),r.error(new i.FluxCapacityError(o.capacity,`mergeMap buffer capacity exceeded`))):(l.push(e),drain())}},c),()=>{f.current?.unsubscribe();for(let e of u)e.unsubscribe();l.length=0}})}function mergeMap(e,t){return flatten(e,t)}function concatMap(e,t){return flatten(e,{capacity:t.capacity,concurrency:1})}exports.concatMap=concatMap,exports.filter=filter,exports.map=map,exports.mergeMap=mergeMap,exports.scan=scan,exports.switchMap=switchMap;
+const e=require("../_link.cjs"),t=require("../_numeric.cjs"),n=require("../_safe.cjs"),r=require("../core.cjs"),i=require("../errors.cjs");function map(t){return i=>r.stream((r,a)=>e.link(i,{complete:r.complete,error:r.error,next(e){n.tryCall(()=>r.next(t(e)),r.error)}},a).unsubscribe)}function filter(t){return i=>r.stream((r,a)=>e.link(i,{complete:r.complete,error:r.error,next(e){n.tryCall(()=>{t(e)&&r.next(e)},r.error)}},a).unsubscribe)}function scan(t,i){return a=>r.stream((r,o)=>{let s=i;return e.link(a,{complete:r.complete,error:r.error,next(e){n.tryCall(()=>{s=t(s,e),r.next(s)},r.error)}},o).unsubscribe})}function switchMap(t){return i=>r.stream((r,a)=>{let o=!1,s,finish=()=>{o&&!s&&r.complete()},c=e.link(i,{complete(){o=!0,finish()},error:r.error,next(i){s?.unsubscribe(),s=void 0,n.tryCall(()=>{let n=e.link(t(i),{complete(){s=void 0,finish()},error:r.error,next:r.next},a);s=n.closed?void 0:n},r.error)}},a);return()=>{c.unsubscribe(),s?.unsubscribe()}})}function flatten(a,o,s){let{capacity:c,concurrency:l}=o,u=l===`unbounded`;if(!u){if(t.assertPositiveInteger(l,`${s} concurrency`),c===void 0)throw RangeError(`${s} requires capacity when concurrency is finite; use { concurrency: "unbounded" } to start every value immediately`);t.assertPositiveInteger(c,`${s} capacity`)}let d=u?1/0:l,f=u?1/0:c;return t=>r.stream((r,o)=>{let c=[],l=new Set,u=!1,p={},finish=()=>{u&&l.size===0&&c.length===0&&r.complete()},startInner=t=>{n.tryCall(()=>{let n={};n.current=e.link(a(t),{complete(){n.current&&l.delete(n.current),drain()},error:r.error,next:r.next},o),n.current.closed?drain():l.add(n.current)},r.error)},drain=()=>{if(!o.aborted){for(;c.length>0&&l.size<d;){let e=c.shift();startInner(e)}finish()}};return p.current=e.link(t,{complete(){u=!0,finish()},error:r.error,next(e){c.length>=f?(p.current?.unsubscribe(),r.error(new i.FluxCapacityError(f,`${s} buffer capacity exceeded`))):(c.push(e),drain())}},o),()=>{p.current?.unsubscribe();for(let e of l)e.unsubscribe();c.length=0}})}function mergeMap(e,t){return flatten(e,t,`mergeMap`)}function concatMap(e,t){return flatten(e,{capacity:t.capacity,concurrency:1},`concatMap`)}exports.concatMap=concatMap,exports.filter=filter,exports.map=map,exports.mergeMap=mergeMap,exports.scan=scan,exports.switchMap=switchMap;
 //# sourceMappingURL=transformation.cjs.map

package/dist/operators/transformation.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"transformation.cjs","names":["stream","link","FluxCapacityError","require__link","require__numeric","require__safe","require_core","require_errors","source","sink","project","value","signal","predicate","state","initial","reducer","outerComplete","inner","outer","subscription","unbounded","options","queue","inners","outerRef","innerRef"],"sources":["../../src/operators/transformation.ts"],"sourcesContent":["import { link } from '../_link.js';\nimport { assertPositiveInteger } from '../_numeric.js';\nimport { tryCall } from '../_safe.js';\nimport { stream } from '../core.js';\nimport { FluxCapacityError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport type FlattenOptions = {\n  /** Maximum concurrently active inner subscriptions. Use `Infinity` for unbounded concurrency. */\n  concurrency: number;\n  /** Maximum queued outer values waiting for an inner subscription slot. Required when `concurrency` is finite. */\n  capacity: number;\n};\n\nexport function map<A, B>(project: (value: A) => B): Operator<A, B> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => sink.next(project(value)), sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function filter<T>(predicate: (value: T) => boolean): Operator<T, T> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => {\n                if (predicate(value)) sink.next(value);\n              }, sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function scan<T, A>(reducer: (state: A, value: T) => A, initial: A): Operator<T, A> {\n  return (source) =>\n    stream((sink, signal) => {\n      let state = initial;\n\n      return link(\n        source,\n        {\n          complete: sink.complete,\n          error: sink.error,\n          next(value) {\n            tryCall(() => {\n              state = reducer(state, value);\n              sink.next(state);\n            }, sink.error);\n          },\n        },\n        signal,\n      ).unsubscribe;\n    });\n}\n\nexport function switchMap<A, B>(project: (value: A) => Stream<B>): Operator<A, B> {\n  return (source) =>\n    stream((sink, signal) => {\n      let outerComplete = false;\n      let inner: Subscription | undefined;\n\n      const finish = (): void => {\n        if (outerComplete && !inner) sink.complete();\n      };\n\n      const outer = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            inner?.unsubscribe();\n            inner = undefined;\n\n            tryCall(() => {\n              const subscription = link(\n                project(value),\n                {\n                  complete() {\n                    inner = undefined;\n                    finish();\n                  },\n                  error: sink.error,\n                  next: sink.next,\n                },\n                signal,\n              );\n\n              inner = subscription.closed ? undefined : subscription;\n            }, sink.error);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outer.unsubscribe();\n        inner?.unsubscribe();\n      };\n    });\n}\n\nfunction flatten<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B> {\n  const unbounded = options.concurrency === Infinity;\n\n  if (!unbounded) {\n    assertPositiveInteger(options.concurrency, 'mergeMap concurrency');\n    assertPositiveInteger(options.capacity, 'mergeMap capacity');\n  }\n\n  return (source) =>\n    stream((sink, signal) => {\n      const queue: A[] = [];\n      const inners = new Set<Subscription>();\n      let outerComplete = false;\n      const outerRef: { current?: Subscription } = {};\n\n      const finish = (): void => {\n        if (outerComplete && inners.size === 0 && queue.length === 0) sink.complete();\n      };\n\n      const startInner = (value: A): void => {\n        tryCall(() => {\n          const innerRef: { current?: Subscription } = {};\n\n          innerRef.current = link(\n            project(value),\n            {\n              complete() {\n                if (innerRef.current) inners.delete(innerRef.current);\n\n                drain();\n              },\n              error: sink.error,\n              next: sink.next,\n            },\n            signal,\n          );\n\n          if (!innerRef.current.closed) inners.add(innerRef.current);\n          else drain();\n        }, sink.error);\n      };\n\n      const drain = (): void => {\n        if (signal.aborted) return;\n\n        while (queue.length > 0 && (unbounded || inners.size < options.concurrency)) {\n          const value = queue.shift()!;\n\n          startInner(value);\n        }\n\n        finish();\n      };\n\n      outerRef.current = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            if (!unbounded && queue.length >= options.capacity) {\n              outerRef.current?.unsubscribe();\n              sink.error(new FluxCapacityError(options.capacity, 'mergeMap buffer capacity exceeded'));\n\n              return;\n            }\n\n            queue.push(value);\n            drain();\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outerRef.current?.unsubscribe();\n        for (const inner of inners) inner.unsubscribe();\n        queue.length = 0;\n      };\n    });\n}\n\nexport function mergeMap<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B> {\n  return flatten(project, options);\n}\n\nexport function concatMap<A, B>(\n  project: (value: A) => Stream<B>,\n  options: Omit<FlattenOptions, 'concurrency'>,\n): Operator<A, B> {\n  return flatten(project, { capacity: options.capacity, concurrency: 1 });\n}\n"],"mappings":"A,2IAcA,SAAgB,IAAU,EAA0C,CAClE,MAAQ,IACNA,EAAAA,QACG,EAAM,IACLC,EAAAA,KACEO,EACA,CACE,SAAUC,EAAK,SACf,MAAOA,EAAK,MACZ,KAAK,EAAO,CACVJ,EAAA,YAAcI,EAAK,KAAKC,EAAQC,CAAK,CAAC,EAAGF,EAAK,KAAK,CACrD,CACF,EACAG,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,OAAU,EAAkD,CAC1E,MAAQ,IACNZ,EAAAA,QACG,EAAM,IACLC,EAAAA,KACEO,EACA,CACE,SAAUC,EAAK,SACf,MAAOA,EAAK,MACZ,KAAK,EAAO,CACVJ,EAAA,YAAc,CACRQ,EAAUF,CAAK,GAAGF,EAAK,KAAKE,CAAK,CACvC,EAAGF,EAAK,KAAK,CACf,CACF,EACAG,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,KAAW,EAAoC,EAA4B,CACzF,MAAQ,IACNZ,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAIc,EAAQC,EAEZ,OAAOd,EAAAA,KACLO,EACA,CACE,SAAUC,EAAK,SACf,MAAOA,EAAK,MACZ,KAAK,EAAO,CACVJ,EAAA,YAAc,CACZ,EAAQW,EAAQF,EAAOH,CAAK,EAC5BF,EAAK,KAAKK,CAAK,CACjB,EAAGL,EAAK,KAAK,CACf,CACF,EACAG,CACF,CAAC,CAAC,WACJ,CAAC,CACL,CAEA,SAAgB,UAAgB,EAAkD,CAChF,MAAQ,IACNZ,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAIiB,EAAgB,GAChBC,EAEE,WAAqB,CACrBD,GAAiB,CAACC,GAAOT,EAAK,SAAS,CAC7C,EAEMU,EAAQlB,EAAAA,KACZO,EACA,CACE,UAAW,CACT,EAAgB,GAChB,OAAO,CACT,EACA,MAAOC,EAAK,MACZ,KAAK,EAAO,CACVS,GAAO,YAAY,EACnB,EAAQ,IAAA,GAERb,EAAA,YAAc,CACZ,IAAMe,EAAenB,EAAAA,KACnBS,EAAQC,CAAK,EACb,CACE,UAAW,CACT,EAAQ,IAAA,GACR,OAAO,CACT,EACA,MAAOF,EAAK,MACZ,KAAMA,EAAK,IACb,EACAG,CACF,EAEA,EAAQQ,EAAa,OAAS,IAAA,GAAYA,CAC5C,EAAGX,EAAK,KAAK,CACf,CACF,EACAG,CACF,EAEA,UAAa,CACXO,EAAM,YAAY,EAClBD,GAAO,YAAY,CACrB,CACF,CAAC,CACL,CAEA,SAAS,QAAc,EAAkC,EAAyC,CAChG,IAAMG,EAAYC,EAAQ,cAAgB,IAO1C,OALKD,IACHjB,EAAA,sBAAsBkB,EAAQ,YAAa,sBAAsB,EACjElB,EAAA,sBAAsBkB,EAAQ,SAAU,mBAAmB,GAGrD,GACNtB,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAMuB,EAAa,CAAC,EACdC,EAAS,IAAI,IACfP,EAAgB,GACdQ,EAAuC,CAAC,EAExC,WAAqB,CACrBR,GAAiBO,EAAO,OAAS,GAAKD,EAAM,SAAW,GAAGd,EAAK,SAAS,CAC9E,EAEM,WAAc,GAAmB,CACrCJ,EAAA,YAAc,CACZ,IAAMqB,EAAuC,CAAC,EAE9C,EAAS,QAAUzB,EAAAA,KACjBS,EAAQC,CAAK,EACb,CACE,UAAW,CACLe,EAAS,SAASF,EAAO,OAAOE,EAAS,OAAO,EAEpD,MAAM,CACR,EACA,MAAOjB,EAAK,MACZ,KAAMA,EAAK,IACb,EACAG,CACF,EAEKc,EAAS,QAAQ,OACjB,MAAM,EADmBF,EAAO,IAAIE,EAAS,OAAO,CAE3D,EAAGjB,EAAK,KAAK,CACf,EAEM,UAAoB,CACxB,GAAI,GAAO,QAEX,MAAOc,EAAM,OAAS,IAAMF,GAAaG,EAAO,KAAOF,EAAQ,cAAc,CAC3E,IAAMX,EAAQY,EAAM,MAAM,EAE1B,WAAWZ,CAAK,CAClB,CAEA,OAAO,CAFP,CAGF,EAyBA,MAvBA,GAAS,QAAUV,EAAAA,KACjBO,EACA,CACE,UAAW,CACT,EAAgB,GAChB,OAAO,CACT,EACA,MAAOC,EAAK,MACZ,KAAK,EAAO,CACN,CAACY,GAAaE,EAAM,QAAUD,EAAQ,UACxCG,EAAS,SAAS,YAAY,EAC9BhB,EAAK,MAAM,IAAIP,EAAAA,kBAAkBoB,EAAQ,SAAU,mCAAmC,CAAC,IAKzFC,EAAM,KAAKZ,CAAK,EAChB,MAAM,EACR,CACF,EACAC,CACF,MAEa,CACXa,EAAS,SAAS,YAAY,EAC9B,IAAK,IAAMP,KAASM,EAAQN,EAAM,YAAY,EAC9C,EAAM,OAAS,CACjB,CACF,CAAC,CACL,CAEA,SAAgB,SAAe,EAAkC,EAAyC,CACxG,OAAO,QAAQR,EAASY,CAAO,CACjC,CAEA,SAAgB,UACd,EACA,EACgB,CAChB,OAAO,QAAQZ,EAAS,CAAE,SAAUY,EAAQ,SAAU,YAAa,CAAE,CAAC,CACxE,C"}
+{"version":3,"file":"transformation.cjs","names":["stream","link","FluxCapacityError","require__link","require__numeric","require__safe","require_core","require_errors","source","sink","project","value","signal","predicate","state","initial","reducer","outerComplete","inner","outer","subscription","options","unbounded","concurrency","label","capacity","concurrencyLimit","capacityLimit","queue","inners","outerRef","innerRef"],"sources":["../../src/operators/transformation.ts"],"sourcesContent":["import { link } from '../_link.js';\nimport { assertPositiveInteger } from '../_numeric.js';\nimport { tryCall } from '../_safe.js';\nimport { stream } from '../core.js';\nimport { FluxCapacityError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport type FlattenOptions =\n  | {\n      /** Maximum concurrently active inner subscriptions (positive integer). */\n      concurrency: number;\n      /** Maximum queued outer values waiting for an inner subscription slot. Required when `concurrency` is finite. */\n      capacity: number;\n    }\n  | {\n      /** Start every outer value immediately: the queue never grows, so no `capacity` applies. */\n      concurrency: 'unbounded';\n      capacity?: undefined;\n    };\n\nexport function map<A, B>(project: (value: A) => B): Operator<A, B> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => sink.next(project(value)), sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function filter<T>(predicate: (value: T) => boolean): Operator<T, T> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => {\n                if (predicate(value)) sink.next(value);\n              }, sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function scan<T, A>(reducer: (state: A, value: T) => A, initial: A): Operator<T, A> {\n  return (source) =>\n    stream((sink, signal) => {\n      let state = initial;\n\n      return link(\n        source,\n        {\n          complete: sink.complete,\n          error: sink.error,\n          next(value) {\n            tryCall(() => {\n              state = reducer(state, value);\n              sink.next(state);\n            }, sink.error);\n          },\n        },\n        signal,\n      ).unsubscribe;\n    });\n}\n\nexport function switchMap<A, B>(project: (value: A) => Stream<B>): Operator<A, B> {\n  return (source) =>\n    stream((sink, signal) => {\n      let outerComplete = false;\n      let inner: Subscription | undefined;\n\n      const finish = (): void => {\n        if (outerComplete && !inner) sink.complete();\n      };\n\n      const outer = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            inner?.unsubscribe();\n            inner = undefined;\n\n            tryCall(() => {\n              const subscription = link(\n                project(value),\n                {\n                  complete() {\n                    inner = undefined;\n                    finish();\n                  },\n                  error: sink.error,\n                  next: sink.next,\n                },\n                signal,\n              );\n\n              inner = subscription.closed ? undefined : subscription;\n            }, sink.error);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outer.unsubscribe();\n        inner?.unsubscribe();\n      };\n    });\n}\n\nfunction flatten<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions, label: string): Operator<A, B> {\n  // Read through the union once; the finite branch's `capacity` is runtime-validated for JS callers.\n  const { capacity, concurrency } = options as { capacity?: number; concurrency: number | 'unbounded' };\n  const unbounded = concurrency === 'unbounded';\n\n  if (!unbounded) {\n    assertPositiveInteger(concurrency, `${label} concurrency`);\n\n    if (capacity === undefined) {\n      throw new RangeError(\n        `${label} requires capacity when concurrency is finite; use { concurrency: \"unbounded\" } to start every value immediately`,\n      );\n    }\n\n    assertPositiveInteger(capacity, `${label} capacity`);\n  }\n\n  // Post-guard numeric views: the unbounded branch never enqueues, so it needs no limits.\n  const concurrencyLimit = unbounded ? Number.POSITIVE_INFINITY : (concurrency as number);\n  const capacityLimit = unbounded ? Number.POSITIVE_INFINITY : (capacity as number);\n\n  return (source) =>\n    stream((sink, signal) => {\n      const queue: A[] = [];\n      const inners = new Set<Subscription>();\n      let outerComplete = false;\n      const outerRef: { current?: Subscription } = {};\n\n      const finish = (): void => {\n        if (outerComplete && inners.size === 0 && queue.length === 0) sink.complete();\n      };\n\n      const startInner = (value: A): void => {\n        tryCall(() => {\n          const innerRef: { current?: Subscription } = {};\n\n          innerRef.current = link(\n            project(value),\n            {\n              complete() {\n                if (innerRef.current) inners.delete(innerRef.current);\n\n                drain();\n              },\n              error: sink.error,\n              next: sink.next,\n            },\n            signal,\n          );\n\n          if (!innerRef.current.closed) inners.add(innerRef.current);\n          else drain();\n        }, sink.error);\n      };\n\n      const drain = (): void => {\n        if (signal.aborted) return;\n\n        while (queue.length > 0 && inners.size < concurrencyLimit) {\n          const value = queue.shift()!;\n\n          startInner(value);\n        }\n\n        finish();\n      };\n\n      outerRef.current = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            if (queue.length >= capacityLimit) {\n              outerRef.current?.unsubscribe();\n              sink.error(new FluxCapacityError(capacityLimit, `${label} buffer capacity exceeded`));\n\n              return;\n            }\n\n            queue.push(value);\n            drain();\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outerRef.current?.unsubscribe();\n        for (const inner of inners) inner.unsubscribe();\n        queue.length = 0;\n      };\n    });\n}\n\nexport function mergeMap<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B> {\n  return flatten(project, options, 'mergeMap');\n}\n\nexport function concatMap<A, B>(project: (value: A) => Stream<B>, options: { capacity: number }): Operator<A, B> {\n  return flatten(project, { capacity: options.capacity, concurrency: 1 }, 'concatMap');\n}\n"],"mappings":"A,2IAoBA,SAAgB,IAAU,EAA0C,CAClE,MAAQ,IACNA,EAAAA,QACG,EAAM,IACLC,EAAAA,KACEO,EACA,CACE,SAAUC,EAAK,SACf,MAAOA,EAAK,MACZ,KAAK,EAAO,CACVJ,EAAA,YAAcI,EAAK,KAAKC,EAAQC,CAAK,CAAC,EAAGF,EAAK,KAAK,CACrD,CACF,EACAG,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,OAAU,EAAkD,CAC1E,MAAQ,IACNZ,EAAAA,QACG,EAAM,IACLC,EAAAA,KACEO,EACA,CACE,SAAUC,EAAK,SACf,MAAOA,EAAK,MACZ,KAAK,EAAO,CACVJ,EAAA,YAAc,CACRQ,EAAUF,CAAK,GAAGF,EAAK,KAAKE,CAAK,CACvC,EAAGF,EAAK,KAAK,CACf,CACF,EACAG,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,KAAW,EAAoC,EAA4B,CACzF,MAAQ,IACNZ,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAIc,EAAQC,EAEZ,OAAOd,EAAAA,KACLO,EACA,CACE,SAAUC,EAAK,SACf,MAAOA,EAAK,MACZ,KAAK,EAAO,CACVJ,EAAA,YAAc,CACZ,EAAQW,EAAQF,EAAOH,CAAK,EAC5BF,EAAK,KAAKK,CAAK,CACjB,EAAGL,EAAK,KAAK,CACf,CACF,EACAG,CACF,CAAC,CAAC,WACJ,CAAC,CACL,CAEA,SAAgB,UAAgB,EAAkD,CAChF,MAAQ,IACNZ,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAIiB,EAAgB,GAChBC,EAEE,WAAqB,CACrBD,GAAiB,CAACC,GAAOT,EAAK,SAAS,CAC7C,EAEMU,EAAQlB,EAAAA,KACZO,EACA,CACE,UAAW,CACT,EAAgB,GAChB,OAAO,CACT,EACA,MAAOC,EAAK,MACZ,KAAK,EAAO,CACVS,GAAO,YAAY,EACnB,EAAQ,IAAA,GAERb,EAAA,YAAc,CACZ,IAAMe,EAAenB,EAAAA,KACnBS,EAAQC,CAAK,EACb,CACE,UAAW,CACT,EAAQ,IAAA,GACR,OAAO,CACT,EACA,MAAOF,EAAK,MACZ,KAAMA,EAAK,IACb,EACAG,CACF,EAEA,EAAQQ,EAAa,OAAS,IAAA,GAAYA,CAC5C,EAAGX,EAAK,KAAK,CACf,CACF,EACAG,CACF,EAEA,UAAa,CACXO,EAAM,YAAY,EAClBD,GAAO,YAAY,CACrB,CACF,CAAC,CACL,CAEA,SAAS,QAAc,EAAkC,EAAyB,EAA+B,CAE/G,GAAM,CAAE,WAAU,eAAgBG,EAC5BC,EAAYC,IAAgB,YAElC,GAAI,CAACD,EAAW,CAGd,GAFAlB,EAAA,sBAAsBmB,EAAa,GAAGC,EAAM,aAAa,EAErDC,IAAa,IAAA,GACf,MAAU,WACR,GAAGD,EAAM,iHACX,EAGFpB,EAAA,sBAAsBqB,EAAU,GAAGD,EAAM,UAAU,CACrD,CAGA,IAAME,EAAmBJ,EAAY,IAA4BC,EAC3DI,EAAgBL,EAAY,IAA4BG,EAE9D,MAAQ,IACNzB,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAM4B,EAAa,CAAC,EACdC,EAAS,IAAI,IACfZ,EAAgB,GACda,EAAuC,CAAC,EAExC,WAAqB,CACrBb,GAAiBY,EAAO,OAAS,GAAKD,EAAM,SAAW,GAAGnB,EAAK,SAAS,CAC9E,EAEM,WAAc,GAAmB,CACrCJ,EAAA,YAAc,CACZ,IAAM0B,EAAuC,CAAC,EAE9C,EAAS,QAAU9B,EAAAA,KACjBS,EAAQC,CAAK,EACb,CACE,UAAW,CACLoB,EAAS,SAASF,EAAO,OAAOE,EAAS,OAAO,EAEpD,MAAM,CACR,EACA,MAAOtB,EAAK,MACZ,KAAMA,EAAK,IACb,EACAG,CACF,EAEKmB,EAAS,QAAQ,OACjB,MAAM,EADmBF,EAAO,IAAIE,EAAS,OAAO,CAE3D,EAAGtB,EAAK,KAAK,CACf,EAEM,UAAoB,CACxB,GAAI,GAAO,QAEX,MAAOmB,EAAM,OAAS,GAAKC,EAAO,KAAOH,GAAkB,CACzD,IAAMf,EAAQiB,EAAM,MAAM,EAE1B,WAAWjB,CAAK,CAClB,CAEA,OAAO,CAFP,CAGF,EAyBA,MAvBA,GAAS,QAAUV,EAAAA,KACjBO,EACA,CACE,UAAW,CACT,EAAgB,GAChB,OAAO,CACT,EACA,MAAOC,EAAK,MACZ,KAAK,EAAO,CACNmB,EAAM,QAAUD,GAClBG,EAAS,SAAS,YAAY,EAC9BrB,EAAK,MAAM,IAAIP,EAAAA,kBAAkByB,EAAe,GAAGH,EAAM,0BAA0B,CAAC,IAKtFI,EAAM,KAAKjB,CAAK,EAChB,MAAM,EACR,CACF,EACAC,CACF,MAEa,CACXkB,EAAS,SAAS,YAAY,EAC9B,IAAK,IAAMZ,KAASW,EAAQX,EAAM,YAAY,EAC9C,EAAM,OAAS,CACjB,CACF,CAAC,CACL,CAEA,SAAgB,SAAe,EAAkC,EAAyC,CACxG,OAAO,QAAQR,EAASW,EAAS,UAAU,CAC7C,CAEA,SAAgB,UAAgB,EAAkC,EAA+C,CAC/G,OAAO,QAAQX,EAAS,CAAE,SAAUW,EAAQ,SAAU,YAAa,CAAE,EAAG,WAAW,CACrF,C"}

package/dist/operators/transformation.d.ts

@@ -1,14 +1,20 @@
 import type { Operator, Stream } from '../types.js';
 export type FlattenOptions = {
-    /** Maximum concurrently active inner subscriptions. Use `Infinity` for unbounded concurrency. */
+    /** Maximum concurrently active inner subscriptions (positive integer). */
     concurrency: number;
     /** Maximum queued outer values waiting for an inner subscription slot. Required when `concurrency` is finite. */
     capacity: number;
+} | {
+    /** Start every outer value immediately: the queue never grows, so no `capacity` applies. */
+    concurrency: 'unbounded';
+    capacity?: undefined;
 };
 export declare function map<A, B>(project: (value: A) => B): Operator<A, B>;
 export declare function filter<T>(predicate: (value: T) => boolean): Operator<T, T>;
 export declare function scan<T, A>(reducer: (state: A, value: T) => A, initial: A): Operator<T, A>;
 export declare function switchMap<A, B>(project: (value: A) => Stream<B>): Operator<A, B>;
 export declare function mergeMap<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B>;
-export declare function concatMap<A, B>(project: (value: A) => Stream<B>, options: Omit<FlattenOptions, 'concurrency'>): Operator<A, B>;
+export declare function concatMap<A, B>(project: (value: A) => Stream<B>, options: {
+    capacity: number;
+}): Operator<A, B>;
 //# sourceMappingURL=transformation.d.ts.map

package/dist/operators/transformation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"transformation.d.ts","sourceRoot":"","sources":["../../src/operators/transformation.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAgB,MAAM,aAAa,CAAC;AAElE,MAAM,MAAM,cAAc,GAAG;IAC3B,iGAAiG;IACjG,WAAW,EAAE,MAAM,CAAC;IACpB,iHAAiH;IACjH,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAgBlE;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAkB1E;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAoBzF;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAgDhF;AAuFD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAExG;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAC5B,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAChC,OAAO,EAAE,IAAI,CAAC,cAAc,EAAE,aAAa,CAAC,GAC3C,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAEhB"}
+{"version":3,"file":"transformation.d.ts","sourceRoot":"","sources":["../../src/operators/transformation.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAgB,MAAM,aAAa,CAAC;AAElE,MAAM,MAAM,cAAc,GACtB;IACE,0EAA0E;IAC1E,WAAW,EAAE,MAAM,CAAC;IACpB,iHAAiH;IACjH,QAAQ,EAAE,MAAM,CAAC;CAClB,GACD;IACE,4FAA4F;IAC5F,WAAW,EAAE,WAAW,CAAC;IACzB,QAAQ,CAAC,EAAE,SAAS,CAAC;CACtB,CAAC;AAEN,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAgBlE;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAkB1E;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAoBzF;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAgDhF;AAoGD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAExG;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE;IAAE,QAAQ,EAAE,MAAM,CAAA;CAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAE/G"}

package/dist/operators/transformation.js

@@ -65,54 +65,59 @@ function switchMap(t) {
 		};
 	});
 }
-function flatten(a, o) {
-	let s = o.concurrency === Infinity;
-	return s || (t(o.concurrency, "mergeMap concurrency"), t(o.capacity, "mergeMap capacity")), (t) => r((r, c) => {
-		let l = [], u = /* @__PURE__ */ new Set(), d = !1, f = {}, finish = () => {
-			d && u.size === 0 && l.length === 0 && r.complete();
+function flatten(a, o, s) {
+	let { capacity: c, concurrency: l } = o, u = l === "unbounded";
+	if (!u) {
+		if (t(l, `${s} concurrency`), c === void 0) throw RangeError(`${s} requires capacity when concurrency is finite; use { concurrency: "unbounded" } to start every value immediately`);
+		t(c, `${s} capacity`);
+	}
+	let d = u ? Infinity : l, f = u ? Infinity : c;
+	return (t) => r((r, o) => {
+		let c = [], l = /* @__PURE__ */ new Set(), u = !1, p = {}, finish = () => {
+			u && l.size === 0 && c.length === 0 && r.complete();
 		}, startInner = (t) => {
 			n(() => {
 				let n = {};
 				n.current = e(a(t), {
 					complete() {
-						n.current && u.delete(n.current), drain();
+						n.current && l.delete(n.current), drain();
 					},
 					error: r.error,
 					next: r.next
-				}, c), n.current.closed ? drain() : u.add(n.current);
+				}, o), n.current.closed ? drain() : l.add(n.current);
 			}, r.error);
 		}, drain = () => {
-			if (!c.aborted) {
-				for (; l.length > 0 && (s || u.size < o.concurrency);) {
-					let e = l.shift();
+			if (!o.aborted) {
+				for (; c.length > 0 && l.size < d;) {
+					let e = c.shift();
 					startInner(e);
 				}
 				finish();
 			}
 		};
-		return f.current = e(t, {
+		return p.current = e(t, {
 			complete() {
-				d = !0, finish();
+				u = !0, finish();
 			},
 			error: r.error,
 			next(e) {
-				!s && l.length >= o.capacity ? (f.current?.unsubscribe(), r.error(new i(o.capacity, "mergeMap buffer capacity exceeded"))) : (l.push(e), drain());
+				c.length >= f ? (p.current?.unsubscribe(), r.error(new i(f, `${s} buffer capacity exceeded`))) : (c.push(e), drain());
 			}
-		}, c), () => {
-			f.current?.unsubscribe();
-			for (let e of u) e.unsubscribe();
-			l.length = 0;
+		}, o), () => {
+			p.current?.unsubscribe();
+			for (let e of l) e.unsubscribe();
+			c.length = 0;
 		};
 	});
 }
 function mergeMap(e, t) {
-	return flatten(e, t);
+	return flatten(e, t, "mergeMap");
 }
 function concatMap(e, t) {
 	return flatten(e, {
 		capacity: t.capacity,
 		concurrency: 1
-	});
+	}, "concatMap");
 }
 export { concatMap, filter, map, mergeMap, scan, switchMap };
 

package/dist/operators/transformation.js.map

@@ -1 +1 @@
-{"version":3,"file":"transformation.js","names":["stream","link","source","sink","project","value","signal","predicate","state","initial","reducer","outerComplete","inner","outer","tryCall","subscription","unbounded","options","assertPositiveInteger","queue","inners","outerRef","innerRef","FluxCapacityError"],"sources":["../../src/operators/transformation.ts"],"sourcesContent":["import { link } from '../_link.js';\nimport { assertPositiveInteger } from '../_numeric.js';\nimport { tryCall } from '../_safe.js';\nimport { stream } from '../core.js';\nimport { FluxCapacityError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport type FlattenOptions = {\n  /** Maximum concurrently active inner subscriptions. Use `Infinity` for unbounded concurrency. */\n  concurrency: number;\n  /** Maximum queued outer values waiting for an inner subscription slot. Required when `concurrency` is finite. */\n  capacity: number;\n};\n\nexport function map<A, B>(project: (value: A) => B): Operator<A, B> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => sink.next(project(value)), sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function filter<T>(predicate: (value: T) => boolean): Operator<T, T> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => {\n                if (predicate(value)) sink.next(value);\n              }, sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function scan<T, A>(reducer: (state: A, value: T) => A, initial: A): Operator<T, A> {\n  return (source) =>\n    stream((sink, signal) => {\n      let state = initial;\n\n      return link(\n        source,\n        {\n          complete: sink.complete,\n          error: sink.error,\n          next(value) {\n            tryCall(() => {\n              state = reducer(state, value);\n              sink.next(state);\n            }, sink.error);\n          },\n        },\n        signal,\n      ).unsubscribe;\n    });\n}\n\nexport function switchMap<A, B>(project: (value: A) => Stream<B>): Operator<A, B> {\n  return (source) =>\n    stream((sink, signal) => {\n      let outerComplete = false;\n      let inner: Subscription | undefined;\n\n      const finish = (): void => {\n        if (outerComplete && !inner) sink.complete();\n      };\n\n      const outer = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            inner?.unsubscribe();\n            inner = undefined;\n\n            tryCall(() => {\n              const subscription = link(\n                project(value),\n                {\n                  complete() {\n                    inner = undefined;\n                    finish();\n                  },\n                  error: sink.error,\n                  next: sink.next,\n                },\n                signal,\n              );\n\n              inner = subscription.closed ? undefined : subscription;\n            }, sink.error);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outer.unsubscribe();\n        inner?.unsubscribe();\n      };\n    });\n}\n\nfunction flatten<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B> {\n  const unbounded = options.concurrency === Infinity;\n\n  if (!unbounded) {\n    assertPositiveInteger(options.concurrency, 'mergeMap concurrency');\n    assertPositiveInteger(options.capacity, 'mergeMap capacity');\n  }\n\n  return (source) =>\n    stream((sink, signal) => {\n      const queue: A[] = [];\n      const inners = new Set<Subscription>();\n      let outerComplete = false;\n      const outerRef: { current?: Subscription } = {};\n\n      const finish = (): void => {\n        if (outerComplete && inners.size === 0 && queue.length === 0) sink.complete();\n      };\n\n      const startInner = (value: A): void => {\n        tryCall(() => {\n          const innerRef: { current?: Subscription } = {};\n\n          innerRef.current = link(\n            project(value),\n            {\n              complete() {\n                if (innerRef.current) inners.delete(innerRef.current);\n\n                drain();\n              },\n              error: sink.error,\n              next: sink.next,\n            },\n            signal,\n          );\n\n          if (!innerRef.current.closed) inners.add(innerRef.current);\n          else drain();\n        }, sink.error);\n      };\n\n      const drain = (): void => {\n        if (signal.aborted) return;\n\n        while (queue.length > 0 && (unbounded || inners.size < options.concurrency)) {\n          const value = queue.shift()!;\n\n          startInner(value);\n        }\n\n        finish();\n      };\n\n      outerRef.current = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            if (!unbounded && queue.length >= options.capacity) {\n              outerRef.current?.unsubscribe();\n              sink.error(new FluxCapacityError(options.capacity, 'mergeMap buffer capacity exceeded'));\n\n              return;\n            }\n\n            queue.push(value);\n            drain();\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outerRef.current?.unsubscribe();\n        for (const inner of inners) inner.unsubscribe();\n        queue.length = 0;\n      };\n    });\n}\n\nexport function mergeMap<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B> {\n  return flatten(project, options);\n}\n\nexport function concatMap<A, B>(\n  project: (value: A) => Stream<B>,\n  options: Omit<FlattenOptions, 'concurrency'>,\n): Operator<A, B> {\n  return flatten(project, { capacity: options.capacity, concurrency: 1 });\n}\n"],"mappings":";;;;;;AAcA,SAAgB,IAAU,GAA0C;CAClE,QAAQ,MACNA,GACG,GAAM,MACLC,EACEC,GACA;EACE,UAAUC,EAAK;EACf,OAAOA,EAAK;EACZ,KAAK,GAAO;GACV,QAAcA,EAAK,KAAKC,EAAQC,CAAK,CAAC,GAAGF,EAAK,KAAK;EACrD;CACF,GACAG,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,OAAU,GAAkD;CAC1E,QAAQ,MACNN,GACG,GAAM,MACLC,EACEC,GACA;EACE,UAAUC,EAAK;EACf,OAAOA,EAAK;EACZ,KAAK,GAAO;GACV,QAAc;IACZ,AAAII,EAAUF,CAAK,KAAGF,EAAK,KAAKE,CAAK;GACvC,GAAGF,EAAK,KAAK;EACf;CACF,GACAG,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,KAAW,GAAoC,GAA4B;CACzF,QAAQ,MACNN,GAAQ,GAAM,MAAW;EACvB,IAAIQ,IAAQC;EAEZ,OAAOR,EACLC,GACA;GACE,UAAUC,EAAK;GACf,OAAOA,EAAK;GACZ,KAAK,GAAO;IACV,QAAc;KAEZ,AADA,IAAQO,EAAQF,GAAOH,CAAK,GAC5BF,EAAK,KAAKK,CAAK;IACjB,GAAGL,EAAK,KAAK;GACf;EACF,GACAG,CACF,CAAC,CAAC;CACJ,CAAC;AACL;AAEA,SAAgB,UAAgB,GAAkD;CAChF,QAAQ,MACNN,GAAQ,GAAM,MAAW;EACvB,IAAIW,IAAgB,IAChBC,GAEE,eAAqB;GACzB,AAAID,KAAiB,CAACC,KAAOT,EAAK,SAAS;EAC7C,GAEMU,IAAQZ,EACZC,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,OAAO;GACT;GACA,OAAOC,EAAK;GACZ,KAAK,GAAO;IAIV,AAHAS,GAAO,YAAY,GACnB,IAAQ,KAAA,GAERE,QAAc;KACZ,IAAMC,IAAed,EACnBG,EAAQC,CAAK,GACb;MACE,WAAW;OAET,AADA,IAAQ,KAAA,GACR,OAAO;MACT;MACA,OAAOF,EAAK;MACZ,MAAMA,EAAK;KACb,GACAG,CACF;KAEA,IAAQS,EAAa,SAAS,KAAA,IAAYA;IAC5C,GAAGZ,EAAK,KAAK;GACf;EACF,GACAG,CACF;EAEA,aAAa;GAEX,AADAO,EAAM,YAAY,GAClBD,GAAO,YAAY;EACrB;CACF,CAAC;AACL;AAEA,SAAS,QAAc,GAAkC,GAAyC;CAChG,IAAMI,IAAYC,EAAQ,gBAAgB;CAO1C,OALKD,MACHE,EAAsBD,EAAQ,aAAa,sBAAsB,GACjEC,EAAsBD,EAAQ,UAAU,mBAAmB,KAGrD,MACNjB,GAAQ,GAAM,MAAW;EACvB,IAAMmB,IAAa,CAAC,GACdC,oBAAS,IAAI,IAAkB,GACjCT,IAAgB,IACdU,IAAuC,CAAC,GAExC,eAAqB;GACzB,AAAIV,KAAiBS,EAAO,SAAS,KAAKD,EAAM,WAAW,KAAGhB,EAAK,SAAS;EAC9E,GAEM,cAAc,MAAmB;GACrC,QAAc;IACZ,IAAMmB,IAAuC,CAAC;IAgB9C,AAdA,EAAS,UAAUrB,EACjBG,EAAQC,CAAK,GACb;KACE,WAAW;MAGT,AAFIiB,EAAS,WAASF,EAAO,OAAOE,EAAS,OAAO,GAEpD,MAAM;KACR;KACA,OAAOnB,EAAK;KACZ,MAAMA,EAAK;IACb,GACAG,CACF,GAEKgB,EAAS,QAAQ,SACjB,MAAM,IADmBF,EAAO,IAAIE,EAAS,OAAO;GAE3D,GAAGnB,EAAK,KAAK;EACf,GAEM,cAAoB;GACxB,IAAI,GAAO,SAEX;WAAOgB,EAAM,SAAS,MAAMH,KAAaI,EAAO,OAAOH,EAAQ,eAAc;KAC3E,IAAMZ,IAAQc,EAAM,MAAM;KAE1B,WAAWd,CAAK;IAClB;IAEA,OAAO;GAFP;EAGF;EAyBA,OAvBA,EAAS,UAAUJ,EACjBC,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,OAAO;GACT;GACA,OAAOC,EAAK;GACZ,KAAK,GAAO;IACV,AAAI,CAACa,KAAaG,EAAM,UAAUF,EAAQ,YACxCI,EAAS,SAAS,YAAY,GAC9BlB,EAAK,MAAM,IAAIoB,EAAkBN,EAAQ,UAAU,mCAAmC,CAAC,MAKzFE,EAAM,KAAKd,CAAK,GAChB,MAAM;GACR;EACF,GACAC,CACF,SAEa;GACX,EAAS,SAAS,YAAY;GAC9B,KAAK,IAAMM,KAASQ,GAAQ,EAAM,YAAY;GAC9C,EAAM,SAAS;EACjB;CACF,CAAC;AACL;AAEA,SAAgB,SAAe,GAAkC,GAAyC;CACxG,OAAO,QAAQhB,GAASa,CAAO;AACjC;AAEA,SAAgB,UACd,GACA,GACgB;CAChB,OAAO,QAAQb,GAAS;EAAE,UAAUa,EAAQ;EAAU,aAAa;CAAE,CAAC;AACxE"}
+{"version":3,"file":"transformation.js","names":["stream","link","source","sink","project","value","signal","predicate","state","initial","reducer","outerComplete","inner","outer","tryCall","subscription","options","unbounded","concurrency","assertPositiveInteger","label","capacity","concurrencyLimit","capacityLimit","queue","inners","outerRef","innerRef","FluxCapacityError"],"sources":["../../src/operators/transformation.ts"],"sourcesContent":["import { link } from '../_link.js';\nimport { assertPositiveInteger } from '../_numeric.js';\nimport { tryCall } from '../_safe.js';\nimport { stream } from '../core.js';\nimport { FluxCapacityError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport type FlattenOptions =\n  | {\n      /** Maximum concurrently active inner subscriptions (positive integer). */\n      concurrency: number;\n      /** Maximum queued outer values waiting for an inner subscription slot. Required when `concurrency` is finite. */\n      capacity: number;\n    }\n  | {\n      /** Start every outer value immediately: the queue never grows, so no `capacity` applies. */\n      concurrency: 'unbounded';\n      capacity?: undefined;\n    };\n\nexport function map<A, B>(project: (value: A) => B): Operator<A, B> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => sink.next(project(value)), sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function filter<T>(predicate: (value: T) => boolean): Operator<T, T> {\n  return (source) =>\n    stream(\n      (sink, signal) =>\n        link(\n          source,\n          {\n            complete: sink.complete,\n            error: sink.error,\n            next(value) {\n              tryCall(() => {\n                if (predicate(value)) sink.next(value);\n              }, sink.error);\n            },\n          },\n          signal,\n        ).unsubscribe,\n    );\n}\n\nexport function scan<T, A>(reducer: (state: A, value: T) => A, initial: A): Operator<T, A> {\n  return (source) =>\n    stream((sink, signal) => {\n      let state = initial;\n\n      return link(\n        source,\n        {\n          complete: sink.complete,\n          error: sink.error,\n          next(value) {\n            tryCall(() => {\n              state = reducer(state, value);\n              sink.next(state);\n            }, sink.error);\n          },\n        },\n        signal,\n      ).unsubscribe;\n    });\n}\n\nexport function switchMap<A, B>(project: (value: A) => Stream<B>): Operator<A, B> {\n  return (source) =>\n    stream((sink, signal) => {\n      let outerComplete = false;\n      let inner: Subscription | undefined;\n\n      const finish = (): void => {\n        if (outerComplete && !inner) sink.complete();\n      };\n\n      const outer = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            inner?.unsubscribe();\n            inner = undefined;\n\n            tryCall(() => {\n              const subscription = link(\n                project(value),\n                {\n                  complete() {\n                    inner = undefined;\n                    finish();\n                  },\n                  error: sink.error,\n                  next: sink.next,\n                },\n                signal,\n              );\n\n              inner = subscription.closed ? undefined : subscription;\n            }, sink.error);\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outer.unsubscribe();\n        inner?.unsubscribe();\n      };\n    });\n}\n\nfunction flatten<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions, label: string): Operator<A, B> {\n  // Read through the union once; the finite branch's `capacity` is runtime-validated for JS callers.\n  const { capacity, concurrency } = options as { capacity?: number; concurrency: number | 'unbounded' };\n  const unbounded = concurrency === 'unbounded';\n\n  if (!unbounded) {\n    assertPositiveInteger(concurrency, `${label} concurrency`);\n\n    if (capacity === undefined) {\n      throw new RangeError(\n        `${label} requires capacity when concurrency is finite; use { concurrency: \"unbounded\" } to start every value immediately`,\n      );\n    }\n\n    assertPositiveInteger(capacity, `${label} capacity`);\n  }\n\n  // Post-guard numeric views: the unbounded branch never enqueues, so it needs no limits.\n  const concurrencyLimit = unbounded ? Number.POSITIVE_INFINITY : (concurrency as number);\n  const capacityLimit = unbounded ? Number.POSITIVE_INFINITY : (capacity as number);\n\n  return (source) =>\n    stream((sink, signal) => {\n      const queue: A[] = [];\n      const inners = new Set<Subscription>();\n      let outerComplete = false;\n      const outerRef: { current?: Subscription } = {};\n\n      const finish = (): void => {\n        if (outerComplete && inners.size === 0 && queue.length === 0) sink.complete();\n      };\n\n      const startInner = (value: A): void => {\n        tryCall(() => {\n          const innerRef: { current?: Subscription } = {};\n\n          innerRef.current = link(\n            project(value),\n            {\n              complete() {\n                if (innerRef.current) inners.delete(innerRef.current);\n\n                drain();\n              },\n              error: sink.error,\n              next: sink.next,\n            },\n            signal,\n          );\n\n          if (!innerRef.current.closed) inners.add(innerRef.current);\n          else drain();\n        }, sink.error);\n      };\n\n      const drain = (): void => {\n        if (signal.aborted) return;\n\n        while (queue.length > 0 && inners.size < concurrencyLimit) {\n          const value = queue.shift()!;\n\n          startInner(value);\n        }\n\n        finish();\n      };\n\n      outerRef.current = link(\n        source,\n        {\n          complete() {\n            outerComplete = true;\n            finish();\n          },\n          error: sink.error,\n          next(value) {\n            if (queue.length >= capacityLimit) {\n              outerRef.current?.unsubscribe();\n              sink.error(new FluxCapacityError(capacityLimit, `${label} buffer capacity exceeded`));\n\n              return;\n            }\n\n            queue.push(value);\n            drain();\n          },\n        },\n        signal,\n      );\n\n      return () => {\n        outerRef.current?.unsubscribe();\n        for (const inner of inners) inner.unsubscribe();\n        queue.length = 0;\n      };\n    });\n}\n\nexport function mergeMap<A, B>(project: (value: A) => Stream<B>, options: FlattenOptions): Operator<A, B> {\n  return flatten(project, options, 'mergeMap');\n}\n\nexport function concatMap<A, B>(project: (value: A) => Stream<B>, options: { capacity: number }): Operator<A, B> {\n  return flatten(project, { capacity: options.capacity, concurrency: 1 }, 'concatMap');\n}\n"],"mappings":";;;;;;AAoBA,SAAgB,IAAU,GAA0C;CAClE,QAAQ,MACNA,GACG,GAAM,MACLC,EACEC,GACA;EACE,UAAUC,EAAK;EACf,OAAOA,EAAK;EACZ,KAAK,GAAO;GACV,QAAcA,EAAK,KAAKC,EAAQC,CAAK,CAAC,GAAGF,EAAK,KAAK;EACrD;CACF,GACAG,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,OAAU,GAAkD;CAC1E,QAAQ,MACNN,GACG,GAAM,MACLC,EACEC,GACA;EACE,UAAUC,EAAK;EACf,OAAOA,EAAK;EACZ,KAAK,GAAO;GACV,QAAc;IACZ,AAAII,EAAUF,CAAK,KAAGF,EAAK,KAAKE,CAAK;GACvC,GAAGF,EAAK,KAAK;EACf;CACF,GACAG,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,KAAW,GAAoC,GAA4B;CACzF,QAAQ,MACNN,GAAQ,GAAM,MAAW;EACvB,IAAIQ,IAAQC;EAEZ,OAAOR,EACLC,GACA;GACE,UAAUC,EAAK;GACf,OAAOA,EAAK;GACZ,KAAK,GAAO;IACV,QAAc;KAEZ,AADA,IAAQO,EAAQF,GAAOH,CAAK,GAC5BF,EAAK,KAAKK,CAAK;IACjB,GAAGL,EAAK,KAAK;GACf;EACF,GACAG,CACF,CAAC,CAAC;CACJ,CAAC;AACL;AAEA,SAAgB,UAAgB,GAAkD;CAChF,QAAQ,MACNN,GAAQ,GAAM,MAAW;EACvB,IAAIW,IAAgB,IAChBC,GAEE,eAAqB;GACzB,AAAID,KAAiB,CAACC,KAAOT,EAAK,SAAS;EAC7C,GAEMU,IAAQZ,EACZC,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,OAAO;GACT;GACA,OAAOC,EAAK;GACZ,KAAK,GAAO;IAIV,AAHAS,GAAO,YAAY,GACnB,IAAQ,KAAA,GAERE,QAAc;KACZ,IAAMC,IAAed,EACnBG,EAAQC,CAAK,GACb;MACE,WAAW;OAET,AADA,IAAQ,KAAA,GACR,OAAO;MACT;MACA,OAAOF,EAAK;MACZ,MAAMA,EAAK;KACb,GACAG,CACF;KAEA,IAAQS,EAAa,SAAS,KAAA,IAAYA;IAC5C,GAAGZ,EAAK,KAAK;GACf;EACF,GACAG,CACF;EAEA,aAAa;GAEX,AADAO,EAAM,YAAY,GAClBD,GAAO,YAAY;EACrB;CACF,CAAC;AACL;AAEA,SAAS,QAAc,GAAkC,GAAyB,GAA+B;CAE/G,IAAM,EAAE,aAAU,mBAAgBI,GAC5BC,IAAYC,MAAgB;CAElC,IAAI,CAACD,GAAW;EAGd,IAFAE,EAAsBD,GAAa,GAAGE,EAAM,aAAa,GAErDC,MAAa,KAAA,GACf,MAAU,WACR,GAAGD,EAAM,iHACX;EAGF,EAAsBC,GAAU,GAAGD,EAAM,UAAU;CACrD;CAGA,IAAME,IAAmBL,IAAY,WAA4BC,GAC3DK,IAAgBN,IAAY,WAA4BI;CAE9D,QAAQ,MACNrB,GAAQ,GAAM,MAAW;EACvB,IAAMwB,IAAa,CAAC,GACdC,oBAAS,IAAI,IAAkB,GACjCd,IAAgB,IACde,IAAuC,CAAC,GAExC,eAAqB;GACzB,AAAIf,KAAiBc,EAAO,SAAS,KAAKD,EAAM,WAAW,KAAGrB,EAAK,SAAS;EAC9E,GAEM,cAAc,MAAmB;GACrC,QAAc;IACZ,IAAMwB,IAAuC,CAAC;IAgB9C,AAdA,EAAS,UAAU1B,EACjBG,EAAQC,CAAK,GACb;KACE,WAAW;MAGT,AAFIsB,EAAS,WAASF,EAAO,OAAOE,EAAS,OAAO,GAEpD,MAAM;KACR;KACA,OAAOxB,EAAK;KACZ,MAAMA,EAAK;IACb,GACAG,CACF,GAEKqB,EAAS,QAAQ,SACjB,MAAM,IADmBF,EAAO,IAAIE,EAAS,OAAO;GAE3D,GAAGxB,EAAK,KAAK;EACf,GAEM,cAAoB;GACxB,IAAI,GAAO,SAEX;WAAOqB,EAAM,SAAS,KAAKC,EAAO,OAAOH,IAAkB;KACzD,IAAMjB,IAAQmB,EAAM,MAAM;KAE1B,WAAWnB,CAAK;IAClB;IAEA,OAAO;GAFP;EAGF;EAyBA,OAvBA,EAAS,UAAUJ,EACjBC,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,OAAO;GACT;GACA,OAAOC,EAAK;GACZ,KAAK,GAAO;IACV,AAAIqB,EAAM,UAAUD,KAClBG,EAAS,SAAS,YAAY,GAC9BvB,EAAK,MAAM,IAAIyB,EAAkBL,GAAe,GAAGH,EAAM,0BAA0B,CAAC,MAKtFI,EAAM,KAAKnB,CAAK,GAChB,MAAM;GACR;EACF,GACAC,CACF,SAEa;GACX,EAAS,SAAS,YAAY;GAC9B,KAAK,IAAMM,KAASa,GAAQ,EAAM,YAAY;GAC9C,EAAM,SAAS;EACjB;CACF,CAAC;AACL;AAEA,SAAgB,SAAe,GAAkC,GAAyC;CACxG,OAAO,QAAQrB,GAASY,GAAS,UAAU;AAC7C;AAEA,SAAgB,UAAgB,GAAkC,GAA+C;CAC/G,OAAO,QAAQZ,GAAS;EAAE,UAAUY,EAAQ;EAAU,aAAa;CAAE,GAAG,WAAW;AACrF"}

package/dist/operators/utility.cjs

@@ -1,2 +1,2 @@
-const e=require("../_link.cjs"),t=require("../_numeric.cjs"),n=require("../_safe.cjs"),r=require("../_scheduler.cjs"),i=require("../core.cjs"),a=require("../errors.cjs");let o=require("@vielzeug/arsenal");function retry(a){return t.assertNonNegativeInteger(a.times,`retry times`),o=>i.stream((i,s)=>{let c=0,l,u,start=()=>{if(s.aborted)return;let d=e.link(o,{complete:i.complete,error(e){if(c===a.times){i.error(e);return}let o=c++,l;if(n.tryCall(()=>{l=typeof a.delay==`function`?a.delay(o):a.delay},i.error),!s.aborted){if(l!==void 0)try{t.assertDuration(l,`Retry delay`)}catch(e){i.error(e);return}l===void 0||l===0?queueMicrotask(start):u=r.defaultScheduler.delay(start,l)}},next:i.next},s);d.closed||(l=d)};return start(),()=>{u?.(),l?.unsubscribe()}})}function first(t,n){return new Promise((r,i)=>{let s=new AbortController,abort=()=>{s.abort(),i((0,o.abortError)(n?.signal,`Stream consumption aborted`))};n?.signal?.aborted?abort():(n?.signal?.addEventListener(`abort`,abort,{once:!0}),e.link(t,{complete(){n?.signal?.removeEventListener(`abort`,abort),`defaultValue`in(n??{})?r(n.defaultValue):i(new a.FluxEmptyError)},error(e){n?.signal?.removeEventListener(`abort`,abort),i(e)},next(e){n?.signal?.removeEventListener(`abort`,abort),s.abort(),r(e)}},s.signal))})}function last(t,n){return new Promise((r,i)=>{let s=new AbortController,abort=()=>{s.abort(),i((0,o.abortError)(n?.signal,`Stream consumption aborted`))};if(n?.signal?.aborted){abort();return}let c=!1,l;n?.signal?.addEventListener(`abort`,abort,{once:!0}),e.link(t,{complete(){n?.signal?.removeEventListener(`abort`,abort),c?r(l):`defaultValue`in(n??{})?r(n.defaultValue):i(new a.FluxEmptyError)},error(e){n?.signal?.removeEventListener(`abort`,abort),i(e)},next(e){c=!0,l=e}},s.signal)})}function toArray(n,r){return t.assertNonNegativeInteger(r.maxItems,`toArray maxItems`),new Promise((t,i)=>{let s=new AbortController,c=[],abort=()=>{s.abort(),i((0,o.abortError)(r?.signal,`Stream consumption aborted`))};r.signal?.aborted?abort():(r.signal?.addEventListener(`abort`,abort,{once:!0}),e.link(n,{complete(){r.signal?.removeEventListener(`abort`,abort),t(c)},error(e){r.signal?.removeEventListener(`abort`,abort),i(e)},next(e){c.length===r.maxItems?(r.signal?.removeEventListener(`abort`,abort),s.abort(),i(new a.FluxCapacityError(r.maxItems,`toArray maxItems exceeded`))):c.push(e)}},s.signal))})}exports.first=first,exports.last=last,exports.retry=retry,exports.toArray=toArray;
+const e=require("../_link.cjs"),t=require("../_numeric.cjs"),n=require("../_safe.cjs"),r=require("../core.cjs"),i=require("../errors.cjs");let a=require("@vielzeug/arsenal");function retry(i){return t.assertNonNegativeInteger(i.times,`retry times`),a=>r.stream((r,o)=>{let s=0,c,l,start=()=>{if(o.aborted)return;let u=e.link(a,{complete:r.complete,error(e){if(s===i.times){r.error(e);return}let a=s++,c;if(n.tryCall(()=>{c=typeof i.delay==`function`?i.delay(a):i.delay},r.error),!o.aborted){if(c!==void 0)try{t.assertDuration(c,`Retry delay`)}catch(e){r.error(e);return}c===void 0||c===0?queueMicrotask(start):l=setTimeout(start,c)}},next:r.next},o);u.closed||(c=u)};return start(),()=>{l!==void 0&&clearTimeout(l),c?.unsubscribe()}})}function watchSignal(e,t,n){if(!e)return()=>{};let abort=()=>{t.abort(),n((0,a.abortError)(e,`Stream consumption aborted`))};return e.aborted?(abort(),null):(e.addEventListener(`abort`,abort,{once:!0}),()=>e.removeEventListener(`abort`,abort))}function first(t,n){return new Promise((r,a)=>{let o=new AbortController,s=watchSignal(n?.signal,o,a);s&&e.link(t,{complete(){s(),`defaultValue`in(n??{})?r(n.defaultValue):a(new i.FluxEmptyError)},error(e){s(),a(e)},next(e){s(),o.abort(),r(e)}},o.signal)})}function last(t,n){return new Promise((r,a)=>{let o=new AbortController,s=watchSignal(n?.signal,o,a);if(!s)return;let c=!1,l;e.link(t,{complete(){s(),c?r(l):`defaultValue`in(n??{})?r(n.defaultValue):a(new i.FluxEmptyError)},error(e){s(),a(e)},next(e){c=!0,l=e}},o.signal)})}function toArray(n,r){return t.assertNonNegativeInteger(r.maxItems,`toArray maxItems`),new Promise((t,a)=>{let o=new AbortController,s=[],c=watchSignal(r.signal,o,a);c&&e.link(n,{complete(){c(),t(s)},error(e){c(),a(e)},next(e){s.length===r.maxItems?(c(),o.abort(),a(new i.FluxCapacityError(r.maxItems,`toArray maxItems exceeded`))):s.push(e)}},o.signal)})}exports.first=first,exports.last=last,exports.retry=retry,exports.toArray=toArray;
 //# sourceMappingURL=utility.cjs.map

package/dist/operators/utility.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"utility.cjs","names":["stream","link","defaultScheduler","abortError","FluxEmptyError","FluxCapacityError","require__link","require__numeric","require__safe","require__scheduler","require_core","require_errors","_vielzeug_arsenal","options","attempts","current","cancelDelay","signal","subscription","source","sink","reason","attempt","delay","controller","reject","resolve","value","emitted","latest","values"],"sources":["../../src/operators/utility.ts"],"sourcesContent":["import { abortError } from '@vielzeug/arsenal';\n\nimport { link } from '../_link.js';\nimport { assertDuration, assertNonNegativeInteger } from '../_numeric.js';\nimport { tryCall } from '../_safe.js';\nimport { defaultScheduler } from '../_scheduler.js';\nimport { stream } from '../core.js';\nimport { FluxCapacityError, FluxEmptyError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport type RetryOptions = {\n  times: number;\n  delay?: number | ((attempt: number) => number);\n};\n\nexport type ToArrayOptions = {\n  maxItems: number;\n  signal?: AbortSignal;\n};\n\nexport type ValueOptions<T> = {\n  signal?: AbortSignal;\n  /** Resolved when the source completes empty instead of rejecting with `FluxEmptyError`. */\n  defaultValue?: T;\n};\n\nexport function retry<T>(options: RetryOptions): Operator<T, T> {\n  assertNonNegativeInteger(options.times, 'retry times');\n\n  return (source) =>\n    stream((sink, signal) => {\n      let attempts = 0;\n      let current: Subscription | undefined;\n      let cancelDelay: (() => void) | undefined;\n\n      const start = (): void => {\n        if (signal.aborted) return;\n\n        const subscription = link(\n          source,\n          {\n            complete: sink.complete,\n            error(reason) {\n              if (attempts === options.times) {\n                sink.error(reason);\n\n                return;\n              }\n\n              const attempt = attempts++;\n              let delay: number | undefined;\n\n              tryCall(() => {\n                delay = typeof options.delay === 'function' ? options.delay(attempt) : options.delay;\n              }, sink.error);\n\n              if (signal.aborted) return;\n\n              if (delay !== undefined) {\n                try {\n                  assertDuration(delay, 'Retry delay');\n                } catch (reason) {\n                  sink.error(reason);\n                  return;\n                }\n              }\n\n              if (delay === undefined || delay === 0) {\n                queueMicrotask(start);\n              } else {\n                cancelDelay = defaultScheduler.delay(start, delay);\n              }\n            },\n            next: sink.next,\n          },\n          signal,\n        );\n\n        if (!subscription.closed) current = subscription;\n      };\n\n      start();\n\n      return () => {\n        cancelDelay?.();\n        current?.unsubscribe();\n      };\n    });\n}\n\nexport function first<T>(source: Stream<T>, options?: ValueOptions<T>): Promise<T> {\n  return new Promise<T>((resolve, reject) => {\n    const controller = new AbortController();\n    const abort = (): void => {\n      controller.abort();\n      reject(abortError(options?.signal, 'Stream consumption aborted'));\n    };\n\n    if (options?.signal?.aborted) {\n      abort();\n\n      return;\n    }\n\n    options?.signal?.addEventListener('abort', abort, { once: true });\n    link(\n      source,\n      {\n        complete() {\n          options?.signal?.removeEventListener('abort', abort);\n\n          if ('defaultValue' in (options ?? {})) resolve(options!.defaultValue as T);\n          else reject(new FluxEmptyError());\n        },\n        error(reason) {\n          options?.signal?.removeEventListener('abort', abort);\n          reject(reason);\n        },\n        next(value) {\n          options?.signal?.removeEventListener('abort', abort);\n          controller.abort();\n          resolve(value);\n        },\n      },\n      controller.signal,\n    );\n  });\n}\n\nexport function last<T>(source: Stream<T>, options?: ValueOptions<T>): Promise<T> {\n  return new Promise<T>((resolve, reject) => {\n    const controller = new AbortController();\n    const abort = (): void => {\n      controller.abort();\n      reject(abortError(options?.signal, 'Stream consumption aborted'));\n    };\n\n    if (options?.signal?.aborted) {\n      abort();\n\n      return;\n    }\n\n    let emitted = false;\n    let latest: T | undefined;\n\n    options?.signal?.addEventListener('abort', abort, { once: true });\n    link(\n      source,\n      {\n        complete() {\n          options?.signal?.removeEventListener('abort', abort);\n\n          if (emitted) resolve(latest as T);\n          else if ('defaultValue' in (options ?? {})) resolve(options!.defaultValue as T);\n          else reject(new FluxEmptyError());\n        },\n        error(reason) {\n          options?.signal?.removeEventListener('abort', abort);\n          reject(reason);\n        },\n        next(value) {\n          emitted = true;\n          latest = value;\n        },\n      },\n      controller.signal,\n    );\n  });\n}\n\nexport function toArray<T>(source: Stream<T>, options: ToArrayOptions): Promise<T[]> {\n  assertNonNegativeInteger(options.maxItems, 'toArray maxItems');\n\n  return new Promise<T[]>((resolve, reject) => {\n    const controller = new AbortController();\n    const values: T[] = [];\n    const abort = (): void => {\n      controller.abort();\n      reject(abortError(options?.signal, 'Stream consumption aborted'));\n    };\n\n    if (options.signal?.aborted) {\n      abort();\n\n      return;\n    }\n\n    options.signal?.addEventListener('abort', abort, { once: true });\n    link(\n      source,\n      {\n        complete() {\n          options.signal?.removeEventListener('abort', abort);\n          resolve(values);\n        },\n        error(reason) {\n          options.signal?.removeEventListener('abort', abort);\n          reject(reason);\n        },\n        next(value) {\n          if (values.length === options.maxItems) {\n            options.signal?.removeEventListener('abort', abort);\n            controller.abort();\n            reject(new FluxCapacityError(options.maxItems, 'toArray maxItems exceeded'));\n\n            return;\n          }\n\n          values.push(value);\n        },\n      },\n      controller.signal,\n    );\n  });\n}\n"],"mappings":"A,6MA0BA,SAAgB,MAAS,EAAuC,CAG9D,OAFAO,EAAA,yBAAyBM,EAAQ,MAAO,aAAa,EAE7C,GACNb,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAIc,EAAW,EACXC,EACAC,EAEE,UAAoB,CACxB,GAAIC,EAAO,QAAS,OAEpB,IAAMC,EAAejB,EAAAA,KACnBkB,EACA,CACE,SAAUC,EAAK,SACf,MAAM,EAAQ,CACZ,GAAIN,IAAaD,EAAQ,MAAO,CAC9BO,EAAK,MAAMC,CAAM,EAEjB,MACF,CAEA,IAAMC,EAAU,IACZC,EAMJ,GAJAf,EAAA,YAAc,CACZ,EAAQ,OAAOK,EAAQ,OAAU,WAAaA,EAAQ,MAAMS,CAAO,EAAIT,EAAQ,KACjF,EAAGO,EAAK,KAAK,EAET,GAAO,QAEX,IAAIG,IAAU,IAAA,GACZ,GAAI,CACFhB,EAAA,eAAegB,EAAO,aAAa,CACrC,OAASF,EAAQ,CACfD,EAAK,MAAMC,CAAM,EACjB,MACF,CAGEE,IAAU,IAAA,IAAaA,IAAU,EACnC,eAAe,KAAK,EAEpB,EAAcrB,EAAAA,iBAAiB,MAAM,MAAOqB,CAAK,CANjD,CAQJ,EACA,KAAMH,EAAK,IACb,EACAH,CACF,EAEKC,EAAa,SAAQ,EAAUA,EACtC,EAIA,OAFA,MAAM,MAEO,CACXF,IAAc,EACdD,GAAS,YAAY,CACvB,CACF,CAAC,CACL,CAEA,SAAgB,MAAS,EAAmB,EAAuC,CACjF,OAAO,IAAI,SAAY,EAAS,IAAW,CACzC,IAAMS,EAAa,IAAI,gBACjB,UAAoB,CACxBA,EAAW,MAAM,EACjBC,GAAA,EAAOtB,EAAAA,WAAAA,CAAWU,GAAS,OAAQ,4BAA4B,CAAC,CAClE,EAEIA,GAAS,QAAQ,QACnB,MAAM,GAKRA,GAAS,QAAQ,iBAAiB,QAAS,MAAO,CAAE,KAAM,EAAK,CAAC,EAChEP,EAAA,KACEa,EACA,CACE,UAAW,CACTN,GAAS,QAAQ,oBAAoB,QAAS,KAAK,EAE/C,iBAAmBA,GAAW,CAAC,GAAIa,EAAQb,EAAS,YAAiB,EACpEY,EAAO,IAAIrB,EAAAA,cAAgB,CAClC,EACA,MAAM,EAAQ,CACZS,GAAS,QAAQ,oBAAoB,QAAS,KAAK,EACnDY,EAAOJ,CAAM,CACf,EACA,KAAK,EAAO,CACVR,GAAS,QAAQ,oBAAoB,QAAS,KAAK,EACnDW,EAAW,MAAM,EACjBE,EAAQC,CAAK,CACf,CACF,EACAH,EAAW,MACb,EACF,CAAC,CACH,CAEA,SAAgB,KAAQ,EAAmB,EAAuC,CAChF,OAAO,IAAI,SAAY,EAAS,IAAW,CACzC,IAAMA,EAAa,IAAI,gBACjB,UAAoB,CACxBA,EAAW,MAAM,EACjBC,GAAA,EAAOtB,EAAAA,WAAAA,CAAWU,GAAS,OAAQ,4BAA4B,CAAC,CAClE,EAEA,GAAIA,GAAS,QAAQ,QAAS,CAC5B,MAAM,EAEN,MACF,CAEA,IAAIe,EAAU,GACVC,EAEJhB,GAAS,QAAQ,iBAAiB,QAAS,MAAO,CAAE,KAAM,EAAK,CAAC,EAChEP,EAAA,KACEa,EACA,CACE,UAAW,CACTN,GAAS,QAAQ,oBAAoB,QAAS,KAAK,EAE/Ce,EAASF,EAAQG,CAAW,EACvB,iBAAmBhB,GAAW,CAAC,GAAIa,EAAQb,EAAS,YAAiB,EACzEY,EAAO,IAAIrB,EAAAA,cAAgB,CAClC,EACA,MAAM,EAAQ,CACZS,GAAS,QAAQ,oBAAoB,QAAS,KAAK,EACnDY,EAAOJ,CAAM,CACf,EACA,KAAK,EAAO,CACV,EAAU,GACV,EAASM,CACX,CACF,EACAH,EAAW,MACb,CACF,CAAC,CACH,CAEA,SAAgB,QAAW,EAAmB,EAAuC,CAGnF,OAFAjB,EAAA,yBAAyBM,EAAQ,SAAU,kBAAkB,EAEtD,IAAI,SAAc,EAAS,IAAW,CAC3C,IAAMW,EAAa,IAAI,gBACjBM,EAAc,CAAC,EACf,UAAoB,CACxBN,EAAW,MAAM,EACjBC,GAAA,EAAOtB,EAAAA,WAAAA,CAAWU,GAAS,OAAQ,4BAA4B,CAAC,CAClE,EAEIA,EAAQ,QAAQ,QAClB,MAAM,GAKRA,EAAQ,QAAQ,iBAAiB,QAAS,MAAO,CAAE,KAAM,EAAK,CAAC,EAC/DP,EAAA,KACEa,EACA,CACE,UAAW,CACTN,EAAQ,QAAQ,oBAAoB,QAAS,KAAK,EAClDa,EAAQI,CAAM,CAChB,EACA,MAAM,EAAQ,CACZjB,EAAQ,QAAQ,oBAAoB,QAAS,KAAK,EAClDY,EAAOJ,CAAM,CACf,EACA,KAAK,EAAO,CACNS,EAAO,SAAWjB,EAAQ,UAC5BA,EAAQ,QAAQ,oBAAoB,QAAS,KAAK,EAClDW,EAAW,MAAM,EACjBC,EAAO,IAAIpB,EAAAA,kBAAkBQ,EAAQ,SAAU,2BAA2B,CAAC,GAK7EiB,EAAO,KAAKH,CAAK,CACnB,CACF,EACAH,EAAW,MACb,EACF,CAAC,CACH,C"}
+{"version":3,"file":"utility.cjs","names":["stream","link","abortError","FluxEmptyError","FluxCapacityError","require__link","require__numeric","require__safe","require_core","require_errors","_vielzeug_arsenal","options","attempts","current","delayId","signal","subscription","source","sink","reason","attempt","delay","controller","reject","detach","resolve","value","emitted","latest","values"],"sources":["../../src/operators/utility.ts"],"sourcesContent":["import { abortError } from '@vielzeug/arsenal';\n\nimport { link } from '../_link.js';\nimport { assertDuration, assertNonNegativeInteger } from '../_numeric.js';\nimport { tryCall } from '../_safe.js';\nimport { stream } from '../core.js';\nimport { FluxCapacityError, FluxEmptyError } from '../errors.js';\nimport type { Operator, Stream, Subscription } from '../types.js';\n\nexport type RetryOptions = {\n  times: number;\n  delay?: number | ((attempt: number) => number);\n};\n\nexport type ToArrayOptions = {\n  maxItems: number;\n  signal?: AbortSignal;\n};\n\nexport type ValueOptions<T> = {\n  signal?: AbortSignal;\n  /** Resolved when the source completes empty instead of rejecting with `FluxEmptyError`. */\n  defaultValue?: T;\n};\n\nexport function retry<T>(options: RetryOptions): Operator<T, T> {\n  assertNonNegativeInteger(options.times, 'retry times');\n\n  return (source) =>\n    stream((sink, signal) => {\n      let attempts = 0;\n      let current: Subscription | undefined;\n      let delayId: ReturnType<typeof setTimeout> | undefined;\n\n      const start = (): void => {\n        if (signal.aborted) return;\n\n        const subscription = link(\n          source,\n          {\n            complete: sink.complete,\n            error(reason) {\n              if (attempts === options.times) {\n                sink.error(reason);\n\n                return;\n              }\n\n              const attempt = attempts++;\n              let delay: number | undefined;\n\n              tryCall(() => {\n                delay = typeof options.delay === 'function' ? options.delay(attempt) : options.delay;\n              }, sink.error);\n\n              if (signal.aborted) return;\n\n              if (delay !== undefined) {\n                try {\n                  assertDuration(delay, 'Retry delay');\n                } catch (reason) {\n                  sink.error(reason);\n                  return;\n                }\n              }\n\n              if (delay === undefined || delay === 0) {\n                queueMicrotask(start);\n              } else {\n                delayId = setTimeout(start, delay);\n              }\n            },\n            next: sink.next,\n          },\n          signal,\n        );\n\n        if (!subscription.closed) current = subscription;\n      };\n\n      start();\n\n      return () => {\n        if (delayId !== undefined) clearTimeout(delayId);\n        current?.unsubscribe();\n      };\n    });\n}\n\n/**\n * Wire an external AbortSignal into a terminal consumer promise. Returns the\n * detach function every terminal callback must call, or `null` when the signal\n * was already aborted (the promise has rejected by then).\n */\nfunction watchSignal(\n  signal: AbortSignal | undefined,\n  controller: AbortController,\n  reject: (reason: unknown) => void,\n): (() => void) | null {\n  if (!signal) return () => {};\n\n  const abort = (): void => {\n    controller.abort();\n    reject(abortError(signal, 'Stream consumption aborted'));\n  };\n\n  if (signal.aborted) {\n    abort();\n\n    return null;\n  }\n\n  signal.addEventListener('abort', abort, { once: true });\n\n  return () => signal.removeEventListener('abort', abort);\n}\n\nexport function first<T>(source: Stream<T>, options?: ValueOptions<T>): Promise<T> {\n  return new Promise<T>((resolve, reject) => {\n    const controller = new AbortController();\n    const detach = watchSignal(options?.signal, controller, reject);\n    if (!detach) return;\n\n    link(\n      source,\n      {\n        complete() {\n          detach();\n\n          if ('defaultValue' in (options ?? {})) resolve(options!.defaultValue as T);\n          else reject(new FluxEmptyError());\n        },\n        error(reason) {\n          detach();\n          reject(reason);\n        },\n        next(value) {\n          detach();\n          controller.abort();\n          resolve(value);\n        },\n      },\n      controller.signal,\n    );\n  });\n}\n\nexport function last<T>(source: Stream<T>, options?: ValueOptions<T>): Promise<T> {\n  return new Promise<T>((resolve, reject) => {\n    const controller = new AbortController();\n    const detach = watchSignal(options?.signal, controller, reject);\n    if (!detach) return;\n\n    let emitted = false;\n    let latest: T | undefined;\n\n    link(\n      source,\n      {\n        complete() {\n          detach();\n\n          if (emitted) resolve(latest as T);\n          else if ('defaultValue' in (options ?? {})) resolve(options!.defaultValue as T);\n          else reject(new FluxEmptyError());\n        },\n        error(reason) {\n          detach();\n          reject(reason);\n        },\n        next(value) {\n          emitted = true;\n          latest = value;\n        },\n      },\n      controller.signal,\n    );\n  });\n}\n\nexport function toArray<T>(source: Stream<T>, options: ToArrayOptions): Promise<T[]> {\n  assertNonNegativeInteger(options.maxItems, 'toArray maxItems');\n\n  return new Promise<T[]>((resolve, reject) => {\n    const controller = new AbortController();\n    const values: T[] = [];\n    const detach = watchSignal(options.signal, controller, reject);\n    if (!detach) return;\n\n    link(\n      source,\n      {\n        complete() {\n          detach();\n          resolve(values);\n        },\n        error(reason) {\n          detach();\n          reject(reason);\n        },\n        next(value) {\n          if (values.length === options.maxItems) {\n            detach();\n            controller.abort();\n            reject(new FluxCapacityError(options.maxItems, 'toArray maxItems exceeded'));\n\n            return;\n          }\n\n          values.push(value);\n        },\n      },\n      controller.signal,\n    );\n  });\n}\n"],"mappings":"A,8KAyBA,SAAgB,MAAS,EAAuC,CAG9D,OAFAM,EAAA,yBAAyBK,EAAQ,MAAO,aAAa,EAE7C,GACNX,EAAAA,QAAQ,EAAM,IAAW,CACvB,IAAIY,EAAW,EACXC,EACAC,EAEE,UAAoB,CACxB,GAAIC,EAAO,QAAS,OAEpB,IAAMC,EAAef,EAAAA,KACnBgB,EACA,CACE,SAAUC,EAAK,SACf,MAAM,EAAQ,CACZ,GAAIN,IAAaD,EAAQ,MAAO,CAC9BO,EAAK,MAAMC,CAAM,EAEjB,MACF,CAEA,IAAMC,EAAU,IACZC,EAMJ,GAJAd,EAAA,YAAc,CACZ,EAAQ,OAAOI,EAAQ,OAAU,WAAaA,EAAQ,MAAMS,CAAO,EAAIT,EAAQ,KACjF,EAAGO,EAAK,KAAK,EAET,GAAO,QAEX,IAAIG,IAAU,IAAA,GACZ,GAAI,CACFf,EAAA,eAAee,EAAO,aAAa,CACrC,OAASF,EAAQ,CACfD,EAAK,MAAMC,CAAM,EACjB,MACF,CAGEE,IAAU,IAAA,IAAaA,IAAU,EACnC,eAAe,KAAK,EAEpB,EAAU,WAAW,MAAOA,CAAK,CANjC,CAQJ,EACA,KAAMH,EAAK,IACb,EACAH,CACF,EAEKC,EAAa,SAAQ,EAAUA,EACtC,EAIA,OAFA,MAAM,MAEO,CACPF,IAAY,IAAA,IAAW,aAAaA,CAAO,EAC/CD,GAAS,YAAY,CACvB,CACF,CAAC,CACL,CAOA,SAAS,YACP,EACA,EACA,EACqB,CACrB,GAAI,CAACE,EAAQ,UAAa,CAAC,EAE3B,IAAM,UAAoB,CACxBO,EAAW,MAAM,EACjBC,GAAA,EAAOrB,EAAAA,WAAAA,CAAWa,EAAQ,4BAA4B,CAAC,CACzD,EAUA,OARIA,EAAO,SACT,MAAM,EAEC,OAGTA,EAAO,iBAAiB,QAAS,MAAO,CAAE,KAAM,EAAK,CAAC,MAEzCA,EAAO,oBAAoB,QAAS,KAAK,EACxD,CAEA,SAAgB,MAAS,EAAmB,EAAuC,CACjF,OAAO,IAAI,SAAY,EAAS,IAAW,CACzC,IAAMO,EAAa,IAAI,gBACjBE,EAAS,YAAYb,GAAS,OAAQW,EAAYC,CAAM,EACzDC,GAELnB,EAAA,KACEY,EACA,CACE,UAAW,CACTO,EAAO,EAEH,iBAAmBb,GAAW,CAAC,GAAIc,EAAQd,EAAS,YAAiB,EACpEY,EAAO,IAAIpB,EAAAA,cAAgB,CAClC,EACA,MAAM,EAAQ,CACZqB,EAAO,EACPD,EAAOJ,CAAM,CACf,EACA,KAAK,EAAO,CACVK,EAAO,EACPF,EAAW,MAAM,EACjBG,EAAQC,CAAK,CACf,CACF,EACAJ,EAAW,MACb,CACF,CAAC,CACH,CAEA,SAAgB,KAAQ,EAAmB,EAAuC,CAChF,OAAO,IAAI,SAAY,EAAS,IAAW,CACzC,IAAMA,EAAa,IAAI,gBACjBE,EAAS,YAAYb,GAAS,OAAQW,EAAYC,CAAM,EAC9D,GAAI,CAACC,EAAQ,OAEb,IAAIG,EAAU,GACVC,EAEJvB,EAAA,KACEY,EACA,CACE,UAAW,CACTO,EAAO,EAEHG,EAASF,EAAQG,CAAW,EACvB,iBAAmBjB,GAAW,CAAC,GAAIc,EAAQd,EAAS,YAAiB,EACzEY,EAAO,IAAIpB,EAAAA,cAAgB,CAClC,EACA,MAAM,EAAQ,CACZqB,EAAO,EACPD,EAAOJ,CAAM,CACf,EACA,KAAK,EAAO,CACV,EAAU,GACV,EAASO,CACX,CACF,EACAJ,EAAW,MACb,CACF,CAAC,CACH,CAEA,SAAgB,QAAW,EAAmB,EAAuC,CAGnF,OAFAhB,EAAA,yBAAyBK,EAAQ,SAAU,kBAAkB,EAEtD,IAAI,SAAc,EAAS,IAAW,CAC3C,IAAMW,EAAa,IAAI,gBACjBO,EAAc,CAAC,EACfL,EAAS,YAAYb,EAAQ,OAAQW,EAAYC,CAAM,EACxDC,GAELnB,EAAA,KACEY,EACA,CACE,UAAW,CACTO,EAAO,EACPC,EAAQI,CAAM,CAChB,EACA,MAAM,EAAQ,CACZL,EAAO,EACPD,EAAOJ,CAAM,CACf,EACA,KAAK,EAAO,CACNU,EAAO,SAAWlB,EAAQ,UAC5Ba,EAAO,EACPF,EAAW,MAAM,EACjBC,EAAO,IAAInB,EAAAA,kBAAkBO,EAAQ,SAAU,2BAA2B,CAAC,GAK7EkB,EAAO,KAAKH,CAAK,CACnB,CACF,EACAJ,EAAW,MACb,CACF,CAAC,CACH,C"}

package/dist/operators/utility.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utility.d.ts","sourceRoot":"","sources":["../../src/operators/utility.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAgB,MAAM,aAAa,CAAC;AAElE,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;CAChD,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI;IAC5B,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,2FAA2F;IAC3F,YAAY,CAAC,EAAE,CAAC,CAAC;CAClB,CAAC;AAEF,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CA8D9D;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAqCjF;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAwChF;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CA4CnF"}
+{"version":3,"file":"utility.d.ts","sourceRoot":"","sources":["../../src/operators/utility.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAgB,MAAM,aAAa,CAAC;AAElE,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;CAChD,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI;IAC5B,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,2FAA2F;IAC3F,YAAY,CAAC,EAAE,CAAC,CAAC;CAClB,CAAC;AAEF,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CA8D9D;AA8BD,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CA4BjF;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CA+BhF;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAmCnF"}

package/dist/operators/utility.js

@@ -1,101 +1,98 @@
 import { link as e } from "../_link.js";
 import { assertDuration as t, assertNonNegativeInteger as n } from "../_numeric.js";
 import { tryCall as r } from "../_safe.js";
-import { defaultScheduler as i } from "../_scheduler.js";
-import { stream as a } from "../core.js";
-import { FluxCapacityError as o, FluxEmptyError as s } from "../errors.js";
-import { abortError as c } from "@vielzeug/arsenal";
+import { stream as i } from "../core.js";
+import { FluxCapacityError as a, FluxEmptyError as o } from "../errors.js";
+import { abortError as s } from "@vielzeug/arsenal";
 // src/operators/utility.ts
-function retry(o) {
-	return n(o.times, "retry times"), (n) => a((a, s) => {
-		let c = 0, l, u, start = () => {
-			if (s.aborted) return;
-			let d = e(n, {
-				complete: a.complete,
+function retry(a) {
+	return n(a.times, "retry times"), (n) => i((i, o) => {
+		let s = 0, c, l, start = () => {
+			if (o.aborted) return;
+			let u = e(n, {
+				complete: i.complete,
 				error(e) {
-					if (c === o.times) {
-						a.error(e);
+					if (s === a.times) {
+						i.error(e);
 						return;
 					}
-					let n = c++, l;
+					let n = s++, c;
 					if (r(() => {
-						l = typeof o.delay == "function" ? o.delay(n) : o.delay;
-					}, a.error), !s.aborted) {
-						if (l !== void 0) try {
-							t(l, "Retry delay");
+						c = typeof a.delay == "function" ? a.delay(n) : a.delay;
+					}, i.error), !o.aborted) {
+						if (c !== void 0) try {
+							t(c, "Retry delay");
 						} catch (e) {
-							a.error(e);
+							i.error(e);
 							return;
 						}
-						l === void 0 || l === 0 ? queueMicrotask(start) : u = i.delay(start, l);
+						c === void 0 || c === 0 ? queueMicrotask(start) : l = setTimeout(start, c);
 					}
 				},
-				next: a.next
-			}, s);
-			d.closed || (l = d);
+				next: i.next
+			}, o);
+			u.closed || (c = u);
 		};
 		return start(), () => {
-			u?.(), l?.unsubscribe();
+			l !== void 0 && clearTimeout(l), c?.unsubscribe();
 		};
 	});
 }
+function watchSignal(e, t, n) {
+	if (!e) return () => {};
+	let abort = () => {
+		t.abort(), n(s(e, "Stream consumption aborted"));
+	};
+	return e.aborted ? (abort(), null) : (e.addEventListener("abort", abort, { once: !0 }), () => e.removeEventListener("abort", abort));
+}
 function first(t, n) {
 	return new Promise((r, i) => {
-		let a = new AbortController(), abort = () => {
-			a.abort(), i(c(n?.signal, "Stream consumption aborted"));
-		};
-		n?.signal?.aborted ? abort() : (n?.signal?.addEventListener("abort", abort, { once: !0 }), e(t, {
+		let a = new AbortController(), s = watchSignal(n?.signal, a, i);
+		s && e(t, {
 			complete() {
-				n?.signal?.removeEventListener("abort", abort), "defaultValue" in (n ?? {}) ? r(n.defaultValue) : i(new s());
+				s(), "defaultValue" in (n ?? {}) ? r(n.defaultValue) : i(new o());
 			},
 			error(e) {
-				n?.signal?.removeEventListener("abort", abort), i(e);
+				s(), i(e);
 			},
 			next(e) {
-				n?.signal?.removeEventListener("abort", abort), a.abort(), r(e);
+				s(), a.abort(), r(e);
 			}
-		}, a.signal));
+		}, a.signal);
 	});
 }
 function last(t, n) {
 	return new Promise((r, i) => {
-		let a = new AbortController(), abort = () => {
-			a.abort(), i(c(n?.signal, "Stream consumption aborted"));
-		};
-		if (n?.signal?.aborted) {
-			abort();
-			return;
-		}
-		let o = !1, l;
-		n?.signal?.addEventListener("abort", abort, { once: !0 }), e(t, {
+		let a = new AbortController(), s = watchSignal(n?.signal, a, i);
+		if (!s) return;
+		let c = !1, l;
+		e(t, {
 			complete() {
-				n?.signal?.removeEventListener("abort", abort), o ? r(l) : "defaultValue" in (n ?? {}) ? r(n.defaultValue) : i(new s());
+				s(), c ? r(l) : "defaultValue" in (n ?? {}) ? r(n.defaultValue) : i(new o());
 			},
 			error(e) {
-				n?.signal?.removeEventListener("abort", abort), i(e);
+				s(), i(e);
 			},
 			next(e) {
-				o = !0, l = e;
+				c = !0, l = e;
 			}
 		}, a.signal);
 	});
 }
 function toArray(t, r) {
 	return n(r.maxItems, "toArray maxItems"), new Promise((n, i) => {
-		let a = new AbortController(), s = [], abort = () => {
-			a.abort(), i(c(r?.signal, "Stream consumption aborted"));
-		};
-		r.signal?.aborted ? abort() : (r.signal?.addEventListener("abort", abort, { once: !0 }), e(t, {
+		let o = new AbortController(), s = [], c = watchSignal(r.signal, o, i);
+		c && e(t, {
 			complete() {
-				r.signal?.removeEventListener("abort", abort), n(s);
+				c(), n(s);
 			},
 			error(e) {
-				r.signal?.removeEventListener("abort", abort), i(e);
+				c(), i(e);
 			},
 			next(e) {
-				s.length === r.maxItems ? (r.signal?.removeEventListener("abort", abort), a.abort(), i(new o(r.maxItems, "toArray maxItems exceeded"))) : s.push(e);
+				s.length === r.maxItems ? (c(), o.abort(), i(new a(r.maxItems, "toArray maxItems exceeded"))) : s.push(e);
 			}
-		}, a.signal));
+		}, o.signal);
 	});
 }
 export { first, last, retry, toArray };