rambda 7.3.0 → 7.4.0

package/index.d.ts

@@ -7,11 +7,14 @@ 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 Path = string | (number | string)[];
+type RamdaPath = (number | string)[];
 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;
-export type RamdaPath = (number | string)[];
 type CondPair<T extends any[], R> = [(...val: T) => boolean, (...val: T) => R]
+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>
@@ -136,6 +139,10 @@ type ApplyDiffRule = ApplyDiffUpdate | ApplyDiffAdd | ApplyDiffRemove;
 type Resolved<T> = {status: 'fulfilled', value: T} | {status: 'rejected', reason: string|Error}
 
 
+export function F(): boolean;
+
+export function T(): boolean;
+
 /**
  * It adds `a` and `b`.
  */
@@ -171,12 +178,6 @@ export function always<T>(x: T): (...args: unknown[]) => T;
 export function and<T, U>(x: T, y: U): T | U;
 export function and<T>(x: T): <U>(y: U) => T | U;
 
-/**
- * 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 `true`, if at least one member of `list` returns true, when passed to a `predicate` function.
  */
@@ -195,6 +196,14 @@ export function anyPass<T>(predicates: ((...inputs: T[]) => boolean)[]): (...inp
 export function append<T>(x: T, list: T[]): T[];
 export function append<T>(x: T): <T>(list: 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
 ): (
@@ -216,6 +225,12 @@ export function assocPath<Output>(path: Path, newValue: any, obj: object): Outpu
 export function assocPath<Output>(path: Path, newValue: any): (obj: object) => Output;
 export function assocPath<Output>(path: Path): (newValue: any) => (obj: object) => Output;
 
+/**
+ * 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.
  * 
@@ -347,6 +362,18 @@ export function cond<T extends any[], R>(conditions: Array<CondPair<T, R>>): (..
  */
 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.
  */
@@ -407,6 +434,24 @@ export function dropLast<T>(howMany: number): {
   (input: string): string;
 };
 
+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[];
+
+/**
+ * It removes any successive duplicates according to `R.equals`.
+ */
+export function dropRepeats<T>(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[];
+
 /**
  * It returns a new `predicate` function from `firstPredicate` and `secondPredicate` inputs.
  * 
@@ -426,13 +471,26 @@ export function endsWith(target: string): (iterable: string) => boolean;
 export function endsWith<T>(target: T[], list: T[]): boolean;
 export function endsWith<T>(target: T[]): (list: 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;
+
 /**
  * It deeply compares `x` and `y` and returns `true` if they are equal.
  */
 export function equals<T>(x: T, y: T): boolean;
 export function equals<T>(x: T): (y: T) => boolean;
 
-export function F(): boolean;
+/**
+ * It takes object or array 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>;
 
 /**
  * It filters list or object `input` using a `predicate` function.
@@ -641,6 +699,16 @@ export function isNil(x: any): x is null | undefined;
 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.
  */
@@ -697,29 +765,6 @@ export function lensProp(prop: string): {
   set<T, U, V>(val: T, obj: U): V;
 };
 
-/**
- * It returns a copied **Object** or **Array** with modified value received by applying function `fn` to `lens` focus.
- */
-export function over<T>(lens: Lens, fn: Arity1Fn, value: T): T;
-export function over<T>(lens: Lens, fn: Arity1Fn, value: T[]): T[];
-export function over(lens: Lens, fn: Arity1Fn): <T>(value: T) => T;
-export function over(lens: Lens, fn: Arity1Fn): <T>(value: T[]) => T[];
-export function over(lens: Lens): <T>(fn: Arity1Fn, value: T) => T;
-export function over(lens: Lens): <T>(fn: Arity1Fn, value: T[]) => T[];
-
-/**
- * It returns a copied **Object** or **Array** with modified `lens` focus set to `replacer` value.
- */
-export function set<T, U>(lens: Lens, replacer: U, obj: T): T;
-export function set<U>(lens: Lens, replacer: U): <T>(obj: T) => T;
-export function set(lens: Lens): <T, U>(replacer: U, obj: T) => T;
-
-/**
- * It returns the value of `lens` focus over `target` object.
- */
-export function view<T, U>(lens: Lens): (target: T) => U;
-export function view<T, U>(lens: Lens, target: T): U;
-
 /**
  * It returns the result of looping through `iterable` with `fn`.
  * 
@@ -781,12 +826,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 creates a copy of `target` object with overidden `newProps` properties. Previously known as `R.merge` but renamed after Ramda did the same.
- */
-export function mergeRight<A, B>(target: A, newProps: B): A & B
-export function mergeRight<Output>(target: any): (newProps: any) => Output;
-
 /**
  * It merges all objects of `list` array sequentially and returns the result.
  */
@@ -808,6 +847,22 @@ export function mergeDeepRight<Output>(target: object): (newProps: object) => Ou
 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 overidden `newProps` properties. Previously known as `R.merge` but renamed after Ramda did the same.
+ */
+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.
+ */
+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;
+
 /**
  * It returns the lesser value between `x` and `y`.
  */
@@ -821,6 +876,23 @@ 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<T extends object, K extends keyof T, P>(
+  prop: K,
+  fn: (a: T[K]) => P,
+  obj: T,
+): Omit<T, K> & Record<K, P>;
+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>;
+
+/**
+ * It changes a property of object on the base of provided path and 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`.
  */
@@ -851,6 +923,11 @@ export function negate(x: number): number;
 export function none<T>(predicate: (x: T) => boolean, list: T[]): boolean;
 export function none<T>(predicate: (x: T) => boolean): (list: T[]) => boolean;
 
+/**
+ * It returns `undefined`.
+ */
+export function nop(): void;
+
 /**
  * It returns a boolean negated version of `input`.
  */
@@ -872,10 +949,7 @@ export function nth(n: number): {
 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>;
 
-/**
- * It returns a function, which invokes only once `fn` function.
- */
-export function once<T extends AnyFunction>(func: T): T;
+export function of<T>(x: T): T[];
 
 /**
  * It returns a partial copy of an `obj` without `propsToOmit` properties.
@@ -887,7 +961,38 @@ 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 of<T>(x: T): 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))`).
+ * 
+ * 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>(func: T): 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.
+ */
+export function over<T>(lens: Lens, fn: Arity1Fn, value: T): T;
+export function over<T>(lens: Lens, fn: Arity1Fn, value: T[]): T[];
+export function over(lens: Lens, fn: Arity1Fn): <T>(value: T) => T;
+export function over(lens: Lens, fn: Arity1Fn): <T>(value: T[]) => T[];
+export function over(lens: Lens): <T>(fn: Arity1Fn, value: T) => T;
+export function over(lens: Lens): <T>(fn: Arity1Fn, value: T[]) => T[];
 
 /**
  * It is very similar to `R.curry`, but you can pass initial arguments when you create the curried function.
@@ -903,6 +1008,16 @@ export function partial<V0, V1, V2, V3, T>(fn: (x0: V0, x1: V1, x2: V2, x3: V3)
 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[]): (...x: 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.
+ */
+export function partialObject<Input, PartialInput, Output>(
+  fn: (input: Input) => Output, 
+  partialInput: PartialInput,
+): (input: Pick<Input, Exclude<keyof Input, keyof PartialInput>>) => Output;
+
 /**
  * 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.
  */
@@ -926,10 +1041,41 @@ export function partition<T>(
  * 
  * It will return `undefined`, if such path is not found.
  */
-export function path<Input, T>(pathToSearch: Path, obj: Input): T | undefined;
-export function path<T>(pathToSearch: Path, obj: any): T | undefined;
-export function path<T>(pathToSearch: Path): (obj: any) => T | undefined;
-export function path<Input, T>(pathToSearch: Path): (obj: Input) => T | undefined;
+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 = 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];
+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];
+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],
+>(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],
+>(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;
 
 /**
  * It returns `true` if `pathToSearch` of `input` object is equal to `target` value.
@@ -940,6 +1086,13 @@ 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;
+
 /**
  * It loops over members of `pathsToSearch` as `singlePath` and returns the array produced by `R.path(singlePath, Record<string, unknown>)`.
  * 
@@ -950,13 +1103,6 @@ export function paths<Input, T>(pathsToSearch: Path[]): (obj: Input) => (T | und
 export function paths<T>(pathsToSearch: Path[], obj: any): (T | undefined)[];
 export function paths<T>(pathsToSearch: Path[]): (obj: any) => (T | undefined)[];
 
-/**
- * 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;
-
 /**
  * It returns a partial copy of an `input` containing only `propsToPick` properties.
  * 
@@ -974,8 +1120,9 @@ 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, U>(propsToPick: string[], input: T): U;
-export function pickAll<T, U>(propsToPick: string[]): (input: T) => U;
+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;
 
@@ -1059,10 +1206,17 @@ export function product(list: number[]): number;
  * 
  * If there is no such property, it returns `undefined`.
  */
-export function prop<P extends keyof O, O>(propToFind: P, obj: O): O[P];
-export function prop<P extends keyof O, O>(propToFind: P): (obj: O) => O[P];
-export function prop<P extends string | number>(propToFind: P): <T>(obj: Record<P, T>) => T;
-export function prop<P extends string | number, T>(propToFind: P): (obj: Record<P, T>) => T;
+export function prop<P extends keyof never, T>(propToFind: P, value: T): Prop<T, P>;
+export function prop<P extends keyof never>(propToFind: P): {
+    <T>(value: Record<P, T>): T;
+    <T>(value: T): Prop<T, P>;
+};
+export function prop<P extends keyof T, T>(propToFind: P): {
+    (value: T): Prop<T, P>;
+};
+export function prop<P extends keyof never, T>(propToFind: P): {
+    (value: Record<P, T>): T;
+};
 
 /**
  * It returns true if `obj` has property `propToFind` and its value is equal to `valueToMatch`.
@@ -1102,6 +1256,13 @@ export function propOr<T>(defaultValue: T): {
 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[];
+
 /**
  * It returns list of numbers between `startInclusive` to `endExclusive` markers.
  */
@@ -1137,6 +1298,13 @@ export function replace(strOrRegex: RegExp | string): (replacer: string) => (str
 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<T, U>(lens: Lens, replacer: U, obj: T): T;
+export function set<U>(lens: Lens, replacer: U): <T>(obj: T) => T;
+export function set(lens: Lens): <T, U>(replacer: U, obj: T) => T;
+
 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): {
@@ -1167,6 +1335,16 @@ export function sortBy(sortFn: (a: any) => Ord): <T>(list: T[]) => T[];
 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`.
  */
@@ -1177,6 +1355,14 @@ export function splitEvery(sliceLength: number): {
   <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.
@@ -1202,8 +1388,6 @@ export function sum(list: number[]): number;
 export function symmetricDifference<T>(x: T[], y: T[]): T[];
 export function symmetricDifference<T>(x: T[]): <T>(y: T[]) => T[];
 
-export function T(): boolean;
-
 /**
  * It returns all but the first element of `input`.
  */
@@ -1230,6 +1414,16 @@ export function takeLast<T>(howMany: number): {
   (input: string): string;
 };
 
+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 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[];
+
 /**
  * It applies function `fn` to input `x` and returns `x`.
  * 
@@ -1255,9 +1449,6 @@ 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;
 
-export function toUpper<S extends string>(str: S): Uppercase<S>;
-export function toUpper(str: string): string;
-
 /**
  * It transforms an object to a list.
  */
@@ -1266,6 +1457,9 @@ 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;
@@ -1295,6 +1489,13 @@ export function tryCatch<T>(
  */
 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.
  * 
@@ -1310,6 +1511,9 @@ export function union<T>(x: T[]): (y: T[]) => T[];
  */
 export function uniq<T>(list: T[]): T[];
 
+export function uniqBy<T, U>(fn: (a: T) => U, list: T[]): T[];
+export function uniqBy<T, U>(fn: (a: T) => U): (list: T[]) => T[];
+
 /**
  * It returns a new array containing only one copy of each element in `list` according to `predicate` function.
  * 
@@ -1330,6 +1534,9 @@ export function unless<T, U>(predicate: (x: T) => boolean, whenFalseFn: (x: T) =
 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 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`.
  */
@@ -1341,6 +1548,12 @@ export function update<T>(index: number, newValue: T): (list: T[]) => T[];
  */
 export function values<T extends object, K extends keyof T>(obj: T): T[K][];
 
+/**
+ * It returns the value of `lens` focus over `target` object.
+ */
+export function view<T, U>(lens: Lens): (target: T) => U;
+export function view<T, U>(lens: Lens, target: T): U;
+
 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;
 export function when<T, U>(predicate: (x: T) => boolean): ((whenTrueFn: (a: T) => U) => (input: T) => T | U);
@@ -1353,6 +1566,14 @@ 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.
  * 
@@ -1391,180 +1612,6 @@ export function zipObj<K extends string>(keys: K[]): <T>(values: T[]) => { [P in
 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 };
 
-/**
- * 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 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[];
-
-/**
- * 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 `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[])[];
-
-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[];
-
-/**
- * It takes object or array 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>;
-
-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[];
-
-/**
- * It removes any successive duplicates according to `R.equals`.
- */
-export function dropRepeats<T>(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 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[];
-
-/**
- * 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;
-
-/**
- * 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 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;
-
-/**
- * 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 takes two objects and a function, which will be used when there is an overlap between the keys.
- */
-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;
-
-/**
- * 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 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>;
-
-export function unwind<T, U>(prop: keyof T, obj: T): U[];
-export function unwind<T, U>(prop: keyof T): (obj: T) => U[];
-
-/**
- * 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))`).
- * 
- * 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;
-};
-
-/**
- * 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;
-
-/**
- * `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.
- */
-export function partialObject<Input, PartialInput, Output>(
-  fn: (input: Input) => Output, 
-  partialInput: PartialInput,
-): (input: Pick<Input, Exclude<keyof Input, keyof PartialInput>>) => Output;
-
-export function uniqBy<T, U>(fn: (a: T) => U, list: T[]): T[];
-export function uniqBy<T, U>(fn: (a: T) => U): (list: T[]) => T[];
-
-/**
- * It changes a property of object on the base of provided path and 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;
-
-export function modify<T extends object, K extends keyof T, P>(
-  prop: K,
-  fn: (a: T[K]) => P,
-  obj: T,
-): Omit<T, K> & Record<K, P>;
-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>;