@bifravst/aws-cdk-lambda-helpers 4.0.96 → 5.0.1

package/dist/layers/baseLayer/nodejs/node_modules/fp-ts/es6/Strong.d.ts

@@ -0,0 +1,172 @@
+/**
+ * The `Strong` class extends `Profunctor` with combinators for working with product types.
+ *
+ * `first` and `second` lift values in a `Profunctor` to act on the first and second components of a tuple,
+ * respectively.
+ *
+ * Another way to think about Strong is to piggyback on the intuition of
+ * inputs and outputs.  Rewriting the type signature in this light then yields:
+ *
+ * ```purescript
+ * first ::  forall input output a. p input output -> p (Tuple input a) (Tuple output a)
+ * second :: forall input output a. p input output -> p (Tuple a input) (Tuple a output)
+ * ```
+ *
+ * If we specialize the profunctor p to the function arrow, we get the following type
+ * signatures, which may look a bit more familiar:
+ *
+ * ```purescript
+ * first ::  forall input output a. (input -> output) -> (Tuple input a) -> (Tuple output a)
+ * second :: forall input output a. (input -> output) -> (Tuple a input) -> (Tuple a output)
+ * ```
+ *
+ * So, when the `profunctor` is `Function` application, `first` essentially applies your function
+ * to the first element of a tuple, and `second` applies it to the second element (same as `map` would do).
+ *
+ * Adapted from https://github.com/purescript/purescript-profunctor/blob/master/src/Data/Profunctor/Strong.purs
+ *
+ * @since 2.0.0
+ */
+import { Category, Category2, Category3, Category4 } from './Category'
+import { HKT2, Kind2, Kind3, Kind4, URIS2, URIS3, URIS4 } from './HKT'
+import { Profunctor, Profunctor2, Profunctor3, Profunctor4 } from './Profunctor'
+/**
+ * @category model
+ * @since 2.0.0
+ */
+export interface Strong<F> extends Profunctor<F> {
+  readonly first: <A, B, C>(pab: HKT2<F, A, B>) => HKT2<F, [A, C], [B, C]>
+  readonly second: <A, B, C>(pab: HKT2<F, B, C>) => HKT2<F, [A, B], [A, C]>
+}
+/**
+ * @category model
+ * @since 2.0.0
+ */
+export interface Strong2<F extends URIS2> extends Profunctor2<F> {
+  readonly first: <A, B, C>(pab: Kind2<F, A, B>) => Kind2<F, [A, C], [B, C]>
+  readonly second: <A, B, C>(pab: Kind2<F, B, C>) => Kind2<F, [A, B], [A, C]>
+}
+/**
+ * @category model
+ * @since 2.0.0
+ */
+export interface Strong3<F extends URIS3> extends Profunctor3<F> {
+  readonly first: <R, A, B, C>(pab: Kind3<F, R, A, B>) => Kind3<F, R, [A, C], [B, C]>
+  readonly second: <R, A, B, C>(pab: Kind3<F, R, B, C>) => Kind3<F, R, [A, B], [A, C]>
+}
+/**
+ * @category model
+ * @since 2.0.0
+ */
+export interface Strong4<F extends URIS4> extends Profunctor4<F> {
+  readonly first: <S, R, A, B, C>(pab: Kind4<F, S, R, A, B>) => Kind4<F, S, R, [A, C], [B, C]>
+  readonly second: <S, R, A, B, C>(pab: Kind4<F, S, R, B, C>) => Kind4<F, S, R, [A, B], [A, C]>
+}
+/**
+ * Compose a value acting on a tuple from two values, each acting on one of the components of the tuple.
+ *
+ * Specializing `split` to function application would look like this:
+ *
+ * ```purescript
+ * split :: forall a b c d. (a -> b) -> (c -> d) -> (Tuple a c) -> (Tuple b d)
+ * ```
+ *
+ * We take two functions, `f` and `g`, and we transform them into a single function which takes a tuple and maps `f`
+ * over the first element and `g` over the second.  Just like `bi-map` would do for the `bi-functor` instance of tuple.
+ *
+ * @since 2.10.0
+ */
+export declare function split<F extends URIS4>(
+  S: Strong4<F>,
+  C: Category4<F>
+): <S, R, A, B, C, D>(pab: Kind4<F, S, R, A, B>, pcd: Kind4<F, S, R, C, D>) => Kind4<F, S, R, [A, C], [B, D]>
+export declare function split<F extends URIS3>(
+  S: Strong3<F>,
+  C: Category3<F>
+): <R, A, B, C, D>(pab: Kind3<F, R, A, B>, pcd: Kind3<F, R, C, D>) => Kind3<F, R, [A, C], [B, D]>
+export declare function split<F extends URIS2>(
+  S: Strong2<F>,
+  C: Category2<F>
+): <A, B, C, D>(pab: Kind2<F, A, B>, pcd: Kind2<F, C, D>) => Kind2<F, [A, C], [B, D]>
+export declare function split<F>(
+  S: Strong<F>,
+  C: Category<F>
+): <A, B, C, D>(pab: HKT2<F, A, B>, pcd: HKT2<F, C, D>) => HKT2<F, [A, C], [B, D]>
+/**
+ * Compose a value which introduces a tuple from two values, each introducing one side of the tuple.
+ *
+ * This combinator is useful when assembling values from smaller components, because it provides a way to support two
+ * different types of output.
+ *
+ * Specializing `fanOut` to function application would look like this:
+ *
+ * ```purescript
+ * fanOut :: forall a b c. (a -> b) -> (a -> c) -> (a -> (Tuple b c))
+ * ```
+ *
+ * We take two functions, `f` and `g`, with the same parameter type and we transform them into a single function which
+ * takes one parameter and returns a tuple of the results of running `f` and `g` on the parameter, respectively.  This
+ * allows us to run two parallel computations on the same input and return both results in a tuple.
+ *
+ * @since 2.10.0
+ */
+export declare function fanOut<F extends URIS4>(
+  S: Strong4<F>,
+  C: Category4<F>
+): <S, R, A, B, C>(pab: Kind4<F, S, R, A, B>, pac: Kind4<F, S, R, A, C>) => Kind4<F, S, R, A, [B, C]>
+export declare function fanOut<F extends URIS3>(
+  S: Strong3<F>,
+  C: Category3<F>
+): <R, A, B, C>(pab: Kind3<F, R, A, B>, pac: Kind3<F, R, A, C>) => Kind3<F, R, A, [B, C]>
+export declare function fanOut<F extends URIS2>(
+  S: Strong2<F>,
+  C: Category2<F>
+): <A, B, C>(pab: Kind2<F, A, B>, pac: Kind2<F, A, C>) => Kind2<F, A, [B, C]>
+export declare function fanOut<F>(
+  S: Strong<F>,
+  C: Category<F>
+): <A, B, C>(pab: HKT2<F, A, B>, pac: HKT2<F, A, C>) => HKT2<F, A, [B, C]>
+/**
+ * Use [`split`](#split) instead.
+ *
+ * @category zone of death
+ * @since 2.0.0
+ * @deprecated
+ */
+export declare function splitStrong<F extends URIS4>(
+  F: Category4<F> & Strong4<F>
+): <S, R, A, B, C, D>(pab: Kind4<F, S, R, A, B>, pcd: Kind4<F, S, R, C, D>) => Kind4<F, S, R, [A, C], [B, D]>
+/** @deprecated */
+export declare function splitStrong<F extends URIS3>(
+  F: Category3<F> & Strong3<F>
+): <R, A, B, C, D>(pab: Kind3<F, R, A, B>, pcd: Kind3<F, R, C, D>) => Kind3<F, R, [A, C], [B, D]>
+/** @deprecated */
+export declare function splitStrong<F extends URIS2>(
+  F: Category2<F> & Strong2<F>
+): <A, B, C, D>(pab: Kind2<F, A, B>, pcd: Kind2<F, C, D>) => Kind2<F, [A, C], [B, D]>
+/** @deprecated */
+export declare function splitStrong<F>(
+  F: Category<F> & Strong<F>
+): <A, B, C, D>(pab: HKT2<F, A, B>, pcd: HKT2<F, C, D>) => HKT2<F, [A, C], [B, D]>
+/**
+ * Use [`fanOut`](#fanout) instead.
+ *
+ * @category zone of death
+ * @since 2.0.0
+ * @deprecated
+ */
+export declare function fanout<F extends URIS4>(
+  F: Category4<F> & Strong4<F>
+): <S, R, A, B, C>(pab: Kind4<F, S, R, A, B>, pac: Kind4<F, S, R, A, C>) => Kind4<F, S, R, A, [B, C]>
+/** @deprecated */
+export declare function fanout<F extends URIS3>(
+  F: Category3<F> & Strong3<F>
+): <R, A, B, C>(pab: Kind3<F, R, A, B>, pac: Kind3<F, R, A, C>) => Kind3<F, R, A, [B, C]>
+/** @deprecated */
+export declare function fanout<F extends URIS2>(
+  F: Category2<F> & Strong2<F>
+): <A, B, C>(pab: Kind2<F, A, B>, pac: Kind2<F, A, C>) => Kind2<F, A, [B, C]>
+/** @deprecated */
+export declare function fanout<F>(
+  F: Category<F> & Strong<F>
+): <A, B, C>(pab: HKT2<F, A, B>, pac: HKT2<F, A, C>) => HKT2<F, A, [B, C]>

