blob: 95dcad30924ae5e9945db778f844cd9642eb6dcf [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/plumbing/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>
</pre><pre class="rust"><code><span class="doccomment">//! Traits and functions used to implement parallel iteration. These are
//! low-level details -- users of parallel iterators should not need to
//! interact with them directly. See [the `plumbing` README][r] for a general overview.
//!
//! [r]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md
</span><span class="kw">use </span><span class="kw">crate</span>::join_context;
<span class="kw">use </span><span class="kw">super</span>::IndexedParallelIterator;
<span class="kw">use </span>std::cmp;
<span class="kw">use </span>std::usize;
<span class="doccomment">/// The `ProducerCallback` trait is a kind of generic closure,
/// [analogous to `FnOnce`][FnOnce]. See [the corresponding section in
/// the plumbing README][r] for more details.
///
/// [r]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md#producer-callback
/// [FnOnce]: https://doc.rust-lang.org/std/ops/trait.FnOnce.html
</span><span class="kw">pub trait </span>ProducerCallback&lt;T&gt; {
<span class="doccomment">/// The type of value returned by this callback. Analogous to
/// [`Output` from the `FnOnce` trait][Output].
///
/// [Output]: https://doc.rust-lang.org/std/ops/trait.FnOnce.html#associatedtype.Output
</span><span class="kw">type </span>Output;
<span class="doccomment">/// Invokes the callback with the given producer as argument. The
/// key point of this trait is that this method is generic over
/// `P`, and hence implementors must be defined for any producer.
</span><span class="kw">fn </span>callback&lt;P&gt;(<span class="self">self</span>, producer: P) -&gt; <span class="self">Self</span>::Output
<span class="kw">where
</span>P: Producer&lt;Item = T&gt;;
}
<span class="doccomment">/// A `Producer` is effectively a &quot;splittable `IntoIterator`&quot;. That
/// is, a producer is a value which can be converted into an iterator
/// at any time: at that point, it simply produces items on demand,
/// like any iterator. But what makes a `Producer` special is that,
/// *before* we convert to an iterator, we can also **split** it at a
/// particular point using the `split_at` method. This will yield up
/// two producers, one producing the items before that point, and one
/// producing the items after that point (these two producers can then
/// independently be split further, or be converted into iterators).
/// In Rayon, this splitting is used to divide between threads.
/// See [the `plumbing` README][r] for further details.
///
/// Note that each producer will always produce a fixed number of
/// items N. However, this number N is not queryable through the API;
/// the consumer is expected to track it.
///
/// NB. You might expect `Producer` to extend the `IntoIterator`
/// trait. However, [rust-lang/rust#20671][20671] prevents us from
/// declaring the DoubleEndedIterator and ExactSizeIterator
/// constraints on a required IntoIterator trait, so we inline
/// IntoIterator here until that issue is fixed.
///
/// [r]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md
/// [20671]: https://github.com/rust-lang/rust/issues/20671
</span><span class="kw">pub trait </span>Producer: Send + Sized {
<span class="doccomment">/// The type of item that will be produced by this producer once
/// it is converted into an iterator.
</span><span class="kw">type </span>Item;
<span class="doccomment">/// The type of iterator we will become.
</span><span class="kw">type </span>IntoIter: Iterator&lt;Item = <span class="self">Self</span>::Item&gt; + DoubleEndedIterator + ExactSizeIterator;
<span class="doccomment">/// Convert `self` into an iterator; at this point, no more parallel splits
/// are possible.
</span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; <span class="self">Self</span>::IntoIter;
<span class="doccomment">/// The minimum number of items that we will process
/// sequentially. Defaults to 1, which means that we will split
/// all the way down to a single item. This can be raised higher
/// using the [`with_min_len`] method, which will force us to
/// create sequential tasks at a larger granularity. Note that
/// Rayon automatically normally attempts to adjust the size of
/// parallel splits to reduce overhead, so this should not be
/// needed.
///
/// [`with_min_len`]: ../trait.IndexedParallelIterator.html#method.with_min_len
</span><span class="kw">fn </span>min_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="number">1
</span>}
<span class="doccomment">/// The maximum number of items that we will process
/// sequentially. Defaults to MAX, which means that we can choose
/// not to split at all. This can be lowered using the
/// [`with_max_len`] method, which will force us to create more
/// parallel tasks. Note that Rayon automatically normally
/// attempts to adjust the size of parallel splits to reduce
/// overhead, so this should not be needed.
///
/// [`with_max_len`]: ../trait.IndexedParallelIterator.html#method.with_max_len
</span><span class="kw">fn </span>max_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
usize::MAX
}
<span class="doccomment">/// Split into two producers; one produces items `0..index`, the
/// other `index..N`. Index must be less than or equal to `N`.
</span><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="doccomment">/// Iterate the producer, feeding each element to `folder`, and
/// stop when the folder is full (or all elements have been consumed).
///
/// The provided implementation is sufficient for most iterables.
</span><span class="kw">fn </span>fold_with&lt;F&gt;(<span class="self">self</span>, folder: F) -&gt; F
<span class="kw">where
</span>F: Folder&lt;<span class="self">Self</span>::Item&gt;,
{
folder.consume_iter(<span class="self">self</span>.into_iter())
}
}
<span class="doccomment">/// A consumer is effectively a [generalized &quot;fold&quot; operation][fold],
/// and in fact each consumer will eventually be converted into a
/// [`Folder`]. What makes a consumer special is that, like a
/// [`Producer`], it can be **split** into multiple consumers using
/// the `split_at` method. When a consumer is split, it produces two
/// consumers, as well as a **reducer**. The two consumers can be fed
/// items independently, and when they are done the reducer is used to
/// combine their two results into one. See [the `plumbing`
/// README][r] for further details.
///
/// [r]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md
/// [fold]: https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.fold
/// [`Folder`]: trait.Folder.html
/// [`Producer`]: trait.Producer.html
</span><span class="kw">pub trait </span>Consumer&lt;Item&gt;: Send + Sized {
<span class="doccomment">/// The type of folder that this consumer can be converted into.
</span><span class="kw">type </span>Folder: Folder&lt;Item, <span class="prelude-ty">Result </span>= <span class="self">Self</span>::Result&gt;;
<span class="doccomment">/// The type of reducer that is produced if this consumer is split.
</span><span class="kw">type </span>Reducer: Reducer&lt;<span class="self">Self</span>::Result&gt;;
<span class="doccomment">/// The type of result that this consumer will ultimately produce.
</span><span class="kw">type </span><span class="prelude-ty">Result</span>: Send;
<span class="doccomment">/// Divide the consumer into two consumers, one processing items
/// `0..index` and one processing items from `index..`. Also
/// produces a reducer that can be used to reduce the results at
/// the end.
</span><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="doccomment">/// Convert the consumer into a folder that can consume items
/// sequentially, eventually producing a final result.
</span><span class="kw">fn </span>into_folder(<span class="self">self</span>) -&gt; <span class="self">Self</span>::Folder;
<span class="doccomment">/// Hint whether this `Consumer` would like to stop processing
/// further items, e.g. if a search has been completed.
</span><span class="kw">fn </span>full(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool;
}
<span class="doccomment">/// The `Folder` trait encapsulates [the standard fold
/// operation][fold]. It can be fed many items using the `consume`
/// method. At the end, once all items have been consumed, it can then
/// be converted (using `complete`) into a final value.
///
/// [fold]: https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.fold
</span><span class="kw">pub trait </span>Folder&lt;Item&gt;: Sized {
<span class="doccomment">/// The type of result that will ultimately be produced by the folder.
</span><span class="kw">type </span><span class="prelude-ty">Result</span>;
<span class="doccomment">/// Consume next item and return new sequential state.
</span><span class="kw">fn </span>consume(<span class="self">self</span>, item: Item) -&gt; <span class="self">Self</span>;
<span class="doccomment">/// Consume items from the iterator until full, and return new sequential state.
///
/// This method is **optional**. The default simply iterates over
/// `iter`, invoking `consume` and checking after each iteration
/// whether `full` returns false.
///
/// The main reason to override it is if you can provide a more
/// specialized, efficient implementation.
</span><span class="kw">fn </span>consume_iter&lt;I&gt;(<span class="kw-2">mut </span><span class="self">self</span>, iter: I) -&gt; <span class="self">Self
</span><span class="kw">where
</span>I: IntoIterator&lt;Item = Item&gt;,
{
<span class="kw">for </span>item <span class="kw">in </span>iter {
<span class="self">self </span>= <span class="self">self</span>.consume(item);
<span class="kw">if </span><span class="self">self</span>.full() {
<span class="kw">break</span>;
}
}
<span class="self">self
</span>}
<span class="doccomment">/// Finish consuming items, produce final result.
</span><span class="kw">fn </span>complete(<span class="self">self</span>) -&gt; <span class="self">Self</span>::Result;
<span class="doccomment">/// Hint whether this `Folder` would like to stop processing
/// further items, e.g. if a search has been completed.
</span><span class="kw">fn </span>full(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool;
}
<span class="doccomment">/// The reducer is the final step of a `Consumer` -- after a consumer
/// has been split into two parts, and each of those parts has been
/// fully processed, we are left with two results. The reducer is then
/// used to combine those two results into one. See [the `plumbing`
/// README][r] for further details.
///
/// [r]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md
</span><span class="kw">pub trait </span>Reducer&lt;<span class="prelude-ty">Result</span>&gt; {
<span class="doccomment">/// Reduce two final results into one; this is executed after a
/// split.
</span><span class="kw">fn </span>reduce(<span class="self">self</span>, left: <span class="prelude-ty">Result</span>, right: <span class="prelude-ty">Result</span>) -&gt; <span class="prelude-ty">Result</span>;
}
<span class="doccomment">/// A stateless consumer can be freely copied. These consumers can be
/// used like regular consumers, but they also support a
/// `split_off_left` method that does not take an index to split, but
/// simply splits at some arbitrary point (`for_each`, for example,
/// produces an unindexed consumer).
</span><span class="kw">pub trait </span>UnindexedConsumer&lt;I&gt;: Consumer&lt;I&gt; {
<span class="doccomment">/// Splits off a &quot;left&quot; consumer and returns it. The `self`
/// consumer should then be used to consume the &quot;right&quot; portion of
/// the data. (The ordering matters for methods like find_first --
/// values produced by the returned value are given precedence
/// over values produced by `self`.) Once the left and right
/// halves have been fully consumed, you should reduce the results
/// with the result of `to_reducer`.
</span><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>;
<span class="doccomment">/// Creates a reducer that can be used to combine the results from
/// a split consumer.
</span><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;
}
<span class="doccomment">/// A variant on `Producer` which does not know its exact length or
/// cannot represent it in a `usize`. These producers act like
/// ordinary producers except that they cannot be told to split at a
/// particular point. Instead, you just ask them to split &#39;somewhere&#39;.
///
/// (In principle, `Producer` could extend this trait; however, it
/// does not because to do so would require producers to carry their
/// own length with them.)
</span><span class="kw">pub trait </span>UnindexedProducer: Send + Sized {
<span class="doccomment">/// The type of item returned by this producer.
</span><span class="kw">type </span>Item;
<span class="doccomment">/// Split midway into a new producer if possible, otherwise return `None`.
</span><span class="kw">fn </span>split(<span class="self">self</span>) -&gt; (<span class="self">Self</span>, <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>&gt;);
<span class="doccomment">/// Iterate the producer, feeding each element to `folder`, and
/// stop when the folder is full (or all elements have been consumed).
</span><span class="kw">fn </span>fold_with&lt;F&gt;(<span class="self">self</span>, folder: F) -&gt; F
<span class="kw">where
</span>F: Folder&lt;<span class="self">Self</span>::Item&gt;;
}
<span class="doccomment">/// A splitter controls the policy for splitting into smaller work items.
///
/// Thief-splitting is an adaptive policy that starts by splitting into
/// enough jobs for every worker thread, and then resets itself whenever a
/// job is actually stolen into a different thread.
</span><span class="attribute">#[derive(Clone, Copy)]
</span><span class="kw">struct </span>Splitter {
<span class="doccomment">/// The `splits` tell us approximately how many remaining times we&#39;d
/// like to split this job. We always just divide it by two though, so
/// the effective number of pieces will be `next_power_of_two()`.
</span>splits: usize,
}
<span class="kw">impl </span>Splitter {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>new() -&gt; Splitter {
Splitter {
splits: <span class="kw">crate</span>::current_num_threads(),
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_split(<span class="kw-2">&amp;mut </span><span class="self">self</span>, stolen: bool) -&gt; bool {
<span class="kw">let </span>Splitter { splits } = <span class="kw-2">*</span><span class="self">self</span>;
<span class="kw">if </span>stolen {
<span class="comment">// This job was stolen! Reset the number of desired splits to the
// thread count, if that&#39;s more than we had remaining anyway.
</span><span class="self">self</span>.splits = cmp::max(<span class="kw">crate</span>::current_num_threads(), <span class="self">self</span>.splits / <span class="number">2</span>);
<span class="bool-val">true
</span>} <span class="kw">else if </span>splits &gt; <span class="number">0 </span>{
<span class="comment">// We have splits remaining, make it so.
</span><span class="self">self</span>.splits /= <span class="number">2</span>;
<span class="bool-val">true
</span>} <span class="kw">else </span>{
<span class="comment">// Not stolen, and no more splits -- we&#39;re done!
</span><span class="bool-val">false
</span>}
}
}
<span class="doccomment">/// The length splitter is built on thief-splitting, but additionally takes
/// into account the remaining length of the iterator.
</span><span class="attribute">#[derive(Clone, Copy)]
</span><span class="kw">struct </span>LengthSplitter {
inner: Splitter,
<span class="doccomment">/// The smallest we&#39;re willing to divide into. Usually this is just 1,
/// but you can choose a larger working size with `with_min_len()`.
</span>min: usize,
}
<span class="kw">impl </span>LengthSplitter {
<span class="doccomment">/// Creates a new splitter based on lengths.
///
/// The `min` is a hard lower bound. We&#39;ll never split below that, but
/// of course an iterator might start out smaller already.
///
/// The `max` is an upper bound on the working size, used to determine
/// the minimum number of times we need to split to get under that limit.
/// The adaptive algorithm may very well split even further, but never
/// smaller than the `min`.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>new(min: usize, max: usize, len: usize) -&gt; LengthSplitter {
<span class="kw">let </span><span class="kw-2">mut </span>splitter = LengthSplitter {
inner: Splitter::new(),
min: cmp::max(min, <span class="number">1</span>),
};
<span class="comment">// Divide the given length by the max working length to get the minimum
// number of splits we need to get under that max. This rounds down,
// but the splitter actually gives `next_power_of_two()` pieces anyway.
// e.g. len 12345 / max 100 = 123 min_splits -&gt; 128 pieces.
</span><span class="kw">let </span>min_splits = len / cmp::max(max, <span class="number">1</span>);
<span class="comment">// Only update the value if it&#39;s not splitting enough already.
</span><span class="kw">if </span>min_splits &gt; splitter.inner.splits {
splitter.inner.splits = min_splits;
}
splitter
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_split(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize, stolen: bool) -&gt; bool {
<span class="comment">// If splitting wouldn&#39;t make us too small, try the inner splitter.
</span>len / <span class="number">2 </span>&gt;= <span class="self">self</span>.min &amp;&amp; <span class="self">self</span>.inner.try_split(stolen)
}
}
<span class="doccomment">/// This helper function is used to &quot;connect&quot; a parallel iterator to a
/// consumer. It will convert the `par_iter` into a producer P and
/// then pull items from P and feed them to `consumer`, splitting and
/// creating parallel threads as needed.
///
/// This is useful when you are implementing your own parallel
/// iterators: it is often used as the definition of the
/// [`drive_unindexed`] or [`drive`] methods.
///
/// [`drive_unindexed`]: ../trait.ParallelIterator.html#tymethod.drive_unindexed
/// [`drive`]: ../trait.IndexedParallelIterator.html#tymethod.drive
</span><span class="kw">pub fn </span>bridge&lt;I, C&gt;(par_iter: I, consumer: C) -&gt; C::Result
<span class="kw">where
</span>I: IndexedParallelIterator,
C: Consumer&lt;I::Item&gt;,
{
<span class="kw">let </span>len = par_iter.len();
<span class="kw">return </span>par_iter.with_producer(Callback { len, consumer });
<span class="kw">struct </span>Callback&lt;C&gt; {
len: usize,
consumer: C,
}
<span class="kw">impl</span>&lt;C, I&gt; ProducerCallback&lt;I&gt; <span class="kw">for </span>Callback&lt;C&gt;
<span class="kw">where
</span>C: Consumer&lt;I&gt;,
{
<span class="kw">type </span>Output = C::Result;
<span class="kw">fn </span>callback&lt;P&gt;(<span class="self">self</span>, producer: P) -&gt; C::Result
<span class="kw">where
</span>P: Producer&lt;Item = I&gt;,
{
bridge_producer_consumer(<span class="self">self</span>.len, producer, <span class="self">self</span>.consumer)
}
}
}
<span class="doccomment">/// This helper function is used to &quot;connect&quot; a producer and a
/// consumer. You may prefer to call [`bridge`], which wraps this
/// function. This function will draw items from `producer` and feed
/// them to `consumer`, splitting and creating parallel tasks when
/// needed.
///
/// This is useful when you are implementing your own parallel
/// iterators: it is often used as the definition of the
/// [`drive_unindexed`] or [`drive`] methods.
///
/// [`bridge`]: fn.bridge.html
/// [`drive_unindexed`]: ../trait.ParallelIterator.html#tymethod.drive_unindexed
/// [`drive`]: ../trait.IndexedParallelIterator.html#tymethod.drive
</span><span class="kw">pub fn </span>bridge_producer_consumer&lt;P, C&gt;(len: usize, producer: P, consumer: C) -&gt; C::Result
<span class="kw">where
</span>P: Producer,
C: Consumer&lt;P::Item&gt;,
{
<span class="kw">let </span>splitter = LengthSplitter::new(producer.min_len(), producer.max_len(), len);
<span class="kw">return </span>helper(len, <span class="bool-val">false</span>, splitter, producer, consumer);
<span class="kw">fn </span>helper&lt;P, C&gt;(
len: usize,
migrated: bool,
<span class="kw-2">mut </span>splitter: LengthSplitter,
producer: P,
consumer: C,
) -&gt; C::Result
<span class="kw">where
</span>P: Producer,
C: Consumer&lt;P::Item&gt;,
{
<span class="kw">if </span>consumer.full() {
consumer.into_folder().complete()
} <span class="kw">else if </span>splitter.try_split(len, migrated) {
<span class="kw">let </span>mid = len / <span class="number">2</span>;
<span class="kw">let </span>(left_producer, right_producer) = producer.split_at(mid);
<span class="kw">let </span>(left_consumer, right_consumer, reducer) = consumer.split_at(mid);
<span class="kw">let </span>(left_result, right_result) = join_context(
|context| {
helper(
mid,
context.migrated(),
splitter,
left_producer,
left_consumer,
)
},
|context| {
helper(
len - mid,
context.migrated(),
splitter,
right_producer,
right_consumer,
)
},
);
reducer.reduce(left_result, right_result)
} <span class="kw">else </span>{
producer.fold_with(consumer.into_folder()).complete()
}
}
}
<span class="doccomment">/// A variant of [`bridge_producer_consumer`] where the producer is an unindexed producer.
///
/// [`bridge_producer_consumer`]: fn.bridge_producer_consumer.html
</span><span class="kw">pub fn </span>bridge_unindexed&lt;P, C&gt;(producer: P, consumer: C) -&gt; C::Result
<span class="kw">where
</span>P: UnindexedProducer,
C: UnindexedConsumer&lt;P::Item&gt;,
{
<span class="kw">let </span>splitter = Splitter::new();
bridge_unindexed_producer_consumer(<span class="bool-val">false</span>, splitter, producer, consumer)
}
<span class="kw">fn </span>bridge_unindexed_producer_consumer&lt;P, C&gt;(
migrated: bool,
<span class="kw-2">mut </span>splitter: Splitter,
producer: P,
consumer: C,
) -&gt; C::Result
<span class="kw">where
</span>P: UnindexedProducer,
C: UnindexedConsumer&lt;P::Item&gt;,
{
<span class="kw">if </span>consumer.full() {
consumer.into_folder().complete()
} <span class="kw">else if </span>splitter.try_split(migrated) {
<span class="kw">match </span>producer.split() {
(left_producer, <span class="prelude-val">Some</span>(right_producer)) =&gt; {
<span class="kw">let </span>(reducer, left_consumer, right_consumer) =
(consumer.to_reducer(), consumer.split_off_left(), consumer);
<span class="kw">let </span>bridge = bridge_unindexed_producer_consumer;
<span class="kw">let </span>(left_result, right_result) = join_context(
|context| bridge(context.migrated(), splitter, left_producer, left_consumer),
|context| bridge(context.migrated(), splitter, right_producer, right_consumer),
);
reducer.reduce(left_result, right_result)
}
(producer, <span class="prelude-val">None</span>) =&gt; producer.fold_with(consumer.into_folder()).complete(),
}
} <span class="kw">else </span>{
producer.fold_with(consumer.into_folder()).complete()
}
}
</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>