blob: fc9c1aa60b8f19d12d45bbccc1630ac4aea6fa60 [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/git/checkouts/rayon-3b3b152053499ede/a07ce2e/src/iter/unzip.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>unzip.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>
</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">super</span>::plumbing::<span class="kw-2">*</span>;
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="doccomment">/// This trait abstracts the different ways we can &quot;unzip&quot; one parallel
/// iterator into two distinct consumers, which we can handle almost
/// identically apart from how to process the individual items.
</span><span class="kw">trait </span>UnzipOp&lt;T&gt;: Sync + Send {
<span class="doccomment">/// The type of item expected by the left consumer.
</span><span class="kw">type </span>Left: Send;
<span class="doccomment">/// The type of item expected by the right consumer.
</span><span class="kw">type </span>Right: Send;
<span class="doccomment">/// Consumes one item and feeds it to one or both of the underlying folders.
</span><span class="kw">fn </span>consume&lt;FA, FB&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, item: T, left: FA, right: FB) -&gt; (FA, FB)
<span class="kw">where
</span>FA: Folder&lt;<span class="self">Self</span>::Left&gt;,
FB: Folder&lt;<span class="self">Self</span>::Right&gt;;
<span class="doccomment">/// Reports whether this op may support indexed consumers.
/// - e.g. true for `unzip` where the item count passed through directly.
/// - e.g. false for `partition` where the sorting is not yet known.
</span><span class="kw">fn </span>indexable() -&gt; bool {
<span class="bool-val">false
</span>}
}
<span class="doccomment">/// Runs an unzip-like operation into default `ParallelExtend` collections.
</span><span class="kw">fn </span>execute&lt;I, OP, FromA, FromB&gt;(pi: I, op: OP) -&gt; (FromA, FromB)
<span class="kw">where
</span>I: ParallelIterator,
OP: UnzipOp&lt;I::Item&gt;,
FromA: Default + Send + ParallelExtend&lt;OP::Left&gt;,
FromB: Default + Send + ParallelExtend&lt;OP::Right&gt;,
{
<span class="kw">let </span><span class="kw-2">mut </span>a = FromA::default();
<span class="kw">let </span><span class="kw-2">mut </span>b = FromB::default();
execute_into(<span class="kw-2">&amp;mut </span>a, <span class="kw-2">&amp;mut </span>b, pi, op);
(a, b)
}
<span class="doccomment">/// Runs an unzip-like operation into `ParallelExtend` collections.
</span><span class="kw">fn </span>execute_into&lt;I, OP, FromA, FromB&gt;(a: <span class="kw-2">&amp;mut </span>FromA, b: <span class="kw-2">&amp;mut </span>FromB, pi: I, op: OP)
<span class="kw">where
</span>I: ParallelIterator,
OP: UnzipOp&lt;I::Item&gt;,
FromA: Send + ParallelExtend&lt;OP::Left&gt;,
FromB: Send + ParallelExtend&lt;OP::Right&gt;,
{
<span class="comment">// We have no idea what the consumers will look like for these
// collections&#39; `par_extend`, but we can intercept them in our own
// `drive_unindexed`. Start with the left side, type `A`:
</span><span class="kw">let </span>iter = UnzipA { base: pi, op, b };
a.par_extend(iter);
}
<span class="doccomment">/// Unzips the items of a parallel iterator into a pair of arbitrary
/// `ParallelExtend` containers.
///
/// This is called by `ParallelIterator::unzip`.
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>unzip&lt;I, A, B, FromA, FromB&gt;(pi: I) -&gt; (FromA, FromB)
<span class="kw">where
</span>I: ParallelIterator&lt;Item = (A, B)&gt;,
FromA: Default + Send + ParallelExtend&lt;A&gt;,
FromB: Default + Send + ParallelExtend&lt;B&gt;,
A: Send,
B: Send,
{
execute(pi, Unzip)
}
<span class="doccomment">/// Unzips an `IndexedParallelIterator` into two arbitrary `Consumer`s.
///
/// This is called by `super::collect::unzip_into_vecs`.
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>unzip_indexed&lt;I, A, B, CA, CB&gt;(pi: I, left: CA, right: CB) -&gt; (CA::Result, CB::Result)
<span class="kw">where
</span>I: IndexedParallelIterator&lt;Item = (A, B)&gt;,
CA: Consumer&lt;A&gt;,
CB: Consumer&lt;B&gt;,
A: Send,
B: Send,
{
<span class="kw">let </span>consumer = UnzipConsumer {
op: <span class="kw-2">&amp;</span>Unzip,
left,
right,
};
pi.drive(consumer)
}
<span class="doccomment">/// An `UnzipOp` that splits a tuple directly into the two consumers.
</span><span class="kw">struct </span>Unzip;
<span class="kw">impl</span>&lt;A: Send, B: Send&gt; UnzipOp&lt;(A, B)&gt; <span class="kw">for </span>Unzip {
<span class="kw">type </span>Left = A;
<span class="kw">type </span>Right = B;
<span class="kw">fn </span>consume&lt;FA, FB&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, item: (A, B), left: FA, right: FB) -&gt; (FA, FB)
<span class="kw">where
</span>FA: Folder&lt;A&gt;,
FB: Folder&lt;B&gt;,
{
(left.consume(item.<span class="number">0</span>), right.consume(item.<span class="number">1</span>))
}
<span class="kw">fn </span>indexable() -&gt; bool {
<span class="bool-val">true
</span>}
}
<span class="doccomment">/// Partitions the items of a parallel iterator into a pair of arbitrary
/// `ParallelExtend` containers.
///
/// This is called by `ParallelIterator::partition`.
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>partition&lt;I, A, B, P&gt;(pi: I, predicate: P) -&gt; (A, B)
<span class="kw">where
</span>I: ParallelIterator,
A: Default + Send + ParallelExtend&lt;I::Item&gt;,
B: Default + Send + ParallelExtend&lt;I::Item&gt;,
P: Fn(<span class="kw-2">&amp;</span>I::Item) -&gt; bool + Sync + Send,
{
execute(pi, Partition { predicate })
}
<span class="doccomment">/// An `UnzipOp` that routes items depending on a predicate function.
</span><span class="kw">struct </span>Partition&lt;P&gt; {
predicate: P,
}
<span class="kw">impl</span>&lt;P, T&gt; UnzipOp&lt;T&gt; <span class="kw">for </span>Partition&lt;P&gt;
<span class="kw">where
</span>P: Fn(<span class="kw-2">&amp;</span>T) -&gt; bool + Sync + Send,
T: Send,
{
<span class="kw">type </span>Left = T;
<span class="kw">type </span>Right = T;
<span class="kw">fn </span>consume&lt;FA, FB&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, item: T, left: FA, right: FB) -&gt; (FA, FB)
<span class="kw">where
</span>FA: Folder&lt;T&gt;,
FB: Folder&lt;T&gt;,
{
<span class="kw">if </span>(<span class="self">self</span>.predicate)(<span class="kw-2">&amp;</span>item) {
(left.consume(item), right)
} <span class="kw">else </span>{
(left, right.consume(item))
}
}
}
<span class="doccomment">/// Partitions and maps the items of a parallel iterator into a pair of
/// arbitrary `ParallelExtend` containers.
///
/// This called by `ParallelIterator::partition_map`.
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>partition_map&lt;I, A, B, P, L, R&gt;(pi: I, predicate: P) -&gt; (A, B)
<span class="kw">where
</span>I: ParallelIterator,
A: Default + Send + ParallelExtend&lt;L&gt;,
B: Default + Send + ParallelExtend&lt;R&gt;,
P: Fn(I::Item) -&gt; Either&lt;L, R&gt; + Sync + Send,
L: Send,
R: Send,
{
execute(pi, PartitionMap { predicate })
}
<span class="doccomment">/// An `UnzipOp` that routes items depending on how they are mapped `Either`.
</span><span class="kw">struct </span>PartitionMap&lt;P&gt; {
predicate: P,
}
<span class="kw">impl</span>&lt;P, L, R, T&gt; UnzipOp&lt;T&gt; <span class="kw">for </span>PartitionMap&lt;P&gt;
<span class="kw">where
</span>P: Fn(T) -&gt; Either&lt;L, R&gt; + Sync + Send,
L: Send,
R: Send,
{
<span class="kw">type </span>Left = L;
<span class="kw">type </span>Right = R;
<span class="kw">fn </span>consume&lt;FA, FB&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, item: T, left: FA, right: FB) -&gt; (FA, FB)
<span class="kw">where
</span>FA: Folder&lt;L&gt;,
FB: Folder&lt;R&gt;,
{
<span class="kw">match </span>(<span class="self">self</span>.predicate)(item) {
Either::Left(item) =&gt; (left.consume(item), right),
Either::Right(item) =&gt; (left, right.consume(item)),
}
}
}
<span class="doccomment">/// A fake iterator to intercept the `Consumer` for type `A`.
</span><span class="kw">struct </span>UnzipA&lt;<span class="lifetime">&#39;b</span>, I, OP, FromB&gt; {
base: I,
op: OP,
b: <span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span><span class="kw-2">mut </span>FromB,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;b</span>, I, OP, FromB&gt; ParallelIterator <span class="kw">for </span>UnzipA&lt;<span class="lifetime">&#39;b</span>, I, OP, FromB&gt;
<span class="kw">where
</span>I: ParallelIterator,
OP: UnzipOp&lt;I::Item&gt;,
FromB: Send + ParallelExtend&lt;OP::Right&gt;,
{
<span class="kw">type </span>Item = OP::Left;
<span class="kw">fn </span>drive_unindexed&lt;C&gt;(<span class="self">self</span>, consumer: C) -&gt; C::Result
<span class="kw">where
</span>C: UnindexedConsumer&lt;<span class="self">Self</span>::Item&gt;,
{
<span class="kw">let </span><span class="kw-2">mut </span>result = <span class="prelude-val">None</span>;
{
<span class="comment">// Now it&#39;s time to find the consumer for type `B`
</span><span class="kw">let </span>iter = UnzipB {
base: <span class="self">self</span>.base,
op: <span class="self">self</span>.op,
left_consumer: consumer,
left_result: <span class="kw-2">&amp;mut </span>result,
};
<span class="self">self</span>.b.par_extend(iter);
}
<span class="comment">// NB: If for some reason `b.par_extend` doesn&#39;t actually drive the
// iterator, then we won&#39;t have a result for the left side to return
// at all. We can&#39;t fake an arbitrary consumer&#39;s result, so panic.
</span>result.expect(<span class="string">&quot;unzip consumers didn&#39;t execute!&quot;</span>)
}
<span class="kw">fn </span>opt_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
<span class="kw">if </span>OP::indexable() {
<span class="self">self</span>.base.opt_len()
} <span class="kw">else </span>{
<span class="prelude-val">None
</span>}
}
}
<span class="doccomment">/// A fake iterator to intercept the `Consumer` for type `B`.
</span><span class="kw">struct </span>UnzipB&lt;<span class="lifetime">&#39;r</span>, I, OP, CA&gt;
<span class="kw">where
</span>I: ParallelIterator,
OP: UnzipOp&lt;I::Item&gt;,
CA: UnindexedConsumer&lt;OP::Left&gt;,
CA::Result: <span class="lifetime">&#39;r</span>,
{
base: I,
op: OP,
left_consumer: CA,
left_result: <span class="kw-2">&amp;</span><span class="lifetime">&#39;r </span><span class="kw-2">mut </span><span class="prelude-ty">Option</span>&lt;CA::Result&gt;,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;r</span>, I, OP, CA&gt; ParallelIterator <span class="kw">for </span>UnzipB&lt;<span class="lifetime">&#39;r</span>, I, OP, CA&gt;
<span class="kw">where
</span>I: ParallelIterator,
OP: UnzipOp&lt;I::Item&gt;,
CA: UnindexedConsumer&lt;OP::Left&gt;,
{
<span class="kw">type </span>Item = OP::Right;
<span class="kw">fn </span>drive_unindexed&lt;C&gt;(<span class="self">self</span>, consumer: C) -&gt; C::Result
<span class="kw">where
</span>C: UnindexedConsumer&lt;<span class="self">Self</span>::Item&gt;,
{
<span class="comment">// Now that we have two consumers, we can unzip the real iterator.
</span><span class="kw">let </span>consumer = UnzipConsumer {
op: <span class="kw-2">&amp;</span><span class="self">self</span>.op,
left: <span class="self">self</span>.left_consumer,
right: consumer,
};
<span class="kw">let </span>result = <span class="self">self</span>.base.drive_unindexed(consumer);
<span class="kw-2">*</span><span class="self">self</span>.left_result = <span class="prelude-val">Some</span>(result.<span class="number">0</span>);
result.<span class="number">1
</span>}
<span class="kw">fn </span>opt_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
<span class="kw">if </span>OP::indexable() {
<span class="self">self</span>.base.opt_len()
} <span class="kw">else </span>{
<span class="prelude-val">None
</span>}
}
}
<span class="doccomment">/// `Consumer` that unzips into two other `Consumer`s
</span><span class="kw">struct </span>UnzipConsumer&lt;<span class="lifetime">&#39;a</span>, OP, CA, CB&gt; {
op: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>OP,
left: CA,
right: CB,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T, OP, CA, CB&gt; Consumer&lt;T&gt; <span class="kw">for </span>UnzipConsumer&lt;<span class="lifetime">&#39;a</span>, OP, CA, CB&gt;
<span class="kw">where
</span>OP: UnzipOp&lt;T&gt;,
CA: Consumer&lt;OP::Left&gt;,
CB: Consumer&lt;OP::Right&gt;,
{
<span class="kw">type </span>Folder = UnzipFolder&lt;<span class="lifetime">&#39;a</span>, OP, CA::Folder, CB::Folder&gt;;
<span class="kw">type </span>Reducer = UnzipReducer&lt;CA::Reducer, CB::Reducer&gt;;
<span class="kw">type </span><span class="prelude-ty">Result </span>= (CA::Result, CB::Result);
<span class="kw">fn </span>split_at(<span class="self">self</span>, index: usize) -&gt; (<span class="self">Self</span>, <span class="self">Self</span>, <span class="self">Self</span>::Reducer) {
<span class="kw">let </span>(left1, left2, left_reducer) = <span class="self">self</span>.left.split_at(index);
<span class="kw">let </span>(right1, right2, right_reducer) = <span class="self">self</span>.right.split_at(index);
(
UnzipConsumer {
op: <span class="self">self</span>.op,
left: left1,
right: right1,
},
UnzipConsumer {
op: <span class="self">self</span>.op,
left: left2,
right: right2,
},
UnzipReducer {
left: left_reducer,
right: right_reducer,
},
)
}
<span class="kw">fn </span>into_folder(<span class="self">self</span>) -&gt; <span class="self">Self</span>::Folder {
UnzipFolder {
op: <span class="self">self</span>.op,
left: <span class="self">self</span>.left.into_folder(),
right: <span class="self">self</span>.right.into_folder(),
}
}
<span class="kw">fn </span>full(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="comment">// don&#39;t stop until everyone is full
</span><span class="self">self</span>.left.full() &amp;&amp; <span class="self">self</span>.right.full()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T, OP, CA, CB&gt; UnindexedConsumer&lt;T&gt; <span class="kw">for </span>UnzipConsumer&lt;<span class="lifetime">&#39;a</span>, OP, CA, CB&gt;
<span class="kw">where
</span>OP: UnzipOp&lt;T&gt;,
CA: UnindexedConsumer&lt;OP::Left&gt;,
CB: UnindexedConsumer&lt;OP::Right&gt;,
{
<span class="kw">fn </span>split_off_left(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
UnzipConsumer {
op: <span class="self">self</span>.op,
left: <span class="self">self</span>.left.split_off_left(),
right: <span class="self">self</span>.right.split_off_left(),
}
}
<span class="kw">fn </span>to_reducer(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self</span>::Reducer {
UnzipReducer {
left: <span class="self">self</span>.left.to_reducer(),
right: <span class="self">self</span>.right.to_reducer(),
}
}
}
<span class="doccomment">/// `Folder` that unzips into two other `Folder`s
</span><span class="kw">struct </span>UnzipFolder&lt;<span class="lifetime">&#39;a</span>, OP, FA, FB&gt; {
op: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>OP,
left: FA,
right: FB,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T, OP, FA, FB&gt; Folder&lt;T&gt; <span class="kw">for </span>UnzipFolder&lt;<span class="lifetime">&#39;a</span>, OP, FA, FB&gt;
<span class="kw">where
</span>OP: UnzipOp&lt;T&gt;,
FA: Folder&lt;OP::Left&gt;,
FB: Folder&lt;OP::Right&gt;,
{
<span class="kw">type </span><span class="prelude-ty">Result </span>= (FA::Result, FB::Result);
<span class="kw">fn </span>consume(<span class="self">self</span>, item: T) -&gt; <span class="self">Self </span>{
<span class="kw">let </span>(left, right) = <span class="self">self</span>.op.consume(item, <span class="self">self</span>.left, <span class="self">self</span>.right);
UnzipFolder {
op: <span class="self">self</span>.op,
left,
right,
}
}
<span class="kw">fn </span>complete(<span class="self">self</span>) -&gt; <span class="self">Self</span>::Result {
(<span class="self">self</span>.left.complete(), <span class="self">self</span>.right.complete())
}
<span class="kw">fn </span>full(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="comment">// don&#39;t stop until everyone is full
</span><span class="self">self</span>.left.full() &amp;&amp; <span class="self">self</span>.right.full()
}
}
<span class="doccomment">/// `Reducer` that unzips into two other `Reducer`s
</span><span class="kw">struct </span>UnzipReducer&lt;RA, RB&gt; {
left: RA,
right: RB,
}
<span class="kw">impl</span>&lt;A, B, RA, RB&gt; Reducer&lt;(A, B)&gt; <span class="kw">for </span>UnzipReducer&lt;RA, RB&gt;
<span class="kw">where
</span>RA: Reducer&lt;A&gt;,
RB: Reducer&lt;B&gt;,
{
<span class="kw">fn </span>reduce(<span class="self">self</span>, left: (A, B), right: (A, B)) -&gt; (A, B) {
(
<span class="self">self</span>.left.reduce(left.<span class="number">0</span>, right.<span class="number">0</span>),
<span class="self">self</span>.right.reduce(left.<span class="number">1</span>, right.<span class="number">1</span>),
)
}
}
<span class="kw">impl</span>&lt;A, B, FromA, FromB&gt; ParallelExtend&lt;(A, B)&gt; <span class="kw">for </span>(FromA, FromB)
<span class="kw">where
</span>A: Send,
B: Send,
FromA: Send + ParallelExtend&lt;A&gt;,
FromB: Send + ParallelExtend&lt;B&gt;,
{
<span class="kw">fn </span>par_extend&lt;I&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, pi: I)
<span class="kw">where
</span>I: IntoParallelIterator&lt;Item = (A, B)&gt;,
{
execute_into(<span class="kw-2">&amp;mut </span><span class="self">self</span>.<span class="number">0</span>, <span class="kw-2">&amp;mut </span><span class="self">self</span>.<span class="number">1</span>, pi.into_par_iter(), Unzip);
}
}
<span class="kw">impl</span>&lt;L, R, A, B&gt; ParallelExtend&lt;Either&lt;L, R&gt;&gt; <span class="kw">for </span>(A, B)
<span class="kw">where
</span>L: Send,
R: Send,
A: Send + ParallelExtend&lt;L&gt;,
B: Send + ParallelExtend&lt;R&gt;,
{
<span class="kw">fn </span>par_extend&lt;I&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, pi: I)
<span class="kw">where
</span>I: IntoParallelIterator&lt;Item = Either&lt;L, R&gt;&gt;,
{
execute_into(<span class="kw-2">&amp;mut </span><span class="self">self</span>.<span class="number">0</span>, <span class="kw-2">&amp;mut </span><span class="self">self</span>.<span class="number">1</span>, pi.into_par_iter(), UnEither);
}
}
<span class="doccomment">/// An `UnzipOp` that routes items depending on their `Either` variant.
</span><span class="kw">struct </span>UnEither;
<span class="kw">impl</span>&lt;L, R&gt; UnzipOp&lt;Either&lt;L, R&gt;&gt; <span class="kw">for </span>UnEither
<span class="kw">where
</span>L: Send,
R: Send,
{
<span class="kw">type </span>Left = L;
<span class="kw">type </span>Right = R;
<span class="kw">fn </span>consume&lt;FL, FR&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, item: Either&lt;L, R&gt;, left: FL, right: FR) -&gt; (FL, FR)
<span class="kw">where
</span>FL: Folder&lt;L&gt;,
FR: Folder&lt;R&gt;,
{
<span class="kw">match </span>item {
Either::Left(item) =&gt; (left.consume(item), right),
Either::Right(item) =&gt; (left, right.consume(item)),
}
}
}
<span class="kw">impl</span>&lt;A, B, FromA, FromB&gt; FromParallelIterator&lt;(A, B)&gt; <span class="kw">for </span>(FromA, FromB)
<span class="kw">where
</span>A: Send,
B: Send,
FromA: Send + FromParallelIterator&lt;A&gt;,
FromB: Send + FromParallelIterator&lt;B&gt;,
{
<span class="kw">fn </span>from_par_iter&lt;I&gt;(pi: I) -&gt; <span class="self">Self
</span><span class="kw">where
</span>I: IntoParallelIterator&lt;Item = (A, B)&gt;,
{
<span class="kw">let </span>(a, b): (Collector&lt;FromA&gt;, Collector&lt;FromB&gt;) = pi.into_par_iter().unzip();
(a.result.unwrap(), b.result.unwrap())
}
}
<span class="kw">impl</span>&lt;L, R, A, B&gt; FromParallelIterator&lt;Either&lt;L, R&gt;&gt; <span class="kw">for </span>(A, B)
<span class="kw">where
</span>L: Send,
R: Send,
A: Send + FromParallelIterator&lt;L&gt;,
B: Send + FromParallelIterator&lt;R&gt;,
{
<span class="kw">fn </span>from_par_iter&lt;I&gt;(pi: I) -&gt; <span class="self">Self
</span><span class="kw">where
</span>I: IntoParallelIterator&lt;Item = Either&lt;L, R&gt;&gt;,
{
<span class="kw">fn </span>identity&lt;T&gt;(x: T) -&gt; T {
x
}
<span class="kw">let </span>(a, b): (Collector&lt;A&gt;, Collector&lt;B&gt;) = pi.into_par_iter().partition_map(identity);
(a.result.unwrap(), b.result.unwrap())
}
}
<span class="doccomment">/// Shim to implement a one-time `ParallelExtend` using `FromParallelIterator`.
</span><span class="kw">struct </span>Collector&lt;FromT&gt; {
result: <span class="prelude-ty">Option</span>&lt;FromT&gt;,
}
<span class="kw">impl</span>&lt;FromT&gt; Default <span class="kw">for </span>Collector&lt;FromT&gt; {
<span class="kw">fn </span>default() -&gt; <span class="self">Self </span>{
Collector { result: <span class="prelude-val">None </span>}
}
}
<span class="kw">impl</span>&lt;T, FromT&gt; ParallelExtend&lt;T&gt; <span class="kw">for </span>Collector&lt;FromT&gt;
<span class="kw">where
</span>T: Send,
FromT: Send + FromParallelIterator&lt;T&gt;,
{
<span class="kw">fn </span>par_extend&lt;I&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, pi: I)
<span class="kw">where
</span>I: IntoParallelIterator&lt;Item = T&gt;,
{
<span class="macro">debug_assert!</span>(<span class="self">self</span>.result.is_none());
<span class="self">self</span>.result = <span class="prelude-val">Some</span>(pi.into_par_iter().collect());
}
}
</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>