rambda 10.0.0 → 10.1.0

package/index.d.cts

@@ -0,0 +1,2196 @@
+export type RambdaTypes = "Object" | "Number" | "Boolean" | "String" | "Null" | "Array" | "RegExp" | "NaN" | "Function" | "Undefined" | "Async" | "Promise" | "Symbol" | "Set" | "Error" | "Map" | "WeakMap" | "Generator" | "GeneratorFunction" | "BigInt" | "ArrayBuffer" | "Date";
+
+export type EqualTypes<X, Y> =
+  (<T>() => T extends X ? 1 : 2) extends
+  (<T>() => T extends Y ? 1 : 2) ? true : false;
+
+export type IterableContainer<T = unknown> = ReadonlyArray<T> | readonly [];
+
+export type Mapped<T extends IterableContainer, K> = {
+  -readonly [P in keyof T]: K;
+};
+
+export type ElementOf<Type extends readonly any[]> = Type[number];
+export type MergeTypes<T> = {[KeyType in keyof T]: T[KeyType]} & {};
+export type MergeTypesAlternative<T> = T extends infer O ? { [K in keyof O]: O[K] } : never;
+
+export type EntryForKey<T, Key extends keyof T> = Key extends number | string
+  ? [key: `${Key}`, value: Required<T>[Key]]
+  : never;
+
+export type Entry<T> = MergeTypes<{ [P in keyof T]-?: EntryForKey<T, P> }[keyof T]>;
+
+export type Ord = number | string | boolean | Date;
+export type Ordering = -1 | 0 | 1;
+
+interface KeyValuePair<K, V> extends Array<K | V> {
+  0: K;
+  1: V;
+}
+
+export type Functor<A> = { map: <B>(fn: (x: A) => B) => Functor<B>; [key: string]: any };
+export type DeepModify<Keys extends readonly PropertyKey[], U, T> =
+  Keys extends [infer K, ...infer Rest]
+    ? K extends keyof U
+      ? Rest extends readonly []
+        ? Omit<U, K> & Record<K, T>
+        : Rest extends readonly PropertyKey[]
+          ? Omit<U, K> & Record<K, DeepModify<Rest, U[K], T>>
+          : never
+      : never
+    : never;
+
+
+export type PickStringToPickPath<T> = T extends `${infer Head},${infer Tail}` ? [Head, ...PickStringToPickPath<Tail>]
+	: T extends `${infer Head}` ? [Head]
+	: [];
+
+declare const emptyObjectSymbol: unique symbol;
+type EmptyObject = {[emptyObjectSymbol]?: never};
+type EnumerableStringKeyOf<T> =
+Required<T> extends Record<infer K, unknown>
+	? `${Exclude<K, symbol>}`
+	: never;
+type EnumerableStringKeyedValueOf<T> = ValuesOf<{
+	[K in keyof T]-?: K extends symbol ? never : T[K];
+}>;
+type ValuesOf<T> =
+	T extends EmptyObject
+		? T[keyof T]
+		: T extends Record<PropertyKey, infer V>
+			? V
+			: never;
+type MappedValues<T extends object, Value> = MergeTypes<{
+	-readonly [P in keyof T as `${P extends number | string ? P : never}`]: Value;
+}>;
+
+type SimpleMerge<Destination, Source> = {
+	[Key in keyof Destination as Key extends keyof Source ? never : Key]: Destination[Key];
+} & Source;
+
+type OmitIndexSignature<ObjectType> = {
+	[KeyType in keyof ObjectType as {} extends Record<KeyType, unknown>
+		? never
+		: KeyType]: ObjectType[KeyType];
+};
+
+type PickIndexSignature<ObjectType> = {
+	[KeyType in keyof ObjectType as {} extends Record<KeyType, unknown>
+		? KeyType
+		: never]: ObjectType[KeyType];
+};
+
+type Merge<Destination, Source> =
+MergeTypes<
+	SimpleMerge<PickIndexSignature<Destination>, PickIndexSignature<Source>>
+	& SimpleMerge<OmitIndexSignature<Destination>, OmitIndexSignature<Source>>
+>;
+
+type StrictNonNullable<T> = Exclude<T, null | undefined>;
+
+type Flatten<T> = T extends object
+	? T extends readonly any[]
+		? T
+		: {
+				[K in keyof T]-?: NonNullable<T[K]> extends infer V
+					? V extends object
+						? V extends readonly any[]
+							? never 
+							: Flatten<V>
+						: V
+					: never 
+			}
+	: T;
+
+export type FlattenObject<T extends object> = object extends T
+  ? object
+  : {
+        [K in keyof T]-?: (
+          x: NonNullable<T[K]> extends infer V
+            ? V extends object
+              ? V extends readonly any[]
+                ? never 
+                : Flatten<V> extends infer FV
+                  ? {
+                      [P in keyof FV as `${Extract<K, string>}.${Extract<P, string>}`]: FV[P]
+                    }
+                  : never 
+              : Pick<T, K>
+            : never 
+        ) => void
+      } extends Record<keyof T, (y: infer O) => void>
+    ? O 
+    : never;
+
+/**
+ * It adds new key-value pair to the object.
+ */
+export function addProp<T extends object, P extends PropertyKey, V extends unknown>(
+	prop: P,
+	value: V
+): (obj: T) => MergeTypes<T & Record<P, V>>;
+
+/**
+ * It receives list of objects and add new property to each item.
+ * 
+ * The value is based on result of `fn` function, which receives the current object as argument.
+ */
+export function addPropToObjects<
+  T extends object,
+  K extends string,
+  R
+>(
+	property: K,
+  fn: (input: T) => R
+): (list: T[]) => MergeTypes<T & { [P in K]: R }>[];
+
+/**
+ * It returns `true`, if all members of array `list` returns `true`, when applied as argument to `predicate` function.
+ */
+export function all<T>(predicate: (x: T) => boolean): (list: T[]) => boolean;
+
+/**
+ * It returns `true`, if all functions of `predicates` return `true`, when `input` is their argument.
+ */
+export function allPass<F extends (...args: any[]) => boolean>(predicates: readonly F[]): F;
+
+/**
+ * It returns `true`, if at least one member of `list` returns true, when passed to a `predicate` function.
+ */
+export function any<T>(predicate: (x: T) => boolean): (list: T[]) => boolean;
+
+/**
+ * It accepts list of `predicates` and returns a function. This function with its `input` will return `true`, if any of `predicates` returns `true` for this `input`.
+ */
+export function anyPass<T, TF1 extends T, TF2 extends T>(
+  predicates: [(a: T) => a is TF1, (a: T) => a is TF2],
+): (a: T) => a is TF1 | TF2;
+export function anyPass<T, TF1 extends T, TF2 extends T, TF3 extends T>(
+  predicates: [(a: T) => a is TF1, (a: T) => a is TF2, (a: T) => a is TF3],
+): (a: T) => a is TF1 | TF2 | TF3;
+export function anyPass<T, TF1 extends T, TF2 extends T, TF3 extends T>(
+  predicates: [(a: T) => a is TF1, (a: T) => a is TF2, (a: T) => a is TF3],
+): (a: T) => a is TF1 | TF2 | TF3;
+export function anyPass<T, TF1 extends T, TF2 extends T, TF3 extends T, TF4 extends T>(
+  predicates: [(a: T) => a is TF1, (a: T) => a is TF2, (a: T) => a is TF3, (a: T) => a is TF4],
+): (a: T) => a is TF1 | TF2 | TF3 | TF4;
+export function anyPass<T, TF1 extends T, TF2 extends T, TF3 extends T, TF4 extends T, TF5 extends T>(
+  predicates: [
+    (a: T) => a is TF1,
+    (a: T) => a is TF2,
+    (a: T) => a is TF3,
+    (a: T) => a is TF4,
+    (a: T) => a is TF5
+  ],
+): (a: T) => a is TF1 | TF2 | TF3 | TF4 | TF5;
+export function anyPass<T, TF1 extends T, TF2 extends T, TF3 extends T, TF4 extends T, TF5 extends T, TF6 extends T>(
+  predicates: [
+    (a: T) => a is TF1,
+    (a: T) => a is TF2,
+    (a: T) => a is TF3,
+    (a: T) => a is TF4,
+    (a: T) => a is TF5,
+    (a: T) => a is TF6
+  ],
+): (a: T) => a is TF1 | TF2 | TF3 | TF4 | TF5 | TF6;
+export function anyPass<F extends (...args: any[]) => boolean>(predicates: readonly F[]): F;
+
+/**
+ * It adds element `x` at the end of `iterable`.
+ */
+export function append<T>(el: T): (list: T[]) => T[];
+export function append<T>(el: T): (list: readonly T[]) => T[];
+
+/**
+ * Helper function to be used with `R.sort` to sort list in ascending order.
+ */
+export function ascend<T>(fn: (obj: T) => Ord): (a: T, b: T)=> Ordering;
+
+/**
+ * It helps to make sure that input is from specific type. Similar to `R.convertToType`, but it actually checks the type of the input value. If `fn` input returns falsy value, then the function will throw an error.
+ */
+export function assertType<T, U extends T>(fn: (x: T) => x is U) : (x: T) => U;
+
+/**
+ * It returns `true` if all each property in `conditions` returns `true` when applied to corresponding property in `input` object.
+ */
+export function checkObjectWithSpec<T>(spec: T): <U>(testObj: U) => boolean;
+
+/**
+ * It removes `null` and `undefined` members from list or object input.
+ */
+export function compact<T>(list: T[]): Array<StrictNonNullable<T>>;
+export function compact<T extends object>(record: T): {
+  [K in keyof T as Exclude<T[K], null | undefined> extends never
+    ? never
+    : K
+  ]: Exclude<T[K], null | undefined>
+};
+
+/**
+ * It returns `inverted` version of `origin` function that accept `input` as argument.
+ * 
+ * The return value of `inverted` is the negative boolean value of `origin(input)`.
+ */
+export function complement<T extends any[]>(predicate: (...args: T) => unknown): (...args: T) => boolean;
+
+/**
+ * It returns a new string or array, which is the result of merging `x` and `y`.
+ */
+export function concat<T>(x: T[]): (y: T[]) => T[];
+export function concat(x: string): (y: string) => string;
+
+/**
+ * It helps to convert a value to a specific type.
+ * It is useful when you have to overcome TypeScript's type inference.
+ */
+export function convertToType<T>(x: unknown) : T;
+
+/**
+ * It counts how many times `predicate` function returns `true`, when supplied with iteration of `list`.
+ */
+export function count<T>(predicate: (x: T) => boolean): (list: T[]) => number;
+
+/**
+ * It counts elements in a list after each instance of the input list is passed through `transformFn` function.
+ */
+export function countBy<T>(fn: (x: T) => string | number): (list: T[]) => { [index: string]: number };
+
+export function createObjectFromKeys<const K extends readonly PropertyKey[], V>(
+	fn: (key: K[number]) => V
+): (keys: K) => { [P in K[number]]: V };
+export function createObjectFromKeys<const K extends readonly PropertyKey[], V>(
+	fn: (key: K[number], index: number) => V
+): (keys: K) => { [P in K[number]]: V };
+
+/**
+ * It returns `defaultValue`, if all of `inputArguments` are `undefined`, `null` or `NaN`.
+ * 
+ * Else, it returns the first truthy `inputArguments` instance(from left to right).
+ */
+export function defaultTo<T>(defaultValue: T): (input: unknown) => T;
+
+/**
+ * Helper function to be used with `R.sort` to sort list in descending order.
+ */
+export function descend<T>(fn: (obj: T) => Ord): (a: T, b: T)=> Ordering;
+
+/**
+ * It returns `howMany` items dropped from beginning of list.
+ */
+export function drop<T>(howMany: number): (list: T[]) => T[];
+
+/**
+ * It returns `howMany` items dropped from the end of list.
+ */
+export function dropLast<T>(howMany: number): (list: T[]) => T[];
+
+export function dropLastWhile<T>(predicate: (x: T, index: number) => boolean): (list: T[]) => T[];
+export function dropLastWhile<T>(predicate: (x: T) => boolean): (list: T[]) => T[];
+
+export function dropRepeatsBy<T, U>(fn: (x: T) => U): (list: T[]) => T[];
+
+export function dropRepeatsWith<T>(predicate: (x: T, y: T) => boolean): (list: T[]) => T[];
+
+export function dropWhile<T>(predicate: (x: T, index: number) => boolean): (list: T[]) => T[];
+export function dropWhile<T>(predicate: (x: T) => boolean): (list: T[]) => T[];
+
+export function eqBy<T>(fn: (x: T) => unknown, a: T): (b: T) => boolean;
+
+/**
+ * It returns `true` if property `prop` in `obj1` is equal to property `prop` in `obj2` according to `R.equals`.
+ */
+export function eqProps<T, K extends keyof T>(prop: K, obj1: T): (obj2: T) => boolean;
+
+/**
+ * It deeply compares `x` and `y` and returns `true` if they are equal.
+ */
+export function equals<T>(x: T, y: T): boolean;
+export function equals<T>(x: T): (y: T) => boolean;
+
+/**
+ * It takes object of functions as set of rules. These `rules` are applied to the `iterable` input to produce the result.
+ * It doesn't support nested rules, i.e rules are only one level deep.
+ */
+export function evolve<T>(rules: {
+	[K in keyof T]?: (x: T[K]) => T[K]
+}): (obj: T) => T;
+
+/**
+ * Opposite of `R.includes`
+ * 
+ * `R.equals` is used to determine equality.
+ */
+export function excludes<T extends string>(valueToFind: T): (input: string) => boolean;
+export function excludes<T>(valueToFind: T): (input: T[]) => boolean;
+
+/**
+ * It filters list or object `input` using a `predicate` function.
+ */
+export function filter<T, S extends T>(
+  predicate: (value: T) => value is S,
+): (list: T[]) => S[];
+export function filter<T>(
+	predicate: BooleanConstructor,
+): (list: readonly T[]) => StrictNonNullable<T>[];
+export function filter<T>(
+	predicate: BooleanConstructor,
+): (list: T[]) => StrictNonNullable<T>[];
+export function filter<T>(
+	predicate: (value: T) => boolean,
+): (list: T[]) => T[];
+
+/**
+ * It loops over each property of `obj` and returns a new object with only those properties that satisfy the `predicate`.
+ */
+export function filterObject<T extends object>(
+  valueMapper: (
+    value: EnumerableStringKeyedValueOf<T>,
+    key: EnumerableStringKeyOf<T>,
+    data: T,
+  ) => boolean,
+): <U extends T>(data: T) => U;
+
+/**
+ * It returns the first element of `list` that satisfy the `predicate`.
+ * 
+ * If there is no such element, it returns `undefined`.
+ */
+export function find<T>(predicate: (x: T) => boolean): (list: T[]) => T | undefined;
+
+/**
+ * It returns the index of the first element of `list` satisfying the `predicate` function.
+ * 
+ * If there is no such element, then `-1` is returned.
+ */
+export function findIndex<T>(predicate: (x: T) => boolean): (list: T[]) => number;
+
+/**
+ * It returns the last element of `list` satisfying the `predicate` function.
+ * 
+ * If there is no such element, then `undefined` is returned.
+ */
+export function findLast<T>(fn: (x: T) => boolean): (list: T[]) => T | undefined;
+
+/**
+ * It returns the index of the last element of `list` satisfying the `predicate` function.
+ * 
+ * If there is no such element, then `-1` is returned.
+ */
+export function findLastIndex<T>(predicate: (x: T) => boolean): (list: T[]) => number;
+
+/**
+ * It returns the `nth` element of `list` that satisfy the `predicate` function.
+ */
+export function findNth<T>(predicate: (x: T) => boolean, nth: number): (list: T[]) => T | undefined;
+
+/**
+ * It maps `fn` over `list` and then flatten the result by one-level.
+ */
+export function flatMap<T, U extends unknown>(transformFn: (x: T extends any[] ? T[number]: never) => U): (listOfLists: T[]) => U[];
+
+/**
+ * It deeply flattens an array.
+ * You must pass expected output type as a type argument.
+ */
+export function flatten<T>(list: any[]): T[];
+
+/**
+ * It transforms object to object where each value is represented with its path.
+ */
+export function flattenObject<T extends object>(obj: T): FlattenObject<T>;
+
+/**
+ * It splits `list` according to a provided `groupFn` function and returns an object.
+ */
+export function groupBy<T, K extends string = string>(fn: (x: T) => K): (list: T[]) => Partial<Record<K, T[]>>;
+
+/**
+ * It returns the first element of list or string `input`. It returns `undefined` if array has length of 0.
+ */
+export function head<T>(listOrString: T): T extends string ? string : 
+	T extends [] ? undefined: 
+		T extends readonly [infer F, ...infer R] ? F : 
+			T extends readonly [infer F] ? F :
+				T extends [infer F] ? F :
+					T extends [infer F, ...infer R] ? F : 
+						T extends unknown[] ? T[number] : 
+							undefined;
+
+/**
+ * If `input` is string, then this method work as native `String.includes`.
+ * 
+ * If `input` is array, then `R.equals` is used to define if `valueToFind` belongs to the list.
+ */
+export function includes<T extends string>(valueToFind: T): (input: string) => boolean;
+export function includes<T>(valueToFind: T): (input: T[]) => boolean;
+
+/**
+ * It uses `R.equals` for list of objects/arrays or native `indexOf` for any other case.
+ */
+export function indexOf<T>(valueToFind: T): (list: T[]) => number;
+
+/**
+ * It returns all but the last element of list or string `input`.
+ */
+export function init<T extends unknown[]>(input: T): T extends readonly [...infer U, any] ? U : [...T];
+export function init(input: string): string;
+
+/**
+ * It returns a new list by applying a `predicate` function to all elements of `list1` and `list2` and keeping only these elements where `predicate` returns `true`.
+ */
+export function innerJoin<T1, T2>(
+  pred: (a: T1, b: T2) => boolean,
+  list1: T1[],
+): (list2: T2[]) => T1[];
+
+/**
+ * It generates a new string from `inputWithTags` by replacing all `{{x}}` occurrences with values provided by `templateArguments`.
+ */
+export function interpolate(inputWithTags: string): (templateArguments: object) => string;
+
+
+// API_MARKER_END
+// ===========================================
+
+/**
+ * It loops through `listA` and `listB` and returns the intersection of the two according to `R.equals`.
+ */
+export function intersection<T>(listA: T[]): (listB: T[]) => T[];
+
+/**
+ * It adds a `separator` between members of `list`.
+ */
+export function intersperse<T>(separator: T): (list: T[]) => T[];
+
+/**
+ * It returns a string of all `list` instances joined with a `glue`.
+ */
+export function join<T>(glue: string): (list: T[]) => string;
+
+/**
+ * It returns the last element of `input`, as the `input` can be either a string or an array. It returns `undefined` if array has length of 0.
+ */
+export function last<T>(listOrString: T): T extends string ? string : 
+  T extends [] ? undefined : 
+    T extends readonly [...infer R, infer L] ? L : 
+      T extends readonly [infer L] ? L :
+        T extends [infer L] ? L :
+          T extends [...infer R, infer L] ? L : 
+            T extends unknown[] ? T[number] : 
+              undefined;
+
+/**
+ * It returns the last index of `target` in `list` array.
+ * 
+ * `R.equals` is used to determine equality between `target` and members of `list`.
+ * 
+ * If there is no such index, then `-1` is returned.
+ */
+export function lastIndexOf<T>(target: T): (list: T[]) => number;
+
+/**
+ * It returns the result of looping through `iterable` with `fn`.
+ * 
+ * It works with both array and object.
+ */
+export function map<T extends IterableContainer, U>(
+  fn: (value: T[number], index: number) => U,
+): (data: T) => Mapped<T, U>;
+export function map<T extends IterableContainer, U>(
+  fn: (value: T[number]) => U,
+): (data: T) => Mapped<T, U>;
+export function map<T extends IterableContainer, U>(
+  fn: (value: T[number], index: number) => U,
+	data: T
+) : Mapped<T, U>;
+export function map<T extends IterableContainer, U>(
+  fn: (value: T[number]) => U,
+	data: T
+) : Mapped<T, U>;
+
+/**
+ * Sequential asynchronous mapping with `fn` over members of `list`.
+ */
+export function mapAsync<T extends IterableContainer, U>(
+  fn: (value: T[number], index: number) => Promise<U>,
+): (data: T) => Promise<Mapped<T, U>>;
+export function mapAsync<T extends IterableContainer, U>(
+  fn: (value: T[number]) => Promise<U>,
+): (data: T) => Promise<Mapped<T, U>>;
+export function mapAsync<T extends IterableContainer, U>(
+  fn: (value: T[number], index: number) => Promise<U>,
+  data: T
+): Promise<Mapped<T, U>>;
+export function mapAsync<T extends IterableContainer, U>(
+  fn: (value: T[number]) => Promise<U>,
+  data: T
+): Promise<Mapped<T, U>>;
+
+/**
+ * It returns a copy of `obj` with keys transformed by `fn`.
+ */
+export function mapKeys<T>(fn: (prop: string, value: T) => string): (obj: Record<string, T>) => Record<string, T>;
+
+export function mapObject<T extends object, Value>(
+  valueMapper: (
+    value: EnumerableStringKeyedValueOf<T>,
+    key: EnumerableStringKeyOf<T>,
+    data: T,
+  ) => Value,
+): (data: T) => MappedValues<T, Value>;
+
+export function mapObjectAsync<T extends object, Value>(
+  valueMapper: (
+    value: EnumerableStringKeyedValueOf<T>,
+    key: EnumerableStringKeyOf<T>,
+    data: T,
+  ) => Promise<Value>,
+): (data: T) => Promise<MappedValues<T, Value>>;
+
+/**
+ * Wrapper around `Promise.all` for asynchronous mapping with `fn` over members of `list`.
+ */
+export function mapParallelAsync<T extends IterableContainer, U>(
+  fn: (value: T[number], index: number) => Promise<U>,
+): (data: T) => Promise<Mapped<T, U>>;
+export function mapParallelAsync<T extends IterableContainer, U>(
+  fn: (value: T[number]) => Promise<U>,
+): (data: T) => Promise<Mapped<T, U>>;
+export function mapParallelAsync<T extends IterableContainer, U>(
+  fn: (value: T[number], index: number) => Promise<U>,
+  data: T
+): Promise<Mapped<T, U>>;
+export function mapParallelAsync<T extends IterableContainer, U>(
+  fn: (value: T[number]) => Promise<U>,
+  data: T
+): Promise<Mapped<T, U>>;
+
+/**
+ * Curried version of `String.prototype.match` which returns empty array, when there is no match.
+ */
+export function match(regExpression: RegExp): (str: string) => string[];
+
+/**
+ * It returns the greater value between `x` and `y` according to `compareFn` function.
+ */
+export function maxBy<T>(compareFn: (input: T) => Ord, x: T): (y: T) => T;
+
+/**
+ * It creates a copy of `target` object with overwritten `newProps` properties.
+ */
+export function merge<Source>(source: Source): <T>(data: T) => Merge<T, Source>;
+
+/**
+ * Helper to merge all calculated TypeScript definitions into one definition.
+ * It returns its input and it is intended to be used as last method inside `R.pipe` chain.
+ */
+export function mergeTypes<T>(x: T): MergeTypes<T>;
+
+/**
+ * It returns the lesser value between `x` and `y` according to `compareFn` function.
+ */
+export function minBy<T>(compareFn: (input: T) => Ord, x: T): (y: T) => T;
+
+/**
+ * It replaces `index` in array `list` with the result of `replaceFn(list[i])`.
+ */
+export function modifyItemAtIndex<T>(index: number, replaceFn: (x: T) => T): (list: T[]) => T[];
+
+/**
+ * It changes a property with the result of transformer function.
+ */
+export function modifyProp<T, K extends keyof T>(
+  prop: K,
+  fn: (x: T[K]) => T[K],
+): (target: T) => T;
+
+/**
+ * It returns `true`, if all members of array `list` returns `false`, when applied as argument to `predicate` function.
+ */
+export function none<T>(predicate: (x: T) => boolean): (list: T[]) => boolean;
+
+/**
+ * It creates an object with a single key-value pair.
+ */
+export function objOf<T, K extends PropertyKey>(key: K): (value: T) => { [P in K]: T };
+
+/**
+ * It will return `true` if `specification` object fully or partially include `obj` object.
+ * 
+ * `R.equals` is used to determine equality.
+ */
+export function objectIncludes<T>(specification: T): (obj: Partial<T>) => boolean;
+
+/**
+ * It returns a partial copy of an `obj` without `propsToOmit` properties.
+ */
+export function omit<
+	S extends string,
+	Keys extends PickStringToPickPath<S>,
+>(propsToPick: S): <U extends Partial<Record<ElementOf<Keys>, any>>>(
+	obj: ElementOf<Keys> extends keyof U ? U : never
+) => ElementOf<Keys> extends keyof U ? MergeTypes<Omit<U, ElementOf<Keys>>> : never;
+export function omit<const Keys extends PropertyKey[]>(propsToPick: Keys): <
+	U extends Partial<Record<ElementOf<Keys>, any>>
+>(
+	obj: ElementOf<Keys> extends keyof U ? U : never
+) => ElementOf<Keys> extends keyof U ? MergeTypes<Omit<U, ElementOf<Keys>>> : never;
+
+/**
+ * It will return array of two arrays according to `predicate` function. The first member holds all instances of `input` that pass the `predicate` function, while the second member - those who doesn't.
+ */
+export function partition<T, S extends T>(
+  predicate: (value: T, index: number, data: ReadonlyArray<T>) => value is S,
+): (data: ReadonlyArray<T>) => [Array<S>, Array<Exclude<T, S>>];
+export function partition<T>(
+  predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean,
+): (data: ReadonlyArray<T>) => [Array<T>, Array<T>];
+
+/**
+ * It returns an array containing two objects. The first object holds all properties of the input object for which the predicate returns true, while the second object holds those that do not.
+ */
+export function partitionObject<T extends unknown, S extends T>(
+  predicate: (value: T, prop: string, obj: Record<string, T>) => value is S,
+): (obj: Record<string, T>) => [Record<string, S>, Record<string, Exclude<T, S>>];
+export function partitionObject<T extends unknown>(
+  predicate: (value: T, prop: string, obj: Record<string, T>) => boolean,
+): (obj: Record<string, T>) => [Record<string, T>, Record<string, T>];
+
+/**
+ * If `pathToSearch` is `'a.b'` then it will return `1` if `obj` is `{a:{b:1}}`.
+ * 
+ * It will return `undefined`, if such path is not found.
+ */
+export function path<S, K0 extends string & keyof S>(path: `${K0}`): (obj: S) => S[K0];
+export function path<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(path: `${K0}.${K1}`): (obj: S) => S[K0][K1];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1]
+>(path: [K0, K1, K2]): (obj: S) => S[K0][K1][K2];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(path: `${K0}.${K1}.${K2}`): (obj: S) => S[K0][K1][K2];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2]
+>(path: [K0, K1, K2, K3]): (obj: S) => S[K0][K1][K2][K3];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(path: `${K0}.${K1}.${K2}.${K3}`): (obj: S) => S[K0][K1][K2][K3];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3]
+>(path: [K0, K1, K2, K3, K4]): (obj: S) => S[K0][K1][K2][K3][K4];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}`): (obj: S) => S[K0][K1][K2][K3][K4];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3]
+>(path: [K0, K1, K2, K3, K4], obj: S): S[K0][K1][K2][K3][K4];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3],
+  K5 extends keyof S[K0][K1][K2][K3][K4]
+>(path: [K0, K1, K2, K3, K4, K5]): (obj: S) => S[K0][K1][K2][K3][K4][K5];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}`): (obj: S) => S[K0][K1][K2][K3][K4][K5];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3],
+  K5 extends keyof S[K0][K1][K2][K3][K4]
+>(path: [K0, K1, K2, K3, K4, K5], obj: S): S[K0][K1][K2][K3][K4][K5];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3],
+  K5 extends keyof S[K0][K1][K2][K3][K4],
+  K6 extends keyof S[K0][K1][K2][K3][K4][K5]
+>(path: [K0, K1, K2, K3, K4, K5, K6]): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}`): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3],
+  K5 extends keyof S[K0][K1][K2][K3][K4],
+  K6 extends keyof S[K0][K1][K2][K3][K4][K5]
+>(path: [K0, K1, K2, K3, K4, K5, K6], obj: S): S[K0][K1][K2][K3][K4][K5][K6];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3],
+  K5 extends keyof S[K0][K1][K2][K3][K4],
+  K6 extends keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(path: [K0, K1, K2, K3, K4, K5, K6, K7]): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6][K7];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}`): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6][K7];
+export function path<
+  S,
+  K0 extends keyof S,
+  K1 extends keyof S[K0],
+  K2 extends keyof S[K0][K1],
+  K3 extends keyof S[K0][K1][K2],
+  K4 extends keyof S[K0][K1][K2][K3],
+  K5 extends keyof S[K0][K1][K2][K3][K4],
+  K6 extends keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(path: [K0, K1, K2, K3, K4, K5, K6, K7, K8]): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6][K7][K8];
+export function path<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}.${K8}`): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6][K7][K8];
+export function path<S, K0 extends keyof S>(path: [K0]): (obj: S) => S[K0];
+export function path<S, K0 extends keyof S, K1 extends keyof S[K0]>(path: [K0, K1]): (obj: S) => S[K0][K1];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1]
+>(path: [K0, K1, K2]): (obj: S) => S[K0][K1][K2];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2]
+>(path: [K0, K1, K2, K3]): (obj: S) => S[K0][K1][K2][K3];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3]
+>(path: [K0, K1, K2, K3, K4]): (obj: S) => S[K0][K1][K2][K3][K4];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3]
+>(path: [K0, K1, K2, K3, K4], obj: S): S[K0][K1][K2][K3][K4];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3],
+    K5 extends keyof S[K0][K1][K2][K3][K4]
+>(path: [K0, K1, K2, K3, K4, K5]): (obj: S) => S[K0][K1][K2][K3][K4][K5];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3],
+    K5 extends keyof S[K0][K1][K2][K3][K4]
+>(path: [K0, K1, K2, K3, K4, K5], obj: S): S[K0][K1][K2][K3][K4][K5];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3],
+    K5 extends keyof S[K0][K1][K2][K3][K4],
+    K6 extends keyof S[K0][K1][K2][K3][K4][K5]
+>(path: [K0, K1, K2, K3, K4, K5, K6]): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3],
+    K5 extends keyof S[K0][K1][K2][K3][K4],
+    K6 extends keyof S[K0][K1][K2][K3][K4][K5]
+>(path: [K0, K1, K2, K3, K4, K5, K6], obj: S): S[K0][K1][K2][K3][K4][K5][K6];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3],
+    K5 extends keyof S[K0][K1][K2][K3][K4],
+    K6 extends keyof S[K0][K1][K2][K3][K4][K5],
+    K7 extends keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(path: [K0, K1, K2, K3, K4, K5, K6, K7]): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6][K7];
+export function path<
+    S,
+    K0 extends keyof S,
+    K1 extends keyof S[K0],
+    K2 extends keyof S[K0][K1],
+    K3 extends keyof S[K0][K1][K2],
+    K4 extends keyof S[K0][K1][K2][K3],
+    K5 extends keyof S[K0][K1][K2][K3][K4],
+    K6 extends keyof S[K0][K1][K2][K3][K4][K5],
+    K7 extends keyof S[K0][K1][K2][K3][K4][K5][K6],
+    K8 extends keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(path: [K0, K1, K2, K3, K4, K5, K6, K7, K8]): (obj: S) => S[K0][K1][K2][K3][K4][K5][K6][K7][K8];
+
+export function pathSatisfies<S, K0 extends string & keyof S>(
+  predicate: (x: S[K0]) => boolean,
+  path: [K0]
+): (obj: S) => boolean;
+export function pathSatisfies<S, K0 extends string & keyof S>(
+  predicate: (x: S[K0]) => boolean,
+  path: `${K0}`
+): (obj: S) => boolean;
+export function pathSatisfies<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(
+  predicate: (x: S[K0][K1]) => boolean,
+  path: [K0, K1]
+): (obj: S) => boolean;
+export function pathSatisfies<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(
+  predicate: (x: S[K0][K1]) => boolean,
+  path: `${K0}.${K1}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(
+  predicate: (x: S[K0][K1][K2]) => boolean,
+  path: [K0, K1, K2]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(
+  predicate: (x: S[K0][K1][K2]) => boolean,
+  path: `${K0}.${K1}.${K2}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(
+  predicate: (x: S[K0][K1][K2][K3]) => boolean,
+  path: [K0, K1, K2, K3]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(
+  predicate: (x: S[K0][K1][K2][K3]) => boolean,
+  path: `${K0}.${K1}.${K2}.${K3}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4]) => boolean,
+  path: [K0, K1, K2, K3, K4]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4]) => boolean,
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5]) => boolean,
+  path: [K0, K1, K2, K3, K4, K5]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5]) => boolean,
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5][K6]) => boolean,
+  path: [K0, K1, K2, K3, K4, K5, K6]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5][K6]) => boolean,
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5][K6][K7]) => boolean,
+  path: [K0, K1, K2, K3, K4, K5, K6, K7]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5][K6][K7]) => boolean,
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}`
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5][K6][K7][K8]) => boolean,
+  path: [K0, K1, K2, K3, K4, K5, K6, K7, K8]
+): (obj: S) => boolean;
+export function pathSatisfies<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(
+  predicate: (x: S[K0][K1][K2][K3][K4][K5][K6][K7][K8]) => boolean,
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}.${K8}`
+): (obj: S) => boolean;
+
+export function permutations<T>(list: T[]): T[][];
+
+/**
+ * It returns a partial copy of an `input` containing only `propsToPick` properties.
+ * 
+ * `input` can be either an object or an array.
+ * 
+ * String annotation of `propsToPick` is one of the differences between `Rambda` and `Ramda`.
+ */
+export function pick<K extends PropertyKey>(propsToPick: K[]): <T>(input: T) => MergeTypes<Pick<T, Exclude<keyof T, Exclude<keyof T, K>>>>;
+export function pick<S extends string>(propsToPick: S): <T>(input: T) => MergeTypes<Pick<T, Exclude<keyof T, Exclude<keyof T, ElementOf<PickStringToPickPath<S>>>>>>;
+
+/**
+ * It performs left-to-right function composition, where first argument is the input for the chain of functions.
+ * 
+ * This is huge difference from `Ramda.pipe` where input is passed like `R.pipe(...fns)(input)`.
+ * Here we have `R.pipe(input, ...fns)`.
+ * 
+ * It has much better TypeScript support than `Ramda.pipe` and this is the reason why `Rambda` goes in this direction.
+ */
+export function pipe<A, B>(value: A, op1: (input: A) => B): B;
+export function pipe<A, B, C>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+): C;
+export function pipe<A, B, C, D>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+): D;
+export function pipe<A, B, C, D, E>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+  op4: (input: D) => E,
+): E;
+export function pipe<A, B, C, D, E, F>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+  op4: (input: D) => E,
+  op5: (input: E) => F,
+): F;
+export function pipe<A, B, C, D, E, F, G>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+  op4: (input: D) => E,
+  op5: (input: E) => F,
+  op6: (input: F) => G,
+): G;
+export function pipe<A, B, C, D, E, F, G, H>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+  op4: (input: D) => E,
+  op5: (input: E) => F,
+  op6: (input: F) => G,
+  op7: (input: G) => H,
+): H;
+export function pipe<A, B, C, D, E, F, G, H, I>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+  op4: (input: D) => E,
+  op5: (input: E) => F,
+  op6: (input: F) => G,
+  op7: (input: G) => H,
+  op8: (input: H) => I,
+): I;
+export function pipe<A, B, C, D, E, F, G, H, I, J>(
+  value: A,
+  op1: (input: A) => B,
+  op2: (input: B) => C,
+  op3: (input: C) => D,
+  op4: (input: D) => E,
+  op5: (input: E) => F,
+  op6: (input: F) => G,
+  op7: (input: G) => H,
+  op8: (input: H) => I,
+  op9: (input: I) => J,
+): J;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+): K;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+): L;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+): M;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+): N;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+  op14: (input: N) => O,
+): O;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+  op14: (input: N) => O,
+  op15: (input: O) => P,
+): P;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+  op14: (input: N) => O,
+  op15: (input: O) => P,
+  op16: (input: P) => Q,
+): Q;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+  op14: (input: N) => O,
+  op15: (input: O) => P,
+  op16: (input: P) => Q,
+  op17: (input: Q) => R,
+): R;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+  op14: (input: N) => O,
+  op15: (input: O) => P,
+  op16: (input: P) => Q,
+  op17: (input: Q) => R,
+  op18: (input: R) => S,
+): S;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T>(
+  value: A,
+  op01: (input: A) => B,
+  op02: (input: B) => C,
+  op03: (input: C) => D,
+  op04: (input: D) => E,
+  op05: (input: E) => F,
+  op06: (input: F) => G,
+  op07: (input: G) => H,
+  op08: (input: H) => I,
+  op09: (input: I) => J,
+  op10: (input: J) => K,
+  op11: (input: K) => L,
+  op12: (input: L) => M,
+  op13: (input: M) => N,
+  op14: (input: N) => O,
+  op15: (input: O) => P,
+  op16: (input: P) => Q,
+  op17: (input: Q) => R,
+  op18: (input: R) => S,
+  op19: (input: S) => T,
+): T;
+export function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U>(
+	value: A,
+	op01: (input: A) => B,
+	op02: (input: B) => C,
+	op03: (input: C) => D,
+	op04: (input: D) => E,
+	op05: (input: E) => F,
+	op06: (input: F) => G,
+	op07: (input: G) => H,
+	op08: (input: H) => I,
+	op09: (input: I) => J,
+	op10: (input: J) => K,
+	op11: (input: K) => L,
+	op12: (input: L) => M,
+	op13: (input: M) => N,
+	op14: (input: N) => O,
+	op15: (input: O) => P,
+	op16: (input: P) => Q,
+	op17: (input: Q) => R,
+	op18: (input: R) => S,
+	op19: (input: S) => T,
+	op20: (input: T) => U,
+): U;
+
+/**
+ * It accepts input as first argument and series of functions as next arguments. It is same as `R.pipe` but with support for asynchronous functions.
+ */
+export function pipeAsync<A, B>(input: A, fn0: (x: Awaited<A>) => B) : B;
+export function pipeAsync<A, B, C>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C) : C;
+export function pipeAsync<A, B, C, D>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C, fn2: (x: Awaited<C>) => D) : D;
+export function pipeAsync<A, B, C, D, E>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C, fn2: (x: Awaited<C>) => D, fn3: (x: Awaited<D>) => E) : E;
+export function pipeAsync<A, B, C, D, E, F>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C, fn2: (x: Awaited<C>) => D, fn3: (x: Awaited<D>) => E, fn4: (x: Awaited<E>) => F) : F;
+export function pipeAsync<A, B, C, D, E, F, G>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C, fn2: (x: Awaited<C>) => D, fn3: (x: Awaited<D>) => E, fn4: (x: Awaited<E>) => F, fn5: (x: Awaited<F>) => G) : G;
+export function pipeAsync<A, B, C, D, E, F, G, H>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C, fn2: (x: Awaited<C>) => D, fn3: (x: Awaited<D>) => E, fn4: (x: Awaited<E>) => F, fn5: (x: Awaited<F>) => G, fn6: (x: Awaited<G>) => H) : H;
+export function pipeAsync<A, B, C, D, E, F, G, H, I>(input: A, fn0: (x: Awaited<A>) => B, fn1: (x: Awaited<B>) => C, fn2: (x: Awaited<C>) => D, fn3: (x: Awaited<D>) => E, fn4: (x: Awaited<E>) => F, fn5: (x: Awaited<F>) => G, fn6: (x: Awaited<G>) => H, fn7: (x: Awaited<H>) => I) : I;
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+) : J;
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+): K;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+): L;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+): M;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+): N;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+): O;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+  fn14: (x: Awaited<O>) => P,
+): P;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+  fn14: (x: Awaited<O>) => P,
+  fn15: (x: Awaited<P>) => Q,
+): Q;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+  fn14: (x: Awaited<O>) => P,
+  fn15: (x: Awaited<P>) => Q,
+  fn16: (x: Awaited<Q>) => R,
+): R;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+  fn14: (x: Awaited<O>) => P,
+  fn15: (x: Awaited<P>) => Q,
+  fn16: (x: Awaited<Q>) => R,
+  fn17: (x: Awaited<R>) => S,
+): S;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+  fn14: (x: Awaited<O>) => P,
+  fn15: (x: Awaited<P>) => Q,
+  fn16: (x: Awaited<Q>) => R,
+  fn17: (x: Awaited<R>) => S,
+  fn18: (x: Awaited<S>) => T,
+): T;
+
+export function pipeAsync<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U>(
+  input: A,
+  fn0: (x: Awaited<A>) => B,
+  fn1: (x: Awaited<B>) => C,
+  fn2: (x: Awaited<C>) => D,
+  fn3: (x: Awaited<D>) => E,
+  fn4: (x: Awaited<E>) => F,
+  fn5: (x: Awaited<F>) => G,
+  fn6: (x: Awaited<G>) => H,
+  fn7: (x: Awaited<H>) => I,
+  fn8: (x: Awaited<I>) => J,
+  fn9: (x: Awaited<J>) => K,
+  fn10: (x: Awaited<K>) => L,
+  fn11: (x: Awaited<L>) => M,
+  fn12: (x: Awaited<M>) => N,
+  fn13: (x: Awaited<N>) => O,
+  fn14: (x: Awaited<O>) => P,
+  fn15: (x: Awaited<P>) => Q,
+  fn16: (x: Awaited<Q>) => R,
+  fn17: (x: Awaited<R>) => S,
+  fn18: (x: Awaited<S>) => T,
+  fn19: (x: Awaited<T>) => U,
+): U;
+
+/**
+ * It returns list of the values of `property` taken from the all objects inside `list`.
+ * Basically, this is `R.map(R.prop(property))`.
+ */
+export function pluck<T, K extends keyof T>(property: K): (list: T[]) => T[K][];
+
+/**
+ * It adds element `x` at the beginning of `list`.
+ */
+export function prepend<T>(xToPrepend: T, iterable: T[]): T[];
+export function prepend<T>(xToPrepend: T): (iterable: T[]) => T[];
+
+/**
+ * It returns the value of property `propToFind` in `obj`.
+ * 
+ * If there is no such property, it returns `undefined`.
+ */
+export function prop<K extends PropertyKey>(prop: K): <U extends { [P in K]?: unknown }>(obj: U) => U[K];
+export function prop<K extends keyof U, U>(prop: K, obj: U): U[K];
+
+/**
+ * It returns true if `obj` has property `propToFind` and its value is equal to `valueToMatch`.
+ */
+export function propEq<T>(val: T): {
+  <K extends PropertyKey>(name: K): (obj: Record<K, T>) => boolean;
+  <K extends PropertyKey>(name: K, obj: Record<K, T>): boolean;
+};
+export function propEq<T, K extends PropertyKey>(val: T, name: K): (obj: Record<K, T>) => boolean;
+export function propEq<K extends keyof U, U>(val: U[K], name: K, obj: U): boolean;
+
+/**
+ * It returns either `defaultValue` or the value of `property` in `obj`.
+ */
+export function propOr<T, P extends string>(defaultValue: T, property: P): (obj: Partial<Record<P, T>>) => T;
+
+/**
+ * It returns `true` if the object property satisfies a given predicate.
+ */
+export function propSatisfies<T>(predicate: (x: T) => boolean, property: string): (obj: Record<PropertyKey, T>) => boolean;
+
+/**
+ * It returns list of numbers between `startInclusive` to `endExclusive` markers.
+ * If `start` is greater than `end`, then the result will be in descending order.
+ */
+export function range(startInclusive: number): (endExclusive: number) => number[];
+
+export function reduce<T, TResult>(reducer: (prev: TResult, current: T, i: number) => TResult, initialValue: TResult): (list: T[]) => TResult;
+
+/**
+ * It has the opposite effect of `R.filter`.
+ */
+export function reject<T>(
+	predicate: (value: T) => boolean,
+  list: T[],
+): T[];
+export function reject<T>(
+	predicate: BooleanConstructor,
+): (list: readonly T[]) => ("" | null | undefined | false | 0)[];
+export function reject<T>(
+	predicate: BooleanConstructor,
+): (list: T[]) => ("" | null | undefined | false | 0)[];
+export function reject<T>(
+	predicate: (value: T) => boolean,
+): (list: T[]) => T[];
+
+/**
+ * Same as `R.filterObject` but it returns the object with properties that do not satisfy the predicate function.
+ */
+export function rejectObject<T extends object>(
+  valueMapper: (
+    value: EnumerableStringKeyedValueOf<T>,
+    key: EnumerableStringKeyOf<T>,
+    data: T,
+  ) => boolean,
+): <U extends T>(data: T) => U;
+
+/**
+ * It replaces `strOrRegex` found in `str` with `replacer`.
+ */
+export function replace(strOrRegex: RegExp | string, replacer: RegExp | string): (str: string) => string;
+
+/**
+ * It returns a randomized copy of array.
+ */
+export function shuffle<T>(list: T[]): T[];
+
+/**
+ * It returns copy of `list` sorted by `sortFn` function, where `sortFn` needs to return only `-1`, `0` or `1`.
+ */
+export function sort<T>(sortFn: (a: T, b: T) => number): (list: T[]) => T[];
+
+/**
+ * It returns copy of `list` sorted by `sortFn` function, where `sortFn` function returns a value to compare, i.e. it doesn't need to return only `-1`, `0` or `1`.
+ */
+export function sortBy<T>(sortFn: (x: T) => Ord): (list: T[]) => T[];
+
+export function sortByDescending<T>(sortFn: (a: T, b: T) => number): (list: T[]) => T[];
+
+/**
+ * It sorts `list` by the value of `path` property.
+ */
+export function sortByPath<S, K0 extends string & keyof S>(
+  path: [K0]
+): (list: S[]) => S[];
+export function sortByPath<S, K0 extends string & keyof S>(
+  path: `${K0}`
+): (list: S[]) => S[];
+export function sortByPath<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(
+  path: [K0, K1]
+): (list: S[]) => S[];
+export function sortByPath<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(
+  path: `${K0}.${K1}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(
+  path: [K0, K1, K2]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(
+  path: `${K0}.${K1}.${K2}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(
+  path: [K0, K1, K2, K3]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(
+  path: [K0, K1, K2, K3, K4]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(
+  path: [K0, K1, K2, K3, K4, K5]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(
+  path: [K0, K1, K2, K3, K4, K5, K6]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(
+  path: [K0, K1, K2, K3, K4, K5, K6, K7]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}`
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(
+  path: [K0, K1, K2, K3, K4, K5, K6, K7, K8]
+): (list: S[]) => S[];
+export function sortByPath<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}.${K8}`
+): (list: S[]) => S[];
+
+export function sortByPathDescending<S, K0 extends string & keyof S>(
+  path: [K0]
+): (list: S[]) => S[];
+export function sortByPathDescending<S, K0 extends string & keyof S>(
+  path: `${K0}`
+): (list: S[]) => S[];
+export function sortByPathDescending<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(
+  path: [K0, K1]
+): (list: S[]) => S[];
+export function sortByPathDescending<S, K0 extends string & keyof S, K1 extends string & keyof S[K0]>(
+  path: `${K0}.${K1}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(
+  path: [K0, K1, K2]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1]
+>(
+  path: `${K0}.${K1}.${K2}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(
+  path: [K0, K1, K2, K3]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(
+  path: [K0, K1, K2, K3, K4]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(
+  path: [K0, K1, K2, K3, K4, K5]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(
+  path: [K0, K1, K2, K3, K4, K5, K6]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(
+  path: [K0, K1, K2, K3, K4, K5, K6, K7]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}`
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(
+  path: [K0, K1, K2, K3, K4, K5, K6, K7, K8]
+): (list: S[]) => S[];
+export function sortByPathDescending<
+  S,
+  K0 extends string & keyof S,
+  K1 extends string & keyof S[K0],
+  K2 extends string & keyof S[K0][K1],
+  K3 extends string & keyof S[K0][K1][K2],
+  K4 extends string & keyof S[K0][K1][K2][K3],
+  K5 extends string & keyof S[K0][K1][K2][K3][K4],
+  K6 extends string & keyof S[K0][K1][K2][K3][K4][K5],
+  K7 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6],
+  K8 extends string & keyof S[K0][K1][K2][K3][K4][K5][K6][K7]
+>(
+  path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}.${K7}.${K8}`
+): (list: S[]) => S[];
+
+/**
+ * It returns a sorted version of `input` object.
+ */
+export function sortObject<T, K extends string & keyof T>(predicate: (aProp: string, bProp: string, aValue: T[K], bValue: T[K]) => number): (obj: T) => T;
+export function sortObject<T>(predicate: (aProp: string, bProp: string) => number): (obj: T) => T;
+
+export function sortWith<T>(fns: Array<(a: T, b: T) => number>): (list: T[]) => T[];
+
+export function split(separator: string | RegExp): (str: string) => string[];
+
+/**
+ * It splits `input` into slices of `sliceLength`.
+ */
+export function splitEvery<T>(sliceLength: number): (input: T[]) => (T[])[];
+
+/**
+ * It returns a merged list of `x` and `y` with all equal elements removed.
+ * 
+ * `R.equals` is used to determine equality.
+ */
+export function symmetricDifference<T>(x: T[]): <T>(y: T[]) => T[];
+
+/**
+ * It returns all but the first element of `input`.
+ */
+export function tail<T extends unknown[]>(input: T): T extends [any, ...infer U] ? U : [...T];
+export function tail(input: string): string;
+
+/**
+ * It returns the first `howMany` elements of `input`.
+ */
+export function take<T>(howMany: number): {
+  (input: string): string;
+  (input: T[]): T[];
+  (input: readonly T[]): T[];
+};
+
+/**
+ * It returns the last `howMany` elements of `input`.
+ */
+export function takeLast<T>(howMany: number): {
+  (input: string): string;
+  (input: T[]): T[];
+  (input: readonly T[]): T[];
+};
+
+export function takeLastWhile<T>(predicate: (x: T) => boolean): (input: T[]) => T[];
+export function takeLastWhile<T>(predicate: (x: T, index: number) => boolean): (list: T[]) => T[];
+
+export function takeWhile<T>(predicate: (x: T, index: number) => boolean): (list: T[]) => T[];
+export function takeWhile<T>(predicate: (x: T) => boolean): (input: T[]) => T[];
+
+/**
+ * It applies function `fn` to input `x` and returns `x`.
+ * 
+ * One use case is debugging in the middle of `R.pipe` chain.
+ */
+export function tap<T>(fn: (x: T) => void): (input: T) => T;
+
+/**
+ * It determines whether `str` matches `regExpression`.
+ */
+export function test(regExpression: RegExp): (str: string) => boolean;
+
+/**
+ * It returns function that runs `fn` in `try/catch` block. If there was an error, then `fallback` is used to return the result.
+ */
+export function tryCatch<T, U>(
+  fn: (input: T) => U,
+  fallback: U
+): (input: T) => U;
+
+/**
+ * It accepts any input and it returns its type.
+ */
+export function type(x: any): RambdaTypes;
+
+/**
+ * It takes two lists and return a new list containing a merger of both list with removed duplicates.
+ * 
+ * `R.equals` is used to compare for duplication.
+ */
+export function union<T>(x: T[]): (y: T[]) => T[];
+
+/**
+ * It returns a new array containing only one copy of each element of `list`.
+ * 
+ * `R.equals` is used to determine equality.
+ */
+export function uniq<T>(list: T[]): T[];
+
+/**
+ * It applies uniqueness to input list based on function that defines what to be used for comparison between elements.
+ * 
+ * `R.equals` is used to determine equality.
+ */
+export function uniqBy<T, U>(fn: (x: T) => U): (list: T[]) => T[];
+
+/**
+ * It returns a new array containing only one copy of each element in `list` according to `predicate` function.
+ * 
+ * This predicate should return true, if two elements are equal.
+ */
+export function uniqWith<T>(predicate: (x: T, y: T) => boolean): (list: T[]) => T[];
+
+/**
+ * The method returns function that will be called with argument `input`.
+ * 
+ * If `predicate(input)` returns `false`, then the end result will be the outcome of `whenFalse(input)`.
+ * 
+ * In the other case, the final output will be the `input` itself.
+ */
+export function unless<T, U>(predicate: (x: T) => boolean, whenFalseFn: (x: T) => U): (x: T) => T | U;
+export function unless<T>(predicate: (x: T) => boolean, whenFalseFn: (x: T) => T): (x: T) => T;
+
+/**
+ * It takes an object and a property name. The method will return a list of objects, where each object is a shallow copy of the input object, but with the property array unwound.
+ */
+export function unwind<S extends string>(prop: S): <T extends Record<S, readonly any[]>>(obj: T) => Array<MergeTypes<Omit<T, S> & { [K in S]: T[S][number] }>>;
+
+/**
+ * It returns a copy of `list` with updated element at `index` with `newValue`.
+ */
+export function update<T>(index: number, newValue: T): (list: T[]) => T[];
+
+/**
+ * It pass `input` to `predicate` function and if the result is `true`, it will return the result of `whenTrueFn(input)`.
+ * If the `predicate` returns `false`, then it will simply return `input`.
+ */
+export function when<T, U extends T>(predicate: (x: T) => x is U, whenTrueFn: (x: U) => T): (input: T) => T;
+export function when<T>(predicate: (x: T) => boolean, whenTrueFn: (x: T) => T): (input: T) => T;
+export function when<T, U>(predicate: (x: T) => boolean, whenTrueFn: (x: T) => U): (input: T) => T | U;
+
+/**
+ * It will return a new array containing tuples of equally positions items from both `x` and `y` lists.
+ * 
+ * The returned list will be truncated to match the length of the shortest supplied list.
+ */
+export function zip<K>(x: K[]): <V>(y: V[]) => KeyValuePair<K, V>[];
+
+export function zipWith<T, U, TResult>(
+  fn: (x: T, y: U) => TResult,
+  list1: readonly T[],
+): (list2: readonly U[]) => TResult[];