api-docs/crates-enclave/src/regex/exec.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/regex-1.8.3/src/exec.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>exec.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="../../regex/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="../../regex/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>
 <span id="1609">1609</span>
 <span id="1610">1610</span>
 <span id="1611">1611</span>
 <span id="1612">1612</span>
 <span id="1613">1613</span>
 <span id="1614">1614</span>
 <span id="1615">1615</span>
 <span id="1616">1616</span>
 <span id="1617">1617</span>
 <span id="1618">1618</span>
 <span id="1619">1619</span>
 <span id="1620">1620</span>
 <span id="1621">1621</span>
 <span id="1622">1622</span>
 <span id="1623">1623</span>
 <span id="1624">1624</span>
 <span id="1625">1625</span>
 <span id="1626">1626</span>
 <span id="1627">1627</span>
 <span id="1628">1628</span>
 <span id="1629">1629</span>
 <span id="1630">1630</span>
 <span id="1631">1631</span>
 <span id="1632">1632</span>
 <span id="1633">1633</span>
 <span id="1634">1634</span>
 <span id="1635">1635</span>
 <span id="1636">1636</span>
 <span id="1637">1637</span>
 <span id="1638">1638</span>
 <span id="1639">1639</span>
 <span id="1640">1640</span>
 <span id="1641">1641</span>
 <span id="1642">1642</span>
 <span id="1643">1643</span>
 <span id="1644">1644</span>
 <span id="1645">1645</span>
 <span id="1646">1646</span>
 <span id="1647">1647</span>
 <span id="1648">1648</span>
 <span id="1649">1649</span>
 <span id="1650">1650</span>
 <span id="1651">1651</span>
 <span id="1652">1652</span>
 <span id="1653">1653</span>
 <span id="1654">1654</span>
 <span id="1655">1655</span>
 <span id="1656">1656</span>
 <span id="1657">1657</span>
 <span id="1658">1658</span>
 <span id="1659">1659</span>
 <span id="1660">1660</span>
 <span id="1661">1661</span>
 <span id="1662">1662</span>
 <span id="1663">1663</span>
 <span id="1664">1664</span>
 <span id="1665">1665</span>
 <span id="1666">1666</span>
 <span id="1667">1667</span>
 <span id="1668">1668</span>
 <span id="1669">1669</span>
 <span id="1670">1670</span>
 <span id="1671">1671</span>
 <span id="1672">1672</span>
 <span id="1673">1673</span>
 <span id="1674">1674</span>
 <span id="1675">1675</span>
 <span id="1676">1676</span>
 <span id="1677">1677</span>
 <span id="1678">1678</span>
 <span id="1679">1679</span>
 <span id="1680">1680</span>
 <span id="1681">1681</span>
 <span id="1682">1682</span>
 <span id="1683">1683</span>
 <span id="1684">1684</span>
 <span id="1685">1685</span>
 <span id="1686">1686</span>
 <span id="1687">1687</span>
 <span id="1688">1688</span>
 <span id="1689">1689</span>
 <span id="1690">1690</span>
 <span id="1691">1691</span>
 <span id="1692">1692</span>
 <span id="1693">1693</span>
 <span id="1694">1694</span>
 <span id="1695">1695</span>
 <span id="1696">1696</span>
 <span id="1697">1697</span>
 <span id="1698">1698</span>
 <span id="1699">1699</span>
 <span id="1700">1700</span>
 <span id="1701">1701</span>
 <span id="1702">1702</span>
 <span id="1703">1703</span>
 <span id="1704">1704</span>
 <span id="1705">1705</span>
 <span id="1706">1706</span>
 <span id="1707">1707</span>
 <span id="1708">1708</span>
 <span id="1709">1709</span>
 <span id="1710">1710</span>
 <span id="1711">1711</span>
 <span id="1712">1712</span>
 <span id="1713">1713</span>
 <span id="1714">1714</span>
 <span id="1715">1715</span>
 <span id="1716">1716</span>
 <span id="1717">1717</span>
 <span id="1718">1718</span>
 <span id="1719">1719</span>
 <span id="1720">1720</span>
 <span id="1721">1721</span>
 <span id="1722">1722</span>
 <span id="1723">1723</span>
 <span id="1724">1724</span>
 <span id="1725">1725</span>
 <span id="1726">1726</span>
 <span id="1727">1727</span>
 <span id="1728">1728</span>
 <span id="1729">1729</span>
 <span id="1730">1730</span>
 <span id="1731">1731</span>
 <span id="1732">1732</span>
 <span id="1733">1733</span>
 <span id="1734">1734</span>
 <span id="1735">1735</span>
 <span id="1736">1736</span>
 <span id="1737">1737</span>
 <span id="1738">1738</span>
 <span id="1739">1739</span>
 <span id="1740">1740</span>
 <span id="1741">1741</span>
 <span id="1742">1742</span>
 <span id="1743">1743</span>
 <span id="1744">1744</span>
 <span id="1745">1745</span>
 <span id="1746">1746</span>
 <span id="1747">1747</span>
 <span id="1748">1748</span>
 <span id="1749">1749</span>
 <span id="1750">1750</span>
 <span id="1751">1751</span>
 <span id="1752">1752</span>
 <span id="1753">1753</span>
 <span id="1754">1754</span>
 <span id="1755">1755</span>
 <span id="1756">1756</span>
 <span id="1757">1757</span>
 <span id="1758">1758</span>
 <span id="1759">1759</span>
 </pre><pre class="rust"><code><span class="kw">use </span>std::cell::RefCell;
 <span class="kw">use </span>std::collections::HashMap;
 <span class="kw">use </span>std::panic::AssertUnwindSafe;
 <span class="kw">use </span>std::sync::Arc;

 <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
 </span><span class="kw">use </span>aho_corasick::{AhoCorasick, MatchKind};
 <span class="kw">use </span>regex_syntax::hir::literal;
 <span class="kw">use </span>regex_syntax::hir::{Hir, Look};
 <span class="kw">use </span>regex_syntax::ParserBuilder;

 <span class="kw">use </span><span class="kw">crate</span>::backtrack;
 <span class="kw">use </span><span class="kw">crate</span>::compile::Compiler;
 <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
 </span><span class="kw">use </span><span class="kw">crate</span>::dfa;
 <span class="kw">use </span><span class="kw">crate</span>::error::Error;
 <span class="kw">use </span><span class="kw">crate</span>::input::{ByteInput, CharInput};
 <span class="kw">use </span><span class="kw">crate</span>::literal::LiteralSearcher;
 <span class="kw">use </span><span class="kw">crate</span>::pikevm;
 <span class="kw">use </span><span class="kw">crate</span>::pool::{Pool, PoolGuard};
 <span class="kw">use </span><span class="kw">crate</span>::prog::Program;
 <span class="kw">use </span><span class="kw">crate</span>::re_builder::RegexOptions;
 <span class="kw">use </span><span class="kw">crate</span>::re_bytes;
 <span class="kw">use </span><span class="kw">crate</span>::re_set;
 <span class="kw">use </span><span class="kw">crate</span>::re_trait::{Locations, RegularExpression, Slot};
 <span class="kw">use </span><span class="kw">crate</span>::re_unicode;
 <span class="kw">use </span><span class="kw">crate</span>::utf8::next_utf8;

 <span class="doccomment">/// `Exec` manages the execution of a regular expression.
 ///
 /// In particular, this manages the various compiled forms of a single regular
 /// expression and the choice of which matching engine to use to execute a
 /// regular expression.
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>Exec {
     <span class="doccomment">/// All read only state.
     </span>ro: Arc&lt;ExecReadOnly&gt;,
     <span class="doccomment">/// A pool of reusable values for the various matching engines.
     ///
     /// Note that boxing this value is not strictly necessary, but it is an
     /// easy way to ensure that T does not bloat the stack sized used by a pool
     /// in the case where T is big. And this turns out to be the case at the
     /// time of writing for regex&#39;s use of this pool. At the time of writing,
     /// the size of a Regex on the stack is 856 bytes. Boxing this value
     /// reduces that size to 16 bytes.
     </span>pool: Box&lt;Pool&lt;ProgramCache&gt;&gt;,
 }

 <span class="doccomment">/// `ExecNoSync` is like `Exec`, except it embeds a reference to a cache. This
 /// means it is no longer Sync, but we can now avoid the overhead of
 /// synchronization to fetch the cache.
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>ExecNoSync&lt;<span class="lifetime">&#39;c</span>&gt; {
     <span class="doccomment">/// All read only state.
     </span>ro: <span class="kw-2">&amp;</span><span class="lifetime">&#39;c </span>Arc&lt;ExecReadOnly&gt;,
     <span class="doccomment">/// Caches for the various matching engines.
     </span>cache: PoolGuard&lt;<span class="lifetime">&#39;c</span>, ProgramCache&gt;,
 }

 <span class="doccomment">/// `ExecNoSyncStr` is like `ExecNoSync`, but matches on &amp;str instead of &amp;[u8].
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>ExecNoSyncStr&lt;<span class="lifetime">&#39;c</span>&gt;(ExecNoSync&lt;<span class="lifetime">&#39;c</span>&gt;);

 <span class="doccomment">/// `ExecReadOnly` comprises all read only state for a regex. Namely, all such
 /// state is determined at compile time and never changes during search.
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">struct </span>ExecReadOnly {
     <span class="doccomment">/// The original regular expressions given by the caller to compile.
     </span>res: Vec&lt;String&gt;,
     <span class="doccomment">/// A compiled program that is used in the NFA simulation and backtracking.
     /// It can be byte-based or Unicode codepoint based.
     ///
     /// N.B. It is not possibly to make this byte-based from the public API.
     /// It is only used for testing byte based programs in the NFA simulations.
     </span>nfa: Program,
     <span class="doccomment">/// A compiled byte based program for DFA execution. This is only used
     /// if a DFA can be executed. (Currently, only word boundary assertions are
     /// not supported.) Note that this program contains an embedded `.*?`
     /// preceding the first capture group, unless the regex is anchored at the
     /// beginning.
     </span><span class="attribute">#[allow(dead_code)]
     </span>dfa: Program,
     <span class="doccomment">/// The same as above, except the program is reversed (and there is no
     /// preceding `.*?`). This is used by the DFA to find the starting location
     /// of matches.
     </span><span class="attribute">#[allow(dead_code)]
     </span>dfa_reverse: Program,
     <span class="doccomment">/// A set of suffix literals extracted from the regex.
     ///
     /// Prefix literals are stored on the `Program`, since they are used inside
     /// the matching engines.
     </span><span class="attribute">#[allow(dead_code)]
     </span>suffixes: LiteralSearcher,
     <span class="doccomment">/// An Aho-Corasick automaton with leftmost-first match semantics.
     ///
     /// This is only set when the entire regex is a simple unanchored
     /// alternation of literals. We could probably use it more circumstances,
     /// but this is already hacky enough in this architecture.
     ///
     /// N.B. We use u32 as a state ID representation under the assumption that
     /// if we were to exhaust the ID space, we probably would have long
     /// surpassed the compilation size limit.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
     </span>ac: <span class="prelude-ty">Option</span>&lt;AhoCorasick&gt;,
     <span class="doccomment">/// match_type encodes as much upfront knowledge about how we&#39;re going to
     /// execute a search as possible.
     </span>match_type: MatchType,
 }

 <span class="doccomment">/// Facilitates the construction of an executor by exposing various knobs
 /// to control how a regex is executed and what kinds of resources it&#39;s
 /// permitted to use.
 </span><span class="comment">// `ExecBuilder` is only public via the `internal` module, so avoid deriving
 // `Debug`.
 </span><span class="attribute">#[allow(missing_debug_implementations)]
 </span><span class="kw">pub struct </span>ExecBuilder {
     options: RegexOptions,
     match_type: <span class="prelude-ty">Option</span>&lt;MatchType&gt;,
     bytes: bool,
     only_utf8: bool,
 }

 <span class="doccomment">/// Parsed represents a set of parsed regular expressions and their detected
 /// literals.
 </span><span class="kw">struct </span>Parsed {
     exprs: Vec&lt;Hir&gt;,
     prefixes: literal::Seq,
     suffixes: literal::Seq,
     bytes: bool,
 }

 <span class="kw">impl </span>ExecBuilder {
     <span class="doccomment">/// Create a regex execution builder.
     ///
     /// This uses default settings for everything except the regex itself,
     /// which must be provided. Further knobs can be set by calling methods,
     /// and then finally, `build` to actually create the executor.
     </span><span class="kw">pub fn </span>new(re: <span class="kw-2">&amp;</span>str) -&gt; <span class="self">Self </span>{
         <span class="self">Self</span>::new_many(<span class="kw-2">&amp;</span>[re])
     }

     <span class="doccomment">/// Like new, but compiles the union of the given regular expressions.
     ///
     /// Note that when compiling 2 or more regular expressions, capture groups
     /// are completely unsupported. (This means both `find` and `captures`
     /// won&#39;t work.)
     </span><span class="kw">pub fn </span>new_many&lt;I, S&gt;(res: I) -&gt; <span class="self">Self
     </span><span class="kw">where
         </span>S: AsRef&lt;str&gt;,
         I: IntoIterator&lt;Item = S&gt;,
     {
         <span class="kw">let </span><span class="kw-2">mut </span>opts = RegexOptions::default();
         opts.pats = res.into_iter().map(|s| s.as_ref().to_owned()).collect();
         <span class="self">Self</span>::new_options(opts)
     }

     <span class="doccomment">/// Create a regex execution builder.
     </span><span class="kw">pub fn </span>new_options(opts: RegexOptions) -&gt; <span class="self">Self </span>{
         ExecBuilder {
             options: opts,
             match_type: <span class="prelude-val">None</span>,
             bytes: <span class="bool-val">false</span>,
             only_utf8: <span class="bool-val">true</span>,
         }
     }

     <span class="doccomment">/// Set the matching engine to be automatically determined.
     ///
     /// This is the default state and will apply whatever optimizations are
     /// possible, such as running a DFA.
     ///
     /// This overrides whatever was previously set via the `nfa` or
     /// `bounded_backtracking` methods.
     </span><span class="kw">pub fn </span>automatic(<span class="kw-2">mut </span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="self">self</span>.match_type = <span class="prelude-val">None</span>;
         <span class="self">self
     </span>}

     <span class="doccomment">/// Sets the matching engine to use the NFA algorithm no matter what
     /// optimizations are possible.
     ///
     /// This overrides whatever was previously set via the `automatic` or
     /// `bounded_backtracking` methods.
     </span><span class="kw">pub fn </span>nfa(<span class="kw-2">mut </span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="self">self</span>.match_type = <span class="prelude-val">Some</span>(MatchType::Nfa(MatchNfaType::PikeVM));
         <span class="self">self
     </span>}

     <span class="doccomment">/// Sets the matching engine to use a bounded backtracking engine no
     /// matter what optimizations are possible.
     ///
     /// One must use this with care, since the bounded backtracking engine
     /// uses memory proportion to `len(regex) * len(text)`.
     ///
     /// This overrides whatever was previously set via the `automatic` or
     /// `nfa` methods.
     </span><span class="kw">pub fn </span>bounded_backtracking(<span class="kw-2">mut </span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="self">self</span>.match_type = <span class="prelude-val">Some</span>(MatchType::Nfa(MatchNfaType::Backtrack));
         <span class="self">self
     </span>}

     <span class="doccomment">/// Compiles byte based programs for use with the NFA matching engines.
     ///
     /// By default, the NFA engines match on Unicode scalar values. They can
     /// be made to use byte based programs instead. In general, the byte based
     /// programs are slower because of a less efficient encoding of character
     /// classes.
     ///
     /// Note that this does not impact DFA matching engines, which always
     /// execute on bytes.
     </span><span class="kw">pub fn </span>bytes(<span class="kw-2">mut </span><span class="self">self</span>, yes: bool) -&gt; <span class="self">Self </span>{
         <span class="self">self</span>.bytes = yes;
         <span class="self">self
     </span>}

     <span class="doccomment">/// When disabled, the program compiled may match arbitrary bytes.
     ///
     /// When enabled (the default), all compiled programs exclusively match
     /// valid UTF-8 bytes.
     </span><span class="kw">pub fn </span>only_utf8(<span class="kw-2">mut </span><span class="self">self</span>, yes: bool) -&gt; <span class="self">Self </span>{
         <span class="self">self</span>.only_utf8 = yes;
         <span class="self">self
     </span>}

     <span class="doccomment">/// Set the Unicode flag.
     </span><span class="kw">pub fn </span>unicode(<span class="kw-2">mut </span><span class="self">self</span>, yes: bool) -&gt; <span class="self">Self </span>{
         <span class="self">self</span>.options.unicode = yes;
         <span class="self">self
     </span>}

     <span class="doccomment">/// Parse the current set of patterns into their AST and extract literals.
     </span><span class="kw">fn </span>parse(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;Parsed, Error&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>exprs = Vec::with_capacity(<span class="self">self</span>.options.pats.len());
         <span class="kw">let </span><span class="kw-2">mut </span>prefixes = <span class="prelude-val">Some</span>(literal::Seq::empty());
         <span class="kw">let </span><span class="kw-2">mut </span>suffixes = <span class="prelude-val">Some</span>(literal::Seq::empty());
         <span class="kw">let </span><span class="kw-2">mut </span>bytes = <span class="bool-val">false</span>;
         <span class="kw">let </span>is_set = <span class="self">self</span>.options.pats.len() &gt; <span class="number">1</span>;
         <span class="comment">// If we&#39;re compiling a regex set and that set has any anchored
         // expressions, then disable all literal optimizations.
         </span><span class="kw">for </span>pat <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.options.pats {
             <span class="kw">let </span><span class="kw-2">mut </span>parser = ParserBuilder::new()
                 .octal(<span class="self">self</span>.options.octal)
                 .case_insensitive(<span class="self">self</span>.options.case_insensitive)
                 .multi_line(<span class="self">self</span>.options.multi_line)
                 .dot_matches_new_line(<span class="self">self</span>.options.dot_matches_new_line)
                 .swap_greed(<span class="self">self</span>.options.swap_greed)
                 .ignore_whitespace(<span class="self">self</span>.options.ignore_whitespace)
                 .unicode(<span class="self">self</span>.options.unicode)
                 .utf8(<span class="self">self</span>.only_utf8)
                 .nest_limit(<span class="self">self</span>.options.nest_limit)
                 .build();
             <span class="kw">let </span>expr =
                 parser.parse(pat).map_err(|e| Error::Syntax(e.to_string()))<span class="question-mark">?</span>;
             <span class="kw">let </span>props = expr.properties();
             <span class="comment">// This used to just check whether the HIR matched valid UTF-8
             // or not, but in regex-syntax 0.7, we changed our definition of
             // &quot;matches valid UTF-8&quot; to exclude zero-width matches. And in
             // particular, previously, we considered WordAsciiNegate (that
             // is &#39;(?-u:\B)&#39;) to be capable of matching invalid UTF-8. Our
             // matcher engines were built under this assumption and fixing
             // them is not worth it with the imminent plan to switch over to
             // regex-automata. So for now, we retain the previous behavior by
             // just explicitly treating the presence of a negated ASCII word
             // boundary as forcing use to use a byte oriented automaton.
             </span>bytes = bytes
                 || !props.is_utf8()
                 || props.look_set().contains(Look::WordAsciiNegate);

             <span class="kw">if </span><span class="macro">cfg!</span>(feature = <span class="string">&quot;perf-literal&quot;</span>) {
                 <span class="kw">if </span>!props.look_set_prefix().contains(Look::Start)
                     &amp;&amp; props.look_set().contains(Look::Start)
                 {
                     <span class="comment">// Partial anchors unfortunately make it hard to use
                     // prefixes, so disable them.
                     </span>prefixes = <span class="prelude-val">None</span>;
                 } <span class="kw">else if </span>is_set
                     &amp;&amp; props.look_set_prefix_any().contains(Look::Start)
                 {
                     <span class="comment">// Regex sets with anchors do not go well with literal
                     // optimizations.
                     </span>prefixes = <span class="prelude-val">None</span>;
                 } <span class="kw">else if </span>props.look_set_prefix_any().contains_word() {
                     <span class="comment">// The new literal extractor ignores look-around while
                     // the old one refused to extract prefixes from regexes
                     // that began with a \b. These old creaky regex internals
                     // can&#39;t deal with it, so we drop it.
                     </span>prefixes = <span class="prelude-val">None</span>;
                 } <span class="kw">else if </span>props.look_set_prefix_any().contains(Look::StartLF) {
                     <span class="comment">// Similar to the reasoning for word boundaries, this old
                     // regex engine can&#39;t handle literal prefixes with &#39;(?m:^)&#39;
                     // at the beginning of a regex.
                     </span>prefixes = <span class="prelude-val">None</span>;
                 }

                 <span class="kw">if </span>!props.look_set_suffix().contains(Look::End)
                     &amp;&amp; props.look_set().contains(Look::End)
                 {
                     <span class="comment">// Partial anchors unfortunately make it hard to use
                     // suffixes, so disable them.
                     </span>suffixes = <span class="prelude-val">None</span>;
                 } <span class="kw">else if </span>is_set
                     &amp;&amp; props.look_set_suffix_any().contains(Look::End)
                 {
                     <span class="comment">// Regex sets with anchors do not go well with literal
                     // optimizations.
                     </span>suffixes = <span class="prelude-val">None</span>;
                 } <span class="kw">else if </span>props.look_set_suffix_any().contains_word() {
                     <span class="comment">// See the prefix case for reasoning here.
                     </span>suffixes = <span class="prelude-val">None</span>;
                 } <span class="kw">else if </span>props.look_set_suffix_any().contains(Look::EndLF) {
                     <span class="comment">// See the prefix case for reasoning here.
                     </span>suffixes = <span class="prelude-val">None</span>;
                 }

                 <span class="kw">let </span>(<span class="kw-2">mut </span>pres, <span class="kw-2">mut </span>suffs) =
                     <span class="kw">if </span>prefixes.is_none() &amp;&amp; suffixes.is_none() {
                         (literal::Seq::infinite(), literal::Seq::infinite())
                     } <span class="kw">else </span>{
                         literal_analysis(<span class="kw-2">&amp;</span>expr)
                     };
                 <span class="comment">// These old creaky regex internals can&#39;t handle cases where
                 // the literal sequences are exact but there are look-around
                 // assertions. So we make sure the sequences are inexact if
                 // there are look-around assertions anywhere. This forces the
                 // regex engines to run instead of assuming that a literal
                 // match implies an overall match.
                 </span><span class="kw">if </span>!props.look_set().is_empty() {
                     pres.make_inexact();
                     suffs.make_inexact();
                 }
                 prefixes = prefixes.and_then(|<span class="kw-2">mut </span>prefixes| {
                     prefixes.union(<span class="kw-2">&amp;mut </span>pres);
                     <span class="prelude-val">Some</span>(prefixes)
                 });
                 suffixes = suffixes.and_then(|<span class="kw-2">mut </span>suffixes| {
                     suffixes.union(<span class="kw-2">&amp;mut </span>suffs);
                     <span class="prelude-val">Some</span>(suffixes)
                 });
             }
             exprs.push(expr);
         }
         <span class="prelude-val">Ok</span>(Parsed {
             exprs,
             prefixes: prefixes.unwrap_or_else(literal::Seq::empty),
             suffixes: suffixes.unwrap_or_else(literal::Seq::empty),
             bytes,
         })
     }

     <span class="doccomment">/// Build an executor that can run a regular expression.
     </span><span class="kw">pub fn </span>build(<span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;Exec, Error&gt; {
         <span class="comment">// Special case when we have no patterns to compile.
         // This can happen when compiling a regex set.
         </span><span class="kw">if </span><span class="self">self</span>.options.pats.is_empty() {
             <span class="kw">let </span>ro = Arc::new(ExecReadOnly {
                 res: <span class="macro">vec!</span>[],
                 nfa: Program::new(),
                 dfa: Program::new(),
                 dfa_reverse: Program::new(),
                 suffixes: LiteralSearcher::empty(),
                 <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
                 </span>ac: <span class="prelude-val">None</span>,
                 match_type: MatchType::Nothing,
             });
             <span class="kw">let </span>pool = ExecReadOnly::new_pool(<span class="kw-2">&amp;</span>ro);
             <span class="kw">return </span><span class="prelude-val">Ok</span>(Exec { ro, pool });
         }
         <span class="kw">let </span>parsed = <span class="self">self</span>.parse()<span class="question-mark">?</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>nfa = Compiler::new()
             .size_limit(<span class="self">self</span>.options.size_limit)
             .bytes(<span class="self">self</span>.bytes || parsed.bytes)
             .only_utf8(<span class="self">self</span>.only_utf8)
             .compile(<span class="kw-2">&amp;</span>parsed.exprs)<span class="question-mark">?</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>dfa = Compiler::new()
             .size_limit(<span class="self">self</span>.options.size_limit)
             .dfa(<span class="bool-val">true</span>)
             .only_utf8(<span class="self">self</span>.only_utf8)
             .compile(<span class="kw-2">&amp;</span>parsed.exprs)<span class="question-mark">?</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>dfa_reverse = Compiler::new()
             .size_limit(<span class="self">self</span>.options.size_limit)
             .dfa(<span class="bool-val">true</span>)
             .only_utf8(<span class="self">self</span>.only_utf8)
             .reverse(<span class="bool-val">true</span>)
             .compile(<span class="kw-2">&amp;</span>parsed.exprs)<span class="question-mark">?</span>;

         <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
         </span><span class="kw">let </span>ac = <span class="self">self</span>.build_aho_corasick(<span class="kw-2">&amp;</span>parsed);
         nfa.prefixes = LiteralSearcher::prefixes(parsed.prefixes);
         dfa.prefixes = nfa.prefixes.clone();
         dfa.dfa_size_limit = <span class="self">self</span>.options.dfa_size_limit;
         dfa_reverse.dfa_size_limit = <span class="self">self</span>.options.dfa_size_limit;

         <span class="kw">let </span><span class="kw-2">mut </span>ro = ExecReadOnly {
             res: <span class="self">self</span>.options.pats,
             nfa,
             dfa,
             dfa_reverse,
             suffixes: LiteralSearcher::suffixes(parsed.suffixes),
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>ac,
             match_type: MatchType::Nothing,
         };
         ro.match_type = ro.choose_match_type(<span class="self">self</span>.match_type);

         <span class="kw">let </span>ro = Arc::new(ro);
         <span class="kw">let </span>pool = ExecReadOnly::new_pool(<span class="kw-2">&amp;</span>ro);
         <span class="prelude-val">Ok</span>(Exec { ro, pool })
     }

     <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
     </span><span class="kw">fn </span>build_aho_corasick(<span class="kw-2">&amp;</span><span class="self">self</span>, parsed: <span class="kw-2">&amp;</span>Parsed) -&gt; <span class="prelude-ty">Option</span>&lt;AhoCorasick&gt; {
         <span class="kw">if </span>parsed.exprs.len() != <span class="number">1 </span>{
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }
         <span class="kw">let </span>lits = <span class="kw">match </span>alternation_literals(<span class="kw-2">&amp;</span>parsed.exprs[<span class="number">0</span>]) {
             <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">None</span>,
             <span class="prelude-val">Some</span>(lits) =&gt; lits,
         };
         <span class="comment">// If we have a small number of literals, then let Teddy handle
         // things (see literal/mod.rs).
         </span><span class="kw">if </span>lits.len() &lt;= <span class="number">32 </span>{
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }
         <span class="prelude-val">Some</span>(
             AhoCorasick::builder()
                 .match_kind(MatchKind::LeftmostFirst)
                 .build(<span class="kw-2">&amp;</span>lits)
                 <span class="comment">// This should never happen because we&#39;d long exceed the
                 // compilation limit for regexes first.
                 </span>.expect(<span class="string">&quot;AC automaton too big&quot;</span>),
         )
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;c</span>&gt; RegularExpression <span class="kw">for </span>ExecNoSyncStr&lt;<span class="lifetime">&#39;c</span>&gt; {
     <span class="kw">type </span>Text = str;

     <span class="kw">fn </span>slots_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.<span class="number">0</span>.slots_len()
     }

     <span class="kw">fn </span>next_after_empty(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>str, i: usize) -&gt; usize {
         next_utf8(text.as_bytes(), i)
     }

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>shortest_match_at(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>str, start: usize) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
         <span class="self">self</span>.<span class="number">0</span>.shortest_match_at(text.as_bytes(), start)
     }

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>is_match_at(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>str, start: usize) -&gt; bool {
         <span class="self">self</span>.<span class="number">0</span>.is_match_at(text.as_bytes(), start)
     }

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>find_at(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>str, start: usize) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="self">self</span>.<span class="number">0</span>.find_at(text.as_bytes(), start)
     }

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>captures_read_at(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         locs: <span class="kw-2">&amp;mut </span>Locations,
         text: <span class="kw-2">&amp;</span>str,
         start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="self">self</span>.<span class="number">0</span>.captures_read_at(locs, text.as_bytes(), start)
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;c</span>&gt; RegularExpression <span class="kw">for </span>ExecNoSync&lt;<span class="lifetime">&#39;c</span>&gt; {
     <span class="kw">type </span>Text = [u8];

     <span class="doccomment">/// Returns the number of capture slots in the regular expression. (There
     /// are two slots for every capture group, corresponding to possibly empty
     /// start and end locations of the capture.)
     </span><span class="kw">fn </span>slots_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.ro.nfa.captures.len() * <span class="number">2
     </span>}

     <span class="kw">fn </span>next_after_empty(<span class="kw-2">&amp;</span><span class="self">self</span>, _text: <span class="kw-2">&amp;</span>[u8], i: usize) -&gt; usize {
         i + <span class="number">1
     </span>}

     <span class="doccomment">/// Returns the end of a match location, possibly occurring before the
     /// end location of the correct leftmost-first match.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>shortest_match_at(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8], start: usize) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
         <span class="kw">if </span>!<span class="self">self</span>.is_anchor_end_match(text) {
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }
         <span class="kw">match </span><span class="self">self</span>.ro.match_type {
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>MatchType::Literal(ty) =&gt; {
                 <span class="self">self</span>.find_literals(ty, text, start).map(|(<span class="kw">_</span>, e)| e)
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::Dfa | MatchType::DfaMany =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.shortest_dfa(text, start) {
                     dfa::Result::Match(end) =&gt; <span class="prelude-val">Some</span>(end),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.shortest_nfa(text, start),
                 }
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::DfaAnchoredReverse =&gt; {
                 <span class="kw">match </span>dfa::Fsm::reverse(
                     <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa_reverse,
                     <span class="self">self</span>.cache.value(),
                     <span class="bool-val">true</span>,
                     <span class="kw-2">&amp;</span>text[start..],
                     text.len() - start,
                 ) {
                     dfa::Result::Match(<span class="kw">_</span>) =&gt; <span class="prelude-val">Some</span>(text.len()),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.shortest_nfa(text, start),
                 }
             }
             <span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
             </span>MatchType::DfaSuffix =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.shortest_dfa_reverse_suffix(text, start) {
                     dfa::Result::Match(e) =&gt; <span class="prelude-val">Some</span>(e),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.shortest_nfa(text, start),
                 }
             }
             MatchType::Nfa(ty) =&gt; <span class="self">self</span>.shortest_nfa_type(ty, text, start),
             MatchType::Nothing =&gt; <span class="prelude-val">None</span>,
         }
     }

     <span class="doccomment">/// Returns true if and only if the regex matches text.
     ///
     /// For single regular expressions, this is equivalent to calling
     /// shortest_match(...).is_some().
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>is_match_at(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8], start: usize) -&gt; bool {
         <span class="kw">if </span>!<span class="self">self</span>.is_anchor_end_match(text) {
             <span class="kw">return </span><span class="bool-val">false</span>;
         }
         <span class="comment">// We need to do this dance because shortest_match relies on the NFA
         // filling in captures[1], but a RegexSet has no captures. In other
         // words, a RegexSet can&#39;t (currently) use shortest_match. ---AG
         </span><span class="kw">match </span><span class="self">self</span>.ro.match_type {
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>MatchType::Literal(ty) =&gt; {
                 <span class="self">self</span>.find_literals(ty, text, start).is_some()
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::Dfa | MatchType::DfaMany =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.shortest_dfa(text, start) {
                     dfa::Result::Match(<span class="kw">_</span>) =&gt; <span class="bool-val">true</span>,
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="bool-val">false</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.match_nfa(text, start),
                 }
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::DfaAnchoredReverse =&gt; {
                 <span class="kw">match </span>dfa::Fsm::reverse(
                     <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa_reverse,
                     <span class="self">self</span>.cache.value(),
                     <span class="bool-val">true</span>,
                     <span class="kw-2">&amp;</span>text[start..],
                     text.len() - start,
                 ) {
                     dfa::Result::Match(<span class="kw">_</span>) =&gt; <span class="bool-val">true</span>,
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="bool-val">false</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.match_nfa(text, start),
                 }
             }
             <span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
             </span>MatchType::DfaSuffix =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.shortest_dfa_reverse_suffix(text, start) {
                     dfa::Result::Match(<span class="kw">_</span>) =&gt; <span class="bool-val">true</span>,
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="bool-val">false</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.match_nfa(text, start),
                 }
             }
             MatchType::Nfa(ty) =&gt; <span class="self">self</span>.match_nfa_type(ty, text, start),
             MatchType::Nothing =&gt; <span class="bool-val">false</span>,
         }
     }

     <span class="doccomment">/// Finds the start and end location of the leftmost-first match, starting
     /// at the given location.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>find_at(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8], start: usize) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="kw">if </span>!<span class="self">self</span>.is_anchor_end_match(text) {
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }
         <span class="kw">match </span><span class="self">self</span>.ro.match_type {
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>MatchType::Literal(ty) =&gt; <span class="self">self</span>.find_literals(ty, text, start),
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::Dfa =&gt; <span class="kw">match </span><span class="self">self</span>.find_dfa_forward(text, start) {
                 dfa::Result::Match((s, e)) =&gt; <span class="prelude-val">Some</span>((s, e)),
                 dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                 dfa::Result::Quit =&gt; {
                     <span class="self">self</span>.find_nfa(MatchNfaType::Auto, text, start)
                 }
             },
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::DfaAnchoredReverse =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.find_dfa_anchored_reverse(text, start) {
                     dfa::Result::Match((s, e)) =&gt; <span class="prelude-val">Some</span>((s, e)),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; {
                         <span class="self">self</span>.find_nfa(MatchNfaType::Auto, text, start)
                     }
                 }
             }
             <span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
             </span>MatchType::DfaSuffix =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.find_dfa_reverse_suffix(text, start) {
                     dfa::Result::Match((s, e)) =&gt; <span class="prelude-val">Some</span>((s, e)),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; {
                         <span class="self">self</span>.find_nfa(MatchNfaType::Auto, text, start)
                     }
                 }
             }
             MatchType::Nfa(ty) =&gt; <span class="self">self</span>.find_nfa(ty, text, start),
             MatchType::Nothing =&gt; <span class="prelude-val">None</span>,
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::DfaMany =&gt; {
                 <span class="macro">unreachable!</span>(<span class="string">&quot;BUG: RegexSet cannot be used with find&quot;</span>)
             }
         }
     }

     <span class="doccomment">/// Finds the start and end location of the leftmost-first match and also
     /// fills in all matching capture groups.
     ///
     /// The number of capture slots given should be equal to the total number
     /// of capture slots in the compiled program.
     ///
     /// Note that the first two slots always correspond to the start and end
     /// locations of the overall match.
     </span><span class="kw">fn </span>captures_read_at(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         locs: <span class="kw-2">&amp;mut </span>Locations,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="kw">let </span>slots = locs.as_slots();
         <span class="kw">for </span>slot <span class="kw">in </span>slots.iter_mut() {
             <span class="kw-2">*</span>slot = <span class="prelude-val">None</span>;
         }
         <span class="comment">// If the caller unnecessarily uses this, then we try to save them
         // from themselves.
         </span><span class="kw">match </span>slots.len() {
             <span class="number">0 </span>=&gt; <span class="kw">return </span><span class="self">self</span>.find_at(text, start),
             <span class="number">2 </span>=&gt; {
                 <span class="kw">return </span><span class="self">self</span>.find_at(text, start).map(|(s, e)| {
                     slots[<span class="number">0</span>] = <span class="prelude-val">Some</span>(s);
                     slots[<span class="number">1</span>] = <span class="prelude-val">Some</span>(e);
                     (s, e)
                 });
             }
             <span class="kw">_ </span>=&gt; {} <span class="comment">// fallthrough
         </span>}
         <span class="kw">if </span>!<span class="self">self</span>.is_anchor_end_match(text) {
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }
         <span class="kw">match </span><span class="self">self</span>.ro.match_type {
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>MatchType::Literal(ty) =&gt; {
                 <span class="self">self</span>.find_literals(ty, text, start).and_then(|(s, e)| {
                     <span class="self">self</span>.captures_nfa_type(
                         MatchNfaType::Auto,
                         slots,
                         text,
                         s,
                         e,
                     )
                 })
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::Dfa =&gt; {
                 <span class="kw">if </span><span class="self">self</span>.ro.nfa.is_anchored_start {
                     <span class="self">self</span>.captures_nfa(slots, text, start)
                 } <span class="kw">else </span>{
                     <span class="kw">match </span><span class="self">self</span>.find_dfa_forward(text, start) {
                         dfa::Result::Match((s, e)) =&gt; <span class="self">self</span>.captures_nfa_type(
                             MatchNfaType::Auto,
                             slots,
                             text,
                             s,
                             e,
                         ),
                         dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                         dfa::Result::Quit =&gt; {
                             <span class="self">self</span>.captures_nfa(slots, text, start)
                         }
                     }
                 }
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::DfaAnchoredReverse =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.find_dfa_anchored_reverse(text, start) {
                     dfa::Result::Match((s, e)) =&gt; <span class="self">self</span>.captures_nfa_type(
                         MatchNfaType::Auto,
                         slots,
                         text,
                         s,
                         e,
                     ),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.captures_nfa(slots, text, start),
                 }
             }
             <span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
             </span>MatchType::DfaSuffix =&gt; {
                 <span class="kw">match </span><span class="self">self</span>.find_dfa_reverse_suffix(text, start) {
                     dfa::Result::Match((s, e)) =&gt; <span class="self">self</span>.captures_nfa_type(
                         MatchNfaType::Auto,
                         slots,
                         text,
                         s,
                         e,
                     ),
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.captures_nfa(slots, text, start),
                 }
             }
             MatchType::Nfa(ty) =&gt; {
                 <span class="self">self</span>.captures_nfa_type(ty, slots, text, start, text.len())
             }
             MatchType::Nothing =&gt; <span class="prelude-val">None</span>,
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>MatchType::DfaMany =&gt; {
                 <span class="macro">unreachable!</span>(<span class="string">&quot;BUG: RegexSet cannot be used with captures&quot;</span>)
             }
         }
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;c</span>&gt; ExecNoSync&lt;<span class="lifetime">&#39;c</span>&gt; {
     <span class="doccomment">/// Finds the leftmost-first match using only literal search.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>find_literals(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         ty: MatchLiteralType,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="kw">use </span><span class="self">self</span>::MatchLiteralType::<span class="kw-2">*</span>;
         <span class="kw">match </span>ty {
             Unanchored =&gt; {
                 <span class="kw">let </span>lits = <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa.prefixes;
                 lits.find(<span class="kw-2">&amp;</span>text[start..]).map(|(s, e)| (start + s, start + e))
             }
             AnchoredStart =&gt; {
                 <span class="kw">let </span>lits = <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa.prefixes;
                 <span class="kw">if </span>start == <span class="number">0 </span>|| !<span class="self">self</span>.ro.nfa.is_anchored_start {
                     lits.find_start(<span class="kw-2">&amp;</span>text[start..])
                         .map(|(s, e)| (start + s, start + e))
                 } <span class="kw">else </span>{
                     <span class="prelude-val">None
                 </span>}
             }
             AnchoredEnd =&gt; {
                 <span class="kw">let </span>lits = <span class="kw-2">&amp;</span><span class="self">self</span>.ro.suffixes;
                 lits.find_end(<span class="kw-2">&amp;</span>text[start..])
                     .map(|(s, e)| (start + s, start + e))
             }
             AhoCorasick =&gt; <span class="self">self
                 </span>.ro
                 .ac
                 .as_ref()
                 .unwrap()
                 .find(<span class="kw-2">&amp;</span>text[start..])
                 .map(|m| (start + m.start(), start + m.end())),
         }
     }

     <span class="doccomment">/// Finds the leftmost-first match (start and end) using only the DFA.
     ///
     /// If the result returned indicates that the DFA quit, then another
     /// matching engine should be used.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>find_dfa_forward(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; dfa::Result&lt;(usize, usize)&gt; {
         <span class="kw">use </span><span class="kw">crate</span>::dfa::Result::<span class="kw-2">*</span>;
         <span class="kw">let </span>end = <span class="kw">match </span>dfa::Fsm::forward(
             <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa,
             <span class="self">self</span>.cache.value(),
             <span class="bool-val">false</span>,
             text,
             start,
         ) {
             NoMatch(i) =&gt; <span class="kw">return </span>NoMatch(i),
             Quit =&gt; <span class="kw">return </span>Quit,
             Match(end) <span class="kw">if </span>start == end =&gt; <span class="kw">return </span>Match((start, start)),
             Match(end) =&gt; end,
         };
         <span class="comment">// Now run the DFA in reverse to find the start of the match.
         </span><span class="kw">match </span>dfa::Fsm::reverse(
             <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa_reverse,
             <span class="self">self</span>.cache.value(),
             <span class="bool-val">false</span>,
             <span class="kw-2">&amp;</span>text[start..],
             end - start,
         ) {
             Match(s) =&gt; Match((start + s, end)),
             NoMatch(i) =&gt; NoMatch(i),
             Quit =&gt; Quit,
         }
     }

     <span class="doccomment">/// Finds the leftmost-first match (start and end) using only the DFA,
     /// but assumes the regex is anchored at the end and therefore starts at
     /// the end of the regex and matches in reverse.
     ///
     /// If the result returned indicates that the DFA quit, then another
     /// matching engine should be used.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>find_dfa_anchored_reverse(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; dfa::Result&lt;(usize, usize)&gt; {
         <span class="kw">use </span><span class="kw">crate</span>::dfa::Result::<span class="kw-2">*</span>;
         <span class="kw">match </span>dfa::Fsm::reverse(
             <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa_reverse,
             <span class="self">self</span>.cache.value(),
             <span class="bool-val">false</span>,
             <span class="kw-2">&amp;</span>text[start..],
             text.len() - start,
         ) {
             Match(s) =&gt; Match((start + s, text.len())),
             NoMatch(i) =&gt; NoMatch(i),
             Quit =&gt; Quit,
         }
     }

     <span class="doccomment">/// Finds the end of the shortest match using only the DFA.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>shortest_dfa(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8], start: usize) -&gt; dfa::Result&lt;usize&gt; {
         dfa::Fsm::forward(<span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa, <span class="self">self</span>.cache.value(), <span class="bool-val">true</span>, text, start)
     }

     <span class="doccomment">/// Finds the end of the shortest match using only the DFA by scanning for
     /// suffix literals.
     </span><span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>shortest_dfa_reverse_suffix(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; dfa::Result&lt;usize&gt; {
         <span class="kw">match </span><span class="self">self</span>.exec_dfa_reverse_suffix(text, start) {
             <span class="prelude-val">None </span>=&gt; <span class="self">self</span>.shortest_dfa(text, start),
             <span class="prelude-val">Some</span>(r) =&gt; r.map(|(<span class="kw">_</span>, end)| end),
         }
     }

     <span class="doccomment">/// Finds the end of the shortest match using only the DFA by scanning for
     /// suffix literals. It also reports the start of the match.
     ///
     /// Note that if None is returned, then the optimization gave up to avoid
     /// worst case quadratic behavior. A forward scanning DFA should be tried
     /// next.
     ///
     /// If a match is returned and the full leftmost-first match is desired,
     /// then a forward scan starting from the beginning of the match must be
     /// done.
     ///
     /// If the result returned indicates that the DFA quit, then another
     /// matching engine should be used.
     </span><span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>exec_dfa_reverse_suffix(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         text: <span class="kw-2">&amp;</span>[u8],
         original_start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;dfa::Result&lt;(usize, usize)&gt;&gt; {
         <span class="kw">use </span><span class="kw">crate</span>::dfa::Result::<span class="kw-2">*</span>;

         <span class="kw">let </span>lcs = <span class="self">self</span>.ro.suffixes.lcs();
         <span class="macro">debug_assert!</span>(lcs.len() &gt;= <span class="number">1</span>);
         <span class="kw">let </span><span class="kw-2">mut </span>start = original_start;
         <span class="kw">let </span><span class="kw-2">mut </span>end = start;
         <span class="kw">let </span><span class="kw-2">mut </span>last_literal = start;
         <span class="kw">while </span>end &lt;= text.len() {
             last_literal += <span class="kw">match </span>lcs.find(<span class="kw-2">&amp;</span>text[last_literal..]) {
                 <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">Some</span>(NoMatch(text.len())),
                 <span class="prelude-val">Some</span>(i) =&gt; i,
             };
             end = last_literal + lcs.len();
             <span class="kw">match </span>dfa::Fsm::reverse(
                 <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa_reverse,
                 <span class="self">self</span>.cache.value(),
                 <span class="bool-val">false</span>,
                 <span class="kw-2">&amp;</span>text[start..end],
                 end - start,
             ) {
                 Match(<span class="number">0</span>) | NoMatch(<span class="number">0</span>) =&gt; <span class="kw">return </span><span class="prelude-val">None</span>,
                 Match(i) =&gt; <span class="kw">return </span><span class="prelude-val">Some</span>(Match((start + i, end))),
                 NoMatch(i) =&gt; {
                     start += i;
                     last_literal += <span class="number">1</span>;
                     <span class="kw">continue</span>;
                 }
                 Quit =&gt; <span class="kw">return </span><span class="prelude-val">Some</span>(Quit),
             };
         }
         <span class="prelude-val">Some</span>(NoMatch(text.len()))
     }

     <span class="doccomment">/// Finds the leftmost-first match (start and end) using only the DFA
     /// by scanning for suffix literals.
     ///
     /// If the result returned indicates that the DFA quit, then another
     /// matching engine should be used.
     </span><span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
     #[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>find_dfa_reverse_suffix(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; dfa::Result&lt;(usize, usize)&gt; {
         <span class="kw">use </span><span class="kw">crate</span>::dfa::Result::<span class="kw-2">*</span>;

         <span class="kw">let </span>match_start = <span class="kw">match </span><span class="self">self</span>.exec_dfa_reverse_suffix(text, start) {
             <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="self">self</span>.find_dfa_forward(text, start),
             <span class="prelude-val">Some</span>(Match((start, <span class="kw">_</span>))) =&gt; start,
             <span class="prelude-val">Some</span>(r) =&gt; <span class="kw">return </span>r,
         };
         <span class="comment">// At this point, we&#39;ve found a match. The only way to quit now
         // without a match is if the DFA gives up (seems unlikely).
         //
         // Now run the DFA forwards to find the proper end of the match.
         // (The suffix literal match can only indicate the earliest
         // possible end location, which may appear before the end of the
         // leftmost-first match.)
         </span><span class="kw">match </span>dfa::Fsm::forward(
             <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa,
             <span class="self">self</span>.cache.value(),
             <span class="bool-val">false</span>,
             text,
             match_start,
         ) {
             NoMatch(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;BUG: reverse match implies forward match&quot;</span>),
             Quit =&gt; Quit,
             Match(e) =&gt; Match((match_start, e)),
         }
     }

     <span class="doccomment">/// Executes the NFA engine to return whether there is a match or not.
     ///
     /// Ideally, we could use shortest_nfa(...).is_some() and get the same
     /// performance characteristics, but regex sets don&#39;t have captures, which
     /// shortest_nfa depends on.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span><span class="kw">fn </span>match_nfa(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8], start: usize) -&gt; bool {
         <span class="self">self</span>.match_nfa_type(MatchNfaType::Auto, text, start)
     }

     <span class="doccomment">/// Like match_nfa, but allows specification of the type of NFA engine.
     </span><span class="kw">fn </span>match_nfa_type(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         ty: MatchNfaType,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; bool {
         <span class="self">self</span>.exec_nfa(
             ty,
             <span class="kw-2">&amp;mut </span>[<span class="bool-val">false</span>],
             <span class="kw-2">&amp;mut </span>[],
             <span class="bool-val">true</span>,
             <span class="bool-val">false</span>,
             text,
             start,
             text.len(),
         )
     }

     <span class="doccomment">/// Finds the shortest match using an NFA.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span><span class="kw">fn </span>shortest_nfa(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8], start: usize) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
         <span class="self">self</span>.shortest_nfa_type(MatchNfaType::Auto, text, start)
     }

     <span class="doccomment">/// Like shortest_nfa, but allows specification of the type of NFA engine.
     </span><span class="kw">fn </span>shortest_nfa_type(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         ty: MatchNfaType,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>slots = [<span class="prelude-val">None</span>, <span class="prelude-val">None</span>];
         <span class="kw">if </span><span class="self">self</span>.exec_nfa(
             ty,
             <span class="kw-2">&amp;mut </span>[<span class="bool-val">false</span>],
             <span class="kw-2">&amp;mut </span>slots,
             <span class="bool-val">true</span>,
             <span class="bool-val">true</span>,
             text,
             start,
             text.len(),
         ) {
             slots[<span class="number">1</span>]
         } <span class="kw">else </span>{
             <span class="prelude-val">None
         </span>}
     }

     <span class="doccomment">/// Like find, but executes an NFA engine.
     </span><span class="kw">fn </span>find_nfa(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         ty: MatchNfaType,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>slots = [<span class="prelude-val">None</span>, <span class="prelude-val">None</span>];
         <span class="kw">if </span><span class="self">self</span>.exec_nfa(
             ty,
             <span class="kw-2">&amp;mut </span>[<span class="bool-val">false</span>],
             <span class="kw-2">&amp;mut </span>slots,
             <span class="bool-val">false</span>,
             <span class="bool-val">false</span>,
             text,
             start,
             text.len(),
         ) {
             <span class="kw">match </span>(slots[<span class="number">0</span>], slots[<span class="number">1</span>]) {
                 (<span class="prelude-val">Some</span>(s), <span class="prelude-val">Some</span>(e)) =&gt; <span class="prelude-val">Some</span>((s, e)),
                 <span class="kw">_ </span>=&gt; <span class="prelude-val">None</span>,
             }
         } <span class="kw">else </span>{
             <span class="prelude-val">None
         </span>}
     }

     <span class="doccomment">/// Like find_nfa, but fills in captures.
     ///
     /// `slots` should have length equal to `2 * nfa.captures.len()`.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span><span class="kw">fn </span>captures_nfa(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         slots: <span class="kw-2">&amp;mut </span>[Slot],
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="self">self</span>.captures_nfa_type(
             MatchNfaType::Auto,
             slots,
             text,
             start,
             text.len(),
         )
     }

     <span class="doccomment">/// Like captures_nfa, but allows specification of type of NFA engine.
     </span><span class="kw">fn </span>captures_nfa_type(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         ty: MatchNfaType,
         slots: <span class="kw-2">&amp;mut </span>[Slot],
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
         end: usize,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
         <span class="kw">if </span><span class="self">self</span>.exec_nfa(
             ty,
             <span class="kw-2">&amp;mut </span>[<span class="bool-val">false</span>],
             slots,
             <span class="bool-val">false</span>,
             <span class="bool-val">false</span>,
             text,
             start,
             end,
         ) {
             <span class="kw">match </span>(slots[<span class="number">0</span>], slots[<span class="number">1</span>]) {
                 (<span class="prelude-val">Some</span>(s), <span class="prelude-val">Some</span>(e)) =&gt; <span class="prelude-val">Some</span>((s, e)),
                 <span class="kw">_ </span>=&gt; <span class="prelude-val">None</span>,
             }
         } <span class="kw">else </span>{
             <span class="prelude-val">None
         </span>}
     }

     <span class="kw">fn </span>exec_nfa(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         <span class="kw-2">mut </span>ty: MatchNfaType,
         matches: <span class="kw-2">&amp;mut </span>[bool],
         slots: <span class="kw-2">&amp;mut </span>[Slot],
         quit_after_match: bool,
         quit_after_match_with_pos: bool,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
         end: usize,
     ) -&gt; bool {
         <span class="kw">use </span><span class="self">self</span>::MatchNfaType::<span class="kw-2">*</span>;
         <span class="kw">if let </span>Auto = ty {
             <span class="kw">if </span>backtrack::should_exec(<span class="self">self</span>.ro.nfa.len(), text.len()) {
                 ty = Backtrack;
             } <span class="kw">else </span>{
                 ty = PikeVM;
             }
         }
         <span class="comment">// The backtracker can&#39;t return the shortest match position as it is
         // implemented today. So if someone calls `shortest_match` and we need
         // to run an NFA, then use the PikeVM.
         </span><span class="kw">if </span>quit_after_match_with_pos || ty == PikeVM {
             <span class="self">self</span>.exec_pikevm(
                 matches,
                 slots,
                 quit_after_match,
                 text,
                 start,
                 end,
             )
         } <span class="kw">else </span>{
             <span class="self">self</span>.exec_backtrack(matches, slots, text, start, end)
         }
     }

     <span class="doccomment">/// Always run the NFA algorithm.
     </span><span class="kw">fn </span>exec_pikevm(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         matches: <span class="kw-2">&amp;mut </span>[bool],
         slots: <span class="kw-2">&amp;mut </span>[Slot],
         quit_after_match: bool,
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
         end: usize,
     ) -&gt; bool {
         <span class="kw">if </span><span class="self">self</span>.ro.nfa.uses_bytes() {
             pikevm::Fsm::exec(
                 <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa,
                 <span class="self">self</span>.cache.value(),
                 matches,
                 slots,
                 quit_after_match,
                 ByteInput::new(text, <span class="self">self</span>.ro.nfa.only_utf8),
                 start,
                 end,
             )
         } <span class="kw">else </span>{
             pikevm::Fsm::exec(
                 <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa,
                 <span class="self">self</span>.cache.value(),
                 matches,
                 slots,
                 quit_after_match,
                 CharInput::new(text),
                 start,
                 end,
             )
         }
     }

     <span class="doccomment">/// Always runs the NFA using bounded backtracking.
     </span><span class="kw">fn </span>exec_backtrack(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         matches: <span class="kw-2">&amp;mut </span>[bool],
         slots: <span class="kw-2">&amp;mut </span>[Slot],
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
         end: usize,
     ) -&gt; bool {
         <span class="kw">if </span><span class="self">self</span>.ro.nfa.uses_bytes() {
             backtrack::Bounded::exec(
                 <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa,
                 <span class="self">self</span>.cache.value(),
                 matches,
                 slots,
                 ByteInput::new(text, <span class="self">self</span>.ro.nfa.only_utf8),
                 start,
                 end,
             )
         } <span class="kw">else </span>{
             backtrack::Bounded::exec(
                 <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa,
                 <span class="self">self</span>.cache.value(),
                 matches,
                 slots,
                 CharInput::new(text),
                 start,
                 end,
             )
         }
     }

     <span class="doccomment">/// Finds which regular expressions match the given text.
     ///
     /// `matches` should have length equal to the number of regexes being
     /// searched.
     ///
     /// This is only useful when one wants to know which regexes in a set
     /// match some text.
     </span><span class="kw">pub fn </span>many_matches_at(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         matches: <span class="kw-2">&amp;mut </span>[bool],
         text: <span class="kw-2">&amp;</span>[u8],
         start: usize,
     ) -&gt; bool {
         <span class="kw">use </span><span class="self">self</span>::MatchType::<span class="kw-2">*</span>;
         <span class="kw">if </span>!<span class="self">self</span>.is_anchor_end_match(text) {
             <span class="kw">return </span><span class="bool-val">false</span>;
         }
         <span class="kw">match </span><span class="self">self</span>.ro.match_type {
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>Literal(ty) =&gt; {
                 <span class="macro">debug_assert_eq!</span>(matches.len(), <span class="number">1</span>);
                 matches[<span class="number">0</span>] = <span class="self">self</span>.find_literals(ty, text, start).is_some();
                 matches[<span class="number">0</span>]
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>Dfa | DfaAnchoredReverse | DfaMany =&gt; {
                 <span class="kw">match </span>dfa::Fsm::forward_many(
                     <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa,
                     <span class="self">self</span>.cache.value(),
                     matches,
                     text,
                     start,
                 ) {
                     dfa::Result::Match(<span class="kw">_</span>) =&gt; <span class="bool-val">true</span>,
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="bool-val">false</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.exec_nfa(
                         MatchNfaType::Auto,
                         matches,
                         <span class="kw-2">&amp;mut </span>[],
                         <span class="bool-val">false</span>,
                         <span class="bool-val">false</span>,
                         text,
                         start,
                         text.len(),
                     ),
                 }
             }
             <span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
             </span>DfaSuffix =&gt; {
                 <span class="kw">match </span>dfa::Fsm::forward_many(
                     <span class="kw-2">&amp;</span><span class="self">self</span>.ro.dfa,
                     <span class="self">self</span>.cache.value(),
                     matches,
                     text,
                     start,
                 ) {
                     dfa::Result::Match(<span class="kw">_</span>) =&gt; <span class="bool-val">true</span>,
                     dfa::Result::NoMatch(<span class="kw">_</span>) =&gt; <span class="bool-val">false</span>,
                     dfa::Result::Quit =&gt; <span class="self">self</span>.exec_nfa(
                         MatchNfaType::Auto,
                         matches,
                         <span class="kw-2">&amp;mut </span>[],
                         <span class="bool-val">false</span>,
                         <span class="bool-val">false</span>,
                         text,
                         start,
                         text.len(),
                     ),
                 }
             }
             Nfa(ty) =&gt; <span class="self">self</span>.exec_nfa(
                 ty,
                 matches,
                 <span class="kw-2">&amp;mut </span>[],
                 <span class="bool-val">false</span>,
                 <span class="bool-val">false</span>,
                 text,
                 start,
                 text.len(),
             ),
             Nothing =&gt; <span class="bool-val">false</span>,
         }
     }

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">fn </span>is_anchor_end_match(<span class="kw-2">&amp;</span><span class="self">self</span>, text: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
         <span class="attribute">#[cfg(not(feature = <span class="string">&quot;perf-literal&quot;</span>))]
         </span><span class="kw">fn </span>imp(<span class="kw">_</span>: <span class="kw-2">&amp;</span>ExecReadOnly, <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
             <span class="bool-val">true
         </span>}

         <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
         </span><span class="kw">fn </span>imp(ro: <span class="kw-2">&amp;</span>ExecReadOnly, text: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
             <span class="comment">// Only do this check if the haystack is big (&gt;1MB).
             </span><span class="kw">if </span>text.len() &gt; (<span class="number">1 </span>&lt;&lt; <span class="number">20</span>) &amp;&amp; ro.nfa.is_anchored_end {
                 <span class="kw">let </span>lcs = ro.suffixes.lcs();
                 <span class="kw">if </span>lcs.len() &gt;= <span class="number">1 </span>&amp;&amp; !lcs.is_suffix(text) {
                     <span class="kw">return </span><span class="bool-val">false</span>;
                 }
             }
             <span class="bool-val">true
         </span>}

         imp(<span class="kw-2">&amp;</span><span class="self">self</span>.ro, text)
     }

     <span class="kw">pub fn </span>capture_name_idx(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Arc&lt;HashMap&lt;String, usize&gt;&gt; {
         <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa.capture_name_idx
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;c</span>&gt; ExecNoSyncStr&lt;<span class="lifetime">&#39;c</span>&gt; {
     <span class="kw">pub fn </span>capture_name_idx(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Arc&lt;HashMap&lt;String, usize&gt;&gt; {
         <span class="self">self</span>.<span class="number">0</span>.capture_name_idx()
     }
 }

 <span class="kw">impl </span>Exec {
     <span class="doccomment">/// Get a searcher that isn&#39;t Sync.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">pub fn </span>searcher(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ExecNoSync&lt;<span class="lifetime">&#39;_</span>&gt; {
         ExecNoSync {
             ro: <span class="kw-2">&amp;</span><span class="self">self</span>.ro, <span class="comment">// a clone is too expensive here! (and not needed)
             </span>cache: <span class="self">self</span>.pool.get(),
         }
     }

     <span class="doccomment">/// Get a searcher that isn&#39;t Sync and can match on &amp;str.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;perf-inline&quot;</span>, inline(always))]
     </span><span class="kw">pub fn </span>searcher_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ExecNoSyncStr&lt;<span class="lifetime">&#39;_</span>&gt; {
         ExecNoSyncStr(<span class="self">self</span>.searcher())
     }

     <span class="doccomment">/// Build a Regex from this executor.
     </span><span class="kw">pub fn </span>into_regex(<span class="self">self</span>) -&gt; re_unicode::Regex {
         re_unicode::Regex::from(<span class="self">self</span>)
     }

     <span class="doccomment">/// Build a RegexSet from this executor.
     </span><span class="kw">pub fn </span>into_regex_set(<span class="self">self</span>) -&gt; re_set::unicode::RegexSet {
         re_set::unicode::RegexSet::from(<span class="self">self</span>)
     }

     <span class="doccomment">/// Build a Regex from this executor that can match arbitrary bytes.
     </span><span class="kw">pub fn </span>into_byte_regex(<span class="self">self</span>) -&gt; re_bytes::Regex {
         re_bytes::Regex::from(<span class="self">self</span>)
     }

     <span class="doccomment">/// Build a RegexSet from this executor that can match arbitrary bytes.
     </span><span class="kw">pub fn </span>into_byte_regex_set(<span class="self">self</span>) -&gt; re_set::bytes::RegexSet {
         re_set::bytes::RegexSet::from(<span class="self">self</span>)
     }

     <span class="doccomment">/// The original regular expressions given by the caller that were
     /// compiled.
     </span><span class="kw">pub fn </span>regex_strings(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[String] {
         <span class="kw-2">&amp;</span><span class="self">self</span>.ro.res
     }

     <span class="doccomment">/// Return a slice of capture names.
     ///
     /// Any capture that isn&#39;t named is None.
     </span><span class="kw">pub fn </span>capture_names(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[<span class="prelude-ty">Option</span>&lt;String&gt;] {
         <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa.captures
     }

     <span class="doccomment">/// Return a reference to named groups mapping (from group name to
     /// group position).
     </span><span class="kw">pub fn </span>capture_name_idx(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Arc&lt;HashMap&lt;String, usize&gt;&gt; {
         <span class="kw-2">&amp;</span><span class="self">self</span>.ro.nfa.capture_name_idx
     }

     <span class="doccomment">/// If the number of capture groups in every match is always the same, then
     /// return that number. Otherwise return `None`.
     </span><span class="kw">pub fn </span>static_captures_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
         <span class="self">self</span>.ro.nfa.static_captures_len
     }
 }

 <span class="kw">impl </span>Clone <span class="kw">for </span>Exec {
     <span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Exec {
         <span class="kw">let </span>pool = ExecReadOnly::new_pool(<span class="kw-2">&amp;</span><span class="self">self</span>.ro);
         Exec { ro: <span class="self">self</span>.ro.clone(), pool }
     }
 }

 <span class="kw">impl </span>ExecReadOnly {
     <span class="kw">fn </span>choose_match_type(<span class="kw-2">&amp;</span><span class="self">self</span>, hint: <span class="prelude-ty">Option</span>&lt;MatchType&gt;) -&gt; MatchType {
         <span class="kw">if let </span><span class="prelude-val">Some</span>(MatchType::Nfa(<span class="kw">_</span>)) = hint {
             <span class="kw">return </span>hint.unwrap();
         }
         <span class="comment">// If the NFA is empty, then we&#39;ll never match anything.
         </span><span class="kw">if </span><span class="self">self</span>.nfa.insts.is_empty() {
             <span class="kw">return </span>MatchType::Nothing;
         }
         <span class="kw">if let </span><span class="prelude-val">Some</span>(literalty) = <span class="self">self</span>.choose_literal_match_type() {
             <span class="kw">return </span>literalty;
         }
         <span class="kw">if let </span><span class="prelude-val">Some</span>(dfaty) = <span class="self">self</span>.choose_dfa_match_type() {
             <span class="kw">return </span>dfaty;
         }
         <span class="comment">// We&#39;re so totally hosed.
         </span>MatchType::Nfa(MatchNfaType::Auto)
     }

     <span class="doccomment">/// If a plain literal scan can be used, then a corresponding literal
     /// search type is returned.
     </span><span class="kw">fn </span>choose_literal_match_type(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;MatchType&gt; {
         <span class="attribute">#[cfg(not(feature = <span class="string">&quot;perf-literal&quot;</span>))]
         </span><span class="kw">fn </span>imp(<span class="kw">_</span>: <span class="kw-2">&amp;</span>ExecReadOnly) -&gt; <span class="prelude-ty">Option</span>&lt;MatchType&gt; {
             <span class="prelude-val">None
         </span>}

         <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
         </span><span class="kw">fn </span>imp(ro: <span class="kw-2">&amp;</span>ExecReadOnly) -&gt; <span class="prelude-ty">Option</span>&lt;MatchType&gt; {
             <span class="comment">// If our set of prefixes is complete, then we can use it to find
             // a match in lieu of a regex engine. This doesn&#39;t quite work well
             // in the presence of multiple regexes, so only do it when there&#39;s
             // one.
             //
             // TODO(burntsushi): Also, don&#39;t try to match literals if the regex
             // is partially anchored. We could technically do it, but we&#39;d need
             // to create two sets of literals: all of them and then the subset
             // that aren&#39;t anchored. We would then only search for all of them
             // when at the beginning of the input and use the subset in all
             // other cases.
             </span><span class="kw">if </span>ro.res.len() != <span class="number">1 </span>{
                 <span class="kw">return </span><span class="prelude-val">None</span>;
             }
             <span class="kw">if </span>ro.ac.is_some() {
                 <span class="kw">return </span><span class="prelude-val">Some</span>(MatchType::Literal(
                     MatchLiteralType::AhoCorasick,
                 ));
             }
             <span class="kw">if </span>ro.nfa.prefixes.complete() {
                 <span class="kw">return if </span>ro.nfa.is_anchored_start {
                     <span class="prelude-val">Some</span>(MatchType::Literal(MatchLiteralType::AnchoredStart))
                 } <span class="kw">else </span>{
                     <span class="prelude-val">Some</span>(MatchType::Literal(MatchLiteralType::Unanchored))
                 };
             }
             <span class="kw">if </span>ro.suffixes.complete() {
                 <span class="kw">return if </span>ro.nfa.is_anchored_end {
                     <span class="prelude-val">Some</span>(MatchType::Literal(MatchLiteralType::AnchoredEnd))
                 } <span class="kw">else </span>{
                     <span class="comment">// This case shouldn&#39;t happen. When the regex isn&#39;t
                     // anchored, then complete prefixes should imply complete
                     // suffixes.
                     //
                     // The above is wrong! This case can happen. While
                     // complete prefixes should imply complete suffixes
                     // here, that doesn&#39;t necessarily mean we have a useful
                     // prefix matcher! It could be the case that the literal
                     // searcher decided the prefixes---even though they are
                     // &quot;complete&quot;---weren&#39;t good enough and thus created an
                     // empty matcher. If that happens and we return Unanchored
                     // here, then we&#39;ll end up using that matcher, which is
                     // very bad because it matches at every position. So...
                     // return None.
                     </span><span class="prelude-val">None
                 </span>};
             }
             <span class="prelude-val">None
         </span>}

         imp(<span class="self">self</span>)
     }

     <span class="doccomment">/// If a DFA scan can be used, then choose the appropriate DFA strategy.
     </span><span class="kw">fn </span>choose_dfa_match_type(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;MatchType&gt; {
         <span class="attribute">#[cfg(not(feature = <span class="string">&quot;perf-dfa&quot;</span>))]
         </span><span class="kw">fn </span>imp(<span class="kw">_</span>: <span class="kw-2">&amp;</span>ExecReadOnly) -&gt; <span class="prelude-ty">Option</span>&lt;MatchType&gt; {
             <span class="prelude-val">None
         </span>}

         <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
         </span><span class="kw">fn </span>imp(ro: <span class="kw-2">&amp;</span>ExecReadOnly) -&gt; <span class="prelude-ty">Option</span>&lt;MatchType&gt; {
             <span class="kw">if </span>!dfa::can_exec(<span class="kw-2">&amp;</span>ro.dfa) {
                 <span class="kw">return </span><span class="prelude-val">None</span>;
             }
             <span class="comment">// Regex sets require a slightly specialized path.
             </span><span class="kw">if </span>ro.res.len() &gt;= <span class="number">2 </span>{
                 <span class="kw">return </span><span class="prelude-val">Some</span>(MatchType::DfaMany);
             }
             <span class="comment">// If the regex is anchored at the end but not the start, then
             // just match in reverse from the end of the haystack.
             </span><span class="kw">if </span>!ro.nfa.is_anchored_start &amp;&amp; ro.nfa.is_anchored_end {
                 <span class="kw">return </span><span class="prelude-val">Some</span>(MatchType::DfaAnchoredReverse);
             }
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
             </span>{
                 <span class="comment">// If there&#39;s a longish suffix literal, then it might be faster
                 // to look for that first.
                 </span><span class="kw">if </span>ro.should_suffix_scan() {
                     <span class="kw">return </span><span class="prelude-val">Some</span>(MatchType::DfaSuffix);
                 }
             }
             <span class="comment">// Fall back to your garden variety forward searching lazy DFA.
             </span><span class="prelude-val">Some</span>(MatchType::Dfa)
         }

         imp(<span class="self">self</span>)
     }

     <span class="doccomment">/// Returns true if the program is amenable to suffix scanning.
     ///
     /// When this is true, as a heuristic, we assume it is OK to quickly scan
     /// for suffix literals and then do a *reverse* DFA match from any matches
     /// produced by the literal scan. (And then followed by a forward DFA
     /// search, since the previously found suffix literal maybe not actually be
     /// the end of a match.)
     ///
     /// This is a bit of a specialized optimization, but can result in pretty
     /// big performance wins if 1) there are no prefix literals and 2) the
     /// suffix literals are pretty rare in the text. (1) is obviously easy to
     /// account for but (2) is harder. As a proxy, we assume that longer
     /// strings are generally rarer, so we only enable this optimization when
     /// we have a meaty suffix.
     </span><span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
     </span><span class="kw">fn </span>should_suffix_scan(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         <span class="kw">if </span><span class="self">self</span>.suffixes.is_empty() {
             <span class="kw">return </span><span class="bool-val">false</span>;
         }
         <span class="kw">let </span>lcs_len = <span class="self">self</span>.suffixes.lcs().char_len();
         lcs_len &gt;= <span class="number">3 </span>&amp;&amp; lcs_len &gt; <span class="self">self</span>.dfa.prefixes.lcp().char_len()
     }

     <span class="kw">fn </span>new_pool(ro: <span class="kw-2">&amp;</span>Arc&lt;ExecReadOnly&gt;) -&gt; Box&lt;Pool&lt;ProgramCache&gt;&gt; {
         <span class="kw">let </span>ro = ro.clone();
         Box::new(Pool::new(Box::new(<span class="kw">move </span>|| {
             AssertUnwindSafe(RefCell::new(ProgramCacheInner::new(<span class="kw-2">&amp;</span>ro)))
         })))
     }
 }

 <span class="attribute">#[derive(Clone, Copy, Debug)]
 </span><span class="kw">enum </span>MatchType {
     <span class="doccomment">/// A single or multiple literal search. This is only used when the regex
     /// can be decomposed into a literal search.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
     </span>Literal(MatchLiteralType),
     <span class="doccomment">/// A normal DFA search.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span>Dfa,
     <span class="doccomment">/// A reverse DFA search starting from the end of a haystack.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span>DfaAnchoredReverse,
     <span class="doccomment">/// A reverse DFA search with suffix literal scanning.
     </span><span class="attribute">#[cfg(all(feature = <span class="string">&quot;perf-dfa&quot;</span>, feature = <span class="string">&quot;perf-literal&quot;</span>))]
     </span>DfaSuffix,
     <span class="doccomment">/// Use the DFA on two or more regular expressions.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span>DfaMany,
     <span class="doccomment">/// An NFA variant.
     </span>Nfa(MatchNfaType),
     <span class="doccomment">/// No match is ever possible, so don&#39;t ever try to search.
     </span>Nothing,
 }

 <span class="attribute">#[derive(Clone, Copy, Debug)]
 #[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
 </span><span class="kw">enum </span>MatchLiteralType {
     <span class="doccomment">/// Match literals anywhere in text.
     </span>Unanchored,
     <span class="doccomment">/// Match literals only at the start of text.
     </span>AnchoredStart,
     <span class="doccomment">/// Match literals only at the end of text.
     </span>AnchoredEnd,
     <span class="doccomment">/// Use an Aho-Corasick automaton. This requires `ac` to be Some on
     /// ExecReadOnly.
     </span>AhoCorasick,
 }

 <span class="attribute">#[derive(Clone, Copy, Debug, Eq, PartialEq)]
 </span><span class="kw">enum </span>MatchNfaType {
     <span class="doccomment">/// Choose between Backtrack and PikeVM.
     </span>Auto,
     <span class="doccomment">/// NFA bounded backtracking.
     ///
     /// (This is only set by tests, since it never makes sense to always want
     /// backtracking.)
     </span>Backtrack,
     <span class="doccomment">/// The Pike VM.
     ///
     /// (This is only set by tests, since it never makes sense to always want
     /// the Pike VM.)
     </span>PikeVM,
 }

 <span class="doccomment">/// `ProgramCache` maintains reusable allocations for each matching engine
 /// available to a particular program.
 ///
 /// We declare this as unwind safe since it&#39;s a cache that&#39;s only used for
 /// performance purposes. If a panic occurs, it is (or should be) always safe
 /// to continue using the same regex object.
 </span><span class="kw">pub type </span>ProgramCache = AssertUnwindSafe&lt;RefCell&lt;ProgramCacheInner&gt;&gt;;

 <span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>ProgramCacheInner {
     <span class="kw">pub </span>pikevm: pikevm::Cache,
     <span class="kw">pub </span>backtrack: backtrack::Cache,
     <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span><span class="kw">pub </span>dfa: dfa::Cache,
     <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
     </span><span class="kw">pub </span>dfa_reverse: dfa::Cache,
 }

 <span class="kw">impl </span>ProgramCacheInner {
     <span class="kw">fn </span>new(ro: <span class="kw-2">&amp;</span>ExecReadOnly) -&gt; <span class="self">Self </span>{
         ProgramCacheInner {
             pikevm: pikevm::Cache::new(<span class="kw-2">&amp;</span>ro.nfa),
             backtrack: backtrack::Cache::new(<span class="kw-2">&amp;</span>ro.nfa),
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>dfa: dfa::Cache::new(<span class="kw-2">&amp;</span>ro.dfa),
             <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-dfa&quot;</span>)]
             </span>dfa_reverse: dfa::Cache::new(<span class="kw-2">&amp;</span>ro.dfa_reverse),
         }
     }
 }

 <span class="doccomment">/// Alternation literals checks if the given HIR is a simple alternation of
 /// literals, and if so, returns them. Otherwise, this returns None.
 </span><span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
 </span><span class="kw">fn </span>alternation_literals(expr: <span class="kw-2">&amp;</span>Hir) -&gt; <span class="prelude-ty">Option</span>&lt;Vec&lt;Vec&lt;u8&gt;&gt;&gt; {
     <span class="kw">use </span>regex_syntax::hir::{HirKind, Literal};

     <span class="comment">// This is pretty hacky, but basically, if `is_alternation_literal` is
     // true, then we can make several assumptions about the structure of our
     // HIR. This is what justifies the `unreachable!` statements below.
     //
     // This code should be refactored once we overhaul this crate&#39;s
     // optimization pipeline, because this is a terribly inflexible way to go
     // about things.

     </span><span class="kw">if </span>!expr.properties().is_alternation_literal() {
         <span class="kw">return </span><span class="prelude-val">None</span>;
     }
     <span class="kw">let </span>alts = <span class="kw">match </span><span class="kw-2">*</span>expr.kind() {
         HirKind::Alternation(<span class="kw-2">ref </span>alts) =&gt; alts,
         <span class="kw">_ </span>=&gt; <span class="kw">return </span><span class="prelude-val">None</span>, <span class="comment">// one literal isn&#39;t worth it
     </span>};

     <span class="kw">let </span><span class="kw-2">mut </span>lits = <span class="macro">vec!</span>[];
     <span class="kw">for </span>alt <span class="kw">in </span>alts {
         <span class="kw">let </span><span class="kw-2">mut </span>lit = <span class="macro">vec!</span>[];
         <span class="kw">match </span><span class="kw-2">*</span>alt.kind() {
             HirKind::Literal(Literal(<span class="kw-2">ref </span>bytes)) =&gt; {
                 lit.extend_from_slice(bytes)
             }
             HirKind::Concat(<span class="kw-2">ref </span>exprs) =&gt; {
                 <span class="kw">for </span>e <span class="kw">in </span>exprs {
                     <span class="kw">match </span><span class="kw-2">*</span>e.kind() {
                         HirKind::Literal(Literal(<span class="kw-2">ref </span>bytes)) =&gt; {
                             lit.extend_from_slice(bytes);
                         }
                         <span class="kw">_ </span>=&gt; <span class="macro">unreachable!</span>(<span class="string">&quot;expected literal, got {:?}&quot;</span>, e),
                     }
                 }
             }
             <span class="kw">_ </span>=&gt; <span class="macro">unreachable!</span>(<span class="string">&quot;expected literal or concat, got {:?}&quot;</span>, alt),
         }
         lits.push(lit);
     }
     <span class="prelude-val">Some</span>(lits)
 }

 <span class="attribute">#[cfg(not(feature = <span class="string">&quot;perf-literal&quot;</span>))]
 </span><span class="kw">fn </span>literal_analysis(<span class="kw">_</span>: <span class="kw-2">&amp;</span>Hir) -&gt; (literal::Seq, literal::Seq) {
     (literal::Seq::infinite(), literal::Seq::infinite())
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;perf-literal&quot;</span>)]
 </span><span class="kw">fn </span>literal_analysis(expr: <span class="kw-2">&amp;</span>Hir) -&gt; (literal::Seq, literal::Seq) {
     <span class="kw">const </span>ATTEMPTS: [(usize, usize); <span class="number">3</span>] = [(<span class="number">5</span>, <span class="number">50</span>), (<span class="number">4</span>, <span class="number">30</span>), (<span class="number">3</span>, <span class="number">20</span>)];

     <span class="kw">let </span><span class="kw-2">mut </span>prefixes = literal::Extractor::new()
         .kind(literal::ExtractKind::Prefix)
         .extract(expr);
     <span class="kw">for </span>(keep, limit) <span class="kw">in </span>ATTEMPTS {
         <span class="kw">let </span>len = <span class="kw">match </span>prefixes.len() {
             <span class="prelude-val">None </span>=&gt; <span class="kw">break</span>,
             <span class="prelude-val">Some</span>(len) =&gt; len,
         };
         <span class="kw">if </span>len &lt;= limit {
             <span class="kw">break</span>;
         }
         prefixes.keep_first_bytes(keep);
         prefixes.minimize_by_preference();
     }

     <span class="kw">let </span><span class="kw-2">mut </span>suffixes = literal::Extractor::new()
         .kind(literal::ExtractKind::Suffix)
         .extract(expr);
     <span class="kw">for </span>(keep, limit) <span class="kw">in </span>ATTEMPTS {
         <span class="kw">let </span>len = <span class="kw">match </span>suffixes.len() {
             <span class="prelude-val">None </span>=&gt; <span class="kw">break</span>,
             <span class="prelude-val">Some</span>(len) =&gt; len,
         };
         <span class="kw">if </span>len &lt;= limit {
             <span class="kw">break</span>;
         }
         suffixes.keep_last_bytes(keep);
         suffixes.minimize_by_preference();
     }

     (prefixes, suffixes)
 }

 <span class="attribute">#[cfg(test)]
 </span><span class="kw">mod </span>test {
     <span class="attribute">#[test]
     </span><span class="kw">fn </span>uppercut_s_backtracking_bytes_default_bytes_mismatch() {
         <span class="kw">use </span><span class="kw">crate</span>::internal::ExecBuilder;

         <span class="kw">let </span>backtrack_bytes_re = ExecBuilder::new(<span class="string">&quot;^S&quot;</span>)
             .bounded_backtracking()
             .only_utf8(<span class="bool-val">false</span>)
             .build()
             .map(|exec| exec.into_byte_regex())
             .map_err(|err| <span class="macro">format!</span>(<span class="string">&quot;{}&quot;</span>, err))
             .unwrap();

         <span class="kw">let </span>default_bytes_re = ExecBuilder::new(<span class="string">&quot;^S&quot;</span>)
             .only_utf8(<span class="bool-val">false</span>)
             .build()
             .map(|exec| exec.into_byte_regex())
             .map_err(|err| <span class="macro">format!</span>(<span class="string">&quot;{}&quot;</span>, err))
             .unwrap();

         <span class="kw">let </span>input = <span class="macro">vec!</span>[<span class="number">83</span>, <span class="number">83</span>];

         <span class="kw">let </span>s1 = backtrack_bytes_re.split(<span class="kw-2">&amp;</span>input);
         <span class="kw">let </span>s2 = default_bytes_re.split(<span class="kw-2">&amp;</span>input);
         <span class="kw">for </span>(chunk1, chunk2) <span class="kw">in </span>s1.zip(s2) {
             <span class="macro">assert_eq!</span>(chunk1, chunk2);
         }
     }

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>unicode_lit_star_backtracking_utf8bytes_default_utf8bytes_mismatch() {
         <span class="kw">use </span><span class="kw">crate</span>::internal::ExecBuilder;

         <span class="kw">let </span>backtrack_bytes_re = ExecBuilder::new(<span class="string">r&quot;^(?u:\*)&quot;</span>)
             .bounded_backtracking()
             .bytes(<span class="bool-val">true</span>)
             .build()
             .map(|exec| exec.into_regex())
             .map_err(|err| <span class="macro">format!</span>(<span class="string">&quot;{}&quot;</span>, err))
             .unwrap();

         <span class="kw">let </span>default_bytes_re = ExecBuilder::new(<span class="string">r&quot;^(?u:\*)&quot;</span>)
             .bytes(<span class="bool-val">true</span>)
             .build()
             .map(|exec| exec.into_regex())
             .map_err(|err| <span class="macro">format!</span>(<span class="string">&quot;{}&quot;</span>, err))
             .unwrap();

         <span class="kw">let </span>input = <span class="string">&quot;**&quot;</span>;

         <span class="kw">let </span>s1 = backtrack_bytes_re.split(input);
         <span class="kw">let </span>s2 = default_bytes_re.split(input);
         <span class="kw">for </span>(chunk1, chunk2) <span class="kw">in </span>s1.zip(s2) {
             <span class="macro">assert_eq!</span>(chunk1, chunk2);
         }
     }
 }
 </code></pre></div>
 </section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="regex" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>