reactor-core-ts 2.1.6 → 3.2.1

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.
Files changed (269) hide show
  1. package/README.md +927 -658
  2. package/dist/_virtual/_@oxc-project_runtime@0.139.0/helpers/esm/defineProperty.js +12 -0
  3. package/dist/_virtual/_@oxc-project_runtime@0.139.0/helpers/esm/toPrimitive.js +14 -0
  4. package/dist/_virtual/_@oxc-project_runtime@0.139.0/helpers/esm/toPropertyKey.js +9 -0
  5. package/dist/_virtual/_@oxc-project_runtime@0.139.0/helpers/esm/typeof.js +11 -0
  6. package/dist/context/context-view.d.ts +31 -0
  7. package/dist/context/context-view.d.ts.map +1 -0
  8. package/dist/context/context-view.js +58 -0
  9. package/dist/context/context-view.js.map +1 -0
  10. package/dist/context/context.d.ts +46 -0
  11. package/dist/context/context.d.ts.map +1 -0
  12. package/dist/context/context.js +125 -0
  13. package/dist/context/context.js.map +1 -0
  14. package/dist/context/types.d.ts +7 -0
  15. package/dist/context/types.d.ts.map +1 -0
  16. package/dist/core/boolean-disposable.d.ts +19 -0
  17. package/dist/core/boolean-disposable.d.ts.map +1 -0
  18. package/dist/core/boolean-disposable.js +37 -0
  19. package/dist/core/boolean-disposable.js.map +1 -0
  20. package/dist/core/composite-disposable.d.ts +21 -0
  21. package/dist/core/composite-disposable.d.ts.map +1 -0
  22. package/dist/core/composite-disposable.js +64 -0
  23. package/dist/core/composite-disposable.js.map +1 -0
  24. package/dist/core/demand.d.ts +9 -0
  25. package/dist/core/demand.d.ts.map +1 -0
  26. package/dist/core/demand.js +21 -0
  27. package/dist/core/demand.js.map +1 -0
  28. package/dist/core/disposables.d.ts +12 -0
  29. package/dist/core/disposables.d.ts.map +1 -0
  30. package/dist/core/disposables.js +37 -0
  31. package/dist/core/disposables.js.map +1 -0
  32. package/dist/core/teardown.d.ts +4 -0
  33. package/dist/core/teardown.d.ts.map +1 -0
  34. package/dist/core/types.d.ts +14 -0
  35. package/dist/core/types.d.ts.map +1 -0
  36. package/dist/errors/classes.d.ts +37 -0
  37. package/dist/errors/classes.d.ts.map +1 -0
  38. package/dist/errors/classes.js +53 -0
  39. package/dist/errors/classes.js.map +1 -0
  40. package/dist/errors/exceptions.d.ts +15 -0
  41. package/dist/errors/exceptions.d.ts.map +1 -0
  42. package/dist/errors/helpers.d.ts +9 -0
  43. package/dist/errors/helpers.d.ts.map +1 -0
  44. package/dist/errors/helpers.js +18 -0
  45. package/dist/errors/helpers.js.map +1 -0
  46. package/dist/index.d.ts +17 -2556
  47. package/dist/index.d.ts.map +1 -0
  48. package/dist/index.js +8 -2
  49. package/dist/internal/abort.d.ts +5 -0
  50. package/dist/internal/abort.d.ts.map +1 -0
  51. package/dist/internal/abort.js +36 -0
  52. package/dist/internal/abort.js.map +1 -0
  53. package/dist/internal/async-queue.d.ts +48 -0
  54. package/dist/internal/async-queue.d.ts.map +1 -0
  55. package/dist/internal/async-queue.js +187 -0
  56. package/dist/internal/async-queue.js.map +1 -0
  57. package/dist/internal/iterable-terminal.d.ts +12 -0
  58. package/dist/internal/iterable-terminal.d.ts.map +1 -0
  59. package/dist/internal/iterable-terminal.js +49 -0
  60. package/dist/internal/iterable-terminal.js.map +1 -0
  61. package/dist/internal/iterable-transform.d.ts +24 -0
  62. package/dist/internal/iterable-transform.d.ts.map +1 -0
  63. package/dist/internal/iterable-transform.js +159 -0
  64. package/dist/internal/iterable-transform.js.map +1 -0
  65. package/dist/internal/iterable.d.ts +23 -0
  66. package/dist/internal/iterable.d.ts.map +1 -0
  67. package/dist/internal/iterable.js +81 -0
  68. package/dist/internal/iterable.js.map +1 -0
  69. package/dist/internal/microtask.d.ts +7 -0
  70. package/dist/internal/microtask.d.ts.map +1 -0
  71. package/dist/internal/microtask.js +19 -0
  72. package/dist/internal/microtask.js.map +1 -0
  73. package/dist/publisher/browser-sources.d.ts +15 -0
  74. package/dist/publisher/browser-sources.d.ts.map +1 -0
  75. package/dist/publisher/browser-sources.js +92 -0
  76. package/dist/publisher/browser-sources.js.map +1 -0
  77. package/dist/publisher/flux-entrypoint.d.ts +7 -0
  78. package/dist/publisher/flux-entrypoint.d.ts.map +1 -0
  79. package/dist/publisher/flux-entrypoint.js +11 -0
  80. package/dist/publisher/flux-entrypoint.js.map +1 -0
  81. package/dist/publisher/flux.d.ts +121 -0
  82. package/dist/publisher/flux.d.ts.map +1 -0
  83. package/dist/publisher/flux.js +697 -0
  84. package/dist/publisher/flux.js.map +1 -0
  85. package/dist/publisher/helpers.d.ts +19 -0
  86. package/dist/publisher/helpers.d.ts.map +1 -0
  87. package/dist/publisher/helpers.js +84 -0
  88. package/dist/publisher/helpers.js.map +1 -0
  89. package/dist/publisher/mono-entrypoint.d.ts +7 -0
  90. package/dist/publisher/mono-entrypoint.d.ts.map +1 -0
  91. package/dist/publisher/mono-entrypoint.js +11 -0
  92. package/dist/publisher/mono-entrypoint.js.map +1 -0
  93. package/dist/publisher/mono.d.ts +72 -0
  94. package/dist/publisher/mono.d.ts.map +1 -0
  95. package/dist/publisher/mono.js +373 -0
  96. package/dist/publisher/mono.js.map +1 -0
  97. package/dist/publisher/operators/aggregate.d.ts +35 -0
  98. package/dist/publisher/operators/aggregate.d.ts.map +1 -0
  99. package/dist/publisher/operators/aggregate.js +217 -0
  100. package/dist/publisher/operators/aggregate.js.map +1 -0
  101. package/dist/publisher/operators/compat/flux.d.ts +56 -0
  102. package/dist/publisher/operators/compat/flux.d.ts.map +1 -0
  103. package/dist/publisher/operators/compat/flux.js +156 -0
  104. package/dist/publisher/operators/compat/flux.js.map +1 -0
  105. package/dist/publisher/operators/compat/mono.d.ts +82 -0
  106. package/dist/publisher/operators/compat/mono.d.ts.map +1 -0
  107. package/dist/publisher/operators/compat/mono.js +125 -0
  108. package/dist/publisher/operators/compat/mono.js.map +1 -0
  109. package/dist/publisher/operators/coordination.d.ts +82 -0
  110. package/dist/publisher/operators/coordination.d.ts.map +1 -0
  111. package/dist/publisher/operators/coordination.js +345 -0
  112. package/dist/publisher/operators/coordination.js.map +1 -0
  113. package/dist/publisher/operators/error.d.ts +17 -0
  114. package/dist/publisher/operators/error.d.ts.map +1 -0
  115. package/dist/publisher/operators/error.js +48 -0
  116. package/dist/publisher/operators/error.js.map +1 -0
  117. package/dist/publisher/operators/flatten.d.ts +19 -0
  118. package/dist/publisher/operators/flatten.d.ts.map +1 -0
  119. package/dist/publisher/operators/flatten.js +127 -0
  120. package/dist/publisher/operators/flatten.js.map +1 -0
  121. package/dist/publisher/operators/lifecycle.d.ts +103 -0
  122. package/dist/publisher/operators/lifecycle.d.ts.map +1 -0
  123. package/dist/publisher/operators/lifecycle.js +237 -0
  124. package/dist/publisher/operators/lifecycle.js.map +1 -0
  125. package/dist/publisher/operators/mono-parity.d.ts +109 -0
  126. package/dist/publisher/operators/mono-parity.d.ts.map +1 -0
  127. package/dist/publisher/operators/mono-parity.js +144 -0
  128. package/dist/publisher/operators/mono-parity.js.map +1 -0
  129. package/dist/publisher/operators/mono.d.ts +30 -0
  130. package/dist/publisher/operators/mono.d.ts.map +1 -0
  131. package/dist/publisher/operators/mono.js +37 -0
  132. package/dist/publisher/operators/mono.js.map +1 -0
  133. package/dist/publisher/operators/register.d.ts +20 -0
  134. package/dist/publisher/operators/register.d.ts.map +1 -0
  135. package/dist/publisher/operators/register.js +23 -0
  136. package/dist/publisher/operators/register.js.map +1 -0
  137. package/dist/publisher/operators/selection.d.ts +25 -0
  138. package/dist/publisher/operators/selection.d.ts.map +1 -0
  139. package/dist/publisher/operators/selection.js +108 -0
  140. package/dist/publisher/operators/selection.js.map +1 -0
  141. package/dist/publisher/operators/side-effect.d.ts +15 -0
  142. package/dist/publisher/operators/side-effect.d.ts.map +1 -0
  143. package/dist/publisher/operators/side-effect.js +56 -0
  144. package/dist/publisher/operators/side-effect.js.map +1 -0
  145. package/dist/publisher/operators/terminal.d.ts +16 -0
  146. package/dist/publisher/operators/terminal.d.ts.map +1 -0
  147. package/dist/publisher/operators/terminal.js +47 -0
  148. package/dist/publisher/operators/terminal.js.map +1 -0
  149. package/dist/publisher/operators/time.d.ts +20 -0
  150. package/dist/publisher/operators/time.d.ts.map +1 -0
  151. package/dist/publisher/operators/time.js +92 -0
  152. package/dist/publisher/operators/time.js.map +1 -0
  153. package/dist/publisher/operators/transform.d.ts +31 -0
  154. package/dist/publisher/operators/transform.d.ts.map +1 -0
  155. package/dist/publisher/operators/transform.js +74 -0
  156. package/dist/publisher/operators/transform.js.map +1 -0
  157. package/dist/publisher/operators/windowing.d.ts +28 -0
  158. package/dist/publisher/operators/windowing.d.ts.map +1 -0
  159. package/dist/publisher/operators/windowing.js +148 -0
  160. package/dist/publisher/operators/windowing.js.map +1 -0
  161. package/dist/publisher/publisher.d.ts +11 -0
  162. package/dist/publisher/publisher.d.ts.map +1 -0
  163. package/dist/publisher/types.d.ts +51 -0
  164. package/dist/publisher/types.d.ts.map +1 -0
  165. package/dist/schedulers/animation-frame-scheduler.d.ts +11 -0
  166. package/dist/schedulers/animation-frame-scheduler.d.ts.map +1 -0
  167. package/dist/schedulers/animation-frame-scheduler.js +30 -0
  168. package/dist/schedulers/animation-frame-scheduler.js.map +1 -0
  169. package/dist/schedulers/base-scheduler.d.ts +28 -0
  170. package/dist/schedulers/base-scheduler.d.ts.map +1 -0
  171. package/dist/schedulers/base-scheduler.js +77 -0
  172. package/dist/schedulers/base-scheduler.js.map +1 -0
  173. package/dist/schedulers/basic-worker.d.ts +22 -0
  174. package/dist/schedulers/basic-worker.d.ts.map +1 -0
  175. package/dist/schedulers/basic-worker.js +71 -0
  176. package/dist/schedulers/basic-worker.js.map +1 -0
  177. package/dist/schedulers/delay-scheduler.d.ts +12 -0
  178. package/dist/schedulers/delay-scheduler.d.ts.map +1 -0
  179. package/dist/schedulers/delay-scheduler.js +17 -0
  180. package/dist/schedulers/delay-scheduler.js.map +1 -0
  181. package/dist/schedulers/disposed.d.ts +4 -0
  182. package/dist/schedulers/disposed.d.ts.map +1 -0
  183. package/dist/schedulers/disposed.js +14 -0
  184. package/dist/schedulers/disposed.js.map +1 -0
  185. package/dist/schedulers/duration.d.ts +8 -0
  186. package/dist/schedulers/duration.d.ts.map +1 -0
  187. package/dist/schedulers/duration.js +11 -0
  188. package/dist/schedulers/duration.js.map +1 -0
  189. package/dist/schedulers/executor-scheduler.d.ts +13 -0
  190. package/dist/schedulers/executor-scheduler.d.ts.map +1 -0
  191. package/dist/schedulers/executor-scheduler.js +43 -0
  192. package/dist/schedulers/executor-scheduler.js.map +1 -0
  193. package/dist/schedulers/immediate-scheduler.d.ts +15 -0
  194. package/dist/schedulers/immediate-scheduler.d.ts.map +1 -0
  195. package/dist/schedulers/immediate-scheduler.js +24 -0
  196. package/dist/schedulers/immediate-scheduler.js.map +1 -0
  197. package/dist/schedulers/index.d.ts +7 -0
  198. package/dist/schedulers/index.d.ts.map +1 -0
  199. package/dist/schedulers/index.js +2 -0
  200. package/dist/schedulers/interval-scheduler.d.ts +12 -0
  201. package/dist/schedulers/interval-scheduler.d.ts.map +1 -0
  202. package/dist/schedulers/interval-scheduler.js +17 -0
  203. package/dist/schedulers/interval-scheduler.js.map +1 -0
  204. package/dist/schedulers/macro-scheduler.d.ts +19 -0
  205. package/dist/schedulers/macro-scheduler.d.ts.map +1 -0
  206. package/dist/schedulers/macro-scheduler.js +30 -0
  207. package/dist/schedulers/macro-scheduler.js.map +1 -0
  208. package/dist/schedulers/microtask-scheduler.d.ts +11 -0
  209. package/dist/schedulers/microtask-scheduler.d.ts.map +1 -0
  210. package/dist/schedulers/microtask-scheduler.js +34 -0
  211. package/dist/schedulers/microtask-scheduler.js.map +1 -0
  212. package/dist/schedulers/schedulers.d.ts +39 -0
  213. package/dist/schedulers/schedulers.d.ts.map +1 -0
  214. package/dist/schedulers/schedulers.js +83 -0
  215. package/dist/schedulers/schedulers.js.map +1 -0
  216. package/dist/schedulers/timeout-scheduler.d.ts +11 -0
  217. package/dist/schedulers/timeout-scheduler.d.ts.map +1 -0
  218. package/dist/schedulers/types.d.ts +35 -0
  219. package/dist/schedulers/types.d.ts.map +1 -0
  220. package/dist/signal/signal-type.d.ts +26 -0
  221. package/dist/signal/signal-type.d.ts.map +1 -0
  222. package/dist/signal/signal-type.js +31 -0
  223. package/dist/signal/signal-type.js.map +1 -0
  224. package/dist/signal/signal.d.ts +33 -0
  225. package/dist/signal/signal.d.ts.map +1 -0
  226. package/dist/signal/signal.js +70 -0
  227. package/dist/signal/signal.js.map +1 -0
  228. package/dist/sinks/index.d.ts +7 -0
  229. package/dist/sinks/index.d.ts.map +1 -0
  230. package/dist/sinks/index.js +2 -0
  231. package/dist/sinks/many.d.ts +66 -0
  232. package/dist/sinks/many.d.ts.map +1 -0
  233. package/dist/sinks/many.js +193 -0
  234. package/dist/sinks/many.js.map +1 -0
  235. package/dist/sinks/one.d.ts +41 -0
  236. package/dist/sinks/one.d.ts.map +1 -0
  237. package/dist/sinks/one.js +144 -0
  238. package/dist/sinks/one.js.map +1 -0
  239. package/dist/sinks/specs.d.ts +25 -0
  240. package/dist/sinks/specs.d.ts.map +1 -0
  241. package/dist/sinks/specs.js +126 -0
  242. package/dist/sinks/specs.js.map +1 -0
  243. package/dist/sinks/subscribers.d.ts +16 -0
  244. package/dist/sinks/subscribers.d.ts.map +1 -0
  245. package/dist/sinks/subscribers.js +32 -0
  246. package/dist/sinks/subscribers.js.map +1 -0
  247. package/dist/sinks/types.d.ts +137 -0
  248. package/dist/sinks/types.d.ts.map +1 -0
  249. package/dist/sinks/types.js +58 -0
  250. package/dist/sinks/types.js.map +1 -0
  251. package/dist/subscription/core-subscriber.d.ts +12 -0
  252. package/dist/subscription/core-subscriber.d.ts.map +1 -0
  253. package/dist/subscription/iterable-subscription.d.ts +64 -0
  254. package/dist/subscription/iterable-subscription.d.ts.map +1 -0
  255. package/dist/subscription/iterable-subscription.js +281 -0
  256. package/dist/subscription/iterable-subscription.js.map +1 -0
  257. package/dist/subscription/reactive-streams.d.ts +8 -0
  258. package/dist/subscription/reactive-streams.d.ts.map +1 -0
  259. package/dist/subscription/reactive-streams.js +0 -0
  260. package/dist/subscription/subscriber.d.ts +17 -0
  261. package/dist/subscription/subscriber.d.ts.map +1 -0
  262. package/dist/subscription/subscription.d.ts +12 -0
  263. package/dist/subscription/subscription.d.ts.map +1 -0
  264. package/package.json +99 -33
  265. package/LICENSE.md +0 -56
  266. package/dist/index.d.mts +0 -2557
  267. package/dist/index.js.map +0 -1
  268. package/dist/index.mjs +0 -2
  269. package/dist/index.mjs.map +0 -1
