| <!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/git/checkouts/rayon-3b3b152053499ede/a07ce2e/src/slice/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.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="../../../rayon/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="../../../rayon/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> |
| </pre><pre class="rust"><code><span class="doccomment">//! Parallel iterator types for [slices][std::slice] |
| //! |
| //! You will rarely need to interact with this module directly unless you need |
| //! to name one of the iterator types. |
| //! |
| //! [std::slice]: https://doc.rust-lang.org/stable/std/slice/ |
| |
| </span><span class="kw">mod </span>chunks; |
| <span class="kw">mod </span>mergesort; |
| <span class="kw">mod </span>quicksort; |
| <span class="kw">mod </span>rchunks; |
| |
| <span class="kw">mod </span>test; |
| |
| <span class="kw">use </span><span class="self">self</span>::mergesort::par_mergesort; |
| <span class="kw">use </span><span class="self">self</span>::quicksort::par_quicksort; |
| <span class="kw">use </span><span class="kw">crate</span>::iter::plumbing::<span class="kw-2">*</span>; |
| <span class="kw">use </span><span class="kw">crate</span>::iter::<span class="kw-2">*</span>; |
| <span class="kw">use </span><span class="kw">crate</span>::split_producer::<span class="kw-2">*</span>; |
| <span class="kw">use </span>std::cmp; |
| <span class="kw">use </span>std::cmp::Ordering; |
| <span class="kw">use </span>std::fmt::{<span class="self">self</span>, Debug}; |
| <span class="kw">use </span>std::mem; |
| |
| <span class="kw">pub use </span><span class="self">self</span>::chunks::{Chunks, ChunksExact, ChunksExactMut, ChunksMut}; |
| <span class="kw">pub use </span><span class="self">self</span>::rchunks::{RChunks, RChunksExact, RChunksExactMut, RChunksMut}; |
| |
| <span class="doccomment">/// Parallel extensions for slices. |
| </span><span class="kw">pub trait </span>ParallelSlice<T: Sync> { |
| <span class="doccomment">/// Returns a plain slice, which is used to implement the rest of the |
| /// parallel methods. |
| </span><span class="kw">fn </span>as_parallel_slice(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[T]; |
| |
| <span class="doccomment">/// Returns a parallel iterator over subslices separated by elements that |
| /// match the separator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let smallest = [1, 2, 3, 0, 2, 4, 8, 0, 3, 6, 9] |
| /// .par_split(|i| *i == 0) |
| /// .map(|numbers| numbers.iter().min().unwrap()) |
| /// .min(); |
| /// assert_eq!(Some(&1), smallest); |
| /// ``` |
| </span><span class="kw">fn </span>par_split<P>(<span class="kw-2">&</span><span class="self">self</span>, separator: P) -> Split<<span class="lifetime">'_</span>, T, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span>T) -> bool + Sync + Send, |
| { |
| Split { |
| slice: <span class="self">self</span>.as_parallel_slice(), |
| separator, |
| } |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over all contiguous windows of length |
| /// `window_size`. The windows overlap. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let windows: Vec<_> = [1, 2, 3].par_windows(2).collect(); |
| /// assert_eq!(vec![[1, 2], [2, 3]], windows); |
| /// ``` |
| </span><span class="kw">fn </span>par_windows(<span class="kw-2">&</span><span class="self">self</span>, window_size: usize) -> Windows<<span class="lifetime">'_</span>, T> { |
| Windows { |
| window_size, |
| slice: <span class="self">self</span>.as_parallel_slice(), |
| } |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over at most `chunk_size` elements of |
| /// `self` at a time. The chunks do not overlap. |
| /// |
| /// If the number of elements in the iterator is not divisible by |
| /// `chunk_size`, the last chunk may be shorter than `chunk_size`. All |
| /// other chunks will have that exact length. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let chunks: Vec<_> = [1, 2, 3, 4, 5].par_chunks(2).collect(); |
| /// assert_eq!(chunks, vec![&[1, 2][..], &[3, 4], &[5]]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_chunks(<span class="kw-2">&</span><span class="self">self</span>, chunk_size: usize) -> Chunks<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| Chunks::new(chunk_size, <span class="self">self</span>.as_parallel_slice()) |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over `chunk_size` elements of |
| /// `self` at a time. The chunks do not overlap. |
| /// |
| /// If `chunk_size` does not divide the length of the slice, then the |
| /// last up to `chunk_size-1` elements will be omitted and can be |
| /// retrieved from the remainder function of the iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let chunks: Vec<_> = [1, 2, 3, 4, 5].par_chunks_exact(2).collect(); |
| /// assert_eq!(chunks, vec![&[1, 2][..], &[3, 4]]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_chunks_exact(<span class="kw-2">&</span><span class="self">self</span>, chunk_size: usize) -> ChunksExact<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| ChunksExact::new(chunk_size, <span class="self">self</span>.as_parallel_slice()) |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over at most `chunk_size` elements of `self` at a time, |
| /// starting at the end. The chunks do not overlap. |
| /// |
| /// If the number of elements in the iterator is not divisible by |
| /// `chunk_size`, the last chunk may be shorter than `chunk_size`. All |
| /// other chunks will have that exact length. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let chunks: Vec<_> = [1, 2, 3, 4, 5].par_rchunks(2).collect(); |
| /// assert_eq!(chunks, vec![&[4, 5][..], &[2, 3], &[1]]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_rchunks(<span class="kw-2">&</span><span class="self">self</span>, chunk_size: usize) -> RChunks<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| RChunks::new(chunk_size, <span class="self">self</span>.as_parallel_slice()) |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over `chunk_size` elements of `self` at a time, |
| /// starting at the end. The chunks do not overlap. |
| /// |
| /// If `chunk_size` does not divide the length of the slice, then the |
| /// last up to `chunk_size-1` elements will be omitted and can be |
| /// retrieved from the remainder function of the iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let chunks: Vec<_> = [1, 2, 3, 4, 5].par_rchunks_exact(2).collect(); |
| /// assert_eq!(chunks, vec![&[4, 5][..], &[2, 3]]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_rchunks_exact(<span class="kw-2">&</span><span class="self">self</span>, chunk_size: usize) -> RChunksExact<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| RChunksExact::new(chunk_size, <span class="self">self</span>.as_parallel_slice()) |
| } |
| } |
| |
| <span class="kw">impl</span><T: Sync> ParallelSlice<T> <span class="kw">for </span>[T] { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>as_parallel_slice(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[T] { |
| <span class="self">self |
| </span>} |
| } |
| |
| <span class="doccomment">/// Parallel extensions for mutable slices. |
| </span><span class="kw">pub trait </span>ParallelSliceMut<T: Send> { |
| <span class="doccomment">/// Returns a plain mutable slice, which is used to implement the rest of |
| /// the parallel methods. |
| </span><span class="kw">fn </span>as_parallel_slice_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[T]; |
| |
| <span class="doccomment">/// Returns a parallel iterator over mutable subslices separated by |
| /// elements that match the separator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let mut array = [1, 2, 3, 0, 2, 4, 8, 0, 3, 6, 9]; |
| /// array.par_split_mut(|i| *i == 0) |
| /// .for_each(|slice| slice.reverse()); |
| /// assert_eq!(array, [3, 2, 1, 0, 8, 4, 2, 0, 9, 6, 3]); |
| /// ``` |
| </span><span class="kw">fn </span>par_split_mut<P>(<span class="kw-2">&mut </span><span class="self">self</span>, separator: P) -> SplitMut<<span class="lifetime">'_</span>, T, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span>T) -> bool + Sync + Send, |
| { |
| SplitMut { |
| slice: <span class="self">self</span>.as_parallel_slice_mut(), |
| separator, |
| } |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over at most `chunk_size` elements of |
| /// `self` at a time. The chunks are mutable and do not overlap. |
| /// |
| /// If the number of elements in the iterator is not divisible by |
| /// `chunk_size`, the last chunk may be shorter than `chunk_size`. All |
| /// other chunks will have that exact length. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let mut array = [1, 2, 3, 4, 5]; |
| /// array.par_chunks_mut(2) |
| /// .for_each(|slice| slice.reverse()); |
| /// assert_eq!(array, [2, 1, 4, 3, 5]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_chunks_mut(<span class="kw-2">&mut </span><span class="self">self</span>, chunk_size: usize) -> ChunksMut<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| ChunksMut::new(chunk_size, <span class="self">self</span>.as_parallel_slice_mut()) |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over `chunk_size` elements of |
| /// `self` at a time. The chunks are mutable and do not overlap. |
| /// |
| /// If `chunk_size` does not divide the length of the slice, then the |
| /// last up to `chunk_size-1` elements will be omitted and can be |
| /// retrieved from the remainder function of the iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let mut array = [1, 2, 3, 4, 5]; |
| /// array.par_chunks_exact_mut(3) |
| /// .for_each(|slice| slice.reverse()); |
| /// assert_eq!(array, [3, 2, 1, 4, 5]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_chunks_exact_mut(<span class="kw-2">&mut </span><span class="self">self</span>, chunk_size: usize) -> ChunksExactMut<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| ChunksExactMut::new(chunk_size, <span class="self">self</span>.as_parallel_slice_mut()) |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over at most `chunk_size` elements of `self` at a time, |
| /// starting at the end. The chunks are mutable and do not overlap. |
| /// |
| /// If the number of elements in the iterator is not divisible by |
| /// `chunk_size`, the last chunk may be shorter than `chunk_size`. All |
| /// other chunks will have that exact length. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let mut array = [1, 2, 3, 4, 5]; |
| /// array.par_rchunks_mut(2) |
| /// .for_each(|slice| slice.reverse()); |
| /// assert_eq!(array, [1, 3, 2, 5, 4]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_rchunks_mut(<span class="kw-2">&mut </span><span class="self">self</span>, chunk_size: usize) -> RChunksMut<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| RChunksMut::new(chunk_size, <span class="self">self</span>.as_parallel_slice_mut()) |
| } |
| |
| <span class="doccomment">/// Returns a parallel iterator over `chunk_size` elements of `self` at a time, |
| /// starting at the end. The chunks are mutable and do not overlap. |
| /// |
| /// If `chunk_size` does not divide the length of the slice, then the |
| /// last up to `chunk_size-1` elements will be omitted and can be |
| /// retrieved from the remainder function of the iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let mut array = [1, 2, 3, 4, 5]; |
| /// array.par_rchunks_exact_mut(3) |
| /// .for_each(|slice| slice.reverse()); |
| /// assert_eq!(array, [1, 2, 5, 4, 3]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>par_rchunks_exact_mut(<span class="kw-2">&mut </span><span class="self">self</span>, chunk_size: usize) -> RChunksExactMut<<span class="lifetime">'_</span>, T> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| RChunksExactMut::new(chunk_size, <span class="self">self</span>.as_parallel_slice_mut()) |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel. |
| /// |
| /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case. |
| /// |
| /// When applicable, unstable sorting is preferred because it is generally faster than stable |
| /// sorting and it doesn't allocate auxiliary memory. |
| /// See [`par_sort_unstable`](#method.par_sort_unstable). |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is an adaptive merge sort inspired by |
| /// [timsort](https://en.wikipedia.org/wiki/Timsort). |
| /// It is designed to be very fast in cases where the slice is nearly sorted, or consists of |
| /// two or more sorted sequences concatenated one after another. |
| /// |
| /// Also, it allocates temporary storage the same size as `self`, but for very short slices a |
| /// non-allocating insertion sort is used instead. |
| /// |
| /// In order to sort the slice in parallel, the slice is first divided into smaller chunks and |
| /// all chunks are sorted in parallel. Then, adjacent chunks that together form non-descending |
| /// or descending runs are concatenated. Finally, the remaining chunks are merged together using |
| /// parallel subdivision of chunks and parallel merge operation. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [-5, 4, 1, -3, 2]; |
| /// |
| /// v.par_sort(); |
| /// assert_eq!(v, [-5, -3, 1, 2, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort(<span class="kw-2">&mut </span><span class="self">self</span>) |
| <span class="kw">where |
| </span>T: Ord, |
| { |
| par_mergesort(<span class="self">self</span>.as_parallel_slice_mut(), T::lt); |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel with a comparator function. |
| /// |
| /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case. |
| /// |
| /// The comparator function must define a total ordering for the elements in the slice. If |
| /// the ordering is not total, the order of the elements is unspecified. An order is a |
| /// total order if it is (for all `a`, `b` and `c`): |
| /// |
| /// * total and antisymmetric: exactly one of `a < b`, `a == b` or `a > b` is true, and |
| /// * transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`. |
| /// |
| /// For example, while [`f64`] doesn't implement [`Ord`] because `NaN != NaN`, we can use |
| /// `partial_cmp` as our sort function when we know the slice doesn't contain a `NaN`. |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut floats = [5f64, 4.0, 1.0, 3.0, 2.0]; |
| /// floats.par_sort_by(|a, b| a.partial_cmp(b).unwrap()); |
| /// assert_eq!(floats, [1.0, 2.0, 3.0, 4.0, 5.0]); |
| /// ``` |
| /// |
| /// When applicable, unstable sorting is preferred because it is generally faster than stable |
| /// sorting and it doesn't allocate auxiliary memory. |
| /// See [`par_sort_unstable_by`](#method.par_sort_unstable_by). |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is an adaptive merge sort inspired by |
| /// [timsort](https://en.wikipedia.org/wiki/Timsort). |
| /// It is designed to be very fast in cases where the slice is nearly sorted, or consists of |
| /// two or more sorted sequences concatenated one after another. |
| /// |
| /// Also, it allocates temporary storage the same size as `self`, but for very short slices a |
| /// non-allocating insertion sort is used instead. |
| /// |
| /// In order to sort the slice in parallel, the slice is first divided into smaller chunks and |
| /// all chunks are sorted in parallel. Then, adjacent chunks that together form non-descending |
| /// or descending runs are concatenated. Finally, the remaining chunks are merged together using |
| /// parallel subdivision of chunks and parallel merge operation. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [5, 4, 1, 3, 2]; |
| /// v.par_sort_by(|a, b| a.cmp(b)); |
| /// assert_eq!(v, [1, 2, 3, 4, 5]); |
| /// |
| /// // reverse sorting |
| /// v.par_sort_by(|a, b| b.cmp(a)); |
| /// assert_eq!(v, [5, 4, 3, 2, 1]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort_by<F>(<span class="kw-2">&mut </span><span class="self">self</span>, compare: F) |
| <span class="kw">where |
| </span>F: Fn(<span class="kw-2">&</span>T, <span class="kw-2">&</span>T) -> Ordering + Sync, |
| { |
| par_mergesort(<span class="self">self</span>.as_parallel_slice_mut(), |a, b| { |
| compare(a, b) == Ordering::Less |
| }); |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel with a key extraction function. |
| /// |
| /// This sort is stable (i.e., does not reorder equal elements) and *O*(*m* \* *n* \* log(*n*)) |
| /// worst-case, where the key function is *O*(*m*). |
| /// |
| /// For expensive key functions (e.g. functions that are not simple property accesses or |
| /// basic operations), [`par_sort_by_cached_key`](#method.par_sort_by_cached_key) is likely to |
| /// be significantly faster, as it does not recompute element keys. |
| /// |
| /// When applicable, unstable sorting is preferred because it is generally faster than stable |
| /// sorting and it doesn't allocate auxiliary memory. |
| /// See [`par_sort_unstable_by_key`](#method.par_sort_unstable_by_key). |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is an adaptive merge sort inspired by |
| /// [timsort](https://en.wikipedia.org/wiki/Timsort). |
| /// It is designed to be very fast in cases where the slice is nearly sorted, or consists of |
| /// two or more sorted sequences concatenated one after another. |
| /// |
| /// Also, it allocates temporary storage the same size as `self`, but for very short slices a |
| /// non-allocating insertion sort is used instead. |
| /// |
| /// In order to sort the slice in parallel, the slice is first divided into smaller chunks and |
| /// all chunks are sorted in parallel. Then, adjacent chunks that together form non-descending |
| /// or descending runs are concatenated. Finally, the remaining chunks are merged together using |
| /// parallel subdivision of chunks and parallel merge operation. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [-5i32, 4, 1, -3, 2]; |
| /// |
| /// v.par_sort_by_key(|k| k.abs()); |
| /// assert_eq!(v, [1, 2, -3, 4, -5]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort_by_key<K, F>(<span class="kw-2">&mut </span><span class="self">self</span>, f: F) |
| <span class="kw">where |
| </span>K: Ord, |
| F: Fn(<span class="kw-2">&</span>T) -> K + Sync, |
| { |
| par_mergesort(<span class="self">self</span>.as_parallel_slice_mut(), |a, b| f(a).lt(<span class="kw-2">&</span>f(b))); |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel with a key extraction function. |
| /// |
| /// During sorting, the key function is called at most once per element, by using |
| /// temporary storage to remember the results of key evaluation. |
| /// The key function is called in parallel, so the order of calls is completely unspecified. |
| /// |
| /// This sort is stable (i.e., does not reorder equal elements) and *O*(*m* \* *n* + *n* \* log(*n*)) |
| /// worst-case, where the key function is *O*(*m*). |
| /// |
| /// For simple key functions (e.g., functions that are property accesses or |
| /// basic operations), [`par_sort_by_key`](#method.par_sort_by_key) is likely to be |
| /// faster. |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is based on [pattern-defeating quicksort][pdqsort] by Orson Peters, |
| /// which combines the fast average case of randomized quicksort with the fast worst case of |
| /// heapsort, while achieving linear time on slices with certain patterns. It uses some |
| /// randomization to avoid degenerate cases, but with a fixed seed to always provide |
| /// deterministic behavior. |
| /// |
| /// In the worst case, the algorithm allocates temporary storage in a `Vec<(K, usize)>` the |
| /// length of the slice. |
| /// |
| /// All quicksorts work in two stages: partitioning into two halves followed by recursive |
| /// calls. The partitioning phase is sequential, but the two recursive calls are performed in |
| /// parallel. Finally, after sorting the cached keys, the item positions are updated sequentially. |
| /// |
| /// [pdqsort]: https://github.com/orlp/pdqsort |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [-5i32, 4, 32, -3, 2]; |
| /// |
| /// v.par_sort_by_cached_key(|k| k.to_string()); |
| /// assert!(v == [-3, -5, 2, 32, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort_by_cached_key<K, F>(<span class="kw-2">&mut </span><span class="self">self</span>, f: F) |
| <span class="kw">where |
| </span>F: Fn(<span class="kw-2">&</span>T) -> K + Sync, |
| K: Ord + Send, |
| { |
| <span class="kw">let </span>slice = <span class="self">self</span>.as_parallel_slice_mut(); |
| <span class="kw">let </span>len = slice.len(); |
| <span class="kw">if </span>len < <span class="number">2 </span>{ |
| <span class="kw">return</span>; |
| } |
| |
| <span class="comment">// Helper macro for indexing our vector by the smallest possible type, to reduce allocation. |
| </span><span class="macro">macro_rules! </span>sort_by_key { |
| (<span class="macro-nonterminal">$t</span>:ty) => {{ |
| <span class="kw">let </span><span class="kw-2">mut </span>indices: Vec<<span class="kw">_</span>> = slice |
| .par_iter_mut() |
| .enumerate() |
| .map(|(i, x)| (f(<span class="kw-2">&*</span>x), i <span class="kw">as </span><span class="macro-nonterminal">$t</span>)) |
| .collect(); |
| <span class="comment">// The elements of `indices` are unique, as they are indexed, so any sort will be |
| // stable with respect to the original slice. We use `sort_unstable` here because |
| // it requires less memory allocation. |
| </span>indices.par_sort_unstable(); |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..len { |
| <span class="kw">let </span><span class="kw-2">mut </span>index = indices[i].<span class="number">1</span>; |
| <span class="kw">while </span>(index <span class="kw">as </span>usize) < i { |
| index = indices[index <span class="kw">as </span>usize].<span class="number">1</span>; |
| } |
| indices[i].<span class="number">1 </span>= index; |
| slice.swap(i, index <span class="kw">as </span>usize); |
| } |
| }}; |
| } |
| |
| <span class="kw">let </span>sz_u8 = mem::size_of::<(K, u8)>(); |
| <span class="kw">let </span>sz_u16 = mem::size_of::<(K, u16)>(); |
| <span class="kw">let </span>sz_u32 = mem::size_of::<(K, u32)>(); |
| <span class="kw">let </span>sz_usize = mem::size_of::<(K, usize)>(); |
| |
| <span class="kw">if </span>sz_u8 < sz_u16 && len <= (std::u8::MAX <span class="kw">as </span>usize) { |
| <span class="kw">return </span><span class="macro">sort_by_key!</span>(u8); |
| } |
| <span class="kw">if </span>sz_u16 < sz_u32 && len <= (std::u16::MAX <span class="kw">as </span>usize) { |
| <span class="kw">return </span><span class="macro">sort_by_key!</span>(u16); |
| } |
| <span class="kw">if </span>sz_u32 < sz_usize && len <= (std::u32::MAX <span class="kw">as </span>usize) { |
| <span class="kw">return </span><span class="macro">sort_by_key!</span>(u32); |
| } |
| <span class="macro">sort_by_key!</span>(usize) |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel, but might not preserve the order of equal elements. |
| /// |
| /// This sort is unstable (i.e., may reorder equal elements), in-place |
| /// (i.e., does not allocate), and *O*(*n* \* log(*n*)) worst-case. |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is based on [pattern-defeating quicksort][pdqsort] by Orson Peters, |
| /// which combines the fast average case of randomized quicksort with the fast worst case of |
| /// heapsort, while achieving linear time on slices with certain patterns. It uses some |
| /// randomization to avoid degenerate cases, but with a fixed seed to always provide |
| /// deterministic behavior. |
| /// |
| /// It is typically faster than stable sorting, except in a few special cases, e.g., when the |
| /// slice consists of several concatenated sorted sequences. |
| /// |
| /// All quicksorts work in two stages: partitioning into two halves followed by recursive |
| /// calls. The partitioning phase is sequential, but the two recursive calls are performed in |
| /// parallel. |
| /// |
| /// [pdqsort]: https://github.com/orlp/pdqsort |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [-5, 4, 1, -3, 2]; |
| /// |
| /// v.par_sort_unstable(); |
| /// assert_eq!(v, [-5, -3, 1, 2, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort_unstable(<span class="kw-2">&mut </span><span class="self">self</span>) |
| <span class="kw">where |
| </span>T: Ord, |
| { |
| par_quicksort(<span class="self">self</span>.as_parallel_slice_mut(), T::lt); |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel with a comparator function, but might not preserve the order of |
| /// equal elements. |
| /// |
| /// This sort is unstable (i.e., may reorder equal elements), in-place |
| /// (i.e., does not allocate), and *O*(*n* \* log(*n*)) worst-case. |
| /// |
| /// The comparator function must define a total ordering for the elements in the slice. If |
| /// the ordering is not total, the order of the elements is unspecified. An order is a |
| /// total order if it is (for all `a`, `b` and `c`): |
| /// |
| /// * total and antisymmetric: exactly one of `a < b`, `a == b` or `a > b` is true, and |
| /// * transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`. |
| /// |
| /// For example, while [`f64`] doesn't implement [`Ord`] because `NaN != NaN`, we can use |
| /// `partial_cmp` as our sort function when we know the slice doesn't contain a `NaN`. |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut floats = [5f64, 4.0, 1.0, 3.0, 2.0]; |
| /// floats.par_sort_unstable_by(|a, b| a.partial_cmp(b).unwrap()); |
| /// assert_eq!(floats, [1.0, 2.0, 3.0, 4.0, 5.0]); |
| /// ``` |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is based on [pattern-defeating quicksort][pdqsort] by Orson Peters, |
| /// which combines the fast average case of randomized quicksort with the fast worst case of |
| /// heapsort, while achieving linear time on slices with certain patterns. It uses some |
| /// randomization to avoid degenerate cases, but with a fixed seed to always provide |
| /// deterministic behavior. |
| /// |
| /// It is typically faster than stable sorting, except in a few special cases, e.g., when the |
| /// slice consists of several concatenated sorted sequences. |
| /// |
| /// All quicksorts work in two stages: partitioning into two halves followed by recursive |
| /// calls. The partitioning phase is sequential, but the two recursive calls are performed in |
| /// parallel. |
| /// |
| /// [pdqsort]: https://github.com/orlp/pdqsort |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [5, 4, 1, 3, 2]; |
| /// v.par_sort_unstable_by(|a, b| a.cmp(b)); |
| /// assert_eq!(v, [1, 2, 3, 4, 5]); |
| /// |
| /// // reverse sorting |
| /// v.par_sort_unstable_by(|a, b| b.cmp(a)); |
| /// assert_eq!(v, [5, 4, 3, 2, 1]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort_unstable_by<F>(<span class="kw-2">&mut </span><span class="self">self</span>, compare: F) |
| <span class="kw">where |
| </span>F: Fn(<span class="kw-2">&</span>T, <span class="kw-2">&</span>T) -> Ordering + Sync, |
| { |
| par_quicksort(<span class="self">self</span>.as_parallel_slice_mut(), |a, b| { |
| compare(a, b) == Ordering::Less |
| }); |
| } |
| |
| <span class="doccomment">/// Sorts the slice in parallel with a key extraction function, but might not preserve the order |
| /// of equal elements. |
| /// |
| /// This sort is unstable (i.e., may reorder equal elements), in-place |
| /// (i.e., does not allocate), and *O*(m \* *n* \* log(*n*)) worst-case, |
| /// where the key function is *O*(*m*). |
| /// |
| /// # Current implementation |
| /// |
| /// The current algorithm is based on [pattern-defeating quicksort][pdqsort] by Orson Peters, |
| /// which combines the fast average case of randomized quicksort with the fast worst case of |
| /// heapsort, while achieving linear time on slices with certain patterns. It uses some |
| /// randomization to avoid degenerate cases, but with a fixed seed to always provide |
| /// deterministic behavior. |
| /// |
| /// Due to its key calling strategy, `par_sort_unstable_by_key` is likely to be slower than |
| /// [`par_sort_by_cached_key`](#method.par_sort_by_cached_key) in cases where the key function |
| /// is expensive. |
| /// |
| /// All quicksorts work in two stages: partitioning into two halves followed by recursive |
| /// calls. The partitioning phase is sequential, but the two recursive calls are performed in |
| /// parallel. |
| /// |
| /// [pdqsort]: https://github.com/orlp/pdqsort |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = [-5i32, 4, 1, -3, 2]; |
| /// |
| /// v.par_sort_unstable_by_key(|k| k.abs()); |
| /// assert_eq!(v, [1, 2, -3, 4, -5]); |
| /// ``` |
| </span><span class="kw">fn </span>par_sort_unstable_by_key<K, F>(<span class="kw-2">&mut </span><span class="self">self</span>, f: F) |
| <span class="kw">where |
| </span>K: Ord, |
| F: Fn(<span class="kw-2">&</span>T) -> K + Sync, |
| { |
| par_quicksort(<span class="self">self</span>.as_parallel_slice_mut(), |a, b| f(a).lt(<span class="kw-2">&</span>f(b))); |
| } |
| } |
| |
| <span class="kw">impl</span><T: Send> ParallelSliceMut<T> <span class="kw">for </span>[T] { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>as_parallel_slice_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[T] { |
| <span class="self">self |
| </span>} |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync + <span class="lifetime">'data</span>> IntoParallelIterator <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'data </span>[T] { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span>T; |
| <span class="kw">type </span>Iter = Iter<<span class="lifetime">'data</span>, T>; |
| |
| <span class="kw">fn </span>into_par_iter(<span class="self">self</span>) -> <span class="self">Self</span>::Iter { |
| Iter { slice: <span class="self">self </span>} |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Send + <span class="lifetime">'data</span>> IntoParallelIterator <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>[T] { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>T; |
| <span class="kw">type </span>Iter = IterMut<<span class="lifetime">'data</span>, T>; |
| |
| <span class="kw">fn </span>into_par_iter(<span class="self">self</span>) -> <span class="self">Self</span>::Iter { |
| IterMut { slice: <span class="self">self </span>} |
| } |
| } |
| |
| <span class="doccomment">/// Parallel iterator over immutable items in a slice |
| </span><span class="attribute">#[derive(Debug)] |
| </span><span class="kw">pub struct </span>Iter<<span class="lifetime">'data</span>, T: Sync> { |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span>[T], |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync> Clone <span class="kw">for </span>Iter<<span class="lifetime">'data</span>, T> { |
| <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Iter { ..<span class="kw-2">*</span><span class="self">self </span>} |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync + <span class="lifetime">'data</span>> ParallelIterator <span class="kw">for </span>Iter<<span class="lifetime">'data</span>, T> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span>T; |
| |
| <span class="kw">fn </span>drive_unindexed<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: UnindexedConsumer<<span class="self">Self</span>::Item>, |
| { |
| bridge(<span class="self">self</span>, consumer) |
| } |
| |
| <span class="kw">fn </span>opt_len(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="prelude-val">Some</span>(<span class="self">self</span>.len()) |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync + <span class="lifetime">'data</span>> IndexedParallelIterator <span class="kw">for </span>Iter<<span class="lifetime">'data</span>, T> { |
| <span class="kw">fn </span>drive<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: Consumer<<span class="self">Self</span>::Item>, |
| { |
| bridge(<span class="self">self</span>, consumer) |
| } |
| |
| <span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.slice.len() |
| } |
| |
| <span class="kw">fn </span>with_producer<CB>(<span class="self">self</span>, callback: CB) -> CB::Output |
| <span class="kw">where |
| </span>CB: ProducerCallback<<span class="self">Self</span>::Item>, |
| { |
| callback.callback(IterProducer { slice: <span class="self">self</span>.slice }) |
| } |
| } |
| |
| <span class="kw">struct </span>IterProducer<<span class="lifetime">'data</span>, T: Sync> { |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span>[T], |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: <span class="lifetime">'data </span>+ Sync> Producer <span class="kw">for </span>IterProducer<<span class="lifetime">'data</span>, T> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span>T; |
| <span class="kw">type </span>IntoIter = ::std::slice::Iter<<span class="lifetime">'data</span>, T>; |
| |
| <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { |
| <span class="self">self</span>.slice.iter() |
| } |
| |
| <span class="kw">fn </span>split_at(<span class="self">self</span>, index: usize) -> (<span class="self">Self</span>, <span class="self">Self</span>) { |
| <span class="kw">let </span>(left, right) = <span class="self">self</span>.slice.split_at(index); |
| (IterProducer { slice: left }, IterProducer { slice: right }) |
| } |
| } |
| |
| <span class="doccomment">/// Parallel iterator over immutable overlapping windows of a slice |
| </span><span class="attribute">#[derive(Debug)] |
| </span><span class="kw">pub struct </span>Windows<<span class="lifetime">'data</span>, T: Sync> { |
| window_size: usize, |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span>[T], |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync> Clone <span class="kw">for </span>Windows<<span class="lifetime">'data</span>, T> { |
| <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Windows { ..<span class="kw-2">*</span><span class="self">self </span>} |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync + <span class="lifetime">'data</span>> ParallelIterator <span class="kw">for </span>Windows<<span class="lifetime">'data</span>, T> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span>[T]; |
| |
| <span class="kw">fn </span>drive_unindexed<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: UnindexedConsumer<<span class="self">Self</span>::Item>, |
| { |
| bridge(<span class="self">self</span>, consumer) |
| } |
| |
| <span class="kw">fn </span>opt_len(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="prelude-val">Some</span>(<span class="self">self</span>.len()) |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Sync + <span class="lifetime">'data</span>> IndexedParallelIterator <span class="kw">for </span>Windows<<span class="lifetime">'data</span>, T> { |
| <span class="kw">fn </span>drive<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: Consumer<<span class="self">Self</span>::Item>, |
| { |
| bridge(<span class="self">self</span>, consumer) |
| } |
| |
| <span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="macro">assert!</span>(<span class="self">self</span>.window_size >= <span class="number">1</span>); |
| <span class="self">self</span>.slice.len().saturating_sub(<span class="self">self</span>.window_size - <span class="number">1</span>) |
| } |
| |
| <span class="kw">fn </span>with_producer<CB>(<span class="self">self</span>, callback: CB) -> CB::Output |
| <span class="kw">where |
| </span>CB: ProducerCallback<<span class="self">Self</span>::Item>, |
| { |
| callback.callback(WindowsProducer { |
| window_size: <span class="self">self</span>.window_size, |
| slice: <span class="self">self</span>.slice, |
| }) |
| } |
| } |
| |
| <span class="kw">struct </span>WindowsProducer<<span class="lifetime">'data</span>, T: Sync> { |
| window_size: usize, |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span>[T], |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: <span class="lifetime">'data </span>+ Sync> Producer <span class="kw">for </span>WindowsProducer<<span class="lifetime">'data</span>, T> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span>[T]; |
| <span class="kw">type </span>IntoIter = ::std::slice::Windows<<span class="lifetime">'data</span>, T>; |
| |
| <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { |
| <span class="self">self</span>.slice.windows(<span class="self">self</span>.window_size) |
| } |
| |
| <span class="kw">fn </span>split_at(<span class="self">self</span>, index: usize) -> (<span class="self">Self</span>, <span class="self">Self</span>) { |
| <span class="kw">let </span>left_index = cmp::min(<span class="self">self</span>.slice.len(), index + (<span class="self">self</span>.window_size - <span class="number">1</span>)); |
| <span class="kw">let </span>left = <span class="kw-2">&</span><span class="self">self</span>.slice[..left_index]; |
| <span class="kw">let </span>right = <span class="kw-2">&</span><span class="self">self</span>.slice[index..]; |
| ( |
| WindowsProducer { |
| window_size: <span class="self">self</span>.window_size, |
| slice: left, |
| }, |
| WindowsProducer { |
| window_size: <span class="self">self</span>.window_size, |
| slice: right, |
| }, |
| ) |
| } |
| } |
| |
| <span class="doccomment">/// Parallel iterator over mutable items in a slice |
| </span><span class="attribute">#[derive(Debug)] |
| </span><span class="kw">pub struct </span>IterMut<<span class="lifetime">'data</span>, T: Send> { |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>[T], |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Send + <span class="lifetime">'data</span>> ParallelIterator <span class="kw">for </span>IterMut<<span class="lifetime">'data</span>, T> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>T; |
| |
| <span class="kw">fn </span>drive_unindexed<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: UnindexedConsumer<<span class="self">Self</span>::Item>, |
| { |
| bridge(<span class="self">self</span>, consumer) |
| } |
| |
| <span class="kw">fn </span>opt_len(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="prelude-val">Some</span>(<span class="self">self</span>.len()) |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Send + <span class="lifetime">'data</span>> IndexedParallelIterator <span class="kw">for </span>IterMut<<span class="lifetime">'data</span>, T> { |
| <span class="kw">fn </span>drive<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: Consumer<<span class="self">Self</span>::Item>, |
| { |
| bridge(<span class="self">self</span>, consumer) |
| } |
| |
| <span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.slice.len() |
| } |
| |
| <span class="kw">fn </span>with_producer<CB>(<span class="self">self</span>, callback: CB) -> CB::Output |
| <span class="kw">where |
| </span>CB: ProducerCallback<<span class="self">Self</span>::Item>, |
| { |
| callback.callback(IterMutProducer { slice: <span class="self">self</span>.slice }) |
| } |
| } |
| |
| <span class="kw">struct </span>IterMutProducer<<span class="lifetime">'data</span>, T: Send> { |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>[T], |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: <span class="lifetime">'data </span>+ Send> Producer <span class="kw">for </span>IterMutProducer<<span class="lifetime">'data</span>, T> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>T; |
| <span class="kw">type </span>IntoIter = ::std::slice::IterMut<<span class="lifetime">'data</span>, T>; |
| |
| <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { |
| <span class="self">self</span>.slice.iter_mut() |
| } |
| |
| <span class="kw">fn </span>split_at(<span class="self">self</span>, index: usize) -> (<span class="self">Self</span>, <span class="self">Self</span>) { |
| <span class="kw">let </span>(left, right) = <span class="self">self</span>.slice.split_at_mut(index); |
| ( |
| IterMutProducer { slice: left }, |
| IterMutProducer { slice: right }, |
| ) |
| } |
| } |
| |
| <span class="doccomment">/// Parallel iterator over slices separated by a predicate |
| </span><span class="kw">pub struct </span>Split<<span class="lifetime">'data</span>, T, P> { |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span>[T], |
| separator: P, |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T, P: Clone> Clone <span class="kw">for </span>Split<<span class="lifetime">'data</span>, T, P> { |
| <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Split { |
| separator: <span class="self">self</span>.separator.clone(), |
| ..<span class="kw-2">*</span><span class="self">self |
| </span>} |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Debug, P> Debug <span class="kw">for </span>Split<<span class="lifetime">'data</span>, T, P> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_struct(<span class="string">"Split"</span>).field(<span class="string">"slice"</span>, <span class="kw-2">&</span><span class="self">self</span>.slice).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T, P> ParallelIterator <span class="kw">for </span>Split<<span class="lifetime">'data</span>, T, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span>T) -> bool + Sync + Send, |
| T: Sync, |
| { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span>[T]; |
| |
| <span class="kw">fn </span>drive_unindexed<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: UnindexedConsumer<<span class="self">Self</span>::Item>, |
| { |
| <span class="kw">let </span>producer = SplitProducer::new(<span class="self">self</span>.slice, <span class="kw-2">&</span><span class="self">self</span>.separator); |
| bridge_unindexed(producer, consumer) |
| } |
| } |
| |
| <span class="doccomment">/// Implement support for `SplitProducer`. |
| </span><span class="kw">impl</span><<span class="lifetime">'data</span>, T, P> Fissile<P> <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'data </span>[T] |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span>T) -> bool, |
| { |
| <span class="kw">fn </span>length(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.len() |
| } |
| |
| <span class="kw">fn </span>midpoint(<span class="kw-2">&</span><span class="self">self</span>, end: usize) -> usize { |
| end / <span class="number">2 |
| </span>} |
| |
| <span class="kw">fn </span>find(<span class="kw-2">&</span><span class="self">self</span>, separator: <span class="kw-2">&</span>P, start: usize, end: usize) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="self">self</span>[start..end].iter().position(separator) |
| } |
| |
| <span class="kw">fn </span>rfind(<span class="kw-2">&</span><span class="self">self</span>, separator: <span class="kw-2">&</span>P, end: usize) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="self">self</span>[..end].iter().rposition(separator) |
| } |
| |
| <span class="kw">fn </span>split_once(<span class="self">self</span>, index: usize) -> (<span class="self">Self</span>, <span class="self">Self</span>) { |
| <span class="kw">let </span>(left, right) = <span class="self">self</span>.split_at(index); |
| (left, <span class="kw-2">&</span>right[<span class="number">1</span>..]) <span class="comment">// skip the separator |
| </span>} |
| |
| <span class="kw">fn </span>fold_splits<F>(<span class="self">self</span>, separator: <span class="kw-2">&</span>P, folder: F, skip_last: bool) -> F |
| <span class="kw">where |
| </span>F: Folder<<span class="self">Self</span>>, |
| <span class="self">Self</span>: Send, |
| { |
| <span class="kw">let </span><span class="kw-2">mut </span>split = <span class="self">self</span>.split(separator); |
| <span class="kw">if </span>skip_last { |
| split.next_back(); |
| } |
| folder.consume_iter(split) |
| } |
| } |
| |
| <span class="doccomment">/// Parallel iterator over mutable slices separated by a predicate |
| </span><span class="kw">pub struct </span>SplitMut<<span class="lifetime">'data</span>, T, P> { |
| slice: <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>[T], |
| separator: P, |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T: Debug, P> Debug <span class="kw">for </span>SplitMut<<span class="lifetime">'data</span>, T, P> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_struct(<span class="string">"SplitMut"</span>) |
| .field(<span class="string">"slice"</span>, <span class="kw-2">&</span><span class="self">self</span>.slice) |
| .finish() |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, T, P> ParallelIterator <span class="kw">for </span>SplitMut<<span class="lifetime">'data</span>, T, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span>T) -> bool + Sync + Send, |
| T: Send, |
| { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>[T]; |
| |
| <span class="kw">fn </span>drive_unindexed<C>(<span class="self">self</span>, consumer: C) -> C::Result |
| <span class="kw">where |
| </span>C: UnindexedConsumer<<span class="self">Self</span>::Item>, |
| { |
| <span class="kw">let </span>producer = SplitProducer::new(<span class="self">self</span>.slice, <span class="kw-2">&</span><span class="self">self</span>.separator); |
| bridge_unindexed(producer, consumer) |
| } |
| } |
| |
| <span class="doccomment">/// Implement support for `SplitProducer`. |
| </span><span class="kw">impl</span><<span class="lifetime">'data</span>, T, P> Fissile<P> <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>[T] |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span>T) -> bool, |
| { |
| <span class="kw">fn </span>length(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.len() |
| } |
| |
| <span class="kw">fn </span>midpoint(<span class="kw-2">&</span><span class="self">self</span>, end: usize) -> usize { |
| end / <span class="number">2 |
| </span>} |
| |
| <span class="kw">fn </span>find(<span class="kw-2">&</span><span class="self">self</span>, separator: <span class="kw-2">&</span>P, start: usize, end: usize) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="self">self</span>[start..end].iter().position(separator) |
| } |
| |
| <span class="kw">fn </span>rfind(<span class="kw-2">&</span><span class="self">self</span>, separator: <span class="kw-2">&</span>P, end: usize) -> <span class="prelude-ty">Option</span><usize> { |
| <span class="self">self</span>[..end].iter().rposition(separator) |
| } |
| |
| <span class="kw">fn </span>split_once(<span class="self">self</span>, index: usize) -> (<span class="self">Self</span>, <span class="self">Self</span>) { |
| <span class="kw">let </span>(left, right) = <span class="self">self</span>.split_at_mut(index); |
| (left, <span class="kw-2">&mut </span>right[<span class="number">1</span>..]) <span class="comment">// skip the separator |
| </span>} |
| |
| <span class="kw">fn </span>fold_splits<F>(<span class="self">self</span>, separator: <span class="kw-2">&</span>P, folder: F, skip_last: bool) -> F |
| <span class="kw">where |
| </span>F: Folder<<span class="self">Self</span>>, |
| <span class="self">Self</span>: Send, |
| { |
| <span class="kw">let </span><span class="kw-2">mut </span>split = <span class="self">self</span>.split_mut(separator); |
| <span class="kw">if </span>skip_last { |
| split.next_back(); |
| } |
| folder.consume_iter(split) |
| } |
| } |
| </code></pre></div> |
| </section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="rayon" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html> |