UNPKG

bigint-fraction

Version:
38 lines (37 loc) 788 B
/** * Euclidean utilities. */ export declare namespace Euclidean { /** * Computes a greatest common divisor between a pair of integers. * * @param {bigint} a * * The first integer. * * @param {bigint} b * * The second integer. * * @returns {bigint} * * A greatest common divisor of two arguments. */ const GCD: (a: bigint, b: bigint) => bigint; /** * Computes a greatest common divisor between a pair of integers asynchronously. * * @param {bigint} a * * The first integer. * * @param {bigint} b * * The second integer. * * @returns {Promise<bigint>} * * A promise. */ const GCDAsync: (a: bigint, b: bigint) => Promise<bigint>; }