Google Git
Sign in
apache / incubator-teaclave-website / refs/heads/asf-site / . / api-docs / crates-app / src / unicode_bidi / implicit.rs.html
blob: ecbfc13280a97965ebed3af01de30814cae590f2 [file] [log] [blame]
<!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/unicode-bidi-0.3.13/src/implicit.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>implicit.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="../../unicode_bidi/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="../../unicode_bidi/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>
</pre><pre class="rust"><code><span class="comment">// Copyright 2015 The Servo Project Developers. See the
// COPYRIGHT file at the top-level directory of this distribution.
//
// Licensed under the Apache License, Version 2.0 &lt;LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0&gt; or the MIT license
// &lt;LICENSE-MIT or http://opensource.org/licenses/MIT&gt;, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
</span><span class="doccomment">//! 3.3.4 - 3.3.6. Resolve implicit levels and types.
</span><span class="kw">use </span>alloc::vec::Vec;
<span class="kw">use </span>core::cmp::max;
<span class="kw">use </span><span class="kw">super</span>::char_data::BidiClass::{<span class="self">self</span>, <span class="kw-2">*</span>};
<span class="kw">use </span><span class="kw">super</span>::level::Level;
<span class="kw">use </span><span class="kw">super</span>::prepare::{not_removed_by_x9, removed_by_x9, IsolatingRunSequence};
<span class="kw">use </span><span class="kw">super</span>::BidiDataSource;
<span class="doccomment">/// 3.3.4 Resolving Weak Types
///
/// &lt;http://www.unicode.org/reports/tr9/#Resolving_Weak_Types&gt;
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
</span><span class="kw">pub fn </span>resolve_weak(
text: <span class="kw-2">&amp;</span>str,
sequence: <span class="kw-2">&amp;</span>IsolatingRunSequence,
processing_classes: <span class="kw-2">&amp;mut </span>[BidiClass],
) {
<span class="comment">// Note: The spec treats these steps as individual passes that are applied one after the other
// on the entire IsolatingRunSequence at once. We instead collapse it into a single iteration,
// which is straightforward for rules that are based on the state of the current character, but not
// for rules that care about surrounding characters. To deal with them, we retain additional state
// about previous character classes that may have since been changed by later rules.
// The previous class for the purposes of rule W4/W6, not tracking changes made after or during W4.
</span><span class="kw">let </span><span class="kw-2">mut </span>prev_class_before_w4 = sequence.sos;
<span class="comment">// The previous class for the purposes of rule W5.
</span><span class="kw">let </span><span class="kw-2">mut </span>prev_class_before_w5 = sequence.sos;
<span class="comment">// The previous class for the purposes of rule W1, not tracking changes from any other rules.
</span><span class="kw">let </span><span class="kw-2">mut </span>prev_class_before_w1 = sequence.sos;
<span class="kw">let </span><span class="kw-2">mut </span>last_strong_is_al = <span class="bool-val">false</span>;
<span class="kw">let </span><span class="kw-2">mut </span>et_run_indices = Vec::new(); <span class="comment">// for W5
</span><span class="kw">let </span><span class="kw-2">mut </span>bn_run_indices = Vec::new(); <span class="comment">// for W5 + &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
</span><span class="kw">for </span>(run_index, level_run) <span class="kw">in </span>sequence.runs.iter().enumerate() {
<span class="kw">for </span>i <span class="kw">in </span><span class="kw-2">&amp;mut </span>level_run.clone() {
<span class="kw">if </span>processing_classes[i] == BN {
<span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
// Keeps track of bn runs for W5 in case we see an ET.
</span>bn_run_indices.push(i);
<span class="comment">// BNs aren&#39;t real, skip over them.
</span><span class="kw">continue</span>;
}
<span class="comment">// Store the processing class of all rules before W2/W1.
// Used to keep track of the last strong character for W2. W3 is able to insert new strong
// characters, so we don&#39;t want to be misled by it.
</span><span class="kw">let </span><span class="kw-2">mut </span>w2_processing_class = processing_classes[i];
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W1&gt;
//
</span><span class="kw">if </span>processing_classes[i] == NSM {
processing_classes[i] = <span class="kw">match </span>prev_class_before_w1 {
RLI | LRI | FSI | PDI =&gt; ON,
<span class="kw">_ </span>=&gt; prev_class_before_w1,
};
<span class="comment">// W1 occurs before W2, update this.
</span>w2_processing_class = processing_classes[i];
}
prev_class_before_w1 = processing_classes[i];
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W2&gt;
// &lt;http://www.unicode.org/reports/tr9/#W3&gt;
//
</span><span class="kw">match </span>processing_classes[i] {
EN =&gt; {
<span class="kw">if </span>last_strong_is_al {
<span class="comment">// W2. If previous strong char was AL, change EN to AN.
</span>processing_classes[i] = AN;
}
}
<span class="comment">// W3.
</span>AL =&gt; processing_classes[i] = R,
<span class="kw">_ </span>=&gt; {}
}
<span class="comment">// update last_strong_is_al.
</span><span class="kw">match </span>w2_processing_class {
L | R =&gt; {
last_strong_is_al = <span class="bool-val">false</span>;
}
AL =&gt; {
last_strong_is_al = <span class="bool-val">true</span>;
}
<span class="kw">_ </span>=&gt; {}
}
<span class="kw">let </span>class_before_w456 = processing_classes[i];
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W4&gt;
// &lt;http://www.unicode.org/reports/tr9/#W5&gt;
// &lt;http://www.unicode.org/reports/tr9/#W6&gt; (separators only)
// (see below for W6 terminator code)
//
</span><span class="kw">match </span>processing_classes[i] {
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W6&gt;
</span>EN =&gt; {
<span class="comment">// W5. If a run of ETs is adjacent to an EN, change the ETs to EN.
</span><span class="kw">for </span>j <span class="kw">in </span><span class="kw-2">&amp;</span>et_run_indices {
processing_classes[<span class="kw-2">*</span>j] = EN;
}
et_run_indices.clear();
}
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W4&gt;
// &lt;http://www.unicode.org/reports/tr9/#W6&gt;
</span>ES | CS =&gt; {
<span class="comment">// See https://github.com/servo/unicode-bidi/issues/86 for improving this.
// We want to make sure we check the correct next character by skipping past the rest
// of this one.
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(ch) = text.get(i..).and_then(|s| s.chars().next()) {
<span class="kw">let </span><span class="kw-2">mut </span>next_class = sequence
.iter_forwards_from(i + ch.len_utf8(), run_index)
.map(|j| processing_classes[j])
<span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
</span>.find(not_removed_by_x9)
.unwrap_or(sequence.eos);
<span class="kw">if </span>next_class == EN &amp;&amp; last_strong_is_al {
<span class="comment">// Apply W2 to next_class. We know that last_strong_is_al
// has no chance of changing on this character so we can still assume its value
// will be the same by the time we get to it.
</span>next_class = AN;
}
processing_classes[i] =
<span class="kw">match </span>(prev_class_before_w4, processing_classes[i], next_class) {
<span class="comment">// W4
</span>(EN, ES, EN) | (EN, CS, EN) =&gt; EN,
<span class="comment">// W4
</span>(AN, CS, AN) =&gt; AN,
<span class="comment">// W6 (separators only)
</span>(<span class="kw">_</span>, <span class="kw">_</span>, <span class="kw">_</span>) =&gt; ON,
};
<span class="comment">// W6 + &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
// We have to do this before W5 gets its grubby hands on these characters and thinks
// they&#39;re part of an ET run.
// We check for ON to ensure that we had hit the W6 branch above, since this `ES | CS` match
// arm handles both W4 and W6.
</span><span class="kw">if </span>processing_classes[i] == ON {
<span class="kw">for </span>idx <span class="kw">in </span>sequence.iter_backwards_from(i, run_index) {
<span class="kw">let </span>class = <span class="kw-2">&amp;mut </span>processing_classes[idx];
<span class="kw">if </span><span class="kw-2">*</span>class != BN {
<span class="kw">break</span>;
}
<span class="kw-2">*</span>class = ON;
}
<span class="kw">for </span>idx <span class="kw">in </span>sequence.iter_forwards_from(i + ch.len_utf8(), run_index) {
<span class="kw">let </span>class = <span class="kw-2">&amp;mut </span>processing_classes[idx];
<span class="kw">if </span><span class="kw-2">*</span>class != BN {
<span class="kw">break</span>;
}
<span class="kw-2">*</span>class = ON;
}
}
} <span class="kw">else </span>{
<span class="comment">// We&#39;re in the middle of a character, copy over work done for previous bytes
// since it&#39;s going to be the same answer.
</span>processing_classes[i] = processing_classes[i - <span class="number">1</span>];
}
}
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W5&gt;
</span>ET =&gt; {
<span class="kw">match </span>prev_class_before_w5 {
EN =&gt; processing_classes[i] = EN,
<span class="kw">_ </span>=&gt; {
<span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
// If there was a BN run before this, that&#39;s now a part of this ET run.
</span>et_run_indices.extend(<span class="kw-2">&amp;</span>bn_run_indices);
<span class="comment">// In case this is followed by an EN.
</span>et_run_indices.push(i);
}
}
}
<span class="kw">_ </span>=&gt; {}
}
<span class="comment">// Common loop iteration code
//
// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
// BN runs would have already continued the loop, clear them before we get to the next one.
</span>bn_run_indices.clear();
<span class="comment">// W6 above only deals with separators, so it doesn&#39;t change anything W5 cares about,
// so we still can update this after running that part of W6.
</span>prev_class_before_w5 = processing_classes[i];
<span class="comment">// &lt;http://www.unicode.org/reports/tr9/#W6&gt; (terminators only)
// (see above for W6 separator code)
//
</span><span class="kw">if </span>prev_class_before_w5 != ET {
<span class="comment">// W6. If we didn&#39;t find an adjacent EN, turn any ETs into ON instead.
</span><span class="kw">for </span>j <span class="kw">in </span><span class="kw-2">&amp;</span>et_run_indices {
processing_classes[<span class="kw-2">*</span>j] = ON;
}
et_run_indices.clear();
}
<span class="comment">// We stashed this before W4/5/6 could get their grubby hands on it, and it&#39;s not
// used in the W6 terminator code below so we can update it now.
</span>prev_class_before_w4 = class_before_w456;
}
}
<span class="comment">// Rerun this check in case we ended with a sequence of BNs (i.e., we&#39;d never
// hit the end of the for loop above).
// W6. If we didn&#39;t find an adjacent EN, turn any ETs into ON instead.
</span><span class="kw">for </span>j <span class="kw">in </span><span class="kw-2">&amp;</span>et_run_indices {
processing_classes[<span class="kw-2">*</span>j] = ON;
}
et_run_indices.clear();
<span class="comment">// W7. If the previous strong char was L, change EN to L.
</span><span class="kw">let </span><span class="kw-2">mut </span>last_strong_is_l = sequence.sos == L;
<span class="kw">for </span>run <span class="kw">in </span><span class="kw-2">&amp;</span>sequence.runs {
<span class="kw">for </span>i <span class="kw">in </span>run.clone() {
<span class="kw">match </span>processing_classes[i] {
EN <span class="kw">if </span>last_strong_is_l =&gt; {
processing_classes[i] = L;
}
L =&gt; {
last_strong_is_l = <span class="bool-val">true</span>;
}
R | AL =&gt; {
last_strong_is_l = <span class="bool-val">false</span>;
}
<span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
// Already scanning past BN here.
</span><span class="kw">_ </span>=&gt; {}
}
}
}
}
<span class="doccomment">/// 3.3.5 Resolving Neutral Types
///
/// &lt;http://www.unicode.org/reports/tr9/#Resolving_Neutral_Types&gt;
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
</span><span class="kw">pub fn </span>resolve_neutral&lt;D: BidiDataSource&gt;(
text: <span class="kw-2">&amp;</span>str,
data_source: <span class="kw-2">&amp;</span>D,
sequence: <span class="kw-2">&amp;</span>IsolatingRunSequence,
levels: <span class="kw-2">&amp;</span>[Level],
original_classes: <span class="kw-2">&amp;</span>[BidiClass],
processing_classes: <span class="kw-2">&amp;mut </span>[BidiClass],
) {
<span class="comment">// e = embedding direction
</span><span class="kw">let </span>e: BidiClass = levels[sequence.runs[<span class="number">0</span>].start].bidi_class();
<span class="kw">let </span>not_e = <span class="kw">if </span>e == BidiClass::L {
BidiClass::R
} <span class="kw">else </span>{
BidiClass::L
};
<span class="comment">// N0. Process bracket pairs.
// &gt; Identify the bracket pairs in the current isolating run sequence according to BD16.
// We use processing_classes, not original_classes, due to BD14/BD15
</span><span class="kw">let </span>bracket_pairs = identify_bracket_pairs(text, data_source, sequence, processing_classes);
<span class="comment">// &gt; For each bracket-pair element in the list of pairs of text positions
//
// Note: Rust ranges are interpreted as [start..end), be careful using `pair` directly
// for indexing as it will include the opening bracket pair but not the closing one.
</span><span class="kw">for </span>pair <span class="kw">in </span>bracket_pairs {
<span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
</span><span class="macro">debug_assert!</span>(
pair.start &lt; processing_classes.len(),
<span class="string">&quot;identify_bracket_pairs returned a range that is out of bounds!&quot;
</span>);
<span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
</span><span class="macro">debug_assert!</span>(
pair.end &lt; processing_classes.len(),
<span class="string">&quot;identify_bracket_pairs returned a range that is out of bounds!&quot;
</span>);
<span class="kw">let </span><span class="kw-2">mut </span>found_e = <span class="bool-val">false</span>;
<span class="kw">let </span><span class="kw-2">mut </span>found_not_e = <span class="bool-val">false</span>;
<span class="kw">let </span><span class="kw-2">mut </span>class_to_set = <span class="prelude-val">None</span>;
<span class="kw">let </span>start_len_utf8 = text[pair.start..].chars().next().unwrap().len_utf8();
<span class="comment">// &gt; Inspect the bidirectional types of the characters enclosed within the bracket pair.
//
// `pair` is [start, end) so we will end up processing the opening character but not the closing one.
//
</span><span class="kw">for </span>enclosed_i <span class="kw">in </span>sequence.iter_forwards_from(pair.start + start_len_utf8, pair.start_run) {
<span class="kw">if </span>enclosed_i &gt;= pair.end {
<span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
</span><span class="macro">debug_assert!</span>(
enclosed_i == pair.end,
<span class="string">&quot;If we skipped past this, the iterator is broken&quot;
</span>);
<span class="kw">break</span>;
}
<span class="kw">let </span>class = processing_classes[enclosed_i];
<span class="kw">if </span>class == e {
found_e = <span class="bool-val">true</span>;
} <span class="kw">else if </span>class == not_e {
found_not_e = <span class="bool-val">true</span>;
} <span class="kw">else if </span>class == BidiClass::EN || class == BidiClass::AN {
<span class="comment">// &gt; Within this scope, bidirectional types EN and AN are treated as R.
</span><span class="kw">if </span>e == BidiClass::L {
found_not_e = <span class="bool-val">true</span>;
} <span class="kw">else </span>{
found_e = <span class="bool-val">true</span>;
}
}
<span class="comment">// If we have found a character with the class of the embedding direction
// we can bail early.
</span><span class="kw">if </span>found_e {
<span class="kw">break</span>;
}
}
<span class="comment">// &gt; If any strong type (either L or R) matching the embedding direction is found
</span><span class="kw">if </span>found_e {
<span class="comment">// &gt; .. set the type for both brackets in the pair to match the embedding direction
</span>class_to_set = <span class="prelude-val">Some</span>(e);
<span class="comment">// &gt; Otherwise, if there is a strong type it must be opposite the embedding direction
</span>} <span class="kw">else if </span>found_not_e {
<span class="comment">// &gt; Therefore, test for an established context with a preceding strong type by
// &gt; checking backwards before the opening paired bracket
// &gt; until the first strong type (L, R, or sos) is found.
// (see note above about processing_classes and character boundaries)
</span><span class="kw">let </span><span class="kw-2">mut </span>previous_strong = sequence
.iter_backwards_from(pair.start, pair.start_run)
.map(|i| processing_classes[i])
.find(|class| {
<span class="kw-2">*</span>class == BidiClass::L
|| <span class="kw-2">*</span>class == BidiClass::R
|| <span class="kw-2">*</span>class == BidiClass::EN
|| <span class="kw-2">*</span>class == BidiClass::AN
})
.unwrap_or(sequence.sos);
<span class="comment">// &gt; Within this scope, bidirectional types EN and AN are treated as R.
</span><span class="kw">if </span>previous_strong == BidiClass::EN || previous_strong == BidiClass::AN {
previous_strong = BidiClass::R;
}
<span class="comment">// &gt; If the preceding strong type is also opposite the embedding direction,
// &gt; context is established,
// &gt; so set the type for both brackets in the pair to that direction.
// AND
// &gt; Otherwise set the type for both brackets in the pair to the embedding direction.
// &gt; Either way it gets set to previous_strong
//
// Both branches amount to setting the type to the strong type.
</span>class_to_set = <span class="prelude-val">Some</span>(previous_strong);
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(class_to_set) = class_to_set {
<span class="comment">// Update all processing classes corresponding to the start and end elements, as requested.
// We should include all bytes of the character, not the first one.
</span><span class="kw">let </span>end_len_utf8 = text[pair.end..].chars().next().unwrap().len_utf8();
<span class="kw">for </span>class <span class="kw">in </span><span class="kw-2">&amp;mut </span>processing_classes[pair.start..pair.start + start_len_utf8] {
<span class="kw-2">*</span>class = class_to_set;
}
<span class="kw">for </span>class <span class="kw">in </span><span class="kw-2">&amp;mut </span>processing_classes[pair.end..pair.end + end_len_utf8] {
<span class="kw-2">*</span>class = class_to_set;
}
<span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
</span><span class="kw">for </span>idx <span class="kw">in </span>sequence.iter_backwards_from(pair.start, pair.start_run) {
<span class="kw">let </span>class = <span class="kw-2">&amp;mut </span>processing_classes[idx];
<span class="kw">if </span><span class="kw-2">*</span>class != BN {
<span class="kw">break</span>;
}
<span class="kw-2">*</span>class = class_to_set;
}
<span class="comment">// &gt; Any number of characters that had original bidirectional character type NSM prior to the application of
// &gt; W1 that immediately follow a paired bracket which changed to L or R under N0 should change to match the type of their preceding bracket.
// This rule deals with sequences of NSMs, so we can just update them all at once, we don&#39;t need to worry
// about character boundaries. We do need to be careful to skip the full set of bytes for the parentheses characters.
</span><span class="kw">let </span>nsm_start = pair.start + start_len_utf8;
<span class="kw">for </span>idx <span class="kw">in </span>sequence.iter_forwards_from(nsm_start, pair.start_run) {
<span class="kw">let </span>class = original_classes[idx];
<span class="kw">if </span>class == BidiClass::NSM || processing_classes[idx] == BN {
processing_classes[idx] = class_to_set;
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
<span class="kw">let </span>nsm_end = pair.end + end_len_utf8;
<span class="kw">for </span>idx <span class="kw">in </span>sequence.iter_forwards_from(nsm_end, pair.end_run) {
<span class="kw">let </span>class = original_classes[idx];
<span class="kw">if </span>class == BidiClass::NSM || processing_classes[idx] == BN {
processing_classes[idx] = class_to_set;
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
}
<span class="comment">// &gt; Otherwise, there are no strong types within the bracket pair
// &gt; Therefore, do not set the type for that bracket pair
</span>}
<span class="comment">// N1 and N2.
// Indices of every byte in this isolating run sequence
</span><span class="kw">let </span><span class="kw-2">mut </span>indices = sequence.runs.iter().flat_map(Clone::clone);
<span class="kw">let </span><span class="kw-2">mut </span>prev_class = sequence.sos;
<span class="kw">while let </span><span class="prelude-val">Some</span>(<span class="kw-2">mut </span>i) = indices.next() {
<span class="comment">// Process sequences of NI characters.
</span><span class="kw">let </span><span class="kw-2">mut </span>ni_run = Vec::new();
<span class="comment">// The BN is for &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
</span><span class="kw">if </span>is_NI(processing_classes[i]) || processing_classes[i] == BN {
<span class="comment">// Consume a run of consecutive NI characters.
</span>ni_run.push(i);
<span class="kw">let </span><span class="kw-2">mut </span>next_class;
<span class="kw">loop </span>{
<span class="kw">match </span>indices.next() {
<span class="prelude-val">Some</span>(j) =&gt; {
i = j;
next_class = processing_classes[j];
<span class="comment">// The BN is for &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
</span><span class="kw">if </span>is_NI(next_class) || next_class == BN {
ni_run.push(i);
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
<span class="prelude-val">None </span>=&gt; {
next_class = sequence.eos;
<span class="kw">break</span>;
}
};
}
<span class="comment">// N1-N2.
//
// &lt;http://www.unicode.org/reports/tr9/#N1&gt;
// &lt;http://www.unicode.org/reports/tr9/#N2&gt;
</span><span class="kw">let </span>new_class = <span class="kw">match </span>(prev_class, next_class) {
(L, L) =&gt; L,
(R, R)
| (R, AN)
| (R, EN)
| (AN, R)
| (AN, AN)
| (AN, EN)
| (EN, R)
| (EN, AN)
| (EN, EN) =&gt; R,
(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; e,
};
<span class="kw">for </span>j <span class="kw">in </span><span class="kw-2">&amp;</span>ni_run {
processing_classes[<span class="kw-2">*</span>j] = new_class;
}
ni_run.clear();
}
prev_class = processing_classes[i];
}
}
<span class="kw">struct </span>BracketPair {
<span class="doccomment">/// The text-relative index of the opening bracket.
</span>start: usize,
<span class="doccomment">/// The text-relative index of the closing bracket.
</span>end: usize,
<span class="doccomment">/// The index of the run (in the run sequence) that the opening bracket is in.
</span>start_run: usize,
<span class="doccomment">/// The index of the run (in the run sequence) that the closing bracket is in.
</span>end_run: usize,
}
<span class="doccomment">/// 3.1.3 Identifying Bracket Pairs
///
/// Returns all paired brackets in the source, as indices into the
/// text source.
///
/// &lt;https://www.unicode.org/reports/tr9/#BD16&gt;
</span><span class="kw">fn </span>identify_bracket_pairs&lt;D: BidiDataSource&gt;(
text: <span class="kw-2">&amp;</span>str,
data_source: <span class="kw-2">&amp;</span>D,
run_sequence: <span class="kw-2">&amp;</span>IsolatingRunSequence,
original_classes: <span class="kw-2">&amp;</span>[BidiClass],
) -&gt; Vec&lt;BracketPair&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="macro">vec!</span>[];
<span class="kw">let </span><span class="kw-2">mut </span>stack = <span class="macro">vec!</span>[];
<span class="kw">for </span>(run_index, level_run) <span class="kw">in </span>run_sequence.runs.iter().enumerate() {
<span class="kw">let </span>slice = <span class="kw">if let </span><span class="prelude-val">Some</span>(slice) = text.get(level_run.clone()) {
slice
} <span class="kw">else </span>{
<span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
</span><span class="macro">std::debug_assert!</span>(
<span class="bool-val">false</span>,
<span class="string">&quot;Found broken indices in level run: found indices {}..{} for string of length {}&quot;</span>,
level_run.start,
level_run.end,
text.len()
);
<span class="kw">return </span>ret;
};
<span class="kw">for </span>(i, ch) <span class="kw">in </span>slice.char_indices() {
<span class="kw">let </span>actual_index = level_run.start + i;
<span class="comment">// All paren characters are ON.
// From BidiBrackets.txt:
// &gt; The Unicode property value stability policy guarantees that characters
// &gt; which have bpt=o or bpt=c also have bc=ON and Bidi_M=Y
</span><span class="kw">if </span>original_classes[level_run.start + i] != BidiClass::ON {
<span class="kw">continue</span>;
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(matched) = data_source.bidi_matched_opening_bracket(ch) {
<span class="kw">if </span>matched.is_open {
<span class="comment">// &gt; If an opening paired bracket is found ...
// &gt; ... and there is no room in the stack,
// &gt; stop processing BD16 for the remainder of the isolating run sequence.
</span><span class="kw">if </span>stack.len() &gt;= <span class="number">63 </span>{
<span class="kw">break</span>;
}
<span class="comment">// &gt; ... push its Bidi_Paired_Bracket property value and its text position onto the stack
</span>stack.push((matched.opening, actual_index, run_index))
} <span class="kw">else </span>{
<span class="comment">// &gt; If a closing paired bracket is found, do the following
// &gt; Declare a variable that holds a reference to the current stack element
// &gt; and initialize it with the top element of the stack.
// AND
// &gt; Else, if the current stack element is not at the bottom of the stack
</span><span class="kw">for </span>(stack_index, element) <span class="kw">in </span>stack.iter().enumerate().rev() {
<span class="comment">// &gt; Compare the closing paired bracket being inspected or its canonical
// &gt; equivalent to the bracket in the current stack element.
</span><span class="kw">if </span>element.<span class="number">0 </span>== matched.opening {
<span class="comment">// &gt; If the values match, meaning the two characters form a bracket pair, then
// &gt; Append the text position in the current stack element together with the
// &gt; text position of the closing paired bracket to the list.
</span><span class="kw">let </span>pair = BracketPair {
start: element.<span class="number">1</span>,
end: actual_index,
start_run: element.<span class="number">2</span>,
end_run: run_index,
};
ret.push(pair);
<span class="comment">// &gt; Pop the stack through the current stack element inclusively.
</span>stack.truncate(stack_index);
<span class="kw">break</span>;
}
}
}
}
}
}
<span class="comment">// &gt; Sort the list of pairs of text positions in ascending order based on
// &gt; the text position of the opening paired bracket.
</span>ret.sort_by_key(|r| r.start);
ret
}
<span class="doccomment">/// 3.3.6 Resolving Implicit Levels
///
/// Returns the maximum embedding level in the paragraph.
///
/// &lt;http://www.unicode.org/reports/tr9/#Resolving_Implicit_Levels&gt;
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
</span><span class="kw">pub fn </span>resolve_levels(original_classes: <span class="kw-2">&amp;</span>[BidiClass], levels: <span class="kw-2">&amp;mut </span>[Level]) -&gt; Level {
<span class="kw">let </span><span class="kw-2">mut </span>max_level = Level::ltr();
<span class="macro">assert_eq!</span>(original_classes.len(), levels.len());
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..levels.len() {
<span class="kw">match </span>(levels[i].is_rtl(), original_classes[i]) {
(<span class="bool-val">false</span>, AN) | (<span class="bool-val">false</span>, EN) =&gt; levels[i].raise(<span class="number">2</span>).expect(<span class="string">&quot;Level number error&quot;</span>),
(<span class="bool-val">false</span>, R) | (<span class="bool-val">true</span>, L) | (<span class="bool-val">true</span>, EN) | (<span class="bool-val">true</span>, AN) =&gt; {
levels[i].raise(<span class="number">1</span>).expect(<span class="string">&quot;Level number error&quot;</span>)
}
<span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt; handled here
</span>(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; {}
}
max_level = max(max_level, levels[i]);
}
max_level
}
<span class="doccomment">/// Neutral or Isolate formatting character (B, S, WS, ON, FSI, LRI, RLI, PDI)
///
/// &lt;http://www.unicode.org/reports/tr9/#NI&gt;
</span><span class="attribute">#[allow(non_snake_case)]
</span><span class="kw">fn </span>is_NI(class: BidiClass) -&gt; bool {
<span class="kw">match </span>class {
B | S | WS | ON | FSI | LRI | RLI | PDI =&gt; <span class="bool-val">true</span>,
<span class="kw">_ </span>=&gt; <span class="bool-val">false</span>,
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="unicode_bidi" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>