@typed/fx 1.17.3 → 1.18.0

package/dist/dts/Fx.d.ts

@@ -0,0 +1,2006 @@
+/**
+ * Fx<R, E, A> is a representation of an `Effect`-ful workflow that exists over
+ * the time dimension. It operates within a context `R`, can fail with an `E`,
+ * and succeed with an `A`.
+ *
+ * Any `Fx`, shorthand for "Effects", can emit 0 or more errors or events over an
+ * indefinite period of time. This is in contrast to `Effect` which can only
+ * produce exactly 1 error or event.
+ *
+ * It is defined as a super-type of `Effect`, `Stream`, and `Cause`. This
+ * allows for all operators that accept an `Fx` to also capable of
+ * accepting an `Effect`, `Stream`, or `Cause`. An Effect or Cause represents a single
+ * event or error, while a Stream represents a series of events or errors that will
+ * be pulled from the producer as soon as possible.
+ *
+ * @since 1.18.0
+ */
+import type * as Context from "@typed/context";
+import type { Stream } from "effect";
+import * as Cause from "effect/Cause";
+import type * as Chunk from "effect/Chunk";
+import type { DurationInput } from "effect/Duration";
+import * as Effect from "effect/Effect";
+import * as Either from "effect/Either";
+import type { Equivalence } from "effect/Equivalence";
+import type * as Exit from "effect/Exit";
+import type * as Fiber from "effect/Fiber";
+import type * as FiberId from "effect/FiberId";
+import type { FiberRef } from "effect/FiberRef";
+import type * as HashSet from "effect/HashSet";
+import type { Inspectable } from "effect/Inspectable";
+import type * as Layer from "effect/Layer";
+import * as Option from "effect/Option";
+import type { Pipeable } from "effect/Pipeable";
+import type * as PubSub from "effect/PubSub";
+import type * as Queue from "effect/Queue";
+import type * as Request from "effect/Request";
+import type * as Runtime from "effect/Runtime";
+import type * as Schedule from "effect/Schedule";
+import type { Scheduler } from "effect/Scheduler";
+import type * as Scope from "effect/Scope";
+import type * as Tracer from "effect/Tracer";
+import type { Emitter } from "./Emitter";
+import * as primitive from "./internal/fx-primitive";
+import { type RefSubject } from "./RefSubject";
+import type * as Sink from "./Sink";
+import type { Subject } from "./Subject";
+import { TypeId } from "./TypeId";
+/**
+ * Fx<R, E, A> is a representation of an `Effect`-ful workflow that exists over
+ * the time dimension. It operates within a context `R`, can fail with an `E`,
+ * and succeed with an `A`.
+ *
+ * @since 1.18.0
+ * @category models
+ */
+export interface Fx<R, E, A> extends Fx.Variance<R, E, A>, Pipeable, Inspectable {
+}
+/**
+ * FxInput<R, E, A> are all the types that can be transformed into an Fx
+ *
+ * @since 1.18.0
+ * @category models
+ */
+export type FxInput<R, E, A> = Fx<R, E, A> | Effect.Effect<R, E, A> | Cause.Cause<E> | Iterable<A>;
+/**
+ * @since 1.18.0
+ */
+export declare namespace Fx {
+    /**
+     * Extract the Context, Error, or Success type from an Fx
+     * @since 1.18.0
+     */
+    type Context<T> = T extends Fx<infer R, infer _E, infer _A> ? R : never;
+    /**
+     * Extract the Error type from an Fx
+     * @since 1.18.0
+     */
+    type Error<T> = T extends Fx<infer _R, infer E, infer _A> ? E : never;
+    /**
+     * Extract the Success type from an Fx
+     * @since 1.18.0
+     */
+    type Success<T> = T extends Fx<infer _R, infer _E, infer A> ? A : never;
+    /**
+     * Configures the variance of an Fx
+     * @since 1.18.0
+     * @category models
+     */
+    interface Variance<R, E, A> {
+        readonly [TypeId]: {
+            readonly _R: (_: never) => R;
+            readonly _E: (_: never) => E;
+            readonly _A: (_: never) => A;
+        };
+    }
+    /**
+     * @since 1.18.0
+     */
+    type FromInput<T extends FxInput<any, any, any>> = [T] extends [ReadonlyArray<infer A>] ? Fx<never, never, A> : [T] extends [Iterable<infer A>] ? Fx<never, never, A> : [T] extends [Cause.Cause<infer E>] ? Fx<never, E, never> : [T] extends [Fx<infer R, infer E, infer A>] ? Fx<R, E, A> : [T] extends [Effect.Effect<infer R, infer E, infer A>] ? Fx<R, E, A> : never;
+}
+/**
+ * FlattenStrategy is a representation of how higher-order effect operators should flatten
+ * nested Fx.
+ *
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export type FlattenStrategy = Unbounded | Bounded | Switch | Exhaust | ExhaustLatest;
+/**
+ * Strategy which will allow for an unbounded number of concurrent effects to be run.
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export interface Unbounded {
+    readonly _tag: "Unbounded";
+}
+/**
+ * Singleton instance of Unbounded
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export declare const Unbounded: Unbounded;
+/**
+ * Strategy which will allow for a bounded number of concurrent effects to be run.
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export interface Bounded {
+    readonly _tag: "Bounded";
+    readonly capacity: number;
+}
+/**
+ * Construct a Bounded strategy
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export declare const Bounded: (capacity: number) => Bounded;
+/**
+ * Strategy which will switch to a new effect as soon as it is available.
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export interface Switch {
+    readonly _tag: "Switch";
+}
+/**
+ * Singleton instance of Switch
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export declare const Switch: Switch;
+/**
+ * Strategy which will always favor the first Fx, dropping any Fx emitted while
+ * the first Fx is still running. When the first Fx finished, the next event
+ * will execute.
+ *
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export interface Exhaust {
+    readonly _tag: "Exhaust";
+}
+/**
+ * Singleton instance of Exhaust
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export declare const Exhaust: Exhaust;
+/**
+ * Strategy which will always favor the latest Fx, dropping any Fx emitted while
+ * the latest Fx is still running. When the latest Fx finishes, the last seend event
+ * will execute.
+ *
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export interface ExhaustLatest {
+    readonly _tag: "ExhaustLatest";
+}
+/**
+ * Singleton instance of ExhaustLatest
+ * @since 1.18.0
+ * @category FlattenStrategy
+ */
+export declare const ExhaustLatest: ExhaustLatest;
+/**
+ * MergeStrategy is a representation of how multiple Fx should be merged together.
+ * @since 1.18.0
+ * @category MergeStrategy
+ */
+export type MergeStrategy = Unordered | Ordered | Switch;
+/**
+ * Strategy which will merge Fx in an unordered fashion.
+ * @since 1.18.0
+ * @category MergeStrategy
+ */
+export interface Unordered {
+    readonly _tag: "Unordered";
+    readonly concurrency: number;
+}
+/**
+ * Construct an Unordered strategy
+ * @since 1.18.0
+ * @category MergeStrategy
+ */
+export declare const Unordered: (concurrency: number) => Unordered;
+/**
+ * Strategy which will merge Fx in an ordered fashion with
+ * the specified level of concurrency.
+ * @since 1.18.0
+ * @category MergeStrategy
+ */
+export interface Ordered {
+    readonly _tag: "Ordered";
+    readonly concurrency: number;
+}
+/**
+ * Construct an Ordered strategy
+ * @since 1.18.0
+ * @category MergeStrategy
+ */
+export declare const Ordered: (concurrency: number) => Ordered;
+/**
+ * An Fx which will immediately end producing 0 events and 0 errors.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const empty: Fx<never, never, never>;
+/**
+ * Construct an Fx<never, E, A> from a Cause<E>
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const failCause: <E>(cause: Cause.Cause<E>) => Fx<never, E, never>;
+/**
+ * Construct an Fx<never, never, never> from a defect
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const die: (defect: unknown) => Fx<never, never, never>;
+/**
+ * Interrupt the current Fx with the specified FiberId
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const interrupt: (id: FiberId.FiberId) => Fx<never, never, never>;
+/**
+ * Construct an Fx which will fail with the specified error.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fail: <E>(error: E) => Fx<never, E, never>;
+/**
+ * Construct an Fx<R, E, A> from an Effect<R, E, A>
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromEffect: <R, E, A>(effect: Effect.Effect<R, E, A>) => Fx<R, E, A>;
+/**
+ * Construct an Fx from an Iterable
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromIterable: {
+    <A extends ReadonlyArray<any>>(array: A): Fx<never, never, A[number]>;
+    <A>(iterable: Iterable<A>): Fx<never, never, A>;
+};
+/**
+ * Construct an Fx<R, E, A> from an Effect<R, E, A>
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromStream: <R, E, A>(effect: Stream.Stream<R, E, A>) => Fx<R, E, A>;
+/**
+ * Construct an Fx<R, E, A> from an Effect<R, E, A>
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const from: {
+    <A extends ReadonlyArray<any>>(array: A): Fx<never, never, A[number]>;
+    <A>(iterable: Iterable<A>): Fx<never, never, A>;
+    <E>(cause: Cause.Cause<E>): Fx<never, E, never>;
+    <R, E, A>(fx: FxInput<R, E, A>): Fx<R, E, A>;
+    <A>(value: A): Fx<never, never, A>;
+};
+/**
+ * Construct an Fx by describing an Effectful workflow that has access to a Sink
+ * to emit events and errors.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromSink: <R, E, A>(f: (sink: Sink.Sink<E, A>) => Effect.Effect<R, E, unknown>) => Fx<R, E, A>;
+/**
+ * Construct an Fx by describing an Scoped Effect that has access to an Emitter
+ * to emit events and errors.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromEmitter: <R, E, A>(f: (emitter: Emitter<E, A>) => Effect.Effect<R | Scope.Scope, never, unknown>) => Fx<Exclude<R, Scope.Scope>, E, A>;
+/**
+ * An Fx which will never emit any errors or events, and will never end
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const never: Fx<never, never, never>;
+/**
+ * Construct an Fx which will emit the specified value and then end.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const succeed: <A>(value: A) => Fx<never, never, A>;
+/**
+ * Construct an Fx which will emit the return of a synchronous function and then end.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const sync: <A>(f: () => A) => Fx<never, never, A>;
+/**
+ * Lazily construct an Fx.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const suspend: <R, E, A>(f: () => Fx<R, E, A>) => Fx<R, E, A>;
+/**
+ * Helper for constructing your own custom subtypes of an Fx
+ * @since 1.18.0
+ * @category Subtyping
+ */
+export declare abstract class ToFx<R, E, A> extends primitive.ToFx<R, E, A> implements Fx<R, E, A> {
+    /**
+     * Your implementation of an Fx is returned by this function.
+     * @since 1.18.0
+     */
+    abstract toFx(): Fx<R, E, A>;
+}
+/**
+ * Create an Fx which will emit a value after waiting for a specified duration.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const at: {
+    (delay: DurationInput): <A>(value: A) => Fx<never, never, A>;
+    <A>(value: A, delay: DurationInput): Fx<never, never, A>;
+};
+/**
+ * Type-alias for a Effect.forkIn(scope) that returns a Fiber
+ * @since 1.18.0
+ * @category models
+ */
+export type ScopedFork = <R, E, A>(effect: Effect.Effect<R, E, A>) => Effect.Effect<R, never, Fiber.Fiber<E, A>>;
+/**
+ * Type-alias for Effect.forkIn(scope) which runs the Effect runtime
+ * of an Fx in a Scope. Used in for higher-order operators.
+ *
+ * @since 1.18.0
+ * @category models
+ */
+export type FxFork = <R>(effect: Effect.Effect<R, never, void>) => Effect.Effect<R, never, void>;
+/**
+ * Params for withScopedFork
+ * @since 1.18.0
+ * @category params
+ */
+export type WithScopedForkParams<E, A> = {
+    readonly sink: Sink.Sink<E, A>;
+    readonly fork: ScopedFork;
+    readonly scope: Scope.Scope;
+};
+/**
+ * Construct an Fx which can fork effects into a Scope.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const withScopedFork: <R, E, A>(f: (params: WithScopedForkParams<E, A>) => Effect.Effect<R, never, unknown>) => Fx<R, E, A>;
+/**
+ * Params for withEarlyExit
+ * @since 1.18.0
+ * @category params
+ */
+export type WithEarlyExitParams<E, A> = {
+    readonly sink: Sink.WithEarlyExit<E, A>;
+    readonly fork: ScopedFork;
+    readonly scope: Scope.Scope;
+};
+/**
+ * Construct an Fx which can exit early from a Scope.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const withEarlyExit: <R, E, A>(f: (params: WithEarlyExitParams<E, A>) => Effect.Effect<R, never, unknown>) => Fx<R, E, A>;
+/**
+ * Params for withFlattenStrategy
+ * @since 1.18.0
+ * @category params
+ */
+export type WithFlattenStrategyParams<E, A> = {
+    readonly sink: Sink.Sink<E, A>;
+    readonly fork: FxFork;
+    readonly scope: Scope.Scope;
+};
+/**
+ * Construct an Fx which can flatten nested Fx.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const withFlattenStrategy: <R, E, A>(f: (params: WithFlattenStrategyParams<E, A>) => Effect.Effect<R, never, unknown>, strategy: FlattenStrategy) => Fx<R, E, A>;
+/**
+ * Acquire a resource, use it to construct an Fx, and then release the resource
+ * after the Fx has exited.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const acquireUseRelease: {
+    <A, R2, E2, B, R3, E3>(use: (a: A) => FxInput<R2, E2, B>, release: (a: A, exit: Exit.Exit<unknown, unknown>) => Effect.Effect<R3, E3, unknown>): <R, E>(acquire: Effect.Effect<R, E, A>) => Fx<R | R2 | R3, E | E2 | E3, B>;
+    <R, E, A, R2, E2, B, R3, E3>(acquire: Effect.Effect<R, E, A>, use: (a: A) => FxInput<R2, E2, B>, release: (a: A, exit: Exit.Exit<unknown, unknown>) => Effect.Effect<R3, E3, unknown>): Fx<R | R2 | R3, E | E2 | E3, B>;
+};
+/**
+ * Combine multiple Fx into a single Fx that will emit the results of all Fx
+ * as a tuple of values.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const combine: <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, {
+    readonly [K in keyof FX]: Fx.Success<FX[K]>;
+}>;
+/**
+ * Combine a record of Fx into a single Fx that will emit the results of all Fx
+ * as a record of values.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const struct: <const FX extends Readonly<Record<string, Fx<any, any, any>>>>(fxs: FX) => Fx<Fx.Context<FX[string]>, Fx.Error<FX[string]>, {
+    readonly [K in keyof FX]: Fx.Success<FX[K]>;
+}>;
+/**
+ * Combine multiple Fx into a single Fx that will emit the results of all Fx
+ * as they occur.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const merge: <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+/**
+ * Combine multiple Fx into a single Fx that will emit the results of all Fx
+ * as they occur, but only allowing `n` concurrent Fx to run at a time.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const mergeConcurrently: {
+    (concurrency: number): <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+    <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX, concurrency: number): Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+};
+/**
+ * Combine multiple Fx into a single Fx that will emit the results of all Fx
+ * in the order the Fx were provided. All Fx will be executed concurrently,
+ * and the results will be buffered if necessary to preserve ordering.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const mergeBuffer: <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+/**
+ * Combine multiple Fx into a single Fx that will emit the results of all Fx
+ * in the order the Fx were provided. All Fx will be executed concurrently, limited
+ * by the provided concurrency, and the results will be buffered if necessary to preserve ordering.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const mergeBufferConcurrently: {
+    (concurrency: number): <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+    <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX, concurrency: number): Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+};
+/**
+ * Merge together multiple Fx into a single Fx that will emit the results of all Fx
+ * allowing only 1 Fx to run at a time.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const mergeSwitch: <const FX extends readonly Fx<any, any, any>[]>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+/**
+ * Merge together multiple Fx into a single Fx that will emit the results of the
+ * first Fx to emit a value.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const race: <const FX extends ReadonlyArray<Fx<any, any, any>>>(fxs: FX) => Fx<Fx.Context<FX[number]>, Fx.Error<FX[number]>, Fx.Success<FX[number]>>;
+/**
+ * Schedule an Effect to run using the provided Schedule, emitting its success of failure
+ * at the intervals specified by the Schedule.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromScheduled: {
+    <R2>(scheduled: Schedule.Schedule<R2, unknown, unknown>): <R, E, A>(fx: Effect.Effect<R, E, A>) => Fx<R | R2, E, A>;
+    <R, E, A, R2>(fx: Effect.Effect<R, E, A>, scheduled: Schedule.Schedule<R2, unknown, unknown>): Fx<R | R2, E, A>;
+};
+/**
+ * Schedule an Effect to run at the specified duration.
+ *
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const periodic: {
+    (duration: DurationInput): <R, E, A>(fx: Effect.Effect<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Effect.Effect<R, E, A>, duration: DurationInput): Fx<R, E, A>;
+};
+/**
+ * Consume a Dequeue as soon as values become available and emit them as a Fx.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromDequeue: {
+    <A>(dequeue: Queue.Dequeue<A>): Fx<never, never, A>;
+    <I, A>(dequeue: Context.Dequeue<I, A>): Fx<I, never, A>;
+};
+/**
+ * Consume a PubSub as soon as values become available and emit them as a Fx.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromPubSub: {
+    <A>(PubSub: PubSub.PubSub<A>): Fx<Scope.Scope, never, A>;
+    <I, A>(PubSub: Context.PubSub<I, A>): Fx<Scope.Scope | I, never, A>;
+};
+/**
+ * Run an Fx to completion with the provided Sink. The
+ * Effect will resolve with the first Error of the Fx.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const run: {
+    <E, A, R2>(sink: Sink.WithContext<R2, E, A>): <R>(fx: Fx<R, E, A>) => Effect.Effect<R | R2, never, unknown>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, sink: Sink.WithContext<R2, E, A>): Effect.Effect<R | R2, never, unknown>;
+};
+/**
+ * Observe an Fx with the provided success value handler. The
+ * Effect will resolve with the first Error of the Fx.
+ *
+ * @since 1.18.0
+ * @category running
+ */
+export declare const observe: {
+    <A, R2, E2>(onSuccees: (a: A) => Effect.Effect<R2, E2, unknown>): <R, E>(fx: Fx<R, E, A>) => Effect.Effect<R | R2, E | E2, void>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, onSuccees: (a: A) => Effect.Effect<R2, E2, unknown>): Effect.Effect<R | R2, E | E2, void>;
+};
+/**
+ * Run an Fx to completion. The Effect will resolve with the first Error of the Fx.
+ *
+ * @since 1.18.0
+ * @category running
+ */
+export declare const drain: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, E, void>;
+/**
+ * Reduce an Fx to a single value.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const reduce: {
+    <A, B>(seed: B, f: (acc: B, a: A) => B): <R, E>(fx: Fx<R, E, A>) => Effect.Effect<R, E, B>;
+    <R, E, A, B>(fx: Fx<R, E, A>, seed: B, f: (acc: B, a: A) => B): Effect.Effect<R, E, B>;
+};
+/**
+ * Run an Fx to completion, collecting all emitted values into an Array.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const toArray: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, E, Array<A>>;
+/**
+ * Run an Fx to completion, collecting all emitted values into a ReadonlyArray.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const toReadonlyArray: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, E, ReadonlyArray<A>>;
+/**
+ * Run an Fx to completion, collecting all emitted values into a Chunk.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const toChunk: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, E, Chunk.Chunk<A>>;
+/**
+ * Consume an Fx and place its values into an Enqueue.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const toEnqueue: {
+    <A, B>(enqueue: Queue.Enqueue<A | B>): <R, E>(fx: Fx<R, E, A>) => Effect.Effect<R, E, void>;
+    <I, A, B>(enqueue: Context.Enqueue<I, A | B>): <R, E>(fx: Fx<R, E, A>) => Effect.Effect<I | R, E, void>;
+    <R, E, A, B>(fx: Fx<R, E, A>, enqueue: Queue.Enqueue<A | B>): Effect.Effect<R, E, void>;
+    <R, E, I, A, B>(fx: Fx<R, E, A>, enqueue: Context.Enqueue<I, A | B>): Effect.Effect<R, E, void>;
+};
+/**
+ * Map over the success value of an Fx.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const map: {
+    <A, B>(f: (a: A) => B): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, B>;
+    <R, E, A, B>(fx: Fx<R, E, A>, f: (a: A) => B): Fx<R, E, B>;
+};
+/**
+ * Map over both failure and success values of an Fx.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const mapBoth: {
+    <E, E2, A, B>(options: {
+        readonly onFailure: (e: E) => E2;
+        readonly onSuccess: (a: A) => B;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R, E2, B>;
+    <R, E, A, E2, B>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (e: E) => E2;
+        readonly onSuccess: (a: A) => B;
+    }): Fx<R, E2, B>;
+};
+/**
+ * Filter the success value of an Fx.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filter: {
+    <A, B extends A>(f: (a: A) => a is B): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, B>;
+    <A>(f: (a: A) => boolean): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A, B extends A>(fx: Fx<R, E, A>, f: (a: A) => a is B): Fx<R, E, B>;
+    <R, E, A>(fx: Fx<R, E, A>, f: (a: A) => boolean): Fx<R, E, A>;
+};
+/**
+ * Filter and map the success value of an Fx.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filterMap: {
+    <A, B>(f: (a: A) => Option.Option<B>): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, B>;
+    <R, E, A, B>(fx: Fx<R, E, A>, f: (a: A) => Option.Option<B>): Fx<R, E, B>;
+};
+/**
+ * Unwrap Options by filtering any None values.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const compact: <R, E, A>(fx: Fx<R, E, Option.Option<A>>) => Fx<R, E, A>;
+/**
+ * Map over the Cause  of an Fx.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const mapErrorCause: {
+    <E, E2>(f: (a: Cause.Cause<E>) => Cause.Cause<E2>): <R, A>(fx: Fx<R, E, A>) => Fx<R, E2, A>;
+    <R, E, A, E2>(fx: Fx<R, E, A>, f: (a: Cause.Cause<E>) => Cause.Cause<E2>): Fx<R, E2, A>;
+};
+/**
+ * Map over the Error of an Fx.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const mapError: {
+    <E, E2>(f: (a: E) => E2): <R, A>(fx: Fx<R, E, A>) => Fx<R, E2, A>;
+    <R, E, A, E2>(fx: Fx<R, E, A>, f: (a: E) => E2): Fx<R, E2, A>;
+};
+/**
+ * Filter the Cause of an Fx.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const filterErrorCause: {
+    <E, E2 extends E>(f: (a: Cause.Cause<E>) => a is Cause.Cause<E2>): <R, A>(fx: Fx<R, E, A>) => Fx<R, E2, A>;
+    <E>(f: (a: Cause.Cause<E>) => boolean): <R, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, E2 extends E, A>(fx: Fx<R, E, A>, f: (a: Cause.Cause<E>) => a is Cause.Cause<E2>): Fx<R, E2, A>;
+    <R, E, A>(fx: Fx<R, E, A>, f: (a: Cause.Cause<E>) => boolean): Fx<R, E, A>;
+};
+/**
+ * Filter and map the Cause of an Fx.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const filterMapCause: {
+    <E, E2>(f: (a: Cause.Cause<E>) => Option.Option<Cause.Cause<E2>>): <R, A>(fx: Fx<R, E, A>) => Fx<R, E2, A>;
+    <R, E, A, E2>(fx: Fx<R, E, A>, f: (a: Cause.Cause<E>) => Option.Option<Cause.Cause<E2>>): Fx<R, E2, A>;
+};
+/**
+ * Filter the Error of an Fx.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const filterError: {
+    <E, E2 extends E>(f: (a: E) => a is E2): <R, A>(fx: Fx<R, E, A>) => Fx<R, E2, A>;
+    <E>(f: (a: E) => boolean): <R, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, E2 extends E, A>(fx: Fx<R, E, A>, f: (a: E) => a is E2): Fx<R, E2, A>;
+    <R, E, A>(fx: Fx<R, E, A>, f: (a: E) => boolean): Fx<R, E, A>;
+};
+/**
+ * Filter and map the error of an Fx.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const filterMapError: {
+    <E, E2>(f: (a: E) => Option.Option<E2>): <R, A>(fx: Fx<R, E, A>) => Fx<R, E2, A>;
+    <R, E, A, E2>(fx: Fx<R, E, A>, f: (a: E) => Option.Option<E2>): Fx<R, E2, A>;
+};
+/**
+ * Filter and map the error of an Fx using an Effect.
+ * @since 1.18.0
+ * @category errors
+ */
+export declare const filterMapErrorEffect: {
+    <E, R2, E2, B>(f: (e: E) => Effect.Effect<R2, E2, Option.Option<B>>): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2 | B, A>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: (e: E) => Effect.Effect<R2, E2, Option.Option<B>>): Fx<R | R2, E2 | B, A>;
+};
+/**
+ * Map the success value of an Fx to another Fx, flattening the result
+ * with the provided FlattenStrategy.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapWithStrategy: {
+    <A, R2, E2, B>(f: (a: A) => FxInput<R2, E2, B>, strategy: FlattenStrategy): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>, strategy: FlattenStrategy): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Map the success value of an Fx to another Fx, switching to the latest
+ * Fx emitted and interrupting the previous.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const switchMap: {
+    <A, R2 = never, E2 = never, B = never>(f: (a: A) => FxInput<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Map the success value of an Fx to another Fx, switching to the latest
+ * Fx emitted and interrupting the previous.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const switchLatest: {
+    <R, E, R2, E2, B>(fx: Fx<R, E, FxInput<R2, E2, B>>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Map the success value of an Fx to another Fx, prefering the first
+ * Fx emitted and dropping any subsequent Fx until it has completed.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMap: {
+    <A, R2 = never, E2 = never, B = never>(f: (a: A) => FxInput<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Flatten a nested Fx, prefering the first
+ * Fx emitted and dropping any subsequent Fx until it has completed.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaust: <R, E, R2, E2, A>(fx: Fx<R, E, Fx<R2, E2, A>>) => Fx<R | R2, E | E2, A>;
+/**
+ * Map the success value of an Fx to another Fx, prefering the first
+ * until completion, and then running the last emitted Fx if they are not
+ * the same Fx.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMapLatest: {
+    <A, R2 = never, E2 = never, B = never>(f: (a: A) => FxInput<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Flatten a nested Fx, prefering the first until completion, and then running the last emitted Fx if they are not
+ * the same Fx.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustLatest: <R, E, R2, E2, A>(fx: Fx<R, E, Fx<R2, E2, A>>) => Fx<R | R2, E | E2, A>;
+/**
+ * Map the success value of an Fx to another Fx with unbounded concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMap: {
+    <A, R2 = never, E2 = never, B = never>(f: (a: A) => FxInput<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Map the success value of an Fx to another Fx with unbounded concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatten: <R, E, R2, E2, A>(fx: Fx<R, E, Fx<R2, E2, A>>) => Fx<R | R2, E | E2, A>;
+/**
+ * Map the success value of an Fx to another Fx with the specified concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapConcurrently: {
+    <A, R2 = never, E2 = never, B = never>(f: (a: A) => FxInput<R2, E2, B>, concurrency: number): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>, concurrency: number): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Map the success value of an Fx to another Fx one at a time.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const concatMap: {
+    <A, R2 = never, E2 = never, B = never>(f: (a: A) => FxInput<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (a: A) => FxInput<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Skip and take a number of values from an Fx.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const slice: {
+    (skip: number, take: number): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, skip: number, take: number): Fx<R, E, A>;
+};
+/**
+ * Take a number of values from an Fx.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const take: {
+    (n: number): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, n: number): Fx<R, E, A>;
+};
+/**
+ * Drop a number of values from an Fx.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const drop: {
+    (n: number): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, n: number): Fx<R, E, A>;
+};
+/**
+ * Take values from an Fx while the predicate returns true.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const takeWhile: {
+    <A, R2, E2>(predicate: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, predicate: (a: A) => Effect.Effect<R2, E2, boolean>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Take values from an Fx until the predicate returns true.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const takeUntil: {
+    <A, R2, E2>(predicate: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, predicate: (a: A) => Effect.Effect<R2, E2, boolean>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Drop values from an Fx while the predicate returns true.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const dropWhile: {
+    <A, R2, E2>(predicate: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, predicate: (a: A) => Effect.Effect<R2, E2, boolean>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Drop values from an Fx until the predicate returns true.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const dropUntil: {
+    <A, R2, E2>(predicate: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, predicate: (a: A) => Effect.Effect<R2, E2, boolean>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Drop values from an Fx after the predicate returns true.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const dropAfter: {
+    <A, R2, E2>(predicate: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, predicate: (a: A) => Effect.Effect<R2, E2, boolean>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Concatenate an Fx after the successful completion of another Fx
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const continueWith: {
+    <R2, E2, B>(f: () => Fx<R2, E2, B>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A | B>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: () => Fx<R2, E2, B>): Fx<R | R2, E | E2, A | B>;
+};
+/**
+ * Concatenate an Fx after the failure of another Fx
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const orElse: {
+    <E, R2, E2, B>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => Fx<R2, E2, A>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the success value of an Fx to an Effect, doesn't fork any fibers like flatMap* etc.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const mapEffect: {
+    <A, R2, E2, B>(f: (a: A) => Effect.Effect<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: (a: A) => Effect.Effect<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Perform an Effect for each value emitted by an Fx, not affecting the output of the Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const tap: {
+    <A, R2, E2, B>(f: (a: A) => Effect.Effect<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: (a: A) => Effect.Effect<R2, E2, B>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Filter the success value of an Fx with an Effect.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filterEffect: {
+    <A, R2, E2>(predicate: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, predicate: (a: A) => Effect.Effect<R2, E2, boolean>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Filter and map the success value of an Fx with an Effect.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const filterMapEffect: {
+    <A, R2, E2, B>(f: (a: A) => Effect.Effect<R2, E2, Option.Option<B>>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, f: (a: A) => Effect.Effect<R2, E2, Option.Option<B>>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Apply a function to the constructed Effect that represents the running Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const middleware: {
+    <R, E, A, R2>(f: (effect: Effect.Effect<R, never, unknown>) => Effect.Effect<R2, never, unknown>, g?: (sink: Sink.Sink<E, A>) => Sink.Sink<E, A>): (fx: Fx<R, E, A>) => Fx<R2, E, A>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, f: (effect: Effect.Effect<R, never, unknown>) => Effect.Effect<R2, never, unknown>, g?: (sink: Sink.Sink<E, A>) => Sink.Sink<E, A>): Fx<R2, E, A>;
+};
+/**
+ * Accumulate a value over the success values of an Fx and atomically produce derived value.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const loop: {
+    <A, B, C>(seed: B, f: (acc: B, a: A) => readonly [C, B]): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, C>;
+    <R, E, A, B, C>(fx: Fx<R, E, A>, seed: B, f: (acc: B, a: A) => readonly [C, B]): Fx<R, E, C>;
+};
+/**
+ * Emit values with their previously emitted values when possible.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const withPrevious: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, readonly [previous: Option.Option<A>, current: A]>;
+/**
+ * Accumulate a value over the success values of an Fx and atomically produce derived value
+ * useing an Effect. A SynchronizedRef is utilized to ensure ordering of events.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const loopEffect: {
+    <B, A, R2, E2, C>(seed: B, f: (acc: B, a: A) => Effect.Effect<R2, E2, readonly [C, B]>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, C>;
+    <R, E, A, B, R2, E2, C>(fx: Fx<R, E, A>, seed: B, f: (acc: B, a: A) => Effect.Effect<R2, E2, readonly [C, B]>): Fx<R | R2, E | E2, C>;
+};
+/**
+ * Prepends a value to the beginning of an Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const startWith: {
+    <B>(value: B): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A | B>;
+    <R, E, A, B>(fx: Fx<R, E, A>, value: B): Fx<R, E, A | B>;
+};
+/**
+ * Appends a value to the end of an Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const endWith: {
+    <B>(value: B): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A | B>;
+    <R, E, A, B>(fx: Fx<R, E, A>, value: B): Fx<R, E, A | B>;
+};
+/**
+ * Run a reducer over the success values of an Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const scan: {
+    <A, B>(seed: B, f: (acc: B, a: A) => B): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, B>;
+    <R, E, A, B>(fx: Fx<R, E, A>, seed: B, f: (acc: B, a: A) => B): Fx<R, E, B>;
+};
+/**
+ * Run an Effect-ful reducer over the success values of an Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const scanEffect: {
+    <A, B, R2, E2>(seed: B, f: (acc: B, a: A) => Effect.Effect<R2, E2, B>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, B>;
+    <R, E, A, B, R2, E2>(fx: Fx<R, E, A>, seed: B, f: (acc: B, a: A) => Effect.Effect<R2, E2, B>): Fx<R | R2, E | E2, B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, flattening the result
+ * with the provided FlattenStrategy.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapCauseWithStrategy: {
+    <E, R2 = never, E2 = never, B = never>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>, strategy: FlattenStrategy): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>, strategy: FlattenStrategy): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, flattening the result
+ * with the provided FlattenStrategy.
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapErrorWithStrategy: {
+    <E, R2 = never, E2 = never, B = never>(f: (error: E) => FxInput<R2, E2, B>, strategy: FlattenStrategy): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (error: E) => FxInput<R2, E2, B>, strategy: FlattenStrategy): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, flattening the result with unbounded concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapCause: {
+    <E, R2 = never, E2 = never, B = never>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, flattening the result with unbounded concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapError: {
+    <E, R2 = never, E2 = never, B = never>(f: (error: E) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (error: E) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx with the specified concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapCauseConcurrently: {
+    <E, R2 = never, E2 = never, B = never>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>, concurrency: number): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>, concurrency: number): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx with the specified concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const flatMapErrorConcurrently: {
+    <E, R2 = never, E2 = never, B = never>(f: (error: E) => FxInput<R2, E2, B>, concurrency: number): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (error: E) => FxInput<R2, E2, B>, concurrency: number): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, switching to the latest
+ * Fx emitted and interrupting the previous.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const switchMapCause: {
+    <E, R2 = never, E2 = never, B = never>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, switching to the latest
+ * Fx emitted and interrupting the previous.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const switchMapError: {
+    <E, R2 = never, E2 = never, B = never>(f: (error: E) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (error: E) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, prefering the first
+ * Fx emitted and dropping any subsequent Fx until it has completed.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMapCause: {
+    <E, R2 = never, E2 = never, B = never>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, prefering the first
+ * Fx emitted and dropping any subsequent Fx until it has completed.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMapError: {
+    <E, R2 = never, E2 = never, B = never>(f: (error: E) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (error: E) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx, prefering the first
+ * until completion, and then running the last emitted Fx if they are not
+ * the same Fx.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMapLatestCause: {
+    <E, R2 = never, E2 = never, B = never>(f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R | R2, E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map the failures of an Fx to another Fx,  prefering the first
+ * until completion, and then running the last emitted Fx if they are not
+ * the same Fx.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMapLatestError: {
+    <E, R2 = never, E2 = never, B = never>(f: (error: E) => FxInput<R2, E2, B>): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, A>, f: (error: E) => FxInput<R2, E2, B>): Fx<R | R2, E2, A | B>;
+};
+/**
+ * Map over the failures and successes of an Fx, flattening both using the same strategy.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const matchCauseWithStrategy: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly strategy: FlattenStrategy;
+    }): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly strategy: FlattenStrategy;
+    }): Fx<R | R2, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, flattening both using the same strategy.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const matchErrorWithStrategy: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly strategy: FlattenStrategy;
+    }): <R, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2, B | A>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly strategy: FlattenStrategy;
+    }): Fx<R | R2, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, flattening both with unbounded concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const matchCause: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, flattening both with unbounded concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const match: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, flattening both with the specified concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const matchCauseConcurrently: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly concurrency: number;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly concurrency: number;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, flattening both with the specified concurrency.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const matchErrorConcurrently: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly concurrency: number;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+        readonly concurrency: number;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, switching to the latest
+ * Fx emitted and interrupting the previous.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const switchMatchCause: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, switching to the latest
+ * Fx emitted and interrupting the previous.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const switchMatch: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, prefering the first
+ * Fx emitted and dropping any subsequent Fx until it has completed.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMatchCause: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, prefering the first
+ * Fx emitted and dropping any subsequent Fx until it has completed.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustMatch: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, prefering the first
+ * Fx emitted and starting the latest Fx when the first completes
+ * if they are not the same Fx.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustLatestMatchCause: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (cause: Cause.Cause<E>) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Map over the failures and successes of an Fx, prefering the first
+ * Fx emitted and starting the latest Fx when the first completes
+ * if they are not the same Fx.
+ *
+ * @since 1.18.0
+ * @category flattening
+ */
+export declare const exhaustLatestMatch: {
+    <E, R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): <R>(fx: Fx<R, E, A>) => Fx<R2 | R3 | R, E2 | E3, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, options: {
+        readonly onFailure: (error: E) => FxInput<R2, E2, B>;
+        readonly onSuccess: (a: A) => FxInput<R3, E3, C>;
+    }): Fx<R | R2 | R3, E2 | E3, B | C>;
+};
+/**
+ * Listen to the events of an Fx within the provided window. When the window Fx
+ * emits the inner stream, the fx will begin allowing events to pass through,
+ * and when the inner stream emits, the fx will be interrupted.
+ *
+ * @since 1.18.0
+ * @category time slicing
+ */
+export declare const during: {
+    <R2, E2, R3, E3>(window: Fx<R2, E2, Fx<R3, E3, unknown>>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2 | R3, E | E2 | E3, A>;
+    <R, E, A, R2, E2, R3, E3>(fx: Fx<R, E, A>, window: Fx<R2, E2, Fx<R3, E3, unknown>>): Fx<R | R2 | R3, E | E2 | E3, A>;
+};
+/**
+ * Listen to the events of an Fx after the provided window emits.
+ *
+ * @since 1.18.0
+ * @category time slicing
+ */
+export declare const since: {
+    <R2, E2>(window: Fx<R2, E2, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, window: Fx<R2, E2, unknown>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Listen to the events of an Fx until the provided window emits.
+ *
+ * @since 1.18.0
+ * @category time slicing
+ */
+export declare const until: {
+    <R2, E2>(window: Fx<R2, E2, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, A>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, window: Fx<R2, E2, unknown>): Fx<R | R2, E | E2, A>;
+};
+/**
+ * Provide the environment to an Fx.
+ *
+ * @since 1.18.0
+ * @category context
+ */
+export declare const provide: {
+    <R2, E2, S>(layer: Layer.Layer<R2, E2, S>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R2 | Exclude<R, S>, E2 | E, A>;
+    <R2>(runtime: Runtime.Runtime<R2>): <R, E, A>(fx: Fx<R, E, A>) => Fx<Exclude<R, R2>, E, A>;
+    <R2>(context: Context.Context<R2>): <R, E, A>(fx: Fx<R, E, A>) => Fx<Exclude<R, R2>, E, A>;
+    <R, E, A, R2, E2, S>(fx: Fx<R, E, A>, layer: Layer.Layer<R2, E2, S>): Fx<Exclude<R, S> | R2, E | E2, A>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, runtime: Runtime.Runtime<R2>): Fx<Exclude<R, R2>, E, A>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, context: Context.Context<R2>): Fx<Exclude<R, R2>, E, A>;
+};
+/**
+ * Provide a service to an Fx using a Tag.
+ * @since 1.18.0
+ * @category context
+ */
+export declare const provideService: {
+    <I, S>(tag: Context.Tag<I, S>, service: S): <R, E, A>(fx: Fx<R, E, A>) => Fx<Exclude<R, I>, E, A>;
+    <R, E, A, I, S>(fx: Fx<R, E, A>, tag: Context.Tag<I, S>, service: S): Fx<Exclude<R, I>, E, A>;
+};
+/**
+ * Provide a service using an Effect to an Fx using a Tag.
+ *
+ * @since 1.18.0
+ * @category context
+ */
+export declare const provideServiceEffect: {
+    <I, S, R2, E2>(tag: Context.Tag<I, S>, service: Effect.Effect<R2, E2, S>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R2 | Exclude<R, I>, E, A>;
+    <R, E, A, I, S, R2, E2>(fx: Fx<R, E, A>, tag: Context.Tag<I, S>, service: Effect.Effect<R2, E2, S>): Fx<R2 | Exclude<R, I>, E, A>;
+};
+/**
+ * Skip repeated values, using the provided Equivalence to compare values.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const skipRepeatsWith: {
+    <A>(eq: Equivalence<A>): <R, E>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, eq: Equivalence<A>): Fx<R, E, A>;
+};
+/**
+ * Skip repeated values, using @effect/data/Equal for value comparison.
+ *
+ * @since 1.18.0
+ * @category slicing
+ */
+export declare const skipRepeats: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+/**
+ * Sample the values of an Fx, or Effect, during the events of another Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const snapshot: {
+    <R2 = never, E2 = never, B = never, A = never, R3 = never, E3 = never, C = never>(sampled: FxInput<R2, E2, B>, f: (a: A, b: B) => Effect.Effect<R3, E3, C>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2 | R3, E | E2 | E3, C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, A>, sampled: FxInput<R2, E2, B>, f: (a: A, b: B) => Effect.Effect<R3, E3, C>): Fx<R | R2 | R3, E | E2 | E3, C>;
+};
+/**
+ * Share the output of an Fx, or Effect, with other Fx's using the behavior of the
+ * provided Subject.
+ *
+ * @since 1.18.0
+ * @category sharing
+ */
+export declare const share: <R, E, A, R2>(fx: Fx<R, E, A>, subject: Subject<R2, E, A>) => Fx<R | R2, E, A>;
+/**
+ * Effeciently share an underlying stream with multiple subscribers.
+ *
+ * @since 1.18.0
+ * @category sharing
+ */
+export declare const multicast: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+/**
+ * Effeciently share an underlying stream with multiple subscribers, saving the most
+ * recent event and emitting it to new subscribers.
+ *
+ * @since 1.18.0
+ * @category sharing
+ */
+export declare const hold: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+/**
+ * Effeciently share an underlying stream with multiple subscribers,
+ * saving up to the most recent `n` events and emitting them to new subscribers.
+ *
+ * @since 1.18.0
+ * @category sharing
+ */
+export declare const replay: {
+    (capacity: number): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, capacity: number): Fx<R, E, A>;
+};
+/**
+ * Create an Fx which will wait a specified duration of time where no
+ * events have occurred before emitting a value.
+ * @since 1.18.0
+ * @category time slicing
+ */
+export declare const debounce: {
+    (delay: DurationInput): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, delay: DurationInput): Fx<R, E, A>;
+};
+/**
+ * Create an Fx which will wait a specified duration of time before emitting
+ * an event after the last event.
+ * @since 1.18.0
+ * @category time slicing
+ */
+export declare const throttle: {
+    (delay: DurationInput): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, delay: DurationInput): Fx<R, E, A>;
+};
+/**
+ * Create an Fx which will wait a specified duration of time where no
+ * events have occurred before emitting a value.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const delay: {
+    (delay: DurationInput): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, delay: DurationInput): Fx<R, E, A>;
+};
+/**
+ * Run an Effect to produce an Fx to run.
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromFxEffect: <R, E, R2, E2, B>(fxEffect: Effect.Effect<R, E, Fx<R2, E2, B>>) => Fx<R | R2, E | E2, B>;
+/**
+ * Extract the context from an EffectGen
+ * @since 1.18.0
+ */
+export type EffectGenContext<T> = [T] extends [never] ? never : [T] extends [Effect.EffectGen<infer R, any, any>] ? R : never;
+/**
+ * Extract the error from an EffectGen
+ * @since 1.18.0
+ */
+export type EffectGenError<T> = [T] extends [never] ? never : [T] extends [Effect.EffectGen<any, infer E, any>] ? E : never;
+/**
+ * Extract the success value from an EffectGen
+ * @since 1.18.0
+ */
+export type EffectGenSuccess<T> = [T] extends [never] ? never : [T] extends [Effect.EffectGen<any, any, infer A>] ? A : never;
+/**
+ * Utilize Effect.gen to construct an Fx
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare function gen<Yield extends Effect.EffectGen<any, any, any>, R, E, A>(f: (_: Effect.Adapter) => Generator<Yield, Fx<R, E, A>, any>): Fx<R | EffectGenContext<Yield>, E | EffectGenError<Yield>, A>;
+/**
+ * Utilize Effect.gen to construct an Fx
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare function genScoped<Yield extends Effect.EffectGen<any, any, any>, R, E, A>(f: (_: Effect.Adapter) => Generator<Yield, Fx<R, E, A>, any>): Fx<Exclude<R | EffectGenContext<Yield>, Scope.Scope>, E | EffectGenError<Yield>, A>;
+/**
+ * Run an Effect when an Fx exits
+ * @since 1.18.0
+ * @category lifecycles
+ */
+export declare const onExit: {
+    <R2>(f: (exit: Exit.Exit<never, unknown>) => Effect.Effect<R2, never, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2, E, A>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, f: (exit: Exit.Exit<never, unknown>) => Effect.Effect<R2, never, unknown>): Fx<R | R2, E, A>;
+};
+/**
+ * Run an Effect when an Fx is interrupted
+ * @since 1.18.0
+ * @category lifecycles
+ */
+export declare const onInterrupt: {
+    <R2>(f: (interruptors: HashSet.HashSet<FiberId.FiberId>) => Effect.Effect<R2, never, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2, E, A>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, f: (interruptors: HashSet.HashSet<FiberId.FiberId>) => Effect.Effect<R2, never, unknown>): Fx<R | R2, E, A>;
+};
+/**
+ * Run an Effect when an Fx ends with an error
+ * @since 1.18.0
+ * @category lifecycles
+ */
+export declare const onError: {
+    <R2>(f: (cause: Cause.Cause<never>) => Effect.Effect<R2, never, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R | R2, E, A>;
+    <R, E, A, R2>(fx: Fx<R, E, A>, f: (cause: Cause.Cause<never>) => Effect.Effect<R2, never, unknown>): Fx<R | R2, E, A>;
+};
+/**
+ * Provide a Scope to an Fx
+ * @since 1.18.0
+ * @category context
+ */
+export declare const scoped: <R, E, A>(fx: Fx<R, E, A>) => Fx<Exclude<R, Scope.Scope>, E, A>;
+/**
+ * Annotate the logs of an Fx
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const annotateLogs: {
+    (key: string, value: unknown): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    (values: Record<string, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, key: string, value: unknown): Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, values: Record<string, unknown>): Fx<R, E, A>;
+};
+/**
+ * Annotate the spans of an Fx
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const annotateSpans: {
+    (key: string, value: unknown): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    (values: Record<string, unknown>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, key: string, value: unknown): Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, values: Record<string, unknown>): Fx<R, E, A>;
+};
+/**
+ * Create an Fx which will succeed with Option.None
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const succeedNone: <A = never>() => Fx<never, never, Option.Option<A>>;
+/**
+ * Create an Fx which will succeed with Option.Some
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const succeedSome: <A>(value: A) => Fx<never, never, Option.Option<A>>;
+/**
+ * Do simulation
+ * @since 1.18.0
+ * @category Do
+ */
+export declare const Do: Fx<never, never, {}>;
+/**
+ * Do simulation
+ * @since 1.18.0
+ * @category Do
+ */
+export declare const bind: {
+    <N extends string, A extends object, R2, E2, B>(name: Exclude<N, keyof A>, f: (a: A) => Fx<R2, E2, B>): <R1, E1>(self: Fx<R1, E1, A>) => Fx<R2 | R1, E2 | E1, {
+        [K in N | keyof A]: K extends keyof A ? A[K] : B;
+    }>;
+    <R1, E1, A1 extends object, N extends string, R2, E2, B>(self: Fx<R1, E1, A1>, name: Exclude<N, keyof A1>, f: (a: A1) => Fx<R2, E2, B>): Fx<R1 | R2, E1 | E2, {
+        [K in N | keyof A1]: K extends keyof A1 ? A1[K] : B;
+    }>;
+};
+/**
+ * Do simulation
+ * @since 1.18.0
+ * @category Do
+ */
+export declare const bindTo: {
+    <N extends string>(name: N): <R, E, A>(self: Fx<R, E, A>) => Fx<R, E, {
+        [K in N]: A;
+    }>;
+    <R, E, A, N extends string>(self: Fx<R, E, A>, name: N): Fx<R, E, {
+        [K_1 in N]: A;
+    }>;
+};
+declare const let_: {
+    <N extends string, A extends object, B>(name: Exclude<N, keyof A>, f: (a: A) => B): <R1, E1>(self: Fx<R1, E1, A>) => Fx<R1, E1, {
+        [K in N | keyof A]: K extends keyof A ? A[K] : B;
+    }>;
+    <R1, E1, A1 extends object, N extends string, B>(self: Fx<R1, E1, A1>, name: Exclude<N, keyof A1>, f: (a: A1) => B): Fx<R1, E1, {
+        [K in N | keyof A1]: K extends keyof A1 ? A1[K] : B;
+    }>;
+};
+export { 
+/**
+ * Do simulation
+ * @since 1.18.0
+ * @category Do
+ */
+let_ as let };
+/**
+ * Ensure a finalizer runs on Fx ext.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const ensuring: {
+    <R2>(finalizer: Effect.Effect<R2, never, unknown>): <R, E, A>(self: Fx<R, E, A>) => Fx<R2 | R, E, A>;
+    <R, E, A, R2>(self: Fx<R, E, A>, finalizer: Effect.Effect<R2, never, unknown>): Fx<R | R2, E, A>;
+};
+/**
+ * Capture the errors and success values as Exit
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const exit: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, never, Exit.Exit<E, A>>;
+/**
+ * Capture the errors and success values as Either
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const either: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, never, Either.Either<E, A>>;
+/**
+ * Run an Fx until finding a value which satisfies the predicate.
+ * @since 1.18.0
+ * @category running
+ */
+export declare const findFirst: {
+    <A, R2, E2>(f: (a: A) => Effect.Effect<R2, E2, boolean>): <R, E>(fx: Fx<R, E, A>) => Effect.Effect<R2 | R, E2 | E, Option.Option<A>>;
+    <R, E, A, R2, E2>(fx: Fx<R, E, A>, f: (a: A) => Effect.Effect<R2, E2, boolean>): Effect.Effect<R | R2, E | E2, Option.Option<A>>;
+};
+/**
+ * Grab the first value emitted by an Fx
+ * @since 1.18.0
+ * @category running
+ */
+export declare const first: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, E, Option.Option<A>>;
+/**
+ * Transform success values into failures and failures into successes.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const flip: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, A, E>;
+/**
+ * Lift a nullable value into an Fx
+ * @since 1.18.0
+ * @category constructors
+ */
+export declare const fromNullable: <A>(value: void | A | null | undefined) => Fx<never, never, NonNullable<A>>;
+declare const if_: {
+    <R2, E2, B, R3, E3, C>(onTrue: Fx<R2, E2, B>, onFalse: Fx<R3, E3, C>): {
+        <R, E>(bool: Fx<R, E, boolean>): Fx<R2 | R3 | R, E2 | E3 | E, B | C>;
+        (bool: boolean): Fx<R2 | R3, E2 | E3, B | C>;
+    };
+    <R, E, R2, E2, B, R3, E3, C>(bool: Fx<R, E, boolean>, onTrue: Fx<R2, E2, B>, onFalse: Fx<R3, E3, C>): Fx<R | R2 | R3, E | E2 | E3, B | C>;
+    <R2, E2, B, R3, E3, C>(bool: boolean, onTrue: Fx<R2, E2, B>, onFalse: Fx<R3, E3, C>): Fx<R2 | R3, E2 | E3, B | C>;
+};
+export { 
+/**
+ * Logical if/else using Fx.
+ * @since 1.18.0
+ * @category combinators
+ */
+if_ as if };
+/**
+ * Logical if/else using static values.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const when: {
+    <B, C>(onTrue: B, onFalse: C): {
+        <R, E>(bool: Fx<R, E, boolean>): Fx<R, E, B | C>;
+        (bool: boolean): Fx<never, never, B | C>;
+    };
+    <R, E, B, C>(bool: Fx<R, E, boolean>, onTrue: B, onFalse: C): Fx<R, E, B | C>;
+    <B, C>(bool: boolean, onTrue: B, onFalse: C): Fx<never, never, B | C>;
+};
+/**
+ * Mark an Fx as interruptible
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const interruptible: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+/**
+ * Mark an Fx as uninterruptible
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const uninterruptible: <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+/**
+ * Locally set the value of a FiberRef
+ * @since 1.18.0
+ * @category FiberRef
+ */
+export declare const locally: {
+    <A>(self: FiberRef<A>, value: A): <R, E, B>(use: Fx<R, E, B>) => Fx<R, E, B>;
+    <R, E, B, A>(use: Fx<R, E, B>, self: FiberRef<A>, value: A): Fx<R, E, B>;
+};
+/**
+ * Locally set the value of a FiberRef by updating the current value
+ * @since 1.18.0
+ * @category FiberRef
+ */
+export declare const locallyWith: {
+    <A>(self: FiberRef<A>, f: (a: A) => A): <R, E, B>(use: Fx<R, E, B>) => Fx<R, E, B>;
+    <R, E, B, A>(use: Fx<R, E, B>, self: FiberRef<A>, f: (a: A) => A): Fx<R, E, B>;
+};
+/**
+ * Enable/disable tracer timing for an Fx
+ * @since 1.18.0
+ * @category tracing
+ */
+export declare const withTracerTiming: {
+    (enabled: boolean): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, enabled: boolean): Fx<R, E, A>;
+};
+/**
+ * Configure the concurreny limit of Fibers running within an Fx
+ * @since 1.18.0
+ * @category concurrency
+ */
+export declare const withConcurrency: {
+    (concurrency: number | "unbounded"): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, concurrency: number | "unbounded"): Fx<R, E, A>;
+};
+/**
+ * Add a span to your log messages
+ * @since 1.18.0
+ * @category logging
+ */
+export declare const withLogSpan: {
+    (span: string): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, span: string): Fx<R, E, A>;
+};
+/**
+ * Configure the maximum number of operations to run before yielding to the runtime
+ * @since 1.18.0
+ * @category concurrency
+ */
+export declare const withMaxOpsBeforeYield: {
+    (maxOps: number): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, maxOps: number): Fx<R, E, A>;
+};
+/**
+ * Set the parent Span of an Fx
+ * @since 1.18.0
+ * @category tracing
+ */
+export declare const withParentSpan: {
+    (parentSpan: Tracer.ParentSpan): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, parentSpan: Tracer.ParentSpan): Fx<R, E, A>;
+};
+/**
+ * Enable/disable request batching within an Fx
+ * @since 1.18.0
+ * @category batching
+ */
+export declare const withRequestBatching: {
+    (requestBatching: boolean): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, requestBatching: boolean): Fx<R, E, A>;
+};
+/**
+ * Set the request cache Effects running within an Fx
+ * @since 1.18.0
+ * @category batching
+ */
+export declare const withRequestCache: {
+    (cache: Request.Cache): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, cache: Request.Cache): Fx<R, E, A>;
+};
+/**
+ * Enable/disable request caching within an Fx
+ * @since 1.18.0
+ * @category batching
+ */
+export declare const withRequestCaching: {
+    (requestCaching: boolean): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, requestCaching: boolean): Fx<R, E, A>;
+};
+/**
+ * Configure the scheduler to use within an Fx
+ * @since 1.18.0
+ * @category concurrency
+ */
+export declare const withScheduler: {
+    (scheduler: Scheduler): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, scheduler: Scheduler): Fx<R, E, A>;
+};
+/**
+ * Set the span of an Fx
+ * @since 1.18.0
+ * @category tracing
+ */
+export declare const withSpan: {
+    (name: string, options?: {
+        readonly attributes?: Record<string, unknown>;
+        readonly links?: ReadonlyArray<Tracer.SpanLink>;
+        readonly parent?: Tracer.ParentSpan;
+        readonly root?: boolean;
+        readonly context?: Context.Context<never>;
+    }): <R, E, A>(self: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(self: Fx<R, E, A>, name: string, options?: {
+        readonly attributes?: Record<string, unknown>;
+        readonly links?: ReadonlyArray<Tracer.SpanLink>;
+        readonly parent?: Tracer.ParentSpan;
+        readonly root?: boolean;
+        readonly context?: Context.Context<never>;
+    }): Fx<R, E, A>;
+};
+/**
+ * Set the tracer used within an Fx
+ * @since 1.18.0
+ * @category tracing
+ */
+export declare const withTracer: {
+    (tracer: Tracer.Tracer): <R, E, A>(fx: Fx<R, E, A>) => Fx<R, E, A>;
+    <R, E, A>(fx: Fx<R, E, A>, tracer: Tracer.Tracer): Fx<R, E, A>;
+};
+/**
+ * Partition an Fx into two Fx's based on a either-returning function.
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const partitionMap: {
+    <A, B, C>(f: (a: A) => Either.Either<B, C>): <R, E>(self: Fx<R, E, A>) => readonly [Fx<R, E, B>, Fx<R, E, C>];
+    <R, E, A, B, C>(self: Fx<R, E, A>, f: (a: A) => Either.Either<B, C>): readonly [Fx<R, E, B>, Fx<R, E, C>];
+};
+/**
+ * Convert a list of keyed values into persistent workflows for given each key of the list
+ * even when the list has been re-ordered.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const keyed: {
+    <A, B, R2, E2, C>(getKey: (a: A) => B, f: (ref: RefSubject<never, never, A>, key: B) => FxInput<R2, E2, C>): <R, E>(fx: Fx<R, E, ReadonlyArray<A>>) => Fx<R | R2, E | E2, ReadonlyArray<C>>;
+    <R, E, A, B, R2, E2, C>(fx: Fx<R, E, ReadonlyArray<A>>, getKey: (a: A) => B, f: (ref: RefSubject<never, never, A>, key: B) => FxInput<R2, E2, C>): Fx<R | R2, E | E2, ReadonlyArray<C>>;
+};
+/**
+ * Map an Fx of values into workflows similar to Fx.switchMap, but
+ * instead of providing the value directly, it is exposed as a RefSubject to
+ * allow creating a persistent workflows similar to Fx.keyed but for a single value.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const withKey: {
+    <A, B, R2, E2, C>(getKey: (a: A) => B, f: (ref: RefSubject<never, never, A>, key: B) => FxInput<R2, E2, C>): <R, E>(fx: Fx<R, E, A>) => Fx<R | R2, E | E2, C>;
+    <R, E, A, B, R2, E2, C>(fx: Fx<R, E, A>, getKey: (a: A) => B, f: (ref: RefSubject<never, never, A>, key: B) => FxInput<R2, E2, C>): Fx<R | R2, E | E2, C>;
+};
+/**
+ * Match over a tagged union of values into a set of persistent workflows
+ * that allow listening to changes of values with the same tag using the same
+ * Fx.
+ *
+ * @since 1.18.0
+ * @category combinators
+ */
+export declare const matchTags: {
+    <A extends {
+        readonly _tag: string;
+    }, Matchers extends DefaultMatchersFrom<A>>(matchers: Matchers): <R, E>(fx: Fx<R, E, A>) => Fx<R | Fx.Context<Fx.FromInput<ReturnType<Matchers[keyof Matchers]>>>, E | Fx.Error<Fx.FromInput<ReturnType<Matchers[keyof Matchers]>>>, Fx.Success<Fx.FromInput<ReturnType<Matchers[keyof Matchers]>>>>;
+    <R, E, A extends {
+        readonly _tag: string;
+    }, Matchers extends DefaultMatchersFrom<A>>(fx: Fx<R, E, A>, matchers: Matchers): Fx<R | Fx.Context<Fx.FromInput<ReturnType<Matchers[keyof Matchers]>>>, E | Fx.Error<Fx.FromInput<ReturnType<Matchers[keyof Matchers]>>>, Fx.Success<Fx.FromInput<ReturnType<Matchers[keyof Matchers]>>>>;
+};
+/**
+ * @since 1.18.0
+ */
+export type DefaultMatchersFrom<A extends {
+    readonly _tag: string;
+}> = {
+    readonly [Tag in A["_tag"]]: (value: RefSubject<never, never, Extract<A, {
+        readonly _tag: Tag;
+    }>>) => FxInput<any, any, any>;
+};
+/**
+ * @since 1.18.0
+ */
+export declare const drainLayer: <FXS extends ReadonlyArray<Fx<any, never, any>>>(...fxs: FXS) => Layer.Layer<Exclude<Fx.Context<FXS[number]>, Scope.Scope>, never, never>;
+/**
+ * @since 1.18.0
+ */
+export declare function isFx<R = unknown, E = unknown, A = unknown>(u: unknown): u is Fx<R, E, A>;
+/**
+ * @since 1.18.0
+ */
+export declare const matchOption: {
+    <A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(onNone: () => FxInput<R2, E2, B>, onSome: (a: RefSubject<never, never, A>) => FxInput<R3, E3, C>): <R, E>(fx: Fx<R, E, Option.Option<A>>) => Fx<R | R2, E | E2, B | C>;
+    <R, E, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, Option.Option<A>>, onNone: () => FxInput<R2, E2, B>, onSome: (a: RefSubject<never, never, A>) => FxInput<R3, E3, C>): Fx<R | R2, E | E2, B | C>;
+};
+/**
+ * @since 1.18.0
+ */
+export declare const getOrElse: {
+    <A, R2 = never, E2 = never, B = never>(orElse: () => FxInput<R2, E2, B>): <R, E>(fx: Fx<R, E, Option.Option<A>>) => Fx<R | R2, E | E2, A | B>;
+    <R, E, A, R2 = never, E2 = never, B = never>(fx: Fx<R, E, Option.Option<A>>, orElse: () => FxInput<R2, E2, B>): Fx<R | R2, E | E2, A | B>;
+};
+/**
+ * @since 1.18.0
+ */
+export declare const matchEither: {
+    <E1, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(onLeft: (e: RefSubject<never, never, E1>) => FxInput<R2, E2, B>, onRight: (a: RefSubject<never, never, A>) => FxInput<R3, E3, C>): <R, E>(fx: Fx<R, E, Either.Either<E1, A>>) => Fx<R | R2, E | E2, B | C>;
+    <R, E, E1, A, R2 = never, E2 = never, B = never, R3 = never, E3 = never, C = never>(fx: Fx<R, E, Either.Either<E1, A>>, onLeft: (e: RefSubject<never, never, E1>) => FxInput<R2, E2, B>, onRight: (a: RefSubject<never, never, A>) => FxInput<R3, E3, C>): Fx<R | R2, E | E2, B | C>;
+};
+/**
+ * @since 1.18.0
+ */
+export declare const fork: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, never, Fiber.RuntimeFiber<E, void>>;
+/**
+ * @since 1.18.0
+ */
+export declare const forkScoped: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<Scope.Scope | R, never, Fiber.RuntimeFiber<E, void>>;
+/**
+ * @since 1.18.0
+ */
+export declare const forkDaemon: <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, never, Fiber.RuntimeFiber<E, void>>;
+/**
+ * @since 1.18.0
+ */
+export declare const forkIn: {
+    (scope: Scope.Scope): <R, E, A>(fx: Fx<R, E, A>) => Effect.Effect<R, never, Fiber.RuntimeFiber<E, void>>;
+    <R, E, A>(fx: Fx<R, E, A>, scope: Scope.Scope): Effect.Effect<R, never, Fiber.RuntimeFiber<E, void>>;
+};
+/**
+ * @since 1.18.0
+ */
+export declare const mergeRace: {
+    <R2, E2, B>(other: Fx<R2, E2, B>): <R, E, A>(fx: Fx<R, E, A>) => Fx<R2 | R, E2 | E, B | A>;
+    <R, E, A, R2, E2, B>(fx: Fx<R, E, A>, other: Fx<R2, E2, B>): Fx<R | R2, E | E2, A | B>;
+};
+//# sourceMappingURL=Fx.d.ts.map