api-docs/crates-enclave/src/aho_corasick/automaton.rs.html - incubator-teaclave-website - Git at Google

 <!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 of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/aho-corasick-1.0.2/src/automaton.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>automaton.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../normalize.css"><link rel="stylesheet" href="../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../ayu.css" disabled><link rel="stylesheet" href="../../dark.css" disabled><link rel="stylesheet" href="../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../storage.js"></script><script defer src="../../source-script.js"></script><script defer src="../../source-files.js"></script><script defer src="../../main.js"></script><noscript><link rel="stylesheet" href="../../noscript.css"></noscript><link rel="alternate icon" type="image/png" href="../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../favicon.svg"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../aho_corasick/index.html"><div class="logo-container"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../aho_corasick/index.html"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-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>
 <span id="522">522</span>
 <span id="523">523</span>
 <span id="524">524</span>
 <span id="525">525</span>
 <span id="526">526</span>
 <span id="527">527</span>
 <span id="528">528</span>
 <span id="529">529</span>
 <span id="530">530</span>
 <span id="531">531</span>
 <span id="532">532</span>
 <span id="533">533</span>
 <span id="534">534</span>
 <span id="535">535</span>
 <span id="536">536</span>
 <span id="537">537</span>
 <span id="538">538</span>
 <span id="539">539</span>
 <span id="540">540</span>
 <span id="541">541</span>
 <span id="542">542</span>
 <span id="543">543</span>
 <span id="544">544</span>
 <span id="545">545</span>
 <span id="546">546</span>
 <span id="547">547</span>
 <span id="548">548</span>
 <span id="549">549</span>
 <span id="550">550</span>
 <span id="551">551</span>
 <span id="552">552</span>
 <span id="553">553</span>
 <span id="554">554</span>
 <span id="555">555</span>
 <span id="556">556</span>
 <span id="557">557</span>
 <span id="558">558</span>
 <span id="559">559</span>
 <span id="560">560</span>
 <span id="561">561</span>
 <span id="562">562</span>
 <span id="563">563</span>
 <span id="564">564</span>
 <span id="565">565</span>
 <span id="566">566</span>
 <span id="567">567</span>
 <span id="568">568</span>
 <span id="569">569</span>
 <span id="570">570</span>
 <span id="571">571</span>
 <span id="572">572</span>
 <span id="573">573</span>
 <span id="574">574</span>
 <span id="575">575</span>
 <span id="576">576</span>
 <span id="577">577</span>
 <span id="578">578</span>
 <span id="579">579</span>
 <span id="580">580</span>
 <span id="581">581</span>
 <span id="582">582</span>
 <span id="583">583</span>
 <span id="584">584</span>
 <span id="585">585</span>
 <span id="586">586</span>
 <span id="587">587</span>
 <span id="588">588</span>
 <span id="589">589</span>
 <span id="590">590</span>
 <span id="591">591</span>
 <span id="592">592</span>
 <span id="593">593</span>
 <span id="594">594</span>
 <span id="595">595</span>
 <span id="596">596</span>
 <span id="597">597</span>
 <span id="598">598</span>
 <span id="599">599</span>
 <span id="600">600</span>
 <span id="601">601</span>
 <span id="602">602</span>
 <span id="603">603</span>
 <span id="604">604</span>
 <span id="605">605</span>
 <span id="606">606</span>
 <span id="607">607</span>
 <span id="608">608</span>
 <span id="609">609</span>
 <span id="610">610</span>
 <span id="611">611</span>
 <span id="612">612</span>
 <span id="613">613</span>
 <span id="614">614</span>
 <span id="615">615</span>
 <span id="616">616</span>
 <span id="617">617</span>
 <span id="618">618</span>
 <span id="619">619</span>
 <span id="620">620</span>
 <span id="621">621</span>
 <span id="622">622</span>
 <span id="623">623</span>
 <span id="624">624</span>
 <span id="625">625</span>
 <span id="626">626</span>
 <span id="627">627</span>
 <span id="628">628</span>
 <span id="629">629</span>
 <span id="630">630</span>
 <span id="631">631</span>
 <span id="632">632</span>
 <span id="633">633</span>
 <span id="634">634</span>
 <span id="635">635</span>
 <span id="636">636</span>
 <span id="637">637</span>
 <span id="638">638</span>
 <span id="639">639</span>
 <span id="640">640</span>
 <span id="641">641</span>
 <span id="642">642</span>
 <span id="643">643</span>
 <span id="644">644</span>
 <span id="645">645</span>
 <span id="646">646</span>
 <span id="647">647</span>
 <span id="648">648</span>
 <span id="649">649</span>
 <span id="650">650</span>
 <span id="651">651</span>
 <span id="652">652</span>
 <span id="653">653</span>
 <span id="654">654</span>
 <span id="655">655</span>
 <span id="656">656</span>
 <span id="657">657</span>
 <span id="658">658</span>
 <span id="659">659</span>
 <span id="660">660</span>
 <span id="661">661</span>
 <span id="662">662</span>
 <span id="663">663</span>
 <span id="664">664</span>
 <span id="665">665</span>
 <span id="666">666</span>
 <span id="667">667</span>
 <span id="668">668</span>
 <span id="669">669</span>
 <span id="670">670</span>
 <span id="671">671</span>
 <span id="672">672</span>
 <span id="673">673</span>
 <span id="674">674</span>
 <span id="675">675</span>
 <span id="676">676</span>
 <span id="677">677</span>
 <span id="678">678</span>
 <span id="679">679</span>
 <span id="680">680</span>
 <span id="681">681</span>
 <span id="682">682</span>
 <span id="683">683</span>
 <span id="684">684</span>
 <span id="685">685</span>
 <span id="686">686</span>
 <span id="687">687</span>
 <span id="688">688</span>
 <span id="689">689</span>
 <span id="690">690</span>
 <span id="691">691</span>
 <span id="692">692</span>
 <span id="693">693</span>
 <span id="694">694</span>
 <span id="695">695</span>
 <span id="696">696</span>
 <span id="697">697</span>
 <span id="698">698</span>
 <span id="699">699</span>
 <span id="700">700</span>
 <span id="701">701</span>
 <span id="702">702</span>
 <span id="703">703</span>
 <span id="704">704</span>
 <span id="705">705</span>
 <span id="706">706</span>
 <span id="707">707</span>
 <span id="708">708</span>
 <span id="709">709</span>
 <span id="710">710</span>
 <span id="711">711</span>
 <span id="712">712</span>
 <span id="713">713</span>
 <span id="714">714</span>
 <span id="715">715</span>
 <span id="716">716</span>
 <span id="717">717</span>
 <span id="718">718</span>
 <span id="719">719</span>
 <span id="720">720</span>
 <span id="721">721</span>
 <span id="722">722</span>
 <span id="723">723</span>
 <span id="724">724</span>
 <span id="725">725</span>
 <span id="726">726</span>
 <span id="727">727</span>
 <span id="728">728</span>
 <span id="729">729</span>
 <span id="730">730</span>
 <span id="731">731</span>
 <span id="732">732</span>
 <span id="733">733</span>
 <span id="734">734</span>
 <span id="735">735</span>
 <span id="736">736</span>
 <span id="737">737</span>
 <span id="738">738</span>
 <span id="739">739</span>
 <span id="740">740</span>
 <span id="741">741</span>
 <span id="742">742</span>
 <span id="743">743</span>
 <span id="744">744</span>
 <span id="745">745</span>
 <span id="746">746</span>
 <span id="747">747</span>
 <span id="748">748</span>
 <span id="749">749</span>
 <span id="750">750</span>
 <span id="751">751</span>
 <span id="752">752</span>
 <span id="753">753</span>
 <span id="754">754</span>
 <span id="755">755</span>
 <span id="756">756</span>
 <span id="757">757</span>
 <span id="758">758</span>
 <span id="759">759</span>
 <span id="760">760</span>
 <span id="761">761</span>
 <span id="762">762</span>
 <span id="763">763</span>
 <span id="764">764</span>
 <span id="765">765</span>
 <span id="766">766</span>
 <span id="767">767</span>
 <span id="768">768</span>
 <span id="769">769</span>
 <span id="770">770</span>
 <span id="771">771</span>
 <span id="772">772</span>
 <span id="773">773</span>
 <span id="774">774</span>
 <span id="775">775</span>
 <span id="776">776</span>
 <span id="777">777</span>
 <span id="778">778</span>
 <span id="779">779</span>
 <span id="780">780</span>
 <span id="781">781</span>
 <span id="782">782</span>
 <span id="783">783</span>
 <span id="784">784</span>
 <span id="785">785</span>
 <span id="786">786</span>
 <span id="787">787</span>
 <span id="788">788</span>
 <span id="789">789</span>
 <span id="790">790</span>
 <span id="791">791</span>
 <span id="792">792</span>
 <span id="793">793</span>
 <span id="794">794</span>
 <span id="795">795</span>
 <span id="796">796</span>
 <span id="797">797</span>
 <span id="798">798</span>
 <span id="799">799</span>
 <span id="800">800</span>
 <span id="801">801</span>
 <span id="802">802</span>
 <span id="803">803</span>
 <span id="804">804</span>
 <span id="805">805</span>
 <span id="806">806</span>
 <span id="807">807</span>
 <span id="808">808</span>
 <span id="809">809</span>
 <span id="810">810</span>
 <span id="811">811</span>
 <span id="812">812</span>
 <span id="813">813</span>
 <span id="814">814</span>
 <span id="815">815</span>
 <span id="816">816</span>
 <span id="817">817</span>
 <span id="818">818</span>
 <span id="819">819</span>
 <span id="820">820</span>
 <span id="821">821</span>
 <span id="822">822</span>
 <span id="823">823</span>
 <span id="824">824</span>
 <span id="825">825</span>
 <span id="826">826</span>
 <span id="827">827</span>
 <span id="828">828</span>
 <span id="829">829</span>
 <span id="830">830</span>
 <span id="831">831</span>
 <span id="832">832</span>
 <span id="833">833</span>
 <span id="834">834</span>
 <span id="835">835</span>
 <span id="836">836</span>
 <span id="837">837</span>
 <span id="838">838</span>
 <span id="839">839</span>
 <span id="840">840</span>
 <span id="841">841</span>
 <span id="842">842</span>
 <span id="843">843</span>
 <span id="844">844</span>
 <span id="845">845</span>
 <span id="846">846</span>
 <span id="847">847</span>
 <span id="848">848</span>
 <span id="849">849</span>
 <span id="850">850</span>
 <span id="851">851</span>
 <span id="852">852</span>
 <span id="853">853</span>
 <span id="854">854</span>
 <span id="855">855</span>
 <span id="856">856</span>
 <span id="857">857</span>
 <span id="858">858</span>
 <span id="859">859</span>
 <span id="860">860</span>
 <span id="861">861</span>
 <span id="862">862</span>
 <span id="863">863</span>
 <span id="864">864</span>
 <span id="865">865</span>
 <span id="866">866</span>
 <span id="867">867</span>
 <span id="868">868</span>
 <span id="869">869</span>
 <span id="870">870</span>
 <span id="871">871</span>
 <span id="872">872</span>
 <span id="873">873</span>
 <span id="874">874</span>
 <span id="875">875</span>
 <span id="876">876</span>
 <span id="877">877</span>
 <span id="878">878</span>
 <span id="879">879</span>
 <span id="880">880</span>
 <span id="881">881</span>
 <span id="882">882</span>
 <span id="883">883</span>
 <span id="884">884</span>
 <span id="885">885</span>
 <span id="886">886</span>
 <span id="887">887</span>
 <span id="888">888</span>
 <span id="889">889</span>
 <span id="890">890</span>
 <span id="891">891</span>
 <span id="892">892</span>
 <span id="893">893</span>
 <span id="894">894</span>
 <span id="895">895</span>
 <span id="896">896</span>
 <span id="897">897</span>
 <span id="898">898</span>
 <span id="899">899</span>
 <span id="900">900</span>
 <span id="901">901</span>
 <span id="902">902</span>
 <span id="903">903</span>
 <span id="904">904</span>
 <span id="905">905</span>
 <span id="906">906</span>
 <span id="907">907</span>
 <span id="908">908</span>
 <span id="909">909</span>
 <span id="910">910</span>
 <span id="911">911</span>
 <span id="912">912</span>
 <span id="913">913</span>
 <span id="914">914</span>
 <span id="915">915</span>
 <span id="916">916</span>
 <span id="917">917</span>
 <span id="918">918</span>
 <span id="919">919</span>
 <span id="920">920</span>
 <span id="921">921</span>
 <span id="922">922</span>
 <span id="923">923</span>
 <span id="924">924</span>
 <span id="925">925</span>
 <span id="926">926</span>
 <span id="927">927</span>
 <span id="928">928</span>
 <span id="929">929</span>
 <span id="930">930</span>
 <span id="931">931</span>
 <span id="932">932</span>
 <span id="933">933</span>
 <span id="934">934</span>
 <span id="935">935</span>
 <span id="936">936</span>
 <span id="937">937</span>
 <span id="938">938</span>
 <span id="939">939</span>
 <span id="940">940</span>
 <span id="941">941</span>
 <span id="942">942</span>
 <span id="943">943</span>
 <span id="944">944</span>
 <span id="945">945</span>
 <span id="946">946</span>
 <span id="947">947</span>
 <span id="948">948</span>
 <span id="949">949</span>
 <span id="950">950</span>
 <span id="951">951</span>
 <span id="952">952</span>
 <span id="953">953</span>
 <span id="954">954</span>
 <span id="955">955</span>
 <span id="956">956</span>
 <span id="957">957</span>
 <span id="958">958</span>
 <span id="959">959</span>
 <span id="960">960</span>
 <span id="961">961</span>
 <span id="962">962</span>
 <span id="963">963</span>
 <span id="964">964</span>
 <span id="965">965</span>
 <span id="966">966</span>
 <span id="967">967</span>
 <span id="968">968</span>
 <span id="969">969</span>
 <span id="970">970</span>
 <span id="971">971</span>
 <span id="972">972</span>
 <span id="973">973</span>
 <span id="974">974</span>
 <span id="975">975</span>
 <span id="976">976</span>
 <span id="977">977</span>
 <span id="978">978</span>
 <span id="979">979</span>
 <span id="980">980</span>
 <span id="981">981</span>
 <span id="982">982</span>
 <span id="983">983</span>
 <span id="984">984</span>
 <span id="985">985</span>
 <span id="986">986</span>
 <span id="987">987</span>
 <span id="988">988</span>
 <span id="989">989</span>
 <span id="990">990</span>
 <span id="991">991</span>
 <span id="992">992</span>
 <span id="993">993</span>
 <span id="994">994</span>
 <span id="995">995</span>
 <span id="996">996</span>
 <span id="997">997</span>
 <span id="998">998</span>
 <span id="999">999</span>
 <span id="1000">1000</span>
 <span id="1001">1001</span>
 <span id="1002">1002</span>
 <span id="1003">1003</span>
 <span id="1004">1004</span>
 <span id="1005">1005</span>
 <span id="1006">1006</span>
 <span id="1007">1007</span>
 <span id="1008">1008</span>
 <span id="1009">1009</span>
 <span id="1010">1010</span>
 <span id="1011">1011</span>
 <span id="1012">1012</span>
 <span id="1013">1013</span>
 <span id="1014">1014</span>
 <span id="1015">1015</span>
 <span id="1016">1016</span>
 <span id="1017">1017</span>
 <span id="1018">1018</span>
 <span id="1019">1019</span>
 <span id="1020">1020</span>
 <span id="1021">1021</span>
 <span id="1022">1022</span>
 <span id="1023">1023</span>
 <span id="1024">1024</span>
 <span id="1025">1025</span>
 <span id="1026">1026</span>
 <span id="1027">1027</span>
 <span id="1028">1028</span>
 <span id="1029">1029</span>
 <span id="1030">1030</span>
 <span id="1031">1031</span>
 <span id="1032">1032</span>
 <span id="1033">1033</span>
 <span id="1034">1034</span>
 <span id="1035">1035</span>
 <span id="1036">1036</span>
 <span id="1037">1037</span>
 <span id="1038">1038</span>
 <span id="1039">1039</span>
 <span id="1040">1040</span>
 <span id="1041">1041</span>
 <span id="1042">1042</span>
 <span id="1043">1043</span>
 <span id="1044">1044</span>
 <span id="1045">1045</span>
 <span id="1046">1046</span>
 <span id="1047">1047</span>
 <span id="1048">1048</span>
 <span id="1049">1049</span>
 <span id="1050">1050</span>
 <span id="1051">1051</span>
 <span id="1052">1052</span>
 <span id="1053">1053</span>
 <span id="1054">1054</span>
 <span id="1055">1055</span>
 <span id="1056">1056</span>
 <span id="1057">1057</span>
 <span id="1058">1058</span>
 <span id="1059">1059</span>
 <span id="1060">1060</span>
 <span id="1061">1061</span>
 <span id="1062">1062</span>
 <span id="1063">1063</span>
 <span id="1064">1064</span>
 <span id="1065">1065</span>
 <span id="1066">1066</span>
 <span id="1067">1067</span>
 <span id="1068">1068</span>
 <span id="1069">1069</span>
 <span id="1070">1070</span>
 <span id="1071">1071</span>
 <span id="1072">1072</span>
 <span id="1073">1073</span>
 <span id="1074">1074</span>
 <span id="1075">1075</span>
 <span id="1076">1076</span>
 <span id="1077">1077</span>
 <span id="1078">1078</span>
 <span id="1079">1079</span>
 <span id="1080">1080</span>
 <span id="1081">1081</span>
 <span id="1082">1082</span>
 <span id="1083">1083</span>
 <span id="1084">1084</span>
 <span id="1085">1085</span>
 <span id="1086">1086</span>
 <span id="1087">1087</span>
 <span id="1088">1088</span>
 <span id="1089">1089</span>
 <span id="1090">1090</span>
 <span id="1091">1091</span>
 <span id="1092">1092</span>
 <span id="1093">1093</span>
 <span id="1094">1094</span>
 <span id="1095">1095</span>
 <span id="1096">1096</span>
 <span id="1097">1097</span>
 <span id="1098">1098</span>
 <span id="1099">1099</span>
 <span id="1100">1100</span>
 <span id="1101">1101</span>
 <span id="1102">1102</span>
 <span id="1103">1103</span>
 <span id="1104">1104</span>
 <span id="1105">1105</span>
 <span id="1106">1106</span>
 <span id="1107">1107</span>
 <span id="1108">1108</span>
 <span id="1109">1109</span>
 <span id="1110">1110</span>
 <span id="1111">1111</span>
 <span id="1112">1112</span>
 <span id="1113">1113</span>
 <span id="1114">1114</span>
 <span id="1115">1115</span>
 <span id="1116">1116</span>
 <span id="1117">1117</span>
 <span id="1118">1118</span>
 <span id="1119">1119</span>
 <span id="1120">1120</span>
 <span id="1121">1121</span>
 <span id="1122">1122</span>
 <span id="1123">1123</span>
 <span id="1124">1124</span>
 <span id="1125">1125</span>
 <span id="1126">1126</span>
 <span id="1127">1127</span>
 <span id="1128">1128</span>
 <span id="1129">1129</span>
 <span id="1130">1130</span>
 <span id="1131">1131</span>
 <span id="1132">1132</span>
 <span id="1133">1133</span>
 <span id="1134">1134</span>
 <span id="1135">1135</span>
 <span id="1136">1136</span>
 <span id="1137">1137</span>
 <span id="1138">1138</span>
 <span id="1139">1139</span>
 <span id="1140">1140</span>
 <span id="1141">1141</span>
 <span id="1142">1142</span>
 <span id="1143">1143</span>
 <span id="1144">1144</span>
 <span id="1145">1145</span>
 <span id="1146">1146</span>
 <span id="1147">1147</span>
 <span id="1148">1148</span>
 <span id="1149">1149</span>
 <span id="1150">1150</span>
 <span id="1151">1151</span>
 <span id="1152">1152</span>
 <span id="1153">1153</span>
 <span id="1154">1154</span>
 <span id="1155">1155</span>
 <span id="1156">1156</span>
 <span id="1157">1157</span>
 <span id="1158">1158</span>
 <span id="1159">1159</span>
 <span id="1160">1160</span>
 <span id="1161">1161</span>
 <span id="1162">1162</span>
 <span id="1163">1163</span>
 <span id="1164">1164</span>
 <span id="1165">1165</span>
 <span id="1166">1166</span>
 <span id="1167">1167</span>
 <span id="1168">1168</span>
 <span id="1169">1169</span>
 <span id="1170">1170</span>
 <span id="1171">1171</span>
 <span id="1172">1172</span>
 <span id="1173">1173</span>
 <span id="1174">1174</span>
 <span id="1175">1175</span>
 <span id="1176">1176</span>
 <span id="1177">1177</span>
 <span id="1178">1178</span>
 <span id="1179">1179</span>
 <span id="1180">1180</span>
 <span id="1181">1181</span>
 <span id="1182">1182</span>
 <span id="1183">1183</span>
 <span id="1184">1184</span>
 <span id="1185">1185</span>
 <span id="1186">1186</span>
 <span id="1187">1187</span>
 <span id="1188">1188</span>
 <span id="1189">1189</span>
 <span id="1190">1190</span>
 <span id="1191">1191</span>
 <span id="1192">1192</span>
 <span id="1193">1193</span>
 <span id="1194">1194</span>
 <span id="1195">1195</span>
 <span id="1196">1196</span>
 <span id="1197">1197</span>
 <span id="1198">1198</span>
 <span id="1199">1199</span>
 <span id="1200">1200</span>
 <span id="1201">1201</span>
 <span id="1202">1202</span>
 <span id="1203">1203</span>
 <span id="1204">1204</span>
 <span id="1205">1205</span>
 <span id="1206">1206</span>
 <span id="1207">1207</span>
 <span id="1208">1208</span>
 <span id="1209">1209</span>
 <span id="1210">1210</span>
 <span id="1211">1211</span>
 <span id="1212">1212</span>
 <span id="1213">1213</span>
 <span id="1214">1214</span>
 <span id="1215">1215</span>
 <span id="1216">1216</span>
 <span id="1217">1217</span>
 <span id="1218">1218</span>
 <span id="1219">1219</span>
 <span id="1220">1220</span>
 <span id="1221">1221</span>
 <span id="1222">1222</span>
 <span id="1223">1223</span>
 <span id="1224">1224</span>
 <span id="1225">1225</span>
 <span id="1226">1226</span>
 <span id="1227">1227</span>
 <span id="1228">1228</span>
 <span id="1229">1229</span>
 <span id="1230">1230</span>
 <span id="1231">1231</span>
 <span id="1232">1232</span>
 <span id="1233">1233</span>
 <span id="1234">1234</span>
 <span id="1235">1235</span>
 <span id="1236">1236</span>
 <span id="1237">1237</span>
 <span id="1238">1238</span>
 <span id="1239">1239</span>
 <span id="1240">1240</span>
 <span id="1241">1241</span>
 <span id="1242">1242</span>
 <span id="1243">1243</span>
 <span id="1244">1244</span>
 <span id="1245">1245</span>
 <span id="1246">1246</span>
 <span id="1247">1247</span>
 <span id="1248">1248</span>
 <span id="1249">1249</span>
 <span id="1250">1250</span>
 <span id="1251">1251</span>
 <span id="1252">1252</span>
 <span id="1253">1253</span>
 <span id="1254">1254</span>
 <span id="1255">1255</span>
 <span id="1256">1256</span>
 <span id="1257">1257</span>
 <span id="1258">1258</span>
 <span id="1259">1259</span>
 <span id="1260">1260</span>
 <span id="1261">1261</span>
 <span id="1262">1262</span>
 <span id="1263">1263</span>
 <span id="1264">1264</span>
 <span id="1265">1265</span>
 <span id="1266">1266</span>
 <span id="1267">1267</span>
 <span id="1268">1268</span>
 <span id="1269">1269</span>
 <span id="1270">1270</span>
 <span id="1271">1271</span>
 <span id="1272">1272</span>
 <span id="1273">1273</span>
 <span id="1274">1274</span>
 <span id="1275">1275</span>
 <span id="1276">1276</span>
 <span id="1277">1277</span>
 <span id="1278">1278</span>
 <span id="1279">1279</span>
 <span id="1280">1280</span>
 <span id="1281">1281</span>
 <span id="1282">1282</span>
 <span id="1283">1283</span>
 <span id="1284">1284</span>
 <span id="1285">1285</span>
 <span id="1286">1286</span>
 <span id="1287">1287</span>
 <span id="1288">1288</span>
 <span id="1289">1289</span>
 <span id="1290">1290</span>
 <span id="1291">1291</span>
 <span id="1292">1292</span>
 <span id="1293">1293</span>
 <span id="1294">1294</span>
 <span id="1295">1295</span>
 <span id="1296">1296</span>
 <span id="1297">1297</span>
 <span id="1298">1298</span>
 <span id="1299">1299</span>
 <span id="1300">1300</span>
 <span id="1301">1301</span>
 <span id="1302">1302</span>
 <span id="1303">1303</span>
 <span id="1304">1304</span>
 <span id="1305">1305</span>
 <span id="1306">1306</span>
 <span id="1307">1307</span>
 <span id="1308">1308</span>
 <span id="1309">1309</span>
 <span id="1310">1310</span>
 <span id="1311">1311</span>
 <span id="1312">1312</span>
 <span id="1313">1313</span>
 <span id="1314">1314</span>
 <span id="1315">1315</span>
 <span id="1316">1316</span>
 <span id="1317">1317</span>
 <span id="1318">1318</span>
 <span id="1319">1319</span>
 <span id="1320">1320</span>
 <span id="1321">1321</span>
 <span id="1322">1322</span>
 <span id="1323">1323</span>
 <span id="1324">1324</span>
 <span id="1325">1325</span>
 <span id="1326">1326</span>
 <span id="1327">1327</span>
 <span id="1328">1328</span>
 <span id="1329">1329</span>
 <span id="1330">1330</span>
 <span id="1331">1331</span>
 <span id="1332">1332</span>
 <span id="1333">1333</span>
 <span id="1334">1334</span>
 <span id="1335">1335</span>
 <span id="1336">1336</span>
 <span id="1337">1337</span>
 <span id="1338">1338</span>
 <span id="1339">1339</span>
 <span id="1340">1340</span>
 <span id="1341">1341</span>
 <span id="1342">1342</span>
 <span id="1343">1343</span>
 <span id="1344">1344</span>
 <span id="1345">1345</span>
 <span id="1346">1346</span>
 <span id="1347">1347</span>
 <span id="1348">1348</span>
 <span id="1349">1349</span>
 <span id="1350">1350</span>
 <span id="1351">1351</span>
 <span id="1352">1352</span>
 <span id="1353">1353</span>
 <span id="1354">1354</span>
 <span id="1355">1355</span>
 <span id="1356">1356</span>
 <span id="1357">1357</span>
 <span id="1358">1358</span>
 <span id="1359">1359</span>
 <span id="1360">1360</span>
 <span id="1361">1361</span>
 <span id="1362">1362</span>
 <span id="1363">1363</span>
 <span id="1364">1364</span>
 <span id="1365">1365</span>
 <span id="1366">1366</span>
 <span id="1367">1367</span>
 <span id="1368">1368</span>
 <span id="1369">1369</span>
 <span id="1370">1370</span>
 <span id="1371">1371</span>
 <span id="1372">1372</span>
 <span id="1373">1373</span>
 <span id="1374">1374</span>
 <span id="1375">1375</span>
 <span id="1376">1376</span>
 <span id="1377">1377</span>
 <span id="1378">1378</span>
 <span id="1379">1379</span>
 <span id="1380">1380</span>
 <span id="1381">1381</span>
 <span id="1382">1382</span>
 <span id="1383">1383</span>
 <span id="1384">1384</span>
 <span id="1385">1385</span>
 <span id="1386">1386</span>
 <span id="1387">1387</span>
 <span id="1388">1388</span>
 <span id="1389">1389</span>
 <span id="1390">1390</span>
 <span id="1391">1391</span>
 <span id="1392">1392</span>
 <span id="1393">1393</span>
 <span id="1394">1394</span>
 <span id="1395">1395</span>
 <span id="1396">1396</span>
 <span id="1397">1397</span>
 <span id="1398">1398</span>
 <span id="1399">1399</span>
 <span id="1400">1400</span>
 <span id="1401">1401</span>
 <span id="1402">1402</span>
 <span id="1403">1403</span>
 <span id="1404">1404</span>
 <span id="1405">1405</span>
 <span id="1406">1406</span>
 <span id="1407">1407</span>
 <span id="1408">1408</span>
 <span id="1409">1409</span>
 <span id="1410">1410</span>
 <span id="1411">1411</span>
 <span id="1412">1412</span>
 <span id="1413">1413</span>
 <span id="1414">1414</span>
 <span id="1415">1415</span>
 <span id="1416">1416</span>
 <span id="1417">1417</span>
 <span id="1418">1418</span>
 <span id="1419">1419</span>
 <span id="1420">1420</span>
 <span id="1421">1421</span>
 <span id="1422">1422</span>
 <span id="1423">1423</span>
 <span id="1424">1424</span>
 <span id="1425">1425</span>
 <span id="1426">1426</span>
 <span id="1427">1427</span>
 <span id="1428">1428</span>
 <span id="1429">1429</span>
 <span id="1430">1430</span>
 <span id="1431">1431</span>
 <span id="1432">1432</span>
 <span id="1433">1433</span>
 <span id="1434">1434</span>
 <span id="1435">1435</span>
 <span id="1436">1436</span>
 <span id="1437">1437</span>
 <span id="1438">1438</span>
 <span id="1439">1439</span>
 <span id="1440">1440</span>
 <span id="1441">1441</span>
 <span id="1442">1442</span>
 <span id="1443">1443</span>
 <span id="1444">1444</span>
 <span id="1445">1445</span>
 <span id="1446">1446</span>
 <span id="1447">1447</span>
 <span id="1448">1448</span>
 <span id="1449">1449</span>
 <span id="1450">1450</span>
 <span id="1451">1451</span>
 <span id="1452">1452</span>
 <span id="1453">1453</span>
 <span id="1454">1454</span>
 <span id="1455">1455</span>
 <span id="1456">1456</span>
 <span id="1457">1457</span>
 <span id="1458">1458</span>
 <span id="1459">1459</span>
 <span id="1460">1460</span>
 <span id="1461">1461</span>
 <span id="1462">1462</span>
 <span id="1463">1463</span>
 <span id="1464">1464</span>
 <span id="1465">1465</span>
 <span id="1466">1466</span>
 <span id="1467">1467</span>
 <span id="1468">1468</span>
 <span id="1469">1469</span>
 <span id="1470">1470</span>
 <span id="1471">1471</span>
 <span id="1472">1472</span>
 <span id="1473">1473</span>
 <span id="1474">1474</span>
 <span id="1475">1475</span>
 <span id="1476">1476</span>
 <span id="1477">1477</span>
 <span id="1478">1478</span>
 <span id="1479">1479</span>
 <span id="1480">1480</span>
 <span id="1481">1481</span>
 <span id="1482">1482</span>
 <span id="1483">1483</span>
 <span id="1484">1484</span>
 <span id="1485">1485</span>
 <span id="1486">1486</span>
 <span id="1487">1487</span>
 <span id="1488">1488</span>
 <span id="1489">1489</span>
 <span id="1490">1490</span>
 <span id="1491">1491</span>
 <span id="1492">1492</span>
 <span id="1493">1493</span>
 <span id="1494">1494</span>
 <span id="1495">1495</span>
 <span id="1496">1496</span>
 <span id="1497">1497</span>
 <span id="1498">1498</span>
 <span id="1499">1499</span>
 <span id="1500">1500</span>
 <span id="1501">1501</span>
 <span id="1502">1502</span>
 <span id="1503">1503</span>
 <span id="1504">1504</span>
 <span id="1505">1505</span>
 <span id="1506">1506</span>
 <span id="1507">1507</span>
 <span id="1508">1508</span>
 <span id="1509">1509</span>
 <span id="1510">1510</span>
 <span id="1511">1511</span>
 <span id="1512">1512</span>
 <span id="1513">1513</span>
 <span id="1514">1514</span>
 <span id="1515">1515</span>
 <span id="1516">1516</span>
 <span id="1517">1517</span>
 <span id="1518">1518</span>
 <span id="1519">1519</span>
 <span id="1520">1520</span>
 <span id="1521">1521</span>
 <span id="1522">1522</span>
 <span id="1523">1523</span>
 <span id="1524">1524</span>
 <span id="1525">1525</span>
 <span id="1526">1526</span>
 <span id="1527">1527</span>
 <span id="1528">1528</span>
 <span id="1529">1529</span>
 <span id="1530">1530</span>
 <span id="1531">1531</span>
 <span id="1532">1532</span>
 <span id="1533">1533</span>
 <span id="1534">1534</span>
 <span id="1535">1535</span>
 <span id="1536">1536</span>
 <span id="1537">1537</span>
 <span id="1538">1538</span>
 <span id="1539">1539</span>
 <span id="1540">1540</span>
 <span id="1541">1541</span>
 <span id="1542">1542</span>
 <span id="1543">1543</span>
 <span id="1544">1544</span>
 <span id="1545">1545</span>
 <span id="1546">1546</span>
 <span id="1547">1547</span>
 <span id="1548">1548</span>
 <span id="1549">1549</span>
 <span id="1550">1550</span>
 <span id="1551">1551</span>
 <span id="1552">1552</span>
 <span id="1553">1553</span>
 <span id="1554">1554</span>
 <span id="1555">1555</span>
 <span id="1556">1556</span>
 <span id="1557">1557</span>
 <span id="1558">1558</span>
 <span id="1559">1559</span>
 <span id="1560">1560</span>
 <span id="1561">1561</span>
 <span id="1562">1562</span>
 <span id="1563">1563</span>
 <span id="1564">1564</span>
 <span id="1565">1565</span>
 <span id="1566">1566</span>
 <span id="1567">1567</span>
 <span id="1568">1568</span>
 <span id="1569">1569</span>
 <span id="1570">1570</span>
 <span id="1571">1571</span>
 <span id="1572">1572</span>
 <span id="1573">1573</span>
 <span id="1574">1574</span>
 <span id="1575">1575</span>
 <span id="1576">1576</span>
 <span id="1577">1577</span>
 <span id="1578">1578</span>
 <span id="1579">1579</span>
 <span id="1580">1580</span>
 <span id="1581">1581</span>
 <span id="1582">1582</span>
 <span id="1583">1583</span>
 <span id="1584">1584</span>
 <span id="1585">1585</span>
 <span id="1586">1586</span>
 <span id="1587">1587</span>
 <span id="1588">1588</span>
 <span id="1589">1589</span>
 <span id="1590">1590</span>
 <span id="1591">1591</span>
 <span id="1592">1592</span>
 <span id="1593">1593</span>
 <span id="1594">1594</span>
 <span id="1595">1595</span>
 <span id="1596">1596</span>
 <span id="1597">1597</span>
 <span id="1598">1598</span>
 <span id="1599">1599</span>
 <span id="1600">1600</span>
 <span id="1601">1601</span>
 <span id="1602">1602</span>
 <span id="1603">1603</span>
 <span id="1604">1604</span>
 <span id="1605">1605</span>
 <span id="1606">1606</span>
 <span id="1607">1607</span>
 <span id="1608">1608</span>
 </pre><pre class="rust"><code><span class="doccomment">/*!
 Provides [`Automaton`] trait for abstracting over Aho-Corasick automata.

 The `Automaton` trait provides a way to write generic code over any
 Aho-Corasick automaton. It also provides access to lower level APIs that
 permit walking the state transitions of an Aho-Corasick automaton manually.
 */

 </span><span class="kw">use </span>alloc::{string::String, vec::Vec};

 <span class="kw">use </span><span class="kw">crate</span>::util::{
     error::MatchError,
     primitives::PatternID,
     search::{Anchored, Input, Match, MatchKind, Span},
 };

 <span class="kw">pub use </span><span class="kw">crate</span>::util::{
     prefilter::{Candidate, Prefilter},
     primitives::{StateID, StateIDError},
 };

 <span class="doccomment">/// We seal the `Automaton` trait for now. It&#39;s a big trait, and it&#39;s
 /// conceivable that I might want to add new required methods, and sealing the
 /// trait permits doing that in a backwards compatible fashion. On other the
 /// hand, if you have a solid use case for implementing the trait yourself,
 /// please file an issue and we can discuss it. This was *mostly* done as a
 /// conservative step.
 </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>private {
     <span class="kw">pub trait </span>Sealed {}
 }
 <span class="kw">impl </span>private::Sealed <span class="kw">for </span><span class="kw">crate</span>::nfa::noncontiguous::NFA {}
 <span class="kw">impl </span>private::Sealed <span class="kw">for </span><span class="kw">crate</span>::nfa::contiguous::NFA {}
 <span class="kw">impl </span>private::Sealed <span class="kw">for </span><span class="kw">crate</span>::dfa::DFA {}

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: private::Sealed + <span class="question-mark">?</span>Sized&gt; private::Sealed <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T {}

 <span class="doccomment">/// A trait that abstracts over Aho-Corasick automata.
 ///
 /// This trait primarily exists for niche use cases such as:
 ///
 /// * Using an NFA or DFA directly, bypassing the top-level
 /// [`AhoCorasick`](crate::AhoCorasick) searcher. Currently, these include
 /// [`noncontiguous::NFA`](crate::nfa::noncontiguous::NFA),
 /// [`contiguous::NFA`](crate::nfa::contiguous::NFA) and
 /// [`dfa::DFA`](crate::dfa::DFA).
 /// * Implementing your own custom search routine by walking the automaton
 /// yourself. This might be useful for implementing search on non-contiguous
 /// strings or streams.
 ///
 /// For most use cases, it is not expected that users will need
 /// to use or even know about this trait. Indeed, the top level
 /// [`AhoCorasick`](crate::AhoCorasick) searcher does not expose any details
 /// about this trait, nor does it implement it itself.
 ///
 /// Note that this trait defines a number of default methods, such as
 /// [`Automaton::try_find`] and [`Automaton::try_find_iter`], which implement
 /// higher level search routines in terms of the lower level automata API.
 ///
 /// # Sealed
 ///
 /// Currently, this trait is sealed. That means users of this crate can write
 /// generic routines over this trait but cannot implement it themselves. This
 /// restriction may be lifted in the future, but sealing the trait permits
 /// adding new required methods in a backwards compatible fashion.
 ///
 /// # Special states
 ///
 /// This trait encodes a notion of &quot;special&quot; states in an automaton. Namely,
 /// a state is treated as special if it is a dead, match or start state:
 ///
 /// * A dead state is a state that cannot be left once entered. All transitions
 /// on a dead state lead back to itself. The dead state is meant to be treated
 /// as a sentinel indicating that the search should stop and return a match if
 /// one has been found, and nothing otherwise.
 /// * A match state is a state that indicates one or more patterns have
 /// matched. Depending on the [`MatchKind`] of the automaton, a search may
 /// stop once a match is seen, or it may continue looking for matches until
 /// it enters a dead state or sees the end of the haystack.
 /// * A start state is a state that a search begins in. It is useful to know
 /// when a search enters a start state because it may mean that a prefilter can
 /// be used to skip ahead and quickly look for candidate matches. Unlike dead
 /// and match states, it is never necessary to explicitly handle start states
 /// for correctness. Indeed, in this crate, implementations of `Automaton`
 /// will only treat start states as &quot;special&quot; when a prefilter is enabled and
 /// active. Otherwise, treating it as special has no purpose and winds up
 /// slowing down the overall search because it results in ping-ponging between
 /// the main state transition and the &quot;special&quot; state logic.
 ///
 /// Since checking whether a state is special by doing three different
 /// checks would be too expensive inside a fast search loop, the
 /// [`Automaton::is_special`] method is provided for quickly checking whether
 /// the state is special. The `Automaton::is_dead`, `Automaton::is_match` and
 /// `Automaton::is_start` predicates can then be used to determine which kind
 /// of special state it is.
 ///
 /// # Panics
 ///
 /// Most of the APIs on this trait should panic or give incorrect results
 /// if invalid inputs are given to it. For example, `Automaton::next_state`
 /// has unspecified behavior if the state ID given to it is not a valid
 /// state ID for the underlying automaton. Valid state IDs can only be
 /// retrieved in one of two ways: calling `Automaton::start_state` or calling
 /// `Automaton::next_state` with a valid state ID.
 ///
 /// # Safety
 ///
 /// This trait is not safe to implement so that code may rely on the
 /// correctness of implementations of this trait to avoid undefined behavior.
 /// The primary correctness guarantees are:
 ///
 /// * `Automaton::start_state` always returns a valid state ID or an error or
 /// panics.
 /// * `Automaton::next_state`, when given a valid state ID, always returns
 /// a valid state ID for all values of `anchored` and `byte`, or otherwise
 /// panics.
 ///
 /// In general, the rest of the methods on `Automaton` need to uphold their
 /// contracts as well. For example, `Automaton::is_dead` should only returns
 /// true if the given state ID is actually a dead state.
 ///
 /// Note that currently this crate does not rely on the safety property defined
 /// here to avoid undefined behavior. Instead, this was done to make it
 /// _possible_ to do in the future.
 ///
 /// # Example
 ///
 /// This example shows how one might implement a basic but correct search
 /// routine. We keep things simple by not using prefilters or worrying about
 /// anchored searches, but do make sure our search is correct for all possible
 /// [`MatchKind`] semantics. (The comments in the code below note the parts
 /// that are needed to support certain `MatchKind` semantics.)
 ///
 /// ```
 /// use aho_corasick::{
 ///     automaton::Automaton,
 ///     nfa::noncontiguous::NFA,
 ///     Anchored, Match, MatchError, MatchKind,
 /// };
 ///
 /// // Run an unanchored search for &#39;aut&#39; in &#39;haystack&#39;. Return the first match
 /// // seen according to the automaton&#39;s match semantics. This returns an error
 /// // if the given automaton does not support unanchored searches.
 /// fn find&lt;A: Automaton&gt;(
 ///     aut: A,
 ///     haystack: &amp;[u8],
 /// ) -&gt; Result&lt;Option&lt;Match&gt;, MatchError&gt; {
 ///     let mut sid = aut.start_state(Anchored::No)?;
 ///     let mut at = 0;
 ///     let mut mat = None;
 ///     let get_match = |sid, at| {
 ///         let pid = aut.match_pattern(sid, 0);
 ///         let len = aut.pattern_len(pid);
 ///         Match::new(pid, (at - len)..at)
 ///     };
 ///     // Start states can be match states!
 ///     if aut.is_match(sid) {
 ///         mat = Some(get_match(sid, at));
 ///         // Standard semantics require matches to be reported as soon as
 ///         // they&#39;re seen. Otherwise, we continue until we see a dead state
 ///         // or the end of the haystack.
 ///         if matches!(aut.match_kind(), MatchKind::Standard) {
 ///             return Ok(mat);
 ///         }
 ///     }
 ///     while at &lt; haystack.len() {
 ///         sid = aut.next_state(Anchored::No, sid, haystack[at]);
 ///         if aut.is_special(sid) {
 ///             if aut.is_dead(sid) {
 ///                 return Ok(mat);
 ///             } else if aut.is_match(sid) {
 ///                 mat = Some(get_match(sid, at + 1));
 ///                 // As above, standard semantics require that we return
 ///                 // immediately once a match is found.
 ///                 if matches!(aut.match_kind(), MatchKind::Standard) {
 ///                     return Ok(mat);
 ///                 }
 ///             }
 ///         }
 ///         at += 1;
 ///     }
 ///     Ok(mat)
 /// }
 ///
 /// // Show that it works for standard searches.
 /// let nfa = NFA::new(&amp;[&quot;samwise&quot;, &quot;sam&quot;]).unwrap();
 /// assert_eq!(Some(Match::must(1, 0..3)), find(&amp;nfa, b&quot;samwise&quot;)?);
 ///
 /// // But also works when using leftmost-first. Notice how the match result
 /// // has changed!
 /// let nfa = NFA::builder()
 ///     .match_kind(MatchKind::LeftmostFirst)
 ///     .build(&amp;[&quot;samwise&quot;, &quot;sam&quot;])
 ///     .unwrap();
 /// assert_eq!(Some(Match::must(0, 0..7)), find(&amp;nfa, b&quot;samwise&quot;)?);
 ///
 /// # Ok::&lt;(), Box&lt;dyn std::error::Error&gt;&gt;(())
 /// ```
 </span><span class="kw">pub unsafe trait </span>Automaton: private::Sealed {
     <span class="doccomment">/// Returns the starting state for the given anchor mode.
     ///
     /// Upon success, the state ID returned is guaranteed to be valid for
     /// this automaton.
     ///
     /// # Errors
     ///
     /// This returns an error when the given search configuration is not
     /// supported by the underlying automaton. For example, if the underlying
     /// automaton only supports unanchored searches but the given configuration
     /// was set to an anchored search, then this must return an error.
     </span><span class="kw">fn </span>start_state(<span class="kw-2">&amp;</span><span class="self">self</span>, anchored: Anchored) -&gt; <span class="prelude-ty">Result</span>&lt;StateID, MatchError&gt;;

     <span class="doccomment">/// Performs a state transition from `sid` for `byte` and returns the next
     /// state.
     ///
     /// `anchored` should be [`Anchored::Yes`] when executing an anchored
     /// search and [`Anchored::No`] otherwise. For some implementations of
     /// `Automaton`, it is required to know whether the search is anchored
     /// or not in order to avoid following failure transitions. Other
     /// implementations may ignore `anchored` altogether and depend on
     /// `Automaton::start_state` returning a state that walks a different path
     /// through the automaton depending on whether the search is anchored or
     /// not.
     ///
     /// # Panics
     ///
     /// This routine may panic or return incorrect results when the given state
     /// ID is invalid. A state ID is valid if and only if:
     ///
     /// 1. It came from a call to `Automaton::start_state`, or
     /// 2. It came from a previous call to `Automaton::next_state` with a
     /// valid state ID.
     ///
     /// Implementations must treat all possible values of `byte` as valid.
     ///
     /// Implementations may panic on unsupported values of `anchored`, but are
     /// not required to do so.
     </span><span class="kw">fn </span>next_state(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         anchored: Anchored,
         sid: StateID,
         byte: u8,
     ) -&gt; StateID;

     <span class="doccomment">/// Returns true if the given ID represents a &quot;special&quot; state. A special
     /// state is a dead, match or start state.
     ///
     /// Note that implementations may choose to return false when the given ID
     /// corresponds to a start state. Namely, it always correct to treat start
     /// states as non-special. Implementations must return true for states that
     /// are dead or contain matches.
     ///
     /// This has unspecified behavior when given an invalid state ID.
     </span><span class="kw">fn </span>is_special(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool;

     <span class="doccomment">/// Returns true if the given ID represents a dead state.
     ///
     /// A dead state is a type of &quot;sink&quot; in a finite state machine. It
     /// corresponds to a state whose transitions all loop back to itself. That
     /// is, once entered, it can never be left. In practice, it serves as a
     /// sentinel indicating that the search should terminate.
     ///
     /// This has unspecified behavior when given an invalid state ID.
     </span><span class="kw">fn </span>is_dead(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool;

     <span class="doccomment">/// Returns true if the given ID represents a match state.
     ///
     /// A match state is always associated with one or more pattern IDs that
     /// matched at the position in the haystack when the match state was
     /// entered. When a match state is entered, the match semantics dictate
     /// whether it should be returned immediately (for `MatchKind::Standard`)
     /// or if the search should continue (for `MatchKind::LeftmostFirst` and
     /// `MatchKind::LeftmostLongest`) until a dead state is seen or the end of
     /// the haystack has been reached.
     ///
     /// This has unspecified behavior when given an invalid state ID.
     </span><span class="kw">fn </span>is_match(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool;

     <span class="doccomment">/// Returns true if the given ID represents a start state.
     ///
     /// While it is never incorrect to ignore start states during a search
     /// (except for the start of the search of course), knowing whether one has
     /// entered a start state can be useful for certain classes of performance
     /// optimizations. For example, if one is in a start state, it may be legal
     /// to try to skip ahead and look for match candidates more quickly than
     /// would otherwise be accomplished by walking the automaton.
     ///
     /// Implementations of `Automaton` in this crate &quot;unspecialize&quot; start
     /// states when a prefilter is not active or enabled. In this case, it
     /// is possible for `Automaton::is_special(sid)` to return false while
     /// `Automaton::is_start(sid)` returns true.
     ///
     /// This has unspecified behavior when given an invalid state ID.
     </span><span class="kw">fn </span>is_start(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool;

     <span class="doccomment">/// Returns the match semantics that this automaton was built with.
     </span><span class="kw">fn </span>match_kind(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; MatchKind;

     <span class="doccomment">/// Returns the total number of matches for the given state ID.
     ///
     /// This has unspecified behavior if the given ID does not refer to a match
     /// state.
     </span><span class="kw">fn </span>match_len(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; usize;

     <span class="doccomment">/// Returns the pattern ID for the match state given by `sid` at the
     /// `index` given.
     ///
     /// Typically, `index` is only ever greater than `0` when implementing an
     /// overlapping search. Otherwise, it&#39;s likely that your search only cares
     /// about reporting the first pattern ID in a match state.
     ///
     /// This has unspecified behavior if the given ID does not refer to a match
     /// state, or if the index is greater than or equal to the total number of
     /// matches in this match state.
     </span><span class="kw">fn </span>match_pattern(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID, index: usize) -&gt; PatternID;

     <span class="doccomment">/// Returns the total number of patterns compiled into this automaton.
     </span><span class="kw">fn </span>patterns_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize;

     <span class="doccomment">/// Returns the length of the pattern for the given ID.
     ///
     /// This has unspecified behavior when given an invalid pattern
     /// ID. A pattern ID is valid if and only if it is less than
     /// `Automaton::patterns_len`.
     </span><span class="kw">fn </span>pattern_len(<span class="kw-2">&amp;</span><span class="self">self</span>, pid: PatternID) -&gt; usize;

     <span class="doccomment">/// Returns the length, in bytes, of the shortest pattern in this
     /// automaton.
     </span><span class="kw">fn </span>min_pattern_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize;

     <span class="doccomment">/// Returns the length, in bytes, of the longest pattern in this automaton.
     </span><span class="kw">fn </span>max_pattern_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize;

     <span class="doccomment">/// Returns the heap memory usage, in bytes, used by this automaton.
     </span><span class="kw">fn </span>memory_usage(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize;

     <span class="doccomment">/// Returns a prefilter, if available, that can be used to accelerate
     /// searches for this automaton.
     ///
     /// The typical way this is used is when the start state is entered during
     /// a search. When that happens, one can use a prefilter to skip ahead and
     /// look for candidate matches without having to walk the automaton on the
     /// bytes between candidates.
     ///
     /// Typically a prefilter is only available when there are a small (&lt;100)
     /// number of patterns built into the automaton.
     </span><span class="kw">fn </span>prefilter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>Prefilter&gt;;

     <span class="doccomment">/// Executes a non-overlapping search with this automaton using the given
     /// configuration.
     ///
     /// See
     /// [`AhoCorasick::try_find`](crate::AhoCorasick::try_find)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_find(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         input: <span class="kw-2">&amp;</span>Input&lt;<span class="lifetime">&#39;_</span>&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;Match&gt;, MatchError&gt; {
         try_find_fwd(<span class="kw-2">&amp;</span><span class="self">self</span>, input)
     }

     <span class="doccomment">/// Executes a overlapping search with this automaton using the given
     /// configuration.
     ///
     /// See
     /// [`AhoCorasick::try_find_overlapping`](crate::AhoCorasick::try_find_overlapping)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_find_overlapping(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         input: <span class="kw-2">&amp;</span>Input&lt;<span class="lifetime">&#39;_</span>&gt;,
         state: <span class="kw-2">&amp;mut </span>OverlappingState,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), MatchError&gt; {
         try_find_overlapping_fwd(<span class="kw-2">&amp;</span><span class="self">self</span>, input, state)
     }

     <span class="doccomment">/// Returns an iterator of non-overlapping matches with this automaton
     /// using the given configuration.
     ///
     /// See
     /// [`AhoCorasick::try_find_iter`](crate::AhoCorasick::try_find_iter)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_find_iter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>&gt;(
         <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="self">self</span>,
         input: Input&lt;<span class="lifetime">&#39;h</span>&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;FindIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, <span class="self">Self</span>&gt;, MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
     {
         FindIter::new(<span class="self">self</span>, input)
     }

     <span class="doccomment">/// Returns an iterator of overlapping matches with this automaton
     /// using the given configuration.
     ///
     /// See
     /// [`AhoCorasick::try_find_overlapping_iter`](crate::AhoCorasick::try_find_overlapping_iter)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_find_overlapping_iter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>&gt;(
         <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="self">self</span>,
         input: Input&lt;<span class="lifetime">&#39;h</span>&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;FindOverlappingIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, <span class="self">Self</span>&gt;, MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
     {
         <span class="kw">if </span>!<span class="self">self</span>.match_kind().is_standard() {
             <span class="kw">return </span><span class="prelude-val">Err</span>(MatchError::unsupported_overlapping(
                 <span class="self">self</span>.match_kind(),
             ));
         }
         <span class="comment">//  We might consider lifting this restriction. The reason why I added
         // it was to ban the combination of &quot;anchored search&quot; and &quot;overlapping
         // iteration.&quot; The match semantics aren&#39;t totally clear in that case.
         // Should we allow *any* matches that are adjacent to *any* previous
         // match? Or only following the most recent one? Or only matches
         // that start at the beginning of the search? We might also elect to
         // just keep this restriction in place, as callers should be able to
         // implement it themselves if they want to.
         </span><span class="kw">if </span>input.get_anchored().is_anchored() {
             <span class="kw">return </span><span class="prelude-val">Err</span>(MatchError::invalid_input_anchored());
         }
         <span class="kw">let _ </span>= <span class="self">self</span>.start_state(input.get_anchored())<span class="question-mark">?</span>;
         <span class="kw">let </span>state = OverlappingState::start();
         <span class="prelude-val">Ok</span>(FindOverlappingIter { aut: <span class="self">self</span>, input, state })
     }

     <span class="doccomment">/// Replaces all non-overlapping matches in `haystack` with
     /// strings from `replace_with` depending on the pattern that
     /// matched. The `replace_with` slice must have length equal to
     /// `Automaton::patterns_len`.
     ///
     /// See
     /// [`AhoCorasick::try_replace_all`](crate::AhoCorasick::try_replace_all)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_replace_all&lt;B&gt;(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         haystack: <span class="kw-2">&amp;</span>str,
         replace_with: <span class="kw-2">&amp;</span>[B],
     ) -&gt; <span class="prelude-ty">Result</span>&lt;String, MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
         B: AsRef&lt;str&gt;,
     {
         <span class="macro">assert_eq!</span>(
             replace_with.len(),
             <span class="self">self</span>.patterns_len(),
             <span class="string">&quot;replace_all requires a replacement for every pattern \
              in the automaton&quot;
         </span>);
         <span class="kw">let </span><span class="kw-2">mut </span>dst = String::with_capacity(haystack.len());
         <span class="self">self</span>.try_replace_all_with(haystack, <span class="kw-2">&amp;mut </span>dst, |mat, <span class="kw">_</span>, dst| {
             dst.push_str(replace_with[mat.pattern()].as_ref());
             <span class="bool-val">true
         </span>})<span class="question-mark">?</span>;
         <span class="prelude-val">Ok</span>(dst)
     }

     <span class="doccomment">/// Replaces all non-overlapping matches in `haystack` with
     /// strings from `replace_with` depending on the pattern that
     /// matched. The `replace_with` slice must have length equal to
     /// `Automaton::patterns_len`.
     ///
     /// See
     /// [`AhoCorasick::try_replace_all_bytes`](crate::AhoCorasick::try_replace_all_bytes)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_replace_all_bytes&lt;B&gt;(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         haystack: <span class="kw-2">&amp;</span>[u8],
         replace_with: <span class="kw-2">&amp;</span>[B],
     ) -&gt; <span class="prelude-ty">Result</span>&lt;Vec&lt;u8&gt;, MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
         B: AsRef&lt;[u8]&gt;,
     {
         <span class="macro">assert_eq!</span>(
             replace_with.len(),
             <span class="self">self</span>.patterns_len(),
             <span class="string">&quot;replace_all requires a replacement for every pattern \
              in the automaton&quot;
         </span>);
         <span class="kw">let </span><span class="kw-2">mut </span>dst = Vec::with_capacity(haystack.len());
         <span class="self">self</span>.try_replace_all_with_bytes(haystack, <span class="kw-2">&amp;mut </span>dst, |mat, <span class="kw">_</span>, dst| {
             dst.extend(replace_with[mat.pattern()].as_ref());
             <span class="bool-val">true
         </span>})<span class="question-mark">?</span>;
         <span class="prelude-val">Ok</span>(dst)
     }

     <span class="doccomment">/// Replaces all non-overlapping matches in `haystack` by calling the
     /// `replace_with` closure given.
     ///
     /// See
     /// [`AhoCorasick::try_replace_all_with`](crate::AhoCorasick::try_replace_all_with)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_replace_all_with&lt;F&gt;(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         haystack: <span class="kw-2">&amp;</span>str,
         dst: <span class="kw-2">&amp;mut </span>String,
         <span class="kw-2">mut </span>replace_with: F,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
         F: FnMut(<span class="kw-2">&amp;</span>Match, <span class="kw-2">&amp;</span>str, <span class="kw-2">&amp;mut </span>String) -&gt; bool,
     {
         <span class="kw">let </span><span class="kw-2">mut </span>last_match = <span class="number">0</span>;
         <span class="kw">for </span>m <span class="kw">in </span><span class="self">self</span>.try_find_iter(Input::new(haystack))<span class="question-mark">? </span>{
             <span class="comment">// Since there are no restrictions on what kinds of patterns are
             // in an Aho-Corasick automaton, we might get matches that split
             // a codepoint, or even matches of a partial codepoint. When that
             // happens, we just skip the match.
             </span><span class="kw">if </span>!haystack.is_char_boundary(m.start())
                 || !haystack.is_char_boundary(m.end())
             {
                 <span class="kw">continue</span>;
             }
             dst.push_str(<span class="kw-2">&amp;</span>haystack[last_match..m.start()]);
             last_match = m.end();
             <span class="kw">if </span>!replace_with(<span class="kw-2">&amp;</span>m, <span class="kw-2">&amp;</span>haystack[m.start()..m.end()], dst) {
                 <span class="kw">break</span>;
             };
         }
         dst.push_str(<span class="kw-2">&amp;</span>haystack[last_match..]);
         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// Replaces all non-overlapping matches in `haystack` by calling the
     /// `replace_with` closure given.
     ///
     /// See
     /// [`AhoCorasick::try_replace_all_with_bytes`](crate::AhoCorasick::try_replace_all_with_bytes)
     /// for more documentation and examples.
     </span><span class="kw">fn </span>try_replace_all_with_bytes&lt;F&gt;(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         haystack: <span class="kw-2">&amp;</span>[u8],
         dst: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;,
         <span class="kw-2">mut </span>replace_with: F,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
         F: FnMut(<span class="kw-2">&amp;</span>Match, <span class="kw-2">&amp;</span>[u8], <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;) -&gt; bool,
     {
         <span class="kw">let </span><span class="kw-2">mut </span>last_match = <span class="number">0</span>;
         <span class="kw">for </span>m <span class="kw">in </span><span class="self">self</span>.try_find_iter(Input::new(haystack))<span class="question-mark">? </span>{
             dst.extend(<span class="kw-2">&amp;</span>haystack[last_match..m.start()]);
             last_match = m.end();
             <span class="kw">if </span>!replace_with(<span class="kw-2">&amp;</span>m, <span class="kw-2">&amp;</span>haystack[m.start()..m.end()], dst) {
                 <span class="kw">break</span>;
             };
         }
         dst.extend(<span class="kw-2">&amp;</span>haystack[last_match..]);
         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// Returns an iterator of non-overlapping matches with this automaton
     /// from the stream given.
     ///
     /// See
     /// [`AhoCorasick::try_stream_find_iter`](crate::AhoCorasick::try_stream_find_iter)
     /// for more documentation and examples.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
     </span><span class="kw">fn </span>try_stream_find_iter&lt;<span class="lifetime">&#39;a</span>, R: std::io::Read&gt;(
         <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="self">self</span>,
         rdr: R,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;StreamFindIter&lt;<span class="lifetime">&#39;a</span>, <span class="self">Self</span>, R&gt;, MatchError&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
     {
         <span class="prelude-val">Ok</span>(StreamFindIter { it: StreamChunkIter::new(<span class="self">self</span>, rdr)<span class="question-mark">? </span>})
     }

     <span class="doccomment">/// Replaces all non-overlapping matches in `rdr` with strings from
     /// `replace_with` depending on the pattern that matched, and writes the
     /// result to `wtr`. The `replace_with` slice must have length equal to
     /// `Automaton::patterns_len`.
     ///
     /// See
     /// [`AhoCorasick::try_stream_replace_all`](crate::AhoCorasick::try_stream_replace_all)
     /// for more documentation and examples.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
     </span><span class="kw">fn </span>try_stream_replace_all&lt;R, W, B&gt;(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         rdr: R,
         wtr: W,
         replace_with: <span class="kw-2">&amp;</span>[B],
     ) -&gt; std::io::Result&lt;()&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
         R: std::io::Read,
         W: std::io::Write,
         B: AsRef&lt;[u8]&gt;,
     {
         <span class="macro">assert_eq!</span>(
             replace_with.len(),
             <span class="self">self</span>.patterns_len(),
             <span class="string">&quot;streaming replace_all requires a replacement for every pattern \
              in the automaton&quot;</span>,
         );
         <span class="self">self</span>.try_stream_replace_all_with(rdr, wtr, |mat, <span class="kw">_</span>, wtr| {
             wtr.write_all(replace_with[mat.pattern()].as_ref())
         })
     }

     <span class="doccomment">/// Replaces all non-overlapping matches in `rdr` by calling the
     /// `replace_with` closure given and writing the result to `wtr`.
     ///
     /// See
     /// [`AhoCorasick::try_stream_replace_all_with`](crate::AhoCorasick::try_stream_replace_all_with)
     /// for more documentation and examples.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
     </span><span class="kw">fn </span>try_stream_replace_all_with&lt;R, W, F&gt;(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         rdr: R,
         <span class="kw-2">mut </span>wtr: W,
         <span class="kw-2">mut </span>replace_with: F,
     ) -&gt; std::io::Result&lt;()&gt;
     <span class="kw">where
         </span><span class="self">Self</span>: Sized,
         R: std::io::Read,
         W: std::io::Write,
         F: FnMut(<span class="kw-2">&amp;</span>Match, <span class="kw-2">&amp;</span>[u8], <span class="kw-2">&amp;mut </span>W) -&gt; std::io::Result&lt;()&gt;,
     {
         <span class="kw">let </span><span class="kw-2">mut </span>it = StreamChunkIter::new(<span class="self">self</span>, rdr).map_err(|e| {
             <span class="kw">let </span>kind = std::io::ErrorKind::Other;
             std::io::Error::new(kind, e)
         })<span class="question-mark">?</span>;
         <span class="kw">while let </span><span class="prelude-val">Some</span>(result) = it.next() {
             <span class="kw">let </span>chunk = result<span class="question-mark">?</span>;
             <span class="kw">match </span>chunk {
                 StreamChunk::NonMatch { bytes, .. } =&gt; {
                     wtr.write_all(bytes)<span class="question-mark">?</span>;
                 }
                 StreamChunk::Match { bytes, mat } =&gt; {
                     replace_with(<span class="kw-2">&amp;</span>mat, bytes, <span class="kw-2">&amp;mut </span>wtr)<span class="question-mark">?</span>;
                 }
             }
         }
         <span class="prelude-val">Ok</span>(())
     }
 }

 <span class="comment">// SAFETY: This just defers to the underlying &#39;AcAutomaton&#39; and thus inherits
 // its safety properties.
 </span><span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, A: Automaton + <span class="question-mark">?</span>Sized&gt; Automaton <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>A {
     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>start_state(<span class="kw-2">&amp;</span><span class="self">self</span>, anchored: Anchored) -&gt; <span class="prelude-ty">Result</span>&lt;StateID, MatchError&gt; {
         (<span class="kw-2">**</span><span class="self">self</span>).start_state(anchored)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>next_state(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         anchored: Anchored,
         sid: StateID,
         byte: u8,
     ) -&gt; StateID {
         (<span class="kw-2">**</span><span class="self">self</span>).next_state(anchored, sid, byte)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>is_special(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool {
         (<span class="kw-2">**</span><span class="self">self</span>).is_special(sid)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>is_dead(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool {
         (<span class="kw-2">**</span><span class="self">self</span>).is_dead(sid)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>is_match(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool {
         (<span class="kw-2">**</span><span class="self">self</span>).is_match(sid)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>is_start(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; bool {
         (<span class="kw-2">**</span><span class="self">self</span>).is_start(sid)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>match_kind(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; MatchKind {
         (<span class="kw-2">**</span><span class="self">self</span>).match_kind()
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>match_len(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID) -&gt; usize {
         (<span class="kw-2">**</span><span class="self">self</span>).match_len(sid)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>match_pattern(<span class="kw-2">&amp;</span><span class="self">self</span>, sid: StateID, index: usize) -&gt; PatternID {
         (<span class="kw-2">**</span><span class="self">self</span>).match_pattern(sid, index)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>patterns_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         (<span class="kw-2">**</span><span class="self">self</span>).patterns_len()
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>pattern_len(<span class="kw-2">&amp;</span><span class="self">self</span>, pid: PatternID) -&gt; usize {
         (<span class="kw-2">**</span><span class="self">self</span>).pattern_len(pid)
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>min_pattern_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         (<span class="kw-2">**</span><span class="self">self</span>).min_pattern_len()
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>max_pattern_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         (<span class="kw-2">**</span><span class="self">self</span>).max_pattern_len()
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>memory_usage(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         (<span class="kw-2">**</span><span class="self">self</span>).memory_usage()
     }

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>prefilter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>Prefilter&gt; {
         (<span class="kw-2">**</span><span class="self">self</span>).prefilter()
     }
 }

 <span class="doccomment">/// Represents the current state of an overlapping search.
 ///
 /// This is used for overlapping searches since they need to know something
 /// about the previous search. For example, when multiple patterns match at the
 /// same position, this state tracks the last reported pattern so that the next
 /// search knows whether to report another matching pattern or continue with
 /// the search at the next position. Additionally, it also tracks which state
 /// the last search call terminated in and the current offset of the search
 /// in the haystack.
 ///
 /// This type provides limited introspection capabilities. The only thing a
 /// caller can do is construct it and pass it around to permit search routines
 /// to use it to track state, and to ask whether a match has been found.
 ///
 /// Callers should always provide a fresh state constructed via
 /// [`OverlappingState::start`] when starting a new search. That same state
 /// should be reused for subsequent searches on the same `Input`. The state
 /// given will advance through the haystack itself. Callers can detect the end
 /// of a search when neither an error nor a match is returned.
 ///
 /// # Example
 ///
 /// This example shows how to manually iterate over all overlapping matches. If
 /// you need this, you might consider using
 /// [`AhoCorasick::find_overlapping_iter`](crate::AhoCorasick::find_overlapping_iter)
 /// instead, but this shows how to correctly use an `OverlappingState`.
 ///
 /// ```
 /// use aho_corasick::{
 ///     automaton::OverlappingState,
 ///     AhoCorasick, Input, Match,
 /// };
 ///
 /// let patterns = &amp;[&quot;append&quot;, &quot;appendage&quot;, &quot;app&quot;];
 /// let haystack = &quot;append the app to the appendage&quot;;
 ///
 /// let ac = AhoCorasick::new(patterns).unwrap();
 /// let mut state = OverlappingState::start();
 /// let mut matches = vec![];
 ///
 /// loop {
 ///     ac.find_overlapping(haystack, &amp;mut state);
 ///     let mat = match state.get_match() {
 ///         None =&gt; break,
 ///         Some(mat) =&gt; mat,
 ///     };
 ///     matches.push(mat);
 /// }
 /// let expected = vec![
 ///     Match::must(2, 0..3),
 ///     Match::must(0, 0..6),
 ///     Match::must(2, 11..14),
 ///     Match::must(2, 22..25),
 ///     Match::must(0, 22..28),
 ///     Match::must(1, 22..31),
 /// ];
 /// assert_eq!(expected, matches);
 /// ```
 </span><span class="attribute">#[derive(Clone, Debug)]
 </span><span class="kw">pub struct </span>OverlappingState {
     <span class="doccomment">/// The match reported by the most recent overlapping search to use this
     /// state.
     ///
     /// If a search does not find any matches, then it is expected to clear
     /// this value.
     </span>mat: <span class="prelude-ty">Option</span>&lt;Match&gt;,
     <span class="doccomment">/// The state ID of the state at which the search was in when the call
     /// terminated. When this is a match state, `last_match` must be set to a
     /// non-None value.
     ///
     /// A `None` value indicates the start state of the corresponding
     /// automaton. We cannot use the actual ID, since any one automaton may
     /// have many start states, and which one is in use depends on search-time
     /// factors (such as whether the search is anchored or not).
     </span>id: <span class="prelude-ty">Option</span>&lt;StateID&gt;,
     <span class="doccomment">/// The position of the search.
     ///
     /// When `id` is None (i.e., we are starting a search), this is set to
     /// the beginning of the search as given by the caller regardless of its
     /// current value. Subsequent calls to an overlapping search pick up at
     /// this offset.
     </span>at: usize,
     <span class="doccomment">/// The index into the matching patterns of the next match to report if the
     /// current state is a match state. Note that this may be 1 greater than
     /// the total number of matches to report for the current match state. (In
     /// which case, no more matches should be reported at the current position
     /// and the search should advance to the next position.)
     </span>next_match_index: <span class="prelude-ty">Option</span>&lt;usize&gt;,
 }

 <span class="kw">impl </span>OverlappingState {
     <span class="doccomment">/// Create a new overlapping state that begins at the start state.
     </span><span class="kw">pub fn </span>start() -&gt; OverlappingState {
         OverlappingState { mat: <span class="prelude-val">None</span>, id: <span class="prelude-val">None</span>, at: <span class="number">0</span>, next_match_index: <span class="prelude-val">None </span>}
     }

     <span class="doccomment">/// Return the match result of the most recent search to execute with this
     /// state.
     ///
     /// Every search will clear this result automatically, such that if no
     /// match is found, this will always correctly report `None`.
     </span><span class="kw">pub fn </span>get_match(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Match&gt; {
         <span class="self">self</span>.mat
     }
 }

 <span class="doccomment">/// An iterator of non-overlapping matches in a particular haystack.
 ///
 /// This iterator yields matches according to the [`MatchKind`] used by this
 /// automaton.
 ///
 /// This iterator is constructed via the [`Automaton::try_find_iter`] method.
 ///
 /// The type variable `A` refers to the implementation of the [`Automaton`]
 /// trait used to execute the search.
 ///
 /// The lifetime `&#39;a` refers to the lifetime of the [`Automaton`]
 /// implementation.
 ///
 /// The lifetime `&#39;h` refers to the lifetime of the haystack being searched.
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>FindIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A&gt; {
     <span class="doccomment">/// The automaton used to drive the search.
     </span>aut: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>A,
     <span class="doccomment">/// The input parameters to give to each search call.
     ///
     /// The start position of the search is mutated during iteration.
     </span>input: Input&lt;<span class="lifetime">&#39;h</span>&gt;,
     <span class="doccomment">/// Records the end offset of the most recent match. This is necessary to
     /// handle a corner case for preventing empty matches from overlapping with
     /// the ending bounds of a prior match.
     </span>last_match_end: <span class="prelude-ty">Option</span>&lt;usize&gt;,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A: Automaton&gt; FindIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A&gt; {
     <span class="doccomment">/// Creates a new non-overlapping iterator. If the given automaton would
     /// return an error on a search with the given input configuration, then
     /// that error is returned here.
     </span><span class="kw">fn </span>new(
         aut: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>A,
         input: Input&lt;<span class="lifetime">&#39;h</span>&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;FindIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A&gt;, MatchError&gt; {
         <span class="comment">// The only way this search can fail is if we cannot retrieve the start
         // state. e.g., Asking for an anchored search when only unanchored
         // searches are supported.
         </span><span class="kw">let _ </span>= aut.start_state(input.get_anchored())<span class="question-mark">?</span>;
         <span class="prelude-val">Ok</span>(FindIter { aut, input, last_match_end: <span class="prelude-val">None </span>})
     }

     <span class="doccomment">/// Executes a search and returns a match if one is found.
     ///
     /// This does not advance the input forward. It just executes a search
     /// based on the current configuration/offsets.
     </span><span class="kw">fn </span>search(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Match&gt; {
         <span class="comment">// The unwrap is OK here because we check at iterator construction time
         // that no subsequent search call (using the same configuration) will
         // ever return an error.
         </span><span class="self">self</span>.aut
             .try_find(<span class="kw-2">&amp;</span><span class="self">self</span>.input)
             .expect(<span class="string">&quot;already checked that no match error can occur&quot;</span>)
     }

     <span class="doccomment">/// Handles the special case of an empty match by ensuring that 1) the
     /// iterator always advances and 2) empty matches never overlap with other
     /// matches.
     ///
     /// (1) is necessary because we principally make progress by setting the
     /// starting location of the next search to the ending location of the last
     /// match. But if a match is empty, then this results in a search that does
     /// not advance and thus does not terminate.
     ///
     /// (2) is not strictly necessary, but makes intuitive sense and matches
     /// the presiding behavior of most general purpose regex engines.
     /// (Obviously this crate isn&#39;t a regex engine, but we choose to match
     /// their semantics.) The &quot;intuitive sense&quot; here is that we want to report
     /// NON-overlapping matches. So for example, given the patterns &#39;a&#39; and
     /// &#39;&#39; (an empty string) against the haystack &#39;a&#39;, without the special
     /// handling, you&#39;d get the matches [0, 1) and [1, 1), where the latter
     /// overlaps with the end bounds of the former.
     ///
     /// Note that we mark this cold and forcefully prevent inlining because
     /// handling empty matches like this is extremely rare and does require
     /// quite a bit of code, comparatively. Keeping this code out of the main
     /// iterator function keeps it smaller and more amenable to inlining
     /// itself.
     </span><span class="attribute">#[cold]
     #[inline(never)]
     </span><span class="kw">fn </span>handle_overlapping_empty_match(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         <span class="kw-2">mut </span>m: Match,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;Match&gt; {
         <span class="macro">assert!</span>(m.is_empty());
         <span class="kw">if </span><span class="prelude-val">Some</span>(m.end()) == <span class="self">self</span>.last_match_end {
             <span class="self">self</span>.input.set_start(<span class="self">self</span>.input.start().checked_add(<span class="number">1</span>).unwrap());
             m = <span class="self">self</span>.search()<span class="question-mark">?</span>;
         }
         <span class="prelude-val">Some</span>(m)
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A: Automaton&gt; Iterator <span class="kw">for </span>FindIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A&gt; {
     <span class="kw">type </span>Item = Match;

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Match&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>m = <span class="self">self</span>.search()<span class="question-mark">?</span>;
         <span class="kw">if </span>m.is_empty() {
             m = <span class="self">self</span>.handle_overlapping_empty_match(m)<span class="question-mark">?</span>;
         }
         <span class="self">self</span>.input.set_start(m.end());
         <span class="self">self</span>.last_match_end = <span class="prelude-val">Some</span>(m.end());
         <span class="prelude-val">Some</span>(m)
     }
 }

 <span class="doccomment">/// An iterator of overlapping matches in a particular haystack.
 ///
 /// This iterator will report all possible matches in a particular haystack,
 /// even when the matches overlap.
 ///
 /// This iterator is constructed via the
 /// [`Automaton::try_find_overlapping_iter`] method.
 ///
 /// The type variable `A` refers to the implementation of the [`Automaton`]
 /// trait used to execute the search.
 ///
 /// The lifetime `&#39;a` refers to the lifetime of the [`Automaton`]
 /// implementation.
 ///
 /// The lifetime `&#39;h` refers to the lifetime of the haystack being searched.
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>FindOverlappingIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A&gt; {
     aut: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>A,
     input: Input&lt;<span class="lifetime">&#39;h</span>&gt;,
     state: OverlappingState,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A: Automaton&gt; Iterator <span class="kw">for </span>FindOverlappingIter&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;h</span>, A&gt; {
     <span class="kw">type </span>Item = Match;

     <span class="attribute">#[inline(always)]
     </span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Match&gt; {
         <span class="self">self</span>.aut
             .try_find_overlapping(<span class="kw-2">&amp;</span><span class="self">self</span>.input, <span class="kw-2">&amp;mut </span><span class="self">self</span>.state)
             .expect(<span class="string">&quot;already checked that no match error can occur here&quot;</span>);
         <span class="self">self</span>.state.get_match()
     }
 }

 <span class="doccomment">/// An iterator that reports matches in a stream.
 ///
 /// This iterator yields elements of type `io::Result&lt;Match&gt;`, where an error
 /// is reported if there was a problem reading from the underlying stream.
 /// The iterator terminates only when the underlying stream reaches `EOF`.
 ///
 /// This iterator is constructed via the [`Automaton::try_stream_find_iter`]
 /// method.
 ///
 /// The type variable `A` refers to the implementation of the [`Automaton`]
 /// trait used to execute the search.
 ///
 /// The type variable `R` refers to the `io::Read` stream that is being read
 /// from.
 ///
 /// The lifetime `&#39;a` refers to the lifetime of the [`Automaton`]
 /// implementation.
 </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
 #[derive(Debug)]
 </span><span class="kw">pub struct </span>StreamFindIter&lt;<span class="lifetime">&#39;a</span>, A, R&gt; {
     it: StreamChunkIter&lt;<span class="lifetime">&#39;a</span>, A, R&gt;,
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
 </span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, A: Automaton, R: std::io::Read&gt; Iterator
     <span class="kw">for </span>StreamFindIter&lt;<span class="lifetime">&#39;a</span>, A, R&gt;
 {
     <span class="kw">type </span>Item = std::io::Result&lt;Match&gt;;

     <span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;std::io::Result&lt;Match&gt;&gt; {
         <span class="kw">loop </span>{
             <span class="kw">match </span><span class="self">self</span>.it.next() {
                 <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">None</span>,
                 <span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(err)) =&gt; <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(err)),
                 <span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(StreamChunk::NonMatch { .. })) =&gt; {}
                 <span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(StreamChunk::Match { mat, .. })) =&gt; {
                     <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(mat));
                 }
             }
         }
     }
 }

 <span class="doccomment">/// An iterator that reports matches in a stream.
 ///
 /// (This doesn&#39;t actually implement the `Iterator` trait because it returns
 /// something with a lifetime attached to a buffer it owns, but that&#39;s OK. It
 /// still has a `next` method and is iterator-like enough to be fine.)
 ///
 /// This iterator yields elements of type `io::Result&lt;StreamChunk&gt;`, where
 /// an error is reported if there was a problem reading from the underlying
 /// stream. The iterator terminates only when the underlying stream reaches
 /// `EOF`.
 ///
 /// The idea here is that each chunk represents either a match or a non-match,
 /// and if you concatenated all of the chunks together, you&#39;d reproduce the
 /// entire contents of the stream, byte-for-byte.
 ///
 /// This chunk machinery is a bit complicated and it isn&#39;t strictly required
 /// for a stream searcher that just reports matches. But we do need something
 /// like this to deal with the &quot;replacement&quot; API, which needs to know which
 /// chunks it can copy and which it needs to replace.
 </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
 #[derive(Debug)]
 </span><span class="kw">struct </span>StreamChunkIter&lt;<span class="lifetime">&#39;a</span>, A, R&gt; {
     <span class="doccomment">/// The underlying automaton to do the search.
     </span>aut: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>A,
     <span class="doccomment">/// The source of bytes we read from.
     </span>rdr: R,
     <span class="doccomment">/// A roll buffer for managing bytes from `rdr`. Basically, this is used
     /// to handle the case of a match that is split by two different
     /// calls to `rdr.read()`. This isn&#39;t strictly needed if all we needed to
     /// do was report matches, but here we are reporting chunks of non-matches
     /// and matches and in order to do that, we really just cannot treat our
     /// stream as non-overlapping blocks of bytes. We need to permit some
     /// overlap while we retain bytes from a previous `read` call in memory.
     </span>buf: <span class="kw">crate</span>::util::buffer::Buffer,
     <span class="doccomment">/// The unanchored starting state of this automaton.
     </span>start: StateID,
     <span class="doccomment">/// The state of the automaton.
     </span>sid: StateID,
     <span class="doccomment">/// The absolute position over the entire stream.
     </span>absolute_pos: usize,
     <span class="doccomment">/// The position we&#39;re currently at within `buf`.
     </span>buffer_pos: usize,
     <span class="doccomment">/// The buffer position of the end of the bytes that we last returned
     /// to the caller. Basically, whenever we find a match, we look to see if
     /// there is a difference between where the match started and the position
     /// of the last byte we returned to the caller. If there&#39;s a difference,
     /// then we need to return a &#39;NonMatch&#39; chunk.
     </span>buffer_reported_pos: usize,
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
 </span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, A: Automaton, R: std::io::Read&gt; StreamChunkIter&lt;<span class="lifetime">&#39;a</span>, A, R&gt; {
     <span class="kw">fn </span>new(
         aut: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>A,
         rdr: R,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;StreamChunkIter&lt;<span class="lifetime">&#39;a</span>, A, R&gt;, MatchError&gt; {
         <span class="comment">// This restriction is a carry-over from older versions of this crate.
         // I didn&#39;t have the bandwidth to think through how to handle, say,
         // leftmost-first or leftmost-longest matching, but... it should be
         // possible? The main problem is that once you see a match state in
         // leftmost-first semantics, you can&#39;t just stop at that point and
         // report a match. You have to keep going until you either hit a dead
         // state or EOF. So how do you know when you&#39;ll hit a dead state? Well,
         // you don&#39;t. With Aho-Corasick, I believe you can put a bound on it
         // and say, &quot;once a match has been seen, you&#39;ll need to scan forward at
         // most N bytes&quot; where N=aut.max_pattern_len().
         //
         // Which is fine, but it does mean that state about whether we&#39;re still
         // looking for a dead state or not needs to persist across buffer
         // refills. Which this code doesn&#39;t really handle. It does preserve
         // *some* state across buffer refills, basically ensuring that a match
         // span is always in memory.
         </span><span class="kw">if </span>!aut.match_kind().is_standard() {
             <span class="kw">return </span><span class="prelude-val">Err</span>(MatchError::unsupported_stream(aut.match_kind()));
         }
         <span class="comment">// This is kind of a cop-out, but empty matches are SUPER annoying.
         // If we know they can&#39;t happen (which is what we enforce here), then
         // it makes a lot of logic much simpler. With that said, I&#39;m open to
         // supporting this case, but we need to define proper semantics for it
         // first. It wasn&#39;t totally clear to me what it should do at the time
         // of writing, so I decided to just be conservative.
         //
         // It also seems like a very weird case to support anyway. Why search a
         // stream if you&#39;re just going to get a match at every position?
         //
         // ¯\_(ツ)_/¯
         </span><span class="kw">if </span>aut.min_pattern_len() == <span class="number">0 </span>{
             <span class="kw">return </span><span class="prelude-val">Err</span>(MatchError::unsupported_empty());
         }
         <span class="kw">let </span>start = aut.start_state(Anchored::No)<span class="question-mark">?</span>;
         <span class="prelude-val">Ok</span>(StreamChunkIter {
             aut,
             rdr,
             buf: <span class="kw">crate</span>::util::buffer::Buffer::new(aut.max_pattern_len()),
             start,
             sid: start,
             absolute_pos: <span class="number">0</span>,
             buffer_pos: <span class="number">0</span>,
             buffer_reported_pos: <span class="number">0</span>,
         })
     }

     <span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;std::io::Result&lt;StreamChunk&gt;&gt; {
         <span class="comment">// This code is pretty gnarly. It IS simpler than the equivalent code
         // in the previous aho-corasick release, in part because we inline
         // automaton traversal here and also in part because we have abdicated
         // support for automatons that contain an empty pattern.
         //
         // I suspect this code could be made a bit simpler by designing a
         // better buffer abstraction.
         //
         // But in general, this code is basically write-only. So you&#39;ll need
         // to go through it step-by-step to grok it. One of the key bits of
         // complexity is tracking a few different offsets. &#39;buffer_pos&#39; is
         // where we are in the buffer for search. &#39;buffer_reported_pos&#39; is the
         // position immediately following the last byte in the buffer that
         // we&#39;ve returned to the caller. And &#39;absolute_pos&#39; is the overall
         // current absolute position of the search in the entire stream, and
         // this is what match spans are reported in terms of.
         </span><span class="kw">loop </span>{
             <span class="kw">if </span><span class="self">self</span>.aut.is_match(<span class="self">self</span>.sid) {
                 <span class="kw">let </span>mat = <span class="self">self</span>.get_match();
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(r) = <span class="self">self</span>.get_non_match_chunk(mat) {
                     <span class="self">self</span>.buffer_reported_pos += r.len();
                     <span class="kw">let </span>bytes = <span class="kw-2">&amp;</span><span class="self">self</span>.buf.buffer()[r];
                     <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(StreamChunk::NonMatch { bytes }));
                 }
                 <span class="self">self</span>.sid = <span class="self">self</span>.start;
                 <span class="kw">let </span>r = <span class="self">self</span>.get_match_chunk(mat);
                 <span class="self">self</span>.buffer_reported_pos += r.len();
                 <span class="kw">let </span>bytes = <span class="kw-2">&amp;</span><span class="self">self</span>.buf.buffer()[r];
                 <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(StreamChunk::Match { bytes, mat }));
             }
             <span class="kw">if </span><span class="self">self</span>.buffer_pos &gt;= <span class="self">self</span>.buf.buffer().len() {
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(r) = <span class="self">self</span>.get_pre_roll_non_match_chunk() {
                     <span class="self">self</span>.buffer_reported_pos += r.len();
                     <span class="kw">let </span>bytes = <span class="kw-2">&amp;</span><span class="self">self</span>.buf.buffer()[r];
                     <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(StreamChunk::NonMatch { bytes }));
                 }
                 <span class="kw">if </span><span class="self">self</span>.buf.buffer().len() &gt;= <span class="self">self</span>.buf.min_buffer_len() {
                     <span class="self">self</span>.buffer_pos = <span class="self">self</span>.buf.min_buffer_len();
                     <span class="self">self</span>.buffer_reported_pos -=
                         <span class="self">self</span>.buf.buffer().len() - <span class="self">self</span>.buf.min_buffer_len();
                     <span class="self">self</span>.buf.roll();
                 }
                 <span class="kw">match </span><span class="self">self</span>.buf.fill(<span class="kw-2">&amp;mut </span><span class="self">self</span>.rdr) {
                     <span class="prelude-val">Err</span>(err) =&gt; <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(err)),
                     <span class="prelude-val">Ok</span>(<span class="bool-val">true</span>) =&gt; {}
                     <span class="prelude-val">Ok</span>(<span class="bool-val">false</span>) =&gt; {
                         <span class="comment">// We&#39;ve hit EOF, but if there are still some
                         // unreported bytes remaining, return them now.
                         </span><span class="kw">if let </span><span class="prelude-val">Some</span>(r) = <span class="self">self</span>.get_eof_non_match_chunk() {
                             <span class="self">self</span>.buffer_reported_pos += r.len();
                             <span class="kw">let </span>bytes = <span class="kw-2">&amp;</span><span class="self">self</span>.buf.buffer()[r];
                             <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(StreamChunk::NonMatch { bytes }));
                         }
                         <span class="comment">// We&#39;ve reported everything!
                         </span><span class="kw">return </span><span class="prelude-val">None</span>;
                     }
                 }
             }
             <span class="kw">let </span>start = <span class="self">self</span>.absolute_pos;
             <span class="kw">for </span><span class="kw-2">&amp;</span>byte <span class="kw">in </span><span class="self">self</span>.buf.buffer()[<span class="self">self</span>.buffer_pos..].iter() {
                 <span class="self">self</span>.sid = <span class="self">self</span>.aut.next_state(Anchored::No, <span class="self">self</span>.sid, byte);
                 <span class="self">self</span>.absolute_pos += <span class="number">1</span>;
                 <span class="kw">if </span><span class="self">self</span>.aut.is_match(<span class="self">self</span>.sid) {
                     <span class="kw">break</span>;
                 }
             }
             <span class="self">self</span>.buffer_pos += <span class="self">self</span>.absolute_pos - start;
         }
     }

     <span class="doccomment">/// Return a match chunk for the given match. It is assumed that the match
     /// ends at the current `buffer_pos`.
     </span><span class="kw">fn </span>get_match_chunk(<span class="kw-2">&amp;</span><span class="self">self</span>, mat: Match) -&gt; core::ops::Range&lt;usize&gt; {
         <span class="kw">let </span>start = <span class="self">self</span>.buffer_pos - mat.len();
         <span class="kw">let </span>end = <span class="self">self</span>.buffer_pos;
         start..end
     }

     <span class="doccomment">/// Return a non-match chunk, if necessary, just before reporting a match.
     /// This returns `None` if there is nothing to report. Otherwise, this
     /// assumes that the given match ends at the current `buffer_pos`.
     </span><span class="kw">fn </span>get_non_match_chunk(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         mat: Match,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;core::ops::Range&lt;usize&gt;&gt; {
         <span class="kw">let </span>buffer_mat_start = <span class="self">self</span>.buffer_pos - mat.len();
         <span class="kw">if </span>buffer_mat_start &gt; <span class="self">self</span>.buffer_reported_pos {
             <span class="kw">let </span>start = <span class="self">self</span>.buffer_reported_pos;
             <span class="kw">let </span>end = buffer_mat_start;
             <span class="kw">return </span><span class="prelude-val">Some</span>(start..end);
         }
         <span class="prelude-val">None
     </span>}

     <span class="doccomment">/// Look for any bytes that should be reported as a non-match just before
     /// rolling the buffer.
     ///
     /// Note that this only reports bytes up to `buffer.len() -
     /// min_buffer_len`, as it&#39;s not possible to know whether the bytes
     /// following that will participate in a match or not.
     </span><span class="kw">fn </span>get_pre_roll_non_match_chunk(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;core::ops::Range&lt;usize&gt;&gt; {
         <span class="kw">let </span>end =
             <span class="self">self</span>.buf.buffer().len().saturating_sub(<span class="self">self</span>.buf.min_buffer_len());
         <span class="kw">if </span><span class="self">self</span>.buffer_reported_pos &lt; end {
             <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="self">self</span>.buffer_reported_pos..end);
         }
         <span class="prelude-val">None
     </span>}

     <span class="doccomment">/// Return any unreported bytes as a non-match up to the end of the buffer.
     ///
     /// This should only be called when the entire contents of the buffer have
     /// been searched and EOF has been hit when trying to fill the buffer.
     </span><span class="kw">fn </span>get_eof_non_match_chunk(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;core::ops::Range&lt;usize&gt;&gt; {
         <span class="kw">if </span><span class="self">self</span>.buffer_reported_pos &lt; <span class="self">self</span>.buf.buffer().len() {
             <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="self">self</span>.buffer_reported_pos..<span class="self">self</span>.buf.buffer().len());
         }
         <span class="prelude-val">None
     </span>}

     <span class="doccomment">/// Return the match at the current position for the current state.
     ///
     /// This panics if `self.aut.is_match(self.sid)` isn&#39;t true.
     </span><span class="kw">fn </span>get_match(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Match {
         get_match(<span class="self">self</span>.aut, <span class="self">self</span>.sid, <span class="number">0</span>, <span class="self">self</span>.absolute_pos)
     }
 }

 <span class="doccomment">/// A single chunk yielded by the stream chunk iterator.
 ///
 /// The `&#39;r` lifetime refers to the lifetime of the stream chunk iterator.
 </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
 #[derive(Debug)]
 </span><span class="kw">enum </span>StreamChunk&lt;<span class="lifetime">&#39;r</span>&gt; {
     <span class="doccomment">/// A chunk that does not contain any matches.
     </span>NonMatch { bytes: <span class="kw-2">&amp;</span><span class="lifetime">&#39;r </span>[u8] },
     <span class="doccomment">/// A chunk that precisely contains a match.
     </span>Match { bytes: <span class="kw-2">&amp;</span><span class="lifetime">&#39;r </span>[u8], mat: Match },
 }

 <span class="attribute">#[inline(never)]
 </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>try_find_fwd&lt;A: Automaton + <span class="question-mark">?</span>Sized&gt;(
     aut: <span class="kw-2">&amp;</span>A,
     input: <span class="kw-2">&amp;</span>Input&lt;<span class="lifetime">&#39;_</span>&gt;,
 ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;Match&gt;, MatchError&gt; {
     <span class="kw">if </span>input.is_done() {
         <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>);
     }
     <span class="kw">let </span>earliest = aut.match_kind().is_standard() || input.get_earliest();
     <span class="kw">if </span>input.get_anchored().is_anchored() {
         try_find_fwd_imp(aut, input, <span class="prelude-val">None</span>, Anchored::Yes, earliest)
     } <span class="kw">else if let </span><span class="prelude-val">Some</span>(pre) = aut.prefilter() {
         <span class="kw">if </span>earliest {
             try_find_fwd_imp(aut, input, <span class="prelude-val">Some</span>(pre), Anchored::No, <span class="bool-val">true</span>)
         } <span class="kw">else </span>{
             try_find_fwd_imp(aut, input, <span class="prelude-val">Some</span>(pre), Anchored::No, <span class="bool-val">false</span>)
         }
     } <span class="kw">else </span>{
         <span class="kw">if </span>earliest {
             try_find_fwd_imp(aut, input, <span class="prelude-val">None</span>, Anchored::No, <span class="bool-val">true</span>)
         } <span class="kw">else </span>{
             try_find_fwd_imp(aut, input, <span class="prelude-val">None</span>, Anchored::No, <span class="bool-val">false</span>)
         }
     }
 }

 <span class="attribute">#[inline(always)]
 </span><span class="kw">fn </span>try_find_fwd_imp&lt;A: Automaton + <span class="question-mark">?</span>Sized&gt;(
     aut: <span class="kw-2">&amp;</span>A,
     input: <span class="kw-2">&amp;</span>Input&lt;<span class="lifetime">&#39;_</span>&gt;,
     pre: <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>Prefilter&gt;,
     anchored: Anchored,
     earliest: bool,
 ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;Match&gt;, MatchError&gt; {
     <span class="kw">let </span><span class="kw-2">mut </span>sid = aut.start_state(input.get_anchored())<span class="question-mark">?</span>;
     <span class="kw">let </span><span class="kw-2">mut </span>at = input.start();
     <span class="kw">let </span><span class="kw-2">mut </span>mat = <span class="prelude-val">None</span>;
     <span class="kw">if </span>aut.is_match(sid) {
         mat = <span class="prelude-val">Some</span>(get_match(aut, sid, <span class="number">0</span>, at));
         <span class="kw">if </span>earliest {
             <span class="kw">return </span><span class="prelude-val">Ok</span>(mat);
         }
     }
     <span class="kw">if let </span><span class="prelude-val">Some</span>(pre) = pre {
         <span class="kw">match </span>pre.find_in(input.haystack(), input.get_span()) {
             Candidate::None =&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>),
             Candidate::Match(m) =&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>(m)),
             Candidate::PossibleStartOfMatch(i) =&gt; {
                 at = i;
             }
         }
     }
     <span class="kw">while </span>at &lt; input.end() {
         <span class="comment">// I&#39;ve tried unrolling this loop and eliding bounds checks, but no
         // matter what I did, I could not observe a consistent improvement on
         // any benchmark I could devise. (If someone wants to re-litigate this,
         // the way to do it is to add an &#39;next_state_unchecked&#39; method to the
         // &#39;Automaton&#39; trait with a default impl that uses &#39;next_state&#39;. Then
         // use &#39;aut.next_state_unchecked&#39; here and implement it on DFA using
         // unchecked slice index acces.)
         </span>sid = aut.next_state(anchored, sid, input.haystack()[at]);
         <span class="kw">if </span>aut.is_special(sid) {
             <span class="kw">if </span>aut.is_dead(sid) {
                 <span class="kw">return </span><span class="prelude-val">Ok</span>(mat);
             } <span class="kw">else if </span>aut.is_match(sid) {
                 <span class="comment">// We use &#39;at + 1&#39; here because the match state is entered
                 // at the last byte of the pattern. Since we use half-open
                 // intervals, the end of the range of the match is one past the
                 // last byte.
                 </span><span class="kw">let </span>m = get_match(aut, sid, <span class="number">0</span>, at + <span class="number">1</span>);
                 <span class="comment">// For the automata in this crate, we make a size trade off
                 // where we reuse the same automaton for both anchored and
                 // unanchored searches. We achieve this, principally, by simply
                 // not following failure transitions while computing the next
                 // state. Instead, if we fail to find the next state, we return
                 // a dead state, which instructs the search to stop. (This
                 // is why &#39;next_state&#39; needs to know whether the search is
                 // anchored or not.) In addition, we have different start
                 // states for anchored and unanchored searches. The latter has
                 // a self-loop where as the former does not.
                 //
                 // In this way, we can use the same trie to execute both
                 // anchored and unanchored searches. There is a catch though.
                 // When building an Aho-Corasick automaton for unanchored
                 // searches, we copy matches from match states to other states
                 // (which would otherwise not be match states) if they are
                 // reachable via a failure transition. In the case of an
                 // anchored search, we *specifically* do not want to report
                 // these matches because they represent matches that start past
                 // the beginning of the search.
                 //
                 // Now we could tweak the automaton somehow to differentiate
                 // anchored from unanchored match states, but this would make
                 // &#39;aut.is_match&#39; and potentially &#39;aut.is_special&#39; slower. And
                 // also make the automaton itself more complex.
                 //
                 // Instead, we insert a special hack: if the search is
                 // anchored, we simply ignore matches that don&#39;t begin at
                 // the start of the search. This is not quite ideal, but we
                 // do specialize this function in such a way that unanchored
                 // searches don&#39;t pay for this additional branch. While this
                 // might cause a search to continue on for more than it
                 // otherwise optimally would, it will be no more than the
                 // longest pattern in the automaton. The reason for this is
                 // that we ensure we don&#39;t follow failure transitions during
                 // an anchored search. Combined with using a different anchored
                 // starting state with no self-loop, we guarantee that we&#39;ll
                 // at worst move through a number of transitions equal to the
                 // longest pattern.
                 //
                 // Now for DFAs, the whole point of them is to eliminate
                 // failure transitions entirely. So there is no way to say &quot;if
                 // it&#39;s an anchored search don&#39;t follow failure transitions.&quot;
                 // Instead, we actually have to build two entirely separate
                 // automatons into the transition table. One with failure
                 // transitions built into it and another that is effectively
                 // just an encoding of the base trie into a transition table.
                 // DFAs still need this check though, because the match states
                 // still carry matches only reachable via a failure transition.
                 // Why? Because removing them seems difficult, although I
                 // haven&#39;t given it a lot of thought.
                 </span><span class="kw">if </span>!(anchored.is_anchored() &amp;&amp; m.start() &gt; input.start()) {
                     mat = <span class="prelude-val">Some</span>(m);
                     <span class="kw">if </span>earliest {
                         <span class="kw">return </span><span class="prelude-val">Ok</span>(mat);
                     }
                 }
             } <span class="kw">else if let </span><span class="prelude-val">Some</span>(pre) = pre {
                 <span class="comment">// If we&#39;re here, we know it&#39;s a special state that is not a
                 // dead or a match state AND that a prefilter is active. Thus,
                 // it must be a start state.
                 </span><span class="macro">debug_assert!</span>(aut.is_start(sid));
                 <span class="comment">// We don&#39;t care about &#39;Candidate::Match&#39; here because if such
                 // a match were possible, it would have been returned above
                 // when we run the prefilter before walking the automaton.
                 </span><span class="kw">let </span>span = Span::from(at..input.end());
                 <span class="kw">match </span>pre.find_in(input.haystack(), span).into_option() {
                     <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>),
                     <span class="prelude-val">Some</span>(i) =&gt; {
                         <span class="kw">if </span>i &gt; at {
                             at = i;
                             <span class="kw">continue</span>;
                         }
                     }
                 }
             } <span class="kw">else </span>{
                 <span class="comment">// When pre.is_none(), then starting states should not be
                 // treated as special. That is, without a prefilter, is_special
                 // should only return true when the state is a dead or a match
                 // state.
                 //
                 // It is possible to execute a search without a prefilter even
                 // when the underlying searcher has one: an anchored search.
                 // But in this case, the automaton makes it impossible to move
                 // back to the start state by construction, and thus, we should
                 // never reach this branch.
                 </span><span class="macro">debug_assert!</span>(<span class="bool-val">false</span>, <span class="string">&quot;unreachable&quot;</span>);
             }
         }
         at += <span class="number">1</span>;
     }
     <span class="prelude-val">Ok</span>(mat)
 }

 <span class="attribute">#[inline(never)]
 </span><span class="kw">fn </span>try_find_overlapping_fwd&lt;A: Automaton + <span class="question-mark">?</span>Sized&gt;(
     aut: <span class="kw-2">&amp;</span>A,
     input: <span class="kw-2">&amp;</span>Input&lt;<span class="lifetime">&#39;_</span>&gt;,
     state: <span class="kw-2">&amp;mut </span>OverlappingState,
 ) -&gt; <span class="prelude-ty">Result</span>&lt;(), MatchError&gt; {
     state.mat = <span class="prelude-val">None</span>;
     <span class="kw">if </span>input.is_done() {
         <span class="kw">return </span><span class="prelude-val">Ok</span>(());
     }
     <span class="comment">// Searching with a pattern ID is always anchored, so we should only ever
     // use a prefilter when no pattern ID is given.
     </span><span class="kw">if </span>aut.prefilter().is_some() &amp;&amp; !input.get_anchored().is_anchored() {
         <span class="kw">let </span>pre = aut.prefilter().unwrap();
         try_find_overlapping_fwd_imp(aut, input, <span class="prelude-val">Some</span>(pre), state)
     } <span class="kw">else </span>{
         try_find_overlapping_fwd_imp(aut, input, <span class="prelude-val">None</span>, state)
     }
 }

 <span class="attribute">#[inline(always)]
 </span><span class="kw">fn </span>try_find_overlapping_fwd_imp&lt;A: Automaton + <span class="question-mark">?</span>Sized&gt;(
     aut: <span class="kw-2">&amp;</span>A,
     input: <span class="kw-2">&amp;</span>Input&lt;<span class="lifetime">&#39;_</span>&gt;,
     pre: <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>Prefilter&gt;,
     state: <span class="kw-2">&amp;mut </span>OverlappingState,
 ) -&gt; <span class="prelude-ty">Result</span>&lt;(), MatchError&gt; {
     <span class="kw">let </span><span class="kw-2">mut </span>sid = <span class="kw">match </span>state.id {
         <span class="prelude-val">None </span>=&gt; {
             <span class="kw">let </span>sid = aut.start_state(input.get_anchored())<span class="question-mark">?</span>;
             <span class="comment">// Handle the case where the start state is a match state. That is,
             // the empty string is in our automaton. We report every match we
             // can here before moving on and updating &#39;state.at&#39; and &#39;state.id&#39;
             // to find more matches in other parts of the haystack.
             </span><span class="kw">if </span>aut.is_match(sid) {
                 <span class="kw">let </span>i = state.next_match_index.unwrap_or(<span class="number">0</span>);
                 <span class="kw">let </span>len = aut.match_len(sid);
                 <span class="kw">if </span>i &lt; len {
                     state.next_match_index = <span class="prelude-val">Some</span>(i + <span class="number">1</span>);
                     state.mat = <span class="prelude-val">Some</span>(get_match(aut, sid, i, input.start()));
                     <span class="kw">return </span><span class="prelude-val">Ok</span>(());
                 }
             }
             state.at = input.start();
             state.id = <span class="prelude-val">Some</span>(sid);
             state.next_match_index = <span class="prelude-val">None</span>;
             state.mat = <span class="prelude-val">None</span>;
             sid
         }
         <span class="prelude-val">Some</span>(sid) =&gt; {
             <span class="comment">// If we still have matches left to report in this state then
             // report them until we&#39;ve exhausted them. Only after that do we
             // advance to the next offset in the haystack.
             </span><span class="kw">if let </span><span class="prelude-val">Some</span>(i) = state.next_match_index {
                 <span class="kw">let </span>len = aut.match_len(sid);
                 <span class="kw">if </span>i &lt; len {
                     state.next_match_index = <span class="prelude-val">Some</span>(i + <span class="number">1</span>);
                     state.mat = <span class="prelude-val">Some</span>(get_match(aut, sid, i, state.at + <span class="number">1</span>));
                     <span class="kw">return </span><span class="prelude-val">Ok</span>(());
                 }
                 <span class="comment">// Once we&#39;ve reported all matches at a given position, we need
                 // to advance the search to the next position.
                 </span>state.at += <span class="number">1</span>;
                 state.next_match_index = <span class="prelude-val">None</span>;
                 state.mat = <span class="prelude-val">None</span>;
             }
             sid
         }
     };
     <span class="kw">while </span>state.at &lt; input.end() {
         sid = aut.next_state(
             input.get_anchored(),
             sid,
             input.haystack()[state.at],
         );
         <span class="kw">if </span>aut.is_special(sid) {
             state.id = <span class="prelude-val">Some</span>(sid);
             <span class="kw">if </span>aut.is_dead(sid) {
                 <span class="kw">return </span><span class="prelude-val">Ok</span>(());
             } <span class="kw">else if </span>aut.is_match(sid) {
                 state.next_match_index = <span class="prelude-val">Some</span>(<span class="number">1</span>);
                 state.mat = <span class="prelude-val">Some</span>(get_match(aut, sid, <span class="number">0</span>, state.at + <span class="number">1</span>));
                 <span class="kw">return </span><span class="prelude-val">Ok</span>(());
             } <span class="kw">else if let </span><span class="prelude-val">Some</span>(pre) = pre {
                 <span class="comment">// If we&#39;re here, we know it&#39;s a special state that is not a
                 // dead or a match state AND that a prefilter is active. Thus,
                 // it must be a start state.
                 </span><span class="macro">debug_assert!</span>(aut.is_start(sid));
                 <span class="kw">let </span>span = Span::from(state.at..input.end());
                 <span class="kw">match </span>pre.find_in(input.haystack(), span).into_option() {
                     <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(()),
                     <span class="prelude-val">Some</span>(i) =&gt; {
                         <span class="kw">if </span>i &gt; state.at {
                             state.at = i;
                             <span class="kw">continue</span>;
                         }
                     }
                 }
             } <span class="kw">else </span>{
                 <span class="comment">// When pre.is_none(), then starting states should not be
                 // treated as special. That is, without a prefilter, is_special
                 // should only return true when the state is a dead or a match
                 // state.
                 //
                 // ... except for one special case: in stream searching, we
                 // currently call overlapping search with a &#39;None&#39; prefilter,
                 // regardless of whether one exists or not, because stream
                 // searching can&#39;t currently deal with prefilters correctly in
                 // all cases.
             </span>}
         }
         state.at += <span class="number">1</span>;
     }
     state.id = <span class="prelude-val">Some</span>(sid);
     <span class="prelude-val">Ok</span>(())
 }

 <span class="attribute">#[inline(always)]
 </span><span class="kw">fn </span>get_match&lt;A: Automaton + <span class="question-mark">?</span>Sized&gt;(
     aut: <span class="kw-2">&amp;</span>A,
     sid: StateID,
     index: usize,
     at: usize,
 ) -&gt; Match {
     <span class="kw">let </span>pid = aut.match_pattern(sid, index);
     <span class="kw">let </span>len = aut.pattern_len(pid);
     Match::new(pid, (at - len)..at)
 }

 <span class="doccomment">/// Write a prefix &quot;state&quot; indicator for fmt::Debug impls. It always writes
 /// exactly two printable bytes to the given formatter.
 ///
 /// Specifically, this tries to succinctly distinguish the different types of
 /// states: dead states, start states and match states. It even accounts for
 /// the possible overlappings of different state types. (The only possible
 /// overlapping is that of match and start states.)
 </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>fmt_state_indicator&lt;A: Automaton&gt;(
     f: <span class="kw-2">&amp;mut </span>core::fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;,
     aut: A,
     id: StateID,
 ) -&gt; core::fmt::Result {
     <span class="kw">if </span>aut.is_dead(id) {
         <span class="macro">write!</span>(f, <span class="string">&quot;D &quot;</span>)<span class="question-mark">?</span>;
     } <span class="kw">else if </span>aut.is_match(id) {
         <span class="kw">if </span>aut.is_start(id) {
             <span class="macro">write!</span>(f, <span class="string">&quot;*&gt;&quot;</span>)<span class="question-mark">?</span>;
         } <span class="kw">else </span>{
             <span class="macro">write!</span>(f, <span class="string">&quot;* &quot;</span>)<span class="question-mark">?</span>;
         }
     } <span class="kw">else if </span>aut.is_start(id) {
         <span class="macro">write!</span>(f, <span class="string">&quot; &gt;&quot;</span>)<span class="question-mark">?</span>;
     } <span class="kw">else </span>{
         <span class="macro">write!</span>(f, <span class="string">&quot;  &quot;</span>)<span class="question-mark">?</span>;
     }
     <span class="prelude-val">Ok</span>(())
 }

 <span class="doccomment">/// Return an iterator of transitions in a sparse format given an iterator
 /// of all explicitly defined transitions. The iterator yields ranges of
 /// transitions, such that any adjacent transitions mapped to the same
 /// state are combined into a single range.
 </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>sparse_transitions&lt;<span class="lifetime">&#39;a</span>&gt;(
     <span class="kw-2">mut </span>it: <span class="kw">impl </span>Iterator&lt;Item = (u8, StateID)&gt; + <span class="lifetime">&#39;a</span>,
 ) -&gt; <span class="kw">impl </span>Iterator&lt;Item = (u8, u8, StateID)&gt; + <span class="lifetime">&#39;a </span>{
     <span class="kw">let </span><span class="kw-2">mut </span>cur: <span class="prelude-ty">Option</span>&lt;(u8, u8, StateID)&gt; = <span class="prelude-val">None</span>;
     core::iter::from_fn(<span class="kw">move </span>|| {
         <span class="kw">while let </span><span class="prelude-val">Some</span>((class, next)) = it.next() {
             <span class="kw">let </span>(prev_start, prev_end, prev_next) = <span class="kw">match </span>cur {
                 <span class="prelude-val">Some</span>(x) =&gt; x,
                 <span class="prelude-val">None </span>=&gt; {
                     cur = <span class="prelude-val">Some</span>((class, class, next));
                     <span class="kw">continue</span>;
                 }
             };
             <span class="kw">if </span>prev_next == next {
                 cur = <span class="prelude-val">Some</span>((prev_start, class, prev_next));
             } <span class="kw">else </span>{
                 cur = <span class="prelude-val">Some</span>((class, class, next));
                 <span class="kw">return </span><span class="prelude-val">Some</span>((prev_start, prev_end, prev_next));
             }
         }
         <span class="kw">if let </span><span class="prelude-val">Some</span>((start, end, next)) = cur.take() {
             <span class="kw">return </span><span class="prelude-val">Some</span>((start, end, next));
         }
         <span class="prelude-val">None
     </span>})
 }
 </code></pre></div>
 </section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="aho_corasick" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>