effect 2.0.0-next.37 → 2.0.0-next.39

package/dist/declarations/src/Schedule.d.ts

@@ -1,5 +1,5 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Cause from "./Cause.js";
 import type * as Chunk from "./Chunk.js";
@@ -14,22 +14,22 @@ import type { Predicate } from "./Predicate.js";
 import type * as ScheduleDecision from "./ScheduleDecision.js";
 import type * as Intervals from "./ScheduleIntervals.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const ScheduleTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type ScheduleTypeId = typeof ScheduleTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const ScheduleDriverTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type ScheduleDriverTypeId = typeof ScheduleDriverTypeId;
@@ -59,7 +59,7 @@ export type ScheduleDriverTypeId = typeof ScheduleDriverTypeId;
  * schedules, both for performing retrying, as well as performing repetition.
  *
  * @category model
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface Schedule<Env, In, Out> extends Schedule.Variance<Env, In, Out>, Pipeable {
     /**
@@ -72,11 +72,11 @@ export interface Schedule<Env, In, Out> extends Schedule.Variance<Env, In, Out>,
     readonly step: (now: number, input: In, state: any) => Effect.Effect<Env, never, readonly [any, Out, ScheduleDecision.ScheduleDecision]>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace Schedule {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<Env, In, Out> {
@@ -87,7 +87,7 @@ export declare namespace Schedule {
         };
     }
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      */
     interface DriverVariance<Env, In, Out> {
         readonly [ScheduleDriverTypeId]: {
@@ -98,7 +98,7 @@ export declare namespace Schedule {
     }
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface ScheduleDriver<Env, In, Out> extends Schedule.DriverVariance<Env, In, Out> {
@@ -111,7 +111,7 @@ export interface ScheduleDriver<Env, In, Out> extends Schedule.DriverVariance<En
  * Constructs a new `Schedule` with the specified `initial` state and the
  * specified `step` function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const makeWithState: <S, Env, In, Out>(initial: S, step: (now: number, input: In, state: S) => Effect.Effect<Env, never, readonly [S, Out, ScheduleDecision.ScheduleDecision]>) => Schedule<Env, In, Out>;
@@ -119,7 +119,7 @@ export declare const makeWithState: <S, Env, In, Out>(initial: S, step: (now: nu
  * Returns a new schedule with the given delay added to every interval defined
  * by this schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const addDelay: {
@@ -130,7 +130,7 @@ export declare const addDelay: {
  * Returns a new schedule with the given effectfully computed delay added to
  * every interval defined by this schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const addDelayEffect: {
@@ -140,7 +140,7 @@ export declare const addDelayEffect: {
 /**
  * The same as `andThenEither`, but merges the output.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category sequencing
  */
 export declare const andThen: {
@@ -151,7 +151,7 @@ export declare const andThen: {
  * Returns a new schedule that first executes this schedule to completion, and
  * then executes the specified schedule to completion.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category sequencing
  */
 export declare const andThenEither: {
@@ -161,7 +161,7 @@ export declare const andThenEither: {
 /**
  * Returns a new schedule that maps this schedule to a constant output.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const as: {
@@ -171,7 +171,7 @@ export declare const as: {
 /**
  * Returns a new schedule that maps the output of this schedule to unit.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const asUnit: <Env, In, Out>(self: Schedule<Env, In, Out>) => Schedule<Env, In, void>;
@@ -179,7 +179,7 @@ export declare const asUnit: <Env, In, Out>(self: Schedule<Env, In, Out>) => Sch
  * Returns a new schedule that has both the inputs and outputs of this and the
  * specified schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const bothInOut: {
@@ -191,7 +191,7 @@ export declare const bothInOut: {
  * to the specified function, and then determines whether or not to continue
  * based on the return value of the function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const check: {
@@ -203,7 +203,7 @@ export declare const check: {
  * to the specified function, and then determines whether or not to continue
  * based on the return value of the function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const checkEffect: {
@@ -213,14 +213,14 @@ export declare const checkEffect: {
 /**
  * A schedule that recurs anywhere, collecting all inputs into a `Chunk`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const collectAllInputs: <A>() => Schedule<never, A, Chunk.Chunk<A>>;
 /**
  * Returns a new schedule that collects the outputs of this one into a chunk.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const collectAllOutputs: <Env, In, Out>(self: Schedule<Env, In, Out>) => Schedule<Env, In, Chunk.Chunk<Out>>;
@@ -228,7 +228,7 @@ export declare const collectAllOutputs: <Env, In, Out>(self: Schedule<Env, In, O
  * A schedule that recurs until the condition f fails, collecting all inputs
  * into a list.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const collectUntil: <A>(f: Predicate<A>) => Schedule<never, A, Chunk.Chunk<A>>;
@@ -236,7 +236,7 @@ export declare const collectUntil: <A>(f: Predicate<A>) => Schedule<never, A, Ch
  * A schedule that recurs until the effectful condition f fails, collecting
  * all inputs into a list.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const collectUntilEffect: <Env, A>(f: (a: A) => Effect.Effect<Env, never, boolean>) => Schedule<Env, A, Chunk.Chunk<A>>;
@@ -244,7 +244,7 @@ export declare const collectUntilEffect: <Env, A>(f: (a: A) => Effect.Effect<Env
  * A schedule that recurs as long as the condition f holds, collecting all
  * inputs into a list.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const collectWhile: <A>(f: Predicate<A>) => Schedule<never, A, Chunk.Chunk<A>>;
@@ -253,7 +253,7 @@ export declare const collectWhile: <A>(f: Predicate<A>) => Schedule<never, A, Ch
  * all inputs into a list.
  *
  * @category utils
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const collectWhileEffect: <Env, A>(f: (a: A) => Effect.Effect<Env, never, boolean>) => Schedule<Env, A, Chunk.Chunk<A>>;
 /**
@@ -262,7 +262,7 @@ export declare const collectWhileEffect: <Env, A>(f: (a: A) => Effect.Effect<Env
  * described by this schedule will always be executed before the effects
  * described by the second schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const compose: {
@@ -273,7 +273,7 @@ export declare const compose: {
  * Returns a new schedule that deals with a narrower class of inputs than this
  * schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const mapInput: {
@@ -284,7 +284,7 @@ export declare const mapInput: {
  * Transforms the context being provided to this schedule with the
  * specified function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category context
  */
 export declare const mapInputContext: {
@@ -295,7 +295,7 @@ export declare const mapInputContext: {
  * Returns a new schedule that deals with a narrower class of inputs than this
  * schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const mapInputEffect: {
@@ -305,7 +305,7 @@ export declare const mapInputEffect: {
 /**
  * A schedule that always recurs, which counts the number of recurrences.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const count: Schedule<never, unknown, number>;
@@ -317,7 +317,7 @@ export declare const count: Schedule<never, unknown, number>;
  *
  * NOTE: `day` parameter is validated lazily. Must be in range 1...31.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const dayOfMonth: (day: number) => Schedule<never, unknown, number>;
@@ -328,7 +328,7 @@ export declare const dayOfMonth: (day: number) => Schedule<never, unknown, numbe
  * NOTE: `day` parameter is validated lazily. Must be in range 1 (Monday)...7
  * (Sunday).
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const dayOfWeek: (day: number) => Schedule<never, unknown, number>;
@@ -336,7 +336,7 @@ export declare const dayOfWeek: (day: number) => Schedule<never, unknown, number
  * Returns a new schedule with the specified effectfully computed delay added
  * before the start of each interval produced by this schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const delayed: {
@@ -347,7 +347,7 @@ export declare const delayed: {
  * Returns a new schedule with the specified effectfully computed delay added
  * before the start of each interval produced by this schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const delayedEffect: {
@@ -358,21 +358,21 @@ export declare const delayedEffect: {
  * Takes a schedule that produces a delay, and returns a new schedule that
  * uses this delay to further delay intervals in the resulting schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const delayedSchedule: <Env, In>(schedule: Schedule<Env, In, Duration.Duration>) => Schedule<Env, In, Duration.Duration>;
 /**
  * Returns a new schedule that outputs the delay between each occurence.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const delays: <Env, In, Out>(self: Schedule<Env, In, Out>) => Schedule<Env, In, Duration.Duration>;
 /**
  * Returns a new schedule that maps both the input and output.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const mapBoth: {
@@ -388,7 +388,7 @@ export declare const mapBoth: {
 /**
  * Returns a new schedule that maps both the input and output.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const mapBothEffect: {
@@ -405,7 +405,7 @@ export declare const mapBothEffect: {
  * Returns a driver that can be used to step the schedule, appropriately
  * handling sleeping.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getter
  */
 export declare const driver: <Env, In, Out>(self: Schedule<Env, In, Out>) => Effect.Effect<never, never, ScheduleDriver<Env, In, Out>>;
@@ -413,7 +413,7 @@ export declare const driver: <Env, In, Out>(self: Schedule<Env, In, Out>) => Eff
  * A schedule that can recur one time, the specified amount of time into the
  * future.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const duration: (duration: Duration.DurationInput) => Schedule<never, unknown, Duration.Duration>;
@@ -421,7 +421,7 @@ export declare const duration: (duration: Duration.DurationInput) => Schedule<ne
  * Returns a new schedule that performs a geometric union on the intervals
  * defined by both schedules.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category alternatives
  */
 export declare const either: {
@@ -431,7 +431,7 @@ export declare const either: {
 /**
  * The same as `either` followed by `map`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category alternatives
  */
 export declare const eitherWith: {
@@ -442,7 +442,7 @@ export declare const eitherWith: {
  * A schedule that occurs everywhere, which returns the total elapsed duration
  * since the first step.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const elapsed: Schedule<never, unknown, Duration.Duration>;
@@ -453,7 +453,7 @@ export declare const elapsed: Schedule<never, unknown, Duration.Duration>;
  * the driver of the schedule may not run to completion. However, if the
  * `Schedule` ever decides not to continue, then the finalizer will be run.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category finalization
  */
 export declare const ensuring: {
@@ -465,7 +465,7 @@ export declare const ensuring: {
  * repetitions, given by `base * factor.pow(n)`, where `n` is the number of
  * repetitions so far. Returns the current duration between recurrences.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const exponential: (base: Duration.DurationInput, factor?: number) => Schedule<never, unknown, Duration.Duration>;
@@ -474,7 +474,7 @@ export declare const exponential: (base: Duration.DurationInput, factor?: number
  * two delays (similar to the fibonacci sequence). Returns the current
  * duration between recurrences.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fibonacci: (one: Duration.DurationInput) => Schedule<never, unknown, Duration.Duration>;
@@ -490,21 +490,21 @@ export declare const fibonacci: (one: Duration.DurationInput) => Schedule<never,
  * |---------action--------||action|-----|action|-----------|
  * ```
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fixed: (interval: Duration.DurationInput) => Schedule<never, unknown, number>;
 /**
  * A schedule that always recurs, producing a count of repeats: 0, 1, 2.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const forever: Schedule<never, unknown, number>;
 /**
  * A schedule that recurs once with the specified delay.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromDelay: (delay: Duration.DurationInput) => Schedule<never, unknown, Duration.Duration>;
@@ -513,7 +513,7 @@ export declare const fromDelay: (delay: Duration.DurationInput) => Schedule<neve
  * each time for the length of the specified duration. Returns the length of
  * the current duration between recurrences.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromDelays: (delay: Duration.DurationInput, ...delays: Array<Duration.DurationInput>) => Schedule<never, unknown, Duration.Duration>;
@@ -521,7 +521,7 @@ export declare const fromDelays: (delay: Duration.DurationInput, ...delays: Arra
  * A schedule that always recurs, mapping input values through the specified
  * function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromFunction: <A, B>(f: (a: A) => B) => Schedule<never, A, B>;
@@ -531,14 +531,14 @@ export declare const fromFunction: <A, B>(f: (a: A) => B) => Schedule<never, A,
  *
  * NOTE: `hour` parameter is validated lazily. Must be in range 0...23.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const hourOfDay: (hour: number) => Schedule<never, unknown, number>;
 /**
  * A schedule that always recurs, which returns inputs as outputs.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const identity: <A>() => Schedule<never, A, A>;
@@ -546,7 +546,7 @@ export declare const identity: <A>() => Schedule<never, A, A>;
  * Returns a new schedule that performs a geometric intersection on the
  * intervals defined by both schedules.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const intersect: {
@@ -558,7 +558,7 @@ export declare const intersect: {
  * schedule, continuing as long as both schedules want to continue and merging
  * the next intervals according to the specified merge function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const intersectWith: {
@@ -574,7 +574,7 @@ export declare const intersectWith: {
  * The new interval size is between `min * old interval size` and `max * old
  * interval size`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const jittered: <Env, In, Out>(self: Schedule<Env, In, Out>) => Schedule<Env, In, Out>;
@@ -585,7 +585,7 @@ export declare const jittered: <Env, In, Out>(self: Schedule<Env, In, Out>) => S
  * The new interval size is between `min * old interval size` and `max * old
  * interval size`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const jitteredWith: {
@@ -603,7 +603,7 @@ export declare const jitteredWith: {
  * given by `base * n` where `n` is the number of repetitions so far. Returns
  * the current duration between recurrences.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const linear: (base: Duration.DurationInput) => Schedule<never, unknown, Duration.Duration>;
@@ -611,7 +611,7 @@ export declare const linear: (base: Duration.DurationInput) => Schedule<never, u
  * Returns a new schedule that maps the output of this schedule through the
  * specified function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const map: {
@@ -622,7 +622,7 @@ export declare const map: {
  * Returns a new schedule that maps the output of this schedule through the
  * specified effectful function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const mapEffect: {
@@ -636,7 +636,7 @@ export declare const mapEffect: {
  *
  * NOTE: `minute` parameter is validated lazily. Must be in range 0...59.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const minuteOfHour: (minute: number) => Schedule<never, unknown, number>;
@@ -644,7 +644,7 @@ export declare const minuteOfHour: (minute: number) => Schedule<never, unknown,
  * Returns a new schedule that modifies the delay using the specified
  * function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const modifyDelay: {
@@ -655,7 +655,7 @@ export declare const modifyDelay: {
  * Returns a new schedule that modifies the delay using the specified
  * effectual function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const modifyDelayEffect: {
@@ -667,7 +667,7 @@ export declare const modifyDelayEffect: {
  * effect for every decision of this schedule. This can be used to create
  * schedules that log failures, decisions, or computed values.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const onDecision: {
@@ -677,14 +677,14 @@ export declare const onDecision: {
 /**
  * A schedule that recurs one time.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const once: Schedule<never, unknown, void>;
 /**
  * Returns a new schedule that passes through the inputs of this schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const passthrough: <Env, Input, Output>(self: Schedule<Env, Input, Output>) => Schedule<Env, Input, Input>;
@@ -692,7 +692,7 @@ export declare const passthrough: <Env, Input, Output>(self: Schedule<Env, Input
  * Returns a new schedule with its context provided to it, so the
  * resulting schedule does not require any context.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category context
  */
 export declare const provideContext: {
@@ -704,7 +704,7 @@ export declare const provideContext: {
  * If the schedule requires multiple services use `provideContext`
  * instead.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category context
  */
 export declare const provideService: {
@@ -714,14 +714,14 @@ export declare const provideService: {
 /**
  * A schedule that recurs for until the predicate evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const recurUntil: <A>(f: Predicate<A>) => Schedule<never, A, A>;
 /**
  * A schedule that recurs for until the predicate evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const recurUntilEffect: <Env, A>(f: (a: A) => Effect.Effect<Env, never, boolean>) => Schedule<Env, A, A>;
@@ -729,21 +729,21 @@ export declare const recurUntilEffect: <Env, A>(f: (a: A) => Effect.Effect<Env,
  * A schedule that recurs for until the input value becomes applicable to
  * partial function and then map that value with given function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const recurUntilOption: <A, B>(pf: (a: A) => Option.Option<B>) => Schedule<never, A, Option.Option<B>>;
 /**
  * A schedule that recurs during the given duration.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const recurUpTo: (duration: Duration.DurationInput) => Schedule<never, unknown, Duration.Duration>;
 /**
  * A schedule that recurs for as long as the predicate evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const recurWhile: <A>(f: Predicate<A>) => Schedule<never, A, A>;
@@ -751,7 +751,7 @@ export declare const recurWhile: <A>(f: Predicate<A>) => Schedule<never, A, A>;
  * A schedule that recurs for as long as the effectful predicate evaluates to
  * true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const recurWhileEffect: <Env, A>(f: (a: A) => Effect.Effect<Env, never, boolean>) => Schedule<Env, A, A>;
@@ -760,13 +760,13 @@ export declare const recurWhileEffect: <Env, A>(f: (a: A) => Effect.Effect<Env,
  * number of times before it terminates.
  *
  * @category constructors
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const recurs: (n: number) => Schedule<never, unknown, number>;
 /**
  * Returns a new schedule that folds over the outputs of this one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduce: {
@@ -776,7 +776,7 @@ export declare const reduce: {
 /**
  * Returns a new schedule that effectfully folds over the outputs of this one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduceEffect: {
@@ -787,14 +787,14 @@ export declare const reduceEffect: {
  * Returns a new schedule that loops this one continuously, resetting the
  * state when this schedule is done.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const repeatForever: Schedule<never, unknown, number>;
 /**
  * Returns a new schedule that outputs the number of repetitions of this one.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const repetitions: <Env, In, Out>(self: Schedule<Env, In, Out>) => Schedule<Env, In, number>;
@@ -802,7 +802,7 @@ export declare const repetitions: <Env, In, Out>(self: Schedule<Env, In, Out>) =
  * Return a new schedule that automatically resets the schedule to its initial
  * state after some time of inactivity defined by `duration`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const resetAfter: {
@@ -813,7 +813,7 @@ export declare const resetAfter: {
  * Resets the schedule when the specified predicate on the schedule output
  * evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const resetWhen: {
@@ -823,7 +823,7 @@ export declare const resetWhen: {
 /**
  * Runs a schedule using the provided inputs, and collects all outputs.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const run: {
@@ -837,7 +837,7 @@ export declare const run: {
  *
  * NOTE: `second` parameter is validated lazily. Must be in range 0...59.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const secondOfMinute: (second: number) => Schedule<never, unknown, number>;
@@ -845,14 +845,14 @@ export declare const secondOfMinute: (second: number) => Schedule<never, unknown
  * Returns a schedule that recurs continuously, each repetition spaced the
  * specified duration from the last run.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const spaced: (duration: Duration.DurationInput) => Schedule<never, unknown, number>;
 /**
  * A schedule that does not recur, it just stops.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const stop: Schedule<never, unknown, void>;
@@ -860,7 +860,7 @@ export declare const stop: Schedule<never, unknown, void>;
  * Returns a schedule that repeats one time, producing the specified constant
  * value.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const succeed: <A>(value: A) => Schedule<never, unknown, A>;
@@ -869,14 +869,14 @@ export declare const succeed: <A>(value: A) => Schedule<never, unknown, A>;
  * value.
  *
  * @category constructors
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const sync: <A>(evaluate: LazyArg<A>) => Schedule<never, unknown, A>;
 /**
  * Returns a new schedule that effectfully processes every input to this
  * schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category sequencing
  */
 export declare const tapInput: {
@@ -887,7 +887,7 @@ export declare const tapInput: {
  * Returns a new schedule that effectfully processes every output from this
  * schedule.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category sequencing
  */
 export declare const tapOutput: {
@@ -898,7 +898,7 @@ export declare const tapOutput: {
  * Unfolds a schedule that repeats one time from the specified state and
  * iterator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const unfold: <A>(initial: A, f: (a: A) => A) => Schedule<never, unknown, A>;
@@ -906,7 +906,7 @@ export declare const unfold: <A>(initial: A, f: (a: A) => A) => Schedule<never,
  * Returns a new schedule that performs a geometric union on the intervals
  * defined by both schedules.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const union: {
@@ -918,7 +918,7 @@ export declare const union: {
  * schedule, continuing as long as either schedule wants to continue and
  * merging the next intervals according to the specified merge function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const unionWith: {
@@ -929,7 +929,7 @@ export declare const unionWith: {
  * Returns a new schedule that continues until the specified predicate on the
  * input evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const untilInput: {
@@ -940,7 +940,7 @@ export declare const untilInput: {
  * Returns a new schedule that continues until the specified effectful
  * predicate on the input evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const untilInputEffect: {
@@ -951,7 +951,7 @@ export declare const untilInputEffect: {
  * Returns a new schedule that continues until the specified predicate on the
  * output evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const untilOutput: {
@@ -962,7 +962,7 @@ export declare const untilOutput: {
  * Returns a new schedule that continues until the specified effectful
  * predicate on the output evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const untilOutputEffect: {
@@ -972,7 +972,7 @@ export declare const untilOutputEffect: {
 /**
  * A schedule that recurs during the given duration.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const upTo: {
@@ -983,7 +983,7 @@ export declare const upTo: {
  * Returns a new schedule that continues for as long the specified predicate
  * on the input evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const whileInput: {
@@ -994,7 +994,7 @@ export declare const whileInput: {
  * Returns a new schedule that continues for as long the specified effectful
  * predicate on the input evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const whileInputEffect: {
@@ -1005,7 +1005,7 @@ export declare const whileInputEffect: {
  * Returns a new schedule that continues for as long the specified predicate
  * on the output evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const whileOutput: {
@@ -1016,7 +1016,7 @@ export declare const whileOutput: {
  * Returns a new schedule that continues for as long the specified effectful
  * predicate on the output evaluates to true.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const whileOutputEffect: {
@@ -1036,14 +1036,14 @@ export declare const whileOutputEffect: {
  * |action------|sleep---|act|-sleep|action----|
  * ```
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const windowed: (interval: Duration.DurationInput) => Schedule<never, unknown, number>;
 /**
  * The same as `intersect` but ignores the right output.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category zipping
  */
 export declare const zipLeft: {
@@ -1053,7 +1053,7 @@ export declare const zipLeft: {
 /**
  * The same as `intersect` but ignores the left output.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category zipping
  */
 export declare const zipRight: {
@@ -1063,7 +1063,7 @@ export declare const zipRight: {
 /**
  * Equivalent to `intersect` followed by `map`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category zipping
  */
 export declare const zipWith: {