@technobuddha/library

<!doctype html> <html lang="en"> <head> <title>Code coverage report for levenshtein-distance.ts</title> <meta charset="utf-8" /> <link rel="stylesheet" href="prettify.css" /> <link rel="stylesheet" href="base.css" /> <link rel="shortcut icon" type="image/x-icon" href="favicon.png" /> <meta name="viewport" content="width=device-width, initial-scale=1" /> <style type='text/css'> .coverage-summary .sorter { background-image: url(sort-arrow-sprite.png); } </style> </head> <body> <div class='wrapper'> <div class='pad1'> <h1><a href="index.html">All files</a> levenshtein-distance.ts</h1> <div class='clearfix'> <div class='fl pad1y space-right2'> 100% Statements 50/50 </div> <div class='fl pad1y space-right2'> 100% Branches 20/20 </div> <div class='fl pad1y space-right2'> 100% Functions 1/1 </div> <div class='fl pad1y space-right2'> 100% Lines 50/50 </div> </div> Press n or j to go to the next uncovered block, b, p or k for the previous block. <template id="filterTemplate"> <div class="quiet"> Filter: <input type="search" id="fileSearch"> </div> </template> </div> <div class='status-line high'></div> <pre><table class="coverage"> <tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a> <a name='L2'></a><a href='#L2'>2</a> <a name='L3'></a><a href='#L3'>3</a> <a name='L4'></a><a href='#L4'>4</a> <a name='L5'></a><a href='#L5'>5</a> <a name='L6'></a><a href='#L6'>6</a> <a name='L7'></a><a href='#L7'>7</a> <a name='L8'></a><a href='#L8'>8</a> <a name='L9'></a><a href='#L9'>9</a> <a name='L10'></a><a href='#L10'>10</a> <a name='L11'></a><a href='#L11'>11</a> <a name='L12'></a><a href='#L12'>12</a> <a name='L13'></a><a href='#L13'>13</a> <a name='L14'></a><a href='#L14'>14</a> <a name='L15'></a><a href='#L15'>15</a> <a name='L16'></a><a href='#L16'>16</a> <a name='L17'></a><a href='#L17'>17</a> <a name='L18'></a><a href='#L18'>18</a> <a name='L19'></a><a href='#L19'>19</a> <a name='L20'></a><a href='#L20'>20</a> <a name='L21'></a><a href='#L21'>21</a> <a name='L22'></a><a href='#L22'>22</a> <a name='L23'></a><a href='#L23'>23</a> <a name='L24'></a><a href='#L24'>24</a> <a name='L25'></a><a href='#L25'>25</a> <a name='L26'></a><a href='#L26'>26</a> <a name='L27'></a><a href='#L27'>27</a> <a name='L28'></a><a href='#L28'>28</a> <a name='L29'></a><a href='#L29'>29</a> <a name='L30'></a><a href='#L30'>30</a> <a name='L31'></a><a href='#L31'>31</a> <a name='L32'></a><a href='#L32'>32</a> <a name='L33'></a><a href='#L33'>33</a> <a name='L34'></a><a href='#L34'>34</a> <a name='L35'></a><a href='#L35'>35</a> <a name='L36'></a><a href='#L36'>36</a> <a name='L37'></a><a href='#L37'>37</a> <a name='L38'></a><a href='#L38'>38</a> <a name='L39'></a><a href='#L39'>39</a> <a name='L40'></a><a href='#L40'>40</a> <a name='L41'></a><a href='#L41'>41</a> <a name='L42'></a><a href='#L42'>42</a> <a name='L43'></a><a href='#L43'>43</a> <a name='L44'></a><a href='#L44'>44</a> <a name='L45'></a><a href='#L45'>45</a> <a name='L46'></a><a href='#L46'>46</a> <a name='L47'></a><a href='#L47'>47</a> <a name='L48'></a><a href='#L48'>48</a> <a name='L49'></a><a href='#L49'>49</a> <a name='L50'></a><a href='#L50'>50</a> <a name='L51'></a><a href='#L51'>51</a> <a name='L52'></a><a href='#L52'>52</a> <a name='L53'></a><a href='#L53'>53</a> <a name='L54'></a><a href='#L54'>54</a> <a name='L55'></a><a href='#L55'>55</a> <a name='L56'></a><a href='#L56'>56</a> <a name='L57'></a><a href='#L57'>57</a> <a name='L58'></a><a href='#L58'>58</a> <a name='L59'></a><a href='#L59'>59</a> <a name='L60'></a><a href='#L60'>60</a> <a name='L61'></a><a href='#L61'>61</a> <a name='L62'></a><a href='#L62'>62</a> <a name='L63'></a><a href='#L63'>63</a> <a name='L64'></a><a href='#L64'>64</a> <a name='L65'></a><a href='#L65'>65</a> <a name='L66'></a><a href='#L66'>66</a> <a name='L67'></a><a href='#L67'>67</a> <a name='L68'></a><a href='#L68'>68</a> <a name='L69'></a><a href='#L69'>69</a> <a name='L70'></a><a href='#L70'>70</a> <a name='L71'></a><a href='#L71'>71</a> <a name='L72'></a><a href='#L72'>72</a> <a name='L73'></a><a href='#L73'>73</a> <a name='L74'></a><a href='#L74'>74</a> <a name='L75'></a><a href='#L75'>75</a> <a name='L76'></a><a href='#L76'>76</a> <a name='L77'></a><a href='#L77'>77</a> <a name='L78'></a><a href='#L78'>78</a> <a name='L79'></a><a href='#L79'>79</a> <a name='L80'></a><a href='#L80'>80</a> <a name='L81'></a><a href='#L81'>81</a> <a name='L82'></a><a href='#L82'>82</a></td><td class="line-coverage quiet">1x                                           1x 15x 15x 15x 15x 15x 15x   15x 5x 5x   15x 8x 8x 8x   10x 10x 10x     15x 150x 150x 15x 159x 159x     15x 140x 140x 2086x 2086x 2086x 2086x 2086x 2086x     2086x 1807x 1807x 1675x 1675x 1807x 1676x 1676x 1807x 1x 1x 1807x 2086x 2086x 140x   10x 10x  </td><td class="text"><pre class="prettyprint lang-js">import { create2dArray } from './create2d-array.ts';   /** * Options for the {@link levenshteinDistance} function * @group String * @category Fuzzy Match */ export type LevenshteinDistanceOptions = { /** The comparison will ignore case */ caseInsensitive?: boolean; };   /** * Compute the levenshtein distance between two strings (similarity) * @param input - The string * @param comparedTo - The string to compare to * @param options - see {@link LevenshteinDistanceOptions} * @defaultValue caseInsensitive true * @returns the levenshteinDistance between the two strings (0 for no similarity through 1 for equal) * @group String * @category Fuzzy Match */ export function levenshteinDistance( input: string, comparedTo: string, { caseInsensitive = true }: LevenshteinDistanceOptions = {}, ): number { let argInput = input; let argComparedTo = comparedTo;   if (argInput.length === 0 || comparedTo.length === 0) { return Math.max(argInput.length, comparedTo.length); }   if (caseInsensitive) { argInput = argInput.toLocaleLowerCase(); argComparedTo = argComparedTo.toLocaleLowerCase(); }   const inputLen = argInput.length; const comparedToLen = argComparedTo.length; const matrix = create2dArray(inputLen, comparedToLen, 0);   //initialize for (let i = 0; i < inputLen; ++i) { matrix[i][0] = i; } for (let i = 0; i < comparedToLen; ++i) { matrix[0][i] = i; }   //analyze for (let i = 1; i < inputLen; ++i) { const si = argInput.charAt(i - 1); for (let j = 1; j < comparedToLen; ++j) { const tj = argComparedTo.charAt(j - 1); const cost = si === tj ? 0 : 1; const above = matrix[i - 1][j]; const left = matrix[i][j - 1]; const diag = matrix[i - 1][j - 1]; let cell = Math.min(Math.min(above + 1, left + 1), diag + cost);   //transposition if (i > 1 && j > 1) { let trans = matrix[i - 2][j - 2] + 1; if (argInput.charAt(i - 2) !== argComparedTo.charAt(j - 1)) { trans++; } if (argInput.charAt(i - 1) !== argComparedTo.charAt(j - 2)) { trans++; } if (cell > trans) { cell = trans; } } matrix[i][j] = cell; } }   return matrix[inputLen - 1][comparedToLen - 1]; }  </pre></td></tr></table></pre> <div class='push'></div> </div> <div class='footer quiet pad2 space-top1 center small'> Code coverage generated by <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a> at 2025-09-10T15:22:40.218Z </div> <script src="prettify.js"></script> <script> window.onload = function () { prettyPrint(); }; </script> <script src="sorter.js"></script> <script src="block-navigation.js"></script> </body> </html>