MAINHACK

Viewing / Editing File: fuzzy.js.html

<!doctype html>
<html lang="en">

<head>
 <title>Code coverage report for fuzzy.js</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> fuzzy.js</h1>
 <div class='clearfix'>
 
 <div class='fl pad1y space-right2'>
 95.24% 
 Statements
 60/63
 </div>
 
 
 <div class='fl pad1y space-right2'>
 75% 
 Branches
 24/32
 </div>
 
 
 <div class='fl pad1y space-right2'>
 100% 
 Functions
 3/3
 </div>
 
 
 <div class='fl pad1y space-right2'>
 98.31% 
 Lines
 58/59
 </div>
 
 
 </div>
 
 Press n or j to go to the next uncovered block, b, p or k for the previous block.
 
 </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>
<a name='L83'></a><a href='#L83'>83</a>
<a name='L84'></a><a href='#L84'>84</a>
<a name='L85'></a><a href='#L85'>85</a>
<a name='L86'></a><a href='#L86'>86</a>
<a name='L87'></a><a href='#L87'>87</a>
<a name='L88'></a><a href='#L88'>88</a>
<a name='L89'></a><a href='#L89'>89</a>
<a name='L90'></a><a href='#L90'>90</a>
<a name='L91'></a><a href='#L91'>91</a>
<a name='L92'></a><a href='#L92'>92</a>
<a name='L93'></a><a href='#L93'>93</a>
<a name='L94'></a><a href='#L94'>94</a>
<a name='L95'></a><a href='#L95'>95</a>
<a name='L96'></a><a href='#L96'>96</a>
<a name='L97'></a><a href='#L97'>97</a>
<a name='L98'></a><a href='#L98'>98</a>
<a name='L99'></a><a href='#L99'>99</a>
<a name='L100'></a><a href='#L100'>100</a>
<a name='L101'></a><a href='#L101'>101</a>
<a name='L102'></a><a href='#L102'>102</a>
<a name='L103'></a><a href='#L103'>103</a>
<a name='L104'></a><a href='#L104'>104</a>
<a name='L105'></a><a href='#L105'>105</a>
<a name='L106'></a><a href='#L106'>106</a>
<a name='L107'></a><a href='#L107'>107</a>
<a name='L108'></a><a href='#L108'>108</a>
<a name='L109'></a><a href='#L109'>109</a>
<a name='L110'></a><a href='#L110'>110</a>
<a name='L111'></a><a href='#L111'>111</a>
<a name='L112'></a><a href='#L112'>112</a>
<a name='L113'></a><a href='#L113'>113</a>
<a name='L114'></a><a href='#L114'>114</a>
<a name='L115'></a><a href='#L115'>115</a>
<a name='L116'></a><a href='#L116'>116</a>
<a name='L117'></a><a href='#L117'>117</a>
<a name='L118'></a><a href='#L118'>118</a>
<a name='L119'></a><a href='#L119'>119</a>
<a name='L120'></a><a href='#L120'>120</a>
<a name='L121'></a><a href='#L121'>121</a>
<a name='L122'></a><a href='#L122'>122</a>
<a name='L123'></a><a href='#L123'>123</a>
<a name='L124'></a><a href='#L124'>124</a></td><td class="line-coverage quiet">17x
&nbsp;
60x
&nbsp;
&nbsp;
60x
&nbsp;
&nbsp;
60x
&nbsp;
60x
60x
&nbsp;
&nbsp;
60x
60x
60x
&nbsp;
&nbsp;
60x
330x
&nbsp;
&nbsp;
60x
330x
&nbsp;
&nbsp;
60x
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
698x
698x
&nbsp;
698x
&nbsp;
&nbsp;
&nbsp;
698x
&nbsp;
&nbsp;
60x
60x
&nbsp;
60x
9x
&nbsp;
9x
&nbsp;
9x
2x
&nbsp;
&nbsp;
&nbsp;
&nbsp;
60x
60x
&nbsp;
&nbsp;
60x
&nbsp;
60x
&nbsp;
&nbsp;
&nbsp;
161x
161x
161x
515x
277x
&nbsp;
238x
&nbsp;
515x
&nbsp;
&nbsp;
161x
161x
161x
&nbsp;
161x
161x
161x
&nbsp;
&nbsp;
3104x
3104x
&nbsp;
1225x
&nbsp;
&nbsp;
1879x
&nbsp;
3104x
11x
&nbsp;
&nbsp;
11x
&nbsp;
11x
11x
11x
&nbsp;
9x
&nbsp;
&nbsp;
2x
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
161x
60x
&nbsp;
101x
&nbsp;
&nbsp;
60x
&nbsp;
&nbsp;</td><td class="text"><pre class="prettyprint lang-js">module.exports = function (text, pattern, options) {
 // Aproximately where in the text is the pattern expected to be found?
 var Match_Location = options.location || 0
&nbsp;
 //Determines how close the match must be to the fuzzy location (specified above). An exact letter match which is 'distance' characters away from the fuzzy location would score as a complete mismatch. A distance of '0' requires the match be at the exact location specified, a threshold of '1000' would require a perfect match to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.
 var Match_Distance = options.distance || 100
&nbsp;
 // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match (of both letters and location), a threshold of '1.0' would match anything.
 var Match_Threshold = options.threshold || 0.4
&nbsp;
 Iif (pattern === text) return true // Exact match
 Iif (pattern.length &gt; 32) return false // This algorithm cannot be used
&nbsp;
 // Set starting location at beginning text and initialise the alphabet.
 var loc = Match_Location,
 s = (function () {
 var q = {},
 i
&nbsp;
 for (i = 0; i &lt; pattern.length; i++) {
 q[pattern.charAt(i)] = 0
 }
&nbsp;
 for (i = 0; i &lt; pattern.length; i++) {
 q[pattern.charAt(i)] |= 1 &lt;&lt; (pattern.length - i - 1)
 }
&nbsp;
 return q
 })()
&nbsp;
 // Compute and return the score for a match with e errors and x location.
 // Accesses loc and pattern through being a closure.
&nbsp;
 function match_bitapScore_(e, x) {
 var accuracy = e / pattern.length,
 proximity = Math.abs(loc - x)
&nbsp;
 Iif (!Match_Distance) {
 // Dodge divide by zero error.
 return proximity ? 1.0 : accuracy
 }
 return accuracy + proximity / Match_Distance
 }
&nbsp;
 var score_threshold = Match_Threshold, // Highest score beyond which we give up.
 best_loc = text.indexOf(pattern, loc) // Is there a nearby exact match? (speedup)
&nbsp;
 if (best_loc != -1) {
 score_threshold = Math.min(match_bitapScore_(0, best_loc), score_threshold)
 // What about in the other direction? (speedup)
 best_loc = text.lastIndexOf(pattern, loc + pattern.length)
&nbsp;
 if (best_loc != -1) {
 score_threshold = Math.min(match_bitapScore_(0, best_loc), score_threshold)
 }
 }
&nbsp;
 // Initialise the bit arrays.
 var matchmask = 1 &lt;&lt; (pattern.length - 1)
 best_loc = -1
&nbsp;
 var bin_min, bin_mid
 var bin_max = pattern.length + text.length
 var last_rd
 for (var d = 0; d &lt; pattern.length; d++) {
 // Scan for the best match; each iteration allows for one more error.
 // Run a binary search to determine how far from 'loc' we can stray at this
 // error level.
 bin_min = 0
 bin_mid = bin_max
 while (bin_min &lt; bin_mid) {
 if (match_bitapScore_(d, loc + bin_mid) &lt;= score_threshold) {
 bin_min = bin_mid
 } else {
 bin_max = bin_mid
 }
 bin_mid = Math.floor((bin_max - bin_min) / 2 + bin_min)
 }
 // Use the result from this iteration as the maximum for the next.
 bin_max = bin_mid
 var start = Math.max(1, loc - bin_mid + 1)
 var finish = Math.min(loc + bin_mid, text.length) + pattern.length
&nbsp;
 var rd = Array(finish + 2)
 rd[finish + 1] = (1 &lt;&lt; d) - 1
 for (var j = finish; j &gt;= start; j--) {
 // The alphabet (s) is a sparse hash, so the following line generates
 // warnings.
 var charMatch = s[text.charAt(j - 1)]
 if (d === 0) {
 // First pass: exact match.
 rd[j] = ((rd[j + 1] &lt;&lt; 1) | 1) &amp; charMatch
 } else {
 // Subsequent passes: fuzzy match.
 rd[j] = (((rd[j + 1] &lt;&lt; 1) | 1) &amp; charMatch) | (((last_rd[j + 1] | last_rd[j]) &lt;&lt; 1) | 1) | last_rd[j + 1]
 }
 if (rd[j] &amp; matchmask) {
 var score = match_bitapScore_(d, j - 1)
 // This match will almost certainly be better than any existing match.
 // But check anyway.
 Eif (score &lt;= score_threshold) {
 // Told you so.
 score_threshold = score
 best_loc = j - 1
 if (best_loc &gt; loc) {
 // When passing loc, don't exceed our current distance from loc.
 start = Math.max(1, 2 * loc - best_loc)
 } else {
 // Already passed loc, downhill from here on in.
 break
 }
 }
 }
 }
 // No hope for a (better) match at greater error levels.
 if (match_bitapScore_(d + 1, loc) &gt; score_threshold) {
 break
 }
 last_rd = rd
 }
&nbsp;
 return best_loc &lt; 0 ? false : true
}
&nbsp;</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">istanbul</a>
 at Sat Nov 21 2020 22:27:40 GMT+0100 (Central European Standard Time)
 </div>
 </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>

Cancel / Back

[ MAINHACK ]

Viewing / Editing File: fuzzy.js.html

Server Info

System Features

User Info