npm - rambda - Versions diffs - 9.4.2 → 10.0.0-alpha.0 - Mend

rambda 9.4.2 → 10.0.0-alpha.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (257) hide show

package/CHANGELOG.md +69 -1
package/README.md +4637 -13433
package/dist/rambda.esm.js +1487 -0
package/dist/rambda.js +952 -2113
package/dist/rambda.umd.js +1595 -1
package/immutable.d.ts +1066 -1293
package/index.d.ts +1066 -1293
package/package.json +95 -94
package/rambda.js +10 -138
package/src/_internals/baseSlice.js +5 -7
package/src/_internals/createPath.js +4 -6
package/src/_internals/includes.js +8 -4
package/src/_internals/set.js +11 -11
package/src/all.js +8 -6
package/src/allPass.js +4 -4
package/src/any.js +10 -10
package/src/anyPass.js +4 -4
package/src/append.js +4 -6
package/src/checkObjectWithSpec.js +16 -0
package/src/complement.js +1 -1
package/src/concat.js +2 -4
package/src/count.js +5 -4
package/src/countBy.js +6 -7
package/src/defaultTo.js +4 -6
package/src/drop.js +4 -2
package/src/dropLast.js +4 -8
package/src/dropLastWhile.js +17 -26
package/src/dropWhile.js +14 -22
package/src/eqBy.js +3 -8
package/src/eqProps.js +3 -8
package/src/equals.js +99 -58
package/src/evolve.js +19 -52
package/src/excludes.js +5 -0
package/src/filter.js +10 -40
package/src/filterObject.js +13 -0
package/src/find.js +6 -6
package/src/findIndex.js +5 -5
package/src/findLast.js +6 -6
package/src/findLastIndex.js +5 -5
package/src/flatMap.js +3 -0
package/src/flatten.js +5 -5
package/src/groupBy.js +9 -7
package/src/head.js +5 -3
package/src/includes.js +10 -7
package/src/indexOf.js +2 -6
package/src/init.js +6 -8
package/src/innerJoin.js +11 -19
package/src/intersection.js +2 -4
package/src/intersperse.js +7 -7
package/src/join.js +2 -4
package/src/last.js +4 -4
package/src/lastIndexOf.js +2 -6
package/src/map.js +9 -49
package/src/mapAsync.js +11 -0
package/src/mapObject.js +18 -0
package/src/mapObjectAsync.js +10 -0
package/src/match.js +6 -6
package/src/maxBy.js +2 -8
package/src/merge.js +4 -1
package/src/mergeTypes.js +3 -0
package/src/minBy.js +2 -8
package/src/modifyPath.js +22 -25
package/src/none.js +8 -6
package/src/objOf.js +2 -6
package/src/omit.js +26 -11
package/src/partition.js +20 -23
package/src/path.js +14 -15
package/src/pick.js +15 -15
package/src/pipe.js +70 -13
package/src/pipeAsync.js +10 -0
package/src/pluck.js +7 -9
package/src/prepend.js +2 -6
package/src/prop.js +2 -10
package/src/propEq.js +8 -10
package/src/propOr.js +7 -8
package/src/propSatisfies.js +2 -7
package/src/range.js +3 -3
package/src/reduce.js +15 -30
package/src/reject.js +2 -4
package/src/replace.js +2 -8
package/src/replaceItemAtIndex.js +15 -0
package/src/sort.js +2 -4
package/src/sortBy.js +3 -3
package/src/sortWith.js +9 -13
package/src/split.js +2 -4
package/src/splitEvery.js +6 -8
package/src/symmetricDifference.js +5 -8
package/src/tail.js +2 -2
package/src/take.js +11 -9
package/src/takeLast.js +14 -14
package/src/takeLastWhile.js +19 -20
package/src/takeWhile.js +12 -21
package/src/tap.js +3 -3
package/src/test.js +2 -8
package/src/tryCatch.js +5 -14
package/src/type.js +6 -5
package/src/union.js +10 -8
package/src/uniq.js +2 -2
package/src/uniqBy.js +5 -6
package/src/uniqWith.js +10 -14
package/src/unless.js +7 -9
package/src/unwind.js +6 -14
package/src/update.js +8 -11
package/src/when.js +7 -9
package/src/zip.js +8 -8
package/src/zipWith.js +5 -7
package/src/F.js +0 -3
package/src/T.js +0 -3
package/src/_internals/_arity.js +0 -64
package/src/_internals/compare.js +0 -3
package/src/_internals/constants.js +0 -1
package/src/_internals/createPathInput.js +0 -7
package/src/_internals/isFalsy.js +0 -13
package/src/_internals/isInteger.js +0 -10
package/src/_internals/isIterable.js +0 -5
package/src/_internals/isObject.js +0 -5
package/src/_internals/isTruthy.js +0 -13
package/src/_internals/objectIs.js +0 -9
package/src/_internals/utils.js +0 -21
package/src/add.js +0 -5
package/src/addIndex.js +0 -23
package/src/addIndexRight.js +0 -9
package/src/adjust.js +0 -16
package/src/always.js +0 -3
package/src/and.js +0 -5
package/src/ap.js +0 -7
package/src/aperture.js +0 -15
package/src/apply.js +0 -7
package/src/applySpec.js +0 -132
package/src/applyTo.js +0 -7
package/src/ascend.js +0 -23
package/src/assoc.js +0 -11
package/src/assocPath.js +0 -46
package/src/binary.js +0 -5
package/src/bind.js +0 -9
package/src/both.js +0 -5
package/src/call.js +0 -1
package/src/chain.js +0 -7
package/src/clamp.js +0 -15
package/src/clone.js +0 -18
package/src/collectBy.js +0 -27
package/src/comparator.js +0 -5
package/src/compose.js +0 -9
package/src/composeWith.js +0 -33
package/src/cond.js +0 -14
package/src/converge.js +0 -18
package/src/curry.js +0 -7
package/src/curryN.js +0 -40
package/src/dec.js +0 -1
package/src/descend.js +0 -17
package/src/difference.js +0 -8
package/src/differenceWith.js +0 -20
package/src/dissoc.js +0 -13
package/src/dissocPath.js +0 -47
package/src/divide.js +0 -5
package/src/dropRepeats.js +0 -20
package/src/dropRepeatsBy.js +0 -21
package/src/dropRepeatsWith.js +0 -28
package/src/either.js +0 -8
package/src/empty.js +0 -15
package/src/endsWith.js +0 -23
package/src/flip.js +0 -23
package/src/forEach.js +0 -19
package/src/forEachObjIndexed.js +0 -24
package/src/fromPairs.js +0 -6
package/src/groupWith.js +0 -46
package/src/gt.js +0 -6
package/src/gte.js +0 -6
package/src/has.js +0 -7
package/src/hasIn.js +0 -9
package/src/hasPath.js +0 -9
package/src/identical.js +0 -7
package/src/identity.js +0 -3
package/src/ifElse.js +0 -17
package/src/inc.js +0 -1
package/src/indexBy.js +0 -29
package/src/insert.js +0 -11
package/src/insertAll.js +0 -7
package/src/is.js +0 -8
package/src/isEmpty.js +0 -18
package/src/isNil.js +0 -3
package/src/isNotEmpty.js +0 -5
package/src/isNotNil.js +0 -3
package/src/isPromise.js +0 -5
package/src/juxt.js +0 -3
package/src/keys.js +0 -3
package/src/length.js +0 -8
package/src/lens.js +0 -7
package/src/lensIndex.js +0 -7
package/src/lensPath.js +0 -7
package/src/lensProp.js +0 -7
package/src/lt.js +0 -6
package/src/lte.js +0 -6
package/src/mathMod.js +0 -8
package/src/max.js +0 -5
package/src/maybe.js +0 -13
package/src/mean.js +0 -5
package/src/median.js +0 -17
package/src/mergeAll.js +0 -11
package/src/mergeDeepLeft.js +0 -5
package/src/mergeDeepRight.js +0 -24
package/src/mergeLeft.js +0 -7
package/src/mergeRight.js +0 -8
package/src/mergeWith.js +0 -25
package/src/min.js +0 -5
package/src/modify.js +0 -23
package/src/modulo.js +0 -5
package/src/move.js +0 -19
package/src/multiply.js +0 -5
package/src/negate.js +0 -3
package/src/not.js +0 -3
package/src/nth.js +0 -9
package/src/of.js +0 -3
package/src/on.js +0 -16
package/src/once.js +0 -24
package/src/or.js +0 -5
package/src/over.js +0 -14
package/src/partial.js +0 -17
package/src/partialObject.js +0 -5
package/src/pathEq.js +0 -11
package/src/pathOr.js +0 -11
package/src/pathSatisfies.js +0 -9
package/src/paths.js +0 -9
package/src/pickAll.js +0 -23
package/src/pickBy.js +0 -11
package/src/product.js +0 -4
package/src/propIs.js +0 -10
package/src/props.js +0 -13
package/src/reduceBy.js +0 -29
package/src/removeIndex.js +0 -7
package/src/repeat.js +0 -7
package/src/reverse.js +0 -9
package/src/set.js +0 -9
package/src/slice.js +0 -9
package/src/splitAt.js +0 -21
package/src/splitWhen.js +0 -25
package/src/startsWith.js +0 -23
package/src/subtract.js +0 -5
package/src/sum.js +0 -3
package/src/swap.js +0 -42
package/src/times.js +0 -12
package/src/toLower.js +0 -3
package/src/toPairs.js +0 -3
package/src/toString.js +0 -3
package/src/toUpper.js +0 -3
package/src/transpose.js +0 -10
package/src/trim.js +0 -3
package/src/unapply.js +0 -5
package/src/unnest.js +0 -9
package/src/values.js +0 -6
package/src/view.js +0 -10
package/src/where.js +0 -15
package/src/whereAny.js +0 -12
package/src/whereEq.js +0 -14
package/src/without.js +0 -15
package/src/xor.js +0 -5
package/src/zipObj.js +0 -13

package/index.d.ts CHANGED Viewed

@@ -1,65 +1,59 @@
 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 NonEmptyArray<T> = [T, ...T[]];
 export type ReadonlyNonEmptyArray<T> = readonly [T, ...T[]];
+export type IterableContainer<T = unknown> = ReadonlyArray<T> | readonly [];
-type LastArrayElement<ValueType extends readonly unknown[]> =
-	ValueType extends readonly [infer ElementType]
-		? ElementType
-		: ValueType extends readonly [infer _, ...infer Tail]
-			? LastArrayElement<Tail>
-			: ValueType extends ReadonlyArray<infer ElementType>
-				? ElementType
-				: never;
-type FirstArrayElement<ValueType extends readonly unknown[]> =
-	ValueType extends readonly [infer ElementType]
-		? ElementType
-		: ValueType extends readonly [...infer Head, infer _]
-			? FirstArrayElement<Head>
-			: ValueType extends ReadonlyArray<infer ElementType>
-				? ElementType
-				: never;
-export function reduceStopper<T>(input: T) : T
-export type IndexedIterator<T, U> = (x: T, i: number) => U;
-export type Iterator<T, U> = (x: T) => U;
-export type ObjectIterator<T, U> = (x: T, prop: string, inputObj: Dictionary<T>) => U;
-type Ord = number | string | boolean | Date;
-type Ordering = -1 | 0 | 1;
-type Path = string | (number | string)[];
-export type RamdaPath = (number | string)[];
-export type Predicate<T> = (x: T) => boolean;
-export type IndexedPredicate<T> = (x: T, i: number) => boolean;
-export type ObjectPredicate<T> = (x: T, prop: string, inputObj: Dictionary<T>) => boolean;
-type CondPair<T extends any[], R> = [(...val: T) => boolean, (...val: T) => R]
+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 Simplify<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;
+type Path = Array<string> | string;
 type Prop<T, P extends keyof never> = P extends keyof Exclude<T, undefined>
     ? T extends undefined ? undefined : T[Extract<P, keyof T>]
     : undefined;
