Erster Docker-Stand
This commit is contained in:
660
_node_modules/effect/dist/dts/Function.d.ts
generated
vendored
Normal file
660
_node_modules/effect/dist/dts/Function.d.ts
generated
vendored
Normal file
@@ -0,0 +1,660 @@
|
||||
/**
|
||||
* @since 2.0.0
|
||||
*/
|
||||
import type { TypeLambda } from "./HKT.js";
|
||||
/**
|
||||
* @category type lambdas
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export interface FunctionTypeLambda extends TypeLambda {
|
||||
readonly type: (a: this["In"]) => this["Target"];
|
||||
}
|
||||
/**
|
||||
* Tests if a value is a `function`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { isFunction } from "effect/Predicate"
|
||||
*
|
||||
* assert.deepStrictEqual(isFunction(isFunction), true)
|
||||
* assert.deepStrictEqual(isFunction("function"), false)
|
||||
* ```
|
||||
*
|
||||
* @category guards
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const isFunction: (input: unknown) => input is Function;
|
||||
/**
|
||||
* Creates a function that can be used in a data-last (aka `pipe`able) or
|
||||
* data-first style.
|
||||
*
|
||||
* The first parameter to `dual` is either the arity of the uncurried function
|
||||
* or a predicate that determines if the function is being used in a data-first
|
||||
* or data-last style.
|
||||
*
|
||||
* Using the arity is the most common use case, but there are some cases where
|
||||
* you may want to use a predicate. For example, if you have a function that
|
||||
* takes an optional argument, you can use a predicate to determine if the
|
||||
* function is being used in a data-first or data-last style.
|
||||
*
|
||||
* You can pass either the arity of the uncurried function or a predicate
|
||||
* which determines if the function is being used in a data-first or
|
||||
* data-last style.
|
||||
*
|
||||
* **Example** (Using arity to determine data-first or data-last style)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum = dual<
|
||||
* (that: number) => (self: number) => number,
|
||||
* (self: number, that: number) => number
|
||||
* >(2, (self, that) => self + that)
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* **Example** (Using call signatures to define the overloads)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum: {
|
||||
* (that: number): (self: number) => number
|
||||
* (self: number, that: number): number
|
||||
* } = dual(2, (self: number, that: number): number => self + that)
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* **Example** (Using a predicate to determine data-first or data-last style)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum = dual<
|
||||
* (that: number) => (self: number) => number,
|
||||
* (self: number, that: number) => number
|
||||
* >(
|
||||
* (args) => args.length === 2,
|
||||
* (self, that) => self + that
|
||||
* )
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const dual: {
|
||||
/**
|
||||
* Creates a function that can be used in a data-last (aka `pipe`able) or
|
||||
* data-first style.
|
||||
*
|
||||
* The first parameter to `dual` is either the arity of the uncurried function
|
||||
* or a predicate that determines if the function is being used in a data-first
|
||||
* or data-last style.
|
||||
*
|
||||
* Using the arity is the most common use case, but there are some cases where
|
||||
* you may want to use a predicate. For example, if you have a function that
|
||||
* takes an optional argument, you can use a predicate to determine if the
|
||||
* function is being used in a data-first or data-last style.
|
||||
*
|
||||
* You can pass either the arity of the uncurried function or a predicate
|
||||
* which determines if the function is being used in a data-first or
|
||||
* data-last style.
|
||||
*
|
||||
* **Example** (Using arity to determine data-first or data-last style)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum = dual<
|
||||
* (that: number) => (self: number) => number,
|
||||
* (self: number, that: number) => number
|
||||
* >(2, (self, that) => self + that)
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* **Example** (Using call signatures to define the overloads)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum: {
|
||||
* (that: number): (self: number) => number
|
||||
* (self: number, that: number): number
|
||||
* } = dual(2, (self: number, that: number): number => self + that)
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* **Example** (Using a predicate to determine data-first or data-last style)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum = dual<
|
||||
* (that: number) => (self: number) => number,
|
||||
* (self: number, that: number) => number
|
||||
* >(
|
||||
* (args) => args.length === 2,
|
||||
* (self, that) => self + that
|
||||
* )
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
<DataLast extends (...args: Array<any>) => any, DataFirst extends (...args: Array<any>) => any>(arity: Parameters<DataFirst>["length"], body: DataFirst): DataLast & DataFirst;
|
||||
/**
|
||||
* Creates a function that can be used in a data-last (aka `pipe`able) or
|
||||
* data-first style.
|
||||
*
|
||||
* The first parameter to `dual` is either the arity of the uncurried function
|
||||
* or a predicate that determines if the function is being used in a data-first
|
||||
* or data-last style.
|
||||
*
|
||||
* Using the arity is the most common use case, but there are some cases where
|
||||
* you may want to use a predicate. For example, if you have a function that
|
||||
* takes an optional argument, you can use a predicate to determine if the
|
||||
* function is being used in a data-first or data-last style.
|
||||
*
|
||||
* You can pass either the arity of the uncurried function or a predicate
|
||||
* which determines if the function is being used in a data-first or
|
||||
* data-last style.
|
||||
*
|
||||
* **Example** (Using arity to determine data-first or data-last style)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum = dual<
|
||||
* (that: number) => (self: number) => number,
|
||||
* (self: number, that: number) => number
|
||||
* >(2, (self, that) => self + that)
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* **Example** (Using call signatures to define the overloads)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum: {
|
||||
* (that: number): (self: number) => number
|
||||
* (self: number, that: number): number
|
||||
* } = dual(2, (self: number, that: number): number => self + that)
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* **Example** (Using a predicate to determine data-first or data-last style)
|
||||
*
|
||||
* ```ts
|
||||
* import { dual, pipe } from "effect/Function"
|
||||
*
|
||||
* const sum = dual<
|
||||
* (that: number) => (self: number) => number,
|
||||
* (self: number, that: number) => number
|
||||
* >(
|
||||
* (args) => args.length === 2,
|
||||
* (self, that) => self + that
|
||||
* )
|
||||
*
|
||||
* console.log(sum(2, 3)) // 5
|
||||
* console.log(pipe(2, sum(3))) // 5
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
<DataLast extends (...args: Array<any>) => any, DataFirst extends (...args: Array<any>) => any>(isDataFirst: (args: IArguments) => boolean, body: DataFirst): DataLast & DataFirst;
|
||||
};
|
||||
/**
|
||||
* Apply a function to given values.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { pipe, apply } from "effect/Function"
|
||||
* import { length } from "effect/String"
|
||||
*
|
||||
* assert.deepStrictEqual(pipe(length, apply("hello")), 5)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const apply: <A extends ReadonlyArray<unknown>>(...a: A) => <B>(self: (...a: A) => B) => B;
|
||||
/**
|
||||
* A lazy argument.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { LazyArg, constant } from "effect/Function"
|
||||
*
|
||||
* const constNull: LazyArg<null> = constant(null)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export interface LazyArg<A> {
|
||||
(): A;
|
||||
}
|
||||
/**
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { FunctionN } from "effect/Function"
|
||||
*
|
||||
* const sum: FunctionN<[number, number], number> = (a, b) => a + b
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export interface FunctionN<A extends ReadonlyArray<unknown>, B> {
|
||||
(...args: A): B;
|
||||
}
|
||||
/**
|
||||
* The identity function, i.e. A function that returns its input argument.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { identity } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(identity(5), 5)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const identity: <A>(a: A) => A;
|
||||
/**
|
||||
* A function that ensures that the type of an expression matches some type,
|
||||
* without changing the resulting type of that expression.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { satisfies } from "effect/Function"
|
||||
*
|
||||
* const test1 = satisfies<number>()(5 as const)
|
||||
* //^? const test: 5
|
||||
* // @ts-expect-error
|
||||
* const test2 = satisfies<string>()(5)
|
||||
* //^? Argument of type 'number' is not assignable to parameter of type 'string'
|
||||
*
|
||||
* assert.deepStrictEqual(satisfies<number>()(5), 5)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const satisfies: <A>() => <B extends A>(b: B) => B;
|
||||
/**
|
||||
* Casts the result to the specified type.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { unsafeCoerce, identity } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(unsafeCoerce, identity)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const unsafeCoerce: <A, B>(a: A) => B;
|
||||
/**
|
||||
* Creates a constant value that never changes.
|
||||
*
|
||||
* This is useful when you want to pass a value to a higher-order function (a function that takes another function as its argument)
|
||||
* and want that inner function to always use the same value, no matter how many times it is called.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { constant } from "effect/Function"
|
||||
*
|
||||
* const constNull = constant(null)
|
||||
*
|
||||
* assert.deepStrictEqual(constNull(), null)
|
||||
* assert.deepStrictEqual(constNull(), null)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const constant: <A>(value: A) => LazyArg<A>;
|
||||
/**
|
||||
* A thunk that returns always `true`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { constTrue } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(constTrue(), true)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const constTrue: LazyArg<boolean>;
|
||||
/**
|
||||
* A thunk that returns always `false`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { constFalse } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(constFalse(), false)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const constFalse: LazyArg<boolean>;
|
||||
/**
|
||||
* A thunk that returns always `null`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { constNull } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(constNull(), null)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const constNull: LazyArg<null>;
|
||||
/**
|
||||
* A thunk that returns always `undefined`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { constUndefined } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(constUndefined(), undefined)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const constUndefined: LazyArg<undefined>;
|
||||
/**
|
||||
* A thunk that returns always `void`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { constVoid } from "effect/Function"
|
||||
*
|
||||
* assert.deepStrictEqual(constVoid(), undefined)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const constVoid: LazyArg<void>;
|
||||
/**
|
||||
* Reverses the order of arguments for a curried function.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { flip } from "effect/Function"
|
||||
*
|
||||
* const f = (a: number) => (b: string) => a - b.length
|
||||
*
|
||||
* assert.deepStrictEqual(flip(f)('aaa')(2), -1)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const flip: <A extends Array<unknown>, B extends Array<unknown>, C>(f: (...a: A) => (...b: B) => C) => (...b: B) => (...a: A) => C;
|
||||
/**
|
||||
* Composes two functions, `ab` and `bc` into a single function that takes in an argument `a` of type `A` and returns a result of type `C`.
|
||||
* The result is obtained by first applying the `ab` function to `a` and then applying the `bc` function to the result of `ab`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { compose } from "effect/Function"
|
||||
*
|
||||
* const increment = (n: number) => n + 1;
|
||||
* const square = (n: number) => n * n;
|
||||
*
|
||||
* assert.strictEqual(compose(increment, square)(2), 9);
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const compose: {
|
||||
/**
|
||||
* Composes two functions, `ab` and `bc` into a single function that takes in an argument `a` of type `A` and returns a result of type `C`.
|
||||
* The result is obtained by first applying the `ab` function to `a` and then applying the `bc` function to the result of `ab`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { compose } from "effect/Function"
|
||||
*
|
||||
* const increment = (n: number) => n + 1;
|
||||
* const square = (n: number) => n * n;
|
||||
*
|
||||
* assert.strictEqual(compose(increment, square)(2), 9);
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
<B, C>(bc: (b: B) => C): <A>(self: (a: A) => B) => (a: A) => C;
|
||||
/**
|
||||
* Composes two functions, `ab` and `bc` into a single function that takes in an argument `a` of type `A` and returns a result of type `C`.
|
||||
* The result is obtained by first applying the `ab` function to `a` and then applying the `bc` function to the result of `ab`.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { compose } from "effect/Function"
|
||||
*
|
||||
* const increment = (n: number) => n + 1;
|
||||
* const square = (n: number) => n * n;
|
||||
*
|
||||
* assert.strictEqual(compose(increment, square)(2), 9);
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
<A, B, C>(self: (a: A) => B, bc: (b: B) => C): (a: A) => C;
|
||||
};
|
||||
/**
|
||||
* The `absurd` function is a stub for cases where a value of type `never` is encountered in your code,
|
||||
* meaning that it should be impossible for this code to be executed.
|
||||
*
|
||||
* This function is particularly useful when it's necessary to specify that certain cases are impossible.
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const absurd: <A>(_: never) => A;
|
||||
/**
|
||||
* Creates a version of this function: instead of `n` arguments, it accepts a single tuple argument.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { tupled } from "effect/Function"
|
||||
*
|
||||
* const sumTupled = tupled((x: number, y: number): number => x + y)
|
||||
*
|
||||
* assert.deepStrictEqual(sumTupled([1, 2]), 3)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const tupled: <A extends ReadonlyArray<unknown>, B>(f: (...a: A) => B) => (a: A) => B;
|
||||
/**
|
||||
* Inverse function of `tupled`
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { untupled } from "effect/Function"
|
||||
*
|
||||
* const getFirst = untupled(<A, B>(tuple: [A, B]): A => tuple[0])
|
||||
*
|
||||
* assert.deepStrictEqual(getFirst(1, 2), 1)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const untupled: <A extends ReadonlyArray<unknown>, B>(f: (a: A) => B) => (...a: A) => B;
|
||||
/**
|
||||
* Pipes the value of an expression into a pipeline of functions.
|
||||
*
|
||||
* **Details**
|
||||
*
|
||||
* The `pipe` function is a utility that allows us to compose functions in a
|
||||
* readable and sequential manner. It takes the output of one function and
|
||||
* passes it as the input to the next function in the pipeline. This enables us
|
||||
* to build complex transformations by chaining multiple functions together.
|
||||
*
|
||||
* ```ts skip-type-checking
|
||||
* import { pipe } from "effect"
|
||||
*
|
||||
* const result = pipe(input, func1, func2, ..., funcN)
|
||||
* ```
|
||||
*
|
||||
* In this syntax, `input` is the initial value, and `func1`, `func2`, ...,
|
||||
* `funcN` are the functions to be applied in sequence. The result of each
|
||||
* function becomes the input for the next function, and the final result is
|
||||
* returned.
|
||||
*
|
||||
* Here's an illustration of how `pipe` works:
|
||||
*
|
||||
* ```
|
||||
* ┌───────┐ ┌───────┐ ┌───────┐ ┌───────┐ ┌───────┐ ┌────────┐
|
||||
* │ input │───►│ func1 │───►│ func2 │───►│ ... │───►│ funcN │───►│ result │
|
||||
* └───────┘ └───────┘ └───────┘ └───────┘ └───────┘ └────────┘
|
||||
* ```
|
||||
*
|
||||
* It's important to note that functions passed to `pipe` must have a **single
|
||||
* argument** because they are only called with a single argument.
|
||||
*
|
||||
* **When to Use**
|
||||
*
|
||||
* This is useful in combination with data-last functions as a simulation of
|
||||
* methods:
|
||||
*
|
||||
* ```ts skip-type-checking
|
||||
* as.map(f).filter(g)
|
||||
* ```
|
||||
*
|
||||
* becomes:
|
||||
*
|
||||
* ```ts skip-type-checking
|
||||
* import { pipe, Array } from "effect"
|
||||
*
|
||||
* pipe(as, Array.map(f), Array.filter(g))
|
||||
* ```
|
||||
*
|
||||
* **Example** (Chaining Arithmetic Operations)
|
||||
*
|
||||
* ```ts
|
||||
* import { pipe } from "effect"
|
||||
*
|
||||
* // Define simple arithmetic operations
|
||||
* const increment = (x: number) => x + 1
|
||||
* const double = (x: number) => x * 2
|
||||
* const subtractTen = (x: number) => x - 10
|
||||
*
|
||||
* // Sequentially apply these operations using `pipe`
|
||||
* const result = pipe(5, increment, double, subtractTen)
|
||||
*
|
||||
* console.log(result)
|
||||
* // Output: 2
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare function pipe<A>(a: A): A;
|
||||
export declare function pipe<A, B = never>(a: A, ab: (a: A) => B): B;
|
||||
export declare function pipe<A, B = never, C = never>(a: A, ab: (a: A) => B, bc: (b: B) => C): C;
|
||||
export declare function pipe<A, B = never, C = never, D = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D): D;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E): E;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F): F;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G): G;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H): H;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I): I;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J): J;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K): K;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L): L;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M): M;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N): N;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never, O = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N, no: (n: N) => O): O;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never, O = never, P = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N, no: (n: N) => O, op: (o: O) => P): P;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never, O = never, P = never, Q = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N, no: (n: N) => O, op: (o: O) => P, pq: (p: P) => Q): Q;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never, O = never, P = never, Q = never, R = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N, no: (n: N) => O, op: (o: O) => P, pq: (p: P) => Q, qr: (q: Q) => R): R;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never, O = never, P = never, Q = never, R = never, S = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N, no: (n: N) => O, op: (o: O) => P, pq: (p: P) => Q, qr: (q: Q) => R, rs: (r: R) => S): S;
|
||||
export declare function pipe<A, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never, K = never, L = never, M = never, N = never, O = never, P = never, Q = never, R = never, S = never, T = never>(a: A, ab: (a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J, jk: (j: J) => K, kl: (k: K) => L, lm: (l: L) => M, mn: (m: M) => N, no: (n: N) => O, op: (o: O) => P, pq: (p: P) => Q, qr: (q: Q) => R, rs: (r: R) => S, st: (s: S) => T): T;
|
||||
/**
|
||||
* Performs left-to-right function composition. The first argument may have any arity, the remaining arguments must be unary.
|
||||
*
|
||||
* See also [`pipe`](#pipe).
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { flow } from "effect/Function"
|
||||
*
|
||||
* const len = (s: string): number => s.length
|
||||
* const double = (n: number): number => n * 2
|
||||
*
|
||||
* const f = flow(len, double)
|
||||
*
|
||||
* assert.strictEqual(f('aaa'), 6)
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never>(ab: (...a: A) => B): (...a: A) => B;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never>(ab: (...a: A) => B, bc: (b: B) => C): (...a: A) => C;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D): (...a: A) => D;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never, E = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E): (...a: A) => E;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never, E = never, F = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F): (...a: A) => F;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never, E = never, F = never, G = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G): (...a: A) => G;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never, E = never, F = never, G = never, H = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H): (...a: A) => H;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I): (...a: A) => I;
|
||||
export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = never, D = never, E = never, F = never, G = never, H = never, I = never, J = never>(ab: (...a: A) => B, bc: (b: B) => C, cd: (c: C) => D, de: (d: D) => E, ef: (e: E) => F, fg: (f: F) => G, gh: (g: G) => H, hi: (h: H) => I, ij: (i: I) => J): (...a: A) => J;
|
||||
/**
|
||||
* Type hole simulation.
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const hole: <T>() => T;
|
||||
/**
|
||||
* The SK combinator, also known as the "S-K combinator" or "S-combinator", is a fundamental combinator in the
|
||||
* lambda calculus and the SKI combinator calculus.
|
||||
*
|
||||
* This function is useful for discarding the first argument passed to it and returning the second argument.
|
||||
*
|
||||
* @example
|
||||
* ```ts
|
||||
* import * as assert from "node:assert"
|
||||
* import { SK } from "effect/Function";
|
||||
*
|
||||
* assert.deepStrictEqual(SK(0, "hello"), "hello")
|
||||
* ```
|
||||
*
|
||||
* @since 2.0.0
|
||||
*/
|
||||
export declare const SK: <A, B>(_: A, b: B) => B;
|
||||
//# sourceMappingURL=Function.d.ts.map
|
||||
Reference in New Issue
Block a user