api-docs/crates-app/src/unicode_bidi/lib.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/unicode-bidi-0.3.13/src/lib.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>lib.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>
 <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>
 </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">//! This crate implements the [Unicode Bidirectional Algorithm][tr9] for display of mixed
 //! right-to-left and left-to-right text.  It is written in safe Rust, compatible with the
 //! current stable release.
 //!
 //! ## Example
 //!
 //! ```rust
 //! # #[cfg(feature = &quot;hardcoded-data&quot;)] {
 //! use unicode_bidi::BidiInfo;
 //!
 //! // This example text is defined using `concat!` because some browsers
 //! // and text editors have trouble displaying bidi strings.
 //! let text = concat![
 //!   &quot;א&quot;,
 //!   &quot;ב&quot;,
 //!   &quot;ג&quot;,
 //!   &quot;a&quot;,
 //!   &quot;b&quot;,
 //!   &quot;c&quot;,
 //! ];
 //!
 //! // Resolve embedding levels within the text.  Pass `None` to detect the
 //! // paragraph level automatically.
 //! let bidi_info = BidiInfo::new(&amp;text, None);
 //!
 //! // This paragraph has embedding level 1 because its first strong character is RTL.
 //! assert_eq!(bidi_info.paragraphs.len(), 1);
 //! let para = &amp;bidi_info.paragraphs[0];
 //! assert_eq!(para.level.number(), 1);
 //! assert_eq!(para.level.is_rtl(), true);
 //!
 //! // Re-ordering is done after wrapping each paragraph into a sequence of
 //! // lines. For this example, I&#39;ll just use a single line that spans the
 //! // entire paragraph.
 //! let line = para.range.clone();
 //!
 //! let display = bidi_info.reorder_line(para, line);
 //! assert_eq!(display, concat![
 //!   &quot;a&quot;,
 //!   &quot;b&quot;,
 //!   &quot;c&quot;,
 //!   &quot;ג&quot;,
 //!   &quot;ב&quot;,
 //!   &quot;א&quot;,
 //! ]);
 //! # } // feature = &quot;hardcoded-data&quot;
 //! ```
 //!
 //! # Features
 //!
 //! - `std`: Enabled by default, but can be disabled to make `unicode_bidi`
 //!   `#![no_std]` + `alloc` compatible.
 //! - `hardcoded-data`: Enabled by default. Includes hardcoded Unicode bidi data and more convenient APIs.
 //! - `serde`: Adds [`serde::Serialize`] and [`serde::Deserialize`]
 //!   implementations to relevant types.
 //!
 //! [tr9]: &lt;http://www.unicode.org/reports/tr9/&gt;

 </span><span class="attribute">#![no_std]
 </span><span class="comment">// We need to link to std to make doc tests work on older Rust versions
 </span><span class="attribute">#[cfg(feature = <span class="string">&quot;std&quot;</span>)]
 </span><span class="kw">extern crate </span>std;
 <span class="attribute">#[macro_use]
 </span><span class="kw">extern crate </span>alloc;

 <span class="kw">pub mod </span>data_source;
 <span class="kw">pub mod </span>deprecated;
 <span class="kw">pub mod </span>format_chars;
 <span class="kw">pub mod </span>level;

 <span class="kw">mod </span>char_data;
 <span class="kw">mod </span>explicit;
 <span class="kw">mod </span>implicit;
 <span class="kw">mod </span>prepare;

 <span class="kw">pub use </span><span class="kw">crate</span>::char_data::{BidiClass, UNICODE_VERSION};
 <span class="kw">pub use </span><span class="kw">crate</span>::data_source::BidiDataSource;
 <span class="kw">pub use </span><span class="kw">crate</span>::level::{Level, LTR_LEVEL, RTL_LEVEL};
 <span class="kw">pub use </span><span class="kw">crate</span>::prepare::LevelRun;

 <span class="attribute">#[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
 </span><span class="kw">pub use </span><span class="kw">crate</span>::char_data::{bidi_class, HardcodedBidiData};

 <span class="kw">use </span>alloc::borrow::Cow;
 <span class="kw">use </span>alloc::string::String;
 <span class="kw">use </span>alloc::vec::Vec;
 <span class="kw">use </span>core::cmp;
 <span class="kw">use </span>core::iter::repeat;
 <span class="kw">use </span>core::ops::Range;

 <span class="kw">use </span><span class="kw">crate</span>::format_chars <span class="kw">as </span>chars;
 <span class="kw">use </span><span class="kw">crate</span>::BidiClass::<span class="kw-2">*</span>;

 <span class="attribute">#[derive(PartialEq, Debug)]
 </span><span class="kw">pub enum </span>Direction {
     Ltr,
     Rtl,
     Mixed,
 }

 <span class="doccomment">/// Bidi information about a single paragraph
 </span><span class="attribute">#[derive(Debug, PartialEq)]
 </span><span class="kw">pub struct </span>ParagraphInfo {
     <span class="doccomment">/// The paragraphs boundaries within the text, as byte indices.
     ///
     /// TODO: Shrink this to only include the starting index?
     </span><span class="kw">pub </span>range: Range&lt;usize&gt;,

     <span class="doccomment">/// The paragraph embedding level.
     ///
     /// &lt;http://www.unicode.org/reports/tr9/#BD4&gt;
     </span><span class="kw">pub </span>level: Level,
 }

 <span class="kw">impl </span>ParagraphInfo {
     <span class="doccomment">/// Gets the length of the paragraph in the source text.
     </span><span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.range.end - <span class="self">self</span>.range.start
     }
 }

 <span class="doccomment">/// Initial bidi information of the text.
 ///
 /// Contains the text paragraphs and `BidiClass` of its characters.
 </span><span class="attribute">#[derive(PartialEq, Debug)]
 </span><span class="kw">pub struct </span>InitialInfo&lt;<span class="lifetime">&#39;text</span>&gt; {
     <span class="doccomment">/// The text
     </span><span class="kw">pub </span>text: <span class="kw-2">&amp;</span><span class="lifetime">&#39;text </span>str,

     <span class="doccomment">/// The BidiClass of the character at each byte in the text.
     /// If a character is multiple bytes, its class will appear multiple times in the vector.
     </span><span class="kw">pub </span>original_classes: Vec&lt;BidiClass&gt;,

     <span class="doccomment">/// The boundaries and level of each paragraph within the text.
     </span><span class="kw">pub </span>paragraphs: Vec&lt;ParagraphInfo&gt;,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;text</span>&gt; InitialInfo&lt;<span class="lifetime">&#39;text</span>&gt; {
     <span class="doccomment">/// Find the paragraphs and BidiClasses in a string of text.
     ///
     /// &lt;http://www.unicode.org/reports/tr9/#The_Paragraph_Level&gt;
     ///
     /// Also sets the class for each First Strong Isolate initiator (FSI) to LRI or RLI if a strong
     /// character is found before the matching PDI.  If no strong character is found, the class will
     /// remain FSI, and it&#39;s up to later stages to treat these as LRI when needed.
     ///
     /// The `hardcoded-data` Cargo feature (enabled by default) must be enabled to use this.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">pub fn </span>new(text: <span class="kw-2">&amp;</span>str, default_para_level: <span class="prelude-ty">Option</span>&lt;Level&gt;) -&gt; InitialInfo&lt;<span class="lifetime">&#39;_</span>&gt; {
         <span class="self">Self</span>::new_with_data_source(<span class="kw-2">&amp;</span>HardcodedBidiData, text, default_para_level)
     }

     <span class="doccomment">/// Find the paragraphs and BidiClasses in a string of text, with a custom [`BidiDataSource`]
     /// for Bidi data. If you just wish to use the hardcoded Bidi data, please use [`InitialInfo::new()`]
     /// instead (enabled with tbe default `hardcoded-data` Cargo feature)
     ///
     /// &lt;http://www.unicode.org/reports/tr9/#The_Paragraph_Level&gt;
     ///
     /// Also sets the class for each First Strong Isolate initiator (FSI) to LRI or RLI if a strong
     /// character is found before the matching PDI.  If no strong character is found, the class will
     /// remain FSI, and it&#39;s up to later stages to treat these as LRI when needed.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     </span><span class="kw">pub fn </span>new_with_data_source&lt;<span class="lifetime">&#39;a</span>, D: BidiDataSource&gt;(
         data_source: <span class="kw-2">&amp;</span>D,
         text: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>str,
         default_para_level: <span class="prelude-ty">Option</span>&lt;Level&gt;,
     ) -&gt; InitialInfo&lt;<span class="lifetime">&#39;a</span>&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>original_classes = Vec::with_capacity(text.len());

         <span class="comment">// The stack contains the starting byte index for each nested isolate we&#39;re inside.
         </span><span class="kw">let </span><span class="kw-2">mut </span>isolate_stack = Vec::new();
         <span class="kw">let </span><span class="kw-2">mut </span>paragraphs = Vec::new();

         <span class="kw">let </span><span class="kw-2">mut </span>para_start = <span class="number">0</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>para_level = default_para_level;

         <span class="attribute">#[cfg(feature = <span class="string">&quot;flame_it&quot;</span>)]
         </span>flame::start(<span class="string">&quot;InitialInfo::new(): iter text.char_indices()&quot;</span>);

         <span class="kw">for </span>(i, c) <span class="kw">in </span>text.char_indices() {
             <span class="kw">let </span>class = data_source.bidi_class(c);

             <span class="attribute">#[cfg(feature = <span class="string">&quot;flame_it&quot;</span>)]
             </span>flame::start(<span class="string">&quot;original_classes.extend()&quot;</span>);

             original_classes.extend(repeat(class).take(c.len_utf8()));

             <span class="attribute">#[cfg(feature = <span class="string">&quot;flame_it&quot;</span>)]
             </span>flame::end(<span class="string">&quot;original_classes.extend()&quot;</span>);

             <span class="kw">match </span>class {
                 B =&gt; {
                     <span class="comment">// P1. Split the text into separate paragraphs. The paragraph separator is kept
                     // with the previous paragraph.
                     </span><span class="kw">let </span>para_end = i + c.len_utf8();
                     paragraphs.push(ParagraphInfo {
                         range: para_start..para_end,
                         <span class="comment">// P3. If no character is found in p2, set the paragraph level to zero.
                         </span>level: para_level.unwrap_or(LTR_LEVEL),
                     });
                     <span class="comment">// Reset state for the start of the next paragraph.
                     </span>para_start = para_end;
                     <span class="comment">// TODO: Support defaulting to direction of previous paragraph
                     //
                     // &lt;http://www.unicode.org/reports/tr9/#HL1&gt;
                     </span>para_level = default_para_level;
                     isolate_stack.clear();
                 }

                 L | R | AL =&gt; {
                     <span class="kw">match </span>isolate_stack.last() {
                         <span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>start) =&gt; {
                             <span class="kw">if </span>original_classes[start] == FSI {
                                 <span class="comment">// X5c. If the first strong character between FSI and its matching
                                 // PDI is R or AL, treat it as RLI. Otherwise, treat it as LRI.
                                 </span><span class="kw">for </span>j <span class="kw">in </span><span class="number">0</span>..chars::FSI.len_utf8() {
                                     original_classes[start + j] =
                                         <span class="kw">if </span>class == L { LRI } <span class="kw">else </span>{ RLI };
                                 }
                             }
                         }

                         <span class="prelude-val">None </span>=&gt; {
                             <span class="kw">if </span>para_level.is_none() {
                                 <span class="comment">// P2. Find the first character of type L, AL, or R, while skipping
                                 // any characters between an isolate initiator and its matching
                                 // PDI.
                                 </span>para_level = <span class="prelude-val">Some</span>(<span class="kw">if </span>class != L { RTL_LEVEL } <span class="kw">else </span>{ LTR_LEVEL });
                             }
                         }
                     }
                 }

                 RLI | LRI | FSI =&gt; {
                     isolate_stack.push(i);
                 }

                 PDI =&gt; {
                     isolate_stack.pop();
                 }

                 <span class="kw">_ </span>=&gt; {}
             }
         }
         <span class="kw">if </span>para_start &lt; text.len() {
             paragraphs.push(ParagraphInfo {
                 range: para_start..text.len(),
                 level: para_level.unwrap_or(LTR_LEVEL),
             });
         }
         <span class="macro">assert_eq!</span>(original_classes.len(), text.len());

         <span class="attribute">#[cfg(feature = <span class="string">&quot;flame_it&quot;</span>)]
         </span>flame::end(<span class="string">&quot;InitialInfo::new(): iter text.char_indices()&quot;</span>);

         InitialInfo {
             text,
             original_classes,
             paragraphs,
         }
     }
 }

 <span class="doccomment">/// Bidi information of the text.
 ///
 /// The `original_classes` and `levels` vectors are indexed by byte offsets into the text.  If a
 /// character is multiple bytes wide, then its class and level will appear multiple times in these
 /// vectors.
 </span><span class="comment">// TODO: Impl `struct StringProperty&lt;T&gt; { values: Vec&lt;T&gt; }` and use instead of Vec&lt;T&gt;
 </span><span class="attribute">#[derive(Debug, PartialEq)]
 </span><span class="kw">pub struct </span>BidiInfo&lt;<span class="lifetime">&#39;text</span>&gt; {
     <span class="doccomment">/// The text
     </span><span class="kw">pub </span>text: <span class="kw-2">&amp;</span><span class="lifetime">&#39;text </span>str,

     <span class="doccomment">/// The BidiClass of the character at each byte in the text.
     </span><span class="kw">pub </span>original_classes: Vec&lt;BidiClass&gt;,

     <span class="doccomment">/// The directional embedding level of each byte in the text.
     </span><span class="kw">pub </span>levels: Vec&lt;Level&gt;,

     <span class="doccomment">/// The boundaries and paragraph embedding level of each paragraph within the text.
     ///
     /// TODO: Use SmallVec or similar to avoid overhead when there are only one or two paragraphs?
     /// Or just don&#39;t include the first paragraph, which always starts at 0?
     </span><span class="kw">pub </span>paragraphs: Vec&lt;ParagraphInfo&gt;,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;text</span>&gt; BidiInfo&lt;<span class="lifetime">&#39;text</span>&gt; {
     <span class="doccomment">/// Split the text into paragraphs and determine the bidi embedding levels for each paragraph.
     ///
     ///
     /// The `hardcoded-data` Cargo feature (enabled by default) must be enabled to use this.
     ///
     /// TODO: In early steps, check for special cases that allow later steps to be skipped. like
     /// text that is entirely LTR.  See the `nsBidi` class from Gecko for comparison.
     ///
     /// TODO: Support auto-RTL base direction
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">pub fn </span>new(text: <span class="kw-2">&amp;</span>str, default_para_level: <span class="prelude-ty">Option</span>&lt;Level&gt;) -&gt; BidiInfo&lt;<span class="lifetime">&#39;_</span>&gt; {
         <span class="self">Self</span>::new_with_data_source(<span class="kw-2">&amp;</span>HardcodedBidiData, text, default_para_level)
     }

     <span class="doccomment">/// Split the text into paragraphs and determine the bidi embedding levels for each paragraph, with a custom [`BidiDataSource`]
     /// for Bidi data. If you just wish to use the hardcoded Bidi data, please use [`BidiInfo::new()`]
     /// instead (enabled with tbe default `hardcoded-data` Cargo feature).
     ///
     /// TODO: In early steps, check for special cases that allow later steps to be skipped. like
     /// text that is entirely LTR.  See the `nsBidi` class from Gecko for comparison.
     ///
     /// TODO: Support auto-RTL base direction
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     </span><span class="kw">pub fn </span>new_with_data_source&lt;<span class="lifetime">&#39;a</span>, D: BidiDataSource&gt;(
         data_source: <span class="kw-2">&amp;</span>D,
         text: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>str,
         default_para_level: <span class="prelude-ty">Option</span>&lt;Level&gt;,
     ) -&gt; BidiInfo&lt;<span class="lifetime">&#39;a</span>&gt; {
         <span class="kw">let </span>InitialInfo {
             original_classes,
             paragraphs,
             ..
         } = InitialInfo::new_with_data_source(data_source, text, default_para_level);

         <span class="kw">let </span><span class="kw-2">mut </span>levels = Vec::&lt;Level&gt;::with_capacity(text.len());
         <span class="kw">let </span><span class="kw-2">mut </span>processing_classes = original_classes.clone();

         <span class="kw">for </span>para <span class="kw">in </span><span class="kw-2">&amp;</span>paragraphs {
             <span class="kw">let </span>text = <span class="kw-2">&amp;</span>text[para.range.clone()];
             <span class="kw">let </span>original_classes = <span class="kw-2">&amp;</span>original_classes[para.range.clone()];
             <span class="kw">let </span>processing_classes = <span class="kw-2">&amp;mut </span>processing_classes[para.range.clone()];

             <span class="kw">let </span>new_len = levels.len() + para.range.len();
             levels.resize(new_len, para.level);
             <span class="kw">let </span>levels = <span class="kw-2">&amp;mut </span>levels[para.range.clone()];

             explicit::compute(
                 text,
                 para.level,
                 original_classes,
                 levels,
                 processing_classes,
             );

             <span class="kw">let </span>sequences = prepare::isolating_run_sequences(para.level, original_classes, levels);
             <span class="kw">for </span>sequence <span class="kw">in </span><span class="kw-2">&amp;</span>sequences {
                 implicit::resolve_weak(text, sequence, processing_classes);
                 implicit::resolve_neutral(
                     text,
                     data_source,
                     sequence,
                     levels,
                     original_classes,
                     processing_classes,
                 );
             }
             implicit::resolve_levels(processing_classes, levels);

             assign_levels_to_removed_chars(para.level, original_classes, levels);
         }

         BidiInfo {
             text,
             original_classes,
             paragraphs,
             levels,
         }
     }

     <span class="doccomment">/// Re-order a line based on resolved levels and return only the embedding levels, one `Level`
     /// per *byte*.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     </span><span class="kw">pub fn </span>reordered_levels(<span class="kw-2">&amp;</span><span class="self">self</span>, para: <span class="kw-2">&amp;</span>ParagraphInfo, line: Range&lt;usize&gt;) -&gt; Vec&lt;Level&gt; {
         <span class="kw">let </span>(levels, <span class="kw">_</span>) = <span class="self">self</span>.visual_runs(para, line);
         levels
     }

     <span class="doccomment">/// Re-order a line based on resolved levels and return only the embedding levels, one `Level`
     /// per *character*.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     </span><span class="kw">pub fn </span>reordered_levels_per_char(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         para: <span class="kw-2">&amp;</span>ParagraphInfo,
         line: Range&lt;usize&gt;,
     ) -&gt; Vec&lt;Level&gt; {
         <span class="kw">let </span>levels = <span class="self">self</span>.reordered_levels(para, line);
         <span class="self">self</span>.text.char_indices().map(|(i, <span class="kw">_</span>)| levels[i]).collect()
     }

     <span class="doccomment">/// Re-order a line based on resolved levels and return the line in display order.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
     </span><span class="kw">pub fn </span>reorder_line(<span class="kw-2">&amp;</span><span class="self">self</span>, para: <span class="kw-2">&amp;</span>ParagraphInfo, line: Range&lt;usize&gt;) -&gt; Cow&lt;<span class="lifetime">&#39;text</span>, str&gt; {
         <span class="kw">let </span>(levels, runs) = <span class="self">self</span>.visual_runs(para, line.clone());

         <span class="comment">// If all isolating run sequences are LTR, no reordering is needed
         </span><span class="kw">if </span>runs.iter().all(|run| levels[run.start].is_ltr()) {
             <span class="kw">return </span><span class="self">self</span>.text[line].into();
         }

         <span class="kw">let </span><span class="kw-2">mut </span>result = String::with_capacity(line.len());
         <span class="kw">for </span>run <span class="kw">in </span>runs {
             <span class="kw">if </span>levels[run.start].is_rtl() {
                 result.extend(<span class="self">self</span>.text[run].chars().rev());
             } <span class="kw">else </span>{
                 result.push_str(<span class="kw-2">&amp;</span><span class="self">self</span>.text[run]);
             }
         }
         result.into()
     }

     <span class="doccomment">/// Reorders pre-calculated levels of a sequence of characters.
     ///
     /// NOTE: This is a convenience method that does not use a `Paragraph`  object. It is
     /// intended to be used when an application has determined the levels of the objects (character sequences)
     /// and just needs to have them reordered.
     ///
     /// the index map will result in `indexMap[visualIndex]==logicalIndex`.
     ///
     /// This only runs [Rule L2](http://www.unicode.org/reports/tr9/#L2) as it does not have
     /// information about the actual text.
     ///
     /// Furthermore, if `levels` is an array that is aligned with code units, bytes within a codepoint may be
     /// reversed. You may need to fix up the map to deal with this. Alternatively, only pass in arrays where each `Level`
     /// is for a single code point.
     ///
     ///
     ///   # # Example
     /// ```
     /// use unicode_bidi::BidiInfo;
     /// use unicode_bidi::Level;
     ///
     /// let l0 = Level::from(0);
     /// let l1 = Level::from(1);
     /// let l2 = Level::from(2);
     ///
     /// let levels = vec![l0, l0, l0, l0];
     /// let index_map = BidiInfo::reorder_visual(&amp;levels);
     /// assert_eq!(levels.len(), index_map.len());
     /// assert_eq!(index_map, [0, 1, 2, 3]);
     ///
     /// let levels: Vec&lt;Level&gt; = vec![l0, l0, l0, l1, l1, l1, l2, l2];
     /// let index_map = BidiInfo::reorder_visual(&amp;levels);
     /// assert_eq!(levels.len(), index_map.len());
     /// assert_eq!(index_map, [0, 1, 2, 6, 7, 5, 4, 3]);
     /// ```
     </span><span class="kw">pub fn </span>reorder_visual(levels: <span class="kw-2">&amp;</span>[Level]) -&gt; Vec&lt;usize&gt; {
         <span class="comment">// Gets the next range of characters after start_index with a level greater
         // than or equal to `max`
         </span><span class="kw">fn </span>next_range(levels: <span class="kw-2">&amp;</span>[level::Level], <span class="kw-2">mut </span>start_index: usize, max: Level) -&gt; Range&lt;usize&gt; {
             <span class="kw">if </span>levels.is_empty() || start_index &gt;= levels.len() {
                 <span class="kw">return </span>start_index..start_index;
             }
             <span class="kw">while let </span><span class="prelude-val">Some</span>(l) = levels.get(start_index) {
                 <span class="kw">if </span><span class="kw-2">*</span>l &gt;= max {
                     <span class="kw">break</span>;
                 }
                 start_index += <span class="number">1</span>;
             }

             <span class="kw">if </span>levels.get(start_index).is_none() {
                 <span class="comment">// If at the end of the array, adding one will
                 // produce an out-of-range end element
                 </span><span class="kw">return </span>start_index..start_index;
             }

             <span class="kw">let </span><span class="kw-2">mut </span>end_index = start_index + <span class="number">1</span>;
             <span class="kw">while let </span><span class="prelude-val">Some</span>(l) = levels.get(end_index) {
                 <span class="kw">if </span><span class="kw-2">*</span>l &lt; max {
                     <span class="kw">return </span>start_index..end_index;
                 }
                 end_index += <span class="number">1</span>;
             }

             start_index..end_index
         }

         <span class="comment">// This implementation is similar to the L2 implementation in `visual_runs()`
         // but it cannot benefit from a precalculated LevelRun vector so needs to be different.

         </span><span class="kw">if </span>levels.is_empty() {
             <span class="kw">return </span><span class="macro">vec!</span>[];
         }

         <span class="comment">// Get the min and max levels
         </span><span class="kw">let </span>(<span class="kw-2">mut </span>min, <span class="kw-2">mut </span>max) = levels
             .iter()
             .fold((levels[<span class="number">0</span>], levels[<span class="number">0</span>]), |(min, max), <span class="kw-2">&amp;</span>l| {
                 (cmp::min(min, l), cmp::max(max, l))
             });

         <span class="comment">// Initialize an index map
         </span><span class="kw">let </span><span class="kw-2">mut </span>result: Vec&lt;usize&gt; = (<span class="number">0</span>..levels.len()).collect();

         <span class="kw">if </span>min == max &amp;&amp; min.is_ltr() {
             <span class="comment">// Everything is LTR and at the same level, do nothing
             </span><span class="kw">return </span>result;
         }

         <span class="comment">// Stop at the lowest *odd* level, since everything below that
         // is LTR and does not need further reordering
         </span>min = min.new_lowest_ge_rtl().expect(<span class="string">&quot;Level error&quot;</span>);

         <span class="comment">// For each max level, take all contiguous chunks of
         // levels ≥ max and reverse them
         //
         // We can do this check with the original levels instead of checking reorderings because all
         // prior reorderings will have been for contiguous chunks of levels &gt;&gt; max, which will
         // be a subset of these chunks anyway.
         </span><span class="kw">while </span>min &lt;= max {
             <span class="kw">let </span><span class="kw-2">mut </span>range = <span class="number">0</span>..<span class="number">0</span>;
             <span class="kw">loop </span>{
                 range = next_range(levels, range.end, max);
                 result[range.clone()].reverse();

                 <span class="kw">if </span>range.end &gt;= levels.len() {
                     <span class="kw">break</span>;
                 }
             }

             max.lower(<span class="number">1</span>).expect(<span class="string">&quot;Level error&quot;</span>);
         }

         result
     }

     <span class="doccomment">/// Find the level runs within a line and return them in visual order.
     ///
     /// `line` is a range of bytes indices within `levels`.
     ///
     /// &lt;http://www.unicode.org/reports/tr9/#Reordering_Resolved_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>visual_runs(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         para: <span class="kw-2">&amp;</span>ParagraphInfo,
         line: Range&lt;usize&gt;,
     ) -&gt; (Vec&lt;Level&gt;, Vec&lt;LevelRun&gt;) {
         <span class="macro">assert!</span>(line.start &lt;= <span class="self">self</span>.levels.len());
         <span class="macro">assert!</span>(line.end &lt;= <span class="self">self</span>.levels.len());

         <span class="kw">let </span><span class="kw-2">mut </span>levels = <span class="self">self</span>.levels.clone();
         <span class="kw">let </span>line_classes = <span class="kw-2">&amp;</span><span class="self">self</span>.original_classes[line.clone()];
         <span class="kw">let </span>line_levels = <span class="kw-2">&amp;mut </span>levels[line.clone()];

         <span class="comment">// Reset some whitespace chars to paragraph level.
         // &lt;http://www.unicode.org/reports/tr9/#L1&gt;
         </span><span class="kw">let </span>line_str: <span class="kw-2">&amp;</span>str = <span class="kw-2">&amp;</span><span class="self">self</span>.text[line.clone()];
         <span class="kw">let </span><span class="kw-2">mut </span>reset_from: <span class="prelude-ty">Option</span>&lt;usize&gt; = <span class="prelude-val">Some</span>(<span class="number">0</span>);
         <span class="kw">let </span><span class="kw-2">mut </span>reset_to: <span class="prelude-ty">Option</span>&lt;usize&gt; = <span class="prelude-val">None</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>prev_level = para.level;
         <span class="kw">for </span>(i, c) <span class="kw">in </span>line_str.char_indices() {
             <span class="kw">match </span>line_classes[i] {
                 <span class="comment">// Segment separator, Paragraph separator
                 </span>B | S =&gt; {
                     <span class="macro">assert_eq!</span>(reset_to, <span class="prelude-val">None</span>);
                     reset_to = <span class="prelude-val">Some</span>(i + c.len_utf8());
                     <span class="kw">if </span>reset_from == <span class="prelude-val">None </span>{
                         reset_from = <span class="prelude-val">Some</span>(i);
                     }
                 }
                 <span class="comment">// Whitespace, isolate formatting
                 </span>WS | FSI | LRI | RLI | PDI =&gt; {
                     <span class="kw">if </span>reset_from == <span class="prelude-val">None </span>{
                         reset_from = <span class="prelude-val">Some</span>(i);
                     }
                 }
                 <span class="comment">// &lt;https://www.unicode.org/reports/tr9/#Retaining_Explicit_Formatting_Characters&gt;
                 // same as above + set the level
                 </span>RLE | LRE | RLO | LRO | PDF | BN =&gt; {
                     <span class="kw">if </span>reset_from == <span class="prelude-val">None </span>{
                         reset_from = <span class="prelude-val">Some</span>(i);
                     }
                     <span class="comment">// also set the level to previous
                     </span>line_levels[i] = prev_level;
                 }
                 <span class="kw">_ </span>=&gt; {
                     reset_from = <span class="prelude-val">None</span>;
                 }
             }
             <span class="kw">if let </span>(<span class="prelude-val">Some</span>(from), <span class="prelude-val">Some</span>(to)) = (reset_from, reset_to) {
                 <span class="kw">for </span>level <span class="kw">in </span><span class="kw-2">&amp;mut </span>line_levels[from..to] {
                     <span class="kw-2">*</span>level = para.level;
                 }
                 reset_from = <span class="prelude-val">None</span>;
                 reset_to = <span class="prelude-val">None</span>;
             }
             prev_level = line_levels[i];
         }
         <span class="kw">if let </span><span class="prelude-val">Some</span>(from) = reset_from {
             <span class="kw">for </span>level <span class="kw">in </span><span class="kw-2">&amp;mut </span>line_levels[from..] {
                 <span class="kw-2">*</span>level = para.level;
             }
         }

         <span class="comment">// Find consecutive level runs.
         </span><span class="kw">let </span><span class="kw-2">mut </span>runs = Vec::new();
         <span class="kw">let </span><span class="kw-2">mut </span>start = line.start;
         <span class="kw">let </span><span class="kw-2">mut </span>run_level = levels[start];
         <span class="kw">let </span><span class="kw-2">mut </span>min_level = run_level;
         <span class="kw">let </span><span class="kw-2">mut </span>max_level = run_level;

         <span class="kw">for </span>(i, <span class="kw-2">&amp;</span>new_level) <span class="kw">in </span>levels.iter().enumerate().take(line.end).skip(start + <span class="number">1</span>) {
             <span class="kw">if </span>new_level != run_level {
                 <span class="comment">// End of the previous run, start of a new one.
                 </span>runs.push(start..i);
                 start = i;
                 run_level = new_level;
                 min_level = cmp::min(run_level, min_level);
                 max_level = cmp::max(run_level, max_level);
             }
         }
         runs.push(start..line.end);

         <span class="kw">let </span>run_count = runs.len();

         <span class="comment">// Re-order the odd runs.
         // &lt;http://www.unicode.org/reports/tr9/#L2&gt;

         // Stop at the lowest *odd* level.
         </span>min_level = min_level.new_lowest_ge_rtl().expect(<span class="string">&quot;Level error&quot;</span>);

         <span class="comment">// This loop goes through contiguous chunks of level runs that have a level
         // ≥ max_level and reverses their contents, reducing max_level by 1 each time.
         //
         // It can do this check with the original levels instead of checking reorderings because all
         // prior reorderings will have been for contiguous chunks of levels &gt;&gt; max, which will
         // be a subset of these chunks anyway.
         </span><span class="kw">while </span>max_level &gt;= min_level {
             <span class="comment">// Look for the start of a sequence of consecutive runs of max_level or higher.
             </span><span class="kw">let </span><span class="kw-2">mut </span>seq_start = <span class="number">0</span>;
             <span class="kw">while </span>seq_start &lt; run_count {
                 <span class="kw">if </span><span class="self">self</span>.levels[runs[seq_start].start] &lt; max_level {
                     seq_start += <span class="number">1</span>;
                     <span class="kw">continue</span>;
                 }

                 <span class="comment">// Found the start of a sequence. Now find the end.
                 </span><span class="kw">let </span><span class="kw-2">mut </span>seq_end = seq_start + <span class="number">1</span>;
                 <span class="kw">while </span>seq_end &lt; run_count {
                     <span class="kw">if </span><span class="self">self</span>.levels[runs[seq_end].start] &lt; max_level {
                         <span class="kw">break</span>;
                     }
                     seq_end += <span class="number">1</span>;
                 }

                 <span class="comment">// Reverse the runs within this sequence.
                 </span>runs[seq_start..seq_end].reverse();

                 seq_start = seq_end;
             }
             max_level
                 .lower(<span class="number">1</span>)
                 .expect(<span class="string">&quot;Lowering embedding level below zero&quot;</span>);
         }

         (levels, runs)
     }

     <span class="doccomment">/// If processed text has any computed RTL levels
     ///
     /// This information is usually used to skip re-ordering of text when no RTL level is present
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>has_rtl(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         level::has_rtl(<span class="kw-2">&amp;</span><span class="self">self</span>.levels)
     }
 }

 <span class="doccomment">/// Contains a reference of `BidiInfo` and one of its `paragraphs`.
 /// And it supports all operation in the `Paragraph` that needs also its
 /// `BidiInfo` such as `direction`.
 </span><span class="attribute">#[derive(Debug)]
 </span><span class="kw">pub struct </span>Paragraph&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;text</span>&gt; {
     <span class="kw">pub </span>info: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>BidiInfo&lt;<span class="lifetime">&#39;text</span>&gt;,
     <span class="kw">pub </span>para: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>ParagraphInfo,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;text</span>&gt; Paragraph&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;text</span>&gt; {
     <span class="kw">pub fn </span>new(info: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>BidiInfo&lt;<span class="lifetime">&#39;text</span>&gt;, para: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>ParagraphInfo) -&gt; Paragraph&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;text</span>&gt; {
         Paragraph { info, para }
     }

     <span class="doccomment">/// Returns if the paragraph is Left direction, right direction or mixed.
     </span><span class="kw">pub fn </span>direction(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Direction {
         <span class="kw">let </span><span class="kw-2">mut </span>ltr = <span class="bool-val">false</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>rtl = <span class="bool-val">false</span>;
         <span class="kw">for </span>i <span class="kw">in </span><span class="self">self</span>.para.range.clone() {
             <span class="kw">if </span><span class="self">self</span>.info.levels[i].is_ltr() {
                 ltr = <span class="bool-val">true</span>;
             }

             <span class="kw">if </span><span class="self">self</span>.info.levels[i].is_rtl() {
                 rtl = <span class="bool-val">true</span>;
             }
         }

         <span class="kw">if </span>ltr &amp;&amp; rtl {
             <span class="kw">return </span>Direction::Mixed;
         }

         <span class="kw">if </span>ltr {
             <span class="kw">return </span>Direction::Ltr;
         }

         Direction::Rtl
     }

     <span class="doccomment">/// Returns the `Level` of a certain character in the paragraph.
     </span><span class="kw">pub fn </span>level_at(<span class="kw-2">&amp;</span><span class="self">self</span>, pos: usize) -&gt; Level {
         <span class="kw">let </span>actual_position = <span class="self">self</span>.para.range.start + pos;
         <span class="self">self</span>.info.levels[actual_position]
     }
 }

 <span class="doccomment">/// Assign levels to characters removed by rule X9.
 ///
 /// The levels assigned to these characters are not specified by the algorithm.  This function
 /// assigns each one the level of the previous character, to avoid breaking level runs.
 </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;flame_it&quot;</span>, flamer::flame)]
 </span><span class="kw">fn </span>assign_levels_to_removed_chars(para_level: Level, classes: <span class="kw-2">&amp;</span>[BidiClass], levels: <span class="kw-2">&amp;mut </span>[Level]) {
     <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..levels.len() {
         <span class="kw">if </span>prepare::removed_by_x9(classes[i]) {
             levels[i] = <span class="kw">if </span>i &gt; <span class="number">0 </span>{ levels[i - <span class="number">1</span>] } <span class="kw">else </span>{ para_level };
         }
     }
 }

 <span class="attribute">#[cfg(test)]
 #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
 </span><span class="kw">mod </span>tests {
     <span class="kw">use super</span>::<span class="kw-2">*</span>;

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_initial_text_info() {
         <span class="kw">let </span>text = <span class="string">&quot;a1&quot;</span>;
         <span class="macro">assert_eq!</span>(
             InitialInfo::new(text, <span class="prelude-val">None</span>),
             InitialInfo {
                 text,
                 original_classes: <span class="macro">vec!</span>[L, EN],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">2</span>,
                     level: LTR_LEVEL,
                 },],
             }
         );

         <span class="kw">let </span>text = <span class="string">&quot;غ א&quot;</span>;
         <span class="macro">assert_eq!</span>(
             InitialInfo::new(text, <span class="prelude-val">None</span>),
             InitialInfo {
                 text,
                 original_classes: <span class="macro">vec!</span>[AL, AL, WS, R, R],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">5</span>,
                     level: RTL_LEVEL,
                 },],
             }
         );

         <span class="kw">let </span>text = <span class="string">&quot;a\u{2029}b&quot;</span>;
         <span class="macro">assert_eq!</span>(
             InitialInfo::new(text, <span class="prelude-val">None</span>),
             InitialInfo {
                 text,
                 original_classes: <span class="macro">vec!</span>[L, B, B, B, L],
                 paragraphs: <span class="macro">vec!</span>[
                     ParagraphInfo {
                         range: <span class="number">0</span>..<span class="number">4</span>,
                         level: LTR_LEVEL,
                     },
                     ParagraphInfo {
                         range: <span class="number">4</span>..<span class="number">5</span>,
                         level: LTR_LEVEL,
                     },
                 ],
             }
         );

         <span class="kw">let </span>text = <span class="macro">format!</span>(<span class="string">&quot;{}א{}a&quot;</span>, chars::FSI, chars::PDI);
         <span class="macro">assert_eq!</span>(
             InitialInfo::new(<span class="kw-2">&amp;</span>text, <span class="prelude-val">None</span>),
             InitialInfo {
                 text: <span class="kw-2">&amp;</span>text,
                 original_classes: <span class="macro">vec!</span>[RLI, RLI, RLI, R, R, PDI, PDI, PDI, L],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">9</span>,
                     level: LTR_LEVEL,
                 },],
             }
         );
     }

     <span class="attribute">#[test]
     #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">fn </span>test_process_text() {
         <span class="kw">let </span>text = <span class="string">&quot;abc123&quot;</span>;
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">Some</span>(LTR_LEVEL)),
             BidiInfo {
                 text,
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>]),
                 original_classes: <span class="macro">vec!</span>[L, L, L, EN, EN, EN],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">6</span>,
                     level: LTR_LEVEL,
                 },],
             }
         );

         <span class="kw">let </span>text = <span class="string">&quot;abc אבג&quot;</span>;
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">Some</span>(LTR_LEVEL)),
             BidiInfo {
                 text,
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>]),
                 original_classes: <span class="macro">vec!</span>[L, L, L, WS, R, R, R, R, R, R],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">10</span>,
                     level: LTR_LEVEL,
                 },],
             }
         );
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">Some</span>(RTL_LEVEL)),
             BidiInfo {
                 text,
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">2</span>, <span class="number">2</span>, <span class="number">2</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>]),
                 original_classes: <span class="macro">vec!</span>[L, L, L, WS, R, R, R, R, R, R],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">10</span>,
                     level: RTL_LEVEL,
                 },],
             }
         );

         <span class="kw">let </span>text = <span class="string">&quot;אבג abc&quot;</span>;
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">Some</span>(LTR_LEVEL)),
             BidiInfo {
                 text,
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>]),
                 original_classes: <span class="macro">vec!</span>[R, R, R, R, R, R, WS, L, L, L],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">10</span>,
                     level: LTR_LEVEL,
                 },],
             }
         );
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">None</span>),
             BidiInfo {
                 text,
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">2</span>, <span class="number">2</span>, <span class="number">2</span>]),
                 original_classes: <span class="macro">vec!</span>[R, R, R, R, R, R, WS, L, L, L],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">10</span>,
                     level: RTL_LEVEL,
                 },],
             }
         );

         <span class="kw">let </span>text = <span class="string">&quot;غ2ظ א2ג&quot;</span>;
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">Some</span>(LTR_LEVEL)),
             BidiInfo {
                 text,
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">1</span>, <span class="number">2</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">2</span>, <span class="number">1</span>, <span class="number">1</span>]),
                 original_classes: <span class="macro">vec!</span>[AL, AL, EN, AL, AL, WS, R, R, EN, R, R],
                 paragraphs: <span class="macro">vec!</span>[ParagraphInfo {
                     range: <span class="number">0</span>..<span class="number">11</span>,
                     level: LTR_LEVEL,
                 },],
             }
         );

         <span class="kw">let </span>text = <span class="string">&quot;a א.\nג&quot;</span>;
         <span class="macro">assert_eq!</span>(
             BidiInfo::new(text, <span class="prelude-val">None</span>),
             BidiInfo {
                 text,
                 original_classes: <span class="macro">vec!</span>[L, WS, R, R, CS, B, R, R],
                 levels: Level::vec(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">1</span>]),
                 paragraphs: <span class="macro">vec!</span>[
                     ParagraphInfo {
                         range: <span class="number">0</span>..<span class="number">6</span>,
                         level: LTR_LEVEL,
                     },
                     ParagraphInfo {
                         range: <span class="number">6</span>..<span class="number">8</span>,
                         level: RTL_LEVEL,
                     },
                 ],
             }
         );

         <span class="comment">// BidiTest:69635 (AL ET EN)
         </span><span class="kw">let </span>bidi_info = BidiInfo::new(<span class="string">&quot;\u{060B}\u{20CF}\u{06F9}&quot;</span>, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(bidi_info.original_classes, <span class="macro">vec!</span>[AL, AL, ET, ET, ET, EN, EN]);
     }

     <span class="attribute">#[test]
     #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">fn </span>test_bidi_info_has_rtl() {
         <span class="comment">// ASCII only
         </span><span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;123&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;123&quot;</span>, <span class="prelude-val">Some</span>(LTR_LEVEL)).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;123&quot;</span>, <span class="prelude-val">Some</span>(RTL_LEVEL)).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc&quot;</span>, <span class="prelude-val">Some</span>(LTR_LEVEL)).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc&quot;</span>, <span class="prelude-val">Some</span>(RTL_LEVEL)).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc 123&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">false</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc\n123&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">false</span>);

         <span class="comment">// With Hebrew
         </span><span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג&quot;</span>, <span class="prelude-val">Some</span>(LTR_LEVEL)).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג&quot;</span>, <span class="prelude-val">Some</span>(RTL_LEVEL)).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc אבּג&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;abc\nאבּג&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג abc&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג\nabc&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג 123&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
         <span class="macro">assert_eq!</span>(BidiInfo::new(<span class="string">&quot;אבּג\n123&quot;</span>, <span class="prelude-val">None</span>).has_rtl(), <span class="bool-val">true</span>);
     }

     <span class="attribute">#[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">fn </span>reorder_paras(text: <span class="kw-2">&amp;</span>str) -&gt; Vec&lt;Cow&lt;<span class="lifetime">&#39;_</span>, str&gt;&gt; {
         <span class="kw">let </span>bidi_info = BidiInfo::new(text, <span class="prelude-val">None</span>);
         bidi_info
             .paragraphs
             .iter()
             .map(|para| bidi_info.reorder_line(para, para.range.clone()))
             .collect()
     }

     <span class="attribute">#[test]
     #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">fn </span>test_reorder_line() {
         <span class="comment">// Bidi_Class: L L L B L L L B L L L
         </span><span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;abc\ndef\nghi&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;abc\n&quot;</span>, <span class="string">&quot;def\n&quot;</span>, <span class="string">&quot;ghi&quot;</span>]
         );

         <span class="comment">// Bidi_Class: L L EN B L L EN B L L EN
         </span><span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;ab1\nde2\ngh3&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;ab1\n&quot;</span>, <span class="string">&quot;de2\n&quot;</span>, <span class="string">&quot;gh3&quot;</span>]
         );

         <span class="comment">// Bidi_Class: L L L B AL AL AL
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;abc\nابج&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;abc\n&quot;</span>, <span class="string">&quot;جبا&quot;</span>]);

         <span class="comment">// Bidi_Class: AL AL AL B L L L
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;ابج\nabc&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;\nجبا&quot;</span>, <span class="string">&quot;abc&quot;</span>]);

         <span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;1.-2&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;1.-2&quot;</span>]);
         <span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;1-.2&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;1-.2&quot;</span>]);
         <span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;abc אבג&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;abc גבא&quot;</span>]);

         <span class="comment">// Numbers being weak LTR characters, cannot reorder strong RTL
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;123 אבג&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;גבא 123&quot;</span>]);

         <span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;abc\u{202A}def&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;abc\u{202A}def&quot;</span>]);

         <span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;abc\u{202A}def\u{202C}ghi&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;abc\u{202A}def\u{202C}ghi&quot;</span>]
         );

         <span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;abc\u{2066}def\u{2069}ghi&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;abc\u{2066}def\u{2069}ghi&quot;</span>]
         );

         <span class="comment">// Testing for RLE Character
         </span><span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;\u{202B}abc אבג\u{202C}&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;\u{202B}\u{202C}גבא abc&quot;</span>]
         );

         <span class="comment">// Testing neutral characters
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;אבג? אבג&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;גבא ?גבא&quot;</span>]);

         <span class="comment">// Testing neutral characters with special case
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;A אבג?&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;A גבא?&quot;</span>]);

         <span class="comment">// Testing neutral characters with Implicit RTL Marker
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;A אבג?\u{200F}&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;A \u{200F}?גבא&quot;</span>]);
         <span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;אבג abc&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;abc גבא&quot;</span>]);
         <span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;abc\u{2067}.-\u{2069}ghi&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;abc\u{2067}-.\u{2069}ghi&quot;</span>]
         );

         <span class="macro">assert_eq!</span>(
             reorder_paras(<span class="string">&quot;Hello, \u{2068}\u{202E}world\u{202C}\u{2069}!&quot;</span>),
             <span class="macro">vec!</span>[<span class="string">&quot;Hello, \u{2068}\u{202E}\u{202C}dlrow\u{2069}!&quot;</span>]
         );

         <span class="comment">// With mirrorable characters in RTL run
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;א(ב)ג.&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;.ג)ב(א&quot;</span>]);

         <span class="comment">// With mirrorable characters on level boundry
         </span><span class="macro">assert_eq!</span>(reorder_paras(<span class="string">&quot;אב(גד[&amp;ef].)gh&quot;</span>), <span class="macro">vec!</span>[<span class="string">&quot;gh).]ef&amp;[דג(בא&quot;</span>]);
     }

     <span class="kw">fn </span>reordered_levels_for_paras(text: <span class="kw-2">&amp;</span>str) -&gt; Vec&lt;Vec&lt;Level&gt;&gt; {
         <span class="kw">let </span>bidi_info = BidiInfo::new(text, <span class="prelude-val">None</span>);
         bidi_info
             .paragraphs
             .iter()
             .map(|para| bidi_info.reordered_levels(para, para.range.clone()))
             .collect()
     }

     <span class="kw">fn </span>reordered_levels_per_char_for_paras(text: <span class="kw-2">&amp;</span>str) -&gt; Vec&lt;Vec&lt;Level&gt;&gt; {
         <span class="kw">let </span>bidi_info = BidiInfo::new(text, <span class="prelude-val">None</span>);
         bidi_info
             .paragraphs
             .iter()
             .map(|para| bidi_info.reordered_levels_per_char(para, para.range.clone()))
             .collect()
     }

     <span class="attribute">#[test]
     #[cfg(feature = <span class="string">&quot;hardcoded-data&quot;</span>)]
     </span><span class="kw">fn </span>test_reordered_levels() {
         <span class="comment">// BidiTest:946 (LRI PDI)
         </span><span class="kw">let </span>text = <span class="string">&quot;\u{2067}\u{2069}&quot;</span>;
         <span class="macro">assert_eq!</span>(
             reordered_levels_for_paras(text),
             <span class="macro">vec!</span>[Level::vec(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>])]
         );
         <span class="macro">assert_eq!</span>(
             reordered_levels_per_char_for_paras(text),
             <span class="macro">vec!</span>[Level::vec(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>])]
         );

         <span class="kw">let </span>text = <span class="string">&quot;aa טֶ&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(text, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(
             bidi_info.reordered_levels(<span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">0</span>], <span class="number">3</span>..<span class="number">7</span>),
             Level::vec(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>, <span class="number">1</span>]),
         )

         <span class="comment">/* TODO
         /// BidiTest:69635 (AL ET EN)
         let text = &quot;\u{060B}\u{20CF}\u{06F9}&quot;;
         assert_eq!(
             reordered_levels_for_paras(text),
             vec![Level::vec(&amp;[1, 1, 1, 1, 1, 2, 2])]
         );
         assert_eq!(
             reordered_levels_per_char_for_paras(text),
             vec![Level::vec(&amp;[1, 1, 2])]
         );
          */

         /* TODO
         // BidiTest:291284 (AN RLI PDF R)
         assert_eq!(
             reordered_levels_per_char_for_paras(&quot;\u{0605}\u{2067}\u{202C}\u{0590}&quot;),
             vec![&amp;[&quot;2&quot;, &quot;0&quot;, &quot;x&quot;, &quot;1&quot;]]
         );
          */
     </span>}

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_paragraph_info_len() {
         <span class="kw">let </span>text = <span class="string">&quot;hello world&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(text, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">1</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs[<span class="number">0</span>].len(), text.len());

         <span class="kw">let </span>text2 = <span class="string">&quot;How are you&quot;</span>;
         <span class="kw">let </span>whole_text = <span class="macro">format!</span>(<span class="string">&quot;{}\n{}&quot;</span>, text, text2);
         <span class="kw">let </span>bidi_info = BidiInfo::new(<span class="kw-2">&amp;</span>whole_text, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">2</span>);

         <span class="comment">// The first paragraph include the paragraph separator.
         // TODO: investigate if the paragraph separator character
         // should not be part of any paragraph.
         </span><span class="macro">assert_eq!</span>(bidi_info.paragraphs[<span class="number">0</span>].len(), text.len() + <span class="number">1</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs[<span class="number">1</span>].len(), text2.len());
     }

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_direction() {
         <span class="kw">let </span>ltr_text = <span class="string">&quot;hello world&quot;</span>;
         <span class="kw">let </span>rtl_text = <span class="string">&quot;أهلا بكم&quot;</span>;
         <span class="kw">let </span>all_paragraphs = <span class="macro">format!</span>(<span class="string">&quot;{}\n{}\n{}{}&quot;</span>, ltr_text, rtl_text, ltr_text, rtl_text);
         <span class="kw">let </span>bidi_info = BidiInfo::new(<span class="kw-2">&amp;</span>all_paragraphs, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">3</span>);
         <span class="kw">let </span>p_ltr = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">0</span>]);
         <span class="kw">let </span>p_rtl = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">1</span>]);
         <span class="kw">let </span>p_mixed = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">2</span>]);
         <span class="macro">assert_eq!</span>(p_ltr.direction(), Direction::Ltr);
         <span class="macro">assert_eq!</span>(p_rtl.direction(), Direction::Rtl);
         <span class="macro">assert_eq!</span>(p_mixed.direction(), Direction::Mixed);
     }

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_edge_cases_direction() {
         <span class="comment">// No paragraphs for empty text.
         </span><span class="kw">let </span>empty = <span class="string">&quot;&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(empty, Option::from(RTL_LEVEL));
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">0</span>);
         <span class="comment">// The paragraph separator will take the value of the default direction
         // which is left to right.
         </span><span class="kw">let </span>empty = <span class="string">&quot;\n&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(empty, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">1</span>);
         <span class="kw">let </span>p = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">0</span>]);
         <span class="macro">assert_eq!</span>(p.direction(), Direction::Ltr);
         <span class="comment">// The paragraph separator will take the value of the given initial direction
         // which is left to right.
         </span><span class="kw">let </span>empty = <span class="string">&quot;\n&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(empty, Option::from(LTR_LEVEL));
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">1</span>);
         <span class="kw">let </span>p = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">0</span>]);
         <span class="macro">assert_eq!</span>(p.direction(), Direction::Ltr);

         <span class="comment">// The paragraph separator will take the value of the given initial direction
         // which is right to left.
         </span><span class="kw">let </span>empty = <span class="string">&quot;\n&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(empty, Option::from(RTL_LEVEL));
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">1</span>);
         <span class="kw">let </span>p = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">0</span>]);
         <span class="macro">assert_eq!</span>(p.direction(), Direction::Rtl);
     }

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_level_at() {
         <span class="kw">let </span>ltr_text = <span class="string">&quot;hello world&quot;</span>;
         <span class="kw">let </span>rtl_text = <span class="string">&quot;أهلا بكم&quot;</span>;
         <span class="kw">let </span>all_paragraphs = <span class="macro">format!</span>(<span class="string">&quot;{}\n{}\n{}{}&quot;</span>, ltr_text, rtl_text, ltr_text, rtl_text);
         <span class="kw">let </span>bidi_info = BidiInfo::new(<span class="kw-2">&amp;</span>all_paragraphs, <span class="prelude-val">None</span>);
         <span class="macro">assert_eq!</span>(bidi_info.paragraphs.len(), <span class="number">3</span>);

         <span class="kw">let </span>p_ltr = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">0</span>]);
         <span class="kw">let </span>p_rtl = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">1</span>]);
         <span class="kw">let </span>p_mixed = Paragraph::new(<span class="kw-2">&amp;</span>bidi_info, <span class="kw-2">&amp;</span>bidi_info.paragraphs[<span class="number">2</span>]);

         <span class="macro">assert_eq!</span>(p_ltr.level_at(<span class="number">0</span>), LTR_LEVEL);
         <span class="macro">assert_eq!</span>(p_rtl.level_at(<span class="number">0</span>), RTL_LEVEL);
         <span class="macro">assert_eq!</span>(p_mixed.level_at(<span class="number">0</span>), LTR_LEVEL);
         <span class="macro">assert_eq!</span>(p_mixed.info.levels.len(), <span class="number">54</span>);
         <span class="macro">assert_eq!</span>(p_mixed.para.range.start, <span class="number">28</span>);
         <span class="macro">assert_eq!</span>(p_mixed.level_at(ltr_text.len()), RTL_LEVEL);
     }
 }

 <span class="attribute">#[cfg(all(feature = <span class="string">&quot;serde&quot;</span>, feature = <span class="string">&quot;hardcoded-data&quot;</span>, test))]
 </span><span class="kw">mod </span>serde_tests {
     <span class="kw">use super</span>::<span class="kw-2">*</span>;
     <span class="kw">use </span>serde_test::{assert_tokens, Token};

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_levels() {
         <span class="kw">let </span>text = <span class="string">&quot;abc אבג&quot;</span>;
         <span class="kw">let </span>bidi_info = BidiInfo::new(text, <span class="prelude-val">None</span>);
         <span class="kw">let </span>levels = bidi_info.levels;
         <span class="macro">assert_eq!</span>(text.as_bytes().len(), <span class="number">10</span>);
         <span class="macro">assert_eq!</span>(levels.len(), <span class="number">10</span>);
         assert_tokens(
             <span class="kw-2">&amp;</span>levels,
             <span class="kw-2">&amp;</span>[
                 Token::Seq { len: <span class="prelude-val">Some</span>(<span class="number">10</span>) },
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">0</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">0</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">0</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">0</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">1</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">1</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">1</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">1</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">1</span>),
                 Token::NewtypeStruct { name: <span class="string">&quot;Level&quot; </span>},
                 Token::U8(<span class="number">1</span>),
                 Token::SeqEnd,
             ],
         );
     }
 }
 </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>