@@ -0,0 +1 @@
1
+ {"version":3,"file":"flux.js","names":[],"sources":["../../src/publisher/flux.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Flux, Mono and operator implementation modules.\n */\nimport {BooleanDisposable} from \"@/core/boolean-disposable.js\";\nimport type {Disposable} from \"@/core/types.js\";\nimport {Context} from \"@/context/context.js\";\nimport type {ContextView} from \"@/context/context-view.js\";\nimport {CompositeError} from \"@/errors/classes.js\";\nimport {asError, throwIfNullish} from \"@/errors/helpers.js\";\nimport {firstValueFrom, raceWithAbort} from \"@/internal/abort.js\";\nimport {AsyncQueue} from \"@/internal/async-queue.js\";\nimport {\n closeAsyncIterator,\n EMPTY_ITERABLE,\n type AnyIterable,\n isAsyncIterable,\n isIterable,\n neverIterable,\n toAsyncIterator\n} from \"@/internal/iterable.js\";\nimport {collectIterable, lastIterableValue} from \"@/internal/iterable-terminal.js\";\nimport {mapIterable} from \"@/internal/iterable-transform.js\";\nimport {eventSource, type WebSocketFluxOptions, webSocketSource} from \"@/publisher/browser-sources.js\";\nimport type {Publisher} from \"@/publisher/publisher.js\";\nimport {addCancelCallback, type CancelCallbacks, isSubscriber, runCancelCallbacks, scheduleDelay} from \"@/publisher/helpers.js\";\nimport {IterableSubscription} from \"@/subscription/iterable-subscription.js\";\nimport type {FluxSinkCallback, PublisherInput, SourceFactory} from \"@/publisher/types.js\";\nimport {Schedulers} from \"@/schedulers/schedulers.js\";\nimport type {DurationInput, Scheduler} from \"@/schedulers/types.js\";\nimport type {CoreSubscriber} from \"@/subscription/core-subscriber.js\";\nimport type {Subscriber} from \"@/subscription/subscriber.js\";\nimport type {Subscription} from \"@/subscription/subscription.js\";\n\n/** Multi-value Reactive Streams publisher with Reactor-style operators. */\nexport class Flux<T> implements Publisher<T>, AsyncIterable<T> {\n /** Lazy source factory invoked for each subscription or async iteration. */\n private readonly sourceFactory: SourceFactory<T>;\n\n /** Creates a Flux from a lazy source factory. */\n public constructor(sourceFactory: SourceFactory<T>) {\n this.sourceFactory = sourceFactory;\n }\n\n /** Creates a Flux that emits the provided values and then completes. */\n public static just<T>(...values: readonly T[]): Flux<T> {\n if (values.length === 0) {\n return Flux.empty<T>();\n }\n for (const value of values) {\n throwIfNullish(value, \"value\");\n }\n return Flux.fromIterable(values);\n }\n\n /** Creates a Flux from an array-like readonly value list. */\n public static fromArray<T>(values: readonly T[]): Flux<T> {\n throwIfNullish(values, \"values\");\n if (values.length === 0) {\n return Flux.empty<T>();\n }\n return Flux.fromIterable(values);\n }\n\n /** Creates a Flux from a stream-like iterable or a lazy stream supplier. */\n public static fromStream<T>(stream: Iterable<T> | (() => Iterable<T>)): Flux<T> {\n throwIfNullish(stream, \"stream\");\n return typeof stream === \"function\" ? Flux.defer(() => Flux.fromIterable((stream as () => Iterable<T>)())) : Flux.fromIterable(stream);\n }\n\n /** Creates a Flux from a JavaScript iterable. */\n public static fromIterable<T>(values: Iterable<T>): Flux<T> {\n throwIfNullish(values, \"values\");\n if (Array.isArray(values) && values.length === 0) {\n return Flux.empty<T>();\n }\n return new Flux(() => values);\n }\n\n /** Creates a Flux from browser `Window` events and removes the listener on cancellation. */\n public static fromEvent<K extends keyof WindowEventMap>(\n target: Window,\n type: K,\n options?: boolean | AddEventListenerOptions\n ): Flux<WindowEventMap[K]>;\n /** Creates a Flux from browser `Document` events and removes the listener on cancellation. */\n public static fromEvent<K extends keyof DocumentEventMap>(\n target: Document,\n type: K,\n options?: boolean | AddEventListenerOptions\n ): Flux<DocumentEventMap[K]>;\n /** Creates a Flux from browser `HTMLElement` events and removes the listener on cancellation. */\n public static fromEvent<K extends keyof HTMLElementEventMap>(\n target: HTMLElement,\n type: K,\n options?: boolean | AddEventListenerOptions\n ): Flux<HTMLElementEventMap[K]>;\n /** Creates a Flux from any browser `EventTarget` and removes the listener on cancellation. */\n public static fromEvent<TEvent extends Event = Event>(\n target: EventTarget,\n type: string,\n options?: boolean | AddEventListenerOptions\n ): Flux<TEvent>;\n /** Creates a Flux from browser events and removes the listener on cancellation. */\n public static fromEvent<TEvent extends Event = Event>(\n target: EventTarget,\n type: string,\n options?: boolean | AddEventListenerOptions\n ): Flux<TEvent> {\n return new Flux(eventSource<TEvent>(target, type, options));\n }\n\n /** Creates a Flux from browser WebSocket message events. */\n public static fromWebSocket<T = unknown>(\n url: string | URL,\n options?: string | string[] | WebSocketFluxOptions\n ): Flux<MessageEvent<T>>;\n /** Creates a Flux from browser WebSocket message events. */\n public static fromWebSocket<T = unknown>(\n socket: WebSocket,\n options?: WebSocketFluxOptions\n ): Flux<MessageEvent<T>>;\n /** Creates a Flux from browser WebSocket message events and cleans listeners on cancellation. */\n public static fromWebSocket<T = unknown>(\n input: WebSocket | string | URL,\n options?: string | string[] | WebSocketFluxOptions\n ): Flux<MessageEvent<T>> {\n return new Flux(webSocketSource<T>(input, options));\n }\n\n /** Adapts a publisher, iterable, async iterable or promise-like value to Flux. */\n public static from<T>(input: PublisherInput<T>): Flux<T> {\n throwIfNullish(input, \"input\");\n if (input instanceof Flux) {\n return input;\n }\n if (isAsyncIterable<T>(input)) {\n return new Flux(() => input);\n }\n if (isIterable<T>(input)) {\n return Flux.fromIterable(input);\n }\n if (typeof (input as Publisher<T>).subscribe === \"function\") {\n return fromPublisher(input as Publisher<T>);\n }\n if (typeof (input as PromiseLike<T>).then === \"function\") {\n return new Flux(async function* (signal) {\n const value = await raceWithAbort(Promise.resolve(input as PromiseLike<T>), signal);\n if (value !== undefined && value !== null) {\n yield value;\n }\n });\n }\n throw new TypeError(\"Unsupported publisher input\");\n }\n\n /** Creates a Flux that completes without emitting values. */\n public static empty<T = never>(): Flux<T> {\n return EMPTY_FLUX as Flux<T>;\n }\n\n /** Creates a Flux that never emits or completes until cancelled. */\n public static never<T = never>(): Flux<T> {\n return NEVER_FLUX as Flux<T>;\n }\n\n /** Creates a Flux that terminates with the provided error. */\n public static error<T = never>(error: unknown | (() => unknown)): Flux<T> {\n return new Flux(async function* () {\n throw typeof error === \"function\" ? (error as () => unknown)() : error;\n });\n }\n\n /** Defers source creation until subscription time. */\n public static defer<T>(supplier: () => PublisherInput<T>): Flux<T> {\n return new Flux((signal, context) => Flux.from(supplier()).iterate(signal, context));\n }\n\n /** Defers source creation and exposes the subscriber context. */\n public static deferContextual<T>(supplier: (context: ContextView) => PublisherInput<T>): Flux<T> {\n return new Flux((signal, context) => Flux.from(supplier(context.readOnly())).iterate(signal, context));\n }\n\n /** Creates a Flux by bridging callback-style producers through a sink. */\n public static create<T>(callback: FluxSinkCallback<T>): Flux<T> {\n throwIfNullish(callback, \"callback\");\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n let cancelled = false;\n let cancelCallbacks: CancelCallbacks | undefined;\n const sink = {\n /** Emits one value into the created Flux. */\n next(value: T) {\n throwIfNullish(value, \"value\");\n queue.push(value);\n },\n /** Terminates the created Flux with an error. */\n error(error: unknown) {\n queue.error(error);\n },\n /** Completes the created Flux. */\n complete() {\n queue.complete();\n },\n /** Registers a callback invoked when the subscription is cancelled. */\n onCancel(cancelCallback: () => void) {\n cancelCallbacks = addCancelCallback(cancelCallbacks, cancelCallback);\n return sink;\n },\n /** Returns true after cancellation has been observed. */\n isCancelled() {\n return cancelled || signal.aborted;\n }\n };\n signal.addEventListener(\n \"abort\",\n () => {\n cancelled = true;\n runCancelCallbacks(cancelCallbacks);\n cancelCallbacks = undefined;\n queue.complete();\n },\n {once: true}\n );\n try {\n callback(sink);\n } catch (error) {\n queue.error(error);\n }\n return queue;\n });\n }\n\n /** Creates a Flux by bridging a single-threaded push-style producer through a sink. */\n public static push<T>(callback: FluxSinkCallback<T>): Flux<T> {\n return Flux.create(callback);\n }\n\n /** Creates a Flux by repeatedly invoking a synchronous generator callback. */\n public static generate<T>(generator: (sink: {\n next(value: T): void;\n complete(): void;\n error(error: unknown): void\n }) => void): Flux<T> {\n throwIfNullish(generator, \"generator\");\n return new Flux(async function* (signal) {\n let done = false;\n let hasValue = false;\n let value: T | undefined;\n const sink = {\n /** Emits one generated value for this turn. */\n next(nextValue: T) {\n if (hasValue) {\n throw new Error(\"Synchronous generator can emit at most one value per turn\");\n }\n hasValue = true;\n value = nextValue;\n },\n /** Completes the generated sequence. */\n complete() {\n done = true;\n },\n /** Fails the generated sequence. */\n error(error: unknown) {\n throw error;\n }\n };\n while (!done && !signal.aborted) {\n hasValue = false;\n value = undefined;\n generator(sink);\n if (hasValue) {\n yield value as T;\n } else if (!done) {\n throw new Error(\"Synchronous generator must emit, complete or fail\");\n }\n }\n });\n }\n\n /** Creates a finite integer range. */\n public static range(start: number, count: number): Flux<number> {\n if (!Number.isInteger(start) || !Number.isInteger(count) || count < 0) {\n throw new RangeError(\"Flux.range expects an integer start and a non-negative integer count\");\n }\n if (count === 0) {\n return Flux.empty<number>();\n }\n return new Flux(function* () {\n for (let i = 0; i < count; i += 1) {\n yield start + i;\n }\n });\n }\n\n /** Creates an interval Flux that emits incrementing numbers. */\n public static interval(period: DurationInput, scheduler: Scheduler = Schedulers.timeout()): Flux<number> {\n return new Flux(async function* (signal) {\n let index = 0;\n while (!signal.aborted) {\n await scheduleDelay(scheduler, period, signal);\n if (!signal.aborted) {\n yield index;\n index += 1;\n }\n }\n });\n }\n\n /** Merges several publishers concurrently. */\n public static merge<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n if (sources.length === 0) {\n return Flux.empty<T>();\n }\n if (sources.length === 1) {\n return Flux.from(sources[0]!);\n }\n return mergeSources(toFluxArray(sources));\n }\n\n /** Merges several publishers concurrently and delays failures until every source terminates. */\n public static mergeDelayError<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n if (sources.length === 0) {\n return Flux.empty<T>();\n }\n if (sources.length === 1) {\n return Flux.from(sources[0]!);\n }\n return mergeSourcesDelayError(toFluxArray(sources));\n }\n\n /** Merges sources sequentially while subscribing to one source at a time. */\n public static mergeSequential<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n return Flux.concat(...sources);\n }\n\n /** Merges sources sequentially and delays failures until every source has been consumed. */\n public static mergeSequentialDelayError<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n return concatDelayErrorSources(sources);\n }\n\n /** Merges finite sources and emits their values sorted by a comparator. */\n public static mergeComparing<T>(\n comparatorOrSource?: ((left: T, right: T) => number) | PublisherInput<T>,\n ...sources: readonly PublisherInput<T>[]\n ): Flux<T> {\n const {comparator, inputs} = orderedMergeInputs(comparatorOrSource, sources);\n return sortMergedSources(inputs, comparator);\n }\n\n /** Merges finite sources, delays failures and emits their values sorted by a comparator. */\n public static mergeComparingDelayError<T>(\n comparatorOrSource?: ((left: T, right: T) => number) | PublisherInput<T>,\n ...sources: readonly PublisherInput<T>[]\n ): Flux<T> {\n const {comparator, inputs} = orderedMergeInputs(comparatorOrSource, sources);\n return sortMergedSourcesDelayError(inputs, comparator);\n }\n\n /** Merges finite sources and emits their values in comparator order. */\n public static mergeOrdered<T>(\n comparatorOrSource?: ((left: T, right: T) => number) | PublisherInput<T>,\n ...sources: readonly PublisherInput<T>[]\n ): Flux<T> {\n return Flux.mergeComparing(comparatorOrSource, ...sources);\n }\n\n /** Merges finite sources with priority ordering. */\n public static mergePriority<T>(\n comparatorOrSource?: ((left: T, right: T) => number) | PublisherInput<T>,\n ...sources: readonly PublisherInput<T>[]\n ): Flux<T> {\n return Flux.mergeComparing(comparatorOrSource, ...sources);\n }\n\n /** Merges finite sources with priority ordering and delayed failures. */\n public static mergePriorityDelayError<T>(\n comparatorOrSource?: ((left: T, right: T) => number) | PublisherInput<T>,\n ...sources: readonly PublisherInput<T>[]\n ): Flux<T> {\n return Flux.mergeComparingDelayError(comparatorOrSource, ...sources);\n }\n\n /** Concatenates several publishers sequentially. */\n public static concat<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n if (sources.length === 0) {\n return Flux.empty<T>();\n }\n if (sources.length === 1) {\n return Flux.from(sources[0]!);\n }\n return new Flux(async function* (signal, context) {\n for (const source of sources) {\n for await (const value of Flux.from(source).iterate(signal, context)) {\n if (signal.aborted) {\n return;\n }\n yield value;\n }\n }\n });\n }\n\n /** Concatenates several publishers sequentially and delays failures until every source has been consumed. */\n public static concatDelayError<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n if (sources.length === 0) {\n return Flux.empty<T>();\n }\n if (sources.length === 1) {\n return Flux.from(sources[0]!);\n }\n return concatDelayErrorSources(sources);\n }\n\n /** Relays the first source that emits any signal. */\n public static first<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n return Flux.firstWithSignal(...sources);\n }\n\n /** Relays the first source that emits any signal. */\n public static firstWithSignal<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n if (sources.length === 0) {\n return Flux.empty<T>();\n }\n if (sources.length === 1) {\n return Flux.from(sources[0]!);\n }\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n let settled = false;\n for (const source of sources) {\n void (async () => {\n try {\n const iterator = toAsyncIterator(Flux.from(source).iterate(signal, context));\n try {\n const first = await raceWithAbort(iterator.next(), signal);\n if (settled) {\n await iterator.return?.();\n return;\n }\n settled = true;\n if (first.done) {\n queue.complete();\n return;\n }\n queue.push(first.value);\n for (; ;) {\n const next = await raceWithAbort(iterator.next(), signal);\n if (next.done) {\n queue.complete();\n return;\n }\n queue.push(next.value);\n }\n } finally {\n await iterator.return?.();\n }\n } catch (error) {\n if (!settled) {\n settled = true;\n queue.error(error);\n }\n }\n })();\n }\n return queue;\n });\n }\n\n /** Relays the first source that produces a value, ignoring empty completions. */\n public static firstWithValue<T>(...sources: readonly PublisherInput<T>[]): Flux<T> {\n if (sources.length === 0) {\n return Flux.empty<T>();\n }\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n let remaining = sources.length;\n let settled = false;\n const errors: unknown[] = [];\n for (const source of sources) {\n void (async () => {\n try {\n const value = await firstValueFrom(Flux.from(source), signal);\n if (settled) {\n return;\n }\n if (value !== undefined) {\n settled = true;\n queue.push(value);\n queue.complete();\n return;\n }\n } catch (error) {\n errors.push(error);\n }\n remaining -= 1;\n if (remaining === 0 && !settled) {\n errors.length > 0 ? queue.error(new CompositeError(errors)) : queue.complete();\n }\n })();\n }\n return queue;\n });\n }\n\n /** Zips publishers by combining one value from each source. */\n public static zip<T extends readonly unknown[], R = T>(\n sources: { [K in keyof T]: PublisherInput<T[K]> },\n combinator?: (values: T) => R\n ): Flux<R> {\n const sourceCount = sources.length;\n if (sourceCount === 0) {\n return Flux.empty<R>();\n }\n if (sourceCount === 1) {\n return singleTupleSource(sources[0]!, combinator);\n }\n return new Flux(async function* (signal, context) {\n const iterators = new Array<AsyncIterator<unknown>>(sourceCount);\n const nexts = new Array<Promise<IteratorResult<unknown>>>(sourceCount);\n for (let index = 0; index < sourceCount; index += 1) {\n iterators[index] = toAsyncIterator(Flux.from(sources[index]!).iterate(signal, context));\n }\n try {\n while (!signal.aborted) {\n for (let index = 0; index < sourceCount; index += 1) {\n nexts[index] = raceWithAbort(iterators[index]!.next(), signal);\n }\n const results = await Promise.all(nexts);\n const values = new Array<unknown>(sourceCount);\n for (let index = 0; index < sourceCount; index += 1) {\n const result = results[index]!;\n if (result.done) {\n return;\n }\n values[index] = result.value;\n }\n const tuple = values as unknown as T;\n yield combinator ? combinator(tuple) : (tuple as unknown as R);\n }\n } finally {\n for (const iterator of iterators) {\n await closeAsyncIterator(iterator);\n }\n }\n });\n }\n\n /** Combines the latest value from each source after all sources emitted once. */\n public static combineLatest<T extends readonly unknown[], R = T>(\n sources: { [K in keyof T]: PublisherInput<T[K]> },\n combinator?: (values: T) => R\n ): Flux<R> {\n if (sources.length === 0) {\n return Flux.empty<R>();\n }\n if (sources.length === 1) {\n return singleTupleSource(sources[0]!, combinator);\n }\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<R>(signal);\n const sourceCount = sources.length;\n const latest = new Array<unknown>(sourceCount);\n const hasValue = new Array<boolean>(sourceCount);\n let readyCount = 0;\n let completed = 0;\n let failed = false;\n for (let index = 0; index < sourceCount; index += 1) {\n const source = sources[index]!;\n void (async () => {\n try {\n for await (const value of Flux.from(source).iterate(signal, context)) {\n latest[index] = value;\n if (hasValue[index] !== true) {\n hasValue[index] = true;\n readyCount += 1;\n }\n if (readyCount === sourceCount) {\n const values = latest.slice() as unknown as T;\n queue.push(combinator ? combinator(values) : (values as unknown as R));\n }\n }\n completed += 1;\n if (completed === sourceCount && !failed) {\n queue.complete();\n }\n } catch (error) {\n failed = true;\n queue.error(error);\n }\n })();\n }\n return queue;\n });\n }\n\n /** Switches to the most recent publisher emitted by an outer publisher. */\n public static switchOnNext<T>(sources: PublisherInput<PublisherInput<T>>): Flux<T> {\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n let active = 0;\n let outerDone = false;\n let failed = false;\n const completeIfDone = () => {\n if (outerDone && active === 0 && !failed) {\n queue.complete();\n }\n };\n void (async () => {\n const iterator = toAsyncIterator(Flux.from(sources).iterate(signal, context));\n try {\n let version = 0;\n while (!signal.aborted) {\n const next = await raceWithAbort(iterator.next(), signal);\n if (next.done) {\n break;\n }\n version += 1;\n const current = version;\n active += 1;\n void (async () => {\n try {\n for await (const value of Flux.from(next.value).iterate(signal, context)) {\n if (current === version) {\n queue.push(value);\n }\n }\n } catch (error) {\n failed = true;\n queue.error(error);\n } finally {\n active -= 1;\n completeIfDone();\n }\n })();\n }\n outerDone = true;\n completeIfDone();\n } catch (error) {\n failed = true;\n queue.error(error);\n } finally {\n void iterator.return?.();\n }\n })();\n return queue;\n });\n }\n\n /** Uses a resource for the duration of a derived publisher and cleans it up afterwards. */\n public static using<T, D>(\n resourceSupplier: () => D,\n sourceFactory: (resource: D) => PublisherInput<T>,\n resourceCleanup: (resource: D) => void = closeResource as (resource: D) => void\n ): Flux<T> {\n return new Flux(async function* (signal, context) {\n const resource = resourceSupplier();\n try {\n for await (const value of Flux.from(sourceFactory(resource)).iterate(signal, context)) {\n yield value;\n }\n } finally {\n resourceCleanup(resource);\n }\n });\n }\n\n /** Uses an asynchronously supplied resource and runs asynchronous cleanup publishers. */\n public static usingWhen<T, D>(\n resourceSupplier: PublisherInput<D>,\n sourceFactory: (resource: D) => PublisherInput<T>,\n asyncComplete?: (resource: D) => PublisherInput<unknown>,\n asyncError?: (resource: D, error: unknown) => PublisherInput<unknown>,\n asyncCancel?: (resource: D) => PublisherInput<unknown>\n ): Flux<T> {\n return new Flux(async function* (signal, context) {\n const resource = await firstValueFrom(Flux.from(resourceSupplier), signal);\n if (resource === undefined) {\n return;\n }\n let failed: unknown;\n try {\n for await (const value of Flux.from(sourceFactory(resource)).iterate(signal, context)) {\n yield value;\n }\n } catch (error) {\n failed = error;\n if (asyncError) {\n await drainPublisher(asyncError(resource, error), new AbortController().signal, context);\n }\n throw error;\n } finally {\n if (signal.aborted && asyncCancel) {\n await drainPublisher(asyncCancel(resource), new AbortController().signal, context);\n } else if (failed === undefined && asyncComplete) {\n await drainPublisher(asyncComplete(resource), new AbortController().signal, context);\n }\n }\n });\n }\n\n /** Subscribes a full Reactive Streams subscriber. */\n public subscribe(subscriber: Subscriber<T>): void;\n /** Subscribes callbacks and requests unbounded demand. */\n public subscribe(onNext?: (value: T) => void, onError?: (error: unknown) => void, onComplete?: () => void): Disposable;\n /** Subscribes either a full subscriber or callback handlers. */\n public subscribe(\n subscriberOrNext?: Subscriber<T> | ((value: T) => void),\n onError: (error: unknown) => void = throwUnhandledSubscriberError,\n onComplete: () => void = noopSubscriberCallback\n ): void | Disposable {\n if (isSubscriber<T>(subscriberOrNext)) {\n this.subscribeActual(subscriberOrNext);\n return;\n }\n\n let subscription: Subscription | undefined;\n const disposable = new BooleanDisposable(() => subscription?.cancel());\n const subscriber: Subscriber<T> = {\n /** Stores the subscription and requests unbounded demand. */\n onSubscribe(nextSubscription) {\n subscription = nextSubscription;\n nextSubscription.request(Number.POSITIVE_INFINITY);\n },\n onNext: subscriberOrNext ?? noopSubscriberCallback,\n onError,\n onComplete\n };\n this.subscribeActual(subscriber);\n return disposable;\n }\n\n /** Subscribes a normalized Reactive Streams subscriber to this Flux. */\n protected subscribeActual(subscriber: Subscriber<T>): void {\n const context = (subscriber as CoreSubscriber<T>).currentContext?.() ?? Context.empty();\n const subscription = new IterableSubscription(this, subscriber, context);\n subscription.start();\n subscriber.onSubscribe(subscription);\n subscription.deliverStartFailure();\n }\n\n /** Returns the lazy iterable backing this Flux for internal operator composition. */\n public iterate(signal: AbortSignal, context: Context = Context.empty()): AnyIterable<T> {\n return this.sourceFactory(signal, context);\n }\n\n /** Returns an async iterator over this Flux. */\n public [Symbol.asyncIterator](): AsyncIterator<T> {\n const controller = new AbortController();\n const iterator = toAsyncIterator(this.iterate(controller.signal, Context.empty()));\n return {\n next: () => iterator.next(),\n return: async value => {\n controller.abort();\n if (iterator.return) {\n await iterator.return(value);\n }\n return {done: true, value: value as T};\n },\n throw: async error => {\n controller.abort();\n if (iterator.throw) {\n return iterator.throw(error);\n }\n throw error;\n }\n };\n }\n\n /** Returns this Flux as an async iterable. */\n public toIterable(): AsyncIterable<T> {\n return this;\n }\n\n /** Collects all values into an array. */\n public async toArray(): Promise<T[]> {\n return collectIterable(this.iterate(new AbortController().signal, Context.empty()));\n }\n\n /** Resolves to the last emitted value, or undefined for an empty source. */\n public async toPromise(): Promise<T | undefined> {\n return lastIterableValue(this.iterate(new AbortController().signal, Context.empty()));\n }\n}\n\n/** Shared stateless empty Flux instance. */\nconst EMPTY_FLUX = new Flux<never>(() => EMPTY_ITERABLE);\n\n/** Shared stateless never Flux instance. */\nconst NEVER_FLUX = new Flux<never>(signal => neverIterable(signal));\n\n/** Default cleanup for resources that expose a close method. */\nfunction closeResource(resource: unknown): void {\n (resource as { close?: () => void }).close?.();\n}\n\n/** Shared no-op subscriber callback. */\nfunction noopSubscriberCallback(): void {\n // no-op\n}\n\n/** Throws unhandled subscriber errors like the default callback contract. */\nfunction throwUnhandledSubscriberError(error: unknown): never {\n throw asError(error);\n}\n\n/** Adapts a Reactive Streams publisher to the Flux async-iteration model. */\nfunction fromPublisher<T>(publisher: Publisher<T>): Flux<T> {\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n let subscription: Subscription | undefined;\n publisher.subscribe({\n /** Captures upstream subscription and requests unbounded demand. */\n onSubscribe(nextSubscription) {\n subscription = nextSubscription;\n nextSubscription.request(Number.POSITIVE_INFINITY);\n },\n /** Pushes upstream values into the bridge queue. */\n onNext(value) {\n queue.push(value);\n },\n /** Fails the bridge queue with the upstream error. */\n onError(error) {\n queue.error(error);\n },\n /** Completes the bridge queue when upstream completes. */\n onComplete() {\n queue.complete();\n }\n });\n signal.addEventListener(\"abort\", () => subscription?.cancel(), {once: true});\n return queue;\n });\n}\n\n/** Adapts publisher inputs to Flux instances without callback allocation. */\nfunction toFluxArray<T>(sources: readonly PublisherInput<T>[]): Flux<T>[] {\n const fluxes = new Array<Flux<T>>(sources.length);\n for (let index = 0; index < sources.length; index += 1) {\n fluxes[index] = Flux.from(sources[index]!);\n }\n return fluxes;\n}\n\n/** Emits one-element tuple values without multi-source coordination overhead. */\nfunction singleTupleSource<T extends readonly unknown[], R>(\n source: PublisherInput<T[0]>,\n combinator: ((values: T) => R) | undefined\n): Flux<R> {\n return new Flux((signal, context) =>\n mapIterable(Flux.from(source).iterate(signal, context), value => {\n const tuple = [value] as unknown as T;\n return combinator ? combinator(tuple) : (tuple as unknown as R);\n })\n );\n}\n\n/** Merges sources concurrently without bounded-concurrency bookkeeping. */\nfunction mergeSources<T>(sources: readonly Flux<T>[]): Flux<T> {\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n const tasks = new Array<Promise<void>>(sources.length);\n let failed = false;\n void (async () => {\n try {\n for (let index = 0; index < sources.length; index += 1) {\n tasks[index] = drainMergedSource(sources[index]!, signal, context, queue, () => {\n failed = true;\n });\n }\n await Promise.all(tasks);\n if (!failed) {\n queue.complete();\n }\n } catch (error) {\n queue.error(error);\n }\n })();\n return queue;\n });\n}\n\n/** Merges sources concurrently and collects failures until all active sources terminate. */\nfunction mergeSourcesDelayError<T>(sources: readonly Flux<T>[]): Flux<T> {\n return new Flux((signal, context) => {\n const queue = new AsyncQueue<T>(signal);\n const tasks = new Array<Promise<void>>(sources.length);\n const errors: unknown[] = [];\n void (async () => {\n try {\n for (let index = 0; index < sources.length; index += 1) {\n tasks[index] = drainMergedSourceDelayError(sources[index]!, signal, context, queue, errors);\n }\n await Promise.all(tasks);\n errors.length > 0 ? queue.error(new CompositeError(errors)) : queue.complete();\n } catch (error) {\n queue.error(error);\n }\n })();\n return queue;\n });\n}\n\n/** Drains one merged source and reports its first failure through the output queue. */\nasync function drainMergedSource<T>(\n source: Flux<T>,\n signal: AbortSignal,\n context: Context,\n queue: AsyncQueue<T>,\n markFailed: () => void\n): Promise<void> {\n try {\n for await (const value of source.iterate(signal, context)) {\n queue.push(value);\n }\n } catch (error) {\n markFailed();\n queue.error(error);\n }\n}\n\n/** Drains one merged source while recording failures for delayed-error merging. */\nasync function drainMergedSourceDelayError<T>(\n source: Flux<T>,\n signal: AbortSignal,\n context: Context,\n queue: AsyncQueue<T>,\n errors: unknown[]\n): Promise<void> {\n try {\n for await (const value of source.iterate(signal, context)) {\n queue.push(value);\n }\n } catch (error) {\n errors.push(error);\n }\n}\n\n/** Concatenates sources while collecting failures until all sources have run. */\nfunction concatDelayErrorSources<T>(sources: readonly PublisherInput<T>[]): Flux<T> {\n return new Flux(async function* (signal, context) {\n const errors: unknown[] = [];\n for (const source of sources) {\n try {\n for await (const value of Flux.from(source).iterate(signal, context)) {\n yield value;\n }\n } catch (error) {\n errors.push(error);\n }\n }\n if (errors.length > 0) {\n throw new CompositeError(errors);\n }\n });\n}\n\n/** Normalizes ordered merge arguments into a comparator and source list. */\nfunction orderedMergeInputs<T>(\n comparatorOrSource: ((left: T, right: T) => number) | PublisherInput<T> | undefined,\n sources: readonly PublisherInput<T>[]\n): { comparator: ((left: T, right: T) => number) | undefined; inputs: readonly PublisherInput<T>[] } {\n if (typeof comparatorOrSource === \"function\") {\n return {comparator: comparatorOrSource as (left: T, right: T) => number, inputs: sources};\n }\n return {\n comparator: undefined,\n inputs: comparatorOrSource === undefined ? sources : [comparatorOrSource, ...sources]\n };\n}\n\n/** Collects finite merged values and emits them sorted by the optional comparator. */\nfunction sortMergedSources<T>(sources: readonly PublisherInput<T>[], comparator?: (left: T, right: T) => number): Flux<T> {\n return new Flux(async function* (signal, context) {\n const values: T[] = [];\n for await (const value of Flux.merge(...sources).iterate(signal, context)) {\n values.push(value);\n }\n values.sort(comparator);\n yield* values;\n });\n}\n\n/** Collects finite merged values with delayed errors and emits them sorted by the optional comparator. */\nfunction sortMergedSourcesDelayError<T>(\n sources: readonly PublisherInput<T>[],\n comparator?: (left: T, right: T) => number\n): Flux<T> {\n return new Flux(async function* (signal, context) {\n const values: T[] = [];\n for await (const value of Flux.mergeDelayError(...sources).iterate(signal, context)) {\n values.push(value);\n }\n values.sort(comparator);\n yield* values;\n });\n}\n\n/** Consumes a cleanup publisher and ignores all emitted values. */\nasync function drainPublisher(source: PublisherInput<unknown>, signal: AbortSignal, context: Context): Promise<void> {\n for await (const _ of Flux.from(source).iterate(signal, context)) {\n // cleanup values are ignored\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;4BA2uBY,OAAO;;AAxsBnB,IAAa,OAAb,MAAa,KAAkD;;CAK3D,YAAmB,eAAiC;;;;GAHpD;;;EAII,KAAK,gBAAgB;CACzB;;CAGA,OAAc,KAAQ,GAAG,QAA+B;EACpD,IAAI,OAAO,WAAW,GAClB,OAAO,KAAK,MAAS;EAEzB,KAAK,MAAM,SAAS,QAChB,eAAe,OAAO,OAAO;EAEjC,OAAO,KAAK,aAAa,MAAM;CACnC;;CAGA,OAAc,UAAa,QAA+B;EACtD,eAAe,QAAQ,QAAQ;EAC/B,IAAI,OAAO,WAAW,GAClB,OAAO,KAAK,MAAS;EAEzB,OAAO,KAAK,aAAa,MAAM;CACnC;;CAGA,OAAc,WAAc,QAAoD;EAC5E,eAAe,QAAQ,QAAQ;EAC/B,OAAO,OAAO,WAAW,aAAa,KAAK,YAAY,KAAK,aAAc,OAA6B,CAAC,CAAC,IAAI,KAAK,aAAa,MAAM;CACzI;;CAGA,OAAc,aAAgB,QAA8B;EACxD,eAAe,QAAQ,QAAQ;EAC/B,IAAI,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,GAC3C,OAAO,KAAK,MAAS;EAEzB,OAAO,IAAI,WAAW,MAAM;CAChC;;CA2BA,OAAc,UACV,QACA,MACA,SACY;EACZ,OAAO,IAAI,KAAK,YAAoB,QAAQ,MAAM,OAAO,CAAC;CAC9D;;CAaA,OAAc,cACV,OACA,SACqB;EACrB,OAAO,IAAI,KAAK,gBAAmB,OAAO,OAAO,CAAC;CACtD;;CAGA,OAAc,KAAQ,OAAmC;EACrD,eAAe,OAAO,OAAO;EAC7B,IAAI,iBAAiB,MACjB,OAAO;EAEX,IAAI,gBAAmB,KAAK,GACxB,OAAO,IAAI,WAAW,KAAK;EAE/B,IAAI,WAAc,KAAK,GACnB,OAAO,KAAK,aAAa,KAAK;EAElC,IAAI,OAAQ,MAAuB,cAAc,YAC7C,OAAO,cAAc,KAAqB;EAE9C,IAAI,OAAQ,MAAyB,SAAS,YAC1C,OAAO,IAAI,KAAK,iBAAiB,QAAQ;GACrC,MAAM,QAAQ,MAAM,cAAc,QAAQ,QAAQ,KAAuB,GAAG,MAAM;GAClF,IAAI,UAAU,UAAa,UAAU,MACjC,MAAM;EAEd,CAAC;EAEL,MAAM,IAAI,UAAU,6BAA6B;CACrD;;CAGA,OAAc,QAA4B;EACtC,OAAO;CACX;;CAGA,OAAc,QAA4B;EACtC,OAAO;CACX;;CAGA,OAAc,MAAiB,OAA2C;EACtE,OAAO,IAAI,KAAK,mBAAmB;GAC/B,MAAM,OAAO,UAAU,aAAc,MAAwB,IAAI;EACrE,CAAC;CACL;;CAGA,OAAc,MAAS,UAA4C;EAC/D,OAAO,IAAI,MAAM,QAAQ,YAAY,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,QAAQ,OAAO,CAAC;CACvF;;CAGA,OAAc,gBAAmB,UAAgE;EAC7F,OAAO,IAAI,MAAM,QAAQ,YAAY,KAAK,KAAK,SAAS,QAAQ,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,QAAQ,OAAO,CAAC;CACzG;;CAGA,OAAc,OAAU,UAAwC;EAC5D,eAAe,UAAU,UAAU;EACnC,OAAO,IAAI,MAAM,QAAQ,YAAY;GACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;GACtC,IAAI,YAAY;GAChB,IAAI;GACJ,MAAM,OAAO;;IAET,KAAK,OAAU;KACX,eAAe,OAAO,OAAO;KAC7B,MAAM,KAAK,KAAK;IACpB;;IAEA,MAAM,OAAgB;KAClB,MAAM,MAAM,KAAK;IACrB;;IAEA,WAAW;KACP,MAAM,SAAS;IACnB;;IAEA,SAAS,gBAA4B;KACjC,kBAAkB,kBAAkB,iBAAiB,cAAc;KACnE,OAAO;IACX;;IAEA,cAAc;KACV,OAAO,aAAa,OAAO;IAC/B;GACJ;GACA,OAAO,iBACH,eACM;IACF,YAAY;IACZ,mBAAmB,eAAe;IAClC,kBAAkB;IAClB,MAAM,SAAS;GACnB,GACA,EAAC,MAAM,KAAI,CACf;GACA,IAAI;IACA,SAAS,IAAI;GACjB,SAAS,OAAO;IACZ,MAAM,MAAM,KAAK;GACrB;GACA,OAAO;EACX,CAAC;CACL;;CAGA,OAAc,KAAQ,UAAwC;EAC1D,OAAO,KAAK,OAAO,QAAQ;CAC/B;;CAGA,OAAc,SAAY,WAIL;EACjB,eAAe,WAAW,WAAW;EACrC,OAAO,IAAI,KAAK,iBAAiB,QAAQ;GACrC,IAAI,OAAO;GACX,IAAI,WAAW;GACf,IAAI;GACJ,MAAM,OAAO;;IAET,KAAK,WAAc;KACf,IAAI,UACA,MAAM,IAAI,MAAM,2DAA2D;KAE/E,WAAW;KACX,QAAQ;IACZ;;IAEA,WAAW;KACP,OAAO;IACX;;IAEA,MAAM,OAAgB;KAClB,MAAM;IACV;GACJ;GACA,OAAO,CAAC,QAAQ,CAAC,OAAO,SAAS;IAC7B,WAAW;IACX,QAAQ;IACR,UAAU,IAAI;IACd,IAAI,UACA,MAAM;SACH,IAAI,CAAC,MACR,MAAM,IAAI,MAAM,mDAAmD;GAE3E;EACJ,CAAC;CACL;;CAGA,OAAc,MAAM,OAAe,OAA6B;EAC5D,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAChE,MAAM,IAAI,WAAW,sEAAsE;EAE/F,IAAI,UAAU,GACV,OAAO,KAAK,MAAc;EAE9B,OAAO,IAAI,KAAK,aAAa;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,GAC5B,MAAM,QAAQ;EAEtB,CAAC;CACL;;CAGA,OAAc,SAAS,QAAuB,YAAuB,WAAW,QAAQ,GAAiB;EACrG,OAAO,IAAI,KAAK,iBAAiB,QAAQ;GACrC,IAAI,QAAQ;GACZ,OAAO,CAAC,OAAO,SAAS;IACpB,MAAM,cAAc,WAAW,QAAQ,MAAM;IAC7C,IAAI,CAAC,OAAO,SAAS;KACjB,MAAM;KACN,SAAS;IACb;GACJ;EACJ,CAAC;CACL;;CAGA,OAAc,MAAS,GAAG,SAAgD;EACtE,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,KAAK,QAAQ,EAAG;EAEhC,OAAO,aAAa,YAAY,OAAO,CAAC;CAC5C;;CAGA,OAAc,gBAAmB,GAAG,SAAgD;EAChF,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,KAAK,QAAQ,EAAG;EAEhC,OAAO,uBAAuB,YAAY,OAAO,CAAC;CACtD;;CAGA,OAAc,gBAAmB,GAAG,SAAgD;EAChF,OAAO,KAAK,OAAO,GAAG,OAAO;CACjC;;CAGA,OAAc,0BAA6B,GAAG,SAAgD;EAC1F,OAAO,wBAAwB,OAAO;CAC1C;;CAGA,OAAc,eACV,oBACA,GAAG,SACI;EACP,MAAM,EAAC,YAAY,WAAU,mBAAmB,oBAAoB,OAAO;EAC3E,OAAO,kBAAkB,QAAQ,UAAU;CAC/C;;CAGA,OAAc,yBACV,oBACA,GAAG,SACI;EACP,MAAM,EAAC,YAAY,WAAU,mBAAmB,oBAAoB,OAAO;EAC3E,OAAO,4BAA4B,QAAQ,UAAU;CACzD;;CAGA,OAAc,aACV,oBACA,GAAG,SACI;EACP,OAAO,KAAK,eAAe,oBAAoB,GAAG,OAAO;CAC7D;;CAGA,OAAc,cACV,oBACA,GAAG,SACI;EACP,OAAO,KAAK,eAAe,oBAAoB,GAAG,OAAO;CAC7D;;CAGA,OAAc,wBACV,oBACA,GAAG,SACI;EACP,OAAO,KAAK,yBAAyB,oBAAoB,GAAG,OAAO;CACvE;;CAGA,OAAc,OAAU,GAAG,SAAgD;EACvE,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,KAAK,QAAQ,EAAG;EAEhC,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;GAC9C,KAAK,MAAM,UAAU,SACjB,WAAW,MAAM,SAAS,KAAK,KAAK,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,GAAG;IAClE,IAAI,OAAO,SACP;IAEJ,MAAM;GACV;EAER,CAAC;CACL;;CAGA,OAAc,iBAAoB,GAAG,SAAgD;EACjF,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,KAAK,QAAQ,EAAG;EAEhC,OAAO,wBAAwB,OAAO;CAC1C;;CAGA,OAAc,MAAS,GAAG,SAAgD;EACtE,OAAO,KAAK,gBAAgB,GAAG,OAAO;CAC1C;;CAGA,OAAc,gBAAmB,GAAG,SAAgD;EAChF,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,KAAK,QAAQ,EAAG;EAEhC,OAAO,IAAI,MAAM,QAAQ,YAAY;GACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;GACtC,IAAI,UAAU;GACd,KAAK,MAAM,UAAU,SACjB,CAAM,YAAY;IACd,IAAI;KACA,MAAM,WAAW,gBAAgB,KAAK,KAAK,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,CAAC;KAC3E,IAAI;MACA,MAAM,QAAQ,MAAM,cAAc,SAAS,KAAK,GAAG,MAAM;MACzD,IAAI,SAAS;OACT,MAAM,SAAS,SAAS;OACxB;MACJ;MACA,UAAU;MACV,IAAI,MAAM,MAAM;OACZ,MAAM,SAAS;OACf;MACJ;MACA,MAAM,KAAK,MAAM,KAAK;MACtB,SAAU;OACN,MAAM,OAAO,MAAM,cAAc,SAAS,KAAK,GAAG,MAAM;OACxD,IAAI,KAAK,MAAM;QACX,MAAM,SAAS;QACf;OACJ;OACA,MAAM,KAAK,KAAK,KAAK;MACzB;KACJ,UAAU;MACN,MAAM,SAAS,SAAS;KAC5B;IACJ,SAAS,OAAO;KACZ,IAAI,CAAC,SAAS;MACV,UAAU;MACV,MAAM,MAAM,KAAK;KACrB;IACJ;GACJ,EAAA,CAAG;GAEP,OAAO;EACX,CAAC;CACL;;CAGA,OAAc,eAAkB,GAAG,SAAgD;EAC/E,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,OAAO,IAAI,MAAM,QAAQ,YAAY;GACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;GACtC,IAAI,YAAY,QAAQ;GACxB,IAAI,UAAU;GACd,MAAM,SAAoB,CAAC;GAC3B,KAAK,MAAM,UAAU,SACjB,CAAM,YAAY;IACd,IAAI;KACA,MAAM,QAAQ,MAAM,eAAe,KAAK,KAAK,MAAM,GAAG,MAAM;KAC5D,IAAI,SACA;KAEJ,IAAI,UAAU,QAAW;MACrB,UAAU;MACV,MAAM,KAAK,KAAK;MAChB,MAAM,SAAS;MACf;KACJ;IACJ,SAAS,OAAO;KACZ,OAAO,KAAK,KAAK;IACrB;IACA,aAAa;IACb,IAAI,cAAc,KAAK,CAAC,SACpB,OAAO,SAAS,IAAI,MAAM,MAAM,IAAI,eAAe,MAAM,CAAC,IAAI,MAAM,SAAS;GAErF,EAAA,CAAG;GAEP,OAAO;EACX,CAAC;CACL;;CAGA,OAAc,IACV,SACA,YACO;EACP,MAAM,cAAc,QAAQ;EAC5B,IAAI,gBAAgB,GAChB,OAAO,KAAK,MAAS;EAEzB,IAAI,gBAAgB,GAChB,OAAO,kBAAkB,QAAQ,IAAK,UAAU;EAEpD,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;GAC9C,MAAM,YAAY,IAAI,MAA8B,WAAW;GAC/D,MAAM,QAAQ,IAAI,MAAwC,WAAW;GACrE,KAAK,IAAI,QAAQ,GAAG,QAAQ,aAAa,SAAS,GAC9C,UAAU,SAAS,gBAAgB,KAAK,KAAK,QAAQ,MAAO,CAAC,CAAC,QAAQ,QAAQ,OAAO,CAAC;GAE1F,IAAI;IACA,OAAO,CAAC,OAAO,SAAS;KACpB,KAAK,IAAI,QAAQ,GAAG,QAAQ,aAAa,SAAS,GAC9C,MAAM,SAAS,cAAc,UAAU,MAAM,CAAE,KAAK,GAAG,MAAM;KAEjE,MAAM,UAAU,MAAM,QAAQ,IAAI,KAAK;KACvC,MAAM,SAAS,IAAI,MAAe,WAAW;KAC7C,KAAK,IAAI,QAAQ,GAAG,QAAQ,aAAa,SAAS,GAAG;MACjD,MAAM,SAAS,QAAQ;MACvB,IAAI,OAAO,MACP;MAEJ,OAAO,SAAS,OAAO;KAC3B;KACA,MAAM,QAAQ;KACd,MAAM,aAAa,WAAW,KAAK,IAAK;IAC5C;GACJ,UAAU;IACN,KAAK,MAAM,YAAY,WACnB,MAAM,mBAAmB,QAAQ;GAEzC;EACJ,CAAC;CACL;;CAGA,OAAc,cACV,SACA,YACO;EACP,IAAI,QAAQ,WAAW,GACnB,OAAO,KAAK,MAAS;EAEzB,IAAI,QAAQ,WAAW,GACnB,OAAO,kBAAkB,QAAQ,IAAK,UAAU;EAEpD,OAAO,IAAI,MAAM,QAAQ,YAAY;GACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;GACtC,MAAM,cAAc,QAAQ;GAC5B,MAAM,SAAS,IAAI,MAAe,WAAW;GAC7C,MAAM,WAAW,IAAI,MAAe,WAAW;GAC/C,IAAI,aAAa;GACjB,IAAI,YAAY;GAChB,IAAI,SAAS;GACb,KAAK,IAAI,QAAQ,GAAG,QAAQ,aAAa,SAAS,GAAG;IACjD,MAAM,SAAS,QAAQ;IACvB,CAAM,YAAY;KACd,IAAI;MACA,WAAW,MAAM,SAAS,KAAK,KAAK,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,GAAG;OAClE,OAAO,SAAS;OAChB,IAAI,SAAS,WAAW,MAAM;QAC1B,SAAS,SAAS;QAClB,cAAc;OAClB;OACA,IAAI,eAAe,aAAa;QAC5B,MAAM,SAAS,OAAO,MAAM;QAC5B,MAAM,KAAK,aAAa,WAAW,MAAM,IAAK,MAAuB;OACzE;MACJ;MACA,aAAa;MACb,IAAI,cAAc,eAAe,CAAC,QAC9B,MAAM,SAAS;KAEvB,SAAS,OAAO;MACZ,SAAS;MACT,MAAM,MAAM,KAAK;KACrB;IACJ,EAAA,CAAG;GACP;GACA,OAAO;EACX,CAAC;CACL;;CAGA,OAAc,aAAgB,SAAqD;EAC/E,OAAO,IAAI,MAAM,QAAQ,YAAY;GACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;GACtC,IAAI,SAAS;GACb,IAAI,YAAY;GAChB,IAAI,SAAS;GACb,MAAM,uBAAuB;IACzB,IAAI,aAAa,WAAW,KAAK,CAAC,QAC9B,MAAM,SAAS;GAEvB;GACA,CAAM,YAAY;IACd,MAAM,WAAW,gBAAgB,KAAK,KAAK,OAAO,CAAC,CAAC,QAAQ,QAAQ,OAAO,CAAC;IAC5E,IAAI;KACA,IAAI,UAAU;KACd,OAAO,CAAC,OAAO,SAAS;MACpB,MAAM,OAAO,MAAM,cAAc,SAAS,KAAK,GAAG,MAAM;MACxD,IAAI,KAAK,MACL;MAEJ,WAAW;MACX,MAAM,UAAU;MAChB,UAAU;MACV,CAAM,YAAY;OACd,IAAI;QACA,WAAW,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC,QAAQ,QAAQ,OAAO,GACnE,IAAI,YAAY,SACZ,MAAM,KAAK,KAAK;OAG5B,SAAS,OAAO;QACZ,SAAS;QACT,MAAM,MAAM,KAAK;OACrB,UAAU;QACN,UAAU;QACV,eAAe;OACnB;MACJ,EAAA,CAAG;KACP;KACA,YAAY;KACZ,eAAe;IACnB,SAAS,OAAO;KACZ,SAAS;KACT,MAAM,MAAM,KAAK;IACrB,UAAU;KACN,AAAK,SAAS,SAAS;IAC3B;GACJ,EAAA,CAAG;GACH,OAAO;EACX,CAAC;CACL;;CAGA,OAAc,MACV,kBACA,eACA,kBAAyC,eAClC;EACP,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;GAC9C,MAAM,WAAW,iBAAiB;GAClC,IAAI;IACA,WAAW,MAAM,SAAS,KAAK,KAAK,cAAc,QAAQ,CAAC,CAAC,CAAC,QAAQ,QAAQ,OAAO,GAChF,MAAM;GAEd,UAAU;IACN,gBAAgB,QAAQ;GAC5B;EACJ,CAAC;CACL;;CAGA,OAAc,UACV,kBACA,eACA,eACA,YACA,aACO;EACP,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;GAC9C,MAAM,WAAW,MAAM,eAAe,KAAK,KAAK,gBAAgB,GAAG,MAAM;GACzE,IAAI,aAAa,QACb;GAEJ,IAAI;GACJ,IAAI;IACA,WAAW,MAAM,SAAS,KAAK,KAAK,cAAc,QAAQ,CAAC,CAAC,CAAC,QAAQ,QAAQ,OAAO,GAChF,MAAM;GAEd,SAAS,OAAO;IACZ,SAAS;IACT,IAAI,YACA,MAAM,eAAe,WAAW,UAAU,KAAK,GAAG,IAAI,gBAAgB,CAAC,CAAC,QAAQ,OAAO;IAE3F,MAAM;GACV,UAAU;IACN,IAAI,OAAO,WAAW,aAClB,MAAM,eAAe,YAAY,QAAQ,GAAG,IAAI,gBAAgB,CAAC,CAAC,QAAQ,OAAO;SAC9E,IAAI,WAAW,UAAa,eAC/B,MAAM,eAAe,cAAc,QAAQ,GAAG,IAAI,gBAAgB,CAAC,CAAC,QAAQ,OAAO;GAE3F;EACJ,CAAC;CACL;;CAOA,UACI,kBACA,UAAoC,+BACpC,aAAyB,wBACR;EACjB,IAAI,aAAgB,gBAAgB,GAAG;GACnC,KAAK,gBAAgB,gBAAgB;GACrC;EACJ;EAEA,IAAI;EACJ,MAAM,aAAa,IAAI,wBAAwB,cAAc,OAAO,CAAC;EACrE,MAAM,aAA4B;;GAE9B,YAAY,kBAAkB;IAC1B,eAAe;IACf,iBAAiB,QAAQ,OAAO,iBAAiB;GACrD;GACA,QAAQ,oBAAoB;GAC5B;GACA;EACJ;EACA,KAAK,gBAAgB,UAAU;EAC/B,OAAO;CACX;;CAGA,gBAA0B,YAAiC;EACvD,MAAM,UAAW,WAAiC,iBAAiB,KAAK,QAAQ,MAAM;EACtF,MAAM,eAAe,IAAI,qBAAqB,MAAM,YAAY,OAAO;EACvE,aAAa,MAAM;EACnB,WAAW,YAAY,YAAY;EACnC,aAAa,oBAAoB;CACrC;;CAGA,QAAe,QAAqB,UAAmB,QAAQ,MAAM,GAAmB;EACpF,OAAO,KAAK,cAAc,QAAQ,OAAO;CAC7C;;CAGA,CAAA,yBAAkD;EAC9C,MAAM,aAAa,IAAI,gBAAgB;EACvC,MAAM,WAAW,gBAAgB,KAAK,QAAQ,WAAW,QAAQ,QAAQ,MAAM,CAAC,CAAC;EACjF,OAAO;GACH,YAAY,SAAS,KAAK;GAC1B,QAAQ,OAAM,UAAS;IACnB,WAAW,MAAM;IACjB,IAAI,SAAS,QACT,MAAM,SAAS,OAAO,KAAK;IAE/B,OAAO;KAAC,MAAM;KAAa;IAAU;GACzC;GACA,OAAO,OAAM,UAAS;IAClB,WAAW,MAAM;IACjB,IAAI,SAAS,OACT,OAAO,SAAS,MAAM,KAAK;IAE/B,MAAM;GACV;EACJ;CACJ;;CAGA,aAAsC;EAClC,OAAO;CACX;;CAGA,MAAa,UAAwB;EACjC,OAAO,gBAAgB,KAAK,QAAQ,IAAI,gBAAgB,CAAC,CAAC,QAAQ,QAAQ,MAAM,CAAC,CAAC;CACtF;;CAGA,MAAa,YAAoC;EAC7C,OAAO,kBAAkB,KAAK,QAAQ,IAAI,gBAAgB,CAAC,CAAC,QAAQ,QAAQ,MAAM,CAAC,CAAC;CACxF;AACJ;;AAGA,IAAM,aAAa,IAAI,WAAkB,cAAc;;AAGvD,IAAM,aAAa,IAAI,MAAY,WAAU,cAAc,MAAM,CAAC;;AAGlE,SAAS,cAAc,UAAyB;CAC5C,SAAqC,QAAQ;AACjD;;AAGA,SAAS,yBAA+B,CAExC;;AAGA,SAAS,8BAA8B,OAAuB;CAC1D,MAAM,QAAQ,KAAK;AACvB;;AAGA,SAAS,cAAiB,WAAkC;CACxD,OAAO,IAAI,MAAM,QAAQ,YAAY;EACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;EACtC,IAAI;EACJ,UAAU,UAAU;;GAEhB,YAAY,kBAAkB;IAC1B,eAAe;IACf,iBAAiB,QAAQ,OAAO,iBAAiB;GACrD;;GAEA,OAAO,OAAO;IACV,MAAM,KAAK,KAAK;GACpB;;GAEA,QAAQ,OAAO;IACX,MAAM,MAAM,KAAK;GACrB;;GAEA,aAAa;IACT,MAAM,SAAS;GACnB;EACJ,CAAC;EACD,OAAO,iBAAiB,eAAe,cAAc,OAAO,GAAG,EAAC,MAAM,KAAI,CAAC;EAC3E,OAAO;CACX,CAAC;AACL;;AAGA,SAAS,YAAe,SAAkD;CACtE,MAAM,SAAS,IAAI,MAAe,QAAQ,MAAM;CAChD,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GACjD,OAAO,SAAS,KAAK,KAAK,QAAQ,MAAO;CAE7C,OAAO;AACX;;AAGA,SAAS,kBACL,QACA,YACO;CACP,OAAO,IAAI,MAAM,QAAQ,YACrB,YAAY,KAAK,KAAK,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,IAAG,UAAS;EAC7D,MAAM,QAAQ,CAAC,KAAK;EACpB,OAAO,aAAa,WAAW,KAAK,IAAK;CAC7C,CAAC,CACL;AACJ;;AAGA,SAAS,aAAgB,SAAsC;CAC3D,OAAO,IAAI,MAAM,QAAQ,YAAY;EACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;EACtC,MAAM,QAAQ,IAAI,MAAqB,QAAQ,MAAM;EACrD,IAAI,SAAS;EACb,CAAM,YAAY;GACd,IAAI;IACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GACjD,MAAM,SAAS,kBAAkB,QAAQ,QAAS,QAAQ,SAAS,aAAa;KAC5E,SAAS;IACb,CAAC;IAEL,MAAM,QAAQ,IAAI,KAAK;IACvB,IAAI,CAAC,QACD,MAAM,SAAS;GAEvB,SAAS,OAAO;IACZ,MAAM,MAAM,KAAK;GACrB;EACJ,EAAA,CAAG;EACH,OAAO;CACX,CAAC;AACL;;AAGA,SAAS,uBAA0B,SAAsC;CACrE,OAAO,IAAI,MAAM,QAAQ,YAAY;EACjC,MAAM,QAAQ,IAAI,WAAc,MAAM;EACtC,MAAM,QAAQ,IAAI,MAAqB,QAAQ,MAAM;EACrD,MAAM,SAAoB,CAAC;EAC3B,CAAM,YAAY;GACd,IAAI;IACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GACjD,MAAM,SAAS,4BAA4B,QAAQ,QAAS,QAAQ,SAAS,OAAO,MAAM;IAE9F,MAAM,QAAQ,IAAI,KAAK;IACvB,OAAO,SAAS,IAAI,MAAM,MAAM,IAAI,eAAe,MAAM,CAAC,IAAI,MAAM,SAAS;GACjF,SAAS,OAAO;IACZ,MAAM,MAAM,KAAK;GACrB;EACJ,EAAA,CAAG;EACH,OAAO;CACX,CAAC;AACL;;AAGA,eAAe,kBACX,QACA,QACA,SACA,OACA,YACa;CACb,IAAI;EACA,WAAW,MAAM,SAAS,OAAO,QAAQ,QAAQ,OAAO,GACpD,MAAM,KAAK,KAAK;CAExB,SAAS,OAAO;EACZ,WAAW;EACX,MAAM,MAAM,KAAK;CACrB;AACJ;;AAGA,eAAe,4BACX,QACA,QACA,SACA,OACA,QACa;CACb,IAAI;EACA,WAAW,MAAM,SAAS,OAAO,QAAQ,QAAQ,OAAO,GACpD,MAAM,KAAK,KAAK;CAExB,SAAS,OAAO;EACZ,OAAO,KAAK,KAAK;CACrB;AACJ;;AAGA,SAAS,wBAA2B,SAAgD;CAChF,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;EAC9C,MAAM,SAAoB,CAAC;EAC3B,KAAK,MAAM,UAAU,SACjB,IAAI;GACA,WAAW,MAAM,SAAS,KAAK,KAAK,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO,GAC/D,MAAM;EAEd,SAAS,OAAO;GACZ,OAAO,KAAK,KAAK;EACrB;EAEJ,IAAI,OAAO,SAAS,GAChB,MAAM,IAAI,eAAe,MAAM;CAEvC,CAAC;AACL;;AAGA,SAAS,mBACL,oBACA,SACiG;CACjG,IAAI,OAAO,uBAAuB,YAC9B,OAAO;EAAC,YAAY;EAAqD,QAAQ;CAAO;CAE5F,OAAO;EACH,YAAY;EACZ,QAAQ,uBAAuB,SAAY,UAAU,CAAC,oBAAoB,GAAG,OAAO;CACxF;AACJ;;AAGA,SAAS,kBAAqB,SAAuC,YAAqD;CACtH,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;EAC9C,MAAM,SAAc,CAAC;EACrB,WAAW,MAAM,SAAS,KAAK,MAAM,GAAG,OAAO,CAAC,CAAC,QAAQ,QAAQ,OAAO,GACpE,OAAO,KAAK,KAAK;EAErB,OAAO,KAAK,UAAU;EACtB,OAAO;CACX,CAAC;AACL;;AAGA,SAAS,4BACL,SACA,YACO;CACP,OAAO,IAAI,KAAK,iBAAiB,QAAQ,SAAS;EAC9C,MAAM,SAAc,CAAC;EACrB,WAAW,MAAM,SAAS,KAAK,gBAAgB,GAAG,OAAO,CAAC,CAAC,QAAQ,QAAQ,OAAO,GAC9E,OAAO,KAAK,KAAK;EAErB,OAAO,KAAK,UAAU;EACtB,OAAO;CACX,CAAC;AACL;;AAGA,eAAe,eAAe,QAAiC,QAAqB,SAAiC;CACjH,WAAW,MAAM,KAAK,KAAK,KAAK,MAAM,CAAC,CAAC,QAAQ,QAAQ,OAAO;AAGnE"}
@@ -0,0 +1,19 @@
1
+ import type { DurationInput, Scheduler } from "../schedulers/types.js";
2
+ import type { Subscriber } from "../subscription/subscriber.js";
3
+ /** Sentinel returned when an iterator race observes a timeout first. */
4
+ export declare const TIMEOUT: unique symbol;
5
+ /** Returns the input value unchanged. */
6
+ export declare function identity<T>(value: T): T;
7
+ /** Compact storage for zero, one or many cancellation callbacks. */
8
+ export type CancelCallbacks = (() => void) | Set<() => void>;
9
+ /** Adds a cancellation callback without allocating a Set for the common single-callback case. */
10
+ export declare function addCancelCallback(callbacks: CancelCallbacks | undefined, callback: () => void): CancelCallbacks;
11
+ /** Runs every registered cancellation callback and clears multi-callback storage. */
12
+ export declare function runCancelCallbacks(callbacks: CancelCallbacks | undefined): void;
13
+ /** Returns true when a value implements the full Subscriber callback shape. */
14
+ export declare function isSubscriber<T>(value: unknown): value is Subscriber<T>;
15
+ /** Schedules a delay through a scheduler and cancels it when the signal aborts. */
16
+ export declare function scheduleDelay(scheduler: Scheduler, delay: DurationInput, signal?: AbortSignal): Promise<void>;
17
+ /** Races an iterator next result against a scheduler-backed timeout. */
18
+ export declare function raceIteratorWithTimeout<T>(iterator: AsyncIterator<T>, timeout: DurationInput, scheduler: Scheduler, signal: AbortSignal): Promise<IteratorResult<T> | typeof TIMEOUT>;
19
+ //# sourceMappingURL=helpers.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../src/publisher/helpers.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAC,aAAa,EAAE,SAAS,EAAC,MAAM,uBAAuB,CAAC;AACpE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,8BAA8B,CAAC;AAE7D,wEAAwE;AACxE,eAAO,MAAM,OAAO,eAAoB,CAAC;AAEzC,yCAAyC;AACzC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAEvC;AAED,oEAAoE;AACpE,MAAM,MAAM,eAAe,GAAG,CAAC,MAAM,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC;AAE7D,iGAAiG;AACjG,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,eAAe,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,IAAI,GAAG,eAAe,CAS/G;AAED,qFAAqF;AACrF,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,eAAe,GAAG,SAAS,GAAG,IAAI,CAY/E;AAED,+EAA+E;AAC/E,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,UAAU,CAAC,CAAC,CAAC,CAStE;AAED,mFAAmF;AACnF,wBAAgB,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CA2C7G;AAED,wEAAwE;AACxE,wBAAsB,uBAAuB,CAAC,CAAC,EAC3C,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,OAAO,EAAE,aAAa,EACtB,SAAS,EAAE,SAAS,EACpB,MAAM,EAAE,WAAW,GACpB,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,OAAO,OAAO,CAAC,CAa7C"}
@@ -0,0 +1,84 @@
1
+ import { raceWithAbort } from "../internal/abort.js";
2
+ import { toMillis } from "../schedulers/duration.js";
3
+ import { Schedulers } from "../schedulers/schedulers.js";
4
+ //#region src/publisher/helpers.ts
5
+ /** Sentinel returned when an iterator race observes a timeout first. */
6
+ var TIMEOUT = Symbol("timeout");
7
+ /** Returns the input value unchanged. */
8
+ function identity(value) {
9
+ return value;
10
+ }
11
+ /** Adds a cancellation callback without allocating a Set for the common single-callback case. */
12
+ function addCancelCallback(callbacks, callback) {
13
+ if (callbacks === void 0) return callback;
14
+ if (callbacks instanceof Set) {
15
+ callbacks.add(callback);
16
+ return callbacks;
17
+ }
18
+ return /* @__PURE__ */ new Set([callbacks, callback]);
19
+ }
20
+ /** Runs every registered cancellation callback and clears multi-callback storage. */
21
+ function runCancelCallbacks(callbacks) {
22
+ if (callbacks === void 0) return;
23
+ if (callbacks instanceof Set) {
24
+ for (const callback of callbacks) callback();
25
+ callbacks.clear();
26
+ return;
27
+ }
28
+ callbacks();
29
+ }
30
+ /** Returns true when a value implements the full Subscriber callback shape. */
31
+ function isSubscriber(value) {
32
+ return typeof value === "object" && value !== null && typeof value.onSubscribe === "function" && typeof value.onNext === "function" && typeof value.onError === "function" && typeof value.onComplete === "function";
33
+ }
34
+ /** Schedules a delay through a scheduler and cancels it when the signal aborts. */
35
+ function scheduleDelay(scheduler, delay, signal) {
36
+ const delayMs = toMillis(delay);
37
+ if (delayMs === 0 && scheduler === Schedulers.immediate()) return signal?.aborted ? Promise.reject(signal.reason) : Promise.resolve();
38
+ const abortSignal = signal;
39
+ if (!abortSignal) return new Promise((resolve) => {
40
+ scheduler.schedule(resolve, delayMs);
41
+ });
42
+ return new Promise((resolve, reject) => {
43
+ if (abortSignal.aborted) {
44
+ reject(abortSignal.reason);
45
+ return;
46
+ }
47
+ let settled = false;
48
+ let disposable;
49
+ const cleanup = () => {
50
+ abortSignal?.removeEventListener("abort", onAbort);
51
+ };
52
+ const onAbort = () => {
53
+ if (settled) return;
54
+ settled = true;
55
+ disposable?.dispose();
56
+ cleanup();
57
+ reject(abortSignal.reason);
58
+ };
59
+ abortSignal.addEventListener("abort", onAbort, { once: true });
60
+ disposable = scheduler.schedule(() => {
61
+ if (settled) return;
62
+ settled = true;
63
+ cleanup();
64
+ resolve();
65
+ }, delayMs);
66
+ if (settled) disposable.dispose();
67
+ });
68
+ }
69
+ /** Races an iterator next result against a scheduler-backed timeout. */
70
+ async function raceIteratorWithTimeout(iterator, timeout, scheduler, signal) {
71
+ let timeoutDisposable;
72
+ const timeoutMs = toMillis(timeout);
73
+ try {
74
+ return await Promise.race([raceWithAbort(iterator.next(), signal), new Promise((resolve) => {
75
+ timeoutDisposable = scheduler.schedule(() => resolve(TIMEOUT), timeoutMs);
76
+ })]);
77
+ } finally {
78
+ timeoutDisposable?.dispose();
79
+ }
80
+ }
81
+ //#endregion
82
+ export { TIMEOUT, addCancelCallback, identity, isSubscriber, raceIteratorWithTimeout, runCancelCallbacks, scheduleDelay };
83
+
84
+ //# sourceMappingURL=helpers.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"helpers.js","names":[],"sources":["../../src/publisher/helpers.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Flux, Mono and operator implementation modules.\n */\nimport type {Disposable} from \"@/core/types.js\";\nimport {raceWithAbort} from \"@/internal/abort.js\";\nimport {toMillis} from \"@/schedulers/duration.js\";\nimport {Schedulers} from \"@/schedulers/schedulers.js\";\nimport type {DurationInput, Scheduler} from \"@/schedulers/types.js\";\nimport type {Subscriber} from \"@/subscription/subscriber.js\";\n\n/** Sentinel returned when an iterator race observes a timeout first. */\nexport const TIMEOUT = Symbol(\"timeout\");\n\n/** Returns the input value unchanged. */\nexport function identity<T>(value: T): T {\n return value;\n}\n\n/** Compact storage for zero, one or many cancellation callbacks. */\nexport type CancelCallbacks = (() => void) | Set<() => void>;\n\n/** Adds a cancellation callback without allocating a Set for the common single-callback case. */\nexport function addCancelCallback(callbacks: CancelCallbacks | undefined, callback: () => void): CancelCallbacks {\n if (callbacks === undefined) {\n return callback;\n }\n if (callbacks instanceof Set) {\n callbacks.add(callback);\n return callbacks;\n }\n return new Set([callbacks, callback]);\n}\n\n/** Runs every registered cancellation callback and clears multi-callback storage. */\nexport function runCancelCallbacks(callbacks: CancelCallbacks | undefined): void {\n if (callbacks === undefined) {\n return;\n }\n if (callbacks instanceof Set) {\n for (const callback of callbacks) {\n callback();\n }\n callbacks.clear();\n return;\n }\n callbacks();\n}\n\n/** Returns true when a value implements the full Subscriber callback shape. */\nexport function isSubscriber<T>(value: unknown): value is Subscriber<T> {\n return (\n typeof value === \"object\" &&\n value !== null &&\n typeof (value as Subscriber<T>).onSubscribe === \"function\" &&\n typeof (value as Subscriber<T>).onNext === \"function\" &&\n typeof (value as Subscriber<T>).onError === \"function\" &&\n typeof (value as Subscriber<T>).onComplete === \"function\"\n );\n}\n\n/** Schedules a delay through a scheduler and cancels it when the signal aborts. */\nexport function scheduleDelay(scheduler: Scheduler, delay: DurationInput, signal?: AbortSignal): Promise<void> {\n const delayMs = toMillis(delay);\n if (delayMs === 0 && scheduler === Schedulers.immediate()) {\n return signal?.aborted ? Promise.reject(signal.reason) : Promise.resolve();\n }\n const abortSignal = signal;\n if (!abortSignal) {\n return new Promise(resolve => {\n scheduler.schedule(resolve, delayMs);\n });\n }\n return new Promise((resolve, reject) => {\n if (abortSignal.aborted) {\n reject(abortSignal.reason);\n return;\n }\n let settled = false;\n let disposable: Disposable | undefined;\n const cleanup = () => {\n abortSignal?.removeEventListener(\"abort\", onAbort);\n };\n const onAbort = () => {\n if (settled) {\n return;\n }\n settled = true;\n disposable?.dispose();\n cleanup();\n reject(abortSignal.reason);\n };\n abortSignal.addEventListener(\"abort\", onAbort, {once: true});\n disposable = scheduler.schedule(() => {\n if (settled) {\n return;\n }\n settled = true;\n cleanup();\n resolve();\n }, delayMs);\n if (settled) {\n disposable.dispose();\n }\n });\n}\n\n/** Races an iterator next result against a scheduler-backed timeout. */\nexport async function raceIteratorWithTimeout<T>(\n iterator: AsyncIterator<T>,\n timeout: DurationInput,\n scheduler: Scheduler,\n signal: AbortSignal\n): Promise<IteratorResult<T> | typeof TIMEOUT> {\n let timeoutDisposable: Disposable | undefined;\n const timeoutMs = toMillis(timeout);\n try {\n return await Promise.race<IteratorResult<T> | typeof TIMEOUT>([\n raceWithAbort(iterator.next(), signal),\n new Promise<typeof TIMEOUT>(resolve => {\n timeoutDisposable = scheduler.schedule(() => resolve(TIMEOUT), timeoutMs);\n })\n ]);\n } finally {\n timeoutDisposable?.dispose();\n }\n}\n"],"mappings":";;;;;AAYA,IAAa,UAAU,OAAO,SAAS;;AAGvC,SAAgB,SAAY,OAAa;CACrC,OAAO;AACX;;AAMA,SAAgB,kBAAkB,WAAwC,UAAuC;CAC7G,IAAI,cAAc,QACd,OAAO;CAEX,IAAI,qBAAqB,KAAK;EAC1B,UAAU,IAAI,QAAQ;EACtB,OAAO;CACX;CACA,uBAAO,IAAI,IAAI,CAAC,WAAW,QAAQ,CAAC;AACxC;;AAGA,SAAgB,mBAAmB,WAA8C;CAC7E,IAAI,cAAc,QACd;CAEJ,IAAI,qBAAqB,KAAK;EAC1B,KAAK,MAAM,YAAY,WACnB,SAAS;EAEb,UAAU,MAAM;EAChB;CACJ;CACA,UAAU;AACd;;AAGA,SAAgB,aAAgB,OAAwC;CACpE,OACI,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAAwB,gBAAgB,cAChD,OAAQ,MAAwB,WAAW,cAC3C,OAAQ,MAAwB,YAAY,cAC5C,OAAQ,MAAwB,eAAe;AAEvD;;AAGA,SAAgB,cAAc,WAAsB,OAAsB,QAAqC;CAC3G,MAAM,UAAU,SAAS,KAAK;CAC9B,IAAI,YAAY,KAAK,cAAc,WAAW,UAAU,GACpD,OAAO,QAAQ,UAAU,QAAQ,OAAO,OAAO,MAAM,IAAI,QAAQ,QAAQ;CAE7E,MAAM,cAAc;CACpB,IAAI,CAAC,aACD,OAAO,IAAI,SAAQ,YAAW;EAC1B,UAAU,SAAS,SAAS,OAAO;CACvC,CAAC;CAEL,OAAO,IAAI,SAAS,SAAS,WAAW;EACpC,IAAI,YAAY,SAAS;GACrB,OAAO,YAAY,MAAM;GACzB;EACJ;EACA,IAAI,UAAU;EACd,IAAI;EACJ,MAAM,gBAAgB;GAClB,aAAa,oBAAoB,SAAS,OAAO;EACrD;EACA,MAAM,gBAAgB;GAClB,IAAI,SACA;GAEJ,UAAU;GACV,YAAY,QAAQ;GACpB,QAAQ;GACR,OAAO,YAAY,MAAM;EAC7B;EACA,YAAY,iBAAiB,SAAS,SAAS,EAAC,MAAM,KAAI,CAAC;EAC3D,aAAa,UAAU,eAAe;GAClC,IAAI,SACA;GAEJ,UAAU;GACV,QAAQ;GACR,QAAQ;EACZ,GAAG,OAAO;EACV,IAAI,SACA,WAAW,QAAQ;CAE3B,CAAC;AACL;;AAGA,eAAsB,wBAClB,UACA,SACA,WACA,QAC2C;CAC3C,IAAI;CACJ,MAAM,YAAY,SAAS,OAAO;CAClC,IAAI;EACA,OAAO,MAAM,QAAQ,KAAyC,CAC1D,cAAc,SAAS,KAAK,GAAG,MAAM,GACrC,IAAI,SAAwB,YAAW;GACnC,oBAAoB,UAAU,eAAe,QAAQ,OAAO,GAAG,SAAS;EAC5E,CAAC,CACL,CAAC;CACL,UAAU;EACN,mBAAmB,QAAQ;CAC/B;AACJ"}
@@ -0,0 +1,7 @@
1
+ /**
2
+ * @packageDocumentation
3
+ * Focused Mono public entrypoint.
4
+ */
5
+ import "./operators/register.js";
6
+ export { Mono } from "./mono.js";
7
+ //# sourceMappingURL=mono-entrypoint.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"mono-entrypoint.d.ts","sourceRoot":"","sources":["../../src/publisher/mono-entrypoint.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,mCAAmC,CAAC;AAE3C,OAAO,EAAC,IAAI,EAAC,MAAM,qBAAqB,CAAC"}
@@ -0,0 +1,11 @@
1
+ import { Mono } from "./mono.js";
2
+ import "./operators/register.js";
3
+ //#region src/publisher/mono-entrypoint.ts
4
+ /**
5
+ * @packageDocumentation
6
+ * Focused Mono public entrypoint.
7
+ */
8
+ //#endregion
9
+ export { Mono };
10
+
11
+ //# sourceMappingURL=mono-entrypoint.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"mono-entrypoint.js","names":[],"sources":["../../src/publisher/mono-entrypoint.ts"],"sourcesContent":["/**\n * @packageDocumentation\n * Focused Mono public entrypoint.\n */\nimport \"@/publisher/operators/register.js\";\n\nexport {Mono} from \"@/publisher/mono.js\";\n"],"mappings":""}
@@ -0,0 +1,72 @@
1
+ import type { ContextView } from "../context/context-view.js";
2
+ import { Flux } from "./flux.js";
3
+ import type { MonoSinkCallback, PublisherInput, SourceFactory } from "./types.js";
4
+ import type { DurationInput, Scheduler } from "../schedulers/types.js";
5
+ /** Zero-or-one Reactive Streams publisher with Reactor-style Mono operators. */
6
+ export declare class Mono<T> extends Flux<T> {
7
+ /** Creates a Mono from a lazy source factory. */
8
+ constructor(sourceFactory: SourceFactory<T>);
9
+ /** Creates a Mono that emits exactly one non-nullish value. */
10
+ static just<T>(value: T): Mono<T>;
11
+ /** Creates a Mono that completes without a value. */
12
+ static empty<T = never>(): Mono<T>;
13
+ /** Creates a Mono that never emits or completes until cancelled. */
14
+ static never<T = never>(): Mono<T>;
15
+ /** Creates a Mono that terminates with the provided error. */
16
+ static error<T = never>(error: unknown | (() => unknown)): Mono<T>;
17
+ /** Defers Mono source creation until subscription time. */
18
+ static defer<T>(supplier: () => PublisherInput<T>): Mono<T>;
19
+ /** Defers Mono source creation and exposes the subscriber context. */
20
+ static deferContextual<T>(supplier: (context: ContextView) => PublisherInput<T>): Mono<T>;
21
+ /** Relays the first Mono that emits any signal. */
22
+ static first<T>(...sources: readonly PublisherInput<T>[]): Mono<T>;
23
+ /** Adapts a source and keeps at most its first value. */
24
+ static from<T>(input: PublisherInput<T>): Mono<T>;
25
+ /** Creates a Mono from a promise-like value. */
26
+ static fromPromise<T>(promise: PromiseLike<T>): Mono<T>;
27
+ /** Creates a Mono from a CompletionStage-like promise. */
28
+ static fromCompletionStage<T>(stage: PromiseLike<T> | (() => PromiseLike<T>)): Mono<T>;
29
+ /** Creates a Mono from a Future-like promise. */
30
+ static fromFuture<T>(future: PromiseLike<T> | (() => PromiseLike<T>), _suppressCancel?: boolean): Mono<T>;
31
+ /** Adapts a publisher directly, preserving only its first value for Mono semantics. */
32
+ static fromDirect<T>(input: PublisherInput<T>): Mono<T>;
33
+ /** Creates a Mono from a synchronous supplier. */
34
+ static fromSupplier<T>(supplier: () => T | null | undefined): Mono<T>;
35
+ /** Creates a Mono from a synchronous callable. */
36
+ static fromCallable<T>(callable: () => T | null | undefined): Mono<T>;
37
+ /** Runs a callback and completes after it returns. */
38
+ static fromRunnable(runnable: () => void): Mono<void>;
39
+ /** Creates a valued Mono for non-nullish input or an empty Mono otherwise. */
40
+ static justOrEmpty<T>(value: T | null | undefined): Mono<T>;
41
+ /** Ignores every value from a source and completes when the source completes. */
42
+ static ignoreElements<T>(source: PublisherInput<T>): Mono<T>;
43
+ /** Compares two sources element-by-element. */
44
+ static sequenceEqual<T>(left: PublisherInput<T>, right: PublisherInput<T>, comparator?: (left: T, right: T) => boolean): Mono<boolean>;
45
+ /** Creates a Mono by bridging callback-style producers through a sink. */
46
+ static create<T>(callback: MonoSinkCallback<T>): Mono<T>;
47
+ /** Emits `0` after the provided delay. */
48
+ static delay(duration: DurationInput, scheduler?: Scheduler): Mono<number>;
49
+ /** Completes when all provided publishers complete. */
50
+ static when(...sources: readonly PublisherInput<unknown>[]): Mono<void>;
51
+ /** Completes when all provided publishers complete and delays failures until all terminate. */
52
+ static whenDelayError(...sources: readonly PublisherInput<unknown>[]): Mono<void>;
53
+ /** Relays the first source to signal value, completion or error. */
54
+ static firstWithSignal<T>(...sources: readonly PublisherInput<T>[]): Mono<T>;
55
+ /** Relays the first non-empty value from the provided sources. */
56
+ static firstWithValue<T>(...sources: readonly PublisherInput<T>[]): Mono<T>;
57
+ /** Zips Monos by combining one value from each source. */
58
+ static zip<T extends readonly unknown[], R = T>(sources: {
59
+ [K in keyof T]: PublisherInput<T[K]>;
60
+ }, combinator?: (values: T) => R): Mono<R>;
61
+ /** Zips Monos by combining one value from each source while delaying source failures. */
62
+ static zipDelayError<T extends readonly unknown[], R = T>(sources: {
63
+ [K in keyof T]: PublisherInput<T[K]>;
64
+ }, combinator?: (values: T) => R): Mono<R>;
65
+ /** Uses a resource for the duration of a derived Mono and cleans it up afterwards. */
66
+ static using<T, D>(resourceSupplier: () => D, sourceFactory: (resource: D) => PublisherInput<T>, resourceCleanup?: (resource: D) => void): Mono<T>;
67
+ /** Uses an asynchronously supplied resource and runs asynchronous cleanup publishers. */
68
+ static usingWhen<T, D>(resourceSupplier: PublisherInput<D>, sourceFactory: (resource: D) => PublisherInput<T>, asyncComplete?: (resource: D) => PublisherInput<unknown>, asyncError?: (resource: D, error: unknown) => PublisherInput<unknown>, asyncCancel?: (resource: D) => PublisherInput<unknown>): Mono<T>;
69
+ /** Resolves to the Mono value, or undefined when empty. */
70
+ block(): Promise<T | undefined>;
71
+ }
72
+ //# sourceMappingURL=mono.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"mono.d.ts","sourceRoot":"","sources":["../../src/publisher/mono.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,2BAA2B,CAAC;AAM3D,OAAO,EAAC,IAAI,EAAC,MAAM,qBAAqB,CAAC;AAEzC,OAAO,KAAK,EAAC,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAC,MAAM,sBAAsB,CAAC;AAE1F,OAAO,KAAK,EAAC,aAAa,EAAE,SAAS,EAAC,MAAM,uBAAuB,CAAC;AAEpE,gFAAgF;AAChF,qBAAa,IAAI,CAAC,CAAC,CAAE,SAAQ,IAAI,CAAC,CAAC,CAAC;IAChC,iDAAiD;IACjD,YAAmB,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,EA+BjD;IAED,+DAA+D;IAC/D,OAAuB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAKhD;IAED,qDAAqD;IACrD,OAAuB,KAAK,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAEjD;IAED,oEAAoE;IACpE,OAAuB,KAAK,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAEjD;IAED,8DAA8D;IAC9D,OAAuB,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAIjF;IAED,2DAA2D;IAC3D,OAAuB,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE1E;IAED,sEAAsE;IACtE,OAAuB,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,WAAW,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAExG;IAED,mDAAmD;IACnD,OAAuB,KAAK,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAEjF;IAED,yDAAyD;IACzD,OAAuB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAKhE;IAED,gDAAgD;IAChD,OAAc,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAO7D;IAED,0DAA0D;IAC1D,OAAc,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE5F;IAED,iDAAiD;IACjD,OAAc,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAE/G;IAED,uFAAuF;IACvF,OAAc,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAE7D;IAED,kDAAkD;IAClD,OAAc,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAO3E;IAED,kDAAkD;IAClD,OAAc,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAE3E;IAED,sDAAsD;IACtD,OAAc,YAAY,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAI3D;IAED,8EAA8E;IAC9E,OAAc,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAEjE;IAED,iFAAiF;IACjF,OAAc,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAElE;IAED,+CAA+C;IAC/C,OAAc,aAAa,CAAC,CAAC,EACzB,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,EACvB,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EACxB,UAAU,GAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAmB,GACvD,IAAI,CAAC,OAAO,CAAC,CA8Bf;IAED,0EAA0E;IAC1E,OAAuB,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CA8DvE;IAED,0CAA0C;IAC1C,OAAc,KAAK,CAAC,QAAQ,EAAE,aAAa,EAAE,SAAS,GAAE,SAAgC,GAAG,IAAI,CAAC,MAAM,CAAC,CAKtG;IAED,uDAAuD;IACvD,OAAc,IAAI,CAAC,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAY7E;IAED,+FAA+F;IAC/F,OAAc,cAAc,CAAC,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAgBvF;IAED,oEAAoE;IACpE,OAAuB,eAAe,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CA+B3F;IAED,kEAAkE;IAClE,OAAuB,cAAc,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAmC1F;IAED,0DAA0D;IAC1D,OAAuB,GAAG,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EAC1D,OAAO,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE,EACjD,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAC9B,IAAI,CAAC,CAAC,CAAC,CAET;IAED,yFAAyF;IACzF,OAAc,aAAa,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,CAAC,GAAG,CAAC,EAC3D,OAAO,EAAE;SAAG,CAAC,IAAI,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAAE,EACjD,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAC9B,IAAI,CAAC,CAAC,CAAC,CAiCT;IAED,sFAAsF;IACtF,OAAuB,KAAK,CAAC,CAAC,EAAE,CAAC,EAC7B,gBAAgB,EAAE,MAAM,CAAC,EACzB,aAAa,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EACjD,eAAe,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,IAAI,GACxC,IAAI,CAAC,CAAC,CAAC,CAET;IAED,yFAAyF;IACzF,OAAuB,SAAS,CAAC,CAAC,EAAE,CAAC,EACjC,gBAAgB,EAAE,cAAc,CAAC,CAAC,CAAC,EACnC,aAAa,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EACjD,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,OAAO,CAAC,EACxD,UAAU,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,KAAK,cAAc,CAAC,OAAO,CAAC,EACrE,WAAW,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,cAAc,CAAC,OAAO,CAAC,GACvD,IAAI,CAAC,CAAC,CAAC,CAET;IAED,2DAA2D;IAC9C,KAAK,IAAI,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAE3C;CACJ"}