UNPKG

qlevens

Version:

A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.

10 lines (9 loc) 250 B
/** Exported memory */ export declare const memory: WebAssembly.Memory; /** * src/index/distance * @param a `~lib/string/String` * @param b `~lib/string/String` * @returns `i32` */ export declare function distance(a: string, b: string): number;