-type ValueOfRecord<R> =
-  R extends Record<any, infer T>
-  ? T
-  : never;
 interface KeyValuePair<K, V> extends Array<K | V> {
   0: K;
   1: V;
 }
 export type Functor<A> = { map: <B>(fn: (a: A) => B) => Functor<B>; [key: string]: any };
-export type Lens<S, A> = (functorFactory: (a: A) => Functor<A>) => (s: S) => Functor<S>;
-export type ObjPred<T = unknown> = (value: any, key: unknown extends T ? string : keyof T) => boolean;
+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;
-type Arity1Fn = (x: any) => any;
-type Arity2Fn = (x: any, y: any) => any;
-type Pred = (...x: any[]) => boolean;
+export type PickStringToPickPath<T> = T extends `${infer Head},${infer Tail}` 		? [Head, ...PickStringToPickPath<Tail>]
+	: T extends `${infer Head}` ? [Head]
+	: [];
-export interface Dictionary<T> {[index: string]: T}
-type Partial<T> = { [P in keyof T]?: T[P]};
-type _TupleOf<T, N extends number, R extends unknown[]> = R['length'] extends N ? R : _TupleOf<T, N, [T, ...R]>;
-export type Tuple<T, N extends number> = N extends N ? (number extends N ? T[] : _TupleOf<T, N, []>) : never;
+export type Partial<T> = { [P in keyof T]?: T[P]};
 type Evolvable<E extends Evolver> = {[P in keyof E]?: Evolved<E[P]>};
@@ -92,257 +86,93 @@ type EvolveValue<V, E> =
       ? EvolveNestedValue<V, E>
       : never;
-type AtLeastOneFunctionsFlowFromRightToLeft<TArgs extends any[], TResult> =
-    | [(...args: any) => TResult, ...Array<(args: any) => any>, (...args: TArgs) => any]
-    | [(...args: TArgs) => TResult];
-type AnyFunction = (...args: any[]) => unknown;
-type AnyConstructor = new (...args: any[]) => unknown;
-type RegExpReplacerFn =
-  | ((m: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, p4: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, p4: string, p5: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, p4: string, p5: string, p6: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, p4: string, p5: string, p6: string, p7: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, p4: string, p5: string, p6: string, p7: string, p8: string, offset: number, s: string, groups?: Record<string, string>) => string)
-  | ((m: string, p1: string, p2: string, p3: string, p4: string, p5: string, p6: string, p7: string, p8: string, p9: string, offset: number, s: string, groups?: Record<string, string>) => string)
-type RegExpReplacer = string | RegExpReplacerFn
-/** `First`, when `First` is a supertype of `Second`; otherwise `never`. */
-type IsFirstSubtypeOfSecond<First, Second> = (First extends Second ? Second : never);
-// RAMBDAX INTERFACES
-// ============================================
-type Func<T> = (input: any) => T;
-type VoidInputFunc<T> = () => T;
-type Fn<In, Out> = (x: In) => Out;
-export type SortObjectPredicate<T> = (aProp: string, bProp: string, aValue: T, bValue: T) => number;
-export type IdentityFunction<T> = (x: T) => T;
-interface Filter<T> {
-  (list: T[]): T[];
-  (obj: Dictionary<T>): Dictionary<T>;
-}
-type ArgumentTypes<T> = T extends (...args: infer U) => infer R ? U : never;
-type isfn<T> = (x: any, y: any) => T;
-interface Switchem<T> {
-  is: isfn<Switchem<T>>;
-  default: IdentityFunction<T>;
-}
-interface Schema {
-  [key: string]: any;
-}
-interface SchemaAsync {
-  [key: string]: Promise<boolean>;
-}
-export interface IsValid {
-  input: object;
-  schema: Schema;
-}
-export interface IsValidAsync {
-  input: object;
-  schema: Schema | SchemaAsync;
-}
-export type ProduceRules<Output,K extends keyof Output, Input> = {   [P in K]: (input: Input) => Output[P];
-};
-export type ProduceAsyncRules<Output,K extends keyof Output, Input> = {   [P in K]: (input: Input) => Promise<Output[P]>;
-};
-type ProduceAsyncRule<Input> = (input: Input) => Promise<any>;
-type Async<T> = (x: any) => Promise<T>;
-type AsyncIterable<T, K> = (x: T) => Promise<K>;
-type AsyncIterableIndexed<T, K> = (x: T, i: number) => Promise<K>;
-type AsyncPredicate<T> = (x: T) => Promise<boolean>;
-type AsyncPredicateIndexed<T> = (x: T, i: number) => Promise<boolean>;
-type AsyncWithProp<T> = (x: any, prop?: string) => Promise<T>;
-export type ApplyDiffUpdate = {op:'update', path: string, value: any};
-export type ApplyDiffAdd = {op:'add', path: string, value: any};
-export type ApplyDiffRemove = {op:'remove', path: string};
-export type ApplyDiffRule = ApplyDiffUpdate | ApplyDiffAdd | ApplyDiffRemove;
-export function F(): boolean;
+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;
+}>;
 export function T(): boolean;
 /**
  * It adds `a` and `b`.
  */
-export function add(a: number, b: number): number;
 export function add(a: number): (b: number) => number;
-export function addIndex(originalFn: any): (fn: any) => (list: any[]) => any[];
-export function addIndex(originalFn: any): (fn: any, list: any[]) => any[];
-/**
- * Same as `R.addIndex`, but it will passed indexes are decreasing, instead of increasing.
- */
-export function addIndexRight(originalFn: any): (fn: any) => (list: any[]) => any[];
-export function addIndexRight(originalFn: any): (fn: any, list: any[]) => any[];
-/**
- * It replaces `index` in array `list` with the result of `replaceFn(list[i])`.
- */
-export function adjust<T>(index: number, replaceFn: (x: T) => T, list: T[]): T[];
-export function adjust<T>(index: number, replaceFn: (x: T) => T): (list: T[]) => T[];
 /**
  * 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;
 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<T>(predicates: ((x: T) => boolean)[]): (input: T) => boolean;
-export function allPass<T>(predicates: ((...inputs: T[]) => boolean)[]): (...inputs: T[]) => boolean;
-/**
- * It returns function that always returns `x`.
- */
-export function always<T>(x: T): (...args: unknown[]) => T;
-/**
- * Logical AND
- */
-export function and<T, U>(x: T, y: U): T | U;
-export function and<T>(x: T): <U>(y: U) => T | U;
+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;
 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>(predicates: ((x: T) => boolean)[]): (input: T) => boolean;
-export function anyPass<T>(predicates: ((...inputs: T[]) => boolean)[]): (...inputs: T[]) => boolean;
-/**
- * It takes a list of functions and a list of values. Then it returns a list of values obtained by applying each function to each value.
- */
-export function ap<T, U>(fns: Array<(a: T) => U>[], vs: T[]): U[];
-export function ap<T, U>(fns: Array<(a: T) => U>): (vs: T[]) => U[];
-export function ap<R, A, B>(fn: (r: R, a: A) => B, fn1: (r: R) => A): (r: R) => B;
-/**
- * It returns a new list, composed of consecutive `n`-tuples from a `list`.
- */
-export function aperture<N extends number, T>(n: N, list: T[]): Array<Tuple<T, N>> | [];
-export function aperture<N extends number>(n: N): <T>(list: T[]) => Array<Tuple<T, N>> | [];
+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>(xToAppend: T, iterable: T[]): T[];
-export function append<T, U>(xToAppend: T, iterable: IsFirstSubtypeOfSecond<T, U>[]) : U[];
-export function append<T>(xToAppend: T): <U>(iterable: IsFirstSubtypeOfSecond<T, U>[]) => U[];
-export function append<T>(xToAppend: T): (iterable: T[]) => T[];
-/**
- * It applies function `fn` to the list of arguments.
- *
- * This is useful for creating a fixed-arity function from a variadic function. `fn` should be a bound function if context is significant.
- */
-export function apply<T = any>(fn: (...args: any[]) => T, args: any[]): T;
-export function apply<T = any>(fn: (...args: any[]) => T): (args: any[]) => T;
-export function applySpec<Spec extends Record<string, AnyFunction>>(
-  spec: Spec
-): (
-  ...args: Parameters<ValueOfRecord<Spec>>
-) => { [Key in keyof Spec]: ReturnType<Spec[Key]> };
-export function applySpec<T>(spec: any): (...args: unknown[]) => T;
-export function applyTo<T, U>(el: T, fn: (t: T) => U): U;
-export function applyTo<T>(el: T): <U>(fn: (t: T) => U) => U;
-export function ascend<T>(fn: (obj: T) => Ord, a: T, b: T): Ordering;
-export function ascend<T>(fn: (obj: T) => Ord): (a: T, b: T) => Ordering;
-/**
- * It makes a shallow clone of `obj` with setting or overriding the property `prop` with `newValue`.
- */
-export function assoc<K extends PropertyKey>(prop: K): {
-  <T>(val: T): <U extends Record<K, T>>(obj: U) => U;
-  <U extends Record<K, T>, T>(val: T, obj: U): U;
-};
-export function assoc<T, K extends PropertyKey>(prop: K, val: T): {
-  <U>(obj: U): U extends Record<K, any> ? U[K] extends T ? U : Record<K, T> & Omit<U, K> : U & Record<K, T>;
-};
-export function assoc<U, K extends keyof U, T extends U[K]>(prop: K, val: T, obj: U): U;
-/**
- * It makes a shallow clone of `obj` with setting or overriding with `newValue` the property found with `path`.
- */
-export function assocPath<Output>(path: Path, newValue: any, obj: object): Output;
-export function assocPath<Output>(path: Path, newValue: any): (obj: object) => Output;
-export function assocPath<Output>(path: Path): (newValue: any) => (obj: object) => Output;
-export function binary<T extends (...arg: any[]) => any>(fn: T): (...args: any[]) => ReturnType<T>;
+export function append<T>(el: T): (list: T[]) => T[];
+export function append<T>(el: T): (list: readonly T[]) => T[];
 /**
- * Creates a function that is bound to a context.
- */
-export function bind<F extends AnyFunction, T>(fn: F, thisObj: T): (...args: Parameters<F>) => ReturnType<F>;
-export function bind<F extends AnyFunction, T>(fn: F): (thisObj: T) => (...args: Parameters<F>) => ReturnType<F>;
-/**
- * It returns a function with `input` argument.
- *
- * This function will return `true`, if both `firstCondition` and `secondCondition` return `true` when `input` is passed as their argument.
- */
-export function both(pred1: Pred, pred2: Pred): Pred;
-export function both<T>(pred1: Predicate<T>, pred2: Predicate<T>): Predicate<T>;
-export function both<T>(pred1: Predicate<T>): (pred2: Predicate<T>) => Predicate<T>;
-export function both(pred1: Pred): (pred2: Pred) => Pred;
-export function call<T extends (...args: any[]) => any>(fn: T, ...args: Parameters<T>): ReturnType<T>;
-/**
- * The method is also known as `flatMap`.
- */
-export function chain<T, U>(fn: (n: T) => U[], list: T[]): U[];
-export function chain<T, U>(fn: (n: T) => U[]): (list: T[]) => U[];
-/**
- * Restrict a number `input` to be within `min` and `max` limits.
- *
- * If `input` is bigger than `max`, then the result is `max`.
- *
- * If `input` is smaller than `min`, then the result is `min`.
- */
-export function clamp(min: number, max: number, input: number): number;
-export function clamp(min: number, max: number): (input: number) => number;
-/**
- * It creates a deep copy of the `input`, which may contain (nested) Arrays and Objects, Numbers, Strings, Booleans and Dates.
- */
-export function clone<T>(input: T): T;
-export function clone<T>(input: T[]): T[];
-export function collectBy<T, K extends PropertyKey>(keyFn: (value: T) => K, list: T[]): T[][];
-export function collectBy<T, K extends PropertyKey>(keyFn: (value: T) => K): (list: T[]) => T[][];
-/**
- * It returns a comparator function that can be used in `sort` method.
+ * It returns `true` if all each property in `conditions` returns `true` when applied to corresponding property in `input` object.
  */