package/dist/layers/baseLayer/nodejs/node_modules/fp-ts/es6/Strong.js

@@ -0,0 +1,18 @@
+import { identity } from './function';
+export function split(S, C) {
+    return function (pab, pcd) {
+        return C.compose(S.second(pcd), S.first(pab));
+    };
+}
+export function fanOut(S, C) {
+    var splitSC = split(S, C);
+    return function (pab, pac) {
+        return C.compose(splitSC(pab, pac), S.promap(C.id(), identity, function (a) { return [a, a]; }));
+    };
+}
+export function splitStrong(F) {
+    return split(F, F);
+}
+export function fanout(F) {
+    return fanOut(F, F);
+}

package/dist/layers/baseLayer/nodejs/node_modules/fp-ts/es6/Task.d.ts

@@ -0,0 +1,500 @@
+/**
+ * ```ts
+ * interface Task<A> {
+ *   (): Promise<A>
+ * }
+ * ```
+ *
+ * `Task<A>` represents an asynchronous computation that yields a value of type `A` and **never fails**.
+ * If you want to represent an asynchronous computation that may fail, please see `TaskEither`.
+ *
+ * @since 2.0.0
+ */
+import { Applicative1 } from './Applicative'
+import { Apply1 } from './Apply'
+import * as chainable from './Chain'
+import { FromIO1 } from './FromIO'
+import { FromTask1 } from './FromTask'
+import { Functor1 } from './Functor'
+import { IO } from './IO'
+import { Monad1 } from './Monad'
+import { MonadIO1 } from './MonadIO'
+import { MonadTask1 } from './MonadTask'
+import { Monoid } from './Monoid'
+import { Pointed1 } from './Pointed'
+import { ReadonlyNonEmptyArray } from './ReadonlyNonEmptyArray'
+import { Semigroup } from './Semigroup'
+/**
+ * @category model
+ * @since 2.0.0
+ */
+export interface Task<A> {
+  (): Promise<A>
+}
+/**
+ * @category conversions
+ * @since 2.0.0
+ */
+export declare const fromIO: <A>(fa: IO<A>) => Task<A>
+/**
+ * Creates a task that will complete after a time delay
+ *
+ * @example
+ * import { sequenceT } from 'fp-ts/Apply'
+ * import * as T from 'fp-ts/Task'
+ * import { takeRight } from 'fp-ts/Array'
+ *
+ * async function test() {
+ *   const log: Array<string> = []
+ *   const append = (message: string): T.Task<void> =>
+ *     T.fromIO(() => {
+ *       log.push(message)
+ *     })
+ *   const fa = append('a')
+ *   const fb = T.delay(20)(append('b'))
+ *   const fc = T.delay(10)(append('c'))
+ *   const fd = append('d')
+ *   await sequenceT(T.ApplyPar)(fa, fb, fc, fd)()
+ *   assert.deepStrictEqual(takeRight(2)(log), ['c', 'b'])
+ * }
+ *
+ * test()
+ *
+ * @since 2.0.0
+ */
+export declare function delay(millis: number): <A>(ma: Task<A>) => Task<A>
+/**
+ * `map` can be used to turn functions `(a: A) => B` into functions `(fa: F<A>) => F<B>` whose argument and return types
+ * use the type constructor `F` to represent some computational context.
+ *
+ * @category mapping
+ * @since 2.0.0
+ */
+export declare const map: <A, B>(f: (a: A) => B) => (fa: Task<A>) => Task<B>
+/**
+ * @since 2.0.0
+ */
+export declare const ap: <A>(fa: Task<A>) => <B>(fab: Task<(a: A) => B>) => Task<B>
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+export declare const of: <A>(a: A) => Task<A>
+/**
+ * @category sequencing
+ * @since 2.14.0
+ */
+export declare const flatMap: {
+  <A, B>(f: (a: A) => Task<B>): (ma: Task<A>) => Task<B>
+  <A, B>(ma: Task<A>, f: (a: A) => Task<B>): Task<B>
+}
+/**
+ * @category sequencing
+ * @since 2.0.0
+ */
+export declare const flatten: <A>(mma: Task<Task<A>>) => Task<A>
+/**
+ * @category type lambdas
+ * @since 2.0.0
+ */
+export declare const URI = 'Task'
+/**
+ * @category type lambdas
+ * @since 2.0.0
+ */
+export type URI = typeof URI
+declare module './HKT' {
+  interface URItoKind<A> {
+    readonly [URI]: Task<A>
+  }
+}
+/**
+ * Monoid returning the first completed task.
+ *
+ * Note: uses `Promise.race` internally.
+ *
+ * @example
+ * import * as T from 'fp-ts/Task'
+ *
+ * async function test() {
+ *   const S = T.getRaceMonoid<string>()
+ *   const fa = T.delay(20)(T.of('a'))
+ *   const fb = T.delay(10)(T.of('b'))
+ *   assert.deepStrictEqual(await S.concat(fa, fb)(), 'b')
+ * }
+ *
+ * test()
+ *
+ * @category instances
+ * @since 2.0.0
+ */
+export declare function getRaceMonoid<A = never>(): Monoid<Task<A>>
+/**
+ * @category instances
+ * @since 2.7.0
+ */
+export declare const Functor: Functor1<URI>
+/**
+ * Maps the value to the specified constant value.
+ *
+ * @category mapping
+ * @since 2.16.0
+ */
+export declare const as: {
+  <A>(a: A): <_>(self: Task<_>) => Task<A>
+  <_, A>(self: Task<_>, a: A): Task<A>
+}
+/**
+ * Maps the value to the void constant value.
+ *
+ * @category mapping
+ * @since 2.16.0
+ */
+export declare const asUnit: <_>(self: Task<_>) => Task<void>
+/**
+ * @category mapping
+ * @since 2.10.0
+ */
+export declare const flap: <A>(
+  a: A
+) => <B>(fab: import('./HKT').Kind<'Task', (a: A) => B>) => import('./HKT').Kind<'Task', B>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const Pointed: Pointed1<URI>
+/**
+ * Runs computations in parallel.
+ *
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const ApplyPar: Apply1<URI>
+/**
+ * Combine two effectful actions, keeping only the result of the first.
+ *
+ * @since 2.0.0
+ */
+export declare const apFirst: <B>(
+  second: Task<B>
+) => <A>(first: import('./HKT').Kind<'Task', A>) => import('./HKT').Kind<'Task', A>
+/**
+ * Combine two effectful actions, keeping only the result of the second.
+ *
+ * @since 2.0.0
+ */
+export declare const apSecond: <B>(
+  second: Task<B>
+) => <A>(first: import('./HKT').Kind<'Task', A>) => import('./HKT').Kind<'Task', B>
+/**
+ * Runs computations in parallel.
+ *
+ * @category instances
+ * @since 2.7.0
+ */
+export declare const ApplicativePar: Applicative1<URI>
+/**
+ * Runs computations sequentially.
+ *
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const ApplySeq: Apply1<URI>
+/**
+ * Runs computations sequentially.
+ *
+ * @category instances
+ * @since 2.7.0
+ */
+export declare const ApplicativeSeq: Applicative1<URI>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const Chain: chainable.Chain1<URI>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const Monad: Monad1<URI>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const MonadIO: MonadIO1<URI>
+/**
+ * @category zone of death
+ * @since 2.7.0
+ * @deprecated
+ */
+export declare const fromTask: <A>(fa: Task<A>) => Task<A>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const MonadTask: MonadTask1<URI>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const FromIO: FromIO1<URI>
+/**
+ * @category sequencing
+ * @since 2.16.0
+ */
+export declare const flatMapIO: {
+  <A, B>(f: (a: A) => IO<B>): (self: Task<A>) => Task<B>
+  <A, B>(self: Task<A>, f: (a: A) => IO<B>): Task<B>
+}
+/**
+ * Composes computations in sequence, using the return value of one computation to determine the next computation and
+ * keeping only the result of the first.
+ *
+ * @category combinators
+ * @since 2.15.0
+ */
+export declare const tap: {
+  <A, _>(self: Task<A>, f: (a: A) => Task<_>): Task<A>
+  <A, _>(f: (a: A) => Task<_>): (self: Task<A>) => Task<A>
+}
+/**
+ * Composes computations in sequence, using the return value of one computation to determine the next computation and
+ * keeping only the result of the first.
+ *
+ * @example
+ * import { pipe } from 'fp-ts/function'
+ * import * as T from 'fp-ts/Task'
+ * import * as Console from 'fp-ts/Console'
+ *
+ * // Will produce `Hello, fp-ts` to the stdout
+ * const effect = pipe(
+ *   T.of('fp-ts'),
+ *   T.tapIO((value) => Console.log(`Hello, ${value}`)),
+ * )
+ *
+ * async function test() {
+ *   assert.deepStrictEqual(await effect(), 'fp-ts')
+ * }
+ *
+ * test()
+ *
+ * @category combinators
+ * @since 2.16.0
+ */
+export declare const tapIO: {
+  <A, _>(f: (a: A) => IO<_>): (self: Task<A>) => Task<A>
+  <A, _>(self: Task<A>, f: (a: A) => IO<_>): Task<A>
+}
+/**
+ * @category lifting
+ * @since 2.4.0
+ */
+export declare const fromIOK: <A extends ReadonlyArray<unknown>, B>(f: (...a: A) => IO<B>) => (...a: A) => Task<B>
+/**
+ * Alias of `flatMapIO`.
+ *
+ * @category legacy
+ * @since 2.4.0
+ */
+export declare const chainIOK: <A, B>(f: (a: A) => IO<B>) => (first: Task<A>) => Task<B>
+/**
+ * Alias of `tapIO`.
+ *
+ * @category legacy
+ * @since 2.10.0
+ */
+export declare const chainFirstIOK: <A, B>(f: (a: A) => IO<B>) => (first: Task<A>) => Task<A>
+/**
+ * @category instances
+ * @since 2.10.0
+ */
+export declare const FromTask: FromTask1<URI>
+/**
+ * A `Task` that never completes.
+ *
+ * @since 2.0.0
+ */
+export declare const never: Task<never>
+/**
+ * @category do notation
+ * @since 2.9.0
+ */
+export declare const Do: Task<{}>
+/**
+ * @category do notation
+ * @since 2.8.0
+ */
+export declare const bindTo: <N extends string>(
+  name: N
+) => <A>(fa: import('./HKT').Kind<'Task', A>) => import('./HKT').Kind<'Task', { readonly [K in N]: A }>
+declare const let_: <N extends string, A, B>(
+  name: Exclude<N, keyof A>,
+  f: (a: A) => B
+) => (
+  fa: import('./HKT').Kind<'Task', A>
+) => import('./HKT').Kind<'Task', { readonly [K in keyof A | N]: K extends keyof A ? A[K] : B }>
+export {
+  /**
+   * @category do notation
+   * @since 2.13.0
+   */
+  let_ as let
+}
+/**
+ * @category do notation
+ * @since 2.8.0
+ */
+export declare const bind: <N extends string, A, B>(
+  name: Exclude<N, keyof A>,
+  f: (a: A) => import('./HKT').Kind<'Task', B>
+) => (
+  ma: import('./HKT').Kind<'Task', A>
+) => import('./HKT').Kind<'Task', { readonly [K in keyof A | N]: K extends keyof A ? A[K] : B }>
+/**
+ * @category do notation
+ * @since 2.8.0
+ */
+export declare const apS: <N extends string, A, B>(
+  name: Exclude<N, keyof A>,
+  fb: Task<B>
+) => (
+  fa: import('./HKT').Kind<'Task', A>
+) => import('./HKT').Kind<'Task', { readonly [K in keyof A | N]: K extends keyof A ? A[K] : B }>
+/**
+ * @since 2.11.0
+ */
+export declare const ApT: Task<readonly []>
+/**
+ * Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(ApplicativePar)`.
+ *
+ * @category traversing
+ * @since 2.11.0
+ */
+export declare const traverseReadonlyNonEmptyArrayWithIndex: <A, B>(
+  f: (index: number, a: A) => Task<B>
+) => (as: ReadonlyNonEmptyArray<A>) => Task<ReadonlyNonEmptyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#traverseWithIndex(ApplicativePar)`.
+ *
+ * @category traversing
+ * @since 2.11.0
+ */
+export declare const traverseReadonlyArrayWithIndex: <A, B>(
+  f: (index: number, a: A) => Task<B>
+) => (as: ReadonlyArray<A>) => Task<ReadonlyArray<B>>
+/**
+ * Equivalent to `ReadonlyNonEmptyArray#traverseWithIndex(ApplicativeSeq)`.
+ *
+ * @category traversing
+ * @since 2.11.0
+ */
+export declare const traverseReadonlyNonEmptyArrayWithIndexSeq: <A, B>(
+  f: (index: number, a: A) => Task<B>
+) => (as: ReadonlyNonEmptyArray<A>) => Task<ReadonlyNonEmptyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#traverseWithIndex(ApplicativeSeq)`.
+ *
+ * @category traversing
+ * @since 2.11.0
+ */
+export declare const traverseReadonlyArrayWithIndexSeq: <A, B>(
+  f: (index: number, a: A) => Task<B>
+) => (as: ReadonlyArray<A>) => Task<ReadonlyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#traverseWithIndex(Applicative)`.
+ *
+ * @category traversing
+ * @since 2.9.0
+ */
+export declare const traverseArrayWithIndex: <A, B>(
+  f: (index: number, a: A) => Task<B>
+) => (as: ReadonlyArray<A>) => Task<ReadonlyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#traverse(Applicative)`.
+ *
+ * @category traversing
+ * @since 2.9.0
+ */
+export declare const traverseArray: <A, B>(f: (a: A) => Task<B>) => (as: ReadonlyArray<A>) => Task<ReadonlyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#sequence(Applicative)`.
+ *
+ * @category traversing
+ * @since 2.9.0
+ */
+export declare const sequenceArray: <A>(arr: ReadonlyArray<Task<A>>) => Task<ReadonlyArray<A>>
+/**
+ * Equivalent to `ReadonlyArray#traverseWithIndex(ApplicativeSeq)`.
+ *
+ * @category traversing
+ * @since 2.9.0
+ */
+export declare const traverseSeqArrayWithIndex: <A, B>(
+  f: (index: number, a: A) => Task<B>
+) => (as: ReadonlyArray<A>) => Task<ReadonlyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#traverse(ApplicativeSeq)`.
+ *
+ * @category traversing
+ * @since 2.9.0
+ */
+export declare const traverseSeqArray: <A, B>(f: (a: A) => Task<B>) => (as: ReadonlyArray<A>) => Task<ReadonlyArray<B>>
+/**
+ * Equivalent to `ReadonlyArray#sequence(ApplicativeSeq)`.
+ *
+ * @category traversing
+ * @since 2.9.0
+ */
+export declare const sequenceSeqArray: <A>(arr: ReadonlyArray<Task<A>>) => Task<ReadonlyArray<A>>
+/**
+ * Alias of `flatMap`.
+ *
+ * @category legacy
+ * @since 2.0.0
+ */
+export declare const chain: <A, B>(f: (a: A) => Task<B>) => (ma: Task<A>) => Task<B>
+/**
+ * Alias of `tap`.
+ *
+ * @category legacy
+ * @since 2.0.0
+ */
+export declare const chainFirst: <A, B>(f: (a: A) => Task<B>) => (first: Task<A>) => Task<A>
+/**
+ * This instance is deprecated, use small, specific instances instead.
+ * For example if a function needs a `Functor` instance, pass `T.Functor` instead of `T.task`
+ * (where `T` is from `import T from 'fp-ts/Task'`)
+ *
+ * @category zone of death
+ * @since 2.0.0
+ * @deprecated
+ */
+export declare const task: Monad1<URI> & MonadTask1<URI>
+/**
+ * This instance is deprecated, use small, specific instances instead.
+ * For example if a function needs a `Functor` instance, pass `T.Functor` instead of `T.taskSeq`
+ * (where `T` is from `import T from 'fp-ts/Task'`)
+ *
+ * @category zone of death
+ * @since 2.0.0
+ * @deprecated
+ */
+export declare const taskSeq: Monad1<URI> & MonadTask1<URI>
+/**
+ * Use [`getApplySemigroup`](./Apply.ts.html#getapplysemigroup) instead.
+ *
+ * @category zone of death
+ * @since 2.0.0
+ * @deprecated
+ */
+export declare const getSemigroup: <A>(S: Semigroup<A>) => Semigroup<Task<A>>
+/**
+ * Use [`getApplicativeMonoid`](./Applicative.ts.html#getapplicativemonoid) instead.
+ *
+ * Lift a monoid into 'Task', the inner values are concatenated using the provided `Monoid`.
+ *
+ * @category zone of death
+ * @since 2.0.0
+ * @deprecated
+ */
+export declare const getMonoid: <A>(M: Monoid<A>) => Monoid<Task<A>>