| <!DOCTYPE html> |
| <html lang="en"> |
| <head> |
| <meta charset="utf-8"> |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"> |
| <meta name="generator" content="rustdoc"> |
| <meta name="description" content="Source to the Rust file `/home/fmp/.cargo/registry/src/github.com-1ecc6299db9ec823/regex-0.1.80/src/literals.rs`."> |
| <meta name="keywords" content="rust, rustlang, rust-lang"> |
| |
| <title>literals.rs.html -- source</title> |
| |
| <link rel="stylesheet" type="text/css" href="../../normalize.css"> |
| <link rel="stylesheet" type="text/css" href="../../rustdoc.css"> |
| <link rel="stylesheet" type="text/css" href="../../main.css"> |
| |
| |
| <link rel="shortcut icon" href="https://www.rust-lang.org/favicon.ico"> |
| |
| </head> |
| <body class="rustdoc source"> |
| <!--[if lte IE 8]> |
| <div class="warning"> |
| This old browser is unsupported and will most likely display funky |
| things. |
| </div> |
| <![endif]--> |
| |
| |
| |
| <nav class="sidebar"> |
| <a href='../../regex/index.html'><img src='https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png' alt='logo' width='100'></a> |
| |
| </nav> |
| |
| <nav class="sub"> |
| <form class="search-form js-only"> |
| <div class="search-container"> |
| <input class="search-input" name="search" |
| autocomplete="off" |
| placeholder="Click or press ‘S’ to search, ‘?’ for more options…" |
| type="search"> |
| </div> |
| </form> |
| </nav> |
| |
| <section id='main' class="content"><pre class="line-numbers"><span id="1"> 1</span> |
| <span id="2"> 2</span> |
| <span id="3"> 3</span> |
| <span id="4"> 4</span> |
| <span id="5"> 5</span> |
| <span id="6"> 6</span> |
| <span id="7"> 7</span> |
| <span id="8"> 8</span> |
| <span id="9"> 9</span> |
| <span id="10"> 10</span> |
| <span id="11"> 11</span> |
| <span id="12"> 12</span> |
| <span id="13"> 13</span> |
| <span id="14"> 14</span> |
| <span id="15"> 15</span> |
| <span id="16"> 16</span> |
| <span id="17"> 17</span> |
| <span id="18"> 18</span> |
| <span id="19"> 19</span> |
| <span id="20"> 20</span> |
| <span id="21"> 21</span> |
| <span id="22"> 22</span> |
| <span id="23"> 23</span> |
| <span id="24"> 24</span> |
| <span id="25"> 25</span> |
| <span id="26"> 26</span> |
| <span id="27"> 27</span> |
| <span id="28"> 28</span> |
| <span id="29"> 29</span> |
| <span id="30"> 30</span> |
| <span id="31"> 31</span> |
| <span id="32"> 32</span> |
| <span id="33"> 33</span> |
| <span id="34"> 34</span> |
| <span id="35"> 35</span> |
| <span id="36"> 36</span> |
| <span id="37"> 37</span> |
| <span id="38"> 38</span> |
| <span id="39"> 39</span> |
| <span id="40"> 40</span> |
| <span id="41"> 41</span> |
| <span id="42"> 42</span> |
| <span id="43"> 43</span> |
| <span id="44"> 44</span> |
| <span id="45"> 45</span> |
| <span id="46"> 46</span> |
| <span id="47"> 47</span> |
| <span id="48"> 48</span> |
| <span id="49"> 49</span> |
| <span id="50"> 50</span> |
| <span id="51"> 51</span> |
| <span id="52"> 52</span> |
| <span id="53"> 53</span> |
| <span id="54"> 54</span> |
| <span id="55"> 55</span> |
| <span id="56"> 56</span> |
| <span id="57"> 57</span> |
| <span id="58"> 58</span> |
| <span id="59"> 59</span> |
| <span id="60"> 60</span> |
| <span id="61"> 61</span> |
| <span id="62"> 62</span> |
| <span id="63"> 63</span> |
| <span id="64"> 64</span> |
| <span id="65"> 65</span> |
| <span id="66"> 66</span> |
| <span id="67"> 67</span> |
| <span id="68"> 68</span> |
| <span id="69"> 69</span> |
| <span id="70"> 70</span> |
| <span id="71"> 71</span> |
| <span id="72"> 72</span> |
| <span id="73"> 73</span> |
| <span id="74"> 74</span> |
| <span id="75"> 75</span> |
| <span id="76"> 76</span> |
| <span id="77"> 77</span> |
| <span id="78"> 78</span> |
| <span id="79"> 79</span> |
| <span id="80"> 80</span> |
| <span id="81"> 81</span> |
| <span id="82"> 82</span> |
| <span id="83"> 83</span> |
| <span id="84"> 84</span> |
| <span id="85"> 85</span> |
| <span id="86"> 86</span> |
| <span id="87"> 87</span> |
| <span id="88"> 88</span> |
| <span id="89"> 89</span> |
| <span id="90"> 90</span> |
| <span id="91"> 91</span> |
| <span id="92"> 92</span> |
| <span id="93"> 93</span> |
| <span id="94"> 94</span> |
| <span id="95"> 95</span> |
| <span id="96"> 96</span> |
| <span id="97"> 97</span> |
| <span id="98"> 98</span> |
| <span id="99"> 99</span> |
| <span id="100">100</span> |
| <span id="101">101</span> |
| <span id="102">102</span> |
| <span id="103">103</span> |
| <span id="104">104</span> |
| <span id="105">105</span> |
| <span id="106">106</span> |
| <span id="107">107</span> |
| <span id="108">108</span> |
| <span id="109">109</span> |
| <span id="110">110</span> |
| <span id="111">111</span> |
| <span id="112">112</span> |
| <span id="113">113</span> |
| <span id="114">114</span> |
| <span id="115">115</span> |
| <span id="116">116</span> |
| <span id="117">117</span> |
| <span id="118">118</span> |
| <span id="119">119</span> |
| <span id="120">120</span> |
| <span id="121">121</span> |
| <span id="122">122</span> |
| <span id="123">123</span> |
| <span id="124">124</span> |
| <span id="125">125</span> |
| <span id="126">126</span> |
| <span id="127">127</span> |
| <span id="128">128</span> |
| <span id="129">129</span> |
| <span id="130">130</span> |
| <span id="131">131</span> |
| <span id="132">132</span> |
| <span id="133">133</span> |
| <span id="134">134</span> |
| <span id="135">135</span> |
| <span id="136">136</span> |
| <span id="137">137</span> |
| <span id="138">138</span> |
| <span id="139">139</span> |
| <span id="140">140</span> |
| <span id="141">141</span> |
| <span id="142">142</span> |
| <span id="143">143</span> |
| <span id="144">144</span> |
| <span id="145">145</span> |
| <span id="146">146</span> |
| <span id="147">147</span> |
| <span id="148">148</span> |
| <span id="149">149</span> |
| <span id="150">150</span> |
| <span id="151">151</span> |
| <span id="152">152</span> |
| <span id="153">153</span> |
| <span id="154">154</span> |
| <span id="155">155</span> |
| <span id="156">156</span> |
| <span id="157">157</span> |
| <span id="158">158</span> |
| <span id="159">159</span> |
| <span id="160">160</span> |
| <span id="161">161</span> |
| <span id="162">162</span> |
| <span id="163">163</span> |
| <span id="164">164</span> |
| <span id="165">165</span> |
| <span id="166">166</span> |
| <span id="167">167</span> |
| <span id="168">168</span> |
| <span id="169">169</span> |
| <span id="170">170</span> |
| <span id="171">171</span> |
| <span id="172">172</span> |
| <span id="173">173</span> |
| <span id="174">174</span> |
| <span id="175">175</span> |
| <span id="176">176</span> |
| <span id="177">177</span> |
| <span id="178">178</span> |
| <span id="179">179</span> |
| <span id="180">180</span> |
| <span id="181">181</span> |
| <span id="182">182</span> |
| <span id="183">183</span> |
| <span id="184">184</span> |
| <span id="185">185</span> |
| <span id="186">186</span> |
| <span id="187">187</span> |
| <span id="188">188</span> |
| <span id="189">189</span> |
| <span id="190">190</span> |
| <span id="191">191</span> |
| <span id="192">192</span> |
| <span id="193">193</span> |
| <span id="194">194</span> |
| <span id="195">195</span> |
| <span id="196">196</span> |
| <span id="197">197</span> |
| <span id="198">198</span> |
| <span id="199">199</span> |
| <span id="200">200</span> |
| <span id="201">201</span> |
| <span id="202">202</span> |
| <span id="203">203</span> |
| <span id="204">204</span> |
| <span id="205">205</span> |
| <span id="206">206</span> |
| <span id="207">207</span> |
| <span id="208">208</span> |
| <span id="209">209</span> |
| <span id="210">210</span> |
| <span id="211">211</span> |
| <span id="212">212</span> |
| <span id="213">213</span> |
| <span id="214">214</span> |
| <span id="215">215</span> |
| <span id="216">216</span> |
| <span id="217">217</span> |
| <span id="218">218</span> |
| <span id="219">219</span> |
| <span id="220">220</span> |
| <span id="221">221</span> |
| <span id="222">222</span> |
| <span id="223">223</span> |
| <span id="224">224</span> |
| <span id="225">225</span> |
| <span id="226">226</span> |
| <span id="227">227</span> |
| <span id="228">228</span> |
| <span id="229">229</span> |
| <span id="230">230</span> |
| <span id="231">231</span> |
| <span id="232">232</span> |
| <span id="233">233</span> |
| <span id="234">234</span> |
| <span id="235">235</span> |
| <span id="236">236</span> |
| <span id="237">237</span> |
| <span id="238">238</span> |
| <span id="239">239</span> |
| <span id="240">240</span> |
| <span id="241">241</span> |
| <span id="242">242</span> |
| <span id="243">243</span> |
| <span id="244">244</span> |
| <span id="245">245</span> |
| <span id="246">246</span> |
| <span id="247">247</span> |
| <span id="248">248</span> |
| <span id="249">249</span> |
| <span id="250">250</span> |
| <span id="251">251</span> |
| <span id="252">252</span> |
| <span id="253">253</span> |
| <span id="254">254</span> |
| <span id="255">255</span> |
| <span id="256">256</span> |
| <span id="257">257</span> |
| <span id="258">258</span> |
| <span id="259">259</span> |
| <span id="260">260</span> |
| <span id="261">261</span> |
| <span id="262">262</span> |
| <span id="263">263</span> |
| <span id="264">264</span> |
| <span id="265">265</span> |
| <span id="266">266</span> |
| <span id="267">267</span> |
| <span id="268">268</span> |
| <span id="269">269</span> |
| <span id="270">270</span> |
| <span id="271">271</span> |
| <span id="272">272</span> |
| <span id="273">273</span> |
| <span id="274">274</span> |
| <span id="275">275</span> |
| <span id="276">276</span> |
| <span id="277">277</span> |
| <span id="278">278</span> |
| <span id="279">279</span> |
| <span id="280">280</span> |
| <span id="281">281</span> |
| <span id="282">282</span> |
| <span id="283">283</span> |
| <span id="284">284</span> |
| <span id="285">285</span> |
| <span id="286">286</span> |
| <span id="287">287</span> |
| <span id="288">288</span> |
| <span id="289">289</span> |
| <span id="290">290</span> |
| <span id="291">291</span> |
| <span id="292">292</span> |
| <span id="293">293</span> |
| <span id="294">294</span> |
| <span id="295">295</span> |
| <span id="296">296</span> |
| <span id="297">297</span> |
| <span id="298">298</span> |
| <span id="299">299</span> |
| <span id="300">300</span> |
| <span id="301">301</span> |
| <span id="302">302</span> |
| <span id="303">303</span> |
| <span id="304">304</span> |
| <span id="305">305</span> |
| <span id="306">306</span> |
| <span id="307">307</span> |
| <span id="308">308</span> |
| <span id="309">309</span> |
| <span id="310">310</span> |
| <span id="311">311</span> |
| <span id="312">312</span> |
| <span id="313">313</span> |
| <span id="314">314</span> |
| <span id="315">315</span> |
| <span id="316">316</span> |
| <span id="317">317</span> |
| <span id="318">318</span> |
| <span id="319">319</span> |
| <span id="320">320</span> |
| <span id="321">321</span> |
| <span id="322">322</span> |
| <span id="323">323</span> |
| <span id="324">324</span> |
| <span id="325">325</span> |
| <span id="326">326</span> |
| <span id="327">327</span> |
| <span id="328">328</span> |
| <span id="329">329</span> |
| <span id="330">330</span> |
| <span id="331">331</span> |
| <span id="332">332</span> |
| <span id="333">333</span> |
| <span id="334">334</span> |
| <span id="335">335</span> |
| <span id="336">336</span> |
| <span id="337">337</span> |
| <span id="338">338</span> |
| <span id="339">339</span> |
| <span id="340">340</span> |
| <span id="341">341</span> |
| <span id="342">342</span> |
| <span id="343">343</span> |
| <span id="344">344</span> |
| <span id="345">345</span> |
| <span id="346">346</span> |
| <span id="347">347</span> |
| <span id="348">348</span> |
| <span id="349">349</span> |
| <span id="350">350</span> |
| <span id="351">351</span> |
| <span id="352">352</span> |
| <span id="353">353</span> |
| <span id="354">354</span> |
| <span id="355">355</span> |
| <span id="356">356</span> |
| <span id="357">357</span> |
| <span id="358">358</span> |
| <span id="359">359</span> |
| <span id="360">360</span> |
| <span id="361">361</span> |
| <span id="362">362</span> |
| <span id="363">363</span> |
| <span id="364">364</span> |
| <span id="365">365</span> |
| <span id="366">366</span> |
| <span id="367">367</span> |
| <span id="368">368</span> |
| <span id="369">369</span> |
| <span id="370">370</span> |
| <span id="371">371</span> |
| <span id="372">372</span> |
| <span id="373">373</span> |
| <span id="374">374</span> |
| <span id="375">375</span> |
| <span id="376">376</span> |
| <span id="377">377</span> |
| <span id="378">378</span> |
| <span id="379">379</span> |
| <span id="380">380</span> |
| <span id="381">381</span> |
| <span id="382">382</span> |
| <span id="383">383</span> |
| <span id="384">384</span> |
| <span id="385">385</span> |
| <span id="386">386</span> |
| <span id="387">387</span> |
| <span id="388">388</span> |
| <span id="389">389</span> |
| <span id="390">390</span> |
| <span id="391">391</span> |
| <span id="392">392</span> |
| <span id="393">393</span> |
| <span id="394">394</span> |
| <span id="395">395</span> |
| <span id="396">396</span> |
| <span id="397">397</span> |
| <span id="398">398</span> |
| <span id="399">399</span> |
| <span id="400">400</span> |
| <span id="401">401</span> |
| <span id="402">402</span> |
| <span id="403">403</span> |
| <span id="404">404</span> |
| <span id="405">405</span> |
| <span id="406">406</span> |
| <span id="407">407</span> |
| <span id="408">408</span> |
| <span id="409">409</span> |
| <span id="410">410</span> |
| <span id="411">411</span> |
| <span id="412">412</span> |
| <span id="413">413</span> |
| <span id="414">414</span> |
| <span id="415">415</span> |
| <span id="416">416</span> |
| <span id="417">417</span> |
| <span id="418">418</span> |
| <span id="419">419</span> |
| <span id="420">420</span> |
| <span id="421">421</span> |
| <span id="422">422</span> |
| <span id="423">423</span> |
| <span id="424">424</span> |
| <span id="425">425</span> |
| <span id="426">426</span> |
| <span id="427">427</span> |
| <span id="428">428</span> |
| <span id="429">429</span> |
| <span id="430">430</span> |
| <span id="431">431</span> |
| <span id="432">432</span> |
| <span id="433">433</span> |
| <span id="434">434</span> |
| <span id="435">435</span> |
| <span id="436">436</span> |
| <span id="437">437</span> |
| <span id="438">438</span> |
| <span id="439">439</span> |
| <span id="440">440</span> |
| <span id="441">441</span> |
| <span id="442">442</span> |
| <span id="443">443</span> |
| <span id="444">444</span> |
| <span id="445">445</span> |
| <span id="446">446</span> |
| <span id="447">447</span> |
| <span id="448">448</span> |
| <span id="449">449</span> |
| <span id="450">450</span> |
| <span id="451">451</span> |
| <span id="452">452</span> |
| <span id="453">453</span> |
| <span id="454">454</span> |
| <span id="455">455</span> |
| <span id="456">456</span> |
| <span id="457">457</span> |
| <span id="458">458</span> |
| <span id="459">459</span> |
| <span id="460">460</span> |
| <span id="461">461</span> |
| <span id="462">462</span> |
| <span id="463">463</span> |
| <span id="464">464</span> |
| <span id="465">465</span> |
| <span id="466">466</span> |
| <span id="467">467</span> |
| <span id="468">468</span> |
| <span id="469">469</span> |
| <span id="470">470</span> |
| <span id="471">471</span> |
| <span id="472">472</span> |
| <span id="473">473</span> |
| <span id="474">474</span> |
| <span id="475">475</span> |
| <span id="476">476</span> |
| <span id="477">477</span> |
| <span id="478">478</span> |
| <span id="479">479</span> |
| <span id="480">480</span> |
| <span id="481">481</span> |
| <span id="482">482</span> |
| <span id="483">483</span> |
| <span id="484">484</span> |
| <span id="485">485</span> |
| <span id="486">486</span> |
| <span id="487">487</span> |
| <span id="488">488</span> |
| <span id="489">489</span> |
| <span id="490">490</span> |
| <span id="491">491</span> |
| <span id="492">492</span> |
| <span id="493">493</span> |
| <span id="494">494</span> |
| <span id="495">495</span> |
| <span id="496">496</span> |
| <span id="497">497</span> |
| <span id="498">498</span> |
| <span id="499">499</span> |
| <span id="500">500</span> |
| <span id="501">501</span> |
| <span id="502">502</span> |
| <span id="503">503</span> |
| <span id="504">504</span> |
| <span id="505">505</span> |
| <span id="506">506</span> |
| <span id="507">507</span> |
| <span id="508">508</span> |
| <span id="509">509</span> |
| <span id="510">510</span> |
| <span id="511">511</span> |
| <span id="512">512</span> |
| <span id="513">513</span> |
| <span id="514">514</span> |
| <span id="515">515</span> |
| <span id="516">516</span> |
| <span id="517">517</span> |
| <span id="518">518</span> |
| <span id="519">519</span> |
| <span id="520">520</span> |
| <span id="521">521</span> |
| </pre><pre class="rust "> |
| <span class="comment">// Copyright 2014-2015 The Rust Project Developers. See the COPYRIGHT</span> |
| <span class="comment">// file at the top-level directory of this distribution and at</span> |
| <span class="comment">// http://rust-lang.org/COPYRIGHT.</span> |
| <span class="comment">//</span> |
| <span class="comment">// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or</span> |
| <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license</span> |
| <span class="comment">// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your</span> |
| <span class="comment">// option. This file may not be copied, modified, or distributed</span> |
| <span class="comment">// except according to those terms.</span> |
| |
| <span class="kw">use</span> <span class="ident">std</span>::<span class="ident">mem</span>; |
| |
| <span class="kw">use</span> <span class="ident">aho_corasick</span>::{<span class="ident">Automaton</span>, <span class="ident">AcAutomaton</span>, <span class="ident">FullAcAutomaton</span>}; |
| <span class="kw">use</span> <span class="ident">memchr</span>::{<span class="ident">memchr</span>, <span class="ident">memchr2</span>, <span class="ident">memchr3</span>}; |
| <span class="kw">use</span> <span class="ident">syntax</span>; |
| |
| <span class="kw">use</span> <span class="ident">freqs</span>::<span class="ident">BYTE_FREQUENCIES</span>; |
| |
| <span class="kw">use</span> <span class="ident">simd_accel</span>::<span class="ident">teddy128</span>::{<span class="ident">Teddy</span>, <span class="ident">is_teddy_128_available</span>}; |
| |
| <span class="doccomment">/// A prefix extracted from a compiled regular expression.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// A regex prefix is a set of literal strings that *must* be matched at the</span> |
| <span class="doccomment">/// beginning of a regex in order for the entire regex to match.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// There are a variety of ways to efficiently scan the search text for a</span> |
| <span class="doccomment">/// prefix. Currently, there are three implemented:</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// 1. The prefix is a single byte. Just use memchr.</span> |
| <span class="doccomment">/// 2. If the prefix is a set of two or more single byte prefixes, then</span> |
| <span class="doccomment">/// a single sparse map is created. Checking if there is a match is a lookup</span> |
| <span class="doccomment">/// in this map for each byte in the search text.</span> |
| <span class="doccomment">/// 3. In all other cases, build an Aho-Corasick automaton.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// It's possible that there's room here for other substring algorithms,</span> |
| <span class="doccomment">/// such as Boyer-Moore for single-set prefixes greater than 1, or Rabin-Karp</span> |
| <span class="doccomment">/// for small sets of same-length prefixes.</span> |
| <span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Clone</span>, <span class="ident">Debug</span>)]</span> |
| <span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">LiteralSearcher</span> { |
| <span class="ident">complete</span>: <span class="ident">bool</span>, |
| <span class="ident">lcp</span>: <span class="ident">SingleSearch</span>, |
| <span class="ident">lcs</span>: <span class="ident">SingleSearch</span>, |
| <span class="ident">matcher</span>: <span class="ident">Matcher</span>, |
| } |
| |
| <span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Clone</span>, <span class="ident">Debug</span>)]</span> |
| <span class="kw">enum</span> <span class="ident">Matcher</span> { |
| <span class="doccomment">/// No literals. (Never advances through the input.)</span> |
| <span class="ident">Empty</span>, |
| <span class="doccomment">/// A set of four or more single byte literals.</span> |
| <span class="ident">Bytes</span>(<span class="ident">SingleByteSet</span>), |
| <span class="doccomment">/// A single substring. (Likely using Boyer-Moore with memchr.)</span> |
| <span class="ident">Single</span>(<span class="ident">SingleSearch</span>), |
| <span class="doccomment">/// An Aho-Corasick automaton.</span> |
| <span class="ident">AC</span>(<span class="ident">FullAcAutomaton</span><span class="op"><</span><span class="ident">syntax</span>::<span class="ident">Lit</span><span class="op">></span>), |
| <span class="doccomment">/// A simd accelerated multiple string matcher.</span> |
| <span class="ident">Teddy128</span>(<span class="ident">Teddy</span>), |
| } |
| |
| <span class="kw">impl</span> <span class="ident">LiteralSearcher</span> { |
| <span class="doccomment">/// Returns a matcher that never matches and never advances the input.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">empty</span>() <span class="op">-></span> <span class="self">Self</span> { |
| <span class="self">Self</span>::<span class="ident">new</span>(<span class="ident">syntax</span>::<span class="ident">Literals</span>::<span class="ident">empty</span>(), <span class="ident">Matcher</span>::<span class="ident">Empty</span>) |
| } |
| |
| <span class="doccomment">/// Returns a matcher for literal prefixes from the given set.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">prefixes</span>(<span class="ident">lits</span>: <span class="ident">syntax</span>::<span class="ident">Literals</span>) <span class="op">-></span> <span class="self">Self</span> { |
| <span class="kw">let</span> <span class="ident">matcher</span> <span class="op">=</span> <span class="ident">Matcher</span>::<span class="ident">prefixes</span>(<span class="kw-2">&</span><span class="ident">lits</span>); |
| <span class="self">Self</span>::<span class="ident">new</span>(<span class="ident">lits</span>, <span class="ident">matcher</span>) |
| } |
| |
| <span class="doccomment">/// Returns a matcher for literal suffixes from the given set.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">suffixes</span>(<span class="ident">lits</span>: <span class="ident">syntax</span>::<span class="ident">Literals</span>) <span class="op">-></span> <span class="self">Self</span> { |
| <span class="kw">let</span> <span class="ident">matcher</span> <span class="op">=</span> <span class="ident">Matcher</span>::<span class="ident">suffixes</span>(<span class="kw-2">&</span><span class="ident">lits</span>); |
| <span class="self">Self</span>::<span class="ident">new</span>(<span class="ident">lits</span>, <span class="ident">matcher</span>) |
| } |
| |
| <span class="kw">fn</span> <span class="ident">new</span>(<span class="ident">lits</span>: <span class="ident">syntax</span>::<span class="ident">Literals</span>, <span class="ident">matcher</span>: <span class="ident">Matcher</span>) <span class="op">-></span> <span class="self">Self</span> { |
| <span class="kw">let</span> <span class="ident">complete</span> <span class="op">=</span> <span class="ident">lits</span>.<span class="ident">all_complete</span>(); |
| <span class="ident">LiteralSearcher</span> { |
| <span class="ident">complete</span>: <span class="ident">complete</span>, |
| <span class="ident">lcp</span>: <span class="ident">SingleSearch</span>::<span class="ident">new</span>(<span class="ident">lits</span>.<span class="ident">longest_common_prefix</span>().<span class="ident">to_vec</span>()), |
| <span class="ident">lcs</span>: <span class="ident">SingleSearch</span>::<span class="ident">new</span>(<span class="ident">lits</span>.<span class="ident">longest_common_suffix</span>().<span class="ident">to_vec</span>()), |
| <span class="ident">matcher</span>: <span class="ident">matcher</span>, |
| } |
| } |
| |
| <span class="doccomment">/// Returns true if all matches comprise the entire regular expression.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// This does not necessarily mean that a literal match implies a match</span> |
| <span class="doccomment">/// of the regular expression. For example, the regular expresison `^a`</span> |
| <span class="doccomment">/// is comprised of a single complete literal `a`, but the regular</span> |
| <span class="doccomment">/// expression demands that it only match at the beginning of a string.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">complete</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">bool</span> { |
| <span class="self">self</span>.<span class="ident">complete</span> <span class="op">&&</span> <span class="self">self</span>.<span class="ident">len</span>() <span class="op">></span> <span class="number">0</span> |
| } |
| |
| <span class="doccomment">/// Find the position of a literal in `haystack` if it exists.</span> |
| <span class="attribute">#[<span class="ident">inline</span>(<span class="ident">always</span>)]</span> <span class="comment">// reduces constant overhead</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">find</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">haystack</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="ident">usize</span>, <span class="ident">usize</span>)<span class="op">></span> { |
| <span class="kw">use</span> <span class="self">self</span>::<span class="ident">Matcher</span>::<span class="kw-2">*</span>; |
| <span class="kw">match</span> <span class="self">self</span>.<span class="ident">matcher</span> { |
| <span class="ident">Empty</span> <span class="op">=></span> <span class="prelude-val">Some</span>((<span class="number">0</span>, <span class="number">0</span>)), |
| <span class="ident">Bytes</span>(<span class="kw-2">ref</span> <span class="ident">sset</span>) <span class="op">=></span> <span class="ident">sset</span>.<span class="ident">find</span>(<span class="ident">haystack</span>).<span class="ident">map</span>(<span class="op">|</span><span class="ident">i</span><span class="op">|</span> (<span class="ident">i</span>, <span class="ident">i</span> <span class="op">+</span> <span class="number">1</span>)), |
| <span class="ident">Single</span>(<span class="kw-2">ref</span> <span class="ident">s</span>) <span class="op">=></span> <span class="ident">s</span>.<span class="ident">find</span>(<span class="ident">haystack</span>).<span class="ident">map</span>(<span class="op">|</span><span class="ident">i</span><span class="op">|</span> (<span class="ident">i</span>, <span class="ident">i</span> <span class="op">+</span> <span class="ident">s</span>.<span class="ident">len</span>())), |
| <span class="ident">AC</span>(<span class="kw-2">ref</span> <span class="ident">aut</span>) <span class="op">=></span> <span class="ident">aut</span>.<span class="ident">find</span>(<span class="ident">haystack</span>).<span class="ident">next</span>().<span class="ident">map</span>(<span class="op">|</span><span class="ident">m</span><span class="op">|</span> (<span class="ident">m</span>.<span class="ident">start</span>, <span class="ident">m</span>.<span class="ident">end</span>)), |
| <span class="ident">Teddy128</span>(<span class="kw-2">ref</span> <span class="ident">ted</span>) <span class="op">=></span> <span class="ident">ted</span>.<span class="ident">find</span>(<span class="ident">haystack</span>).<span class="ident">map</span>(<span class="op">|</span><span class="ident">m</span><span class="op">|</span> (<span class="ident">m</span>.<span class="ident">start</span>, <span class="ident">m</span>.<span class="ident">end</span>)), |
| } |
| } |
| |
| <span class="doccomment">/// Like find, except matches must start at index `0`.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">find_start</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">haystack</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="ident">usize</span>, <span class="ident">usize</span>)<span class="op">></span> { |
| <span class="kw">for</span> <span class="ident">lit</span> <span class="kw">in</span> <span class="self">self</span>.<span class="ident">iter</span>() { |
| <span class="kw">if</span> <span class="ident">lit</span>.<span class="ident">len</span>() <span class="op">></span> <span class="ident">haystack</span>.<span class="ident">len</span>() { |
| <span class="kw">continue</span>; |
| } |
| <span class="kw">if</span> <span class="ident">lit</span> <span class="op">==</span> <span class="kw-2">&</span><span class="ident">haystack</span>[<span class="number">0</span>..<span class="ident">lit</span>.<span class="ident">len</span>()] { |
| <span class="kw">return</span> <span class="prelude-val">Some</span>((<span class="number">0</span>, <span class="ident">lit</span>.<span class="ident">len</span>())); |
| } |
| } |
| <span class="prelude-val">None</span> |
| } |
| |
| <span class="doccomment">/// Like find, except matches must end at index `haystack.len()`.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">find_end</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">haystack</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="ident">usize</span>, <span class="ident">usize</span>)<span class="op">></span> { |
| <span class="kw">for</span> <span class="ident">lit</span> <span class="kw">in</span> <span class="self">self</span>.<span class="ident">iter</span>() { |
| <span class="kw">if</span> <span class="ident">lit</span>.<span class="ident">len</span>() <span class="op">></span> <span class="ident">haystack</span>.<span class="ident">len</span>() { |
| <span class="kw">continue</span>; |
| } |
| <span class="kw">if</span> <span class="ident">lit</span> <span class="op">==</span> <span class="kw-2">&</span><span class="ident">haystack</span>[<span class="ident">haystack</span>.<span class="ident">len</span>() <span class="op">-</span> <span class="ident">lit</span>.<span class="ident">len</span>()..] { |
| <span class="kw">return</span> <span class="prelude-val">Some</span>((<span class="ident">haystack</span>.<span class="ident">len</span>() <span class="op">-</span> <span class="ident">lit</span>.<span class="ident">len</span>(), <span class="ident">haystack</span>.<span class="ident">len</span>())); |
| } |
| } |
| <span class="prelude-val">None</span> |
| } |
| |
| <span class="doccomment">/// Returns an iterator over all literals to be matched.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">iter</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">LiteralIter</span> { |
| <span class="kw">match</span> <span class="self">self</span>.<span class="ident">matcher</span> { |
| <span class="ident">Matcher</span>::<span class="ident">Empty</span> <span class="op">=></span> <span class="ident">LiteralIter</span>::<span class="ident">Empty</span>, |
| <span class="ident">Matcher</span>::<span class="ident">Bytes</span>(<span class="kw-2">ref</span> <span class="ident">sset</span>) <span class="op">=></span> <span class="ident">LiteralIter</span>::<span class="ident">Bytes</span>(<span class="kw-2">&</span><span class="ident">sset</span>.<span class="ident">dense</span>), |
| <span class="ident">Matcher</span>::<span class="ident">Single</span>(<span class="kw-2">ref</span> <span class="ident">s</span>) <span class="op">=></span> <span class="ident">LiteralIter</span>::<span class="ident">Single</span>(<span class="kw-2">&</span><span class="ident">s</span>.<span class="ident">pat</span>), |
| <span class="ident">Matcher</span>::<span class="ident">AC</span>(<span class="kw-2">ref</span> <span class="ident">ac</span>) <span class="op">=></span> <span class="ident">LiteralIter</span>::<span class="ident">AC</span>(<span class="ident">ac</span>.<span class="ident">patterns</span>()), |
| <span class="ident">Matcher</span>::<span class="ident">Teddy128</span>(<span class="kw-2">ref</span> <span class="ident">ted</span>) <span class="op">=></span> { |
| <span class="ident">LiteralIter</span>::<span class="ident">Teddy128</span>(<span class="ident">ted</span>.<span class="ident">patterns</span>()) |
| } |
| } |
| } |
| |
| <span class="doccomment">/// Returns a matcher for the longest common prefix of this matcher.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">lcp</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="ident">SingleSearch</span> { |
| <span class="kw-2">&</span><span class="self">self</span>.<span class="ident">lcp</span> |
| } |
| |
| <span class="doccomment">/// Returns a matcher for the longest common suffix of this matcher.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">lcs</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="ident">SingleSearch</span> { |
| <span class="kw-2">&</span><span class="self">self</span>.<span class="ident">lcs</span> |
| } |
| |
| <span class="doccomment">/// Returns true iff this prefix is empty.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">is_empty</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">bool</span> { |
| <span class="self">self</span>.<span class="ident">len</span>() <span class="op">==</span> <span class="number">0</span> |
| } |
| |
| <span class="doccomment">/// Returns the number of prefixes in this machine.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">len</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> { |
| <span class="kw">use</span> <span class="self">self</span>::<span class="ident">Matcher</span>::<span class="kw-2">*</span>; |
| <span class="kw">match</span> <span class="self">self</span>.<span class="ident">matcher</span> { |
| <span class="ident">Empty</span> <span class="op">=></span> <span class="number">0</span>, |
| <span class="ident">Bytes</span>(<span class="kw-2">ref</span> <span class="ident">sset</span>) <span class="op">=></span> <span class="ident">sset</span>.<span class="ident">dense</span>.<span class="ident">len</span>(), |
| <span class="ident">Single</span>(_) <span class="op">=></span> <span class="number">1</span>, |
| <span class="ident">AC</span>(<span class="kw-2">ref</span> <span class="ident">aut</span>) <span class="op">=></span> <span class="ident">aut</span>.<span class="ident">len</span>(), |
| <span class="ident">Teddy128</span>(<span class="kw-2">ref</span> <span class="ident">ted</span>) <span class="op">=></span> <span class="ident">ted</span>.<span class="ident">len</span>(), |
| } |
| } |
| |
| <span class="doccomment">/// Return the approximate heap usage of literals in bytes.</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">approximate_size</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> { |
| <span class="kw">use</span> <span class="self">self</span>::<span class="ident">Matcher</span>::<span class="kw-2">*</span>; |
| <span class="kw">match</span> <span class="self">self</span>.<span class="ident">matcher</span> { |
| <span class="ident">Empty</span> <span class="op">=></span> <span class="number">0</span>, |
| <span class="ident">Bytes</span>(<span class="kw-2">ref</span> <span class="ident">sset</span>) <span class="op">=></span> <span class="ident">sset</span>.<span class="ident">approximate_size</span>(), |
| <span class="ident">Single</span>(<span class="kw-2">ref</span> <span class="ident">single</span>) <span class="op">=></span> <span class="ident">single</span>.<span class="ident">approximate_size</span>(), |
| <span class="ident">AC</span>(<span class="kw-2">ref</span> <span class="ident">aut</span>) <span class="op">=></span> <span class="ident">aut</span>.<span class="ident">heap_bytes</span>(), |
| <span class="ident">Teddy128</span>(<span class="kw-2">ref</span> <span class="ident">ted</span>) <span class="op">=></span> <span class="ident">ted</span>.<span class="ident">approximate_size</span>(), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span> <span class="ident">Matcher</span> { |
| <span class="kw">fn</span> <span class="ident">prefixes</span>(<span class="ident">lits</span>: <span class="kw-2">&</span><span class="ident">syntax</span>::<span class="ident">Literals</span>) <span class="op">-></span> <span class="self">Self</span> { |
| <span class="kw">let</span> <span class="ident">sset</span> <span class="op">=</span> <span class="ident">SingleByteSet</span>::<span class="ident">prefixes</span>(<span class="kw-2">&</span><span class="ident">lits</span>); |
| <span class="ident">Matcher</span>::<span class="ident">new</span>(<span class="ident">lits</span>, <span class="ident">sset</span>) |
| } |
| |
| <span class="kw">fn</span> <span class="ident">suffixes</span>(<span class="ident">lits</span>: <span class="kw-2">&</span><span class="ident">syntax</span>::<span class="ident">Literals</span>) <span class="op">-></span> <span class="self">Self</span> { |
| <span class="kw">let</span> <span class="ident">sset</span> <span class="op">=</span> <span class="ident">SingleByteSet</span>::<span class="ident">suffixes</span>(<span class="kw-2">&</span><span class="ident">lits</span>); |
| <span class="ident">Matcher</span>::<span class="ident">new</span>(<span class="ident">lits</span>, <span class="ident">sset</span>) |
| } |
| |
| <span class="kw">fn</span> <span class="ident">new</span>(<span class="ident">lits</span>: <span class="kw-2">&</span><span class="ident">syntax</span>::<span class="ident">Literals</span>, <span class="ident">sset</span>: <span class="ident">SingleByteSet</span>) <span class="op">-></span> <span class="self">Self</span> { |
| <span class="kw">if</span> <span class="ident">lits</span>.<span class="ident">literals</span>().<span class="ident">is_empty</span>() { |
| <span class="kw">return</span> <span class="ident">Matcher</span>::<span class="ident">Empty</span>; |
| } |
| <span class="kw">if</span> <span class="ident">sset</span>.<span class="ident">dense</span>.<span class="ident">len</span>() <span class="op">>=</span> <span class="number">26</span> { |
| <span class="comment">// Avoid trying to match a large number of single bytes.</span> |
| <span class="comment">// This is *very* sensitive to a frequency analysis comparison</span> |
| <span class="comment">// between the bytes in sset and the composition of the haystack.</span> |
| <span class="comment">// No matter the size of sset, if its members all are rare in the</span> |
| <span class="comment">// haystack, then it'd be worth using it. How to tune this... IDK.</span> |
| <span class="comment">// ---AG</span> |
| <span class="kw">return</span> <span class="ident">Matcher</span>::<span class="ident">Empty</span>; |
| } |
| <span class="kw">if</span> <span class="ident">sset</span>.<span class="ident">complete</span> { |
| <span class="kw">return</span> <span class="ident">Matcher</span>::<span class="ident">Bytes</span>(<span class="ident">sset</span>); |
| } |
| <span class="kw">if</span> <span class="ident">lits</span>.<span class="ident">literals</span>().<span class="ident">len</span>() <span class="op">==</span> <span class="number">1</span> { |
| <span class="kw">let</span> <span class="ident">lit</span> <span class="op">=</span> <span class="ident">lits</span>.<span class="ident">literals</span>()[<span class="number">0</span>].<span class="ident">to_vec</span>(); |
| <span class="kw">return</span> <span class="ident">Matcher</span>::<span class="ident">Single</span>(<span class="ident">SingleSearch</span>::<span class="ident">new</span>(<span class="ident">lit</span>)); |
| } |
| <span class="kw">let</span> <span class="ident">is_aho_corasick_fast</span> <span class="op">=</span> <span class="ident">sset</span>.<span class="ident">dense</span>.<span class="ident">len</span>() <span class="op">==</span> <span class="number">1</span> <span class="op">&&</span> <span class="ident">sset</span>.<span class="ident">all_ascii</span>; |
| <span class="kw">if</span> <span class="ident">is_teddy_128_available</span>() <span class="op">&&</span> <span class="op">!</span><span class="ident">is_aho_corasick_fast</span> { |
| <span class="comment">// Only try Teddy if Aho-Corasick can't use memchr on an ASCII</span> |
| <span class="comment">// byte. Also, in its current form, Teddy doesn't scale well to</span> |
| <span class="comment">// lots of literals.</span> |
| <span class="comment">//</span> |
| <span class="comment">// We impose the ASCII restriction since an alternation of</span> |
| <span class="comment">// non-ASCII string literals in the same language is likely to all</span> |
| <span class="comment">// start with the same byte. Even worse, the corpus being searched</span> |
| <span class="comment">// probably has a similar composition, which ends up completely</span> |
| <span class="comment">// negating the benefit of memchr.</span> |
| <span class="kw">const</span> <span class="ident">MAX_TEDDY_LITERALS</span>: <span class="ident">usize</span> <span class="op">=</span> <span class="number">32</span>; |
| <span class="kw">if</span> <span class="ident">lits</span>.<span class="ident">literals</span>().<span class="ident">len</span>() <span class="op"><=</span> <span class="ident">MAX_TEDDY_LITERALS</span> { |
| <span class="kw">if</span> <span class="kw">let</span> <span class="prelude-val">Some</span>(<span class="ident">ted</span>) <span class="op">=</span> <span class="ident">Teddy</span>::<span class="ident">new</span>(<span class="ident">lits</span>) { |
| <span class="kw">return</span> <span class="ident">Matcher</span>::<span class="ident">Teddy128</span>(<span class="ident">ted</span>); |
| } |
| } |
| <span class="comment">// Fallthrough to ol' reliable Aho-Corasick...</span> |
| } |
| <span class="kw">let</span> <span class="ident">pats</span> <span class="op">=</span> <span class="ident">lits</span>.<span class="ident">literals</span>().<span class="ident">to_owned</span>(); |
| <span class="ident">Matcher</span>::<span class="ident">AC</span>(<span class="ident">AcAutomaton</span>::<span class="ident">new</span>(<span class="ident">pats</span>).<span class="ident">into_full</span>()) |
| } |
| } |
| |
| <span class="kw">pub</span> <span class="kw">enum</span> <span class="ident">LiteralIter</span><span class="op"><</span><span class="lifetime">'a</span><span class="op">></span> { |
| <span class="ident">Empty</span>, |
| <span class="ident">Bytes</span>(<span class="kw-2">&</span><span class="lifetime">'a</span> [<span class="ident">u8</span>]), |
| <span class="ident">Single</span>(<span class="kw-2">&</span><span class="lifetime">'a</span> [<span class="ident">u8</span>]), |
| <span class="ident">AC</span>(<span class="kw-2">&</span><span class="lifetime">'a</span> [<span class="ident">syntax</span>::<span class="ident">Lit</span>]), |
| <span class="ident">Teddy128</span>(<span class="kw-2">&</span><span class="lifetime">'a</span> [<span class="ident">Vec</span><span class="op"><</span><span class="ident">u8</span><span class="op">></span>]), |
| } |
| |
| <span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span><span class="op">></span> <span class="ident">Iterator</span> <span class="kw">for</span> <span class="ident">LiteralIter</span><span class="op"><</span><span class="lifetime">'a</span><span class="op">></span> { |
| <span class="kw">type</span> <span class="ident">Item</span> <span class="op">=</span> <span class="kw-2">&</span><span class="lifetime">'a</span> [<span class="ident">u8</span>]; |
| |
| <span class="kw">fn</span> <span class="ident">next</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="self">Self</span>::<span class="ident">Item</span><span class="op">></span> { |
| <span class="kw">match</span> <span class="kw-2">*</span><span class="self">self</span> { |
| <span class="ident">LiteralIter</span>::<span class="ident">Empty</span> <span class="op">=></span> <span class="prelude-val">None</span>, |
| <span class="ident">LiteralIter</span>::<span class="ident">Bytes</span>(<span class="kw-2">ref</span> <span class="kw-2">mut</span> <span class="ident">many</span>) <span class="op">=></span> { |
| <span class="kw">if</span> <span class="ident">many</span>.<span class="ident">is_empty</span>() { |
| <span class="prelude-val">None</span> |
| } <span class="kw">else</span> { |
| <span class="kw">let</span> <span class="ident">next</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">many</span>[<span class="number">0</span>..<span class="number">1</span>]; |
| <span class="kw-2">*</span><span class="ident">many</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">many</span>[<span class="number">1</span>..]; |
| <span class="prelude-val">Some</span>(<span class="ident">next</span>) |
| } |
| } |
| <span class="ident">LiteralIter</span>::<span class="ident">Single</span>(<span class="kw-2">ref</span> <span class="kw-2">mut</span> <span class="ident">one</span>) <span class="op">=></span> { |
| <span class="kw">if</span> <span class="ident">one</span>.<span class="ident">is_empty</span>() { |
| <span class="prelude-val">None</span> |
| } <span class="kw">else</span> { |
| <span class="kw">let</span> <span class="ident">next</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">one</span>[..]; |
| <span class="kw-2">*</span><span class="ident">one</span> <span class="op">=</span> <span class="kw-2">&</span>[]; |
| <span class="prelude-val">Some</span>(<span class="ident">next</span>) |
| } |
| } |
| <span class="ident">LiteralIter</span>::<span class="ident">AC</span>(<span class="kw-2">ref</span> <span class="kw-2">mut</span> <span class="ident">lits</span>) <span class="op">=></span> { |
| <span class="kw">if</span> <span class="ident">lits</span>.<span class="ident">is_empty</span>() { |
| <span class="prelude-val">None</span> |
| } <span class="kw">else</span> { |
| <span class="kw">let</span> <span class="ident">next</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">lits</span>[<span class="number">0</span>]; |
| <span class="kw-2">*</span><span class="ident">lits</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">lits</span>[<span class="number">1</span>..]; |
| <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="kw-2">*</span><span class="kw-2">*</span><span class="ident">next</span>) |
| } |
| } |
| <span class="ident">LiteralIter</span>::<span class="ident">Teddy128</span>(<span class="kw-2">ref</span> <span class="kw-2">mut</span> <span class="ident">lits</span>) <span class="op">=></span> { |
| <span class="kw">if</span> <span class="ident">lits</span>.<span class="ident">is_empty</span>() { |
| <span class="prelude-val">None</span> |
| } <span class="kw">else</span> { |
| <span class="kw">let</span> <span class="ident">next</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">lits</span>[<span class="number">0</span>]; |
| <span class="kw-2">*</span><span class="ident">lits</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">lits</span>[<span class="number">1</span>..]; |
| <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="kw-2">*</span><span class="kw-2">*</span><span class="ident">next</span>) |
| } |
| } |
| } |
| } |
| } |
| |
| <span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Clone</span>, <span class="ident">Debug</span>)]</span> |
| <span class="kw">struct</span> <span class="ident">SingleByteSet</span> { |
| <span class="ident">sparse</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">bool</span><span class="op">></span>, |
| <span class="ident">dense</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">u8</span><span class="op">></span>, |
| <span class="ident">complete</span>: <span class="ident">bool</span>, |
| <span class="ident">all_ascii</span>: <span class="ident">bool</span>, |
| } |
| |
| <span class="kw">impl</span> <span class="ident">SingleByteSet</span> { |
| <span class="kw">fn</span> <span class="ident">new</span>() <span class="op">-></span> <span class="ident">SingleByteSet</span> { |
| <span class="ident">SingleByteSet</span> { |
| <span class="ident">sparse</span>: <span class="macro">vec</span><span class="macro">!</span>[<span class="bool-val">false</span>; <span class="number">256</span>], |
| <span class="ident">dense</span>: <span class="macro">vec</span><span class="macro">!</span>[], |
| <span class="ident">complete</span>: <span class="bool-val">true</span>, |
| <span class="ident">all_ascii</span>: <span class="bool-val">true</span>, |
| } |
| } |
| |
| <span class="kw">fn</span> <span class="ident">prefixes</span>(<span class="ident">lits</span>: <span class="kw-2">&</span><span class="ident">syntax</span>::<span class="ident">Literals</span>) <span class="op">-></span> <span class="ident">SingleByteSet</span> { |
| <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">sset</span> <span class="op">=</span> <span class="ident">SingleByteSet</span>::<span class="ident">new</span>(); |
| <span class="kw">for</span> <span class="ident">lit</span> <span class="kw">in</span> <span class="ident">lits</span>.<span class="ident">literals</span>() { |
| <span class="ident">sset</span>.<span class="ident">complete</span> <span class="op">=</span> <span class="ident">sset</span>.<span class="ident">complete</span> <span class="op">&&</span> <span class="ident">lit</span>.<span class="ident">len</span>() <span class="op">==</span> <span class="number">1</span>; |
| <span class="kw">if</span> <span class="kw">let</span> <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="ident">b</span>) <span class="op">=</span> <span class="ident">lit</span>.<span class="ident">get</span>(<span class="number">0</span>) { |
| <span class="kw">if</span> <span class="op">!</span><span class="ident">sset</span>.<span class="ident">sparse</span>[<span class="ident">b</span> <span class="kw">as</span> <span class="ident">usize</span>] { |
| <span class="kw">if</span> <span class="ident">b</span> <span class="op">></span> <span class="number">0x7F</span> { |
| <span class="ident">sset</span>.<span class="ident">all_ascii</span> <span class="op">=</span> <span class="bool-val">false</span>; |
| } |
| <span class="ident">sset</span>.<span class="ident">dense</span>.<span class="ident">push</span>(<span class="ident">b</span>); |
| <span class="ident">sset</span>.<span class="ident">sparse</span>[<span class="ident">b</span> <span class="kw">as</span> <span class="ident">usize</span>] <span class="op">=</span> <span class="bool-val">true</span>; |
| } |
| } |
| } |
| <span class="ident">sset</span> |
| } |
| |
| <span class="kw">fn</span> <span class="ident">suffixes</span>(<span class="ident">lits</span>: <span class="kw-2">&</span><span class="ident">syntax</span>::<span class="ident">Literals</span>) <span class="op">-></span> <span class="ident">SingleByteSet</span> { |
| <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">sset</span> <span class="op">=</span> <span class="ident">SingleByteSet</span>::<span class="ident">new</span>(); |
| <span class="kw">for</span> <span class="ident">lit</span> <span class="kw">in</span> <span class="ident">lits</span>.<span class="ident">literals</span>() { |
| <span class="ident">sset</span>.<span class="ident">complete</span> <span class="op">=</span> <span class="ident">sset</span>.<span class="ident">complete</span> <span class="op">&&</span> <span class="ident">lit</span>.<span class="ident">len</span>() <span class="op">==</span> <span class="number">1</span>; |
| <span class="kw">if</span> <span class="kw">let</span> <span class="prelude-val">Some</span>(<span class="kw-2">&</span><span class="ident">b</span>) <span class="op">=</span> <span class="ident">lit</span>.<span class="ident">get</span>(<span class="ident">lit</span>.<span class="ident">len</span>().<span class="ident">checked_sub</span>(<span class="number">1</span>).<span class="ident">unwrap</span>()) { |
| <span class="kw">if</span> <span class="op">!</span><span class="ident">sset</span>.<span class="ident">sparse</span>[<span class="ident">b</span> <span class="kw">as</span> <span class="ident">usize</span>] { |
| <span class="kw">if</span> <span class="ident">b</span> <span class="op">></span> <span class="number">0x7F</span> { |
| <span class="ident">sset</span>.<span class="ident">all_ascii</span> <span class="op">=</span> <span class="bool-val">false</span>; |
| } |
| <span class="ident">sset</span>.<span class="ident">dense</span>.<span class="ident">push</span>(<span class="ident">b</span>); |
| <span class="ident">sset</span>.<span class="ident">sparse</span>[<span class="ident">b</span> <span class="kw">as</span> <span class="ident">usize</span>] <span class="op">=</span> <span class="bool-val">true</span>; |
| } |
| } |
| } |
| <span class="ident">sset</span> |
| } |
| |
| <span class="doccomment">/// Faster find that special cases certain sizes to use memchr.</span> |
| <span class="attribute">#[<span class="ident">inline</span>(<span class="ident">always</span>)]</span> <span class="comment">// reduces constant overhead</span> |
| <span class="kw">fn</span> <span class="ident">find</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">text</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span> { |
| <span class="kw">match</span> <span class="self">self</span>.<span class="ident">dense</span>.<span class="ident">len</span>() { |
| <span class="number">0</span> <span class="op">=></span> <span class="prelude-val">None</span>, |
| <span class="number">1</span> <span class="op">=></span> <span class="ident">memchr</span>(<span class="self">self</span>.<span class="ident">dense</span>[<span class="number">0</span>], <span class="ident">text</span>), |
| <span class="number">2</span> <span class="op">=></span> <span class="ident">memchr2</span>(<span class="self">self</span>.<span class="ident">dense</span>[<span class="number">0</span>], <span class="self">self</span>.<span class="ident">dense</span>[<span class="number">1</span>], <span class="ident">text</span>), |
| <span class="number">3</span> <span class="op">=></span> <span class="ident">memchr3</span>(<span class="self">self</span>.<span class="ident">dense</span>[<span class="number">0</span>], <span class="self">self</span>.<span class="ident">dense</span>[<span class="number">1</span>], <span class="self">self</span>.<span class="ident">dense</span>[<span class="number">2</span>], <span class="ident">text</span>), |
| _ <span class="op">=></span> <span class="self">self</span>.<span class="ident">_find</span>(<span class="ident">text</span>), |
| } |
| } |
| |
| <span class="doccomment">/// Generic find that works on any sized set.</span> |
| <span class="kw">fn</span> <span class="ident">_find</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">haystack</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span> { |
| <span class="kw">for</span> (<span class="ident">i</span>, <span class="kw-2">&</span><span class="ident">b</span>) <span class="kw">in</span> <span class="ident">haystack</span>.<span class="ident">iter</span>().<span class="ident">enumerate</span>() { |
| <span class="kw">if</span> <span class="self">self</span>.<span class="ident">sparse</span>[<span class="ident">b</span> <span class="kw">as</span> <span class="ident">usize</span>] { |
| <span class="kw">return</span> <span class="prelude-val">Some</span>(<span class="ident">i</span>); |
| } |
| } |
| <span class="prelude-val">None</span> |
| } |
| |
| <span class="kw">fn</span> <span class="ident">approximate_size</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> { |
| (<span class="self">self</span>.<span class="ident">dense</span>.<span class="ident">len</span>() <span class="op">*</span> <span class="ident">mem</span>::<span class="ident">size_of</span>::<span class="op"><</span><span class="ident">u8</span><span class="op">></span>()) |
| <span class="op">+</span> (<span class="self">self</span>.<span class="ident">sparse</span>.<span class="ident">len</span>() <span class="op">*</span> <span class="ident">mem</span>::<span class="ident">size_of</span>::<span class="op"><</span><span class="ident">bool</span><span class="op">></span>()) |
| } |
| } |
| |
| <span class="doccomment">/// Provides an implementation of fast subtring search.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// This particular implementation is a Boyer-Moore variant, based on the</span> |
| <span class="doccomment">/// "tuned boyer moore" search from (Hume & Sunday, 1991). It has been tweaked</span> |
| <span class="doccomment">/// slightly to better use memchr.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// memchr is so fast that we do everything we can to keep the loop in memchr</span> |
| <span class="doccomment">/// for as long as possible. The easiest way to do this is to intelligently</span> |
| <span class="doccomment">/// pick the byte to send to memchr. The best byte is the byte that occurs</span> |
| <span class="doccomment">/// least frequently in the haystack. Since doing frequency analysis on the</span> |
| <span class="doccomment">/// haystack is far too expensive, we compute a set of fixed frequencies up</span> |
| <span class="doccomment">/// front and hard code them in src/freqs.rs. Frequency analysis is done via</span> |
| <span class="doccomment">/// scripts/frequencies.py.</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// TODO(burntsushi): Add some amount of shifting to this.</span> |
| <span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Clone</span>, <span class="ident">Debug</span>)]</span> |
| <span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">SingleSearch</span> { |
| <span class="doccomment">/// The pattern.</span> |
| <span class="ident">pat</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">u8</span><span class="op">></span>, |
| <span class="doccomment">/// The number of Unicode characters in the pattern. This is useful for</span> |
| <span class="doccomment">/// determining the effective length of a pattern when deciding which</span> |
| <span class="doccomment">/// optimizations to perform. A trailing incomplete UTF-8 sequence counts</span> |
| <span class="doccomment">/// as one character.</span> |
| <span class="ident">char_len</span>: <span class="ident">usize</span>, |
| <span class="doccomment">/// The rarest byte in the pattern, according to pre-computed frequency</span> |
| <span class="doccomment">/// analysis.</span> |
| <span class="ident">rare1</span>: <span class="ident">u8</span>, |
| <span class="doccomment">/// The offset of the rarest byte in `pat`.</span> |
| <span class="ident">rare1i</span>: <span class="ident">usize</span>, |
| <span class="doccomment">/// The second rarest byte in the pattern, according to pre-computed</span> |
| <span class="doccomment">/// frequency analysis. (This may be equivalent to the rarest byte.)</span> |
| <span class="doccomment">///</span> |
| <span class="doccomment">/// The second rarest byte is used as a type of guard for quickly detecting</span> |
| <span class="doccomment">/// a mismatch after memchr locates an instance of the rarest byte. This</span> |
| <span class="doccomment">/// is a hedge against pathological cases where the pre-computed frequency</span> |
| <span class="doccomment">/// analysis may be off. (But of course, does not prevent *all*</span> |
| <span class="doccomment">/// pathological cases.)</span> |
| <span class="ident">rare2</span>: <span class="ident">u8</span>, |
| <span class="doccomment">/// The offset of the second rarest byte in `pat`.</span> |
| <span class="ident">rare2i</span>: <span class="ident">usize</span>, |
| } |
| |
| <span class="kw">impl</span> <span class="ident">SingleSearch</span> { |
| <span class="kw">fn</span> <span class="ident">new</span>(<span class="ident">pat</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">u8</span><span class="op">></span>) <span class="op">-></span> <span class="ident">SingleSearch</span> { |
| <span class="kw">fn</span> <span class="ident">freq_rank</span>(<span class="ident">b</span>: <span class="ident">u8</span>) <span class="op">-></span> <span class="ident">usize</span> { <span class="ident">BYTE_FREQUENCIES</span>[<span class="ident">b</span> <span class="kw">as</span> <span class="ident">usize</span>] <span class="kw">as</span> <span class="ident">usize</span> } |
| |
| <span class="kw">if</span> <span class="ident">pat</span>.<span class="ident">is_empty</span>() { |
| <span class="kw">return</span> <span class="ident">SingleSearch</span>::<span class="ident">empty</span>(); |
| } |
| |
| <span class="comment">// Find the rarest two bytes. Try to make them distinct (but it's not</span> |
| <span class="comment">// required).</span> |
| <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">rare1</span> <span class="op">=</span> <span class="ident">pat</span>[<span class="number">0</span>]; |
| <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">rare2</span> <span class="op">=</span> <span class="ident">pat</span>[<span class="number">0</span>]; |
| <span class="kw">for</span> <span class="ident">b</span> <span class="kw">in</span> <span class="ident">pat</span>[<span class="number">1</span>..].<span class="ident">iter</span>().<span class="ident">cloned</span>() { |
| <span class="kw">if</span> <span class="ident">freq_rank</span>(<span class="ident">b</span>) <span class="op"><</span> <span class="ident">freq_rank</span>(<span class="ident">rare1</span>) { |
| <span class="ident">rare1</span> <span class="op">=</span> <span class="ident">b</span>; |
| } |
| } |
| <span class="kw">for</span> <span class="kw-2">&</span><span class="ident">b</span> <span class="kw">in</span> <span class="kw-2">&</span><span class="ident">pat</span> { |
| <span class="kw">if</span> <span class="ident">rare1</span> <span class="op">==</span> <span class="ident">rare2</span> { |
| <span class="ident">rare2</span> <span class="op">=</span> <span class="ident">b</span> |
| } <span class="kw">else</span> <span class="kw">if</span> <span class="ident">b</span> <span class="op">!=</span> <span class="ident">rare1</span> <span class="op">&&</span> <span class="ident">freq_rank</span>(<span class="ident">b</span>) <span class="op"><</span> <span class="ident">freq_rank</span>(<span class="ident">rare2</span>) { |
| <span class="ident">rare2</span> <span class="op">=</span> <span class="ident">b</span>; |
| } |
| } |
| |
| <span class="comment">// And find the offsets of their last occurrences.</span> |
| <span class="kw">let</span> <span class="ident">rare1i</span> <span class="op">=</span> <span class="ident">pat</span>.<span class="ident">iter</span>().<span class="ident">rposition</span>(<span class="op">|</span><span class="kw-2">&</span><span class="ident">b</span><span class="op">|</span> <span class="ident">b</span> <span class="op">==</span> <span class="ident">rare1</span>).<span class="ident">unwrap</span>(); |
| <span class="kw">let</span> <span class="ident">rare2i</span> <span class="op">=</span> <span class="ident">pat</span>.<span class="ident">iter</span>().<span class="ident">rposition</span>(<span class="op">|</span><span class="kw-2">&</span><span class="ident">b</span><span class="op">|</span> <span class="ident">b</span> <span class="op">==</span> <span class="ident">rare2</span>).<span class="ident">unwrap</span>(); |
| |
| <span class="kw">let</span> <span class="ident">char_len</span> <span class="op">=</span> <span class="ident">char_len_lossy</span>(<span class="kw-2">&</span><span class="ident">pat</span>); |
| <span class="ident">SingleSearch</span> { |
| <span class="ident">pat</span>: <span class="ident">pat</span>, |
| <span class="ident">char_len</span>: <span class="ident">char_len</span>, |
| <span class="ident">rare1</span>: <span class="ident">rare1</span>, |
| <span class="ident">rare1i</span>: <span class="ident">rare1i</span>, |
| <span class="ident">rare2</span>: <span class="ident">rare2</span>, |
| <span class="ident">rare2i</span>: <span class="ident">rare2i</span>, |
| } |
| } |
| |
| <span class="kw">fn</span> <span class="ident">empty</span>() <span class="op">-></span> <span class="ident">SingleSearch</span> { |
| <span class="ident">SingleSearch</span> { |
| <span class="ident">pat</span>: <span class="macro">vec</span><span class="macro">!</span>[], |
| <span class="ident">char_len</span>: <span class="number">0</span>, |
| <span class="ident">rare1</span>: <span class="number">0</span>, |
| <span class="ident">rare1i</span>: <span class="number">0</span>, |
| <span class="ident">rare2</span>: <span class="number">0</span>, |
| <span class="ident">rare2i</span>: <span class="number">0</span>, |
| } |
| } |
| |
| <span class="attribute">#[<span class="ident">inline</span>(<span class="ident">always</span>)]</span> <span class="comment">// reduces constant overhead</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">find</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">haystack</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span> { |
| <span class="kw">let</span> <span class="ident">pat</span> <span class="op">=</span> <span class="kw-2">&</span><span class="kw-2">*</span><span class="self">self</span>.<span class="ident">pat</span>; |
| <span class="kw">if</span> <span class="ident">haystack</span>.<span class="ident">len</span>() <span class="op"><</span> <span class="ident">pat</span>.<span class="ident">len</span>() <span class="op">||</span> <span class="ident">pat</span>.<span class="ident">is_empty</span>() { |
| <span class="kw">return</span> <span class="prelude-val">None</span>; |
| } |
| <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">i</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">rare1i</span>; |
| <span class="kw">while</span> <span class="ident">i</span> <span class="op"><</span> <span class="ident">haystack</span>.<span class="ident">len</span>() { |
| <span class="ident">i</span> <span class="op">+=</span> <span class="kw">match</span> <span class="ident">memchr</span>(<span class="self">self</span>.<span class="ident">rare1</span>, <span class="kw-2">&</span><span class="ident">haystack</span>[<span class="ident">i</span>..]) { |
| <span class="prelude-val">None</span> <span class="op">=></span> <span class="kw">return</span> <span class="prelude-val">None</span>, |
| <span class="prelude-val">Some</span>(<span class="ident">i</span>) <span class="op">=></span> <span class="ident">i</span>, |
| }; |
| <span class="kw">let</span> <span class="ident">start</span> <span class="op">=</span> <span class="ident">i</span> <span class="op">-</span> <span class="self">self</span>.<span class="ident">rare1i</span>; |
| <span class="kw">let</span> <span class="ident">end</span> <span class="op">=</span> <span class="ident">start</span> <span class="op">+</span> <span class="ident">pat</span>.<span class="ident">len</span>(); |
| <span class="kw">if</span> <span class="ident">end</span> <span class="op">></span> <span class="ident">haystack</span>.<span class="ident">len</span>() { |
| <span class="kw">return</span> <span class="prelude-val">None</span>; |
| } |
| <span class="kw">let</span> <span class="ident">aligned</span> <span class="op">=</span> <span class="kw-2">&</span><span class="ident">haystack</span>[<span class="ident">start</span>..<span class="ident">end</span>]; |
| <span class="kw">if</span> <span class="ident">aligned</span>[<span class="self">self</span>.<span class="ident">rare2i</span>] <span class="op">==</span> <span class="self">self</span>.<span class="ident">rare2</span> <span class="op">&&</span> <span class="ident">aligned</span> <span class="op">==</span> <span class="kw-2">&</span><span class="kw-2">*</span><span class="self">self</span>.<span class="ident">pat</span> { |
| <span class="kw">return</span> <span class="prelude-val">Some</span>(<span class="ident">start</span>); |
| } |
| <span class="ident">i</span> <span class="op">+=</span> <span class="number">1</span>; |
| } |
| <span class="prelude-val">None</span> |
| } |
| |
| <span class="attribute">#[<span class="ident">inline</span>(<span class="ident">always</span>)]</span> <span class="comment">// reduces constant overhead</span> |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">is_suffix</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">text</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="ident">bool</span> { |
| <span class="kw">if</span> <span class="ident">text</span>.<span class="ident">len</span>() <span class="op"><</span> <span class="self">self</span>.<span class="ident">len</span>() { |
| <span class="kw">return</span> <span class="bool-val">false</span>; |
| } |
| <span class="kw-2">&</span><span class="ident">text</span>[<span class="ident">text</span>.<span class="ident">len</span>() <span class="op">-</span> <span class="self">self</span>.<span class="ident">len</span>()..] <span class="op">==</span> <span class="kw-2">&</span><span class="kw-2">*</span><span class="self">self</span>.<span class="ident">pat</span> |
| } |
| |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">len</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> { |
| <span class="self">self</span>.<span class="ident">pat</span>.<span class="ident">len</span>() |
| } |
| |
| <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">char_len</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> { |
| <span class="self">self</span>.<span class="ident">char_len</span> |
| } |
| |
| <span class="kw">fn</span> <span class="ident">approximate_size</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> { |
| <span class="self">self</span>.<span class="ident">pat</span>.<span class="ident">len</span>() <span class="op">*</span> <span class="ident">mem</span>::<span class="ident">size_of</span>::<span class="op"><</span><span class="ident">u8</span><span class="op">></span>() |
| } |
| } |
| |
| <span class="kw">fn</span> <span class="ident">char_len_lossy</span>(<span class="ident">bytes</span>: <span class="kw-2">&</span>[<span class="ident">u8</span>]) <span class="op">-></span> <span class="ident">usize</span> { |
| <span class="ident">String</span>::<span class="ident">from_utf8_lossy</span>(<span class="ident">bytes</span>).<span class="ident">chars</span>().<span class="ident">count</span>() |
| } |
| </pre> |
| </section> |
| <section id='search' class="content hidden"></section> |
| |
| <section class="footer"></section> |
| |
| <aside id="help" class="hidden"> |
| <div> |
| <h1 class="hidden">Help</h1> |
| |
| <div class="shortcuts"> |
| <h2>Keyboard Shortcuts</h2> |
| |
| <dl> |
| <dt>?</dt> |
| <dd>Show this help dialog</dd> |
| <dt>S</dt> |
| <dd>Focus the search field</dd> |
| <dt>⇤</dt> |
| <dd>Move up in search results</dd> |
| <dt>⇥</dt> |
| <dd>Move down in search results</dd> |
| <dt>⏎</dt> |
| <dd>Go to active search result</dd> |
| <dt>+</dt> |
| <dd>Collapse/expand all sections</dd> |
| </dl> |
| </div> |
| |
| <div class="infos"> |
| <h2>Search Tricks</h2> |
| |
| <p> |
| Prefix searches with a type followed by a colon (e.g. |
| <code>fn:</code>) to restrict the search to a given type. |
| </p> |
| |
| <p> |
| Accepted types are: <code>fn</code>, <code>mod</code>, |
| <code>struct</code>, <code>enum</code>, |
| <code>trait</code>, <code>type</code>, <code>macro</code>, |
| and <code>const</code>. |
| </p> |
| |
| <p> |
| Search functions by type signature (e.g. |
| <code>vec -> usize</code> or <code>* -> vec</code>) |
| </p> |
| </div> |
| </div> |
| </aside> |
| |
| |
| |
| <script> |
| window.rootPath = "../../"; |
| window.currentCrate = "regex"; |
| </script> |
| <script src="../../main.js"></script> |
| <script defer src="../../search-index.js"></script> |
| </body> |
| </html> |