-export function comparator<T>(pred: (a: T, b: T) => boolean): (x: T, y: T) => Ordering;
+export function checkObjectWithSpec<T>(spec: T): <U>(testObj: U) => boolean;
 /**
  * It returns `inverted` version of `origin` function that accept `input` as argument.
@@ -351,129 +181,21 @@ export function comparator<T>(pred: (a: T, b: T) => boolean): (x: T, y: T) => Or
  */
 export function complement<T extends any[]>(predicate: (...args: T) => unknown): (...args: T) => boolean;
-/**
- * It performs right-to-left function composition.
- */
-export function compose<TArgs extends any[], R1, R2, R3, R4, R5, R6, R7, TResult>(
-  ...func: [
-      fnLast: (a: any) => TResult,
-      ...func: Array<(a: any) => any>,
-      f7: (a: R6) => R7,
-      f6: (a: R5) => R6,
-      f5: (a: R4) => R5,
-      f4: (a: R3) => R4,
-      f3: (a: R2) => R3,
-      f2: (a: R1) => R2,
-      f1: (...args: TArgs) => R1
-  ]
-): (...args: TArgs) => TResult;
-export function compose<TArgs extends any[], R1, R2, R3, R4, R5, R6, R7, TResult>(
-  f7: (a: R6) => R7,
-  f6: (a: R5) => R6,
-  f5: (a: R4) => R5,
-  f4: (a: R3) => R4,
-  f3: (a: R2) => R3,
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R7;
-export function compose<TArgs extends any[], R1, R2, R3, R4, R5, R6, R7>(
-  f7: (a: R6) => R7,
-  f6: (a: R5) => R6,
-  f5: (a: R4) => R5,
-  f4: (a: R3) => R4,
-  f3: (a: R2) => R3,
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R7;
-export function compose<TArgs extends any[], R1, R2, R3, R4, R5, R6>(
-  f6: (a: R5) => R6,
-  f5: (a: R4) => R5,
-  f4: (a: R3) => R4,
-  f3: (a: R2) => R3,
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R6;
-export function compose<TArgs extends any[], R1, R2, R3, R4, R5>(
-  f5: (a: R4) => R5,
-  f4: (a: R3) => R4,
-  f3: (a: R2) => R3,
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R5;
-export function compose<TArgs extends any[], R1, R2, R3, R4>(
-  f4: (a: R3) => R4,
-  f3: (a: R2) => R3,
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R4;
-export function compose<TArgs extends any[], R1, R2, R3>(
-  f3: (a: R2) => R3,
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R3;
-export function compose<TArgs extends any[], R1, R2>(
-  f2: (a: R1) => R2,
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R2;
-export function compose<TArgs extends any[], R1>(
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R1;
-export function composeWith<TArgs extends any[], TResult>(
-  transformer: (fn: (...args: any[]) => any, intermediatResult: any) => any,
-  fns: AtLeastOneFunctionsFlowFromRightToLeft<TArgs, TResult>,
-): (...args: TArgs) => TResult;
-export function composeWith(
-  transformer: (fn: (...args: any[]) => any, intermediatResult: any) => any,
-): <TArgs extends any[], TResult>(
-  fns: AtLeastOneFunctionsFlowFromRightToLeft<TArgs, TResult>,
-) => (...args: TArgs) => TResult;
 /**
  * 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<T>(x: T[]): (y: T[]) => T[];
-export function concat(x: string, y: string): string;
 export function concat(x: string): (y: string) => string;
-/**
- * It takes list with `conditions` and returns a new function `fn` that expects `input` as argument.
- *
- * This function will start evaluating the `conditions` in order to find the first winner(order of conditions matter).
- *
- * The winner is this condition, which left side returns `true` when `input` is its argument. Then the evaluation of the right side of the winner will be the final result.
- *
- * If no winner is found, then `fn` returns `undefined`.
- */
-export function cond<T extends any[], R>(conditions: Array<CondPair<T, R>>): (...args: T) => R;
-/**
- * Accepts a converging function and a list of branching functions and returns a new function. When invoked, this new function is applied to some arguments, each branching function is applied to those same arguments. The results of each branching function are passed as arguments to the converging function to produce the return value.
- */
-export function converge(after: ((...a: any[]) => any), fns: ((...x: any[]) => any)[]): (...y: any[]) => any;
 /**
  * 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;
 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 extends unknown>(transformFn: (x: T) => any, list: T[]): Record<string, number>;
-export function countBy<T extends unknown>(transformFn: (x: T) => any): (list: T[]) => Record<string, number>;
-/**
- * It expects a function as input and returns its curried version.
- */
-export function curry(fn: AnyFunction): (...a: any[]) => any;
-/**
- * It returns a curried equivalent of the provided function, with the specified arity.
- */
-export function curryN(length: number, fn: AnyFunction): (...a: any[]) => any;
+export function countBy<T>(fn: (a: T) => string | number): (list: T[]) => { [index: string]: number };
 /**
  * It decrements a number.
@@ -486,121 +208,33 @@ export function dec(x: number): number;
  * Else, it returns the first truthy `inputArguments` instance(from left to right).
  */
 export function defaultTo<T>(defaultValue: T, input: T | null | undefined): T;
-export function defaultTo<T>(defaultValue: T): (input: T | null | undefined) => T;
-export function descend<T>(fn: (obj: T) => Ord, a: T, b: T): Ordering;
-export function descend<T>(fn: (obj: T) => Ord): (a: T, b: T) => Ordering;
-/**
- * It returns the uniq set of all elements in the first list `a` not contained in the second list `b`.
- *
- * `R.equals` is used to determine equality.
- */
-export function difference<T>(a: T[], b: T[]): T[];
-export function difference<T>(a: T[]): (b: T[]) => T[];
-export function differenceWith<T1, T2>(
-  pred: (a: T1, b: T2) => boolean,
-  list1: T1[],
-  list2: T2[],
-): T1[];
-export function differenceWith<T1, T2>(
-  pred: (a: T1, b: T2) => boolean,
-): (list1: T1[], list2: T2[]) => T1[];
-export function differenceWith<T1, T2>(
-  pred: (a: T1, b: T2) => boolean,
-  list1: T1[],
-): (list2: T2[]) => T1[];
-/**
- * It returns a new object that does not contain property `prop`.
- */
-export function dissoc<K extends PropertyKey>(prop: K): <U extends { [P in K]?: any}>(obj: string extends keyof U ? U : undefined extends U[K] ? U : never) => U;
-export function dissoc<U, K extends keyof U>(prop: string extends keyof U ? K : undefined extends U[K] ? K : never, obj: U): U;
-export function dissocPath<T>(path: Path, obj: any): T;
-export function dissocPath<T>(path: Path): (obj: any) => T;
-export function divide(x: number, y: number): number;
-export function divide(x: number): (y: number) => number;
+export function defaultTo<T>(defaultValue: T): <U>(input: U | null | undefined) => EqualTypes<U, T> extends true ? T : never
 /**
  * It returns `howMany` items dropped from beginning of list or string `input`.
  */
-export function drop<T>(howMany: number, input: T[]): T[];
-export function drop(howMany: number, input: string): string;
-export function drop<T>(howMany: number): {
-  <T>(input: T[]): T[];
-  (input: string): string;
-};
+export function drop<T>(howMany: number): (list: T[]) => T[];
 /**
- * It returns `howMany` items dropped from the end of list or string `input`.
+ * It returns `howMany` items dropped from  the end of list or string `input`.
  */
-export function dropLast<T>(howMany: number, input: T[]): T[];
-export function dropLast(howMany: number, input: string): string;
-export function dropLast<T>(howMany: number): {
-  <T>(input: T[]): T[];
-  (input: string): string;
-};
+export function dropLast<T>(howMany: number): (list: T[]) => T[];
-export function dropLastWhile(predicate: (x: string) => boolean, iterable: string): string;
-export function dropLastWhile(predicate: (x: string) => boolean): (iterable: string) => string;
-export function dropLastWhile<T>(predicate: (x: T) => boolean, iterable: T[]): T[];
-export function dropLastWhile<T>(predicate: (x: T) => boolean): <T>(iterable: 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[];
-/**
- * It removes any successive duplicates according to `R.equals`.
- */
-export function dropRepeats<T>(list: T[]): T[];
-export function dropRepeatsBy<T, U>(fn: (a: T) => U, list: T[]): T[];
-export function dropRepeatsBy<T, U>(
-  fn: (a: T) => U
-): (list: T[]) => T[];
-export function dropRepeatsBy(fn: any): <T>(list: T[]) => T[];
+export function dropRepeatsBy<T, U>(fn: (a: T) => U): (list: T[]) => T[];
-export function dropRepeatsWith<T>(predicate: (x: T, y: T) => boolean, list: T[]): T[];
 export function dropRepeatsWith<T>(predicate: (x: T, y: T) => boolean): (list: T[]) => T[];
-export function dropWhile(fn: Predicate<string>, iterable: string): string;
-export function dropWhile(fn: Predicate<string>): (iterable: string) => string;
-export function dropWhile<T>(fn: Predicate<T>, iterable: T[]): T[];
-export function dropWhile<T>(fn: Predicate<T>): (iterable: 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[];
-/**
- * It returns a new `predicate` function from `firstPredicate` and `secondPredicate` inputs.
- *
- * This `predicate` function will return `true`, if any of the two input predicates return `true`.
- */
-export function either(firstPredicate: Pred, secondPredicate: Pred): Pred;
-export function either<T>(firstPredicate: Predicate<T>, secondPredicate: Predicate<T>): Predicate<T>;
-export function either<T>(firstPredicate: Predicate<T>): (secondPredicate: Predicate<T>) => Predicate<T>;
-export function either(firstPredicate: Pred): (secondPredicate: Pred) => Pred;
-export function empty<T>(x: T): T;
-/**
- * When iterable is a string, then it behaves as `String.prototype.endsWith`.
- * When iterable is a list, then it uses R.equals to determine if the target list ends in the same way as the given target.
- */
-export function endsWith<T extends string>(question: T, str: string): boolean;
-export function endsWith<T extends string>(question: T): (str: string) => boolean;
-export function endsWith<T>(question: T[], list: T[]): boolean;
-export function endsWith<T>(question: T[]): (list: T[]) => boolean;
-export function eqBy<T>(fn: (a: T) => unknown, a: T, b: T): boolean;
-export function eqBy<T>(fn: (a: T) => unknown, a: T): (b: T) => boolean;
-export function eqBy<T>(fn: (a: T) => unknown): {
-  (a: T, b: T): boolean;
-  (a: T): (b: T) => boolean;
-};
+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, U>(prop: string, obj1: T, obj2: U): boolean;
-export function eqProps<P extends string>(prop: P): <T, U>(obj1: Record<P, T>, obj2: Record<P, U>) => boolean;
 export function eqProps<T>(prop: string, obj1: T): <U>(obj2: U) => boolean;
 /**
@@ -610,27 +244,50 @@ export function equals<T>(x: T, y: T): boolean;
 export function equals<T>(x: T): (y: T) => boolean;
 /**
- * It takes object or array of functions as set of rules. These `rules` are applied to the `iterable` input to produce the result.
+ * It takes object of functions as set of rules. These `rules` are applied to the `iterable` input to produce the result.
  */
-export function evolve<T, U>(rules: ((x: T) => U)[], list: T[]): U[];
-export function evolve<T, U>(rules: ((x: T) => U)[]) : (list: T[]) => U[];
-export function evolve<E extends Evolver, V extends Evolvable<E>>(rules: E, obj: V): Evolve<V, E>;
 export function evolve<E extends Evolver>(rules: E): <V extends Evolvable<E>>(obj: V) => Evolve<V, E>;
+/**
+ * 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>(predicate: Predicate<T>): (input: T[]) => T[];
-export function filter<T>(predicate: Predicate<T>, input: T[]): T[];
-export function filter<T, U>(predicate: ObjectPredicate<T>): (x: Dictionary<T>) => Dictionary<T>;
-export function filter<T>(predicate: ObjectPredicate<T>, x: Dictionary<T>): Dictionary<T>;
+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[]) => NonNullable<T>[];
+export function filter<T>(
+	predicate: BooleanConstructor,
+): (list: T[]) => NonNullable<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;
 export function find<T>(predicate: (x: T) => boolean): (list: T[]) => T | undefined;
 /**
@@ -638,7 +295,6 @@ export function find<T>(predicate: (x: T) => boolean): (list: T[]) => T | undefi
  *
  * If there is no such element, then `-1` is returned.
  */
-export function findIndex<T>(predicate: (x: T) => boolean, list: T[]): number;
 export function findIndex<T>(predicate: (x: T) => boolean): (list: T[]) => number;
 /**
@@ -646,7 +302,6 @@ export function findIndex<T>(predicate: (x: T) => boolean): (list: T[]) => numbe
  *
  * If there is no such element, then `undefined` is returned.
  */
-export function findLast<T>(fn: (x: T) => boolean, list: T[]): T | undefined;
 export function findLast<T>(fn: (x: T) => boolean): (list: T[]) => T | undefined;
 /**
@@ -654,97 +309,34 @@ export function findLast<T>(fn: (x: T) => boolean): (list: T[]) => T | undefined
  *
  * If there is no such element, then `-1` is returned.
  */
-export function findLastIndex<T>(predicate: (x: T) => boolean, list: T[]): number;
 export function findLastIndex<T>(predicate: (x: T) => boolean): (list: T[]) => number;
 /**
- * It deeply flattens an array.
+ * It maps `fn` over `list` and then flatten the result by one-level.
  */
-export function flatten<T>(list: any[]): T[];
+export function flatMap<T, U extends unknown>(transformFn: (x: T extends any[] ? T[number]: never) => U): (listOfLists: T[]) => U[];
 /**
- * It returns function which calls `fn` with exchanged first and second argument.
- */
-export function flip<T, U, TResult>(fn: (arg0: T, arg1: U) => TResult): (arg1: U, arg0?: T) => TResult;
-/**
- * It applies `iterable` function over all members of `list` and returns `list`.
- */
-export function forEach<T>(fn: Iterator<T, void>, list: T[]): T[];
-export function forEach<T>(fn: Iterator<T, void>): (list: T[]) => T[];
-export function forEach<T>(fn: ObjectIterator<T, void>, list: Dictionary<T>): Dictionary<T>;
-export function forEach<T, U>(fn: ObjectIterator<T, void>): (list: Dictionary<T>) => Dictionary<T>;
-export function forEachObjIndexed<T>(fn: (value: T[keyof T], key: keyof T, obj: T) => void, obj: T): T;
-export function forEachObjIndexed<T>(fn: (value: T[keyof T], key: keyof T, obj: T) => void): (obj: T) => T;
-/**
- * It transforms a `listOfPairs` to an object.
+ * It deeply flattens an array.
  */
-export function fromPairs<V>(listOfPairs: ([number, V])[]): { [index: number]: V };
-export function fromPairs<V>(listOfPairs: ([string, V])[]): { [index: string]: V };
+export function flatten<T>(list: any[]): T[];
 /**
  * It splits `list` according to a provided `groupFn` function and returns an object.
  */
 export function groupBy<T, K extends string = string>(fn: (a: T) => K): (list: T[]) => Partial<Record<K, T[]>>;
-export function groupBy<T, K extends string = string>(fn: (a: T) => K, list: T[]): Partial<Record<K, T[]>>;
-/**
- * It returns separated version of list or string `input`, where separation is done with equality `compareFn` function.
- */
-export function groupWith<T>(compareFn: (x: T, y: T) => boolean): (input: T[]) => (T[])[];
-export function groupWith<T>(compareFn: (x: T, y: T) => boolean, input: T[]): (T[])[];
-export function groupWith<T>(compareFn: (x: T, y: T) => boolean, input: string): string[];
-export function gt<T, U>(x: T, y: U): boolean;
-export function gt<T, U>(x: T): (y: U) => boolean;
-export function gte<T, U>(x: T, y: U): boolean;
-export function gte<T, U>(x: T): (y: U) => boolean;
-/**
- * It returns `true` if `obj` has property `prop`.
- */
-export function has<T>(prop: string, obj: T): boolean;
-export function has(prop: string): <T>(obj: T) => boolean;
-export function hasIn(searchProperty: string): <T>(obj: T) => boolean;
-export function hasIn<T>(searchProperty: string, obj: T): boolean;
-/**
- * It will return true, if `input` object has truthy `path`(calculated with `R.path`).
- */
-export function hasPath<T>(
-  path: string | string[],
-  input: object
-): boolean;
-export function hasPath<T>(
-  path: string | string[]
-): (input: object) => boolean;
 /**
  * It returns the first element of list or string `input`. It returns `undefined` if array has length of 0.
  */
-export function head(str: string): string;
-export function head(str: ''): undefined;
-export function head(list: readonly[]): undefined;
-export function head<T>(list: never[]): undefined;
-export function head<T extends unknown[]>(array: T): FirstArrayElement<T>
-export function head<T extends readonly unknown[]>(array: T): FirstArrayElement<T>
-/**
- * It returns `true` if its arguments `a` and `b` are identical.
- *
- * Otherwise, it returns `false`.
- */
-export function identical<T>(x: T, y: T): boolean;
-export function identical<T>(x: T): (y: T) => boolean;
-/**
- * It just passes back the supplied `input` argument.
- */
-export function identity<T>(input: T): T;
+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;
 /**
  * It expects `condition`, `onTrue` and `onFalse` functions as inputs and it returns a new function with example name of `fn`.
@@ -758,41 +350,17 @@ export function ifElse<T, TFiltered extends T, TOnTrueResult, TOnFalseResult>(
 ): (a: T) => TOnTrueResult | TOnFalseResult;
 export function ifElse<TArgs extends any[], TOnTrueResult, TOnFalseResult>(fn: (...args: TArgs) => boolean, onTrue: (...args: TArgs) => TOnTrueResult, onFalse: (...args: TArgs) => TOnFalseResult): (...args: TArgs) => TOnTrueResult | TOnFalseResult;
-/**
- * It increments a number.
- */
-export function inc(x: number): number;
 /**
  * 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 extends string>(valueToFind: T): (input: string) => boolean;
-export function includes<T>(valueToFind: T, input: T[]): boolean;
 export function includes<T>(valueToFind: T): (input: T[]) => boolean;
 /**
- * It generates object with properties provided by `condition` and values provided by `list` array.
- *
- * If `condition` is a function, then all list members are passed through it.
- *
- * If `condition` is a string, then all list members are passed through `R.path(condition)`.
- */
-export function indexBy<T, K extends string | number = string>(condition: (key: T) => K, list: T[]): { [key in K]: T };
-export function indexBy<T, K extends string | number | undefined = string>(condition: (key: T) => K, list: T[]): { [key in NonNullable<K>]?: T };
-export function indexBy<T, K extends string | number = string>(condition: (key: T) => K): (list: T[]) => { [key in K]: T };
-export function indexBy<T, K extends string | number | undefined = string>(condition: (key: T) => K | undefined): (list: T[]) => { [key in NonNullable<K>]?: T };
-export function indexBy<T>(condition: string, list: T[]): { [key: string]: T };
-export function indexBy<T>(condition: string): (list: T[]) => { [key: string]: T };
-/**
- * It returns the index of the first element of `list` equals to `valueToFind`.
- *
- * If there is no such element, it returns `-1`.
+ * 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;
 export function indexOf<T>(valueToFind: T): (list: T[]) => number;
 /**
@@ -804,22 +372,10 @@ 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[];
 export function innerJoin<T1, T2>(
   pred: (a: T1, b: T2) => boolean,
   list1: T1[],
 ): (list2: T2[]) => T1[];
-export function innerJoin<T1, T2>(pred: (a: T1, b: T2) => boolean, list1: T1[], list2: T2[]): T1[];
-export function insert(index: number): <T>(itemToInsert: T, list: T[]) => T[];
-export function insert<T>(index: number, itemToInsert: T): (list: T[]) => T[];
-export function insert<T>(index: number, itemToInsert: T, list: T[]): T[];
-export function insertAll(index: number): <T>(itemsToInsert: T[], list: T[]) => T[];
-export function insertAll<T>(index: number, itemsToInsert: T[]): (list: T[]) => T[];
-export function insertAll<T>(index: number, itemsToInsert: T[], list: T[]): T[];
 /**
  * It loops through `listA` and `listB` and returns the intersection of the two according to `R.equals`.
@@ -830,65 +386,29 @@ 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[];
 export function intersperse<T>(separator: T): (list: T[]) => T[];
-/**
- * It returns `true` if `x` is instance of `targetPrototype`.
- */
-export function is<C extends () => any>(targetPrototype: C, val: any): val is ReturnType<C>;
-export function is<C extends new () => any>(targetPrototype: C, val: any): val is InstanceType<C>;
-export function is<C extends () => any>(targetPrototype: C): (val: any) => val is ReturnType<C>;
-export function is<C extends new () => any>(targetPrototype: C): (val: any) => val is InstanceType<C>;
-/**
- * It returns `true` if `x` is `empty`.
- */
-export function isEmpty<T>(x: T): boolean;
-/**
- * It returns `true` if `x` is either `null` or `undefined`.
- */
-export function isNil(x: any): x is null | undefined;
 export function isNotEmpty<T>(value: T[]): value is NonEmptyArray<T>;
 export function isNotEmpty<T>(value: readonly T[]): value is ReadonlyNonEmptyArray<T>;
 export function isNotEmpty(value: any): boolean;
-export function isNotNil<T>(value: T): value is NonNullable<T>;
 /**
  * It returns a string of all `list` instances joined with a `glue`.
  */
 export function join<T>(glue: string, list: T[]): string;
 export function join<T>(glue: string): (list: T[]) => string;
-/**
- * It applies list of function to a list of inputs.
- */
-export function juxt<A extends any[], R1>(fns: [(...a: A) => R1]): (...a: A) => [R1];
-export function juxt<A extends any[], R1, R2>(fns: [(...a: A) => R1, (...a: A) => R2]): (...a: A) => [R1, R2];
-export function juxt<A extends any[], R1, R2, R3>(fns: [(...a: A) => R1, (...a: A) => R2, (...a: A) => R3]): (...a: A) => [R1, R2, R3];
-export function juxt<A extends any[], R1, R2, R3, R4>(fns: [(...a: A) => R1, (...a: A) => R2, (...a: A) => R3, (...a: A) => R4]): (...a: A) => [R1, R2, R3, R4];
-export function juxt<A extends any[], R1, R2, R3, R4, R5>(fns: [(...a: A) => R1, (...a: A) => R2, (...a: A) => R3, (...a: A) => R4, (...a: A) => R5]): (...a: A) => [R1, R2, R3, R4, R5];
-export function juxt<A extends any[], U>(fns: Array<(...args: A) => U>): (...args: A) => U[];
-/**
- * It applies `Object.keys` over `x` and returns its keys.
- */
-export function keys<T extends object>(x: T): (keyof T & string)[];
-export function keys<T>(x: 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(str: ''): undefined;
-export function last(str: string): string;
-export function last(list: readonly[]): undefined;
-export function last(list: never[]): undefined;
-export function last<T extends unknown[]>(array: T): LastArrayElement<T>;
-export function last<T extends readonly unknown[]>(array: T): LastArrayElement<T>;
-export function last(str: string): string | undefined;
+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.
@@ -900,95 +420,64 @@ export function last(str: string): string | undefined;
 export function lastIndexOf<T>(target: T, list: T[]): number;
 export function lastIndexOf<T>(target: T): (list: T[]) => number;
-/**
- * It returns the `length` property of list or string `input`.
- */
-export function length<T>(input: T[]): number;
-/**
- * It returns a `lens` for the given `getter` and `setter` functions.
- *
- * The `getter` **gets** the value of the focus; the `setter` **sets** the value of the focus.
- *
- * The setter should not mutate the data structure.
- */
-export function lens<S, A>(getter: (s: S) => A, setter: (a: A, s: S) => S): Lens<S, A>;
-/**
- * It returns a lens that focuses on specified `index`.
- */
-export function lensIndex<A>(n: number): Lens<A[], A>;
-export function lensIndex<A extends any[], N extends number>(n: N): Lens<A, A[N]>;
-/**
- * It returns a lens that focuses on specified `path`.
- */
-export function lensPath<S, K0 extends keyof S = keyof S>(path: [K0]): Lens<S, S[K0]>;
-export function lensPath<S, K0 extends keyof S = keyof S, K1 extends keyof S[K0] = keyof S[K0]>(
-  path: [K0, K1],
-): Lens<S, S[K0][K1]>;
-export function lensPath<
-  S,
-  K0 extends keyof S = keyof S,
-  K1 extends keyof S[K0] = keyof S[K0],
-  K2 extends keyof S[K0][K1] = keyof S[K0][K1]
->(path: [K0, K1, K2]): Lens<S, S[K0][K1][K2]>;
-export function lensPath<
-  S,
-  K0 extends keyof S = keyof S,
-  K1 extends keyof S[K0] = keyof S[K0],
-  K2 extends keyof S[K0][K1] = keyof S[K0][K1],
-  K3 extends keyof S[K0][K1][K2] = keyof S[K0][K1][K2]
->(path: [K0, K1, K2, K3]): Lens<S, S[K0][K1][K2][K3]>;
-export function lensPath<
-  S,
-  K0 extends keyof S = keyof S,
-  K1 extends keyof S[K0] = keyof S[K0],
-  K2 extends keyof S[K0][K1] = keyof S[K0][K1],
-  K3 extends keyof S[K0][K1][K2] = keyof S[K0][K1][K2],
-  K4 extends keyof S[K0][K1][K2][K3] = keyof S[K0][K1][K2][K3]
->(path: [K0, K1, K2, K3, K4]): Lens<S, S[K0][K1][K2][K3][K4]>;
-export function lensPath<
-  S,
-  K0 extends keyof S = keyof S,
-  K1 extends keyof S[K0] = keyof S[K0],
-  K2 extends keyof S[K0][K1] = keyof S[K0][K1],
-  K3 extends keyof S[K0][K1][K2] = keyof S[K0][K1][K2],
-  K4 extends keyof S[K0][K1][K2][K3] = keyof S[K0][K1][K2][K3],
-  K5 extends keyof S[K0][K1][K2][K3][K4] = keyof S[K0][K1][K2][K3][K4]
->(path: [K0, K1, K2, K3, K4, K5]): Lens<S, S[K0][K1][K2][K3][K4][K5]>;
-export function lensPath<S = any, A = any>(path: Path): Lens<S, A>;
-/**
- * It returns a lens that focuses on specified property `prop`.
- */
-export function lensProp<S, K extends keyof S = keyof S>(prop: K): Lens<S, S[K]>;
-export function lt<T, U>(x: T, y: U): boolean;
-export function lt<T, U>(x: T): (y: U) => boolean;
-export function lte<T, U>(x: T, y: U): boolean;
-export function lte<T, U>(x: T): (y: U) => boolean;
 /**
  * It returns the result of looping through `iterable` with `fn`.
  *
  * It works with both array and object.
  */
-export function map<T, U>(fn: ObjectIterator<T, U>, iterable: Dictionary<T>): Dictionary<U>;
-export function map<T, U>(fn: Iterator<T, U>, iterable: T[]): U[];
-export function map<T, U>(fn: Iterator<T, U>): (iterable: T[]) => U[];
-export function map<T, U, S>(fn: ObjectIterator<T, U>): (iterable: Dictionary<T>) => Dictionary<U>;
-export function map<T>(fn: Iterator<T, T>): (iterable: T[]) => T[];
-export function map<T>(fn: Iterator<T, T>, iterable: T[]): T[];
+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>>;
+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>>;
+// API_MARKER_END
+// ============================================
-/**
- * It works the same way as `R.map` does for objects. It is added as Ramda also has this method.
- */
-export function mapObjIndexed<T>(fn: ObjectIterator<T, T>, iterable: Dictionary<T>): Dictionary<T>;
-export function mapObjIndexed<T, U>(fn: ObjectIterator<T, U>, iterable: Dictionary<T>): Dictionary<U>;
-export function mapObjIndexed<T>(fn: ObjectIterator<T, T>): (iterable: Dictionary<T>) => Dictionary<T>;
-export function mapObjIndexed<T, U>(fn: ObjectIterator<T, U>): (iterable: Dictionary<T>) => Dictionary<U>;
+export as namespace R
 /**
  * Curried version of `String.prototype.match` which returns empty array, when there is no match.
@@ -1031,30 +520,6 @@ export function median(list: number[]): number;
 export function merge<A, B>(target: A, newProps: B): A & B
 export function merge<Output>(target: any): (newProps: any) => Output;
-/**
- * It merges all objects of `list` array sequentially and returns the result.
- */
-export function mergeAll<T>(list: object[]): T;
-export function mergeAll(list: object[]): object;
-export function mergeDeepLeft<Output>(newProps: object, target: object): Output;
-export function mergeDeepLeft<Output>(newProps: object): (target: object) => Output;
-/**
- * Creates a new object with the own properties of the first object merged with the own properties of the second object. If a key exists in both objects:
- *
- * - and both values are objects, the two values will be recursively merged
- * - otherwise the value from the second object will be used.
- */
-export function mergeDeepRight<Output>(target: object, newProps: object): Output;
-export function mergeDeepRight<Output>(target: object): (newProps: object) => Output;
-/**
- * Same as `R.merge`, but in opposite direction.
- */
-export function mergeLeft<Output>(newProps: object, target: object): Output;
-export function mergeLeft<Output>(newProps: object): (target: object) => Output;
 /**
  * It creates a copy of `target` object with overwritten `newProps` properties. Previously known as `R.merge` but renamed after Ramda did the same.
  */
@@ -1062,498 +527,948 @@ export function mergeRight<A, B>(target: A, newProps: B): A & B
 export function mergeRight<Output>(target: any): (newProps: any) => Output;
 /**
- * It takes two objects and a function, which will be used when there is an overlap between the keys.
+ * 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 mergeWith(fn: (x: any, z: any) => any, a: Record<string, unknown>, b: Record<string, unknown>): Record<string, unknown>;
-export function mergeWith<Output>(fn: (x: any, z: any) => any, a: Record<string, unknown>, b: Record<string, unknown>): Output;
-export function mergeWith(fn: (x: any, z: any) => any, a: Record<string, unknown>): (b: Record<string, unknown>) => Record<string, unknown>;
-export function mergeWith<Output>(fn: (x: any, z: any) => any, a: Record<string, unknown>): (b: Record<string, unknown>) => Output;
-export function mergeWith(fn: (x: any, z: any) => any): <U, V>(a: U, b: V) => Record<string, unknown>;
-export function mergeWith<Output>(fn: (x: any, z: any) => any): <U, V>(a: U, b: V) => Output;
+export function mergeTypes<T>(x: T): MergeTypes<T>;
 /**
  * It returns the lesser value between `x` and `y`.
  */
-export function min<T extends Ord>(x: T, y: T): T;
 export function min<T extends Ord>(x: T): (y: T) => 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;
 export function minBy<T>(compareFn: (input: T) => Ord, x: T): (y: T) => T;
-export function minBy<T>(compareFn: (input: T) => Ord): (x: T) => (y: T) => T;
-export function modify<K extends PropertyKey, T>(prop: K, fn: (value: T) => T): <U extends Record<K, T>>(object: U) => U;
-export function modify<U, K extends keyof U>(prop: K, fn: (value: U[K]) => U[K], object: U): U;
-export function modify<K extends PropertyKey>(prop: K): {
-  <T>(fn: (value: T) => T): <U extends Record<K, T>>(object: U) => U;
-  <T, U extends Record<K, T>>(fn: (value: T) => T, object: U): U;
-};
 /**
- * It changes a property of object on the base of provided path and transformer function.
+ * It changes a property with the result of transformer function.
  */
-export function modifyPath<T extends Record<string, unknown>>(path: Path, fn: (x: any) => unknown, object: Record<string, unknown>): T;
-export function modifyPath<T extends Record<string, unknown>>(path: Path, fn: (x: any) => unknown): (object: Record<string, unknown>) => T;
-export function modifyPath<T extends Record<string, unknown>>(path: Path): (fn: (x: any) => unknown) => (object: Record<string, unknown>) => T;
-/**
- * Curried version of `x%y`.
- */
-export function modulo(x: number, y: number): number;
-export function modulo(x: number): (y: number) => number;
-/**
- * It returns a copy of `list` with exchanged `fromIndex` and `toIndex` elements.
- */
-export function move<T>(fromIndex: number, toIndex: number, list: T[]): T[];
-export function move(fromIndex: number, toIndex: number): <T>(list: T[]) => T[];
-export function move(fromIndex: number): {
-    <T>(toIndex: number, list: T[]): T[];
-    (toIndex: number): <T>(list: T[]) => T[];
-};
+export function modify<K extends string, A, P>(
+  prop: K,
+  fn: (a: A) => P,
+): <T extends Record<K, A>>(target: T) => Omit<T, K> & Record<K, P>;
 /**
- * Curried version of `x*y`.
+ * It changes a property of object on the base of provided path and transformer function.
  */
-export function multiply(x: number, y: number): number;
-export function multiply(x: number): (y: number) => number;
-export function negate(x: number): number;
+export function modifyPath<U, T>(path: [], fn: (value: U) => T): (obj: U) => T;
+export function modifyPath<
+  K0 extends keyof U,
+  U,
+  T
+>(path: [K0], fn: (value: U[K0]) => T): (obj: U) => DeepModify<[K0], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  U,
+  T
+>(path: `${K0}`, fn: (value: U[K0]) => T): (obj: U) => DeepModify<[K0], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  U,
+  T
+>(path: [K0, K1], fn: (value: U[K0][K1]) => T): (obj: U) => DeepModify<[K0, K1], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  U,
+  T
+>(path: `${K0}.${K1}`, fn: (value: U[K0][K1]) => T): (obj: U) => DeepModify<[K0, K1], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  U,
+  T
+>(path: [K0, K1, K2], fn: (value: U[K0][K1][K2]) => T): (obj: U) => DeepModify<[K0, K1, K2], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  U,
+  T
+>(path: `${K0}.${K1}.${K2}`, fn: (value: U[K0][K1][K2]) => T): (obj: U) => DeepModify<[K0, K1, K2], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  U,
+  T
+>(path: [K0, K1, K2, K3], fn: (value: U[K0][K1][K2][K3]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  U,
+  T
+>(path: `${K0}.${K1}.${K2}.${K3}`, fn: (value: U[K0][K1][K2][K3]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  K4 extends keyof U[K0][K1][K2][K3],
+  U,
+  T
+>(path: [K0, K1, K2, K3, K4], fn: (value: U[K0][K1][K2][K3][K4]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3, K4], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  K4 extends keyof U[K0][K1][K2][K3],
+  U,
+  T
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}`, fn: (value: U[K0][K1][K2][K3][K4]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3, K4], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  K4 extends keyof U[K0][K1][K2][K3],
+  K5 extends keyof U[K0][K1][K2][K3][K4],
+  U,
+  T
+>(path: [K0, K1, K2, K3, K4, K5], fn: (value: U[K0][K1][K2][K3][K4][K5]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3, K4, K5], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  K4 extends keyof U[K0][K1][K2][K3],
+  K5 extends keyof U[K0][K1][K2][K3][K4],
+  U,
+  T
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}`, fn: (value: U[K0][K1][K2][K3][K4][K5]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3, K4, K5], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  K4 extends keyof U[K0][K1][K2][K3],
+  K5 extends keyof U[K0][K1][K2][K3][K4],
+  K6 extends keyof U[K0][K1][K2][K3][K4][K5],
+  U,
+  T
+>(path: [K0, K1, K2, K3, K4, K5, K6], fn: (value: U[K0][K1][K2][K3][K4][K5][K6]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3, K4, K5, K6], U, T>;
+export function modifyPath<
+  K0 extends keyof U,
+  K1 extends keyof U[K0],
+  K2 extends keyof U[K0][K1],
+  K3 extends keyof U[K0][K1][K2],
+  K4 extends keyof U[K0][K1][K2][K3],
+  K5 extends keyof U[K0][K1][K2][K3][K4],
+  K6 extends keyof U[K0][K1][K2][K3][K4][K5],
+  U,
+  T
+>(path: `${K0}.${K1}.${K2}.${K3}.${K4}.${K5}.${K6}`, fn: (value: U[K0][K1][K2][K3][K4][K5][K6]) => T): (obj: U) => DeepModify<[K0, K1, K2, K3, K4, K5, K6], U, T>;
+export function modifyPath<B, A = any>(path: Path, fn: (a: any) => any): (obj: A) => B;
 /**
  * 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;
 export function none<T>(predicate: (x: T) => boolean): (list: T[]) => boolean;
-/**
- * It returns a boolean negated version of `input`.
- */
-export function not(input: any): boolean;
-/**
- * Curried version of `input[index]`.
- */
-export function nth(index: number, input: string): string;
-export function nth<T>(index: number, input: T[]): T | undefined;
-export function nth(n: number): {
-  <T>(input: T[]): T | undefined;
-  (input: string): string;
-};
 /**
  * It creates an object with a single key-value pair.
  */
-export function objOf<T, K extends string>(key: K, value: T): Record<K, T>;
-export function objOf<K extends string>(key: K): <T>(value: T) => Record<K, T>;
-export function of<T>(x: T): T[];
-/**
- * It returns a partial copy of an `obj` without `propsToOmit` properties.
- */
-export function omit<T, K extends string>(propsToOmit: K[], obj: T): Omit<T, K>;
-export function omit<K extends string>(propsToOmit: K[]): <T>(obj: T) => Omit<T, K>;
-export function omit<T, U>(propsToOmit: string, obj: T): U;
-export function omit<T, U>(propsToOmit: string): (obj: T) => U;
-export function omit<T>(propsToOmit: string, obj: object): T;
-export function omit<T>(propsToOmit: string): (obj: object) => T;
+export function objOf<T, K extends PropertyKey>(key: K): (value: T) => { [P in K]: T };
 /**
- * It passes the two inputs through `unaryFn` and then the results are passed as inputs the the `binaryFn` to receive the final result(`binaryFn(unaryFn(FIRST_INPUT), unaryFn(SECOND_INPUT))`).
+ * It will return `true` if `specification` object fully or partially include `obj` object.
  *
- * This method is also known as P combinator.
- */
-export function on<T, U, R>(binaryFn: (a: U, b: U) => R, unaryFn: (value: T) => U, a: T, b: T): R;
-export function on<T, U, R>(binaryFn: (a: U, b: U) => R, unaryFn: (value: T) => U, a: T): (b: T) => R;
-export function on<T, U, R>(binaryFn: (a: U, b: U) => R, unaryFn: (value: T) => U): {
-    (a: T, b: T): R;
-    (a: T): (b: T) => R;
-};
-/**
- * It returns a function, which invokes only once `fn` function.
- */
-export function once<T extends AnyFunction, C = unknown>(fn: T, context?: C): T;
-/**
- * Logical OR
- */
-export function or<T, U>(a: T, b: U): T | U;
-export function or<T>(a: T): <U>(b: U) => T | U;
-/**
- * It returns a copied **Object** or **Array** with modified value received by applying function `fn` to `lens` focus.
+ * `R.equals` is used to determine equality.
  */
-export function over<S, A>(lens: Lens<S, A>): {
-  (fn: (a: A) => A): (value: S) => S;
-  (fn: (a: A) => A, value: S): S;
-};
-export function over<S, A>(lens: Lens<S, A>, fn: (a: A) => A): (value: S) => S;
-export function over<S, A>(lens: Lens<S, A>, fn: (a: A) => A, value: S): S;
+export function objectIncludes<T>(specification: T): <U>(obj: U) => boolean;
 /**
- * It is very similar to `R.curry`, but you can pass initial arguments when you create the curried function.
- *
- * `R.partial` will keep returning a function until all the arguments that the function `fn` expects are passed.
- * The name comes from the fact that you partially inject the inputs.
- */
-export function partial<V0, V1, T>(fn: (x0: V0, x1: V1) => T, args: [V0]): (x1: V1) => T;
-export function partial<V0, V1, V2, T>(fn: (x0: V0, x1: V1, x2: V2) => T, args: [V0, V1]): (x2: V2) => T;
-export function partial<V0, V1, V2, T>(fn: (x0: V0, x1: V1, x2: V2) => T, args: [V0]): (x1: V1, x2: V2) => T;
-export function partial<V0, V1, V2, V3, T>(
-  fn: (x0: V0, x1: V1, x2: V2, x3: V3) => T,
-  args: [V0, V1, V2],
-): (x2: V3) => T;
-export function partial<V0, V1, V2, V3, T>(
-  fn: (x0: V0, x1: V1, x2: V2, x3: V3) => T,
-  args: [V0, V1],
-): (x2: V2, x3: V3) => T;
-export function partial<V0, V1, V2, V3, T>(
-  fn: (x0: V0, x1: V1, x2: V2, x3: V3) => T,
-  args: [V0],
-): (x1: V1, x2: V2, x3: V3) => T;
-export function partial<T>(fn: (...a: any[]) => T, args: any[]): (...a: any[]) => T;
-/**
- * `R.partialObject` is a curry helper designed specifically for functions accepting object as a single argument.
- *
- * Initially the function knows only a part from the whole input object and then `R.partialObject` helps in preparing the function for the second part, when it receives the rest of the input.
+ * It returns a partial copy of an `obj` without `propsToOmit` properties.
  */
-export function partialObject<Input, PartialInput, Output>(
-  fn: (input: Input) => Output,
-  partialInput: PartialInput,
-): (input: Pick<Input, Exclude<keyof Input, keyof PartialInput>>) => Output;
+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 objects/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: Predicate<T>,
-  input: T[]
-): [T[], T[]];
-export function partition<T>(
-  predicate: Predicate<T>
-): (input: T[]) => [T[], T[]];
-export function partition<T>(
-  predicate: (x: T, prop?: string) => boolean,
-  input: { [key: string]: T}
-): [{ [key: string]: T}, { [key: string]: T}];
-export function partition<T>(
-  predicate: (x: T, prop?: string) => boolean
-): (input: { [key: string]: T}) => [{ [key: string]: T}, { [key: string]: T}];
+  predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean,
+): (data: ReadonlyArray<T>) => [Array<T>, Array<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 keyof S = keyof S>(path: [K0], obj: S): S[K0];
-export function path<S, K0 extends keyof S = keyof S, K1 extends keyof S[K0] = keyof S[K0]>(path: [K0, K1], obj: S): S[K0][K1];
+export function path<S, K0 extends keyof S>(path: [K0]): (obj: S) => S[K0];
+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]>(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 = keyof S,
-    K1 extends keyof S[K0] = keyof S[K0],
-    K2 extends keyof S[K0][K1] = keyof S[K0][K1]
->(path: [K0, K1, K2], obj: S): S[K0][K1][K2];
+    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 = keyof S,
-    K1 extends keyof S[K0] = keyof S[K0],
-    K2 extends keyof S[K0][K1] = keyof S[K0][K1],
-    K3 extends keyof S[K0][K1][K2] = keyof S[K0][K1][K2],
->(path: [K0, K1, K2, K3], obj: S): S[K0][K1][K2][K3];
+    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 = keyof S,
-    K1 extends keyof S[K0] = keyof S[K0],
-    K2 extends keyof S[K0][K1] = keyof S[K0][K1],
-    K3 extends keyof S[K0][K1][K2] = keyof S[K0][K1][K2],
-    K4 extends keyof S[K0][K1][K2][K3] = keyof S[K0][K1][K2][K3],
+    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]
 >(path: [K0, K1, K2, K3, K4], obj: S): S[K0][K1][K2][K3][K4];
 export function path<
     S,
-    K0 extends keyof S = keyof S,
-    K1 extends keyof S[K0] = keyof S[K0],
-    K2 extends keyof S[K0][K1] = keyof S[K0][K1],
-    K3 extends keyof S[K0][K1][K2] = keyof S[K0][K1][K2],
-    K4 extends keyof S[K0][K1][K2][K3] = keyof S[K0][K1][K2][K3],
-    K5 extends keyof S[K0][K1][K2][K3][K4] = keyof S[K0][K1][K2][K3][K4],
+    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]
 >(path: [K0, K1, K2, K3, K4, K5], obj: S): S[K0][K1][K2][K3][K4][K5];
-export function path<T>(pathToSearch: string, obj: any): T | undefined;
-export function path<T>(pathToSearch: string): (obj: any) => T | undefined;
-export function path<T>(pathToSearch: RamdaPath): (obj: any) => T | undefined;
-export function path<T>(pathToSearch: RamdaPath, obj: any): T | undefined;
+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]
+>(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]
+>(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 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];
 /**
- * It returns `true` if `pathToSearch` of `input` object is equal to `target` value.
+ * It returns a partial copy of an `input` containing only `propsToPick` properties.
  *
- * `pathToSearch` is passed to `R.path`, which means that it can be either a string or an array. Also equality between `target` and the found value is determined by `R.equals`.
- */
-export function pathEq(pathToSearch: Path, target: any, input: any): boolean;
-export function pathEq(pathToSearch: Path, target: any): (input: any) => boolean;
-export function pathEq(pathToSearch: Path): (target: any) => (input: any) => boolean;
-/**
- * It reads `obj` input and returns either `R.path(pathToSearch, Record<string, unknown>)` result or `defaultValue` input.
- */
-export function pathOr<T>(defaultValue: T, pathToSearch: Path, obj: any): T;
-export function pathOr<T>(defaultValue: T, pathToSearch: Path): (obj: any) => T;
-export function pathOr<T>(defaultValue: T): (pathToSearch: Path) => (obj: any) => T;
-export function pathSatisfies<T, U>(pred: (val: T) => boolean, path: Path): (obj: U) => boolean;
-export function pathSatisfies<T, U>(pred: (val: T) => boolean, path: Path, obj: U): boolean;
-/**
- * It loops over members of `pathsToSearch` as `singlePath` and returns the array produced by `R.path(singlePath, Record<string, unknown>)`.
+ * `input` can be either an object or an array.
  *
- * Because it calls `R.path`, then `singlePath` can be either string or a list.
+ * String annotation of `propsToPick` is one of the differences between `Rambda` and `Ramda`.
  */
-export function paths<Input, T>(pathsToSearch: Path[], obj: Input): (T | undefined)[];
-export function paths<Input, T>(pathsToSearch: Path[]): (obj: Input) => (T | undefined)[];
-export function paths<T>(pathsToSearch: Path[], obj: any): (T | undefined)[];
-export function paths<T>(pathsToSearch: Path[]): (obj: any) => (T | undefined)[];
+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,
+	K extends PickStringToPickPath<K>
+>(propsToPick: S): <T>(input: T) => MergeTypes<Pick<T, Exclude<keyof T, Exclude<keyof T, K>>>>;
 /**
- * It returns a partial copy of an `input` containing only `propsToPick` properties.
+ * It performs left-to-right function composition, where first argument is the input for the chain of functions.
  *
- * `input` can be either an object or an array.
+ * This is huge difference from `Ramda.pipe` where input is passed like `R.pipe(...fns)(input)`.
+ * Here we have `R.pipe(input, ...fns)`.
  *
- * String annotation of `propsToPick` is one of the differences between `Rambda` and `Ramda`.
- */
-export function pick<T, K extends string | number | symbol>(propsToPick: K[], input: T): Pick<T, Exclude<keyof T, Exclude<keyof T, K>>>;
-export function pick<K extends string | number | symbol>(propsToPick: K[]): <T>(input: T) => Pick<T, Exclude<keyof T, Exclude<keyof T, K>>>;
-export function pick<T, U>(propsToPick: string, input: T): U;
-export function pick<T, U>(propsToPick: string): (input: T) => U;
-export function pick<T>(propsToPick: string, input: object): T;
-export function pick<T>(propsToPick: string): (input: object) => T;
-/**
- * Same as `R.pick` but it won't skip the missing props, i.e. it will assign them to `undefined`.
- */
-export function pickAll<T, K extends keyof T>(propsToPicks: K[], input: T): Pick<T, K>;
-export function pickAll<T, U>(propsToPicks: string[], input: T): U;
-export function pickAll(propsToPicks: string[]): <T, U>(input: T) => U;
-export function pickAll<T, U>(propsToPick: string, input: T): U;
-export function pickAll<T, U>(propsToPick: string): (input: T) => U;
-export function pickBy<T>(pred: ObjPred<T>): <U, V extends T>(obj: V) => U;
-export function pickBy<T, U>(pred: ObjPred<T>, obj: T): U;
-/**
- * It performs left-to-right function composition.
- */
-export function pipe<TArgs extends any[], R1, R2, R3, R4, R5, R6, R7, TResult>(
-  ...funcs: [
-      f1: (...args: TArgs) => R1,
-      f2: (a: R1) => R2,
-      f3: (a: R2) => R3,
-      f4: (a: R3) => R4,
-      f5: (a: R4) => R5,
-      f6: (a: R5) => R6,
-      f7: (a: R6) => R7,
-      ...func: Array<(a: any) => any>,
-      fnLast: (a: any) => TResult
-  ]
-): (...args: TArgs) => TResult;  // fallback overload if number of piped functions greater than 7
-export function pipe<TArgs extends any[], R1, R2, R3, R4, R5, R6, R7>(
-  f1: (...args: TArgs) => R1,
-  f2: (a: R1) => R2,
-  f3: (a: R2) => R3,
-  f4: (a: R3) => R4,
-  f5: (a: R4) => R5,
-  f6: (a: R5) => R6,
-  f7: (a: R6) => R7
-): (...args: TArgs) => R7;
-export function pipe<TArgs extends any[], R1, R2, R3, R4, R5, R6>(
-  f1: (...args: TArgs) => R1,
-  f2: (a: R1) => R2,
-  f3: (a: R2) => R3,
-  f4: (a: R3) => R4,
-  f5: (a: R4) => R5,
-  f6: (a: R5) => R6
-): (...args: TArgs) => R6;
-export function pipe<TArgs extends any[], R1, R2, R3, R4, R5>(
-  f1: (...args: TArgs) => R1,
-  f2: (a: R1) => R2,
-  f3: (a: R2) => R3,
-  f4: (a: R3) => R4,
-  f5: (a: R4) => R5
-): (...args: TArgs) => R5;
-export function pipe<TArgs extends any[], R1, R2, R3, R4>(
-  f1: (...args: TArgs) => R1,
-  f2: (a: R1) => R2,
-  f3: (a: R2) => R3,
-  f4: (a: R3) => R4
-): (...args: TArgs) => R4;
-export function pipe<TArgs extends any[], R1, R2, R3>(
-  f1: (...args: TArgs) => R1,
-  f2: (a: R1) => R2,
-  f3: (a: R2) => R3
-): (...args: TArgs) => R3;
-export function pipe<TArgs extends any[], R1, R2>(
-  f1: (...args: TArgs) => R1,
-  f2: (a: R1) => R2
-): (...args: TArgs) => R2;
-export function pipe<TArgs extends any[], R1>(
-  f1: (...args: TArgs) => R1
-): (...args: TArgs) => R1;
+ * 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<K extends keyof T, T>(property: K, list: T[]): T[K][];
-export function pluck<T>(property: number, list: { [k: number]: T }[]):  T[];
-export function pluck<P extends string>(property: P): <T>(list: Record<P, T>[]) => T[];
-export function pluck(property: number): <T>(list: { [k: number]: T }[]) => T[];
+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, U>(xToPrepend: T, iterable: IsFirstSubtypeOfSecond<T, U>[]) : U[];
-export function prepend<T>(xToPrepend: T): <U>(iterable: IsFirstSubtypeOfSecond<T, U>[]) => U[];
 export function prepend<T>(xToPrepend: T): (iterable: T[]) => T[];
-export function product(list: number[]): number;
 /**
  * It returns the value of property `propToFind` in `obj`.
  *
  * If there is no such property, it returns `undefined`.
  */
-export function prop<_, P extends keyof never, T>(p: P, value: T): Prop<T, P>;
-export function prop<V>(p: keyof never, value: unknown): V;
-export function prop<_, P extends keyof never>(p: P): <T>(value: T) => Prop<T, P>;
-export function prop<V>(p: keyof never): (value: unknown) => V;
+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<K extends string | number>(valueToMatch: any, propToFind: K, obj: Record<K, any>): boolean;
-export function propEq<K extends string | number>(valueToMatch: any, propToFind: K): (obj: Record<K, any>) => boolean;
-export function propEq(valueToMatch: any): {
-  <K extends string | number>(propToFind: K, obj: Record<K, any>): boolean;
-  <K extends string | number>(propToFind: K): (obj: Record<K, any>) => boolean;
-};
-/**
- * It returns `true` if `property` of `obj` is from `target` type.
- */
-export function propIs<C extends AnyFunction, K extends keyof any>(type: C, name: K, obj: any): obj is Record<K, ReturnType<C>>;
-export function propIs<C extends AnyConstructor, K extends keyof any>(type: C, name: K, obj: any): obj is Record<K, InstanceType<C>>;
-export function propIs<C extends AnyFunction, K extends keyof any>(type: C, name: K): (obj: any) => obj is Record<K, ReturnType<C>>;
-export function propIs<C extends AnyConstructor, K extends keyof any>(type: C, name: K): (obj: any) => obj is Record<K, InstanceType<C>>;
-export function propIs<C extends AnyFunction>(type: C): {
-    <K extends keyof any>(name: K, obj: any): obj is Record<K, ReturnType<C>>;
-    <K extends keyof any>(name: K): (obj: any) => obj is Record<K, ReturnType<C>>;
+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>> | undefined): T;
-export function propOr<T, P extends string>(defaultValue: T, property: P): (obj: Partial<Record<P, T>> | undefined) => T;
-export function propOr<T>(defaultValue: T): {
-  <P extends string>(property: P, obj: Partial<Record<P, T>> | undefined): T;
-  <P extends string>(property: P): (obj: Partial<Record<P, T>> | undefined) => T;
-}
+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: Predicate<T>, property: string, obj: Record<string, T>): boolean;
-export function propSatisfies<T>(predicate: Predicate<T>, property: string): (obj: Record<string, T>) => boolean;
-/**
- * It takes list with properties `propsToPick` and returns a list with property values in `obj`.
- */
-export function props<P extends string, T>(propsToPick: P[], obj: Record<P, T>): T[];
-export function props<P extends string>(propsToPick: P[]): <T>(obj: Record<P, T>) => T[];
-export function props<P extends string, T>(propsToPick: P[]): (obj: Record<P, T>) => T[];
+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.
  */
-export function range(startInclusive: number, endExclusive: number): number[];
 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;
-export function reduce<T, TResult>(reducer: (prev: TResult, current: T) => TResult, initialValue: TResult, list: T[]): TResult;
-export function reduce<T, TResult>(reducer: (prev: TResult, current: T, i: number) => TResult): (initialValue: TResult, list: T[]) => TResult;
 export function reduce<T, TResult>(reducer: (prev: TResult, current: T, i: number) => TResult, initialValue: TResult): (list: T[]) => TResult;
-export function reduceBy<T, TResult>(
-  valueFn: (acc: TResult, elem: T) => TResult,
-): (a: TResult, b: (elem: T) => string, c: T[]) => { [index: string]: TResult }
-export function reduceBy<T, TResult>(
-  valueFn: (acc: TResult, elem: T) => TResult,
-  acc: TResult,
-): (a: (elem: T) => string, b: T[]) => { [index: string]: TResult }
-export function reduceBy<T, TResult>(
-  valueFn: (acc: TResult, elem: T) => TResult,
-  acc: TResult,
-  keyFn: (elem: T) => string,
-): (list: T[]) => { [index: string]: TResult };
-export function reduceBy<T, TResult>(
-  valueFn: (acc: TResult, elem: T) => TResult,
-  acc: TResult,
-  keyFn: (elem: T) => string,
-  list: T[],
-): { [index: string]: TResult };
 /**
  * It has the opposite effect of `R.filter`.
  */
-export function reject<T>(predicate: Predicate<T>, list: T[]): T[];
-export function reject<T>(predicate: Predicate<T>): (list: T[]) => T[];
-export function reject<T>(predicate: Predicate<T>, obj: Dictionary<T>): Dictionary<T>;
-export function reject<T, U>(predicate: Predicate<T>): (obj: Dictionary<T>) => Dictionary<T>;
+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[];
 /**
- * It returns a copy of `list` input with removed `index`.
+ * Same as `R.filterObject` but it returns the object with properties that do not satisfy the predicate function.
  */
-export function removeIndex<T>(index: number, list: T[]): T[];
-export function removeIndex(index: number): <T>(list: T[]) => T[];
-export function repeat<T>(x: T): (timesToRepeat: number) => T[];
-export function repeat<T>(x: T, timesToRepeat: number): T[];
+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: RegExpReplacer, str: string): string;
-export function replace(strOrRegex: RegExp | string, replacer: RegExpReplacer): (str: string) => string;
-export function replace(strOrRegex: RegExp | string): (replacer: RegExpReplacer) => (str: string) => string;
+export function replace(strOrRegex: RegExp | string, replacer: RegExp | string): (str: string) => string;
 /**
- * It returns a reversed copy of list or string `input`.
+ * It replaces `index` in array `list` with the result of `replaceFn(list[i])`.
  */
-export function reverse<T>(input: T[]): T[];
-export function reverse(input: string): string;
-/**
- * It returns a copied **Object** or **Array** with modified `lens` focus set to `replacer` value.
- */
-export function set<S, A>(lens: Lens<S, A>): {
-  (a: A): (obj: S) => S
-  (a: A, obj: S): S
-};
-export function set<S, A>(lens: Lens<S, A>, a: A): (obj: S) => S;
-export function set<S, A>(lens: Lens<S, A>, a: A, obj: S): S;
-export function slice(from: number, to: number, input: string): string;
-export function slice<T>(from: number, to: number, input: T[]): T[];
-export function slice(from: number, to: number): {
-  (input: string): string;
-  <T>(input: T[]): T[];
-};
-export function slice(from: number): {
-  (to: number, input: string): string;
-  <T>(to: number, input: T[]): T[];
-};
+export function replaceItemAtIndex<T>(index: number, replaceFn: (x: T) => T): (list: T[]) => T[];
 /**
  * It returns copy of `list` sorted by `sortFn` function, where `sortFn` needs to return only `-1`, `0` or `1`.
@@ -1564,55 +1479,17 @@ 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: (a: T) => Ord, list: T[]): T[];
 export function sortBy<T>(sortFn: (a: T) => Ord): (list: T[]) => T[];
 export function sortBy(sortFn: (a: any) => Ord): <T>(list: T[]) => T[];
 export function sortWith<T>(fns: Array<(a: T, b: T) => number>): (list: T[]) => T[];
-export function sortWith<T>(fns: Array<(a: T, b: T) => number>, list: T[]): T[];
-/**
- * Curried version of `String.prototype.split`
- */
 export function split(separator: string | RegExp): (str: string) => string[];
-export function split(separator: string | RegExp, str: string): string[];
-/**
- * It splits string or array at a given index.
- */
-export function splitAt<T>(index: number, input: T[]): [T[], T[]];
-export function splitAt(index: number, input: string): [string, string];
-export function splitAt(index: number): {
-    <T>(input: T[]): [T[], T[]];
-    (input: string): [string, string];
-};
 /**
  * It splits `input` into slices of `sliceLength`.
  */
-export function splitEvery<T>(sliceLength: number, input: T[]): (T[])[];
-export function splitEvery(sliceLength: number, input: string): string[];
-export function splitEvery(sliceLength: number): {
-  (input: string): string[];
-  <T>(input: T[]): (T[])[];
-};
-/**
- * It splits `list` to two arrays according to a `predicate` function.
- *
- * The first array contains all members of `list` before `predicate` returns `true`.
- */
-export function splitWhen<T, U>(predicate: Predicate<T>, list: U[]): (U[])[];
-export function splitWhen<T>(predicate: Predicate<T>): <U>(list: U[]) => (U[])[];
-/**
- * When iterable is a string, then it behaves as `String.prototype.startsWith`.
- * When iterable is a list, then it uses R.equals to determine if the target list starts in the same way as the given target.
- */
-export function startsWith<T extends string>(question: T, input: string): boolean;
-export function startsWith<T extends string>(question: T): (input: string) => boolean;
-export function startsWith<T>(question: T[], input: T[]): boolean;
-export function startsWith<T>(question: T[]): (input: T[]) => boolean;
+export function splitEvery<T>(sliceLength: number): (input: T[]) => (T[])[];
 /**
  * Curried version of `x - y`
@@ -1622,15 +1499,11 @@ export function subtract(x: number): (y: number) => number;
 export function sum(list: number[]): number;
-export function swap(indexA: number, indexB: number): <T>(list: T[]) => T[];
-export function swap<T>(indexA: number, indexB: number, list: 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[], y: T[]): T[];
 export function symmetricDifference<T>(x: T[]): <T>(y: T[]) => T[];
 /**
@@ -1642,29 +1515,31 @@ export function tail(input: string): string;
 /**
  * It returns the first `howMany` elements of `input`.
  */
-export function take<T>(howMany: number, input: T): T extends string ? string : T;
-export function take<T>(howMany: number) : (input: T) => T extends string ? string : T;
+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: T): T extends string ? string : T;
-export function takeLast<T>(howMany: number) : (input: T) => T extends string ? string : T;
+export function takeLast<T>(howMany: number): {
+  (input: string): string;
+  (input: T[]): T[];
+  (input: readonly T[]): T[];
+};
-export function takeLastWhile(predicate: (x: string) => boolean, input: string): string;
-export function takeLastWhile(predicate: (x: string) => boolean): (input: string) => string;
-export function takeLastWhile<T>(predicate: (x: T) => boolean, input: T[]): T[];
-export function takeLastWhile<T>(predicate: (x: T) => boolean): <T>(input: 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(fn: Predicate<string>, iterable: string): string;
-export function takeWhile(fn: Predicate<string>): (iterable: string) => string;
-export function takeWhile<T>(fn: Predicate<T>, iterable: T[]): T[];
-export function takeWhile<T>(fn: Predicate<T>): (iterable: 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.compose`.
+ * One use case is debugging in the middle of `R.pipe` chain.
  */
 export function tap<T>(fn: (x: T) => void, input: T): T;
 export function tap<T>(fn: (x: T) => void): (input: T) => T;
@@ -1683,24 +1558,6 @@ export function test(regExpression: RegExp, str: string): boolean;
 export function times<T>(fn: (i: number) => T, howMany: number): T[];
 export function times<T>(fn: (i: number) => T): (howMany: number) => T[];
-export function toLower<S extends string>(str: S): Lowercase<S>;
-export function toLower(str: string): string;
-/**
- * It transforms an object to a list.
- */
-export function toPairs<O extends object, K extends Extract<keyof O, string | number>>(obj: O): Array<{ [key in K]: [`${key}`, O[key]] }[K]>;
-export function toPairs<S>(obj: Record<string | number, S>): Array<[string, S]>;
-export function toString(x: unknown): string;
-export function toUpper<S extends string>(str: S): Uppercase<S>;
-export function toUpper(str: string): string;
-export function transpose<T>(list: (T[])[]): (T[])[];
-export function trim(str: string): string;
 /**
  * It returns function that runs `fn` in `try/catch` block. If there was an error, then `fallback` is used to return the result. Note that `fn` can be value or asynchronous/synchronous function(unlike `Ramda` where fallback can only be a synchronous function).
  */
@@ -1708,37 +1565,17 @@ export function tryCatch<T, U>(
   fn: (input: T) => U,
   fallback: U
 ): (input: T) => U;
-export function tryCatch<T, U>(
-  fn: (input: T) => U,
-  fallback: (input: T) => U
-): (input: T) => U;
-export function tryCatch<T>(
-  fn: (input: any) => Promise<any>,
-  fallback: T
-): (input: any) => Promise<T>;
-export function tryCatch<T>(
-  fn: (input: any) => Promise<any>,
-  fallback: (input: any) => Promise<any>,
-): (input: any) => Promise<T>;
 /**
  * It accepts any input and it returns its type.
  */
 export function type(x: any): RambdaTypes;
-/**
- * It calls a function `fn` with the list of values of the returned function.
- *
- * `R.unapply` is the opposite of `R.apply` method.
- */
-export function unapply<T = any>(fn: (args: any[]) => T): (...args: any[]) => T;
 /**
  * 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[];
 export function union<T>(x: T[]): (y: T[]) => T[];
 /**
@@ -1753,7 +1590,6 @@ export function uniq<T>(list: T[]): T[];
  *
  * `R.equals` is used to determine equality.
  */
-export function uniqBy<T, U>(fn: (a: T) => U, list: T[]): T[];
 export function uniqBy<T, U>(fn: (a: T) => U): (list: T[]) => T[];
 /**
@@ -1761,7 +1597,6 @@ export function uniqBy<T, U>(fn: (a: T) => U): (list: T[]) => T[];
  *
  * This predicate should return true, if two elements are equal.
  */
-export function uniqWith<T, U>(predicate: (x: T, y: T) => boolean, list: T[]): T[];
 export function uniqWith<T, U>(predicate: (x: T, y: T) => boolean): (list: T[]) => T[];
 /**
@@ -1771,96 +1606,34 @@ export function uniqWith<T, U>(predicate: (x: T, y: T) => boolean): (list: T[])
  *
  * 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, 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;
 export function unless<T>(predicate: (x: T) => boolean, whenFalseFn: (x: T) => T): (x: T) => T;
-export function unnest(list: unknown[]): unknown[];
-export function unnest<T>(list: unknown[]): T;
-export function unwind<T, U>(prop: keyof T, obj: T): U[];
-export function unwind<T, U>(prop: keyof T): (obj: T) => U[];
-/**
- * It returns a copy of `list` with updated element at `index` with `newValue`.
- */
-export function update<T>(index: number, newValue: T, list: T[]): T[];
-export function update<T>(index: number, newValue: T): (list: T[]) => T[];
 /**
- * With correct input, this is nothing more than `Object.values(Record<string, unknown>)`. If `obj` is not an object, then it returns an empty array.
+ * 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 values<T extends object, K extends keyof T>(obj: T): T[K][];
+export function unwind<S extends string>(prop: S): <T>(obj: T) => Omit<T, S> & { [K in S]: T[S][number] };
 /**
- * It returns the value of `lens` focus over `target` object.
+ * It returns a copy of `list` with updated element at `index` with `newValue`.
  */
-export function view<S, A>(lens: Lens<S, A>): (obj: S) => A;
-export function view<S, A>(lens: Lens<S, A>, obj: S): A;
+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>(predicate: (x: T) => boolean, whenTrueFn: (a: T) => U, input: T): T | U;
+export function when<T>(predicate: (x: T) => boolean, whenTrueFn: (a: T) => T): (input: T) => T;
 export function when<T, U>(predicate: (x: T) => boolean, whenTrueFn: (a: T) => U): (input: T) => T | U;
-export function when<T, U>(predicate: (x: T) => boolean): ((whenTrueFn: (a: T) => U) => (input: T) => T | U);
-/**
- * It returns `true` if all each property in `conditions` returns `true` when applied to corresponding property in `input` object.
- */
-export function where<T, U>(conditions: T, input: U): boolean;
-export function where<T>(conditions: T): <U>(input: U) => boolean;
-export function where<ObjFunc2, U>(conditions: ObjFunc2, input: U): boolean;
-export function where<ObjFunc2>(conditions: ObjFunc2): <U>(input: U) => boolean;
-/**
- * Same as `R.where`, but it will return `true` if at least one condition check returns `true`.
- */
-export function whereAny<T, U>(conditions: T, input: U): boolean;
-export function whereAny<T>(conditions: T): <U>(input: U) => boolean;
-export function whereAny<ObjFunc2, U>(conditions: ObjFunc2, input: U): boolean;
-export function whereAny<ObjFunc2>(conditions: ObjFunc2): <U>(input: U) => boolean;
-/**
- * It will return `true` if all of `input` object fully or partially include `rule` object.
- *
- * `R.equals` is used to determine equality.
- */
-export function whereEq<T, U>(condition: T, input: U): boolean;
-export function whereEq<T>(condition: T): <U>(input: U) => boolean;
-/**
- * It will return a new array, based on all members of `source` list that are not part of `matchAgainst` list.
- *
- * `R.equals` is used to determine equality.
- */
-export function without<T>(matchAgainst: T[], source: T[]): T[];
-export function without<T>(matchAgainst: T[]): (source: T[]) => T[];
-/**
- * Logical XOR
- */
-export function xor(x: boolean, y: boolean): boolean;
-export function xor(y: boolean): (y: boolean) => boolean;
 /**
  * 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, V>(x: K[], y: V[]): KeyValuePair<K, V>[];
 export function zip<K>(x: K[]): <V>(y: V[]) => KeyValuePair<K, V>[];
-/**
- * It will return a new object with keys of `keys` array and values of `values` array.
- */
-export function zipObj<T, K extends string>(keys: K[], values: T[]): { [P in K]: T };
-export function zipObj<K extends string>(keys: K[]): <T>(values: T[]) => { [P in K]: T };
-export function zipObj<T, K extends number>(keys: K[], values: T[]): { [P in K]: T };
-export function zipObj<K extends number>(keys: K[]): <T>(values: T[]) => { [P in K]: T };
-export function zipWith<T, U, TResult>(fn: (x: T, y: U) => TResult, list1: T[], list2: U[]): TResult[];
-export function zipWith<T, U, TResult>(fn: (x: T, y: U) => TResult, list1: T[]): (list2: U[]) => TResult[];
-export function zipWith<T, U, TResult>(fn: (x: T, y: U) => TResult): (list1: T[], list2: U[]) => TResult[];
+export function zipWith<T, U, TResult>(
+  fn: (x: T, y: U) => TResult,
+  list1: readonly T[],
+): (list2: readonly U[]) => TResult[];