@linkdotnet/stringoperations/dist/edit-distance/longest-common-substring.d.ts

Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.

/**
 * Gets the longest common substring of two given strings
 * @param one First word
 * @param two Second word
 * @param ignoreCase If true, the string compares ignoring the case. So 'd' and 'D' would match
 * @returns Longest common substring
 * @remarks If ignoreCase is true, the casing of one will be returned as longest common substring.
 * If word one is 'typeSCRIPT' and word two is 'JAVAscript' then 'SCRIPT' will be returned
 */
export declare function getLongestCommonSubstring(one: string, two: string, ignoreCase?: boolean): string;