@vielzeug/flux 2.4.0 → 3.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +12 -22
- package/dist/_iterator.cjs +1 -1
- package/dist/_iterator.cjs.map +1 -1
- package/dist/_iterator.d.ts +1 -1
- package/dist/_iterator.d.ts.map +1 -1
- package/dist/_iterator.js +35 -31
- package/dist/_iterator.js.map +1 -1
- package/dist/_link.cjs.map +1 -1
- package/dist/_link.d.ts +1 -1
- package/dist/_link.d.ts.map +1 -1
- package/dist/_link.js.map +1 -1
- package/dist/_numeric.cjs +1 -1
- package/dist/_numeric.cjs.map +1 -1
- package/dist/_numeric.js +1 -1
- package/dist/_numeric.js.map +1 -1
- package/dist/_subscription.cjs.map +1 -1
- package/dist/_subscription.d.ts +1 -1
- package/dist/_subscription.d.ts.map +1 -1
- package/dist/_subscription.js.map +1 -1
- package/dist/async.cjs.map +1 -1
- package/dist/async.d.ts +1 -1
- package/dist/async.d.ts.map +1 -1
- package/dist/async.js.map +1 -1
- package/dist/channel.cjs +1 -1
- package/dist/channel.cjs.map +1 -1
- package/dist/channel.d.ts +1 -1
- package/dist/channel.d.ts.map +1 -1
- package/dist/channel.js +1 -1
- package/dist/channel.js.map +1 -1
- package/dist/core.cjs +1 -1
- package/dist/core.cjs.map +1 -1
- package/dist/core.d.ts +8 -1
- package/dist/core.d.ts.map +1 -1
- package/dist/core.js +30 -1
- package/dist/core.js.map +1 -1
- package/dist/errors.cjs +1 -1
- package/dist/errors.cjs.map +1 -1
- package/dist/errors.d.ts +4 -0
- package/dist/errors.d.ts.map +1 -1
- package/dist/errors.js +5 -1
- package/dist/errors.js.map +1 -1
- package/dist/flux.cjs +1 -1
- package/dist/flux.cjs.map +1 -1
- package/dist/flux.iife.js +1 -1
- package/dist/flux.iife.js.map +1 -1
- package/dist/flux.js +1 -1
- package/dist/flux.js.map +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.d.ts +13 -13
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +10 -10
- package/dist/operators/combination.cjs +1 -1
- package/dist/operators/combination.cjs.map +1 -1
- package/dist/operators/combination.d.ts +1 -1
- package/dist/operators/combination.d.ts.map +1 -1
- package/dist/operators/combination.js +28 -13
- package/dist/operators/combination.js.map +1 -1
- package/dist/operators/creation.cjs +1 -1
- package/dist/operators/creation.cjs.map +1 -1
- package/dist/operators/creation.d.ts +1 -1
- package/dist/operators/creation.d.ts.map +1 -1
- package/dist/operators/creation.js +36 -30
- package/dist/operators/creation.js.map +1 -1
- package/dist/operators/filtering.cjs +1 -1
- package/dist/operators/filtering.cjs.map +1 -1
- package/dist/operators/filtering.d.ts +1 -1
- package/dist/operators/filtering.d.ts.map +1 -1
- package/dist/operators/filtering.js +31 -28
- package/dist/operators/filtering.js.map +1 -1
- package/dist/operators/transformation.cjs +1 -1
- package/dist/operators/transformation.cjs.map +1 -1
- package/dist/operators/transformation.d.ts +1 -1
- package/dist/operators/transformation.d.ts.map +1 -1
- package/dist/operators/transformation.js +50 -50
- package/dist/operators/transformation.js.map +1 -1
- package/dist/operators/utility.cjs +1 -1
- package/dist/operators/utility.cjs.map +1 -1
- package/dist/operators/utility.d.ts +5 -5
- package/dist/operators/utility.d.ts.map +1 -1
- package/dist/operators/utility.js +57 -57
- package/dist/operators/utility.js.map +1 -1
- package/dist/pipe.cjs.map +1 -1
- package/dist/pipe.d.ts +1 -1
- package/dist/pipe.d.ts.map +1 -1
- package/dist/pipe.js.map +1 -1
- package/dist/subjects.d.ts +2 -2
- package/dist/subjects.d.ts.map +1 -1
- package/package.json +10 -62
- package/dist/adapters/courier.cjs +0 -2
- package/dist/adapters/courier.cjs.map +0 -1
- package/dist/adapters/courier.d.ts +0 -4
- package/dist/adapters/courier.d.ts.map +0 -1
- package/dist/adapters/courier.js +0 -12
- package/dist/adapters/courier.js.map +0 -1
- package/dist/adapters/herald.cjs +0 -2
- package/dist/adapters/herald.cjs.map +0 -1
- package/dist/adapters/herald.d.ts +0 -5
- package/dist/adapters/herald.d.ts.map +0 -1
- package/dist/adapters/herald.js +0 -22
- package/dist/adapters/herald.js.map +0 -1
- package/dist/adapters/pulse.cjs +0 -2
- package/dist/adapters/pulse.cjs.map +0 -1
- package/dist/adapters/pulse.d.ts +0 -5
- package/dist/adapters/pulse.d.ts.map +0 -1
- package/dist/adapters/pulse.js +0 -18
- package/dist/adapters/pulse.js.map +0 -1
- package/dist/adapters/ripple.cjs +0 -2
- package/dist/adapters/ripple.cjs.map +0 -1
- package/dist/adapters/ripple.d.ts +0 -19
- package/dist/adapters/ripple.d.ts.map +0 -1
- package/dist/adapters/ripple.js +0 -46
- package/dist/adapters/ripple.js.map +0 -1
- package/dist/courier.cjs +0 -1
- package/dist/courier.d.ts +0 -2
- package/dist/courier.d.ts.map +0 -1
- package/dist/courier.js +0 -2
- package/dist/herald.cjs +0 -1
- package/dist/herald.d.ts +0 -2
- package/dist/herald.d.ts.map +0 -1
- package/dist/herald.js +0 -2
- package/dist/pulse.cjs +0 -1
- package/dist/pulse.d.ts +0 -2
- package/dist/pulse.d.ts.map +0 -1
- package/dist/pulse.js +0 -2
- package/dist/ripple.cjs +0 -1
- package/dist/ripple.d.ts +0 -3
- package/dist/ripple.d.ts.map +0 -1
- package/dist/ripple.js +0 -2
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
const e=require("../_numeric.cjs"),t=require("../
|
|
1
|
+
const e=require("../_numeric.cjs"),t=require("../errors.cjs"),n=require("../core.cjs"),r=require("../_link.cjs"),i=require("../_safe.cjs");function a(e){return t=>n.stream((n,a)=>r.link(t,{complete:n.complete,error:n.error,next(t){i.tryCall(()=>n.next(e(t)),n.error)}},a).unsubscribe)}function o(e){return t=>n.stream((n,a)=>r.link(t,{complete:n.complete,error:n.error,next(t){i.tryCall(()=>{e(t)&&n.next(t)},n.error)}},a).unsubscribe)}function s(e,t){return a=>n.stream((n,o)=>{let s=t;return r.link(a,{complete:n.complete,error:n.error,next(t){i.tryCall(()=>{s=e(s,t),n.next(s)},n.error)}},o).unsubscribe})}function c(e){return t=>n.stream((n,a)=>{let o=!1,s,c=()=>{o&&!s&&n.complete()},l=r.link(t,{complete(){o=!0,c()},error:n.error,next(t){s?.unsubscribe(),s=void 0,i.tryCall(()=>{let i=r.link(e(t),{complete(){s=void 0,c()},error:n.error,next:n.next},a);s=i.closed?void 0:i},n.error)}},a);return()=>{l.unsubscribe(),s?.unsubscribe()}})}function l(a,o){let s=o.concurrency===1/0;return s||(e.assertPositiveInteger(o.concurrency,`mergeMap concurrency`),e.assertPositiveInteger(o.capacity,`mergeMap capacity`)),e=>n.stream((n,c)=>{let l=[],u=new Set,d=!1,f={},p=()=>{d&&u.size===0&&l.length===0&&n.complete()},m=e=>{i.tryCall(()=>{let t={};t.current=r.link(a(e),{complete(){t.current&&u.delete(t.current),h()},error:n.error,next:n.next},c),t.current.closed?h():u.add(t.current)},n.error)},h=()=>{if(!c.aborted){for(;l.length>0&&(s||u.size<o.concurrency);){let e=l.shift();m(e)}p()}};return f.current=r.link(e,{complete(){d=!0,p()},error:n.error,next(e){if(!s&&l.length>=o.capacity){f.current?.unsubscribe(),n.error(new t.FluxCapacityError(o.capacity,`mergeMap buffer capacity exceeded`));return}l.push(e),h()}},c),()=>{f.current?.unsubscribe();for(let e of u)e.unsubscribe();l.length=0}})}function u(e,t){return l(e,t)}function d(e,t){return l(e,{capacity:t.capacity,concurrency:1})}exports.concatMap=d,exports.filter=o,exports.map=a,exports.mergeMap=u,exports.scan=s,exports.switchMap=c;
|
|
2
2
|
//# sourceMappingURL=transformation.cjs.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"transformation.cjs","names":[],"sources":["../../src/operators/transformation.ts"],"sourcesContent":["import { link } from '../_link';\nimport { assertPositiveInteger } from '../_numeric';\nimport { tryCall } from '../_safe';\nimport { stream } from '../core';\nimport { FluxCapacityError } from '../errors';\nimport type { Operator, Stream, Subscription } from '../types';\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":"2IAcA,SAAgB,EAAU,EAA0C,CAClE,MAAQ,IACN,EAAA,QACG,EAAM,IACL,EAAA,KACE,EACA,CACE,SAAU,EAAK,SACf,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,EAAA,YAAc,EAAK,KAAK,EAAQ,CAAK,CAAC,EAAG,EAAK,KAAK,CACrD,CACF,EACA,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,EAAU,EAAkD,CAC1E,MAAQ,IACN,EAAA,QACG,EAAM,IACL,EAAA,KACE,EACA,CACE,SAAU,EAAK,SACf,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,EAAA,YAAc,CACR,EAAU,CAAK,GAAG,EAAK,KAAK,CAAK,CACvC,EAAG,EAAK,KAAK,CACf,CACF,EACA,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,EAAW,EAAoC,EAA4B,CACzF,MAAQ,IACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAI,EAAQ,EAEZ,OAAO,EAAA,KACL,EACA,CACE,SAAU,EAAK,SACf,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,EAAA,YAAc,CACZ,EAAQ,EAAQ,EAAO,CAAK,EAC5B,EAAK,KAAK,CAAK,CACjB,EAAG,EAAK,KAAK,CACf,CACF,EACA,CACF,CAAC,CAAC,WACJ,CAAC,CACL,CAEA,SAAgB,EAAgB,EAAkD,CAChF,MAAQ,IACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAI,EAAgB,GAChB,EAEE,MAAqB,CACrB,GAAiB,CAAC,GAAO,EAAK,SAAS,CAC7C,EAEM,EAAQ,EAAA,KACZ,EACA,CACE,UAAW,CACT,EAAgB,GAChB,EAAO,CACT,EACA,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,GAAO,YAAY,EACnB,EAAQ,IAAA,GAER,EAAA,YAAc,CACZ,IAAM,EAAe,EAAA,KACnB,EAAQ,CAAK,EACb,CACE,UAAW,CACT,EAAQ,IAAA,GACR,EAAO,CACT,EACA,MAAO,EAAK,MACZ,KAAM,EAAK,IACb,EACA,CACF,EAEA,EAAQ,EAAa,OAAS,IAAA,GAAY,CAC5C,EAAG,EAAK,KAAK,CACf,CACF,EACA,CACF,EAEA,UAAa,CACX,EAAM,YAAY,EAClB,GAAO,YAAY,CACrB,CACF,CAAC,CACL,CAEA,SAAS,EAAc,EAAkC,EAAyC,CAChG,IAAM,EAAY,EAAQ,cAAgB,IAO1C,OALK,IACH,EAAA,sBAAsB,EAAQ,YAAa,sBAAsB,EACjE,EAAA,sBAAsB,EAAQ,SAAU,mBAAmB,GAGrD,GACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAM,EAAa,CAAC,EACd,EAAS,IAAI,IACf,EAAgB,GACd,EAAuC,CAAC,EAExC,MAAqB,CACrB,GAAiB,EAAO,OAAS,GAAK,EAAM,SAAW,GAAG,EAAK,SAAS,CAC9E,EAEM,EAAc,GAAmB,CACrC,EAAA,YAAc,CACZ,IAAM,EAAuC,CAAC,EAE9C,EAAS,QAAU,EAAA,KACjB,EAAQ,CAAK,EACb,CACE,UAAW,CACL,EAAS,SAAS,EAAO,OAAO,EAAS,OAAO,EAEpD,EAAM,CACR,EACA,MAAO,EAAK,MACZ,KAAM,EAAK,IACb,EACA,CACF,EAEK,EAAS,QAAQ,OACjB,EAAM,EADmB,EAAO,IAAI,EAAS,OAAO,CAE3D,EAAG,EAAK,KAAK,CACf,EAEM,MAAoB,CACpB,MAAO,QAEX,MAAO,EAAM,OAAS,IAAM,GAAa,EAAO,KAAO,EAAQ,cAAc,CAC3E,IAAM,EAAQ,EAAM,MAAM,EAE1B,EAAW,CAAK,CAClB,CAEA,EAAO,CAFP,CAGF,EAyBA,MAvBA,GAAS,QAAU,EAAA,KACjB,EACA,CACE,UAAW,CACT,EAAgB,GAChB,EAAO,CACT,EACA,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,GAAI,CAAC,GAAa,EAAM,QAAU,EAAQ,SAAU,CAClD,EAAS,SAAS,YAAY,EAC9B,EAAK,MAAM,IAAI,EAAA,kBAAkB,EAAQ,SAAU,mCAAmC,CAAC,EAEvF,MACF,CAEA,EAAM,KAAK,CAAK,EAChB,EAAM,CACR,CACF,EACA,CACF,MAEa,CACX,EAAS,SAAS,YAAY,EAC9B,IAAK,IAAM,KAAS,EAAQ,EAAM,YAAY,EAC9C,EAAM,OAAS,CACjB,CACF,CAAC,CACL,CAEA,SAAgB,EAAe,EAAkC,EAAyC,CACxG,OAAO,EAAQ,EAAS,CAAO,CACjC,CAEA,SAAgB,EACd,EACA,EACgB,CAChB,OAAO,EAAQ,EAAS,CAAE,SAAU,EAAQ,SAAU,YAAa,CAAE,CAAC,CACxE"}
|
|
1
|
+
{"version":3,"file":"transformation.cjs","names":[],"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":"2IAcA,SAAgB,EAAU,EAA0C,CAClE,MAAQ,IACN,EAAA,QACG,EAAM,IACL,EAAA,KACE,EACA,CACE,SAAU,EAAK,SACf,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,EAAA,YAAc,EAAK,KAAK,EAAQ,CAAK,CAAC,EAAG,EAAK,KAAK,CACrD,CACF,EACA,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,EAAU,EAAkD,CAC1E,MAAQ,IACN,EAAA,QACG,EAAM,IACL,EAAA,KACE,EACA,CACE,SAAU,EAAK,SACf,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,EAAA,YAAc,CACR,EAAU,CAAK,GAAG,EAAK,KAAK,CAAK,CACvC,EAAG,EAAK,KAAK,CACf,CACF,EACA,CACF,CAAC,CAAC,WACN,CACJ,CAEA,SAAgB,EAAW,EAAoC,EAA4B,CACzF,MAAQ,IACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAI,EAAQ,EAEZ,OAAO,EAAA,KACL,EACA,CACE,SAAU,EAAK,SACf,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,EAAA,YAAc,CACZ,EAAQ,EAAQ,EAAO,CAAK,EAC5B,EAAK,KAAK,CAAK,CACjB,EAAG,EAAK,KAAK,CACf,CACF,EACA,CACF,CAAC,CAAC,WACJ,CAAC,CACL,CAEA,SAAgB,EAAgB,EAAkD,CAChF,MAAQ,IACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAI,EAAgB,GAChB,EAEE,MAAqB,CACrB,GAAiB,CAAC,GAAO,EAAK,SAAS,CAC7C,EAEM,EAAQ,EAAA,KACZ,EACA,CACE,UAAW,CACT,EAAgB,GAChB,EAAO,CACT,EACA,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,GAAO,YAAY,EACnB,EAAQ,IAAA,GAER,EAAA,YAAc,CACZ,IAAM,EAAe,EAAA,KACnB,EAAQ,CAAK,EACb,CACE,UAAW,CACT,EAAQ,IAAA,GACR,EAAO,CACT,EACA,MAAO,EAAK,MACZ,KAAM,EAAK,IACb,EACA,CACF,EAEA,EAAQ,EAAa,OAAS,IAAA,GAAY,CAC5C,EAAG,EAAK,KAAK,CACf,CACF,EACA,CACF,EAEA,UAAa,CACX,EAAM,YAAY,EAClB,GAAO,YAAY,CACrB,CACF,CAAC,CACL,CAEA,SAAS,EAAc,EAAkC,EAAyC,CAChG,IAAM,EAAY,EAAQ,cAAgB,IAO1C,OALK,IACH,EAAA,sBAAsB,EAAQ,YAAa,sBAAsB,EACjE,EAAA,sBAAsB,EAAQ,SAAU,mBAAmB,GAGrD,GACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAM,EAAa,CAAC,EACd,EAAS,IAAI,IACf,EAAgB,GACd,EAAuC,CAAC,EAExC,MAAqB,CACrB,GAAiB,EAAO,OAAS,GAAK,EAAM,SAAW,GAAG,EAAK,SAAS,CAC9E,EAEM,EAAc,GAAmB,CACrC,EAAA,YAAc,CACZ,IAAM,EAAuC,CAAC,EAE9C,EAAS,QAAU,EAAA,KACjB,EAAQ,CAAK,EACb,CACE,UAAW,CACL,EAAS,SAAS,EAAO,OAAO,EAAS,OAAO,EAEpD,EAAM,CACR,EACA,MAAO,EAAK,MACZ,KAAM,EAAK,IACb,EACA,CACF,EAEK,EAAS,QAAQ,OACjB,EAAM,EADmB,EAAO,IAAI,EAAS,OAAO,CAE3D,EAAG,EAAK,KAAK,CACf,EAEM,MAAoB,CACpB,MAAO,QAEX,MAAO,EAAM,OAAS,IAAM,GAAa,EAAO,KAAO,EAAQ,cAAc,CAC3E,IAAM,EAAQ,EAAM,MAAM,EAE1B,EAAW,CAAK,CAClB,CAEA,EAAO,CAFP,CAGF,EAyBA,MAvBA,GAAS,QAAU,EAAA,KACjB,EACA,CACE,UAAW,CACT,EAAgB,GAChB,EAAO,CACT,EACA,MAAO,EAAK,MACZ,KAAK,EAAO,CACV,GAAI,CAAC,GAAa,EAAM,QAAU,EAAQ,SAAU,CAClD,EAAS,SAAS,YAAY,EAC9B,EAAK,MAAM,IAAI,EAAA,kBAAkB,EAAQ,SAAU,mCAAmC,CAAC,EAEvF,MACF,CAEA,EAAM,KAAK,CAAK,EAChB,EAAM,CACR,CACF,EACA,CACF,MAEa,CACX,EAAS,SAAS,YAAY,EAC9B,IAAK,IAAM,KAAS,EAAQ,EAAM,YAAY,EAC9C,EAAM,OAAS,CACjB,CACF,CAAC,CACL,CAEA,SAAgB,EAAe,EAAkC,EAAyC,CACxG,OAAO,EAAQ,EAAS,CAAO,CACjC,CAEA,SAAgB,EACd,EACA,EACgB,CAChB,OAAO,EAAQ,EAAS,CAAE,SAAU,EAAQ,SAAU,YAAa,CAAE,CAAC,CACxE"}
|
|
@@ -1 +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,
|
|
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"}
|
|
@@ -1,63 +1,63 @@
|
|
|
1
1
|
import { assertPositiveInteger as e } from "../_numeric.js";
|
|
2
|
-
import {
|
|
3
|
-
import {
|
|
4
|
-
import {
|
|
5
|
-
import {
|
|
2
|
+
import { FluxCapacityError as t } from "../errors.js";
|
|
3
|
+
import { stream as n } from "../core.js";
|
|
4
|
+
import { link as r } from "../_link.js";
|
|
5
|
+
import { tryCall as i } from "../_safe.js";
|
|
6
6
|
//#region src/operators/transformation.ts
|
|
7
7
|
function a(e) {
|
|
8
|
-
return (
|
|
9
|
-
complete:
|
|
10
|
-
error:
|
|
11
|
-
next(
|
|
12
|
-
|
|
8
|
+
return (t) => n((n, a) => r(t, {
|
|
9
|
+
complete: n.complete,
|
|
10
|
+
error: n.error,
|
|
11
|
+
next(t) {
|
|
12
|
+
i(() => n.next(e(t)), n.error);
|
|
13
13
|
}
|
|
14
14
|
}, a).unsubscribe);
|
|
15
15
|
}
|
|
16
16
|
function o(e) {
|
|
17
|
-
return (
|
|
18
|
-
complete:
|
|
19
|
-
error:
|
|
20
|
-
next(
|
|
21
|
-
|
|
22
|
-
e(
|
|
23
|
-
},
|
|
17
|
+
return (t) => n((n, a) => r(t, {
|
|
18
|
+
complete: n.complete,
|
|
19
|
+
error: n.error,
|
|
20
|
+
next(t) {
|
|
21
|
+
i(() => {
|
|
22
|
+
e(t) && n.next(t);
|
|
23
|
+
}, n.error);
|
|
24
24
|
}
|
|
25
25
|
}, a).unsubscribe);
|
|
26
26
|
}
|
|
27
|
-
function s(e,
|
|
28
|
-
return (a) =>
|
|
29
|
-
let s =
|
|
30
|
-
return
|
|
31
|
-
complete:
|
|
32
|
-
error:
|
|
33
|
-
next(
|
|
34
|
-
|
|
35
|
-
s = e(s,
|
|
36
|
-
},
|
|
27
|
+
function s(e, t) {
|
|
28
|
+
return (a) => n((n, o) => {
|
|
29
|
+
let s = t;
|
|
30
|
+
return r(a, {
|
|
31
|
+
complete: n.complete,
|
|
32
|
+
error: n.error,
|
|
33
|
+
next(t) {
|
|
34
|
+
i(() => {
|
|
35
|
+
s = e(s, t), n.next(s);
|
|
36
|
+
}, n.error);
|
|
37
37
|
}
|
|
38
38
|
}, o).unsubscribe;
|
|
39
39
|
});
|
|
40
40
|
}
|
|
41
41
|
function c(e) {
|
|
42
|
-
return (
|
|
42
|
+
return (t) => n((n, a) => {
|
|
43
43
|
let o = !1, s, c = () => {
|
|
44
|
-
o && !s &&
|
|
45
|
-
}, l =
|
|
44
|
+
o && !s && n.complete();
|
|
45
|
+
}, l = r(t, {
|
|
46
46
|
complete() {
|
|
47
47
|
o = !0, c();
|
|
48
48
|
},
|
|
49
|
-
error:
|
|
50
|
-
next(
|
|
51
|
-
s?.unsubscribe(), s = void 0,
|
|
52
|
-
let
|
|
49
|
+
error: n.error,
|
|
50
|
+
next(t) {
|
|
51
|
+
s?.unsubscribe(), s = void 0, i(() => {
|
|
52
|
+
let i = r(e(t), {
|
|
53
53
|
complete() {
|
|
54
54
|
s = void 0, c();
|
|
55
55
|
},
|
|
56
|
-
error:
|
|
57
|
-
next:
|
|
56
|
+
error: n.error,
|
|
57
|
+
next: n.next
|
|
58
58
|
}, a);
|
|
59
|
-
s =
|
|
60
|
-
},
|
|
59
|
+
s = i.closed ? void 0 : i;
|
|
60
|
+
}, n.error);
|
|
61
61
|
}
|
|
62
62
|
}, a);
|
|
63
63
|
return () => {
|
|
@@ -67,20 +67,20 @@ function c(e) {
|
|
|
67
67
|
}
|
|
68
68
|
function l(a, o) {
|
|
69
69
|
let s = o.concurrency === Infinity;
|
|
70
|
-
return s || (e(o.concurrency, "mergeMap concurrency"), e(o.capacity, "mergeMap capacity")), (e) =>
|
|
70
|
+
return s || (e(o.concurrency, "mergeMap concurrency"), e(o.capacity, "mergeMap capacity")), (e) => n((n, c) => {
|
|
71
71
|
let l = [], u = /* @__PURE__ */ new Set(), d = !1, f = {}, p = () => {
|
|
72
|
-
d && u.size === 0 && l.length === 0 &&
|
|
72
|
+
d && u.size === 0 && l.length === 0 && n.complete();
|
|
73
73
|
}, m = (e) => {
|
|
74
|
-
|
|
75
|
-
let
|
|
76
|
-
|
|
74
|
+
i(() => {
|
|
75
|
+
let t = {};
|
|
76
|
+
t.current = r(a(e), {
|
|
77
77
|
complete() {
|
|
78
|
-
|
|
78
|
+
t.current && u.delete(t.current), h();
|
|
79
79
|
},
|
|
80
|
-
error:
|
|
81
|
-
next:
|
|
82
|
-
}, c),
|
|
83
|
-
},
|
|
80
|
+
error: n.error,
|
|
81
|
+
next: n.next
|
|
82
|
+
}, c), t.current.closed ? h() : u.add(t.current);
|
|
83
|
+
}, n.error);
|
|
84
84
|
}, h = () => {
|
|
85
85
|
if (!c.aborted) {
|
|
86
86
|
for (; l.length > 0 && (s || u.size < o.concurrency);) {
|
|
@@ -90,14 +90,14 @@ function l(a, o) {
|
|
|
90
90
|
p();
|
|
91
91
|
}
|
|
92
92
|
};
|
|
93
|
-
return f.current =
|
|
93
|
+
return f.current = r(e, {
|
|
94
94
|
complete() {
|
|
95
95
|
d = !0, p();
|
|
96
96
|
},
|
|
97
|
-
error:
|
|
97
|
+
error: n.error,
|
|
98
98
|
next(e) {
|
|
99
99
|
if (!s && l.length >= o.capacity) {
|
|
100
|
-
f.current?.unsubscribe(),
|
|
100
|
+
f.current?.unsubscribe(), n.error(new t(o.capacity, "mergeMap buffer capacity exceeded"));
|
|
101
101
|
return;
|
|
102
102
|
}
|
|
103
103
|
l.push(e), h();
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"transformation.js","names":[],"sources":["../../src/operators/transformation.ts"],"sourcesContent":["import { link } from '../_link';\nimport { assertPositiveInteger } from '../_numeric';\nimport { tryCall } from '../_safe';\nimport { stream } from '../core';\nimport { FluxCapacityError } from '../errors';\nimport type { Operator, Stream, Subscription } from '../types';\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,EAAU,GAA0C;CAClE,QAAQ,MACN,GACG,GAAM,MACL,EACE,GACA;EACE,UAAU,EAAK;EACf,OAAO,EAAK;EACZ,KAAK,GAAO;GACV,QAAc,EAAK,KAAK,EAAQ,CAAK,CAAC,GAAG,EAAK,KAAK;EACrD;CACF,GACA,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,EAAU,GAAkD;CAC1E,QAAQ,MACN,GACG,GAAM,MACL,EACE,GACA;EACE,UAAU,EAAK;EACf,OAAO,EAAK;EACZ,KAAK,GAAO;GACV,QAAc;IACZ,AAAI,EAAU,CAAK,KAAG,EAAK,KAAK,CAAK;GACvC,GAAG,EAAK,KAAK;EACf;CACF,GACA,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,EAAW,GAAoC,GAA4B;CACzF,QAAQ,MACN,GAAQ,GAAM,MAAW;EACvB,IAAI,IAAQ;EAEZ,OAAO,EACL,GACA;GACE,UAAU,EAAK;GACf,OAAO,EAAK;GACZ,KAAK,GAAO;IACV,QAAc;KAEZ,AADA,IAAQ,EAAQ,GAAO,CAAK,GAC5B,EAAK,KAAK,CAAK;IACjB,GAAG,EAAK,KAAK;GACf;EACF,GACA,CACF,CAAC,CAAC;CACJ,CAAC;AACL;AAEA,SAAgB,EAAgB,GAAkD;CAChF,QAAQ,MACN,GAAQ,GAAM,MAAW;EACvB,IAAI,IAAgB,IAChB,GAEE,UAAqB;GACzB,AAAI,KAAiB,CAAC,KAAO,EAAK,SAAS;EAC7C,GAEM,IAAQ,EACZ,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,EAAO;GACT;GACA,OAAO,EAAK;GACZ,KAAK,GAAO;IAIV,AAHA,GAAO,YAAY,GACnB,IAAQ,KAAA,GAER,QAAc;KACZ,IAAM,IAAe,EACnB,EAAQ,CAAK,GACb;MACE,WAAW;OAET,AADA,IAAQ,KAAA,GACR,EAAO;MACT;MACA,OAAO,EAAK;MACZ,MAAM,EAAK;KACb,GACA,CACF;KAEA,IAAQ,EAAa,SAAS,KAAA,IAAY;IAC5C,GAAG,EAAK,KAAK;GACf;EACF,GACA,CACF;EAEA,aAAa;GAEX,AADA,EAAM,YAAY,GAClB,GAAO,YAAY;EACrB;CACF,CAAC;AACL;AAEA,SAAS,EAAc,GAAkC,GAAyC;CAChG,IAAM,IAAY,EAAQ,gBAAgB;CAO1C,OALK,MACH,EAAsB,EAAQ,aAAa,sBAAsB,GACjE,EAAsB,EAAQ,UAAU,mBAAmB,KAGrD,MACN,GAAQ,GAAM,MAAW;EACvB,IAAM,IAAa,CAAC,GACd,oBAAS,IAAI,IAAkB,GACjC,IAAgB,IACd,IAAuC,CAAC,GAExC,UAAqB;GACzB,AAAI,KAAiB,EAAO,SAAS,KAAK,EAAM,WAAW,KAAG,EAAK,SAAS;EAC9E,GAEM,KAAc,MAAmB;GACrC,QAAc;IACZ,IAAM,IAAuC,CAAC;IAgB9C,AAdA,EAAS,UAAU,EACjB,EAAQ,CAAK,GACb;KACE,WAAW;MAGT,AAFI,EAAS,WAAS,EAAO,OAAO,EAAS,OAAO,GAEpD,EAAM;KACR;KACA,OAAO,EAAK;KACZ,MAAM,EAAK;IACb,GACA,CACF,GAEK,EAAS,QAAQ,SACjB,EAAM,IADmB,EAAO,IAAI,EAAS,OAAO;GAE3D,GAAG,EAAK,KAAK;EACf,GAEM,UAAoB;GACpB,OAAO,SAEX;WAAO,EAAM,SAAS,MAAM,KAAa,EAAO,OAAO,EAAQ,eAAc;KAC3E,IAAM,IAAQ,EAAM,MAAM;KAE1B,EAAW,CAAK;IAClB;IAEA,EAAO;GAFP;EAGF;EAyBA,OAvBA,EAAS,UAAU,EACjB,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,EAAO;GACT;GACA,OAAO,EAAK;GACZ,KAAK,GAAO;IACV,IAAI,CAAC,KAAa,EAAM,UAAU,EAAQ,UAAU;KAElD,AADA,EAAS,SAAS,YAAY,GAC9B,EAAK,MAAM,IAAI,EAAkB,EAAQ,UAAU,mCAAmC,CAAC;KAEvF;IACF;IAGA,AADA,EAAM,KAAK,CAAK,GAChB,EAAM;GACR;EACF,GACA,CACF,SAEa;GACX,EAAS,SAAS,YAAY;GAC9B,KAAK,IAAM,KAAS,GAAQ,EAAM,YAAY;GAC9C,EAAM,SAAS;EACjB;CACF,CAAC;AACL;AAEA,SAAgB,EAAe,GAAkC,GAAyC;CACxG,OAAO,EAAQ,GAAS,CAAO;AACjC;AAEA,SAAgB,EACd,GACA,GACgB;CAChB,OAAO,EAAQ,GAAS;EAAE,UAAU,EAAQ;EAAU,aAAa;CAAE,CAAC;AACxE"}
|
|
1
|
+
{"version":3,"file":"transformation.js","names":[],"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,EAAU,GAA0C;CAClE,QAAQ,MACN,GACG,GAAM,MACL,EACE,GACA;EACE,UAAU,EAAK;EACf,OAAO,EAAK;EACZ,KAAK,GAAO;GACV,QAAc,EAAK,KAAK,EAAQ,CAAK,CAAC,GAAG,EAAK,KAAK;EACrD;CACF,GACA,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,EAAU,GAAkD;CAC1E,QAAQ,MACN,GACG,GAAM,MACL,EACE,GACA;EACE,UAAU,EAAK;EACf,OAAO,EAAK;EACZ,KAAK,GAAO;GACV,QAAc;IACZ,AAAI,EAAU,CAAK,KAAG,EAAK,KAAK,CAAK;GACvC,GAAG,EAAK,KAAK;EACf;CACF,GACA,CACF,CAAC,CAAC,WACN;AACJ;AAEA,SAAgB,EAAW,GAAoC,GAA4B;CACzF,QAAQ,MACN,GAAQ,GAAM,MAAW;EACvB,IAAI,IAAQ;EAEZ,OAAO,EACL,GACA;GACE,UAAU,EAAK;GACf,OAAO,EAAK;GACZ,KAAK,GAAO;IACV,QAAc;KAEZ,AADA,IAAQ,EAAQ,GAAO,CAAK,GAC5B,EAAK,KAAK,CAAK;IACjB,GAAG,EAAK,KAAK;GACf;EACF,GACA,CACF,CAAC,CAAC;CACJ,CAAC;AACL;AAEA,SAAgB,EAAgB,GAAkD;CAChF,QAAQ,MACN,GAAQ,GAAM,MAAW;EACvB,IAAI,IAAgB,IAChB,GAEE,UAAqB;GACzB,AAAI,KAAiB,CAAC,KAAO,EAAK,SAAS;EAC7C,GAEM,IAAQ,EACZ,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,EAAO;GACT;GACA,OAAO,EAAK;GACZ,KAAK,GAAO;IAIV,AAHA,GAAO,YAAY,GACnB,IAAQ,KAAA,GAER,QAAc;KACZ,IAAM,IAAe,EACnB,EAAQ,CAAK,GACb;MACE,WAAW;OAET,AADA,IAAQ,KAAA,GACR,EAAO;MACT;MACA,OAAO,EAAK;MACZ,MAAM,EAAK;KACb,GACA,CACF;KAEA,IAAQ,EAAa,SAAS,KAAA,IAAY;IAC5C,GAAG,EAAK,KAAK;GACf;EACF,GACA,CACF;EAEA,aAAa;GAEX,AADA,EAAM,YAAY,GAClB,GAAO,YAAY;EACrB;CACF,CAAC;AACL;AAEA,SAAS,EAAc,GAAkC,GAAyC;CAChG,IAAM,IAAY,EAAQ,gBAAgB;CAO1C,OALK,MACH,EAAsB,EAAQ,aAAa,sBAAsB,GACjE,EAAsB,EAAQ,UAAU,mBAAmB,KAGrD,MACN,GAAQ,GAAM,MAAW;EACvB,IAAM,IAAa,CAAC,GACd,oBAAS,IAAI,IAAkB,GACjC,IAAgB,IACd,IAAuC,CAAC,GAExC,UAAqB;GACzB,AAAI,KAAiB,EAAO,SAAS,KAAK,EAAM,WAAW,KAAG,EAAK,SAAS;EAC9E,GAEM,KAAc,MAAmB;GACrC,QAAc;IACZ,IAAM,IAAuC,CAAC;IAgB9C,AAdA,EAAS,UAAU,EACjB,EAAQ,CAAK,GACb;KACE,WAAW;MAGT,AAFI,EAAS,WAAS,EAAO,OAAO,EAAS,OAAO,GAEpD,EAAM;KACR;KACA,OAAO,EAAK;KACZ,MAAM,EAAK;IACb,GACA,CACF,GAEK,EAAS,QAAQ,SACjB,EAAM,IADmB,EAAO,IAAI,EAAS,OAAO;GAE3D,GAAG,EAAK,KAAK;EACf,GAEM,UAAoB;GACpB,OAAO,SAEX;WAAO,EAAM,SAAS,MAAM,KAAa,EAAO,OAAO,EAAQ,eAAc;KAC3E,IAAM,IAAQ,EAAM,MAAM;KAE1B,EAAW,CAAK;IAClB;IAEA,EAAO;GAFP;EAGF;EAyBA,OAvBA,EAAS,UAAU,EACjB,GACA;GACE,WAAW;IAET,AADA,IAAgB,IAChB,EAAO;GACT;GACA,OAAO,EAAK;GACZ,KAAK,GAAO;IACV,IAAI,CAAC,KAAa,EAAM,UAAU,EAAQ,UAAU;KAElD,AADA,EAAS,SAAS,YAAY,GAC9B,EAAK,MAAM,IAAI,EAAkB,EAAQ,UAAU,mCAAmC,CAAC;KAEvF;IACF;IAGA,AADA,EAAM,KAAK,CAAK,GAChB,EAAM;GACR;EACF,GACA,CACF,SAEa;GACX,EAAS,SAAS,YAAY;GAC9B,KAAK,IAAM,KAAS,GAAQ,EAAM,YAAY;GAC9C,EAAM,SAAS;EACjB;CACF,CAAC;AACL;AAEA,SAAgB,EAAe,GAAkC,GAAyC;CACxG,OAAO,EAAQ,GAAS,CAAO;AACjC;AAEA,SAAgB,EACd,GACA,GACgB;CAChB,OAAO,EAAQ,GAAS;EAAE,UAAU,EAAQ;EAAU,aAAa;CAAE,CAAC;AACxE"}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
const e=require("../_numeric.cjs"),t=require("../
|
|
1
|
+
const e=require("../_numeric.cjs"),t=require("../errors.cjs"),n=require("../core.cjs"),r=require("../_link.cjs"),i=require("../_scheduler.cjs"),a=require("../_safe.cjs");let o=require("@vielzeug/arsenal");function s(t){return e.assertNonNegativeInteger(t.attempts,`retry attempts`),o=>n.stream((n,s)=>{let c=0,l,u,d=()=>{if(s.aborted)return;let f=r.link(o,{complete:n.complete,error(r){if(c===t.attempts){n.error(r);return}let o=c++,l;if(a.tryCall(()=>{l=typeof t.delay==`function`?t.delay(o):t.delay},n.error),!s.aborted){if(l!==void 0)try{e.assertDuration(l,`Retry delay`)}catch(e){n.error(e);return}l===void 0||l===0?queueMicrotask(d):u=i.defaultScheduler.delay(d,l)}},next:n.next},s);f.closed||(l=f)};return d(),()=>{u?.(),l?.unsubscribe()}})}function c(e,n){return new Promise((i,a)=>{let s=new AbortController,c=()=>{s.abort(),a((0,o.abortError)(n?.signal,`Stream consumption aborted`))};if(n?.signal?.aborted){c();return}n?.signal?.addEventListener(`abort`,c,{once:!0}),r.link(e,{complete(){n?.signal?.removeEventListener(`abort`,c),`defaultValue`in(n??{})?i(n.defaultValue):a(new t.FluxEmptyError)},error(e){n?.signal?.removeEventListener(`abort`,c),a(e)},next(e){n?.signal?.removeEventListener(`abort`,c),s.abort(),i(e)}},s.signal)})}function l(e,n){return new Promise((i,a)=>{let s=new AbortController,c=()=>{s.abort(),a((0,o.abortError)(n?.signal,`Stream consumption aborted`))};if(n?.signal?.aborted){c();return}let l=!1,u;n?.signal?.addEventListener(`abort`,c,{once:!0}),r.link(e,{complete(){n?.signal?.removeEventListener(`abort`,c),l?i(u):`defaultValue`in(n??{})?i(n.defaultValue):a(new t.FluxEmptyError)},error(e){n?.signal?.removeEventListener(`abort`,c),a(e)},next(e){l=!0,u=e}},s.signal)})}function u(n,i){return e.assertNonNegativeInteger(i.maxItems,`toArray maxItems`),new Promise((e,a)=>{let s=new AbortController,c=[],l=()=>{s.abort(),a((0,o.abortError)(i?.signal,`Stream consumption aborted`))};if(i.signal?.aborted){l();return}i.signal?.addEventListener(`abort`,l,{once:!0}),r.link(n,{complete(){i.signal?.removeEventListener(`abort`,l),e(c)},error(e){i.signal?.removeEventListener(`abort`,l),a(e)},next(e){if(c.length===i.maxItems){i.signal?.removeEventListener(`abort`,l),s.abort(),a(new t.FluxCapacityError(i.maxItems,`toArray maxItems exceeded`));return}c.push(e)}},s.signal)})}exports.first=c,exports.last=l,exports.retry=s,exports.toArray=u;
|
|
2
2
|
//# sourceMappingURL=utility.cjs.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"utility.cjs","names":[],"sources":["../../src/operators/utility.ts"],"sourcesContent":["import { link } from '../_link';\nimport { assertNonNegativeInteger } from '../_numeric';\nimport { tryCall } from '../_safe';\nimport { defaultScheduler } from '../_scheduler';\nimport { stream } from '../core';\nimport { FluxCapacityError, FluxEmptyError } from '../errors';\nimport type { Operator, Stream, Subscription } from '../types';\n\nexport type RetryOptions = {\n attempts: number;\n delay?: number | ((attempt: number) => number);\n};\n\nexport type ToArrayOptions = {\n maxItems: number;\n signal?: AbortSignal;\n};\n\nexport type ValueOptions = {\n signal?: AbortSignal;\n /** Resolved when the source completes empty instead of rejecting with `FluxEmptyError`. */\n defaultValue?:
|
|
1
|
+
{"version":3,"file":"utility.cjs","names":[],"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 attempts: 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.attempts, 'retry attempts');\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.attempts) {\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":"6MA0BA,SAAgB,EAAS,EAAuC,CAG9D,OAFA,EAAA,yBAAyB,EAAQ,SAAU,gBAAgB,EAEnD,GACN,EAAA,QAAQ,EAAM,IAAW,CACvB,IAAI,EAAW,EACX,EACA,EAEE,MAAoB,CACxB,GAAI,EAAO,QAAS,OAEpB,IAAM,EAAe,EAAA,KACnB,EACA,CACE,SAAU,EAAK,SACf,MAAM,EAAQ,CACZ,GAAI,IAAa,EAAQ,SAAU,CACjC,EAAK,MAAM,CAAM,EAEjB,MACF,CAEA,IAAM,EAAU,IACZ,EAEJ,KAAA,YAAc,CACZ,EAAQ,OAAO,EAAQ,OAAU,WAAa,EAAQ,MAAM,CAAO,EAAI,EAAQ,KACjF,EAAG,EAAK,KAAK,EAET,GAAO,QAEX,IAAI,IAAU,IAAA,GACZ,GAAI,CACF,EAAA,eAAe,EAAO,aAAa,CACrC,OAAS,EAAQ,CACf,EAAK,MAAM,CAAM,EACjB,MACF,CAGE,IAAU,IAAA,IAAa,IAAU,EACnC,eAAe,CAAK,EAEpB,EAAc,EAAA,iBAAiB,MAAM,EAAO,CAAK,CANjD,CAQJ,EACA,KAAM,EAAK,IACb,EACA,CACF,EAEK,EAAa,SAAQ,EAAU,EACtC,EAIA,OAFA,EAAM,MAEO,CACX,IAAc,EACd,GAAS,YAAY,CACvB,CACF,CAAC,CACL,CAEA,SAAgB,EAAS,EAAmB,EAAuC,CACjF,OAAO,IAAI,SAAY,EAAS,IAAW,CACzC,IAAM,EAAa,IAAI,gBACjB,MAAoB,CACxB,EAAW,MAAM,EACjB,GAAA,EAAO,EAAA,WAAA,CAAW,GAAS,OAAQ,4BAA4B,CAAC,CAClE,EAEA,GAAI,GAAS,QAAQ,QAAS,CAC5B,EAAM,EAEN,MACF,CAEA,GAAS,QAAQ,iBAAiB,QAAS,EAAO,CAAE,KAAM,EAAK,CAAC,EAChE,EAAA,KACE,EACA,CACE,UAAW,CACT,GAAS,QAAQ,oBAAoB,QAAS,CAAK,EAE/C,iBAAmB,GAAW,CAAC,GAAI,EAAQ,EAAS,YAAiB,EACpE,EAAO,IAAI,EAAA,cAAgB,CAClC,EACA,MAAM,EAAQ,CACZ,GAAS,QAAQ,oBAAoB,QAAS,CAAK,EACnD,EAAO,CAAM,CACf,EACA,KAAK,EAAO,CACV,GAAS,QAAQ,oBAAoB,QAAS,CAAK,EACnD,EAAW,MAAM,EACjB,EAAQ,CAAK,CACf,CACF,EACA,EAAW,MACb,CACF,CAAC,CACH,CAEA,SAAgB,EAAQ,EAAmB,EAAuC,CAChF,OAAO,IAAI,SAAY,EAAS,IAAW,CACzC,IAAM,EAAa,IAAI,gBACjB,MAAoB,CACxB,EAAW,MAAM,EACjB,GAAA,EAAO,EAAA,WAAA,CAAW,GAAS,OAAQ,4BAA4B,CAAC,CAClE,EAEA,GAAI,GAAS,QAAQ,QAAS,CAC5B,EAAM,EAEN,MACF,CAEA,IAAI,EAAU,GACV,EAEJ,GAAS,QAAQ,iBAAiB,QAAS,EAAO,CAAE,KAAM,EAAK,CAAC,EAChE,EAAA,KACE,EACA,CACE,UAAW,CACT,GAAS,QAAQ,oBAAoB,QAAS,CAAK,EAE/C,EAAS,EAAQ,CAAW,EACvB,iBAAmB,GAAW,CAAC,GAAI,EAAQ,EAAS,YAAiB,EACzE,EAAO,IAAI,EAAA,cAAgB,CAClC,EACA,MAAM,EAAQ,CACZ,GAAS,QAAQ,oBAAoB,QAAS,CAAK,EACnD,EAAO,CAAM,CACf,EACA,KAAK,EAAO,CACV,EAAU,GACV,EAAS,CACX,CACF,EACA,EAAW,MACb,CACF,CAAC,CACH,CAEA,SAAgB,EAAW,EAAmB,EAAuC,CAGnF,OAFA,EAAA,yBAAyB,EAAQ,SAAU,kBAAkB,EAEtD,IAAI,SAAc,EAAS,IAAW,CAC3C,IAAM,EAAa,IAAI,gBACjB,EAAc,CAAC,EACf,MAAoB,CACxB,EAAW,MAAM,EACjB,GAAA,EAAO,EAAA,WAAA,CAAW,GAAS,OAAQ,4BAA4B,CAAC,CAClE,EAEA,GAAI,EAAQ,QAAQ,QAAS,CAC3B,EAAM,EAEN,MACF,CAEA,EAAQ,QAAQ,iBAAiB,QAAS,EAAO,CAAE,KAAM,EAAK,CAAC,EAC/D,EAAA,KACE,EACA,CACE,UAAW,CACT,EAAQ,QAAQ,oBAAoB,QAAS,CAAK,EAClD,EAAQ,CAAM,CAChB,EACA,MAAM,EAAQ,CACZ,EAAQ,QAAQ,oBAAoB,QAAS,CAAK,EAClD,EAAO,CAAM,CACf,EACA,KAAK,EAAO,CACV,GAAI,EAAO,SAAW,EAAQ,SAAU,CACtC,EAAQ,QAAQ,oBAAoB,QAAS,CAAK,EAClD,EAAW,MAAM,EACjB,EAAO,IAAI,EAAA,kBAAkB,EAAQ,SAAU,2BAA2B,CAAC,EAE3E,MACF,CAEA,EAAO,KAAK,CAAK,CACnB,CACF,EACA,EAAW,MACb,CACF,CAAC,CACH"}
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import type { Operator, Stream } from '../types';
|
|
1
|
+
import type { Operator, Stream } from '../types.js';
|
|
2
2
|
export type RetryOptions = {
|
|
3
3
|
attempts: number;
|
|
4
4
|
delay?: number | ((attempt: number) => number);
|
|
@@ -7,13 +7,13 @@ export type ToArrayOptions = {
|
|
|
7
7
|
maxItems: number;
|
|
8
8
|
signal?: AbortSignal;
|
|
9
9
|
};
|
|
10
|
-
export type ValueOptions = {
|
|
10
|
+
export type ValueOptions<T> = {
|
|
11
11
|
signal?: AbortSignal;
|
|
12
12
|
/** Resolved when the source completes empty instead of rejecting with `FluxEmptyError`. */
|
|
13
|
-
defaultValue?:
|
|
13
|
+
defaultValue?: T;
|
|
14
14
|
};
|
|
15
15
|
export declare function retry<T>(options: RetryOptions): Operator<T, T>;
|
|
16
|
-
export declare function first<T>(source: Stream<T>, options?: ValueOptions): Promise<T>;
|
|
17
|
-
export declare function last<T>(source: Stream<T>, options?: ValueOptions): Promise<T>;
|
|
16
|
+
export declare function first<T>(source: Stream<T>, options?: ValueOptions<T>): Promise<T>;
|
|
17
|
+
export declare function last<T>(source: Stream<T>, options?: ValueOptions<T>): Promise<T>;
|
|
18
18
|
export declare function toArray<T>(source: Stream<T>, options: ToArrayOptions): Promise<T[]>;
|
|
19
19
|
//# sourceMappingURL=utility.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"utility.d.ts","sourceRoot":"","sources":["../../src/operators/utility.ts"],"names":[],"mappings":"
|
|
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,QAAQ,EAAE,MAAM,CAAC;IACjB,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"}
|
|
@@ -1,82 +1,82 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
import {
|
|
4
|
-
import {
|
|
5
|
-
import { FluxCapacityError as i, FluxEmptyError as a } from "../errors.js";
|
|
1
|
+
import { assertDuration as e, assertNonNegativeInteger as t } from "../_numeric.js";
|
|
2
|
+
import { FluxCapacityError as n, FluxEmptyError as r } from "../errors.js";
|
|
3
|
+
import { stream as i } from "../core.js";
|
|
4
|
+
import { link as a } from "../_link.js";
|
|
6
5
|
import { defaultScheduler as o } from "../_scheduler.js";
|
|
6
|
+
import { tryCall as s } from "../_safe.js";
|
|
7
|
+
import { abortError as c } from "@vielzeug/arsenal";
|
|
7
8
|
//#region src/operators/utility.ts
|
|
8
|
-
function
|
|
9
|
-
return
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
error(e) {
|
|
18
|
-
if (s === i.attempts) {
|
|
19
|
-
t.error(e);
|
|
9
|
+
function l(n) {
|
|
10
|
+
return t(n.attempts, "retry attempts"), (t) => i((r, i) => {
|
|
11
|
+
let c = 0, l, u, d = () => {
|
|
12
|
+
if (i.aborted) return;
|
|
13
|
+
let f = a(t, {
|
|
14
|
+
complete: r.complete,
|
|
15
|
+
error(t) {
|
|
16
|
+
if (c === n.attempts) {
|
|
17
|
+
r.error(t);
|
|
20
18
|
return;
|
|
21
19
|
}
|
|
22
|
-
let
|
|
23
|
-
if (
|
|
24
|
-
|
|
25
|
-
},
|
|
26
|
-
if (
|
|
27
|
-
|
|
20
|
+
let a = c++, l;
|
|
21
|
+
if (s(() => {
|
|
22
|
+
l = typeof n.delay == "function" ? n.delay(a) : n.delay;
|
|
23
|
+
}, r.error), !i.aborted) {
|
|
24
|
+
if (l !== void 0) try {
|
|
25
|
+
e(l, "Retry delay");
|
|
26
|
+
} catch (e) {
|
|
27
|
+
r.error(e);
|
|
28
28
|
return;
|
|
29
29
|
}
|
|
30
|
-
|
|
30
|
+
l === void 0 || l === 0 ? queueMicrotask(d) : u = o.delay(d, l);
|
|
31
31
|
}
|
|
32
32
|
},
|
|
33
|
-
next:
|
|
34
|
-
},
|
|
35
|
-
|
|
33
|
+
next: r.next
|
|
34
|
+
}, i);
|
|
35
|
+
f.closed || (l = f);
|
|
36
36
|
};
|
|
37
|
-
return
|
|
38
|
-
|
|
37
|
+
return d(), () => {
|
|
38
|
+
u?.(), l?.unsubscribe();
|
|
39
39
|
};
|
|
40
40
|
});
|
|
41
41
|
}
|
|
42
|
-
function
|
|
43
|
-
return new Promise((
|
|
44
|
-
let o = new AbortController(),
|
|
45
|
-
o.abort(), i(
|
|
42
|
+
function u(e, t) {
|
|
43
|
+
return new Promise((n, i) => {
|
|
44
|
+
let o = new AbortController(), s = () => {
|
|
45
|
+
o.abort(), i(c(t?.signal, "Stream consumption aborted"));
|
|
46
46
|
};
|
|
47
47
|
if (t?.signal?.aborted) {
|
|
48
|
-
|
|
48
|
+
s();
|
|
49
49
|
return;
|
|
50
50
|
}
|
|
51
|
-
t?.signal?.addEventListener("abort",
|
|
51
|
+
t?.signal?.addEventListener("abort", s, { once: !0 }), a(e, {
|
|
52
52
|
complete() {
|
|
53
|
-
t?.signal?.removeEventListener("abort",
|
|
53
|
+
t?.signal?.removeEventListener("abort", s), "defaultValue" in (t ?? {}) ? n(t.defaultValue) : i(new r());
|
|
54
54
|
},
|
|
55
55
|
error(e) {
|
|
56
|
-
t?.signal?.removeEventListener("abort",
|
|
56
|
+
t?.signal?.removeEventListener("abort", s), i(e);
|
|
57
57
|
},
|
|
58
58
|
next(e) {
|
|
59
|
-
t?.signal?.removeEventListener("abort",
|
|
59
|
+
t?.signal?.removeEventListener("abort", s), o.abort(), n(e);
|
|
60
60
|
}
|
|
61
61
|
}, o.signal);
|
|
62
62
|
});
|
|
63
63
|
}
|
|
64
|
-
function
|
|
65
|
-
return new Promise((
|
|
66
|
-
let o = new AbortController(),
|
|
67
|
-
o.abort(), i(
|
|
64
|
+
function d(e, t) {
|
|
65
|
+
return new Promise((n, i) => {
|
|
66
|
+
let o = new AbortController(), s = () => {
|
|
67
|
+
o.abort(), i(c(t?.signal, "Stream consumption aborted"));
|
|
68
68
|
};
|
|
69
69
|
if (t?.signal?.aborted) {
|
|
70
|
-
|
|
70
|
+
s();
|
|
71
71
|
return;
|
|
72
72
|
}
|
|
73
73
|
let l = !1, u;
|
|
74
|
-
t?.signal?.addEventListener("abort",
|
|
74
|
+
t?.signal?.addEventListener("abort", s, { once: !0 }), a(e, {
|
|
75
75
|
complete() {
|
|
76
|
-
t?.signal?.removeEventListener("abort",
|
|
76
|
+
t?.signal?.removeEventListener("abort", s), l ? n(u) : "defaultValue" in (t ?? {}) ? n(t.defaultValue) : i(new r());
|
|
77
77
|
},
|
|
78
78
|
error(e) {
|
|
79
|
-
t?.signal?.removeEventListener("abort",
|
|
79
|
+
t?.signal?.removeEventListener("abort", s), i(e);
|
|
80
80
|
},
|
|
81
81
|
next(e) {
|
|
82
82
|
l = !0, u = e;
|
|
@@ -84,33 +84,33 @@ function u(e, t) {
|
|
|
84
84
|
}, o.signal);
|
|
85
85
|
});
|
|
86
86
|
}
|
|
87
|
-
function
|
|
88
|
-
return
|
|
89
|
-
let o = new AbortController(),
|
|
90
|
-
o.abort(),
|
|
87
|
+
function f(e, r) {
|
|
88
|
+
return t(r.maxItems, "toArray maxItems"), new Promise((t, i) => {
|
|
89
|
+
let o = new AbortController(), s = [], l = () => {
|
|
90
|
+
o.abort(), i(c(r?.signal, "Stream consumption aborted"));
|
|
91
91
|
};
|
|
92
92
|
if (r.signal?.aborted) {
|
|
93
93
|
l();
|
|
94
94
|
return;
|
|
95
95
|
}
|
|
96
|
-
r.signal?.addEventListener("abort", l, { once: !0 }),
|
|
96
|
+
r.signal?.addEventListener("abort", l, { once: !0 }), a(e, {
|
|
97
97
|
complete() {
|
|
98
|
-
r.signal?.removeEventListener("abort", l),
|
|
98
|
+
r.signal?.removeEventListener("abort", l), t(s);
|
|
99
99
|
},
|
|
100
100
|
error(e) {
|
|
101
|
-
r.signal?.removeEventListener("abort", l),
|
|
101
|
+
r.signal?.removeEventListener("abort", l), i(e);
|
|
102
102
|
},
|
|
103
103
|
next(e) {
|
|
104
|
-
if (
|
|
105
|
-
r.signal?.removeEventListener("abort", l), o.abort(),
|
|
104
|
+
if (s.length === r.maxItems) {
|
|
105
|
+
r.signal?.removeEventListener("abort", l), o.abort(), i(new n(r.maxItems, "toArray maxItems exceeded"));
|
|
106
106
|
return;
|
|
107
107
|
}
|
|
108
|
-
|
|
108
|
+
s.push(e);
|
|
109
109
|
}
|
|
110
110
|
}, o.signal);
|
|
111
111
|
});
|
|
112
112
|
}
|
|
113
113
|
//#endregion
|
|
114
|
-
export {
|
|
114
|
+
export { u as first, d as last, l as retry, f as toArray };
|
|
115
115
|
|
|
116
116
|
//# sourceMappingURL=utility.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"utility.js","names":[],"sources":["../../src/operators/utility.ts"],"sourcesContent":["import { link } from '../_link';\nimport { assertNonNegativeInteger } from '../_numeric';\nimport { tryCall } from '../_safe';\nimport { defaultScheduler } from '../_scheduler';\nimport { stream } from '../core';\nimport { FluxCapacityError, FluxEmptyError } from '../errors';\nimport type { Operator, Stream, Subscription } from '../types';\n\nexport type RetryOptions = {\n attempts: number;\n delay?: number | ((attempt: number) => number);\n};\n\nexport type ToArrayOptions = {\n maxItems: number;\n signal?: AbortSignal;\n};\n\nexport type ValueOptions = {\n signal?: AbortSignal;\n /** Resolved when the source completes empty instead of rejecting with `FluxEmptyError`. */\n defaultValue?:
|
|
1
|
+
{"version":3,"file":"utility.js","names":[],"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 attempts: 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.attempts, 'retry attempts');\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.attempts) {\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":";;;;;;;;AA0BA,SAAgB,EAAS,GAAuC;CAG9D,OAFA,EAAyB,EAAQ,UAAU,gBAAgB,IAEnD,MACN,GAAQ,GAAM,MAAW;EACvB,IAAI,IAAW,GACX,GACA,GAEE,UAAoB;GACxB,IAAI,EAAO,SAAS;GAEpB,IAAM,IAAe,EACnB,GACA;IACE,UAAU,EAAK;IACf,MAAM,GAAQ;KACZ,IAAI,MAAa,EAAQ,UAAU;MACjC,EAAK,MAAM,CAAM;MAEjB;KACF;KAEA,IAAM,IAAU,KACZ;KAEJ,YAAc;MACZ,IAAQ,OAAO,EAAQ,SAAU,aAAa,EAAQ,MAAM,CAAO,IAAI,EAAQ;KACjF,GAAG,EAAK,KAAK,GAET,GAAO,SAEX;UAAI,MAAU,KAAA,GACZ,IAAI;OACF,EAAe,GAAO,aAAa;MACrC,SAAS,GAAQ;OACf,EAAK,MAAM,CAAM;OACjB;MACF;MAGF,AAAI,MAAU,KAAA,KAAa,MAAU,IACnC,eAAe,CAAK,IAEpB,IAAc,EAAiB,MAAM,GAAO,CAAK;KANjD;IAQJ;IACA,MAAM,EAAK;GACb,GACA,CACF;GAEA,AAAK,EAAa,WAAQ,IAAU;EACtC;EAIA,OAFA,EAAM,SAEO;GAEX,AADA,IAAc,GACd,GAAS,YAAY;EACvB;CACF,CAAC;AACL;AAEA,SAAgB,EAAS,GAAmB,GAAuC;CACjF,OAAO,IAAI,SAAY,GAAS,MAAW;EACzC,IAAM,IAAa,IAAI,gBAAgB,GACjC,UAAoB;GAExB,AADA,EAAW,MAAM,GACjB,EAAO,EAAW,GAAS,QAAQ,4BAA4B,CAAC;EAClE;EAEA,IAAI,GAAS,QAAQ,SAAS;GAC5B,EAAM;GAEN;EACF;EAGA,AADA,GAAS,QAAQ,iBAAiB,SAAS,GAAO,EAAE,MAAM,GAAK,CAAC,GAChE,EACE,GACA;GACE,WAAW;IAGT,AAFA,GAAS,QAAQ,oBAAoB,SAAS,CAAK,GAE/C,mBAAmB,KAAW,CAAC,KAAI,EAAQ,EAAS,YAAiB,IACpE,EAAO,IAAI,EAAe,CAAC;GAClC;GACA,MAAM,GAAQ;IAEZ,AADA,GAAS,QAAQ,oBAAoB,SAAS,CAAK,GACnD,EAAO,CAAM;GACf;GACA,KAAK,GAAO;IAGV,AAFA,GAAS,QAAQ,oBAAoB,SAAS,CAAK,GACnD,EAAW,MAAM,GACjB,EAAQ,CAAK;GACf;EACF,GACA,EAAW,MACb;CACF,CAAC;AACH;AAEA,SAAgB,EAAQ,GAAmB,GAAuC;CAChF,OAAO,IAAI,SAAY,GAAS,MAAW;EACzC,IAAM,IAAa,IAAI,gBAAgB,GACjC,UAAoB;GAExB,AADA,EAAW,MAAM,GACjB,EAAO,EAAW,GAAS,QAAQ,4BAA4B,CAAC;EAClE;EAEA,IAAI,GAAS,QAAQ,SAAS;GAC5B,EAAM;GAEN;EACF;EAEA,IAAI,IAAU,IACV;EAGJ,AADA,GAAS,QAAQ,iBAAiB,SAAS,GAAO,EAAE,MAAM,GAAK,CAAC,GAChE,EACE,GACA;GACE,WAAW;IAGT,AAFA,GAAS,QAAQ,oBAAoB,SAAS,CAAK,GAE/C,IAAS,EAAQ,CAAW,IACvB,mBAAmB,KAAW,CAAC,KAAI,EAAQ,EAAS,YAAiB,IACzE,EAAO,IAAI,EAAe,CAAC;GAClC;GACA,MAAM,GAAQ;IAEZ,AADA,GAAS,QAAQ,oBAAoB,SAAS,CAAK,GACnD,EAAO,CAAM;GACf;GACA,KAAK,GAAO;IAEV,AADA,IAAU,IACV,IAAS;GACX;EACF,GACA,EAAW,MACb;CACF,CAAC;AACH;AAEA,SAAgB,EAAW,GAAmB,GAAuC;CAGnF,OAFA,EAAyB,EAAQ,UAAU,kBAAkB,GAEtD,IAAI,SAAc,GAAS,MAAW;EAC3C,IAAM,IAAa,IAAI,gBAAgB,GACjC,IAAc,CAAC,GACf,UAAoB;GAExB,AADA,EAAW,MAAM,GACjB,EAAO,EAAW,GAAS,QAAQ,4BAA4B,CAAC;EAClE;EAEA,IAAI,EAAQ,QAAQ,SAAS;GAC3B,EAAM;GAEN;EACF;EAGA,AADA,EAAQ,QAAQ,iBAAiB,SAAS,GAAO,EAAE,MAAM,GAAK,CAAC,GAC/D,EACE,GACA;GACE,WAAW;IAET,AADA,EAAQ,QAAQ,oBAAoB,SAAS,CAAK,GAClD,EAAQ,CAAM;GAChB;GACA,MAAM,GAAQ;IAEZ,AADA,EAAQ,QAAQ,oBAAoB,SAAS,CAAK,GAClD,EAAO,CAAM;GACf;GACA,KAAK,GAAO;IACV,IAAI,EAAO,WAAW,EAAQ,UAAU;KAGtC,AAFA,EAAQ,QAAQ,oBAAoB,SAAS,CAAK,GAClD,EAAW,MAAM,GACjB,EAAO,IAAI,EAAkB,EAAQ,UAAU,2BAA2B,CAAC;KAE3E;IACF;IAEA,EAAO,KAAK,CAAK;GACnB;EACF,GACA,EAAW,MACb;CACF,CAAC;AACH"}
|
package/dist/pipe.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pipe.cjs","names":[],"sources":["../src/pipe.ts"],"sourcesContent":["import type { Operator, PipedStream, Stream, ValidPipe } from './types';\n\n/** Standalone composition preserves contextual types for inline generic operators. */\nexport function pipe<Input>(source: Stream<Input>): Stream<Input>;\nexport function pipe<Input, A>(source: Stream<Input>, operator1: Operator<Input, A>): Stream<A>;\nexport function pipe<Input, A, B>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n): Stream<B>;\nexport function pipe<Input, A, B, C>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n): Stream<C>;\nexport function pipe<Input, A, B, C, D>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n): Stream<D>;\nexport function pipe<Input, A, B, C, D, E>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n): Stream<E>;\nexport function pipe<Input, A, B, C, D, E, F>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n): Stream<F>;\nexport function pipe<Input, A, B, C, D, E, F, G>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n): Stream<G>;\nexport function pipe<Input, A, B, C, D, E, F, G, H>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n operator8: Operator<G, H>,\n): Stream<H>;\nexport function pipe<Input, A, B, C, D, E, F, G, H, I>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n operator8: Operator<G, H>,\n operator9: Operator<H, I>,\n): Stream<I>;\nexport function pipe<Input, A, B, C, D, E, F, G, H, I, J>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n operator8: Operator<G, H>,\n operator9: Operator<H, I>,\n operator10: Operator<I, J>,\n): Stream<J>;\nexport function pipe<Input, const Operators extends readonly unknown[]>(\n source: Stream<Input>,\n ...operators: Operators & ValidPipe<Input, Operators>\n): PipedStream<Input, Operators>;\nexport function pipe<Input, const Operators extends readonly unknown[]>(\n source: Stream<Input>,\n ...operators: Operators & ValidPipe<Input, Operators>\n): PipedStream<Input, Operators> {\n return operators.reduce(\n (current: Stream<unknown>, operator: Operator) => operator(current),\n source as Stream<unknown>,\n ) as PipedStream<Input, Operators>;\n}\n"],"mappings":"AA0FA,SAAgB,EACd,EACA,GAAG,EAC4B,CAC/B,OAAO,EAAU,QACd,EAA0B,IAAuB,EAAS,CAAO,EAClE,CACF,CACF"}
|
|
1
|
+
{"version":3,"file":"pipe.cjs","names":[],"sources":["../src/pipe.ts"],"sourcesContent":["import type { Operator, PipedStream, Stream, ValidPipe } from './types.js';\n\n/** Standalone composition preserves contextual types for inline generic operators. */\nexport function pipe<Input>(source: Stream<Input>): Stream<Input>;\nexport function pipe<Input, A>(source: Stream<Input>, operator1: Operator<Input, A>): Stream<A>;\nexport function pipe<Input, A, B>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n): Stream<B>;\nexport function pipe<Input, A, B, C>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n): Stream<C>;\nexport function pipe<Input, A, B, C, D>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n): Stream<D>;\nexport function pipe<Input, A, B, C, D, E>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n): Stream<E>;\nexport function pipe<Input, A, B, C, D, E, F>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n): Stream<F>;\nexport function pipe<Input, A, B, C, D, E, F, G>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n): Stream<G>;\nexport function pipe<Input, A, B, C, D, E, F, G, H>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n operator8: Operator<G, H>,\n): Stream<H>;\nexport function pipe<Input, A, B, C, D, E, F, G, H, I>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n operator8: Operator<G, H>,\n operator9: Operator<H, I>,\n): Stream<I>;\nexport function pipe<Input, A, B, C, D, E, F, G, H, I, J>(\n source: Stream<Input>,\n operator1: Operator<Input, A>,\n operator2: Operator<A, B>,\n operator3: Operator<B, C>,\n operator4: Operator<C, D>,\n operator5: Operator<D, E>,\n operator6: Operator<E, F>,\n operator7: Operator<F, G>,\n operator8: Operator<G, H>,\n operator9: Operator<H, I>,\n operator10: Operator<I, J>,\n): Stream<J>;\nexport function pipe<Input, const Operators extends readonly unknown[]>(\n source: Stream<Input>,\n ...operators: Operators & ValidPipe<Input, Operators>\n): PipedStream<Input, Operators>;\nexport function pipe<Input, const Operators extends readonly unknown[]>(\n source: Stream<Input>,\n ...operators: Operators & ValidPipe<Input, Operators>\n): PipedStream<Input, Operators> {\n return operators.reduce(\n (current: Stream<unknown>, operator: Operator) => operator(current),\n source as Stream<unknown>,\n ) as PipedStream<Input, Operators>;\n}\n"],"mappings":"AA0FA,SAAgB,EACd,EACA,GAAG,EAC4B,CAC/B,OAAO,EAAU,QACd,EAA0B,IAAuB,EAAS,CAAO,EAClE,CACF,CACF"}
|