| <!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/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> |
| <span id="1042">1042</span> |
| <span id="1043">1043</span> |
| <span id="1044">1044</span> |
| <span id="1045">1045</span> |
| <span id="1046">1046</span> |
| <span id="1047">1047</span> |
| <span id="1048">1048</span> |
| <span id="1049">1049</span> |
| <span id="1050">1050</span> |
| <span id="1051">1051</span> |
| <span id="1052">1052</span> |
| <span id="1053">1053</span> |
| <span id="1054">1054</span> |
| <span id="1055">1055</span> |
| <span id="1056">1056</span> |
| <span id="1057">1057</span> |
| <span id="1058">1058</span> |
| <span id="1059">1059</span> |
| <span id="1060">1060</span> |
| <span id="1061">1061</span> |
| <span id="1062">1062</span> |
| <span id="1063">1063</span> |
| <span id="1064">1064</span> |
| <span id="1065">1065</span> |
| <span id="1066">1066</span> |
| <span id="1067">1067</span> |
| <span id="1068">1068</span> |
| <span id="1069">1069</span> |
| <span id="1070">1070</span> |
| <span id="1071">1071</span> |
| <span id="1072">1072</span> |
| <span id="1073">1073</span> |
| <span id="1074">1074</span> |
| <span id="1075">1075</span> |
| <span id="1076">1076</span> |
| <span id="1077">1077</span> |
| <span id="1078">1078</span> |
| <span id="1079">1079</span> |
| <span id="1080">1080</span> |
| <span id="1081">1081</span> |
| <span id="1082">1082</span> |
| <span id="1083">1083</span> |
| <span id="1084">1084</span> |
| <span id="1085">1085</span> |
| <span id="1086">1086</span> |
| <span id="1087">1087</span> |
| <span id="1088">1088</span> |
| <span id="1089">1089</span> |
| <span id="1090">1090</span> |
| <span id="1091">1091</span> |
| <span id="1092">1092</span> |
| <span id="1093">1093</span> |
| <span id="1094">1094</span> |
| <span id="1095">1095</span> |
| <span id="1096">1096</span> |
| <span id="1097">1097</span> |
| <span id="1098">1098</span> |
| <span id="1099">1099</span> |
| <span id="1100">1100</span> |
| <span id="1101">1101</span> |
| <span id="1102">1102</span> |
| <span id="1103">1103</span> |
| <span id="1104">1104</span> |
| <span id="1105">1105</span> |
| <span id="1106">1106</span> |
| <span id="1107">1107</span> |
| <span id="1108">1108</span> |
| <span id="1109">1109</span> |
| <span id="1110">1110</span> |
| <span id="1111">1111</span> |
| <span id="1112">1112</span> |
| <span id="1113">1113</span> |
| <span id="1114">1114</span> |
| <span id="1115">1115</span> |
| <span id="1116">1116</span> |
| <span id="1117">1117</span> |
| <span id="1118">1118</span> |
| <span id="1119">1119</span> |
| <span id="1120">1120</span> |
| <span id="1121">1121</span> |
| <span id="1122">1122</span> |
| <span id="1123">1123</span> |
| <span id="1124">1124</span> |
| <span id="1125">1125</span> |
| <span id="1126">1126</span> |
| <span id="1127">1127</span> |
| <span id="1128">1128</span> |
| <span id="1129">1129</span> |
| <span id="1130">1130</span> |
| <span id="1131">1131</span> |
| <span id="1132">1132</span> |
| <span id="1133">1133</span> |
| <span id="1134">1134</span> |
| <span id="1135">1135</span> |
| <span id="1136">1136</span> |
| <span id="1137">1137</span> |
| <span id="1138">1138</span> |
| <span id="1139">1139</span> |
| <span id="1140">1140</span> |
| <span id="1141">1141</span> |
| <span id="1142">1142</span> |
| <span id="1143">1143</span> |
| <span id="1144">1144</span> |
| <span id="1145">1145</span> |
| <span id="1146">1146</span> |
| <span id="1147">1147</span> |
| <span id="1148">1148</span> |
| <span id="1149">1149</span> |
| <span id="1150">1150</span> |
| <span id="1151">1151</span> |
| <span id="1152">1152</span> |
| <span id="1153">1153</span> |
| <span id="1154">1154</span> |
| <span id="1155">1155</span> |
| <span id="1156">1156</span> |
| <span id="1157">1157</span> |
| <span id="1158">1158</span> |
| <span id="1159">1159</span> |
| <span id="1160">1160</span> |
| <span id="1161">1161</span> |
| <span id="1162">1162</span> |
| <span id="1163">1163</span> |
| <span id="1164">1164</span> |
| <span id="1165">1165</span> |
| <span id="1166">1166</span> |
| <span id="1167">1167</span> |
| <span id="1168">1168</span> |
| <span id="1169">1169</span> |
| <span id="1170">1170</span> |
| <span id="1171">1171</span> |
| <span id="1172">1172</span> |
| <span id="1173">1173</span> |
| <span id="1174">1174</span> |
| <span id="1175">1175</span> |
| <span id="1176">1176</span> |
| <span id="1177">1177</span> |
| <span id="1178">1178</span> |
| <span id="1179">1179</span> |
| <span id="1180">1180</span> |
| <span id="1181">1181</span> |
| <span id="1182">1182</span> |
| <span id="1183">1183</span> |
| <span id="1184">1184</span> |
| <span id="1185">1185</span> |
| <span id="1186">1186</span> |
| <span id="1187">1187</span> |
| <span id="1188">1188</span> |
| <span id="1189">1189</span> |
| <span id="1190">1190</span> |
| <span id="1191">1191</span> |
| <span id="1192">1192</span> |
| <span id="1193">1193</span> |
| <span id="1194">1194</span> |
| <span id="1195">1195</span> |
| <span id="1196">1196</span> |
| <span id="1197">1197</span> |
| <span id="1198">1198</span> |
| <span id="1199">1199</span> |
| <span id="1200">1200</span> |
| <span id="1201">1201</span> |
| <span id="1202">1202</span> |
| <span id="1203">1203</span> |
| <span id="1204">1204</span> |
| <span id="1205">1205</span> |
| <span id="1206">1206</span> |
| <span id="1207">1207</span> |
| <span id="1208">1208</span> |
| <span id="1209">1209</span> |
| <span id="1210">1210</span> |
| <span id="1211">1211</span> |
| <span id="1212">1212</span> |
| <span id="1213">1213</span> |
| <span id="1214">1214</span> |
| <span id="1215">1215</span> |
| <span id="1216">1216</span> |
| <span id="1217">1217</span> |
| <span id="1218">1218</span> |
| <span id="1219">1219</span> |
| <span id="1220">1220</span> |
| <span id="1221">1221</span> |
| <span id="1222">1222</span> |
| <span id="1223">1223</span> |
| <span id="1224">1224</span> |
| <span id="1225">1225</span> |
| <span id="1226">1226</span> |
| <span id="1227">1227</span> |
| <span id="1228">1228</span> |
| <span id="1229">1229</span> |
| <span id="1230">1230</span> |
| <span id="1231">1231</span> |
| <span id="1232">1232</span> |
| <span id="1233">1233</span> |
| <span id="1234">1234</span> |
| <span id="1235">1235</span> |
| <span id="1236">1236</span> |
| <span id="1237">1237</span> |
| <span id="1238">1238</span> |
| <span id="1239">1239</span> |
| <span id="1240">1240</span> |
| <span id="1241">1241</span> |
| <span id="1242">1242</span> |
| <span id="1243">1243</span> |
| <span id="1244">1244</span> |
| <span id="1245">1245</span> |
| <span id="1246">1246</span> |
| <span id="1247">1247</span> |
| <span id="1248">1248</span> |
| <span id="1249">1249</span> |
| <span id="1250">1250</span> |
| <span id="1251">1251</span> |
| <span id="1252">1252</span> |
| <span id="1253">1253</span> |
| <span id="1254">1254</span> |
| <span id="1255">1255</span> |
| <span id="1256">1256</span> |
| <span id="1257">1257</span> |
| <span id="1258">1258</span> |
| <span id="1259">1259</span> |
| <span id="1260">1260</span> |
| <span id="1261">1261</span> |
| <span id="1262">1262</span> |
| <span id="1263">1263</span> |
| <span id="1264">1264</span> |
| <span id="1265">1265</span> |
| <span id="1266">1266</span> |
| <span id="1267">1267</span> |
| <span id="1268">1268</span> |
| <span id="1269">1269</span> |
| <span id="1270">1270</span> |
| <span id="1271">1271</span> |
| <span id="1272">1272</span> |
| <span id="1273">1273</span> |
| <span id="1274">1274</span> |
| <span id="1275">1275</span> |
| <span id="1276">1276</span> |
| <span id="1277">1277</span> |
| <span id="1278">1278</span> |
| <span id="1279">1279</span> |
| <span id="1280">1280</span> |
| <span id="1281">1281</span> |
| <span id="1282">1282</span> |
| <span id="1283">1283</span> |
| <span id="1284">1284</span> |
| <span id="1285">1285</span> |
| <span id="1286">1286</span> |
| <span id="1287">1287</span> |
| <span id="1288">1288</span> |
| <span id="1289">1289</span> |
| <span id="1290">1290</span> |
| <span id="1291">1291</span> |
| <span id="1292">1292</span> |
| <span id="1293">1293</span> |
| <span id="1294">1294</span> |
| <span id="1295">1295</span> |
| <span id="1296">1296</span> |
| <span id="1297">1297</span> |
| <span id="1298">1298</span> |
| <span id="1299">1299</span> |
| <span id="1300">1300</span> |
| <span id="1301">1301</span> |
| <span id="1302">1302</span> |
| <span id="1303">1303</span> |
| <span id="1304">1304</span> |
| <span id="1305">1305</span> |
| <span id="1306">1306</span> |
| <span id="1307">1307</span> |
| <span id="1308">1308</span> |
| <span id="1309">1309</span> |
| <span id="1310">1310</span> |
| <span id="1311">1311</span> |
| <span id="1312">1312</span> |
| <span id="1313">1313</span> |
| <span id="1314">1314</span> |
| <span id="1315">1315</span> |
| <span id="1316">1316</span> |
| <span id="1317">1317</span> |
| <span id="1318">1318</span> |
| <span id="1319">1319</span> |
| <span id="1320">1320</span> |
| <span id="1321">1321</span> |
| <span id="1322">1322</span> |
| <span id="1323">1323</span> |
| <span id="1324">1324</span> |
| <span id="1325">1325</span> |
| <span id="1326">1326</span> |
| <span id="1327">1327</span> |
| <span id="1328">1328</span> |
| <span id="1329">1329</span> |
| <span id="1330">1330</span> |
| <span id="1331">1331</span> |
| <span id="1332">1332</span> |
| <span id="1333">1333</span> |
| <span id="1334">1334</span> |
| <span id="1335">1335</span> |
| <span id="1336">1336</span> |
| <span id="1337">1337</span> |
| <span id="1338">1338</span> |
| <span id="1339">1339</span> |
| <span id="1340">1340</span> |
| <span id="1341">1341</span> |
| <span id="1342">1342</span> |
| <span id="1343">1343</span> |
| <span id="1344">1344</span> |
| <span id="1345">1345</span> |
| <span id="1346">1346</span> |
| <span id="1347">1347</span> |
| <span id="1348">1348</span> |
| <span id="1349">1349</span> |
| <span id="1350">1350</span> |
| <span id="1351">1351</span> |
| <span id="1352">1352</span> |
| <span id="1353">1353</span> |
| <span id="1354">1354</span> |
| <span id="1355">1355</span> |
| <span id="1356">1356</span> |
| <span id="1357">1357</span> |
| <span id="1358">1358</span> |
| <span id="1359">1359</span> |
| <span id="1360">1360</span> |
| <span id="1361">1361</span> |
| <span id="1362">1362</span> |
| <span id="1363">1363</span> |
| <span id="1364">1364</span> |
| <span id="1365">1365</span> |
| <span id="1366">1366</span> |
| <span id="1367">1367</span> |
| <span id="1368">1368</span> |
| <span id="1369">1369</span> |
| <span id="1370">1370</span> |
| <span id="1371">1371</span> |
| <span id="1372">1372</span> |
| <span id="1373">1373</span> |
| <span id="1374">1374</span> |
| <span id="1375">1375</span> |
| <span id="1376">1376</span> |
| <span id="1377">1377</span> |
| <span id="1378">1378</span> |
| <span id="1379">1379</span> |
| <span id="1380">1380</span> |
| <span id="1381">1381</span> |
| <span id="1382">1382</span> |
| <span id="1383">1383</span> |
| <span id="1384">1384</span> |
| <span id="1385">1385</span> |
| <span id="1386">1386</span> |
| <span id="1387">1387</span> |
| <span id="1388">1388</span> |
| <span id="1389">1389</span> |
| <span id="1390">1390</span> |
| <span id="1391">1391</span> |
| <span id="1392">1392</span> |
| <span id="1393">1393</span> |
| <span id="1394">1394</span> |
| <span id="1395">1395</span> |
| <span id="1396">1396</span> |
| <span id="1397">1397</span> |
| <span id="1398">1398</span> |
| <span id="1399">1399</span> |
| <span id="1400">1400</span> |
| <span id="1401">1401</span> |
| <span id="1402">1402</span> |
| <span id="1403">1403</span> |
| <span id="1404">1404</span> |
| <span id="1405">1405</span> |
| <span id="1406">1406</span> |
| <span id="1407">1407</span> |
| <span id="1408">1408</span> |
| <span id="1409">1409</span> |
| <span id="1410">1410</span> |
| <span id="1411">1411</span> |
| <span id="1412">1412</span> |
| <span id="1413">1413</span> |
| <span id="1414">1414</span> |
| <span id="1415">1415</span> |
| <span id="1416">1416</span> |
| <span id="1417">1417</span> |
| <span id="1418">1418</span> |
| <span id="1419">1419</span> |
| <span id="1420">1420</span> |
| <span id="1421">1421</span> |
| <span id="1422">1422</span> |
| <span id="1423">1423</span> |
| <span id="1424">1424</span> |
| <span id="1425">1425</span> |
| <span id="1426">1426</span> |
| <span id="1427">1427</span> |
| <span id="1428">1428</span> |
| <span id="1429">1429</span> |
| <span id="1430">1430</span> |
| <span id="1431">1431</span> |
| <span id="1432">1432</span> |
| <span id="1433">1433</span> |
| <span id="1434">1434</span> |
| <span id="1435">1435</span> |
| <span id="1436">1436</span> |
| <span id="1437">1437</span> |
| <span id="1438">1438</span> |
| <span id="1439">1439</span> |
| <span id="1440">1440</span> |
| <span id="1441">1441</span> |
| <span id="1442">1442</span> |
| <span id="1443">1443</span> |
| <span id="1444">1444</span> |
| <span id="1445">1445</span> |
| <span id="1446">1446</span> |
| <span id="1447">1447</span> |
| <span id="1448">1448</span> |
| <span id="1449">1449</span> |
| <span id="1450">1450</span> |
| <span id="1451">1451</span> |
| <span id="1452">1452</span> |
| <span id="1453">1453</span> |
| <span id="1454">1454</span> |
| <span id="1455">1455</span> |
| <span id="1456">1456</span> |
| <span id="1457">1457</span> |
| <span id="1458">1458</span> |
| <span id="1459">1459</span> |
| <span id="1460">1460</span> |
| <span id="1461">1461</span> |
| <span id="1462">1462</span> |
| <span id="1463">1463</span> |
| <span id="1464">1464</span> |
| <span id="1465">1465</span> |
| <span id="1466">1466</span> |
| <span id="1467">1467</span> |
| <span id="1468">1468</span> |
| <span id="1469">1469</span> |
| <span id="1470">1470</span> |
| <span id="1471">1471</span> |
| <span id="1472">1472</span> |
| <span id="1473">1473</span> |
| <span id="1474">1474</span> |
| <span id="1475">1475</span> |
| <span id="1476">1476</span> |
| <span id="1477">1477</span> |
| <span id="1478">1478</span> |
| <span id="1479">1479</span> |
| <span id="1480">1480</span> |
| <span id="1481">1481</span> |
| <span id="1482">1482</span> |
| <span id="1483">1483</span> |
| <span id="1484">1484</span> |
| <span id="1485">1485</span> |
| <span id="1486">1486</span> |
| <span id="1487">1487</span> |
| <span id="1488">1488</span> |
| <span id="1489">1489</span> |
| <span id="1490">1490</span> |
| <span id="1491">1491</span> |
| <span id="1492">1492</span> |
| <span id="1493">1493</span> |
| <span id="1494">1494</span> |
| <span id="1495">1495</span> |
| <span id="1496">1496</span> |
| <span id="1497">1497</span> |
| <span id="1498">1498</span> |
| <span id="1499">1499</span> |
| <span id="1500">1500</span> |
| <span id="1501">1501</span> |
| <span id="1502">1502</span> |
| <span id="1503">1503</span> |
| <span id="1504">1504</span> |
| <span id="1505">1505</span> |
| <span id="1506">1506</span> |
| <span id="1507">1507</span> |
| <span id="1508">1508</span> |
| <span id="1509">1509</span> |
| <span id="1510">1510</span> |
| <span id="1511">1511</span> |
| <span id="1512">1512</span> |
| <span id="1513">1513</span> |
| <span id="1514">1514</span> |
| <span id="1515">1515</span> |
| <span id="1516">1516</span> |
| <span id="1517">1517</span> |
| <span id="1518">1518</span> |
| <span id="1519">1519</span> |
| <span id="1520">1520</span> |
| <span id="1521">1521</span> |
| <span id="1522">1522</span> |
| <span id="1523">1523</span> |
| <span id="1524">1524</span> |
| <span id="1525">1525</span> |
| <span id="1526">1526</span> |
| <span id="1527">1527</span> |
| <span id="1528">1528</span> |
| <span id="1529">1529</span> |
| <span id="1530">1530</span> |
| <span id="1531">1531</span> |
| <span id="1532">1532</span> |
| <span id="1533">1533</span> |
| <span id="1534">1534</span> |
| <span id="1535">1535</span> |
| <span id="1536">1536</span> |
| <span id="1537">1537</span> |
| <span id="1538">1538</span> |
| <span id="1539">1539</span> |
| <span id="1540">1540</span> |
| <span id="1541">1541</span> |
| <span id="1542">1542</span> |
| <span id="1543">1543</span> |
| <span id="1544">1544</span> |
| <span id="1545">1545</span> |
| <span id="1546">1546</span> |
| <span id="1547">1547</span> |
| <span id="1548">1548</span> |
| <span id="1549">1549</span> |
| <span id="1550">1550</span> |
| <span id="1551">1551</span> |
| <span id="1552">1552</span> |
| <span id="1553">1553</span> |
| <span id="1554">1554</span> |
| <span id="1555">1555</span> |
| <span id="1556">1556</span> |
| <span id="1557">1557</span> |
| <span id="1558">1558</span> |
| <span id="1559">1559</span> |
| <span id="1560">1560</span> |
| <span id="1561">1561</span> |
| <span id="1562">1562</span> |
| <span id="1563">1563</span> |
| <span id="1564">1564</span> |
| <span id="1565">1565</span> |
| <span id="1566">1566</span> |
| <span id="1567">1567</span> |
| <span id="1568">1568</span> |
| <span id="1569">1569</span> |
| <span id="1570">1570</span> |
| <span id="1571">1571</span> |
| <span id="1572">1572</span> |
| <span id="1573">1573</span> |
| <span id="1574">1574</span> |
| <span id="1575">1575</span> |
| <span id="1576">1576</span> |
| <span id="1577">1577</span> |
| <span id="1578">1578</span> |
| <span id="1579">1579</span> |
| <span id="1580">1580</span> |
| <span id="1581">1581</span> |
| <span id="1582">1582</span> |
| <span id="1583">1583</span> |
| <span id="1584">1584</span> |
| <span id="1585">1585</span> |
| <span id="1586">1586</span> |
| <span id="1587">1587</span> |
| <span id="1588">1588</span> |
| <span id="1589">1589</span> |
| <span id="1590">1590</span> |
| <span id="1591">1591</span> |
| <span id="1592">1592</span> |
| <span id="1593">1593</span> |
| <span id="1594">1594</span> |
| <span id="1595">1595</span> |
| <span id="1596">1596</span> |
| <span id="1597">1597</span> |
| <span id="1598">1598</span> |
| <span id="1599">1599</span> |
| <span id="1600">1600</span> |
| <span id="1601">1601</span> |
| <span id="1602">1602</span> |
| <span id="1603">1603</span> |
| <span id="1604">1604</span> |
| <span id="1605">1605</span> |
| <span id="1606">1606</span> |
| <span id="1607">1607</span> |
| <span id="1608">1608</span> |
| <span id="1609">1609</span> |
| <span id="1610">1610</span> |
| <span id="1611">1611</span> |
| <span id="1612">1612</span> |
| <span id="1613">1613</span> |
| <span id="1614">1614</span> |
| <span id="1615">1615</span> |
| <span id="1616">1616</span> |
| <span id="1617">1617</span> |
| <span id="1618">1618</span> |
| <span id="1619">1619</span> |
| <span id="1620">1620</span> |
| <span id="1621">1621</span> |
| <span id="1622">1622</span> |
| <span id="1623">1623</span> |
| <span id="1624">1624</span> |
| <span id="1625">1625</span> |
| <span id="1626">1626</span> |
| <span id="1627">1627</span> |
| <span id="1628">1628</span> |
| <span id="1629">1629</span> |
| <span id="1630">1630</span> |
| <span id="1631">1631</span> |
| <span id="1632">1632</span> |
| <span id="1633">1633</span> |
| <span id="1634">1634</span> |
| <span id="1635">1635</span> |
| <span id="1636">1636</span> |
| <span id="1637">1637</span> |
| <span id="1638">1638</span> |
| <span id="1639">1639</span> |
| <span id="1640">1640</span> |
| <span id="1641">1641</span> |
| <span id="1642">1642</span> |
| <span id="1643">1643</span> |
| <span id="1644">1644</span> |
| <span id="1645">1645</span> |
| <span id="1646">1646</span> |
| <span id="1647">1647</span> |
| <span id="1648">1648</span> |
| <span id="1649">1649</span> |
| <span id="1650">1650</span> |
| <span id="1651">1651</span> |
| <span id="1652">1652</span> |
| <span id="1653">1653</span> |
| <span id="1654">1654</span> |
| <span id="1655">1655</span> |
| <span id="1656">1656</span> |
| <span id="1657">1657</span> |
| <span id="1658">1658</span> |
| <span id="1659">1659</span> |
| <span id="1660">1660</span> |
| <span id="1661">1661</span> |
| <span id="1662">1662</span> |
| <span id="1663">1663</span> |
| <span id="1664">1664</span> |
| <span id="1665">1665</span> |
| <span id="1666">1666</span> |
| <span id="1667">1667</span> |
| <span id="1668">1668</span> |
| <span id="1669">1669</span> |
| <span id="1670">1670</span> |
| <span id="1671">1671</span> |
| <span id="1672">1672</span> |
| <span id="1673">1673</span> |
| <span id="1674">1674</span> |
| <span id="1675">1675</span> |
| <span id="1676">1676</span> |
| <span id="1677">1677</span> |
| <span id="1678">1678</span> |
| <span id="1679">1679</span> |
| <span id="1680">1680</span> |
| <span id="1681">1681</span> |
| <span id="1682">1682</span> |
| <span id="1683">1683</span> |
| <span id="1684">1684</span> |
| <span id="1685">1685</span> |
| <span id="1686">1686</span> |
| <span id="1687">1687</span> |
| <span id="1688">1688</span> |
| <span id="1689">1689</span> |
| <span id="1690">1690</span> |
| <span id="1691">1691</span> |
| <span id="1692">1692</span> |
| <span id="1693">1693</span> |
| <span id="1694">1694</span> |
| <span id="1695">1695</span> |
| <span id="1696">1696</span> |
| <span id="1697">1697</span> |
| <span id="1698">1698</span> |
| <span id="1699">1699</span> |
| <span id="1700">1700</span> |
| <span id="1701">1701</span> |
| <span id="1702">1702</span> |
| <span id="1703">1703</span> |
| <span id="1704">1704</span> |
| <span id="1705">1705</span> |
| <span id="1706">1706</span> |
| <span id="1707">1707</span> |
| <span id="1708">1708</span> |
| <span id="1709">1709</span> |
| <span id="1710">1710</span> |
| <span id="1711">1711</span> |
| <span id="1712">1712</span> |
| <span id="1713">1713</span> |
| <span id="1714">1714</span> |
| <span id="1715">1715</span> |
| <span id="1716">1716</span> |
| <span id="1717">1717</span> |
| <span id="1718">1718</span> |
| <span id="1719">1719</span> |
| <span id="1720">1720</span> |
| <span id="1721">1721</span> |
| <span id="1722">1722</span> |
| <span id="1723">1723</span> |
| <span id="1724">1724</span> |
| <span id="1725">1725</span> |
| <span id="1726">1726</span> |
| <span id="1727">1727</span> |
| <span id="1728">1728</span> |
| <span id="1729">1729</span> |
| <span id="1730">1730</span> |
| <span id="1731">1731</span> |
| <span id="1732">1732</span> |
| <span id="1733">1733</span> |
| <span id="1734">1734</span> |
| <span id="1735">1735</span> |
| <span id="1736">1736</span> |
| <span id="1737">1737</span> |
| <span id="1738">1738</span> |
| <span id="1739">1739</span> |
| <span id="1740">1740</span> |
| <span id="1741">1741</span> |
| <span id="1742">1742</span> |
| <span id="1743">1743</span> |
| <span id="1744">1744</span> |
| <span id="1745">1745</span> |
| <span id="1746">1746</span> |
| <span id="1747">1747</span> |
| <span id="1748">1748</span> |
| <span id="1749">1749</span> |
| <span id="1750">1750</span> |
| <span id="1751">1751</span> |
| <span id="1752">1752</span> |
| <span id="1753">1753</span> |
| <span id="1754">1754</span> |
| <span id="1755">1755</span> |
| <span id="1756">1756</span> |
| <span id="1757">1757</span> |
| <span id="1758">1758</span> |
| <span id="1759">1759</span> |
| <span id="1760">1760</span> |
| <span id="1761">1761</span> |
| <span id="1762">1762</span> |
| <span id="1763">1763</span> |
| <span id="1764">1764</span> |
| <span id="1765">1765</span> |
| <span id="1766">1766</span> |
| <span id="1767">1767</span> |
| <span id="1768">1768</span> |
| <span id="1769">1769</span> |
| <span id="1770">1770</span> |
| <span id="1771">1771</span> |
| <span id="1772">1772</span> |
| <span id="1773">1773</span> |
| <span id="1774">1774</span> |
| <span id="1775">1775</span> |
| <span id="1776">1776</span> |
| <span id="1777">1777</span> |
| <span id="1778">1778</span> |
| <span id="1779">1779</span> |
| <span id="1780">1780</span> |
| <span id="1781">1781</span> |
| <span id="1782">1782</span> |
| <span id="1783">1783</span> |
| <span id="1784">1784</span> |
| <span id="1785">1785</span> |
| <span id="1786">1786</span> |
| <span id="1787">1787</span> |
| <span id="1788">1788</span> |
| <span id="1789">1789</span> |
| <span id="1790">1790</span> |
| <span id="1791">1791</span> |
| <span id="1792">1792</span> |
| <span id="1793">1793</span> |
| <span id="1794">1794</span> |
| <span id="1795">1795</span> |
| <span id="1796">1796</span> |
| <span id="1797">1797</span> |
| <span id="1798">1798</span> |
| <span id="1799">1799</span> |
| <span id="1800">1800</span> |
| <span id="1801">1801</span> |
| <span id="1802">1802</span> |
| <span id="1803">1803</span> |
| <span id="1804">1804</span> |
| <span id="1805">1805</span> |
| <span id="1806">1806</span> |
| <span id="1807">1807</span> |
| <span id="1808">1808</span> |
| <span id="1809">1809</span> |
| <span id="1810">1810</span> |
| <span id="1811">1811</span> |
| <span id="1812">1812</span> |
| <span id="1813">1813</span> |
| <span id="1814">1814</span> |
| <span id="1815">1815</span> |
| <span id="1816">1816</span> |
| <span id="1817">1817</span> |
| <span id="1818">1818</span> |
| <span id="1819">1819</span> |
| <span id="1820">1820</span> |
| <span id="1821">1821</span> |
| <span id="1822">1822</span> |
| <span id="1823">1823</span> |
| <span id="1824">1824</span> |
| <span id="1825">1825</span> |
| <span id="1826">1826</span> |
| <span id="1827">1827</span> |
| <span id="1828">1828</span> |
| <span id="1829">1829</span> |
| <span id="1830">1830</span> |
| <span id="1831">1831</span> |
| <span id="1832">1832</span> |
| <span id="1833">1833</span> |
| <span id="1834">1834</span> |
| <span id="1835">1835</span> |
| <span id="1836">1836</span> |
| <span id="1837">1837</span> |
| <span id="1838">1838</span> |
| <span id="1839">1839</span> |
| <span id="1840">1840</span> |
| <span id="1841">1841</span> |
| <span id="1842">1842</span> |
| <span id="1843">1843</span> |
| <span id="1844">1844</span> |
| <span id="1845">1845</span> |
| <span id="1846">1846</span> |
| <span id="1847">1847</span> |
| <span id="1848">1848</span> |
| <span id="1849">1849</span> |
| <span id="1850">1850</span> |
| <span id="1851">1851</span> |
| <span id="1852">1852</span> |
| <span id="1853">1853</span> |
| <span id="1854">1854</span> |
| <span id="1855">1855</span> |
| <span id="1856">1856</span> |
| <span id="1857">1857</span> |
| <span id="1858">1858</span> |
| <span id="1859">1859</span> |
| <span id="1860">1860</span> |
| <span id="1861">1861</span> |
| <span id="1862">1862</span> |
| <span id="1863">1863</span> |
| <span id="1864">1864</span> |
| <span id="1865">1865</span> |
| <span id="1866">1866</span> |
| <span id="1867">1867</span> |
| <span id="1868">1868</span> |
| <span id="1869">1869</span> |
| <span id="1870">1870</span> |
| <span id="1871">1871</span> |
| <span id="1872">1872</span> |
| <span id="1873">1873</span> |
| <span id="1874">1874</span> |
| <span id="1875">1875</span> |
| <span id="1876">1876</span> |
| <span id="1877">1877</span> |
| <span id="1878">1878</span> |
| <span id="1879">1879</span> |
| <span id="1880">1880</span> |
| <span id="1881">1881</span> |
| <span id="1882">1882</span> |
| <span id="1883">1883</span> |
| <span id="1884">1884</span> |
| <span id="1885">1885</span> |
| <span id="1886">1886</span> |
| <span id="1887">1887</span> |
| <span id="1888">1888</span> |
| <span id="1889">1889</span> |
| <span id="1890">1890</span> |
| <span id="1891">1891</span> |
| <span id="1892">1892</span> |
| <span id="1893">1893</span> |
| <span id="1894">1894</span> |
| <span id="1895">1895</span> |
| <span id="1896">1896</span> |
| <span id="1897">1897</span> |
| <span id="1898">1898</span> |
| <span id="1899">1899</span> |
| <span id="1900">1900</span> |
| <span id="1901">1901</span> |
| <span id="1902">1902</span> |
| <span id="1903">1903</span> |
| <span id="1904">1904</span> |
| <span id="1905">1905</span> |
| <span id="1906">1906</span> |
| <span id="1907">1907</span> |
| <span id="1908">1908</span> |
| <span id="1909">1909</span> |
| <span id="1910">1910</span> |
| <span id="1911">1911</span> |
| <span id="1912">1912</span> |
| <span id="1913">1913</span> |
| <span id="1914">1914</span> |
| <span id="1915">1915</span> |
| <span id="1916">1916</span> |
| <span id="1917">1917</span> |
| <span id="1918">1918</span> |
| <span id="1919">1919</span> |
| <span id="1920">1920</span> |
| <span id="1921">1921</span> |
| <span id="1922">1922</span> |
| <span id="1923">1923</span> |
| <span id="1924">1924</span> |
| <span id="1925">1925</span> |
| <span id="1926">1926</span> |
| <span id="1927">1927</span> |
| <span id="1928">1928</span> |
| <span id="1929">1929</span> |
| <span id="1930">1930</span> |
| <span id="1931">1931</span> |
| <span id="1932">1932</span> |
| <span id="1933">1933</span> |
| <span id="1934">1934</span> |
| <span id="1935">1935</span> |
| <span id="1936">1936</span> |
| <span id="1937">1937</span> |
| <span id="1938">1938</span> |
| <span id="1939">1939</span> |
| <span id="1940">1940</span> |
| <span id="1941">1941</span> |
| <span id="1942">1942</span> |
| <span id="1943">1943</span> |
| <span id="1944">1944</span> |
| <span id="1945">1945</span> |
| <span id="1946">1946</span> |
| <span id="1947">1947</span> |
| <span id="1948">1948</span> |
| <span id="1949">1949</span> |
| <span id="1950">1950</span> |
| <span id="1951">1951</span> |
| <span id="1952">1952</span> |
| <span id="1953">1953</span> |
| <span id="1954">1954</span> |
| <span id="1955">1955</span> |
| <span id="1956">1956</span> |
| <span id="1957">1957</span> |
| <span id="1958">1958</span> |
| <span id="1959">1959</span> |
| <span id="1960">1960</span> |
| <span id="1961">1961</span> |
| <span id="1962">1962</span> |
| <span id="1963">1963</span> |
| <span id="1964">1964</span> |
| <span id="1965">1965</span> |
| <span id="1966">1966</span> |
| <span id="1967">1967</span> |
| <span id="1968">1968</span> |
| <span id="1969">1969</span> |
| <span id="1970">1970</span> |
| <span id="1971">1971</span> |
| <span id="1972">1972</span> |
| <span id="1973">1973</span> |
| <span id="1974">1974</span> |
| <span id="1975">1975</span> |
| <span id="1976">1976</span> |
| <span id="1977">1977</span> |
| <span id="1978">1978</span> |
| <span id="1979">1979</span> |
| <span id="1980">1980</span> |
| <span id="1981">1981</span> |
| <span id="1982">1982</span> |
| <span id="1983">1983</span> |
| <span id="1984">1984</span> |
| <span id="1985">1985</span> |
| <span id="1986">1986</span> |
| <span id="1987">1987</span> |
| <span id="1988">1988</span> |
| <span id="1989">1989</span> |
| <span id="1990">1990</span> |
| <span id="1991">1991</span> |
| <span id="1992">1992</span> |
| <span id="1993">1993</span> |
| <span id="1994">1994</span> |
| <span id="1995">1995</span> |
| <span id="1996">1996</span> |
| <span id="1997">1997</span> |
| <span id="1998">1998</span> |
| <span id="1999">1999</span> |
| <span id="2000">2000</span> |
| <span id="2001">2001</span> |
| <span id="2002">2002</span> |
| <span id="2003">2003</span> |
| <span id="2004">2004</span> |
| <span id="2005">2005</span> |
| <span id="2006">2006</span> |
| <span id="2007">2007</span> |
| <span id="2008">2008</span> |
| <span id="2009">2009</span> |
| <span id="2010">2010</span> |
| <span id="2011">2011</span> |
| <span id="2012">2012</span> |
| <span id="2013">2013</span> |
| <span id="2014">2014</span> |
| <span id="2015">2015</span> |
| <span id="2016">2016</span> |
| <span id="2017">2017</span> |
| <span id="2018">2018</span> |
| <span id="2019">2019</span> |
| <span id="2020">2020</span> |
| <span id="2021">2021</span> |
| <span id="2022">2022</span> |
| <span id="2023">2023</span> |
| <span id="2024">2024</span> |
| <span id="2025">2025</span> |
| <span id="2026">2026</span> |
| <span id="2027">2027</span> |
| <span id="2028">2028</span> |
| <span id="2029">2029</span> |
| <span id="2030">2030</span> |
| <span id="2031">2031</span> |
| <span id="2032">2032</span> |
| <span id="2033">2033</span> |
| <span id="2034">2034</span> |
| <span id="2035">2035</span> |
| <span id="2036">2036</span> |
| <span id="2037">2037</span> |
| <span id="2038">2038</span> |
| <span id="2039">2039</span> |
| <span id="2040">2040</span> |
| <span id="2041">2041</span> |
| <span id="2042">2042</span> |
| <span id="2043">2043</span> |
| <span id="2044">2044</span> |
| <span id="2045">2045</span> |
| <span id="2046">2046</span> |
| <span id="2047">2047</span> |
| <span id="2048">2048</span> |
| <span id="2049">2049</span> |
| <span id="2050">2050</span> |
| <span id="2051">2051</span> |
| <span id="2052">2052</span> |
| <span id="2053">2053</span> |
| <span id="2054">2054</span> |
| <span id="2055">2055</span> |
| <span id="2056">2056</span> |
| <span id="2057">2057</span> |
| <span id="2058">2058</span> |
| <span id="2059">2059</span> |
| <span id="2060">2060</span> |
| <span id="2061">2061</span> |
| <span id="2062">2062</span> |
| <span id="2063">2063</span> |
| <span id="2064">2064</span> |
| <span id="2065">2065</span> |
| <span id="2066">2066</span> |
| <span id="2067">2067</span> |
| <span id="2068">2068</span> |
| <span id="2069">2069</span> |
| <span id="2070">2070</span> |
| <span id="2071">2071</span> |
| <span id="2072">2072</span> |
| <span id="2073">2073</span> |
| <span id="2074">2074</span> |
| <span id="2075">2075</span> |
| <span id="2076">2076</span> |
| <span id="2077">2077</span> |
| <span id="2078">2078</span> |
| <span id="2079">2079</span> |
| <span id="2080">2080</span> |
| <span id="2081">2081</span> |
| <span id="2082">2082</span> |
| <span id="2083">2083</span> |
| <span id="2084">2084</span> |
| <span id="2085">2085</span> |
| <span id="2086">2086</span> |
| <span id="2087">2087</span> |
| <span id="2088">2088</span> |
| <span id="2089">2089</span> |
| <span id="2090">2090</span> |
| <span id="2091">2091</span> |
| <span id="2092">2092</span> |
| <span id="2093">2093</span> |
| <span id="2094">2094</span> |
| <span id="2095">2095</span> |
| <span id="2096">2096</span> |
| <span id="2097">2097</span> |
| <span id="2098">2098</span> |
| <span id="2099">2099</span> |
| <span id="2100">2100</span> |
| <span id="2101">2101</span> |
| <span id="2102">2102</span> |
| <span id="2103">2103</span> |
| <span id="2104">2104</span> |
| <span id="2105">2105</span> |
| <span id="2106">2106</span> |
| <span id="2107">2107</span> |
| <span id="2108">2108</span> |
| <span id="2109">2109</span> |
| <span id="2110">2110</span> |
| <span id="2111">2111</span> |
| <span id="2112">2112</span> |
| <span id="2113">2113</span> |
| <span id="2114">2114</span> |
| <span id="2115">2115</span> |
| <span id="2116">2116</span> |
| <span id="2117">2117</span> |
| <span id="2118">2118</span> |
| <span id="2119">2119</span> |
| <span id="2120">2120</span> |
| <span id="2121">2121</span> |
| <span id="2122">2122</span> |
| <span id="2123">2123</span> |
| <span id="2124">2124</span> |
| <span id="2125">2125</span> |
| <span id="2126">2126</span> |
| <span id="2127">2127</span> |
| <span id="2128">2128</span> |
| <span id="2129">2129</span> |
| <span id="2130">2130</span> |
| <span id="2131">2131</span> |
| <span id="2132">2132</span> |
| <span id="2133">2133</span> |
| <span id="2134">2134</span> |
| <span id="2135">2135</span> |
| <span id="2136">2136</span> |
| <span id="2137">2137</span> |
| <span id="2138">2138</span> |
| <span id="2139">2139</span> |
| <span id="2140">2140</span> |
| <span id="2141">2141</span> |
| <span id="2142">2142</span> |
| <span id="2143">2143</span> |
| <span id="2144">2144</span> |
| <span id="2145">2145</span> |
| <span id="2146">2146</span> |
| <span id="2147">2147</span> |
| <span id="2148">2148</span> |
| <span id="2149">2149</span> |
| <span id="2150">2150</span> |
| <span id="2151">2151</span> |
| <span id="2152">2152</span> |
| <span id="2153">2153</span> |
| <span id="2154">2154</span> |
| <span id="2155">2155</span> |
| <span id="2156">2156</span> |
| <span id="2157">2157</span> |
| <span id="2158">2158</span> |
| <span id="2159">2159</span> |
| <span id="2160">2160</span> |
| <span id="2161">2161</span> |
| <span id="2162">2162</span> |
| <span id="2163">2163</span> |
| <span id="2164">2164</span> |
| <span id="2165">2165</span> |
| <span id="2166">2166</span> |
| <span id="2167">2167</span> |
| <span id="2168">2168</span> |
| <span id="2169">2169</span> |
| <span id="2170">2170</span> |
| <span id="2171">2171</span> |
| <span id="2172">2172</span> |
| <span id="2173">2173</span> |
| <span id="2174">2174</span> |
| <span id="2175">2175</span> |
| <span id="2176">2176</span> |
| <span id="2177">2177</span> |
| <span id="2178">2178</span> |
| <span id="2179">2179</span> |
| <span id="2180">2180</span> |
| <span id="2181">2181</span> |
| <span id="2182">2182</span> |
| <span id="2183">2183</span> |
| <span id="2184">2184</span> |
| <span id="2185">2185</span> |
| <span id="2186">2186</span> |
| <span id="2187">2187</span> |
| <span id="2188">2188</span> |
| <span id="2189">2189</span> |
| <span id="2190">2190</span> |
| <span id="2191">2191</span> |
| <span id="2192">2192</span> |
| <span id="2193">2193</span> |
| <span id="2194">2194</span> |
| <span id="2195">2195</span> |
| <span id="2196">2196</span> |
| <span id="2197">2197</span> |
| <span id="2198">2198</span> |
| <span id="2199">2199</span> |
| <span id="2200">2200</span> |
| <span id="2201">2201</span> |
| <span id="2202">2202</span> |
| <span id="2203">2203</span> |
| <span id="2204">2204</span> |
| <span id="2205">2205</span> |
| <span id="2206">2206</span> |
| <span id="2207">2207</span> |
| <span id="2208">2208</span> |
| <span id="2209">2209</span> |
| <span id="2210">2210</span> |
| <span id="2211">2211</span> |
| <span id="2212">2212</span> |
| <span id="2213">2213</span> |
| <span id="2214">2214</span> |
| <span id="2215">2215</span> |
| <span id="2216">2216</span> |
| <span id="2217">2217</span> |
| <span id="2218">2218</span> |
| <span id="2219">2219</span> |
| <span id="2220">2220</span> |
| <span id="2221">2221</span> |
| <span id="2222">2222</span> |
| <span id="2223">2223</span> |
| <span id="2224">2224</span> |
| <span id="2225">2225</span> |
| <span id="2226">2226</span> |
| <span id="2227">2227</span> |
| <span id="2228">2228</span> |
| <span id="2229">2229</span> |
| <span id="2230">2230</span> |
| <span id="2231">2231</span> |
| <span id="2232">2232</span> |
| <span id="2233">2233</span> |
| <span id="2234">2234</span> |
| <span id="2235">2235</span> |
| <span id="2236">2236</span> |
| <span id="2237">2237</span> |
| <span id="2238">2238</span> |
| <span id="2239">2239</span> |
| <span id="2240">2240</span> |
| <span id="2241">2241</span> |
| <span id="2242">2242</span> |
| <span id="2243">2243</span> |
| <span id="2244">2244</span> |
| <span id="2245">2245</span> |
| <span id="2246">2246</span> |
| <span id="2247">2247</span> |
| <span id="2248">2248</span> |
| <span id="2249">2249</span> |
| <span id="2250">2250</span> |
| <span id="2251">2251</span> |
| <span id="2252">2252</span> |
| <span id="2253">2253</span> |
| <span id="2254">2254</span> |
| <span id="2255">2255</span> |
| <span id="2256">2256</span> |
| <span id="2257">2257</span> |
| <span id="2258">2258</span> |
| <span id="2259">2259</span> |
| <span id="2260">2260</span> |
| <span id="2261">2261</span> |
| <span id="2262">2262</span> |
| <span id="2263">2263</span> |
| <span id="2264">2264</span> |
| <span id="2265">2265</span> |
| <span id="2266">2266</span> |
| <span id="2267">2267</span> |
| <span id="2268">2268</span> |
| <span id="2269">2269</span> |
| <span id="2270">2270</span> |
| <span id="2271">2271</span> |
| <span id="2272">2272</span> |
| <span id="2273">2273</span> |
| <span id="2274">2274</span> |
| <span id="2275">2275</span> |
| <span id="2276">2276</span> |
| <span id="2277">2277</span> |
| <span id="2278">2278</span> |
| <span id="2279">2279</span> |
| <span id="2280">2280</span> |
| <span id="2281">2281</span> |
| <span id="2282">2282</span> |
| <span id="2283">2283</span> |
| <span id="2284">2284</span> |
| <span id="2285">2285</span> |
| <span id="2286">2286</span> |
| <span id="2287">2287</span> |
| <span id="2288">2288</span> |
| <span id="2289">2289</span> |
| <span id="2290">2290</span> |
| <span id="2291">2291</span> |
| <span id="2292">2292</span> |
| <span id="2293">2293</span> |
| <span id="2294">2294</span> |
| <span id="2295">2295</span> |
| <span id="2296">2296</span> |
| <span id="2297">2297</span> |
| <span id="2298">2298</span> |
| <span id="2299">2299</span> |
| <span id="2300">2300</span> |
| <span id="2301">2301</span> |
| <span id="2302">2302</span> |
| <span id="2303">2303</span> |
| <span id="2304">2304</span> |
| <span id="2305">2305</span> |
| <span id="2306">2306</span> |
| <span id="2307">2307</span> |
| <span id="2308">2308</span> |
| <span id="2309">2309</span> |
| <span id="2310">2310</span> |
| <span id="2311">2311</span> |
| <span id="2312">2312</span> |
| <span id="2313">2313</span> |
| <span id="2314">2314</span> |
| <span id="2315">2315</span> |
| <span id="2316">2316</span> |
| <span id="2317">2317</span> |
| <span id="2318">2318</span> |
| <span id="2319">2319</span> |
| <span id="2320">2320</span> |
| <span id="2321">2321</span> |
| <span id="2322">2322</span> |
| <span id="2323">2323</span> |
| <span id="2324">2324</span> |
| <span id="2325">2325</span> |
| <span id="2326">2326</span> |
| <span id="2327">2327</span> |
| <span id="2328">2328</span> |
| <span id="2329">2329</span> |
| <span id="2330">2330</span> |
| <span id="2331">2331</span> |
| <span id="2332">2332</span> |
| <span id="2333">2333</span> |
| <span id="2334">2334</span> |
| <span id="2335">2335</span> |
| <span id="2336">2336</span> |
| <span id="2337">2337</span> |
| <span id="2338">2338</span> |
| <span id="2339">2339</span> |
| <span id="2340">2340</span> |
| <span id="2341">2341</span> |
| <span id="2342">2342</span> |
| <span id="2343">2343</span> |
| <span id="2344">2344</span> |
| <span id="2345">2345</span> |
| <span id="2346">2346</span> |
| <span id="2347">2347</span> |
| <span id="2348">2348</span> |
| <span id="2349">2349</span> |
| <span id="2350">2350</span> |
| <span id="2351">2351</span> |
| <span id="2352">2352</span> |
| <span id="2353">2353</span> |
| <span id="2354">2354</span> |
| <span id="2355">2355</span> |
| <span id="2356">2356</span> |
| <span id="2357">2357</span> |
| <span id="2358">2358</span> |
| <span id="2359">2359</span> |
| <span id="2360">2360</span> |
| <span id="2361">2361</span> |
| <span id="2362">2362</span> |
| <span id="2363">2363</span> |
| <span id="2364">2364</span> |
| <span id="2365">2365</span> |
| <span id="2366">2366</span> |
| <span id="2367">2367</span> |
| <span id="2368">2368</span> |
| <span id="2369">2369</span> |
| <span id="2370">2370</span> |
| <span id="2371">2371</span> |
| <span id="2372">2372</span> |
| <span id="2373">2373</span> |
| <span id="2374">2374</span> |
| <span id="2375">2375</span> |
| <span id="2376">2376</span> |
| <span id="2377">2377</span> |
| <span id="2378">2378</span> |
| <span id="2379">2379</span> |
| <span id="2380">2380</span> |
| <span id="2381">2381</span> |
| <span id="2382">2382</span> |
| <span id="2383">2383</span> |
| <span id="2384">2384</span> |
| <span id="2385">2385</span> |
| <span id="2386">2386</span> |
| <span id="2387">2387</span> |
| <span id="2388">2388</span> |
| <span id="2389">2389</span> |
| <span id="2390">2390</span> |
| <span id="2391">2391</span> |
| <span id="2392">2392</span> |
| <span id="2393">2393</span> |
| <span id="2394">2394</span> |
| <span id="2395">2395</span> |
| <span id="2396">2396</span> |
| <span id="2397">2397</span> |
| <span id="2398">2398</span> |
| <span id="2399">2399</span> |
| <span id="2400">2400</span> |
| <span id="2401">2401</span> |
| <span id="2402">2402</span> |
| <span id="2403">2403</span> |
| <span id="2404">2404</span> |
| <span id="2405">2405</span> |
| <span id="2406">2406</span> |
| <span id="2407">2407</span> |
| <span id="2408">2408</span> |
| <span id="2409">2409</span> |
| <span id="2410">2410</span> |
| <span id="2411">2411</span> |
| <span id="2412">2412</span> |
| <span id="2413">2413</span> |
| <span id="2414">2414</span> |
| <span id="2415">2415</span> |
| <span id="2416">2416</span> |
| <span id="2417">2417</span> |
| <span id="2418">2418</span> |
| <span id="2419">2419</span> |
| <span id="2420">2420</span> |
| <span id="2421">2421</span> |
| <span id="2422">2422</span> |
| <span id="2423">2423</span> |
| <span id="2424">2424</span> |
| <span id="2425">2425</span> |
| <span id="2426">2426</span> |
| <span id="2427">2427</span> |
| <span id="2428">2428</span> |
| <span id="2429">2429</span> |
| <span id="2430">2430</span> |
| <span id="2431">2431</span> |
| <span id="2432">2432</span> |
| <span id="2433">2433</span> |
| <span id="2434">2434</span> |
| <span id="2435">2435</span> |
| <span id="2436">2436</span> |
| <span id="2437">2437</span> |
| <span id="2438">2438</span> |
| <span id="2439">2439</span> |
| <span id="2440">2440</span> |
| <span id="2441">2441</span> |
| <span id="2442">2442</span> |
| <span id="2443">2443</span> |
| <span id="2444">2444</span> |
| <span id="2445">2445</span> |
| <span id="2446">2446</span> |
| <span id="2447">2447</span> |
| <span id="2448">2448</span> |
| <span id="2449">2449</span> |
| <span id="2450">2450</span> |
| <span id="2451">2451</span> |
| <span id="2452">2452</span> |
| <span id="2453">2453</span> |
| <span id="2454">2454</span> |
| <span id="2455">2455</span> |
| <span id="2456">2456</span> |
| <span id="2457">2457</span> |
| <span id="2458">2458</span> |
| <span id="2459">2459</span> |
| <span id="2460">2460</span> |
| <span id="2461">2461</span> |
| <span id="2462">2462</span> |
| <span id="2463">2463</span> |
| <span id="2464">2464</span> |
| <span id="2465">2465</span> |
| <span id="2466">2466</span> |
| <span id="2467">2467</span> |
| <span id="2468">2468</span> |
| <span id="2469">2469</span> |
| <span id="2470">2470</span> |
| <span id="2471">2471</span> |
| <span id="2472">2472</span> |
| <span id="2473">2473</span> |
| <span id="2474">2474</span> |
| <span id="2475">2475</span> |
| <span id="2476">2476</span> |
| <span id="2477">2477</span> |
| <span id="2478">2478</span> |
| <span id="2479">2479</span> |
| <span id="2480">2480</span> |
| <span id="2481">2481</span> |
| <span id="2482">2482</span> |
| <span id="2483">2483</span> |
| <span id="2484">2484</span> |
| <span id="2485">2485</span> |
| <span id="2486">2486</span> |
| <span id="2487">2487</span> |
| <span id="2488">2488</span> |
| <span id="2489">2489</span> |
| <span id="2490">2490</span> |
| <span id="2491">2491</span> |
| <span id="2492">2492</span> |
| <span id="2493">2493</span> |
| <span id="2494">2494</span> |
| <span id="2495">2495</span> |
| <span id="2496">2496</span> |
| <span id="2497">2497</span> |
| <span id="2498">2498</span> |
| <span id="2499">2499</span> |
| <span id="2500">2500</span> |
| <span id="2501">2501</span> |
| <span id="2502">2502</span> |
| <span id="2503">2503</span> |
| <span id="2504">2504</span> |
| <span id="2505">2505</span> |
| <span id="2506">2506</span> |
| <span id="2507">2507</span> |
| <span id="2508">2508</span> |
| <span id="2509">2509</span> |
| <span id="2510">2510</span> |
| <span id="2511">2511</span> |
| <span id="2512">2512</span> |
| <span id="2513">2513</span> |
| <span id="2514">2514</span> |
| <span id="2515">2515</span> |
| <span id="2516">2516</span> |
| <span id="2517">2517</span> |
| <span id="2518">2518</span> |
| <span id="2519">2519</span> |
| <span id="2520">2520</span> |
| <span id="2521">2521</span> |
| <span id="2522">2522</span> |
| <span id="2523">2523</span> |
| <span id="2524">2524</span> |
| <span id="2525">2525</span> |
| <span id="2526">2526</span> |
| <span id="2527">2527</span> |
| <span id="2528">2528</span> |
| <span id="2529">2529</span> |
| <span id="2530">2530</span> |
| <span id="2531">2531</span> |
| <span id="2532">2532</span> |
| <span id="2533">2533</span> |
| <span id="2534">2534</span> |
| <span id="2535">2535</span> |
| <span id="2536">2536</span> |
| <span id="2537">2537</span> |
| <span id="2538">2538</span> |
| <span id="2539">2539</span> |
| <span id="2540">2540</span> |
| <span id="2541">2541</span> |
| <span id="2542">2542</span> |
| <span id="2543">2543</span> |
| <span id="2544">2544</span> |
| <span id="2545">2545</span> |
| <span id="2546">2546</span> |
| <span id="2547">2547</span> |
| <span id="2548">2548</span> |
| <span id="2549">2549</span> |
| <span id="2550">2550</span> |
| <span id="2551">2551</span> |
| <span id="2552">2552</span> |
| <span id="2553">2553</span> |
| <span id="2554">2554</span> |
| <span id="2555">2555</span> |
| <span id="2556">2556</span> |
| <span id="2557">2557</span> |
| <span id="2558">2558</span> |
| <span id="2559">2559</span> |
| <span id="2560">2560</span> |
| <span id="2561">2561</span> |
| <span id="2562">2562</span> |
| <span id="2563">2563</span> |
| <span id="2564">2564</span> |
| <span id="2565">2565</span> |
| <span id="2566">2566</span> |
| <span id="2567">2567</span> |
| <span id="2568">2568</span> |
| <span id="2569">2569</span> |
| <span id="2570">2570</span> |
| <span id="2571">2571</span> |
| <span id="2572">2572</span> |
| <span id="2573">2573</span> |
| <span id="2574">2574</span> |
| <span id="2575">2575</span> |
| <span id="2576">2576</span> |
| <span id="2577">2577</span> |
| <span id="2578">2578</span> |
| <span id="2579">2579</span> |
| <span id="2580">2580</span> |
| <span id="2581">2581</span> |
| <span id="2582">2582</span> |
| <span id="2583">2583</span> |
| <span id="2584">2584</span> |
| <span id="2585">2585</span> |
| <span id="2586">2586</span> |
| <span id="2587">2587</span> |
| <span id="2588">2588</span> |
| <span id="2589">2589</span> |
| <span id="2590">2590</span> |
| <span id="2591">2591</span> |
| <span id="2592">2592</span> |
| <span id="2593">2593</span> |
| <span id="2594">2594</span> |
| <span id="2595">2595</span> |
| <span id="2596">2596</span> |
| <span id="2597">2597</span> |
| <span id="2598">2598</span> |
| <span id="2599">2599</span> |
| <span id="2600">2600</span> |
| <span id="2601">2601</span> |
| <span id="2602">2602</span> |
| <span id="2603">2603</span> |
| <span id="2604">2604</span> |
| <span id="2605">2605</span> |
| <span id="2606">2606</span> |
| <span id="2607">2607</span> |
| <span id="2608">2608</span> |
| <span id="2609">2609</span> |
| <span id="2610">2610</span> |
| <span id="2611">2611</span> |
| <span id="2612">2612</span> |
| <span id="2613">2613</span> |
| <span id="2614">2614</span> |
| <span id="2615">2615</span> |
| <span id="2616">2616</span> |
| <span id="2617">2617</span> |
| <span id="2618">2618</span> |
| <span id="2619">2619</span> |
| <span id="2620">2620</span> |
| <span id="2621">2621</span> |
| <span id="2622">2622</span> |
| <span id="2623">2623</span> |
| <span id="2624">2624</span> |
| <span id="2625">2625</span> |
| <span id="2626">2626</span> |
| <span id="2627">2627</span> |
| <span id="2628">2628</span> |
| <span id="2629">2629</span> |
| <span id="2630">2630</span> |
| <span id="2631">2631</span> |
| <span id="2632">2632</span> |
| <span id="2633">2633</span> |
| <span id="2634">2634</span> |
| <span id="2635">2635</span> |
| <span id="2636">2636</span> |
| <span id="2637">2637</span> |
| <span id="2638">2638</span> |
| <span id="2639">2639</span> |
| <span id="2640">2640</span> |
| <span id="2641">2641</span> |
| <span id="2642">2642</span> |
| <span id="2643">2643</span> |
| <span id="2644">2644</span> |
| <span id="2645">2645</span> |
| <span id="2646">2646</span> |
| <span id="2647">2647</span> |
| <span id="2648">2648</span> |
| <span id="2649">2649</span> |
| <span id="2650">2650</span> |
| <span id="2651">2651</span> |
| <span id="2652">2652</span> |
| <span id="2653">2653</span> |
| <span id="2654">2654</span> |
| <span id="2655">2655</span> |
| <span id="2656">2656</span> |
| <span id="2657">2657</span> |
| <span id="2658">2658</span> |
| <span id="2659">2659</span> |
| <span id="2660">2660</span> |
| <span id="2661">2661</span> |
| <span id="2662">2662</span> |
| <span id="2663">2663</span> |
| <span id="2664">2664</span> |
| <span id="2665">2665</span> |
| <span id="2666">2666</span> |
| <span id="2667">2667</span> |
| <span id="2668">2668</span> |
| <span id="2669">2669</span> |
| <span id="2670">2670</span> |
| <span id="2671">2671</span> |
| <span id="2672">2672</span> |
| <span id="2673">2673</span> |
| <span id="2674">2674</span> |
| <span id="2675">2675</span> |
| <span id="2676">2676</span> |
| <span id="2677">2677</span> |
| <span id="2678">2678</span> |
| <span id="2679">2679</span> |
| <span id="2680">2680</span> |
| <span id="2681">2681</span> |
| <span id="2682">2682</span> |
| <span id="2683">2683</span> |
| <span id="2684">2684</span> |
| <span id="2685">2685</span> |
| <span id="2686">2686</span> |
| <span id="2687">2687</span> |
| <span id="2688">2688</span> |
| <span id="2689">2689</span> |
| <span id="2690">2690</span> |
| <span id="2691">2691</span> |
| <span id="2692">2692</span> |
| <span id="2693">2693</span> |
| <span id="2694">2694</span> |
| <span id="2695">2695</span> |
| <span id="2696">2696</span> |
| <span id="2697">2697</span> |
| <span id="2698">2698</span> |
| <span id="2699">2699</span> |
| <span id="2700">2700</span> |
| <span id="2701">2701</span> |
| <span id="2702">2702</span> |
| <span id="2703">2703</span> |
| <span id="2704">2704</span> |
| <span id="2705">2705</span> |
| <span id="2706">2706</span> |
| <span id="2707">2707</span> |
| <span id="2708">2708</span> |
| <span id="2709">2709</span> |
| <span id="2710">2710</span> |
| <span id="2711">2711</span> |
| <span id="2712">2712</span> |
| <span id="2713">2713</span> |
| <span id="2714">2714</span> |
| <span id="2715">2715</span> |
| <span id="2716">2716</span> |
| <span id="2717">2717</span> |
| <span id="2718">2718</span> |
| <span id="2719">2719</span> |
| <span id="2720">2720</span> |
| <span id="2721">2721</span> |
| <span id="2722">2722</span> |
| <span id="2723">2723</span> |
| <span id="2724">2724</span> |
| <span id="2725">2725</span> |
| <span id="2726">2726</span> |
| <span id="2727">2727</span> |
| <span id="2728">2728</span> |
| <span id="2729">2729</span> |
| <span id="2730">2730</span> |
| <span id="2731">2731</span> |
| <span id="2732">2732</span> |
| <span id="2733">2733</span> |
| <span id="2734">2734</span> |
| <span id="2735">2735</span> |
| <span id="2736">2736</span> |
| <span id="2737">2737</span> |
| <span id="2738">2738</span> |
| <span id="2739">2739</span> |
| <span id="2740">2740</span> |
| <span id="2741">2741</span> |
| <span id="2742">2742</span> |
| <span id="2743">2743</span> |
| <span id="2744">2744</span> |
| <span id="2745">2745</span> |
| <span id="2746">2746</span> |
| <span id="2747">2747</span> |
| <span id="2748">2748</span> |
| <span id="2749">2749</span> |
| <span id="2750">2750</span> |
| <span id="2751">2751</span> |
| <span id="2752">2752</span> |
| <span id="2753">2753</span> |
| <span id="2754">2754</span> |
| <span id="2755">2755</span> |
| <span id="2756">2756</span> |
| <span id="2757">2757</span> |
| <span id="2758">2758</span> |
| <span id="2759">2759</span> |
| <span id="2760">2760</span> |
| <span id="2761">2761</span> |
| <span id="2762">2762</span> |
| <span id="2763">2763</span> |
| <span id="2764">2764</span> |
| <span id="2765">2765</span> |
| <span id="2766">2766</span> |
| <span id="2767">2767</span> |
| <span id="2768">2768</span> |
| <span id="2769">2769</span> |
| <span id="2770">2770</span> |
| <span id="2771">2771</span> |
| <span id="2772">2772</span> |
| <span id="2773">2773</span> |
| <span id="2774">2774</span> |
| <span id="2775">2775</span> |
| <span id="2776">2776</span> |
| <span id="2777">2777</span> |
| <span id="2778">2778</span> |
| <span id="2779">2779</span> |
| <span id="2780">2780</span> |
| <span id="2781">2781</span> |
| <span id="2782">2782</span> |
| <span id="2783">2783</span> |
| <span id="2784">2784</span> |
| <span id="2785">2785</span> |
| <span id="2786">2786</span> |
| <span id="2787">2787</span> |
| <span id="2788">2788</span> |
| <span id="2789">2789</span> |
| <span id="2790">2790</span> |
| <span id="2791">2791</span> |
| <span id="2792">2792</span> |
| <span id="2793">2793</span> |
| <span id="2794">2794</span> |
| <span id="2795">2795</span> |
| <span id="2796">2796</span> |
| <span id="2797">2797</span> |
| <span id="2798">2798</span> |
| <span id="2799">2799</span> |
| <span id="2800">2800</span> |
| <span id="2801">2801</span> |
| <span id="2802">2802</span> |
| <span id="2803">2803</span> |
| <span id="2804">2804</span> |
| <span id="2805">2805</span> |
| <span id="2806">2806</span> |
| <span id="2807">2807</span> |
| <span id="2808">2808</span> |
| <span id="2809">2809</span> |
| <span id="2810">2810</span> |
| <span id="2811">2811</span> |
| <span id="2812">2812</span> |
| <span id="2813">2813</span> |
| <span id="2814">2814</span> |
| <span id="2815">2815</span> |
| <span id="2816">2816</span> |
| <span id="2817">2817</span> |
| <span id="2818">2818</span> |
| <span id="2819">2819</span> |
| <span id="2820">2820</span> |
| <span id="2821">2821</span> |
| <span id="2822">2822</span> |
| <span id="2823">2823</span> |
| <span id="2824">2824</span> |
| <span id="2825">2825</span> |
| <span id="2826">2826</span> |
| <span id="2827">2827</span> |
| <span id="2828">2828</span> |
| <span id="2829">2829</span> |
| <span id="2830">2830</span> |
| <span id="2831">2831</span> |
| <span id="2832">2832</span> |
| <span id="2833">2833</span> |
| <span id="2834">2834</span> |
| <span id="2835">2835</span> |
| <span id="2836">2836</span> |
| <span id="2837">2837</span> |
| <span id="2838">2838</span> |
| <span id="2839">2839</span> |
| <span id="2840">2840</span> |
| <span id="2841">2841</span> |
| <span id="2842">2842</span> |
| <span id="2843">2843</span> |
| <span id="2844">2844</span> |
| <span id="2845">2845</span> |
| <span id="2846">2846</span> |
| <span id="2847">2847</span> |
| <span id="2848">2848</span> |
| <span id="2849">2849</span> |
| <span id="2850">2850</span> |
| <span id="2851">2851</span> |
| <span id="2852">2852</span> |
| <span id="2853">2853</span> |
| <span id="2854">2854</span> |
| <span id="2855">2855</span> |
| <span id="2856">2856</span> |
| <span id="2857">2857</span> |
| <span id="2858">2858</span> |
| <span id="2859">2859</span> |
| <span id="2860">2860</span> |
| <span id="2861">2861</span> |
| <span id="2862">2862</span> |
| <span id="2863">2863</span> |
| <span id="2864">2864</span> |
| <span id="2865">2865</span> |
| <span id="2866">2866</span> |
| <span id="2867">2867</span> |
| <span id="2868">2868</span> |
| <span id="2869">2869</span> |
| <span id="2870">2870</span> |
| <span id="2871">2871</span> |
| <span id="2872">2872</span> |
| <span id="2873">2873</span> |
| <span id="2874">2874</span> |
| <span id="2875">2875</span> |
| <span id="2876">2876</span> |
| <span id="2877">2877</span> |
| <span id="2878">2878</span> |
| <span id="2879">2879</span> |
| <span id="2880">2880</span> |
| <span id="2881">2881</span> |
| <span id="2882">2882</span> |
| <span id="2883">2883</span> |
| <span id="2884">2884</span> |
| <span id="2885">2885</span> |
| <span id="2886">2886</span> |
| <span id="2887">2887</span> |
| <span id="2888">2888</span> |
| <span id="2889">2889</span> |
| <span id="2890">2890</span> |
| <span id="2891">2891</span> |
| <span id="2892">2892</span> |
| <span id="2893">2893</span> |
| <span id="2894">2894</span> |
| <span id="2895">2895</span> |
| <span id="2896">2896</span> |
| <span id="2897">2897</span> |
| <span id="2898">2898</span> |
| <span id="2899">2899</span> |
| <span id="2900">2900</span> |
| <span id="2901">2901</span> |
| <span id="2902">2902</span> |
| <span id="2903">2903</span> |
| <span id="2904">2904</span> |
| <span id="2905">2905</span> |
| <span id="2906">2906</span> |
| <span id="2907">2907</span> |
| <span id="2908">2908</span> |
| <span id="2909">2909</span> |
| <span id="2910">2910</span> |
| <span id="2911">2911</span> |
| <span id="2912">2912</span> |
| <span id="2913">2913</span> |
| <span id="2914">2914</span> |
| <span id="2915">2915</span> |
| <span id="2916">2916</span> |
| <span id="2917">2917</span> |
| <span id="2918">2918</span> |
| <span id="2919">2919</span> |
| <span id="2920">2920</span> |
| <span id="2921">2921</span> |
| <span id="2922">2922</span> |
| <span id="2923">2923</span> |
| <span id="2924">2924</span> |
| <span id="2925">2925</span> |
| <span id="2926">2926</span> |
| <span id="2927">2927</span> |
| <span id="2928">2928</span> |
| <span id="2929">2929</span> |
| <span id="2930">2930</span> |
| <span id="2931">2931</span> |
| <span id="2932">2932</span> |
| <span id="2933">2933</span> |
| <span id="2934">2934</span> |
| <span id="2935">2935</span> |
| <span id="2936">2936</span> |
| <span id="2937">2937</span> |
| <span id="2938">2938</span> |
| <span id="2939">2939</span> |
| <span id="2940">2940</span> |
| <span id="2941">2941</span> |
| <span id="2942">2942</span> |
| <span id="2943">2943</span> |
| <span id="2944">2944</span> |
| <span id="2945">2945</span> |
| <span id="2946">2946</span> |
| <span id="2947">2947</span> |
| <span id="2948">2948</span> |
| <span id="2949">2949</span> |
| <span id="2950">2950</span> |
| <span id="2951">2951</span> |
| <span id="2952">2952</span> |
| <span id="2953">2953</span> |
| <span id="2954">2954</span> |
| <span id="2955">2955</span> |
| <span id="2956">2956</span> |
| <span id="2957">2957</span> |
| <span id="2958">2958</span> |
| <span id="2959">2959</span> |
| <span id="2960">2960</span> |
| <span id="2961">2961</span> |
| <span id="2962">2962</span> |
| <span id="2963">2963</span> |
| <span id="2964">2964</span> |
| <span id="2965">2965</span> |
| <span id="2966">2966</span> |
| <span id="2967">2967</span> |
| <span id="2968">2968</span> |
| <span id="2969">2969</span> |
| <span id="2970">2970</span> |
| <span id="2971">2971</span> |
| <span id="2972">2972</span> |
| <span id="2973">2973</span> |
| <span id="2974">2974</span> |
| <span id="2975">2975</span> |
| <span id="2976">2976</span> |
| <span id="2977">2977</span> |
| <span id="2978">2978</span> |
| <span id="2979">2979</span> |
| <span id="2980">2980</span> |
| <span id="2981">2981</span> |
| <span id="2982">2982</span> |
| <span id="2983">2983</span> |
| <span id="2984">2984</span> |
| <span id="2985">2985</span> |
| <span id="2986">2986</span> |
| <span id="2987">2987</span> |
| <span id="2988">2988</span> |
| <span id="2989">2989</span> |
| <span id="2990">2990</span> |
| <span id="2991">2991</span> |
| <span id="2992">2992</span> |
| <span id="2993">2993</span> |
| <span id="2994">2994</span> |
| <span id="2995">2995</span> |
| <span id="2996">2996</span> |
| <span id="2997">2997</span> |
| <span id="2998">2998</span> |
| <span id="2999">2999</span> |
| <span id="3000">3000</span> |
| <span id="3001">3001</span> |
| <span id="3002">3002</span> |
| <span id="3003">3003</span> |
| <span id="3004">3004</span> |
| <span id="3005">3005</span> |
| <span id="3006">3006</span> |
| <span id="3007">3007</span> |
| <span id="3008">3008</span> |
| <span id="3009">3009</span> |
| <span id="3010">3010</span> |
| <span id="3011">3011</span> |
| <span id="3012">3012</span> |
| <span id="3013">3013</span> |
| <span id="3014">3014</span> |
| <span id="3015">3015</span> |
| <span id="3016">3016</span> |
| <span id="3017">3017</span> |
| <span id="3018">3018</span> |
| <span id="3019">3019</span> |
| <span id="3020">3020</span> |
| <span id="3021">3021</span> |
| <span id="3022">3022</span> |
| <span id="3023">3023</span> |
| <span id="3024">3024</span> |
| <span id="3025">3025</span> |
| <span id="3026">3026</span> |
| <span id="3027">3027</span> |
| <span id="3028">3028</span> |
| <span id="3029">3029</span> |
| <span id="3030">3030</span> |
| <span id="3031">3031</span> |
| <span id="3032">3032</span> |
| <span id="3033">3033</span> |
| <span id="3034">3034</span> |
| <span id="3035">3035</span> |
| <span id="3036">3036</span> |
| <span id="3037">3037</span> |
| <span id="3038">3038</span> |
| <span id="3039">3039</span> |
| <span id="3040">3040</span> |
| <span id="3041">3041</span> |
| <span id="3042">3042</span> |
| <span id="3043">3043</span> |
| <span id="3044">3044</span> |
| <span id="3045">3045</span> |
| <span id="3046">3046</span> |
| <span id="3047">3047</span> |
| <span id="3048">3048</span> |
| <span id="3049">3049</span> |
| <span id="3050">3050</span> |
| <span id="3051">3051</span> |
| <span id="3052">3052</span> |
| <span id="3053">3053</span> |
| <span id="3054">3054</span> |
| <span id="3055">3055</span> |
| <span id="3056">3056</span> |
| <span id="3057">3057</span> |
| <span id="3058">3058</span> |
| <span id="3059">3059</span> |
| <span id="3060">3060</span> |
| <span id="3061">3061</span> |
| <span id="3062">3062</span> |
| <span id="3063">3063</span> |
| <span id="3064">3064</span> |
| <span id="3065">3065</span> |
| <span id="3066">3066</span> |
| <span id="3067">3067</span> |
| <span id="3068">3068</span> |
| <span id="3069">3069</span> |
| <span id="3070">3070</span> |
| <span id="3071">3071</span> |
| <span id="3072">3072</span> |
| <span id="3073">3073</span> |
| <span id="3074">3074</span> |
| <span id="3075">3075</span> |
| <span id="3076">3076</span> |
| <span id="3077">3077</span> |
| <span id="3078">3078</span> |
| <span id="3079">3079</span> |
| <span id="3080">3080</span> |
| <span id="3081">3081</span> |
| <span id="3082">3082</span> |
| <span id="3083">3083</span> |
| <span id="3084">3084</span> |
| <span id="3085">3085</span> |
| <span id="3086">3086</span> |
| <span id="3087">3087</span> |
| <span id="3088">3088</span> |
| <span id="3089">3089</span> |
| <span id="3090">3090</span> |
| <span id="3091">3091</span> |
| <span id="3092">3092</span> |
| <span id="3093">3093</span> |
| <span id="3094">3094</span> |
| <span id="3095">3095</span> |
| <span id="3096">3096</span> |
| <span id="3097">3097</span> |
| <span id="3098">3098</span> |
| <span id="3099">3099</span> |
| <span id="3100">3100</span> |
| <span id="3101">3101</span> |
| <span id="3102">3102</span> |
| <span id="3103">3103</span> |
| <span id="3104">3104</span> |
| <span id="3105">3105</span> |
| <span id="3106">3106</span> |
| <span id="3107">3107</span> |
| <span id="3108">3108</span> |
| <span id="3109">3109</span> |
| <span id="3110">3110</span> |
| <span id="3111">3111</span> |
| <span id="3112">3112</span> |
| <span id="3113">3113</span> |
| <span id="3114">3114</span> |
| <span id="3115">3115</span> |
| <span id="3116">3116</span> |
| <span id="3117">3117</span> |
| <span id="3118">3118</span> |
| <span id="3119">3119</span> |
| <span id="3120">3120</span> |
| <span id="3121">3121</span> |
| <span id="3122">3122</span> |
| <span id="3123">3123</span> |
| <span id="3124">3124</span> |
| <span id="3125">3125</span> |
| <span id="3126">3126</span> |
| <span id="3127">3127</span> |
| <span id="3128">3128</span> |
| <span id="3129">3129</span> |
| <span id="3130">3130</span> |
| <span id="3131">3131</span> |
| <span id="3132">3132</span> |
| <span id="3133">3133</span> |
| <span id="3134">3134</span> |
| <span id="3135">3135</span> |
| <span id="3136">3136</span> |
| <span id="3137">3137</span> |
| <span id="3138">3138</span> |
| <span id="3139">3139</span> |
| <span id="3140">3140</span> |
| <span id="3141">3141</span> |
| <span id="3142">3142</span> |
| <span id="3143">3143</span> |
| <span id="3144">3144</span> |
| <span id="3145">3145</span> |
| <span id="3146">3146</span> |
| <span id="3147">3147</span> |
| <span id="3148">3148</span> |
| <span id="3149">3149</span> |
| <span id="3150">3150</span> |
| <span id="3151">3151</span> |
| <span id="3152">3152</span> |
| <span id="3153">3153</span> |
| <span id="3154">3154</span> |
| <span id="3155">3155</span> |
| <span id="3156">3156</span> |
| <span id="3157">3157</span> |
| <span id="3158">3158</span> |
| <span id="3159">3159</span> |
| <span id="3160">3160</span> |
| <span id="3161">3161</span> |
| <span id="3162">3162</span> |
| <span id="3163">3163</span> |
| <span id="3164">3164</span> |
| <span id="3165">3165</span> |
| <span id="3166">3166</span> |
| <span id="3167">3167</span> |
| <span id="3168">3168</span> |
| <span id="3169">3169</span> |
| <span id="3170">3170</span> |
| <span id="3171">3171</span> |
| <span id="3172">3172</span> |
| <span id="3173">3173</span> |
| <span id="3174">3174</span> |
| <span id="3175">3175</span> |
| <span id="3176">3176</span> |
| <span id="3177">3177</span> |
| <span id="3178">3178</span> |
| <span id="3179">3179</span> |
| <span id="3180">3180</span> |
| <span id="3181">3181</span> |
| <span id="3182">3182</span> |
| <span id="3183">3183</span> |
| <span id="3184">3184</span> |
| <span id="3185">3185</span> |
| <span id="3186">3186</span> |
| <span id="3187">3187</span> |
| <span id="3188">3188</span> |
| <span id="3189">3189</span> |
| <span id="3190">3190</span> |
| <span id="3191">3191</span> |
| <span id="3192">3192</span> |
| <span id="3193">3193</span> |
| <span id="3194">3194</span> |
| <span id="3195">3195</span> |
| <span id="3196">3196</span> |
| <span id="3197">3197</span> |
| <span id="3198">3198</span> |
| <span id="3199">3199</span> |
| <span id="3200">3200</span> |
| <span id="3201">3201</span> |
| <span id="3202">3202</span> |
| <span id="3203">3203</span> |
| <span id="3204">3204</span> |
| <span id="3205">3205</span> |
| <span id="3206">3206</span> |
| <span id="3207">3207</span> |
| <span id="3208">3208</span> |
| <span id="3209">3209</span> |
| <span id="3210">3210</span> |
| <span id="3211">3211</span> |
| <span id="3212">3212</span> |
| <span id="3213">3213</span> |
| <span id="3214">3214</span> |
| <span id="3215">3215</span> |
| <span id="3216">3216</span> |
| <span id="3217">3217</span> |
| <span id="3218">3218</span> |
| <span id="3219">3219</span> |
| <span id="3220">3220</span> |
| <span id="3221">3221</span> |
| <span id="3222">3222</span> |
| <span id="3223">3223</span> |
| <span id="3224">3224</span> |
| <span id="3225">3225</span> |
| <span id="3226">3226</span> |
| <span id="3227">3227</span> |
| <span id="3228">3228</span> |
| <span id="3229">3229</span> |
| <span id="3230">3230</span> |
| <span id="3231">3231</span> |
| <span id="3232">3232</span> |
| <span id="3233">3233</span> |
| <span id="3234">3234</span> |
| <span id="3235">3235</span> |
| <span id="3236">3236</span> |
| <span id="3237">3237</span> |
| <span id="3238">3238</span> |
| <span id="3239">3239</span> |
| <span id="3240">3240</span> |
| <span id="3241">3241</span> |
| <span id="3242">3242</span> |
| <span id="3243">3243</span> |
| <span id="3244">3244</span> |
| <span id="3245">3245</span> |
| <span id="3246">3246</span> |
| <span id="3247">3247</span> |
| <span id="3248">3248</span> |
| <span id="3249">3249</span> |
| <span id="3250">3250</span> |
| <span id="3251">3251</span> |
| <span id="3252">3252</span> |
| <span id="3253">3253</span> |
| <span id="3254">3254</span> |
| <span id="3255">3255</span> |
| <span id="3256">3256</span> |
| <span id="3257">3257</span> |
| <span id="3258">3258</span> |
| <span id="3259">3259</span> |
| <span id="3260">3260</span> |
| <span id="3261">3261</span> |
| <span id="3262">3262</span> |
| <span id="3263">3263</span> |
| <span id="3264">3264</span> |
| <span id="3265">3265</span> |
| <span id="3266">3266</span> |
| <span id="3267">3267</span> |
| <span id="3268">3268</span> |
| <span id="3269">3269</span> |
| <span id="3270">3270</span> |
| <span id="3271">3271</span> |
| <span id="3272">3272</span> |
| <span id="3273">3273</span> |
| <span id="3274">3274</span> |
| <span id="3275">3275</span> |
| <span id="3276">3276</span> |
| <span id="3277">3277</span> |
| <span id="3278">3278</span> |
| <span id="3279">3279</span> |
| <span id="3280">3280</span> |
| <span id="3281">3281</span> |
| <span id="3282">3282</span> |
| <span id="3283">3283</span> |
| <span id="3284">3284</span> |
| <span id="3285">3285</span> |
| <span id="3286">3286</span> |
| <span id="3287">3287</span> |
| <span id="3288">3288</span> |
| <span id="3289">3289</span> |
| <span id="3290">3290</span> |
| <span id="3291">3291</span> |
| <span id="3292">3292</span> |
| <span id="3293">3293</span> |
| <span id="3294">3294</span> |
| <span id="3295">3295</span> |
| <span id="3296">3296</span> |
| <span id="3297">3297</span> |
| <span id="3298">3298</span> |
| <span id="3299">3299</span> |
| <span id="3300">3300</span> |
| <span id="3301">3301</span> |
| <span id="3302">3302</span> |
| <span id="3303">3303</span> |
| <span id="3304">3304</span> |
| <span id="3305">3305</span> |
| <span id="3306">3306</span> |
| <span id="3307">3307</span> |
| <span id="3308">3308</span> |
| <span id="3309">3309</span> |
| <span id="3310">3310</span> |
| <span id="3311">3311</span> |
| <span id="3312">3312</span> |
| <span id="3313">3313</span> |
| <span id="3314">3314</span> |
| <span id="3315">3315</span> |
| <span id="3316">3316</span> |
| <span id="3317">3317</span> |
| <span id="3318">3318</span> |
| <span id="3319">3319</span> |
| <span id="3320">3320</span> |
| <span id="3321">3321</span> |
| <span id="3322">3322</span> |
| <span id="3323">3323</span> |
| <span id="3324">3324</span> |
| <span id="3325">3325</span> |
| <span id="3326">3326</span> |
| <span id="3327">3327</span> |
| <span id="3328">3328</span> |
| <span id="3329">3329</span> |
| <span id="3330">3330</span> |
| <span id="3331">3331</span> |
| <span id="3332">3332</span> |
| <span id="3333">3333</span> |
| <span id="3334">3334</span> |
| <span id="3335">3335</span> |
| <span id="3336">3336</span> |
| <span id="3337">3337</span> |
| <span id="3338">3338</span> |
| <span id="3339">3339</span> |
| <span id="3340">3340</span> |
| <span id="3341">3341</span> |
| <span id="3342">3342</span> |
| <span id="3343">3343</span> |
| <span id="3344">3344</span> |
| <span id="3345">3345</span> |
| <span id="3346">3346</span> |
| <span id="3347">3347</span> |
| <span id="3348">3348</span> |
| <span id="3349">3349</span> |
| <span id="3350">3350</span> |
| <span id="3351">3351</span> |
| <span id="3352">3352</span> |
| <span id="3353">3353</span> |
| <span id="3354">3354</span> |
| <span id="3355">3355</span> |
| <span id="3356">3356</span> |
| <span id="3357">3357</span> |
| <span id="3358">3358</span> |
| <span id="3359">3359</span> |
| <span id="3360">3360</span> |
| <span id="3361">3361</span> |
| <span id="3362">3362</span> |
| <span id="3363">3363</span> |
| <span id="3364">3364</span> |
| <span id="3365">3365</span> |
| <span id="3366">3366</span> |
| <span id="3367">3367</span> |
| <span id="3368">3368</span> |
| <span id="3369">3369</span> |
| <span id="3370">3370</span> |
| <span id="3371">3371</span> |
| <span id="3372">3372</span> |
| <span id="3373">3373</span> |
| <span id="3374">3374</span> |
| <span id="3375">3375</span> |
| <span id="3376">3376</span> |
| <span id="3377">3377</span> |
| <span id="3378">3378</span> |
| <span id="3379">3379</span> |
| <span id="3380">3380</span> |
| <span id="3381">3381</span> |
| <span id="3382">3382</span> |
| <span id="3383">3383</span> |
| <span id="3384">3384</span> |
| <span id="3385">3385</span> |
| <span id="3386">3386</span> |
| <span id="3387">3387</span> |
| <span id="3388">3388</span> |
| <span id="3389">3389</span> |
| <span id="3390">3390</span> |
| <span id="3391">3391</span> |
| <span id="3392">3392</span> |
| <span id="3393">3393</span> |
| <span id="3394">3394</span> |
| <span id="3395">3395</span> |
| <span id="3396">3396</span> |
| <span id="3397">3397</span> |
| <span id="3398">3398</span> |
| <span id="3399">3399</span> |
| <span id="3400">3400</span> |
| <span id="3401">3401</span> |
| <span id="3402">3402</span> |
| <span id="3403">3403</span> |
| <span id="3404">3404</span> |
| <span id="3405">3405</span> |
| <span id="3406">3406</span> |
| <span id="3407">3407</span> |
| <span id="3408">3408</span> |
| <span id="3409">3409</span> |
| <span id="3410">3410</span> |
| <span id="3411">3411</span> |
| <span id="3412">3412</span> |
| <span id="3413">3413</span> |
| <span id="3414">3414</span> |
| <span id="3415">3415</span> |
| <span id="3416">3416</span> |
| <span id="3417">3417</span> |
| <span id="3418">3418</span> |
| <span id="3419">3419</span> |
| <span id="3420">3420</span> |
| <span id="3421">3421</span> |
| <span id="3422">3422</span> |
| <span id="3423">3423</span> |
| <span id="3424">3424</span> |
| <span id="3425">3425</span> |
| <span id="3426">3426</span> |
| <span id="3427">3427</span> |
| <span id="3428">3428</span> |
| <span id="3429">3429</span> |
| <span id="3430">3430</span> |
| <span id="3431">3431</span> |
| <span id="3432">3432</span> |
| <span id="3433">3433</span> |
| <span id="3434">3434</span> |
| <span id="3435">3435</span> |
| <span id="3436">3436</span> |
| <span id="3437">3437</span> |
| <span id="3438">3438</span> |
| <span id="3439">3439</span> |
| <span id="3440">3440</span> |
| <span id="3441">3441</span> |
| <span id="3442">3442</span> |
| <span id="3443">3443</span> |
| <span id="3444">3444</span> |
| <span id="3445">3445</span> |
| <span id="3446">3446</span> |
| <span id="3447">3447</span> |
| <span id="3448">3448</span> |
| <span id="3449">3449</span> |
| <span id="3450">3450</span> |
| <span id="3451">3451</span> |
| <span id="3452">3452</span> |
| <span id="3453">3453</span> |
| <span id="3454">3454</span> |
| <span id="3455">3455</span> |
| <span id="3456">3456</span> |
| <span id="3457">3457</span> |
| <span id="3458">3458</span> |
| <span id="3459">3459</span> |
| <span id="3460">3460</span> |
| <span id="3461">3461</span> |
| <span id="3462">3462</span> |
| <span id="3463">3463</span> |
| <span id="3464">3464</span> |
| <span id="3465">3465</span> |
| <span id="3466">3466</span> |
| <span id="3467">3467</span> |
| <span id="3468">3468</span> |
| <span id="3469">3469</span> |
| <span id="3470">3470</span> |
| <span id="3471">3471</span> |
| <span id="3472">3472</span> |
| <span id="3473">3473</span> |
| <span id="3474">3474</span> |
| <span id="3475">3475</span> |
| <span id="3476">3476</span> |
| <span id="3477">3477</span> |
| <span id="3478">3478</span> |
| <span id="3479">3479</span> |
| <span id="3480">3480</span> |
| <span id="3481">3481</span> |
| <span id="3482">3482</span> |
| <span id="3483">3483</span> |
| <span id="3484">3484</span> |
| <span id="3485">3485</span> |
| <span id="3486">3486</span> |
| <span id="3487">3487</span> |
| <span id="3488">3488</span> |
| <span id="3489">3489</span> |
| <span id="3490">3490</span> |
| <span id="3491">3491</span> |
| <span id="3492">3492</span> |
| <span id="3493">3493</span> |
| <span id="3494">3494</span> |
| <span id="3495">3495</span> |
| <span id="3496">3496</span> |
| <span id="3497">3497</span> |
| <span id="3498">3498</span> |
| <span id="3499">3499</span> |
| <span id="3500">3500</span> |
| <span id="3501">3501</span> |
| <span id="3502">3502</span> |
| <span id="3503">3503</span> |
| <span id="3504">3504</span> |
| <span id="3505">3505</span> |
| <span id="3506">3506</span> |
| <span id="3507">3507</span> |
| <span id="3508">3508</span> |
| <span id="3509">3509</span> |
| <span id="3510">3510</span> |
| <span id="3511">3511</span> |
| <span id="3512">3512</span> |
| <span id="3513">3513</span> |
| <span id="3514">3514</span> |
| <span id="3515">3515</span> |
| <span id="3516">3516</span> |
| <span id="3517">3517</span> |
| <span id="3518">3518</span> |
| <span id="3519">3519</span> |
| <span id="3520">3520</span> |
| <span id="3521">3521</span> |
| <span id="3522">3522</span> |
| <span id="3523">3523</span> |
| <span id="3524">3524</span> |
| <span id="3525">3525</span> |
| <span id="3526">3526</span> |
| <span id="3527">3527</span> |
| <span id="3528">3528</span> |
| <span id="3529">3529</span> |
| <span id="3530">3530</span> |
| <span id="3531">3531</span> |
| </pre><pre class="rust"><code><span class="doccomment">//! Traits for writing parallel programs using an iterator-style interface |
| //! |
| //! You will rarely need to interact with this module directly unless you have |
| //! need to name one of the iterator types. |
| //! |
| //! Parallel iterators make it easy to write iterator-like chains that |
| //! execute in parallel: typically all you have to do is convert the |
| //! first `.iter()` (or `iter_mut()`, `into_iter()`, etc) method into |
| //! `par_iter()` (or `par_iter_mut()`, `into_par_iter()`, etc). For |
| //! example, to compute the sum of the squares of a sequence of |
| //! integers, one might write: |
| //! |
| //! ```rust |
| //! use rayon::prelude::*; |
| //! fn sum_of_squares(input: &[i32]) -> i32 { |
| //! input.par_iter() |
| //! .map(|i| i * i) |
| //! .sum() |
| //! } |
| //! ``` |
| //! |
| //! Or, to increment all the integers in a slice, you could write: |
| //! |
| //! ```rust |
| //! use rayon::prelude::*; |
| //! fn increment_all(input: &mut [i32]) { |
| //! input.par_iter_mut() |
| //! .for_each(|p| *p += 1); |
| //! } |
| //! ``` |
| //! |
| //! To use parallel iterators, first import the traits by adding |
| //! something like `use rayon::prelude::*` to your module. You can |
| //! then call `par_iter`, `par_iter_mut`, or `into_par_iter` to get a |
| //! parallel iterator. Like a [regular iterator][], parallel |
| //! iterators work by first constructing a computation and then |
| //! executing it. |
| //! |
| //! In addition to `par_iter()` and friends, some types offer other |
| //! ways to create (or consume) parallel iterators: |
| //! |
| //! - Slices (`&[T]`, `&mut [T]`) offer methods like `par_split` and |
| //! `par_windows`, as well as various parallel sorting |
| //! operations. See [the `ParallelSlice` trait] for the full list. |
| //! - Strings (`&str`) offer methods like `par_split` and `par_lines`. |
| //! See [the `ParallelString` trait] for the full list. |
| //! - Various collections offer [`par_extend`], which grows a |
| //! collection given a parallel iterator. (If you don't have a |
| //! collection to extend, you can use [`collect()`] to create a new |
| //! one from scratch.) |
| //! |
| //! [the `ParallelSlice` trait]: ../slice/trait.ParallelSlice.html |
| //! [the `ParallelString` trait]: ../str/trait.ParallelString.html |
| //! [`par_extend`]: trait.ParallelExtend.html |
| //! [`collect()`]: trait.ParallelIterator.html#method.collect |
| //! |
| //! To see the full range of methods available on parallel iterators, |
| //! check out the [`ParallelIterator`] and [`IndexedParallelIterator`] |
| //! traits. |
| //! |
| //! If you'd like to build a custom parallel iterator, or to write your own |
| //! combinator, then check out the [split] function and the [plumbing] module. |
| //! |
| //! [regular iterator]: https://doc.rust-lang.org/std/iter/trait.Iterator.html |
| //! [`ParallelIterator`]: trait.ParallelIterator.html |
| //! [`IndexedParallelIterator`]: trait.IndexedParallelIterator.html |
| //! [split]: fn.split.html |
| //! [plumbing]: plumbing/index.html |
| //! |
| //! Note: Several of the `ParallelIterator` methods rely on a `Try` trait which |
| //! has been deliberately obscured from the public API. This trait is intended |
| //! to mirror the unstable `std::ops::Try` with implementations for `Option` and |
| //! `Result`, where `Some`/`Ok` values will let those iterators continue, but |
| //! `None`/`Err` values will exit early. |
| //! |
| //! A note about object safety: It is currently _not_ possible to wrap |
| //! a `ParallelIterator` (or any trait that depends on it) using a |
| //! `Box<dyn ParallelIterator>` or other kind of dynamic allocation, |
| //! because `ParallelIterator` is **not object-safe**. |
| //! (This keeps the implementation simpler and allows extra optimizations.) |
| |
| </span><span class="kw">use </span><span class="self">self</span>::plumbing::<span class="kw-2">*</span>; |
| <span class="kw">use </span><span class="self">self</span>::private::Try; |
| <span class="kw">pub use </span>either::Either; |
| <span class="kw">use </span>std::cmp::{<span class="self">self</span>, Ordering}; |
| <span class="kw">use </span>std::iter::{Product, Sum}; |
| <span class="kw">use </span>std::ops::{Fn, RangeBounds}; |
| |
| <span class="kw">pub mod </span>plumbing; |
| |
| <span class="attribute">#[cfg(test)] |
| </span><span class="kw">mod </span>test; |
| |
| <span class="comment">// There is a method to the madness here: |
| // |
| // - These modules are private but expose certain types to the end-user |
| // (e.g., `enumerate::Enumerate`) -- specifically, the types that appear in the |
| // public API surface of the `ParallelIterator` traits. |
| // - In **this** module, those public types are always used unprefixed, which forces |
| // us to add a `pub use` and helps identify if we missed anything. |
| // - In contrast, items that appear **only** in the body of a method, |
| // e.g. `find::find()`, are always used **prefixed**, so that they |
| // can be readily distinguished. |
| |
| </span><span class="kw">mod </span>chain; |
| <span class="kw">mod </span>chunks; |
| <span class="kw">mod </span>cloned; |
| <span class="kw">mod </span>collect; |
| <span class="kw">mod </span>copied; |
| <span class="kw">mod </span>empty; |
| <span class="kw">mod </span>enumerate; |
| <span class="kw">mod </span>extend; |
| <span class="kw">mod </span>filter; |
| <span class="kw">mod </span>filter_map; |
| <span class="kw">mod </span>find; |
| <span class="kw">mod </span>find_first_last; |
| <span class="kw">mod </span>flat_map; |
| <span class="kw">mod </span>flat_map_iter; |
| <span class="kw">mod </span>flatten; |
| <span class="kw">mod </span>flatten_iter; |
| <span class="kw">mod </span>fold; |
| <span class="kw">mod </span>fold_chunks; |
| <span class="kw">mod </span>fold_chunks_with; |
| <span class="kw">mod </span>for_each; |
| <span class="kw">mod </span>from_par_iter; |
| <span class="kw">mod </span>inspect; |
| <span class="kw">mod </span>interleave; |
| <span class="kw">mod </span>interleave_shortest; |
| <span class="kw">mod </span>intersperse; |
| <span class="kw">mod </span>len; |
| <span class="kw">mod </span>map; |
| <span class="kw">mod </span>map_with; |
| <span class="kw">mod </span>multizip; |
| <span class="kw">mod </span>noop; |
| <span class="kw">mod </span>once; |
| <span class="kw">mod </span>panic_fuse; |
| <span class="kw">mod </span>par_bridge; |
| <span class="kw">mod </span>positions; |
| <span class="kw">mod </span>product; |
| <span class="kw">mod </span>reduce; |
| <span class="kw">mod </span>repeat; |
| <span class="kw">mod </span>rev; |
| <span class="kw">mod </span>skip; |
| <span class="kw">mod </span>skip_any; |
| <span class="kw">mod </span>skip_any_while; |
| <span class="kw">mod </span>splitter; |
| <span class="kw">mod </span>step_by; |
| <span class="kw">mod </span>sum; |
| <span class="kw">mod </span>take; |
| <span class="kw">mod </span>take_any; |
| <span class="kw">mod </span>take_any_while; |
| <span class="kw">mod </span>try_fold; |
| <span class="kw">mod </span>try_reduce; |
| <span class="kw">mod </span>try_reduce_with; |
| <span class="kw">mod </span>unzip; |
| <span class="kw">mod </span>update; |
| <span class="kw">mod </span>while_some; |
| <span class="kw">mod </span>zip; |
| <span class="kw">mod </span>zip_eq; |
| |
| <span class="kw">pub use </span><span class="self">self</span>::{ |
| chain::Chain, |
| chunks::Chunks, |
| cloned::Cloned, |
| copied::Copied, |
| empty::{empty, Empty}, |
| enumerate::Enumerate, |
| filter::Filter, |
| filter_map::FilterMap, |
| flat_map::FlatMap, |
| flat_map_iter::FlatMapIter, |
| flatten::Flatten, |
| flatten_iter::FlattenIter, |
| fold::{Fold, FoldWith}, |
| fold_chunks::FoldChunks, |
| fold_chunks_with::FoldChunksWith, |
| inspect::Inspect, |
| interleave::Interleave, |
| interleave_shortest::InterleaveShortest, |
| intersperse::Intersperse, |
| len::{MaxLen, MinLen}, |
| map::Map, |
| map_with::{MapInit, MapWith}, |
| multizip::MultiZip, |
| once::{once, Once}, |
| panic_fuse::PanicFuse, |
| par_bridge::{IterBridge, ParallelBridge}, |
| positions::Positions, |
| repeat::{repeat, repeatn, Repeat, RepeatN}, |
| rev::Rev, |
| skip::Skip, |
| skip_any::SkipAny, |
| skip_any_while::SkipAnyWhile, |
| splitter::{split, Split}, |
| step_by::StepBy, |
| take::Take, |
| take_any::TakeAny, |
| take_any_while::TakeAnyWhile, |
| try_fold::{TryFold, TryFoldWith}, |
| update::Update, |
| while_some::WhileSome, |
| zip::Zip, |
| zip_eq::ZipEq, |
| }; |
| |
| <span class="doccomment">/// `IntoParallelIterator` implements the conversion to a [`ParallelIterator`]. |
| /// |
| /// By implementing `IntoParallelIterator` for a type, you define how it will |
| /// transformed into an iterator. This is a parallel version of the standard |
| /// library's [`std::iter::IntoIterator`] trait. |
| /// |
| /// [`ParallelIterator`]: trait.ParallelIterator.html |
| /// [`std::iter::IntoIterator`]: https://doc.rust-lang.org/std/iter/trait.IntoIterator.html |
| </span><span class="kw">pub trait </span>IntoParallelIterator { |
| <span class="doccomment">/// The parallel iterator type that will be created. |
| </span><span class="kw">type </span>Iter: ParallelIterator<Item = <span class="self">Self</span>::Item>; |
| |
| <span class="doccomment">/// The type of item that the parallel iterator will produce. |
| </span><span class="kw">type </span>Item: Send; |
| |
| <span class="doccomment">/// Converts `self` into a parallel iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// println!("counting in parallel:"); |
| /// (0..100).into_par_iter() |
| /// .for_each(|i| println!("{}", i)); |
| /// ``` |
| /// |
| /// This conversion is often implicit for arguments to methods like [`zip`]. |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let v: Vec<_> = (0..5).into_par_iter().zip(5..10).collect(); |
| /// assert_eq!(v, [(0, 5), (1, 6), (2, 7), (3, 8), (4, 9)]); |
| /// ``` |
| /// |
| /// [`zip`]: trait.IndexedParallelIterator.html#method.zip |
| </span><span class="kw">fn </span>into_par_iter(<span class="self">self</span>) -> <span class="self">Self</span>::Iter; |
| } |
| |
| <span class="doccomment">/// `IntoParallelRefIterator` implements the conversion to a |
| /// [`ParallelIterator`], providing shared references to the data. |
| /// |
| /// This is a parallel version of the `iter()` method |
| /// defined by various collections. |
| /// |
| /// This trait is automatically implemented |
| /// `for I where &I: IntoParallelIterator`. In most cases, users |
| /// will want to implement [`IntoParallelIterator`] rather than implement |
| /// this trait directly. |
| /// |
| /// [`ParallelIterator`]: trait.ParallelIterator.html |
| /// [`IntoParallelIterator`]: trait.IntoParallelIterator.html |
| </span><span class="kw">pub trait </span>IntoParallelRefIterator<<span class="lifetime">'data</span>> { |
| <span class="doccomment">/// The type of the parallel iterator that will be returned. |
| </span><span class="kw">type </span>Iter: ParallelIterator<Item = <span class="self">Self</span>::Item>; |
| |
| <span class="doccomment">/// The type of item that the parallel iterator will produce. |
| /// This will typically be an `&'data T` reference type. |
| </span><span class="kw">type </span>Item: Send + <span class="lifetime">'data</span>; |
| |
| <span class="doccomment">/// Converts `self` into a parallel iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let v: Vec<_> = (0..100).collect(); |
| /// assert_eq!(v.par_iter().sum::<i32>(), 100 * 99 / 2); |
| /// |
| /// // `v.par_iter()` is shorthand for `(&v).into_par_iter()`, |
| /// // producing the exact same references. |
| /// assert!(v.par_iter().zip(&v) |
| /// .all(|(a, b)| std::ptr::eq(a, b))); |
| /// ``` |
| </span><span class="kw">fn </span>par_iter(<span class="kw-2">&</span><span class="lifetime">'data </span><span class="self">self</span>) -> <span class="self">Self</span>::Iter; |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, I: <span class="lifetime">'data </span>+ <span class="question-mark">?</span>Sized> IntoParallelRefIterator<<span class="lifetime">'data</span>> <span class="kw">for </span>I |
| <span class="kw">where |
| </span><span class="kw-2">&</span><span class="lifetime">'data </span>I: IntoParallelIterator, |
| { |
| <span class="kw">type </span>Iter = <<span class="kw-2">&</span><span class="lifetime">'data </span>I <span class="kw">as </span>IntoParallelIterator>::Iter; |
| <span class="kw">type </span>Item = <<span class="kw-2">&</span><span class="lifetime">'data </span>I <span class="kw">as </span>IntoParallelIterator>::Item; |
| |
| <span class="kw">fn </span>par_iter(<span class="kw-2">&</span><span class="lifetime">'data </span><span class="self">self</span>) -> <span class="self">Self</span>::Iter { |
| <span class="self">self</span>.into_par_iter() |
| } |
| } |
| |
| <span class="doccomment">/// `IntoParallelRefMutIterator` implements the conversion to a |
| /// [`ParallelIterator`], providing mutable references to the data. |
| /// |
| /// This is a parallel version of the `iter_mut()` method |
| /// defined by various collections. |
| /// |
| /// This trait is automatically implemented |
| /// `for I where &mut I: IntoParallelIterator`. In most cases, users |
| /// will want to implement [`IntoParallelIterator`] rather than implement |
| /// this trait directly. |
| /// |
| /// [`ParallelIterator`]: trait.ParallelIterator.html |
| /// [`IntoParallelIterator`]: trait.IntoParallelIterator.html |
| </span><span class="kw">pub trait </span>IntoParallelRefMutIterator<<span class="lifetime">'data</span>> { |
| <span class="doccomment">/// The type of iterator that will be created. |
| </span><span class="kw">type </span>Iter: ParallelIterator<Item = <span class="self">Self</span>::Item>; |
| |
| <span class="doccomment">/// The type of item that will be produced; this is typically an |
| /// `&'data mut T` reference. |
| </span><span class="kw">type </span>Item: Send + <span class="lifetime">'data</span>; |
| |
| <span class="doccomment">/// Creates the parallel iterator from `self`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = vec![0usize; 5]; |
| /// v.par_iter_mut().enumerate().for_each(|(i, x)| *x = i); |
| /// assert_eq!(v, [0, 1, 2, 3, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>par_iter_mut(<span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span><span class="self">self</span>) -> <span class="self">Self</span>::Iter; |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'data</span>, I: <span class="lifetime">'data </span>+ <span class="question-mark">?</span>Sized> IntoParallelRefMutIterator<<span class="lifetime">'data</span>> <span class="kw">for </span>I |
| <span class="kw">where |
| </span><span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>I: IntoParallelIterator, |
| { |
| <span class="kw">type </span>Iter = <<span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>I <span class="kw">as </span>IntoParallelIterator>::Iter; |
| <span class="kw">type </span>Item = <<span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span>I <span class="kw">as </span>IntoParallelIterator>::Item; |
| |
| <span class="kw">fn </span>par_iter_mut(<span class="kw-2">&</span><span class="lifetime">'data </span><span class="kw-2">mut </span><span class="self">self</span>) -> <span class="self">Self</span>::Iter { |
| <span class="self">self</span>.into_par_iter() |
| } |
| } |
| |
| <span class="doccomment">/// Parallel version of the standard iterator trait. |
| /// |
| /// The combinators on this trait are available on **all** parallel |
| /// iterators. Additional methods can be found on the |
| /// [`IndexedParallelIterator`] trait: those methods are only |
| /// available for parallel iterators where the number of items is |
| /// known in advance (so, e.g., after invoking `filter`, those methods |
| /// become unavailable). |
| /// |
| /// For examples of using parallel iterators, see [the docs on the |
| /// `iter` module][iter]. |
| /// |
| /// [iter]: index.html |
| /// [`IndexedParallelIterator`]: trait.IndexedParallelIterator.html |
| </span><span class="kw">pub trait </span>ParallelIterator: Sized + Send { |
| <span class="doccomment">/// The type of item that this parallel iterator produces. |
| /// For example, if you use the [`for_each`] method, this is the type of |
| /// item that your closure will be invoked with. |
| /// |
| /// [`for_each`]: #method.for_each |
| </span><span class="kw">type </span>Item: Send; |
| |
| <span class="doccomment">/// Executes `OP` on each item produced by the iterator, in parallel. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// (0..100).into_par_iter().for_each(|x| println!("{:?}", x)); |
| /// ``` |
| </span><span class="kw">fn </span>for_each<OP>(<span class="self">self</span>, op: OP) |
| <span class="kw">where |
| </span>OP: Fn(<span class="self">Self</span>::Item) + Sync + Send, |
| { |
| for_each::for_each(<span class="self">self</span>, <span class="kw-2">&</span>op) |
| } |
| |
| <span class="doccomment">/// Executes `OP` on the given `init` value with each item produced by |
| /// the iterator, in parallel. |
| /// |
| /// The `init` value will be cloned only as needed to be paired with |
| /// the group of items in each rayon job. It does not require the type |
| /// to be `Sync`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use std::sync::mpsc::channel; |
| /// use rayon::prelude::*; |
| /// |
| /// let (sender, receiver) = channel(); |
| /// |
| /// (0..5).into_par_iter().for_each_with(sender, |s, x| s.send(x).unwrap()); |
| /// |
| /// let mut res: Vec<_> = receiver.iter().collect(); |
| /// |
| /// res.sort(); |
| /// |
| /// assert_eq!(&res[..], &[0, 1, 2, 3, 4]) |
| /// ``` |
| </span><span class="kw">fn </span>for_each_with<OP, T>(<span class="self">self</span>, init: T, op: OP) |
| <span class="kw">where |
| </span>OP: Fn(<span class="kw-2">&mut </span>T, <span class="self">Self</span>::Item) + Sync + Send, |
| T: Send + Clone, |
| { |
| <span class="self">self</span>.map_with(init, op).collect() |
| } |
| |
| <span class="doccomment">/// Executes `OP` on a value returned by `init` with each item produced by |
| /// the iterator, in parallel. |
| /// |
| /// The `init` function will be called only as needed for a value to be |
| /// paired with the group of items in each rayon job. There is no |
| /// constraint on that returned type at all! |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rand::Rng; |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = vec![0u8; 1_000_000]; |
| /// |
| /// v.par_chunks_mut(1000) |
| /// .for_each_init( |
| /// || rand::thread_rng(), |
| /// |rng, chunk| rng.fill(chunk), |
| /// ); |
| /// |
| /// // There's a remote chance that this will fail... |
| /// for i in 0u8..=255 { |
| /// assert!(v.contains(&i)); |
| /// } |
| /// ``` |
| </span><span class="kw">fn </span>for_each_init<OP, INIT, T>(<span class="self">self</span>, init: INIT, op: OP) |
| <span class="kw">where |
| </span>OP: Fn(<span class="kw-2">&mut </span>T, <span class="self">Self</span>::Item) + Sync + Send, |
| INIT: Fn() -> T + Sync + Send, |
| { |
| <span class="self">self</span>.map_init(init, op).collect() |
| } |
| |
| <span class="doccomment">/// Executes a fallible `OP` on each item produced by the iterator, in parallel. |
| /// |
| /// If the `OP` returns `Result::Err` or `Option::None`, we will attempt to |
| /// stop processing the rest of the items in the iterator as soon as |
| /// possible, and we will return that terminating value. Otherwise, we will |
| /// return an empty `Result::Ok(())` or `Option::Some(())`. If there are |
| /// multiple errors in parallel, it is not specified which will be returned. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::io::{self, Write}; |
| /// |
| /// // This will stop iteration early if there's any write error, like |
| /// // having piped output get closed on the other end. |
| /// (0..100).into_par_iter() |
| /// .try_for_each(|x| writeln!(io::stdout(), "{:?}", x)) |
| /// .expect("expected no write errors"); |
| /// ``` |
| </span><span class="kw">fn </span>try_for_each<OP, R>(<span class="self">self</span>, op: OP) -> R |
| <span class="kw">where |
| </span>OP: Fn(<span class="self">Self</span>::Item) -> R + Sync + Send, |
| R: Try<Output = ()> + Send, |
| { |
| <span class="kw">fn </span>ok<R: Try<Output = ()>>(<span class="kw">_</span>: (), <span class="kw">_</span>: ()) -> R { |
| R::from_output(()) |
| } |
| |
| <span class="self">self</span>.map(op).try_reduce(<()>::default, ok) |
| } |
| |
| <span class="doccomment">/// Executes a fallible `OP` on the given `init` value with each item |
| /// produced by the iterator, in parallel. |
| /// |
| /// This combines the `init` semantics of [`for_each_with()`] and the |
| /// failure semantics of [`try_for_each()`]. |
| /// |
| /// [`for_each_with()`]: #method.for_each_with |
| /// [`try_for_each()`]: #method.try_for_each |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use std::sync::mpsc::channel; |
| /// use rayon::prelude::*; |
| /// |
| /// let (sender, receiver) = channel(); |
| /// |
| /// (0..5).into_par_iter() |
| /// .try_for_each_with(sender, |s, x| s.send(x)) |
| /// .expect("expected no send errors"); |
| /// |
| /// let mut res: Vec<_> = receiver.iter().collect(); |
| /// |
| /// res.sort(); |
| /// |
| /// assert_eq!(&res[..], &[0, 1, 2, 3, 4]) |
| /// ``` |
| </span><span class="kw">fn </span>try_for_each_with<OP, T, R>(<span class="self">self</span>, init: T, op: OP) -> R |
| <span class="kw">where |
| </span>OP: Fn(<span class="kw-2">&mut </span>T, <span class="self">Self</span>::Item) -> R + Sync + Send, |
| T: Send + Clone, |
| R: Try<Output = ()> + Send, |
| { |
| <span class="kw">fn </span>ok<R: Try<Output = ()>>(<span class="kw">_</span>: (), <span class="kw">_</span>: ()) -> R { |
| R::from_output(()) |
| } |
| |
| <span class="self">self</span>.map_with(init, op).try_reduce(<()>::default, ok) |
| } |
| |
| <span class="doccomment">/// Executes a fallible `OP` on a value returned by `init` with each item |
| /// produced by the iterator, in parallel. |
| /// |
| /// This combines the `init` semantics of [`for_each_init()`] and the |
| /// failure semantics of [`try_for_each()`]. |
| /// |
| /// [`for_each_init()`]: #method.for_each_init |
| /// [`try_for_each()`]: #method.try_for_each |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rand::Rng; |
| /// use rayon::prelude::*; |
| /// |
| /// let mut v = vec![0u8; 1_000_000]; |
| /// |
| /// v.par_chunks_mut(1000) |
| /// .try_for_each_init( |
| /// || rand::thread_rng(), |
| /// |rng, chunk| rng.try_fill(chunk), |
| /// ) |
| /// .expect("expected no rand errors"); |
| /// |
| /// // There's a remote chance that this will fail... |
| /// for i in 0u8..=255 { |
| /// assert!(v.contains(&i)); |
| /// } |
| /// ``` |
| </span><span class="kw">fn </span>try_for_each_init<OP, INIT, T, R>(<span class="self">self</span>, init: INIT, op: OP) -> R |
| <span class="kw">where |
| </span>OP: Fn(<span class="kw-2">&mut </span>T, <span class="self">Self</span>::Item) -> R + Sync + Send, |
| INIT: Fn() -> T + Sync + Send, |
| R: Try<Output = ()> + Send, |
| { |
| <span class="kw">fn </span>ok<R: Try<Output = ()>>(<span class="kw">_</span>: (), <span class="kw">_</span>: ()) -> R { |
| R::from_output(()) |
| } |
| |
| <span class="self">self</span>.map_init(init, op).try_reduce(<()>::default, ok) |
| } |
| |
| <span class="doccomment">/// Counts the number of items in this parallel iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let count = (0..100).into_par_iter().count(); |
| /// |
| /// assert_eq!(count, 100); |
| /// ``` |
| </span><span class="kw">fn </span>count(<span class="self">self</span>) -> usize { |
| <span class="kw">fn </span>one<T>(<span class="kw">_</span>: T) -> usize { |
| <span class="number">1 |
| </span>} |
| |
| <span class="self">self</span>.map(one).sum() |
| } |
| |
| <span class="doccomment">/// Applies `map_op` to each item of this iterator, producing a new |
| /// iterator with the results. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut par_iter = (0..5).into_par_iter().map(|x| x * 2); |
| /// |
| /// let doubles: Vec<_> = par_iter.collect(); |
| /// |
| /// assert_eq!(&doubles[..], &[0, 2, 4, 6, 8]); |
| /// ``` |
| </span><span class="kw">fn </span>map<F, R>(<span class="self">self</span>, map_op: F) -> Map<<span class="self">Self</span>, F> |
| <span class="kw">where |
| </span>F: Fn(<span class="self">Self</span>::Item) -> R + Sync + Send, |
| R: Send, |
| { |
| Map::new(<span class="self">self</span>, map_op) |
| } |
| |
| <span class="doccomment">/// Applies `map_op` to the given `init` value with each item of this |
| /// iterator, producing a new iterator with the results. |
| /// |
| /// The `init` value will be cloned only as needed to be paired with |
| /// the group of items in each rayon job. It does not require the type |
| /// to be `Sync`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use std::sync::mpsc::channel; |
| /// use rayon::prelude::*; |
| /// |
| /// let (sender, receiver) = channel(); |
| /// |
| /// let a: Vec<_> = (0..5) |
| /// .into_par_iter() // iterating over i32 |
| /// .map_with(sender, |s, x| { |
| /// s.send(x).unwrap(); // sending i32 values through the channel |
| /// x // returning i32 |
| /// }) |
| /// .collect(); // collecting the returned values into a vector |
| /// |
| /// let mut b: Vec<_> = receiver.iter() // iterating over the values in the channel |
| /// .collect(); // and collecting them |
| /// b.sort(); |
| /// |
| /// assert_eq!(a, b); |
| /// ``` |
| </span><span class="kw">fn </span>map_with<F, T, R>(<span class="self">self</span>, init: T, map_op: F) -> MapWith<<span class="self">Self</span>, T, F> |
| <span class="kw">where |
| </span>F: Fn(<span class="kw-2">&mut </span>T, <span class="self">Self</span>::Item) -> R + Sync + Send, |
| T: Send + Clone, |
| R: Send, |
| { |
| MapWith::new(<span class="self">self</span>, init, map_op) |
| } |
| |
| <span class="doccomment">/// Applies `map_op` to a value returned by `init` with each item of this |
| /// iterator, producing a new iterator with the results. |
| /// |
| /// The `init` function will be called only as needed for a value to be |
| /// paired with the group of items in each rayon job. There is no |
| /// constraint on that returned type at all! |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rand::Rng; |
| /// use rayon::prelude::*; |
| /// |
| /// let a: Vec<_> = (1i32..1_000_000) |
| /// .into_par_iter() |
| /// .map_init( |
| /// || rand::thread_rng(), // get the thread-local RNG |
| /// |rng, x| if rng.gen() { // randomly negate items |
| /// -x |
| /// } else { |
| /// x |
| /// }, |
| /// ).collect(); |
| /// |
| /// // There's a remote chance that this will fail... |
| /// assert!(a.iter().any(|&x| x < 0)); |
| /// assert!(a.iter().any(|&x| x > 0)); |
| /// ``` |
| </span><span class="kw">fn </span>map_init<F, INIT, T, R>(<span class="self">self</span>, init: INIT, map_op: F) -> MapInit<<span class="self">Self</span>, INIT, F> |
| <span class="kw">where |
| </span>F: Fn(<span class="kw-2">&mut </span>T, <span class="self">Self</span>::Item) -> R + Sync + Send, |
| INIT: Fn() -> T + Sync + Send, |
| R: Send, |
| { |
| MapInit::new(<span class="self">self</span>, init, map_op) |
| } |
| |
| <span class="doccomment">/// Creates an iterator which clones all of its elements. This may be |
| /// useful when you have an iterator over `&T`, but you need `T`, and |
| /// that type implements `Clone`. See also [`copied()`]. |
| /// |
| /// [`copied()`]: #method.copied |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3]; |
| /// |
| /// let v_cloned: Vec<_> = a.par_iter().cloned().collect(); |
| /// |
| /// // cloned is the same as .map(|&x| x), for integers |
| /// let v_map: Vec<_> = a.par_iter().map(|&x| x).collect(); |
| /// |
| /// assert_eq!(v_cloned, vec![1, 2, 3]); |
| /// assert_eq!(v_map, vec![1, 2, 3]); |
| /// ``` |
| </span><span class="kw">fn </span>cloned<<span class="lifetime">'a</span>, T>(<span class="self">self</span>) -> Cloned<<span class="self">Self</span>> |
| <span class="kw">where |
| </span>T: <span class="lifetime">'a </span>+ Clone + Send, |
| <span class="self">Self</span>: ParallelIterator<Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T>, |
| { |
| Cloned::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Creates an iterator which copies all of its elements. This may be |
| /// useful when you have an iterator over `&T`, but you need `T`, and |
| /// that type implements `Copy`. See also [`cloned()`]. |
| /// |
| /// [`cloned()`]: #method.cloned |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3]; |
| /// |
| /// let v_copied: Vec<_> = a.par_iter().copied().collect(); |
| /// |
| /// // copied is the same as .map(|&x| x), for integers |
| /// let v_map: Vec<_> = a.par_iter().map(|&x| x).collect(); |
| /// |
| /// assert_eq!(v_copied, vec![1, 2, 3]); |
| /// assert_eq!(v_map, vec![1, 2, 3]); |
| /// ``` |
| </span><span class="kw">fn </span>copied<<span class="lifetime">'a</span>, T>(<span class="self">self</span>) -> Copied<<span class="self">Self</span>> |
| <span class="kw">where |
| </span>T: <span class="lifetime">'a </span>+ Copy + Send, |
| <span class="self">Self</span>: ParallelIterator<Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T>, |
| { |
| Copied::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Applies `inspect_op` to a reference to each item of this iterator, |
| /// producing a new iterator passing through the original items. This is |
| /// often useful for debugging to see what's happening in iterator stages. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 4, 2, 3]; |
| /// |
| /// // this iterator sequence is complex. |
| /// let sum = a.par_iter() |
| /// .cloned() |
| /// .filter(|&x| x % 2 == 0) |
| /// .reduce(|| 0, |sum, i| sum + i); |
| /// |
| /// println!("{}", sum); |
| /// |
| /// // let's add some inspect() calls to investigate what's happening |
| /// let sum = a.par_iter() |
| /// .cloned() |
| /// .inspect(|x| println!("about to filter: {}", x)) |
| /// .filter(|&x| x % 2 == 0) |
| /// .inspect(|x| println!("made it through filter: {}", x)) |
| /// .reduce(|| 0, |sum, i| sum + i); |
| /// |
| /// println!("{}", sum); |
| /// ``` |
| </span><span class="kw">fn </span>inspect<OP>(<span class="self">self</span>, inspect_op: OP) -> Inspect<<span class="self">Self</span>, OP> |
| <span class="kw">where |
| </span>OP: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) + Sync + Send, |
| { |
| Inspect::new(<span class="self">self</span>, inspect_op) |
| } |
| |
| <span class="doccomment">/// Mutates each item of this iterator before yielding it. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let par_iter = (0..5).into_par_iter().update(|x| {*x *= 2;}); |
| /// |
| /// let doubles: Vec<_> = par_iter.collect(); |
| /// |
| /// assert_eq!(&doubles[..], &[0, 2, 4, 6, 8]); |
| /// ``` |
| </span><span class="kw">fn </span>update<F>(<span class="self">self</span>, update_op: F) -> Update<<span class="self">Self</span>, F> |
| <span class="kw">where |
| </span>F: Fn(<span class="kw-2">&mut </span><span class="self">Self</span>::Item) + Sync + Send, |
| { |
| Update::new(<span class="self">self</span>, update_op) |
| } |
| |
| <span class="doccomment">/// Applies `filter_op` to each item of this iterator, producing a new |
| /// iterator with only the items that gave `true` results. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut par_iter = (0..10).into_par_iter().filter(|x| x % 2 == 0); |
| /// |
| /// let even_numbers: Vec<_> = par_iter.collect(); |
| /// |
| /// assert_eq!(&even_numbers[..], &[0, 2, 4, 6, 8]); |
| /// ``` |
| </span><span class="kw">fn </span>filter<P>(<span class="self">self</span>, filter_op: P) -> Filter<<span class="self">Self</span>, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| Filter::new(<span class="self">self</span>, filter_op) |
| } |
| |
| <span class="doccomment">/// Applies `filter_op` to each item of this iterator to get an `Option`, |
| /// producing a new iterator with only the items from `Some` results. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut par_iter = (0..10).into_par_iter() |
| /// .filter_map(|x| { |
| /// if x % 2 == 0 { Some(x * 3) } |
| /// else { None } |
| /// }); |
| /// |
| /// let even_numbers: Vec<_> = par_iter.collect(); |
| /// |
| /// assert_eq!(&even_numbers[..], &[0, 6, 12, 18, 24]); |
| /// ``` |
| </span><span class="kw">fn </span>filter_map<P, R>(<span class="self">self</span>, filter_op: P) -> FilterMap<<span class="self">Self</span>, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> <span class="prelude-ty">Option</span><R> + Sync + Send, |
| R: Send, |
| { |
| FilterMap::new(<span class="self">self</span>, filter_op) |
| } |
| |
| <span class="doccomment">/// Applies `map_op` to each item of this iterator to get nested parallel iterators, |
| /// producing a new parallel iterator that flattens these back into one. |
| /// |
| /// See also [`flat_map_iter`](#method.flat_map_iter). |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [[1, 2], [3, 4], [5, 6], [7, 8]]; |
| /// |
| /// let par_iter = a.par_iter().cloned().flat_map(|a| a.to_vec()); |
| /// |
| /// let vec: Vec<_> = par_iter.collect(); |
| /// |
| /// assert_eq!(&vec[..], &[1, 2, 3, 4, 5, 6, 7, 8]); |
| /// ``` |
| </span><span class="kw">fn </span>flat_map<F, PI>(<span class="self">self</span>, map_op: F) -> FlatMap<<span class="self">Self</span>, F> |
| <span class="kw">where |
| </span>F: Fn(<span class="self">Self</span>::Item) -> PI + Sync + Send, |
| PI: IntoParallelIterator, |
| { |
| FlatMap::new(<span class="self">self</span>, map_op) |
| } |
| |
| <span class="doccomment">/// Applies `map_op` to each item of this iterator to get nested serial iterators, |
| /// producing a new parallel iterator that flattens these back into one. |
| /// |
| /// # `flat_map_iter` versus `flat_map` |
| /// |
| /// These two methods are similar but behave slightly differently. With [`flat_map`], |
| /// each of the nested iterators must be a parallel iterator, and they will be further |
| /// split up with nested parallelism. With `flat_map_iter`, each nested iterator is a |
| /// sequential `Iterator`, and we only parallelize _between_ them, while the items |
| /// produced by each nested iterator are processed sequentially. |
| /// |
| /// When choosing between these methods, consider whether nested parallelism suits the |
| /// potential iterators at hand. If there's little computation involved, or its length |
| /// is much less than the outer parallel iterator, then it may perform better to avoid |
| /// the overhead of parallelism, just flattening sequentially with `flat_map_iter`. |
| /// If there is a lot of computation, potentially outweighing the outer parallel |
| /// iterator, then the nested parallelism of `flat_map` may be worthwhile. |
| /// |
| /// [`flat_map`]: #method.flat_map |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::cell::RefCell; |
| /// |
| /// let a = [[1, 2], [3, 4], [5, 6], [7, 8]]; |
| /// |
| /// let par_iter = a.par_iter().flat_map_iter(|a| { |
| /// // The serial iterator doesn't have to be thread-safe, just its items. |
| /// let cell_iter = RefCell::new(a.iter().cloned()); |
| /// std::iter::from_fn(move || cell_iter.borrow_mut().next()) |
| /// }); |
| /// |
| /// let vec: Vec<_> = par_iter.collect(); |
| /// |
| /// assert_eq!(&vec[..], &[1, 2, 3, 4, 5, 6, 7, 8]); |
| /// ``` |
| </span><span class="kw">fn </span>flat_map_iter<F, SI>(<span class="self">self</span>, map_op: F) -> FlatMapIter<<span class="self">Self</span>, F> |
| <span class="kw">where |
| </span>F: Fn(<span class="self">Self</span>::Item) -> SI + Sync + Send, |
| SI: IntoIterator, |
| SI::Item: Send, |
| { |
| FlatMapIter::new(<span class="self">self</span>, map_op) |
| } |
| |
| <span class="doccomment">/// An adaptor that flattens parallel-iterable `Item`s into one large iterator. |
| /// |
| /// See also [`flatten_iter`](#method.flatten_iter). |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let x: Vec<Vec<_>> = vec![vec![1, 2], vec![3, 4]]; |
| /// let y: Vec<_> = x.into_par_iter().flatten().collect(); |
| /// |
| /// assert_eq!(y, vec![1, 2, 3, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>flatten(<span class="self">self</span>) -> Flatten<<span class="self">Self</span>> |
| <span class="kw">where |
| </span><span class="self">Self</span>::Item: IntoParallelIterator, |
| { |
| Flatten::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// An adaptor that flattens serial-iterable `Item`s into one large iterator. |
| /// |
| /// See also [`flatten`](#method.flatten) and the analogous comparison of |
| /// [`flat_map_iter` versus `flat_map`](#flat_map_iter-versus-flat_map). |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let x: Vec<Vec<_>> = vec![vec![1, 2], vec![3, 4]]; |
| /// let iters: Vec<_> = x.into_iter().map(Vec::into_iter).collect(); |
| /// let y: Vec<_> = iters.into_par_iter().flatten_iter().collect(); |
| /// |
| /// assert_eq!(y, vec![1, 2, 3, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>flatten_iter(<span class="self">self</span>) -> FlattenIter<<span class="self">Self</span>> |
| <span class="kw">where |
| </span><span class="self">Self</span>::Item: IntoIterator, |
| <<span class="self">Self</span>::Item <span class="kw">as </span>IntoIterator>::Item: Send, |
| { |
| FlattenIter::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Reduces the items in the iterator into one item using `op`. |
| /// The argument `identity` should be a closure that can produce |
| /// "identity" value which may be inserted into the sequence as |
| /// needed to create opportunities for parallel execution. So, for |
| /// example, if you are doing a summation, then `identity()` ought |
| /// to produce something that represents the zero for your type |
| /// (but consider just calling `sum()` in that case). |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// // Iterate over a sequence of pairs `(x0, y0), ..., (xN, yN)` |
| /// // and use reduce to compute one pair `(x0 + ... + xN, y0 + ... + yN)` |
| /// // where the first/second elements are summed separately. |
| /// use rayon::prelude::*; |
| /// let sums = [(0, 1), (5, 6), (16, 2), (8, 9)] |
| /// .par_iter() // iterating over &(i32, i32) |
| /// .cloned() // iterating over (i32, i32) |
| /// .reduce(|| (0, 0), // the "identity" is 0 in both columns |
| /// |a, b| (a.0 + b.0, a.1 + b.1)); |
| /// assert_eq!(sums, (0 + 5 + 16 + 8, 1 + 6 + 2 + 9)); |
| /// ``` |
| /// |
| /// **Note:** unlike a sequential `fold` operation, the order in |
| /// which `op` will be applied to reduce the result is not fully |
| /// specified. So `op` should be [associative] or else the results |
| /// will be non-deterministic. And of course `identity()` should |
| /// produce a true identity. |
| /// |
| /// [associative]: https://en.wikipedia.org/wiki/Associative_property |
| </span><span class="kw">fn </span>reduce<OP, ID>(<span class="self">self</span>, identity: ID, op: OP) -> <span class="self">Self</span>::Item |
| <span class="kw">where |
| </span>OP: Fn(<span class="self">Self</span>::Item, <span class="self">Self</span>::Item) -> <span class="self">Self</span>::Item + Sync + Send, |
| ID: Fn() -> <span class="self">Self</span>::Item + Sync + Send, |
| { |
| reduce::reduce(<span class="self">self</span>, identity, op) |
| } |
| |
| <span class="doccomment">/// Reduces the items in the iterator into one item using `op`. |
| /// If the iterator is empty, `None` is returned; otherwise, |
| /// `Some` is returned. |
| /// |
| /// This version of `reduce` is simple but somewhat less |
| /// efficient. If possible, it is better to call `reduce()`, which |
| /// requires an identity element. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let sums = [(0, 1), (5, 6), (16, 2), (8, 9)] |
| /// .par_iter() // iterating over &(i32, i32) |
| /// .cloned() // iterating over (i32, i32) |
| /// .reduce_with(|a, b| (a.0 + b.0, a.1 + b.1)) |
| /// .unwrap(); |
| /// assert_eq!(sums, (0 + 5 + 16 + 8, 1 + 6 + 2 + 9)); |
| /// ``` |
| /// |
| /// **Note:** unlike a sequential `fold` operation, the order in |
| /// which `op` will be applied to reduce the result is not fully |
| /// specified. So `op` should be [associative] or else the results |
| /// will be non-deterministic. |
| /// |
| /// [associative]: https://en.wikipedia.org/wiki/Associative_property |
| </span><span class="kw">fn </span>reduce_with<OP>(<span class="self">self</span>, op: OP) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>OP: Fn(<span class="self">Self</span>::Item, <span class="self">Self</span>::Item) -> <span class="self">Self</span>::Item + Sync + Send, |
| { |
| <span class="kw">fn </span>opt_fold<T>(op: <span class="kw">impl </span>Fn(T, T) -> T) -> <span class="kw">impl </span>Fn(<span class="prelude-ty">Option</span><T>, T) -> <span class="prelude-ty">Option</span><T> { |
| <span class="kw">move </span>|opt_a, b| <span class="kw">match </span>opt_a { |
| <span class="prelude-val">Some</span>(a) => <span class="prelude-val">Some</span>(op(a, b)), |
| <span class="prelude-val">None </span>=> <span class="prelude-val">Some</span>(b), |
| } |
| } |
| |
| <span class="kw">fn </span>opt_reduce<T>(op: <span class="kw">impl </span>Fn(T, T) -> T) -> <span class="kw">impl </span>Fn(<span class="prelude-ty">Option</span><T>, <span class="prelude-ty">Option</span><T>) -> <span class="prelude-ty">Option</span><T> { |
| <span class="kw">move </span>|opt_a, opt_b| <span class="kw">match </span>(opt_a, opt_b) { |
| (<span class="prelude-val">Some</span>(a), <span class="prelude-val">Some</span>(b)) => <span class="prelude-val">Some</span>(op(a, b)), |
| (<span class="prelude-val">Some</span>(v), <span class="prelude-val">None</span>) | (<span class="prelude-val">None</span>, <span class="prelude-val">Some</span>(v)) => <span class="prelude-val">Some</span>(v), |
| (<span class="prelude-val">None</span>, <span class="prelude-val">None</span>) => <span class="prelude-val">None</span>, |
| } |
| } |
| |
| <span class="self">self</span>.fold(<<span class="kw">_</span>>::default, opt_fold(<span class="kw-2">&</span>op)) |
| .reduce(<<span class="kw">_</span>>::default, opt_reduce(<span class="kw-2">&</span>op)) |
| } |
| |
| <span class="doccomment">/// Reduces the items in the iterator into one item using a fallible `op`. |
| /// The `identity` argument is used the same way as in [`reduce()`]. |
| /// |
| /// [`reduce()`]: #method.reduce |
| /// |
| /// If a `Result::Err` or `Option::None` item is found, or if `op` reduces |
| /// to one, we will attempt to stop processing the rest of the items in the |
| /// iterator as soon as possible, and we will return that terminating value. |
| /// Otherwise, we will return the final reduced `Result::Ok(T)` or |
| /// `Option::Some(T)`. If there are multiple errors in parallel, it is not |
| /// specified which will be returned. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// // Compute the sum of squares, being careful about overflow. |
| /// fn sum_squares<I: IntoParallelIterator<Item = i32>>(iter: I) -> Option<i32> { |
| /// iter.into_par_iter() |
| /// .map(|i| i.checked_mul(i)) // square each item, |
| /// .try_reduce(|| 0, i32::checked_add) // and add them up! |
| /// } |
| /// assert_eq!(sum_squares(0..5), Some(0 + 1 + 4 + 9 + 16)); |
| /// |
| /// // The sum might overflow |
| /// assert_eq!(sum_squares(0..10_000), None); |
| /// |
| /// // Or the squares might overflow before it even reaches `try_reduce` |
| /// assert_eq!(sum_squares(1_000_000..1_000_001), None); |
| /// ``` |
| </span><span class="kw">fn </span>try_reduce<T, OP, ID>(<span class="self">self</span>, identity: ID, op: OP) -> <span class="self">Self</span>::Item |
| <span class="kw">where |
| </span>OP: Fn(T, T) -> <span class="self">Self</span>::Item + Sync + Send, |
| ID: Fn() -> T + Sync + Send, |
| <span class="self">Self</span>::Item: Try<Output = T>, |
| { |
| try_reduce::try_reduce(<span class="self">self</span>, identity, op) |
| } |
| |
| <span class="doccomment">/// Reduces the items in the iterator into one item using a fallible `op`. |
| /// |
| /// Like [`reduce_with()`], if the iterator is empty, `None` is returned; |
| /// otherwise, `Some` is returned. Beyond that, it behaves like |
| /// [`try_reduce()`] for handling `Err`/`None`. |
| /// |
| /// [`reduce_with()`]: #method.reduce_with |
| /// [`try_reduce()`]: #method.try_reduce |
| /// |
| /// For instance, with `Option` items, the return value may be: |
| /// - `None`, the iterator was empty |
| /// - `Some(None)`, we stopped after encountering `None`. |
| /// - `Some(Some(x))`, the entire iterator reduced to `x`. |
| /// |
| /// With `Result` items, the nesting is more obvious: |
| /// - `None`, the iterator was empty |
| /// - `Some(Err(e))`, we stopped after encountering an error `e`. |
| /// - `Some(Ok(x))`, the entire iterator reduced to `x`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let files = ["/dev/null", "/does/not/exist"]; |
| /// |
| /// // Find the biggest file |
| /// files.into_par_iter() |
| /// .map(|path| std::fs::metadata(path).map(|m| (path, m.len()))) |
| /// .try_reduce_with(|a, b| { |
| /// Ok(if a.1 >= b.1 { a } else { b }) |
| /// }) |
| /// .expect("Some value, since the iterator is not empty") |
| /// .expect_err("not found"); |
| /// ``` |
| </span><span class="kw">fn </span>try_reduce_with<T, OP>(<span class="self">self</span>, op: OP) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>OP: Fn(T, T) -> <span class="self">Self</span>::Item + Sync + Send, |
| <span class="self">Self</span>::Item: Try<Output = T>, |
| { |
| try_reduce_with::try_reduce_with(<span class="self">self</span>, op) |
| } |
| |
| <span class="doccomment">/// Parallel fold is similar to sequential fold except that the |
| /// sequence of items may be subdivided before it is |
| /// folded. Consider a list of numbers like `22 3 77 89 46`. If |
| /// you used sequential fold to add them (`fold(0, |a,b| a+b)`, |
| /// you would wind up first adding 0 + 22, then 22 + 3, then 25 + |
| /// 77, and so forth. The **parallel fold** works similarly except |
| /// that it first breaks up your list into sublists, and hence |
| /// instead of yielding up a single sum at the end, it yields up |
| /// multiple sums. The number of results is nondeterministic, as |
| /// is the point where the breaks occur. |
| /// |
| /// So if we did the same parallel fold (`fold(0, |a,b| a+b)`) on |
| /// our example list, we might wind up with a sequence of two numbers, |
| /// like so: |
| /// |
| /// ```notrust |
| /// 22 3 77 89 46 |
| /// | | |
| /// 102 135 |
| /// ``` |
| /// |
| /// Or perhaps these three numbers: |
| /// |
| /// ```notrust |
| /// 22 3 77 89 46 |
| /// | | | |
| /// 102 89 46 |
| /// ``` |
| /// |
| /// In general, Rayon will attempt to find good breaking points |
| /// that keep all of your cores busy. |
| /// |
| /// ### Fold versus reduce |
| /// |
| /// The `fold()` and `reduce()` methods each take an identity element |
| /// and a combining function, but they operate rather differently. |
| /// |
| /// `reduce()` requires that the identity function has the same |
| /// type as the things you are iterating over, and it fully |
| /// reduces the list of items into a single item. So, for example, |
| /// imagine we are iterating over a list of bytes `bytes: [128_u8, |
| /// 64_u8, 64_u8]`. If we used `bytes.reduce(|| 0_u8, |a: u8, b: |
| /// u8| a + b)`, we would get an overflow. This is because `0`, |
| /// `a`, and `b` here are all bytes, just like the numbers in the |
| /// list (I wrote the types explicitly above, but those are the |
| /// only types you can use). To avoid the overflow, we would need |
| /// to do something like `bytes.map(|b| b as u32).reduce(|| 0, |a, |
| /// b| a + b)`, in which case our result would be `256`. |
| /// |
| /// In contrast, with `fold()`, the identity function does not |
| /// have to have the same type as the things you are iterating |
| /// over, and you potentially get back many results. So, if we |
| /// continue with the `bytes` example from the previous paragraph, |
| /// we could do `bytes.fold(|| 0_u32, |a, b| a + (b as u32))` to |
| /// convert our bytes into `u32`. And of course we might not get |
| /// back a single sum. |
| /// |
| /// There is a more subtle distinction as well, though it's |
| /// actually implied by the above points. When you use `reduce()`, |
| /// your reduction function is sometimes called with values that |
| /// were never part of your original parallel iterator (for |
| /// example, both the left and right might be a partial sum). With |
| /// `fold()`, in contrast, the left value in the fold function is |
| /// always the accumulator, and the right value is always from |
| /// your original sequence. |
| /// |
| /// ### Fold vs Map/Reduce |
| /// |
| /// Fold makes sense if you have some operation where it is |
| /// cheaper to create groups of elements at a time. For example, |
| /// imagine collecting characters into a string. If you were going |
| /// to use map/reduce, you might try this: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let s = |
| /// ['a', 'b', 'c', 'd', 'e'] |
| /// .par_iter() |
| /// .map(|c: &char| format!("{}", c)) |
| /// .reduce(|| String::new(), |
| /// |mut a: String, b: String| { a.push_str(&b); a }); |
| /// |
| /// assert_eq!(s, "abcde"); |
| /// ``` |
| /// |
| /// Because reduce produces the same type of element as its input, |
| /// you have to first map each character into a string, and then |
| /// you can reduce them. This means we create one string per |
| /// element in our iterator -- not so great. Using `fold`, we can |
| /// do this instead: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let s = |
| /// ['a', 'b', 'c', 'd', 'e'] |
| /// .par_iter() |
| /// .fold(|| String::new(), |
| /// |mut s: String, c: &char| { s.push(*c); s }) |
| /// .reduce(|| String::new(), |
| /// |mut a: String, b: String| { a.push_str(&b); a }); |
| /// |
| /// assert_eq!(s, "abcde"); |
| /// ``` |
| /// |
| /// Now `fold` will process groups of our characters at a time, |
| /// and we only make one string per group. We should wind up with |
| /// some small-ish number of strings roughly proportional to the |
| /// number of CPUs you have (it will ultimately depend on how busy |
| /// your processors are). Note that we still need to do a reduce |
| /// afterwards to combine those groups of strings into a single |
| /// string. |
| /// |
| /// You could use a similar trick to save partial results (e.g., a |
| /// cache) or something similar. |
| /// |
| /// ### Combining fold with other operations |
| /// |
| /// You can combine `fold` with `reduce` if you want to produce a |
| /// single value. This is then roughly equivalent to a map/reduce |
| /// combination in effect: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let bytes = 0..22_u8; |
| /// let sum = bytes.into_par_iter() |
| /// .fold(|| 0_u32, |a: u32, b: u8| a + (b as u32)) |
| /// .sum::<u32>(); |
| /// |
| /// assert_eq!(sum, (0..22).sum()); // compare to sequential |
| /// ``` |
| </span><span class="kw">fn </span>fold<T, ID, F>(<span class="self">self</span>, identity: ID, fold_op: F) -> Fold<<span class="self">Self</span>, ID, F> |
| <span class="kw">where |
| </span>F: Fn(T, <span class="self">Self</span>::Item) -> T + Sync + Send, |
| ID: Fn() -> T + Sync + Send, |
| T: Send, |
| { |
| Fold::new(<span class="self">self</span>, identity, fold_op) |
| } |
| |
| <span class="doccomment">/// Applies `fold_op` to the given `init` value with each item of this |
| /// iterator, finally producing the value for further use. |
| /// |
| /// This works essentially like `fold(|| init.clone(), fold_op)`, except |
| /// it doesn't require the `init` type to be `Sync`, nor any other form |
| /// of added synchronization. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let bytes = 0..22_u8; |
| /// let sum = bytes.into_par_iter() |
| /// .fold_with(0_u32, |a: u32, b: u8| a + (b as u32)) |
| /// .sum::<u32>(); |
| /// |
| /// assert_eq!(sum, (0..22).sum()); // compare to sequential |
| /// ``` |
| </span><span class="kw">fn </span>fold_with<F, T>(<span class="self">self</span>, init: T, fold_op: F) -> FoldWith<<span class="self">Self</span>, T, F> |
| <span class="kw">where |
| </span>F: Fn(T, <span class="self">Self</span>::Item) -> T + Sync + Send, |
| T: Send + Clone, |
| { |
| FoldWith::new(<span class="self">self</span>, init, fold_op) |
| } |
| |
| <span class="doccomment">/// Performs a fallible parallel fold. |
| /// |
| /// This is a variation of [`fold()`] for operations which can fail with |
| /// `Option::None` or `Result::Err`. The first such failure stops |
| /// processing the local set of items, without affecting other folds in the |
| /// iterator's subdivisions. |
| /// |
| /// Often, `try_fold()` will be followed by [`try_reduce()`] |
| /// for a final reduction and global short-circuiting effect. |
| /// |
| /// [`fold()`]: #method.fold |
| /// [`try_reduce()`]: #method.try_reduce |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let bytes = 0..22_u8; |
| /// let sum = bytes.into_par_iter() |
| /// .try_fold(|| 0_u32, |a: u32, b: u8| a.checked_add(b as u32)) |
| /// .try_reduce(|| 0, u32::checked_add); |
| /// |
| /// assert_eq!(sum, Some((0..22).sum())); // compare to sequential |
| /// ``` |
| </span><span class="kw">fn </span>try_fold<T, R, ID, F>(<span class="self">self</span>, identity: ID, fold_op: F) -> TryFold<<span class="self">Self</span>, R, ID, F> |
| <span class="kw">where |
| </span>F: Fn(T, <span class="self">Self</span>::Item) -> R + Sync + Send, |
| ID: Fn() -> T + Sync + Send, |
| R: Try<Output = T> + Send, |
| { |
| TryFold::new(<span class="self">self</span>, identity, fold_op) |
| } |
| |
| <span class="doccomment">/// Performs a fallible parallel fold with a cloneable `init` value. |
| /// |
| /// This combines the `init` semantics of [`fold_with()`] and the failure |
| /// semantics of [`try_fold()`]. |
| /// |
| /// [`fold_with()`]: #method.fold_with |
| /// [`try_fold()`]: #method.try_fold |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let bytes = 0..22_u8; |
| /// let sum = bytes.into_par_iter() |
| /// .try_fold_with(0_u32, |a: u32, b: u8| a.checked_add(b as u32)) |
| /// .try_reduce(|| 0, u32::checked_add); |
| /// |
| /// assert_eq!(sum, Some((0..22).sum())); // compare to sequential |
| /// ``` |
| </span><span class="kw">fn </span>try_fold_with<F, T, R>(<span class="self">self</span>, init: T, fold_op: F) -> TryFoldWith<<span class="self">Self</span>, R, F> |
| <span class="kw">where |
| </span>F: Fn(T, <span class="self">Self</span>::Item) -> R + Sync + Send, |
| R: Try<Output = T> + Send, |
| T: Clone + Send, |
| { |
| TryFoldWith::new(<span class="self">self</span>, init, fold_op) |
| } |
| |
| <span class="doccomment">/// Sums up the items in the iterator. |
| /// |
| /// Note that the order in items will be reduced is not specified, |
| /// so if the `+` operator is not truly [associative] \(as is the |
| /// case for floating point numbers), then the results are not |
| /// fully deterministic. |
| /// |
| /// [associative]: https://en.wikipedia.org/wiki/Associative_property |
| /// |
| /// Basically equivalent to `self.reduce(|| 0, |a, b| a + b)`, |
| /// except that the type of `0` and the `+` operation may vary |
| /// depending on the type of value being produced. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 5, 7]; |
| /// |
| /// let sum: i32 = a.par_iter().sum(); |
| /// |
| /// assert_eq!(sum, 13); |
| /// ``` |
| </span><span class="kw">fn </span>sum<S>(<span class="self">self</span>) -> S |
| <span class="kw">where |
| </span>S: Send + Sum<<span class="self">Self</span>::Item> + Sum<S>, |
| { |
| sum::sum(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Multiplies all the items in the iterator. |
| /// |
| /// Note that the order in items will be reduced is not specified, |
| /// so if the `*` operator is not truly [associative] \(as is the |
| /// case for floating point numbers), then the results are not |
| /// fully deterministic. |
| /// |
| /// [associative]: https://en.wikipedia.org/wiki/Associative_property |
| /// |
| /// Basically equivalent to `self.reduce(|| 1, |a, b| a * b)`, |
| /// except that the type of `1` and the `*` operation may vary |
| /// depending on the type of value being produced. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// fn factorial(n: u32) -> u32 { |
| /// (1..n+1).into_par_iter().product() |
| /// } |
| /// |
| /// assert_eq!(factorial(0), 1); |
| /// assert_eq!(factorial(1), 1); |
| /// assert_eq!(factorial(5), 120); |
| /// ``` |
| </span><span class="kw">fn </span>product<P>(<span class="self">self</span>) -> P |
| <span class="kw">where |
| </span>P: Send + Product<<span class="self">Self</span>::Item> + Product<P>, |
| { |
| product::product(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Computes the minimum of all the items in the iterator. If the |
| /// iterator is empty, `None` is returned; otherwise, `Some(min)` |
| /// is returned. |
| /// |
| /// Note that the order in which the items will be reduced is not |
| /// specified, so if the `Ord` impl is not truly associative, then |
| /// the results are not deterministic. |
| /// |
| /// Basically equivalent to `self.reduce_with(|a, b| cmp::min(a, b))`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [45, 74, 32]; |
| /// |
| /// assert_eq!(a.par_iter().min(), Some(&32)); |
| /// |
| /// let b: [i32; 0] = []; |
| /// |
| /// assert_eq!(b.par_iter().min(), None); |
| /// ``` |
| </span><span class="kw">fn </span>min(<span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span><span class="self">Self</span>::Item: Ord, |
| { |
| <span class="self">self</span>.reduce_with(cmp::min) |
| } |
| |
| <span class="doccomment">/// Computes the minimum of all the items in the iterator with respect to |
| /// the given comparison function. If the iterator is empty, `None` is |
| /// returned; otherwise, `Some(min)` is returned. |
| /// |
| /// Note that the order in which the items will be reduced is not |
| /// specified, so if the comparison function is not associative, then |
| /// the results are not deterministic. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [-3_i32, 77, 53, 240, -1]; |
| /// |
| /// assert_eq!(a.par_iter().min_by(|x, y| x.cmp(y)), Some(&-3)); |
| /// ``` |
| </span><span class="kw">fn </span>min_by<F>(<span class="self">self</span>, f: F) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>F: Sync + Send + Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item, <span class="kw-2">&</span><span class="self">Self</span>::Item) -> Ordering, |
| { |
| <span class="kw">fn </span>min<T>(f: <span class="kw">impl </span>Fn(<span class="kw-2">&</span>T, <span class="kw-2">&</span>T) -> Ordering) -> <span class="kw">impl </span>Fn(T, T) -> T { |
| <span class="kw">move </span>|a, b| <span class="kw">match </span>f(<span class="kw-2">&</span>a, <span class="kw-2">&</span>b) { |
| Ordering::Greater => b, |
| <span class="kw">_ </span>=> a, |
| } |
| } |
| |
| <span class="self">self</span>.reduce_with(min(f)) |
| } |
| |
| <span class="doccomment">/// Computes the item that yields the minimum value for the given |
| /// function. If the iterator is empty, `None` is returned; |
| /// otherwise, `Some(item)` is returned. |
| /// |
| /// Note that the order in which the items will be reduced is not |
| /// specified, so if the `Ord` impl is not truly associative, then |
| /// the results are not deterministic. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [-3_i32, 34, 2, 5, -10, -3, -23]; |
| /// |
| /// assert_eq!(a.par_iter().min_by_key(|x| x.abs()), Some(&2)); |
| /// ``` |
| </span><span class="kw">fn </span>min_by_key<K, F>(<span class="self">self</span>, f: F) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>K: Ord + Send, |
| F: Sync + Send + Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> K, |
| { |
| <span class="kw">fn </span>key<T, K>(f: <span class="kw">impl </span>Fn(<span class="kw-2">&</span>T) -> K) -> <span class="kw">impl </span>Fn(T) -> (K, T) { |
| <span class="kw">move </span>|x| (f(<span class="kw-2">&</span>x), x) |
| } |
| |
| <span class="kw">fn </span>min_key<T, K: Ord>(a: (K, T), b: (K, T)) -> (K, T) { |
| <span class="kw">match </span>(a.<span class="number">0</span>).cmp(<span class="kw-2">&</span>b.<span class="number">0</span>) { |
| Ordering::Greater => b, |
| <span class="kw">_ </span>=> a, |
| } |
| } |
| |
| <span class="kw">let </span>(<span class="kw">_</span>, x) = <span class="self">self</span>.map(key(f)).reduce_with(min_key)<span class="question-mark">?</span>; |
| <span class="prelude-val">Some</span>(x) |
| } |
| |
| <span class="doccomment">/// Computes the maximum of all the items in the iterator. If the |
| /// iterator is empty, `None` is returned; otherwise, `Some(max)` |
| /// is returned. |
| /// |
| /// Note that the order in which the items will be reduced is not |
| /// specified, so if the `Ord` impl is not truly associative, then |
| /// the results are not deterministic. |
| /// |
| /// Basically equivalent to `self.reduce_with(|a, b| cmp::max(a, b))`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [45, 74, 32]; |
| /// |
| /// assert_eq!(a.par_iter().max(), Some(&74)); |
| /// |
| /// let b: [i32; 0] = []; |
| /// |
| /// assert_eq!(b.par_iter().max(), None); |
| /// ``` |
| </span><span class="kw">fn </span>max(<span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span><span class="self">Self</span>::Item: Ord, |
| { |
| <span class="self">self</span>.reduce_with(cmp::max) |
| } |
| |
| <span class="doccomment">/// Computes the maximum of all the items in the iterator with respect to |
| /// the given comparison function. If the iterator is empty, `None` is |
| /// returned; otherwise, `Some(min)` is returned. |
| /// |
| /// Note that the order in which the items will be reduced is not |
| /// specified, so if the comparison function is not associative, then |
| /// the results are not deterministic. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [-3_i32, 77, 53, 240, -1]; |
| /// |
| /// assert_eq!(a.par_iter().max_by(|x, y| x.abs().cmp(&y.abs())), Some(&240)); |
| /// ``` |
| </span><span class="kw">fn </span>max_by<F>(<span class="self">self</span>, f: F) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>F: Sync + Send + Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item, <span class="kw-2">&</span><span class="self">Self</span>::Item) -> Ordering, |
| { |
| <span class="kw">fn </span>max<T>(f: <span class="kw">impl </span>Fn(<span class="kw-2">&</span>T, <span class="kw-2">&</span>T) -> Ordering) -> <span class="kw">impl </span>Fn(T, T) -> T { |
| <span class="kw">move </span>|a, b| <span class="kw">match </span>f(<span class="kw-2">&</span>a, <span class="kw-2">&</span>b) { |
| Ordering::Greater => a, |
| <span class="kw">_ </span>=> b, |
| } |
| } |
| |
| <span class="self">self</span>.reduce_with(max(f)) |
| } |
| |
| <span class="doccomment">/// Computes the item that yields the maximum value for the given |
| /// function. If the iterator is empty, `None` is returned; |
| /// otherwise, `Some(item)` is returned. |
| /// |
| /// Note that the order in which the items will be reduced is not |
| /// specified, so if the `Ord` impl is not truly associative, then |
| /// the results are not deterministic. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [-3_i32, 34, 2, 5, -10, -3, -23]; |
| /// |
| /// assert_eq!(a.par_iter().max_by_key(|x| x.abs()), Some(&34)); |
| /// ``` |
| </span><span class="kw">fn </span>max_by_key<K, F>(<span class="self">self</span>, f: F) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>K: Ord + Send, |
| F: Sync + Send + Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> K, |
| { |
| <span class="kw">fn </span>key<T, K>(f: <span class="kw">impl </span>Fn(<span class="kw-2">&</span>T) -> K) -> <span class="kw">impl </span>Fn(T) -> (K, T) { |
| <span class="kw">move </span>|x| (f(<span class="kw-2">&</span>x), x) |
| } |
| |
| <span class="kw">fn </span>max_key<T, K: Ord>(a: (K, T), b: (K, T)) -> (K, T) { |
| <span class="kw">match </span>(a.<span class="number">0</span>).cmp(<span class="kw-2">&</span>b.<span class="number">0</span>) { |
| Ordering::Greater => a, |
| <span class="kw">_ </span>=> b, |
| } |
| } |
| |
| <span class="kw">let </span>(<span class="kw">_</span>, x) = <span class="self">self</span>.map(key(f)).reduce_with(max_key)<span class="question-mark">?</span>; |
| <span class="prelude-val">Some</span>(x) |
| } |
| |
| <span class="doccomment">/// Takes two iterators and creates a new iterator over both. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [0, 1, 2]; |
| /// let b = [9, 8, 7]; |
| /// |
| /// let par_iter = a.par_iter().chain(b.par_iter()); |
| /// |
| /// let chained: Vec<_> = par_iter.cloned().collect(); |
| /// |
| /// assert_eq!(&chained[..], &[0, 1, 2, 9, 8, 7]); |
| /// ``` |
| </span><span class="kw">fn </span>chain<C>(<span class="self">self</span>, chain: C) -> Chain<<span class="self">Self</span>, C::Iter> |
| <span class="kw">where |
| </span>C: IntoParallelIterator<Item = <span class="self">Self</span>::Item>, |
| { |
| Chain::new(<span class="self">self</span>, chain.into_par_iter()) |
| } |
| |
| <span class="doccomment">/// Searches for **some** item in the parallel iterator that |
| /// matches the given predicate and returns it. This operation |
| /// is similar to [`find` on sequential iterators][find] but |
| /// the item returned may not be the **first** one in the parallel |
| /// sequence which matches, since we search the entire sequence in parallel. |
| /// |
| /// Once a match is found, we will attempt to stop processing |
| /// the rest of the items in the iterator as soon as possible |
| /// (just as `find` stops iterating once a match is found). |
| /// |
| /// [find]: https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.find |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3, 3]; |
| /// |
| /// assert_eq!(a.par_iter().find_any(|&&x| x == 3), Some(&3)); |
| /// |
| /// assert_eq!(a.par_iter().find_any(|&&x| x == 100), None); |
| /// ``` |
| </span><span class="kw">fn </span>find_any<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| find::find(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Searches for the sequentially **first** item in the parallel iterator |
| /// that matches the given predicate and returns it. |
| /// |
| /// Once a match is found, all attempts to the right of the match |
| /// will be stopped, while attempts to the left must continue in case |
| /// an earlier match is found. |
| /// |
| /// Note that not all parallel iterators have a useful order, much like |
| /// sequential `HashMap` iteration, so "first" may be nebulous. If you |
| /// just want the first match that discovered anywhere in the iterator, |
| /// `find_any` is a better choice. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3, 3]; |
| /// |
| /// assert_eq!(a.par_iter().find_first(|&&x| x == 3), Some(&3)); |
| /// |
| /// assert_eq!(a.par_iter().find_first(|&&x| x == 100), None); |
| /// ``` |
| </span><span class="kw">fn </span>find_first<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| find_first_last::find_first(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Searches for the sequentially **last** item in the parallel iterator |
| /// that matches the given predicate and returns it. |
| /// |
| /// Once a match is found, all attempts to the left of the match |
| /// will be stopped, while attempts to the right must continue in case |
| /// a later match is found. |
| /// |
| /// Note that not all parallel iterators have a useful order, much like |
| /// sequential `HashMap` iteration, so "last" may be nebulous. When the |
| /// order doesn't actually matter to you, `find_any` is a better choice. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3, 3]; |
| /// |
| /// assert_eq!(a.par_iter().find_last(|&&x| x == 3), Some(&3)); |
| /// |
| /// assert_eq!(a.par_iter().find_last(|&&x| x == 100), None); |
| /// ``` |
| </span><span class="kw">fn </span>find_last<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| find_first_last::find_last(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Applies the given predicate to the items in the parallel iterator |
| /// and returns **any** non-None result of the map operation. |
| /// |
| /// Once a non-None value is produced from the map operation, we will |
| /// attempt to stop processing the rest of the items in the iterator |
| /// as soon as possible. |
| /// |
| /// Note that this method only returns **some** item in the parallel |
| /// iterator that is not None from the map predicate. The item returned |
| /// may not be the **first** non-None value produced in the parallel |
| /// sequence, since the entire sequence is mapped over in parallel. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let c = ["lol", "NaN", "5", "5"]; |
| /// |
| /// let found_number = c.par_iter().find_map_any(|s| s.parse().ok()); |
| /// |
| /// assert_eq!(found_number, Some(5)); |
| /// ``` |
| </span><span class="kw">fn </span>find_map_any<P, R>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><R> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> <span class="prelude-ty">Option</span><R> + Sync + Send, |
| R: Send, |
| { |
| <span class="kw">fn </span>yes<T>(<span class="kw">_</span>: <span class="kw-2">&</span>T) -> bool { |
| <span class="bool-val">true |
| </span>} |
| <span class="self">self</span>.filter_map(predicate).find_any(yes) |
| } |
| |
| <span class="doccomment">/// Applies the given predicate to the items in the parallel iterator and |
| /// returns the sequentially **first** non-None result of the map operation. |
| /// |
| /// Once a non-None value is produced from the map operation, all attempts |
| /// to the right of the match will be stopped, while attempts to the left |
| /// must continue in case an earlier match is found. |
| /// |
| /// Note that not all parallel iterators have a useful order, much like |
| /// sequential `HashMap` iteration, so "first" may be nebulous. If you |
| /// just want the first non-None value discovered anywhere in the iterator, |
| /// `find_map_any` is a better choice. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let c = ["lol", "NaN", "2", "5"]; |
| /// |
| /// let first_number = c.par_iter().find_map_first(|s| s.parse().ok()); |
| /// |
| /// assert_eq!(first_number, Some(2)); |
| /// ``` |
| </span><span class="kw">fn </span>find_map_first<P, R>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><R> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> <span class="prelude-ty">Option</span><R> + Sync + Send, |
| R: Send, |
| { |
| <span class="kw">fn </span>yes<T>(<span class="kw">_</span>: <span class="kw-2">&</span>T) -> bool { |
| <span class="bool-val">true |
| </span>} |
| <span class="self">self</span>.filter_map(predicate).find_first(yes) |
| } |
| |
| <span class="doccomment">/// Applies the given predicate to the items in the parallel iterator and |
| /// returns the sequentially **last** non-None result of the map operation. |
| /// |
| /// Once a non-None value is produced from the map operation, all attempts |
| /// to the left of the match will be stopped, while attempts to the right |
| /// must continue in case a later match is found. |
| /// |
| /// Note that not all parallel iterators have a useful order, much like |
| /// sequential `HashMap` iteration, so "first" may be nebulous. If you |
| /// just want the first non-None value discovered anywhere in the iterator, |
| /// `find_map_any` is a better choice. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let c = ["lol", "NaN", "2", "5"]; |
| /// |
| /// let last_number = c.par_iter().find_map_last(|s| s.parse().ok()); |
| /// |
| /// assert_eq!(last_number, Some(5)); |
| /// ``` |
| </span><span class="kw">fn </span>find_map_last<P, R>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><R> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> <span class="prelude-ty">Option</span><R> + Sync + Send, |
| R: Send, |
| { |
| <span class="kw">fn </span>yes<T>(<span class="kw">_</span>: <span class="kw-2">&</span>T) -> bool { |
| <span class="bool-val">true |
| </span>} |
| <span class="self">self</span>.filter_map(predicate).find_last(yes) |
| } |
| |
| <span class="attribute">#[doc(hidden)] |
| #[deprecated(note = <span class="string">"parallel `find` does not search in order -- use `find_any`, \\ |
| `find_first`, or `find_last`"</span>)] |
| </span><span class="kw">fn </span>find<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="self">self</span>.find_any(predicate) |
| } |
| |
| <span class="doccomment">/// Searches for **some** item in the parallel iterator that |
| /// matches the given predicate, and if so returns true. Once |
| /// a match is found, we'll attempt to stop process the rest |
| /// of the items. Proving that there's no match, returning false, |
| /// does require visiting every item. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [0, 12, 3, 4, 0, 23, 0]; |
| /// |
| /// let is_valid = a.par_iter().any(|&x| x > 10); |
| /// |
| /// assert!(is_valid); |
| /// ``` |
| </span><span class="kw">fn </span>any<P>(<span class="self">self</span>, predicate: P) -> bool |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="self">self</span>.map(predicate).find_any(bool::clone).is_some() |
| } |
| |
| <span class="doccomment">/// Tests that every item in the parallel iterator matches the given |
| /// predicate, and if so returns true. If a counter-example is found, |
| /// we'll attempt to stop processing more items, then return false. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [0, 12, 3, 4, 0, 23, 0]; |
| /// |
| /// let is_valid = a.par_iter().all(|&x| x > 10); |
| /// |
| /// assert!(!is_valid); |
| /// ``` |
| </span><span class="kw">fn </span>all<P>(<span class="self">self</span>, predicate: P) -> bool |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>is_false(x: <span class="kw-2">&</span>bool) -> bool { |
| !x |
| } |
| |
| <span class="self">self</span>.map(predicate).find_any(is_false).is_none() |
| } |
| |
| <span class="doccomment">/// Creates an iterator over the `Some` items of this iterator, halting |
| /// as soon as any `None` is found. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::sync::atomic::{AtomicUsize, Ordering}; |
| /// |
| /// let counter = AtomicUsize::new(0); |
| /// let value = (0_i32..2048) |
| /// .into_par_iter() |
| /// .map(|x| { |
| /// counter.fetch_add(1, Ordering::SeqCst); |
| /// if x < 1024 { Some(x) } else { None } |
| /// }) |
| /// .while_some() |
| /// .max(); |
| /// |
| /// assert!(value < Some(1024)); |
| /// assert!(counter.load(Ordering::SeqCst) < 2048); // should not have visited every single one |
| /// ``` |
| </span><span class="kw">fn </span>while_some<T>(<span class="self">self</span>) -> WhileSome<<span class="self">Self</span>> |
| <span class="kw">where |
| </span><span class="self">Self</span>: ParallelIterator<Item = <span class="prelude-ty">Option</span><T>>, |
| T: Send, |
| { |
| WhileSome::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Wraps an iterator with a fuse in case of panics, to halt all threads |
| /// as soon as possible. |
| /// |
| /// Panics within parallel iterators are always propagated to the caller, |
| /// but they don't always halt the rest of the iterator right away, due to |
| /// the internal semantics of [`join`]. This adaptor makes a greater effort |
| /// to stop processing other items sooner, with the cost of additional |
| /// synchronization overhead, which may also inhibit some optimizations. |
| /// |
| /// [`join`]: ../fn.join.html#panics |
| /// |
| /// # Examples |
| /// |
| /// If this code didn't use `panic_fuse()`, it would continue processing |
| /// many more items in other threads (with long sleep delays) before the |
| /// panic is finally propagated. |
| /// |
| /// ```should_panic |
| /// use rayon::prelude::*; |
| /// use std::{thread, time}; |
| /// |
| /// (0..1_000_000) |
| /// .into_par_iter() |
| /// .panic_fuse() |
| /// .for_each(|i| { |
| /// // simulate some work |
| /// thread::sleep(time::Duration::from_secs(1)); |
| /// assert!(i > 0); // oops! |
| /// }); |
| /// ``` |
| </span><span class="kw">fn </span>panic_fuse(<span class="self">self</span>) -> PanicFuse<<span class="self">Self</span>> { |
| PanicFuse::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Creates a fresh collection containing all the elements produced |
| /// by this parallel iterator. |
| /// |
| /// You may prefer [`collect_into_vec()`] implemented on |
| /// [`IndexedParallelIterator`], if your underlying iterator also implements |
| /// it. [`collect_into_vec()`] allocates efficiently with precise knowledge |
| /// of how many elements the iterator contains, and even allows you to reuse |
| /// an existing vector's backing store rather than allocating a fresh vector. |
| /// |
| /// [`IndexedParallelIterator`]: trait.IndexedParallelIterator.html |
| /// [`collect_into_vec()`]: |
| /// trait.IndexedParallelIterator.html#method.collect_into_vec |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let sync_vec: Vec<_> = (0..100).into_iter().collect(); |
| /// |
| /// let async_vec: Vec<_> = (0..100).into_par_iter().collect(); |
| /// |
| /// assert_eq!(sync_vec, async_vec); |
| /// ``` |
| /// |
| /// You can collect a pair of collections like [`unzip`](#method.unzip) |
| /// for paired items: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [(0, 1), (1, 2), (2, 3), (3, 4)]; |
| /// let (first, second): (Vec<_>, Vec<_>) = a.into_par_iter().collect(); |
| /// |
| /// assert_eq!(first, [0, 1, 2, 3]); |
| /// assert_eq!(second, [1, 2, 3, 4]); |
| /// ``` |
| /// |
| /// Or like [`partition_map`](#method.partition_map) for `Either` items: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use rayon::iter::Either; |
| /// |
| /// let (left, right): (Vec<_>, Vec<_>) = (0..8).into_par_iter().map(|x| { |
| /// if x % 2 == 0 { |
| /// Either::Left(x * 4) |
| /// } else { |
| /// Either::Right(x * 3) |
| /// } |
| /// }).collect(); |
| /// |
| /// assert_eq!(left, [0, 8, 16, 24]); |
| /// assert_eq!(right, [3, 9, 15, 21]); |
| /// ``` |
| /// |
| /// You can even collect an arbitrarily-nested combination of pairs and `Either`: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use rayon::iter::Either; |
| /// |
| /// let (first, (left, right)): (Vec<_>, (Vec<_>, Vec<_>)) |
| /// = (0..8).into_par_iter().map(|x| { |
| /// if x % 2 == 0 { |
| /// (x, Either::Left(x * 4)) |
| /// } else { |
| /// (-x, Either::Right(x * 3)) |
| /// } |
| /// }).collect(); |
| /// |
| /// assert_eq!(first, [0, -1, 2, -3, 4, -5, 6, -7]); |
| /// assert_eq!(left, [0, 8, 16, 24]); |
| /// assert_eq!(right, [3, 9, 15, 21]); |
| /// ``` |
| /// |
| /// All of that can _also_ be combined with short-circuiting collection of |
| /// `Result` or `Option` types: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use rayon::iter::Either; |
| /// |
| /// let result: Result<(Vec<_>, (Vec<_>, Vec<_>)), _> |
| /// = (0..8).into_par_iter().map(|x| { |
| /// if x > 5 { |
| /// Err(x) |
| /// } else if x % 2 == 0 { |
| /// Ok((x, Either::Left(x * 4))) |
| /// } else { |
| /// Ok((-x, Either::Right(x * 3))) |
| /// } |
| /// }).collect(); |
| /// |
| /// let error = result.unwrap_err(); |
| /// assert!(error == 6 || error == 7); |
| /// ``` |
| </span><span class="kw">fn </span>collect<C>(<span class="self">self</span>) -> C |
| <span class="kw">where |
| </span>C: FromParallelIterator<<span class="self">Self</span>::Item>, |
| { |
| C::from_par_iter(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Unzips the items of a parallel iterator into a pair of arbitrary |
| /// `ParallelExtend` containers. |
| /// |
| /// You may prefer to use `unzip_into_vecs()`, which allocates more |
| /// efficiently with precise knowledge of how many elements the |
| /// iterator contains, and even allows you to reuse existing |
| /// vectors' backing stores rather than allocating fresh vectors. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [(0, 1), (1, 2), (2, 3), (3, 4)]; |
| /// |
| /// let (left, right): (Vec<_>, Vec<_>) = a.par_iter().cloned().unzip(); |
| /// |
| /// assert_eq!(left, [0, 1, 2, 3]); |
| /// assert_eq!(right, [1, 2, 3, 4]); |
| /// ``` |
| /// |
| /// Nested pairs can be unzipped too. |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let (values, (squares, cubes)): (Vec<_>, (Vec<_>, Vec<_>)) = (0..4).into_par_iter() |
| /// .map(|i| (i, (i * i, i * i * i))) |
| /// .unzip(); |
| /// |
| /// assert_eq!(values, [0, 1, 2, 3]); |
| /// assert_eq!(squares, [0, 1, 4, 9]); |
| /// assert_eq!(cubes, [0, 1, 8, 27]); |
| /// ``` |
| </span><span class="kw">fn </span>unzip<A, B, FromA, FromB>(<span class="self">self</span>) -> (FromA, FromB) |
| <span class="kw">where |
| </span><span class="self">Self</span>: ParallelIterator<Item = (A, B)>, |
| FromA: Default + Send + ParallelExtend<A>, |
| FromB: Default + Send + ParallelExtend<B>, |
| A: Send, |
| B: Send, |
| { |
| unzip::unzip(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Partitions the items of a parallel iterator into a pair of arbitrary |
| /// `ParallelExtend` containers. Items for which the `predicate` returns |
| /// true go into the first container, and the rest go into the second. |
| /// |
| /// Note: unlike the standard `Iterator::partition`, this allows distinct |
| /// collection types for the left and right items. This is more flexible, |
| /// but may require new type annotations when converting sequential code |
| /// that used type inference assuming the two were the same. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let (left, right): (Vec<_>, Vec<_>) = (0..8).into_par_iter().partition(|x| x % 2 == 0); |
| /// |
| /// assert_eq!(left, [0, 2, 4, 6]); |
| /// assert_eq!(right, [1, 3, 5, 7]); |
| /// ``` |
| </span><span class="kw">fn </span>partition<A, B, P>(<span class="self">self</span>, predicate: P) -> (A, B) |
| <span class="kw">where |
| </span>A: Default + Send + ParallelExtend<<span class="self">Self</span>::Item>, |
| B: Default + Send + ParallelExtend<<span class="self">Self</span>::Item>, |
| P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| unzip::partition(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Partitions and maps the items of a parallel iterator into a pair of |
| /// arbitrary `ParallelExtend` containers. `Either::Left` items go into |
| /// the first container, and `Either::Right` items go into the second. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use rayon::iter::Either; |
| /// |
| /// let (left, right): (Vec<_>, Vec<_>) = (0..8).into_par_iter() |
| /// .partition_map(|x| { |
| /// if x % 2 == 0 { |
| /// Either::Left(x * 4) |
| /// } else { |
| /// Either::Right(x * 3) |
| /// } |
| /// }); |
| /// |
| /// assert_eq!(left, [0, 8, 16, 24]); |
| /// assert_eq!(right, [3, 9, 15, 21]); |
| /// ``` |
| /// |
| /// Nested `Either` enums can be split as well. |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use rayon::iter::Either::*; |
| /// |
| /// let ((fizzbuzz, fizz), (buzz, other)): ((Vec<_>, Vec<_>), (Vec<_>, Vec<_>)) = (1..20) |
| /// .into_par_iter() |
| /// .partition_map(|x| match (x % 3, x % 5) { |
| /// (0, 0) => Left(Left(x)), |
| /// (0, _) => Left(Right(x)), |
| /// (_, 0) => Right(Left(x)), |
| /// (_, _) => Right(Right(x)), |
| /// }); |
| /// |
| /// assert_eq!(fizzbuzz, [15]); |
| /// assert_eq!(fizz, [3, 6, 9, 12, 18]); |
| /// assert_eq!(buzz, [5, 10]); |
| /// assert_eq!(other, [1, 2, 4, 7, 8, 11, 13, 14, 16, 17, 19]); |
| /// ``` |
| </span><span class="kw">fn </span>partition_map<A, B, P, L, R>(<span class="self">self</span>, predicate: P) -> (A, B) |
| <span class="kw">where |
| </span>A: Default + Send + ParallelExtend<L>, |
| B: Default + Send + ParallelExtend<R>, |
| P: Fn(<span class="self">Self</span>::Item) -> Either<L, R> + Sync + Send, |
| L: Send, |
| R: Send, |
| { |
| unzip::partition_map(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Intersperses clones of an element between items of this iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let x = vec![1, 2, 3]; |
| /// let r: Vec<_> = x.into_par_iter().intersperse(-1).collect(); |
| /// |
| /// assert_eq!(r, vec![1, -1, 2, -1, 3]); |
| /// ``` |
| </span><span class="kw">fn </span>intersperse(<span class="self">self</span>, element: <span class="self">Self</span>::Item) -> Intersperse<<span class="self">Self</span>> |
| <span class="kw">where |
| </span><span class="self">Self</span>::Item: Clone, |
| { |
| Intersperse::new(<span class="self">self</span>, element) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that yields `n` elements from *anywhere* in the original iterator. |
| /// |
| /// This is similar to [`IndexedParallelIterator::take`] without being |
| /// constrained to the "first" `n` of the original iterator order. The |
| /// taken items will still maintain their relative order where that is |
| /// visible in `collect`, `reduce`, and similar outputs. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..100) |
| /// .into_par_iter() |
| /// .filter(|&x| x % 2 == 0) |
| /// .take_any(5) |
| /// .collect(); |
| /// |
| /// assert_eq!(result.len(), 5); |
| /// assert!(result.windows(2).all(|w| w[0] < w[1])); |
| /// ``` |
| </span><span class="kw">fn </span>take_any(<span class="self">self</span>, n: usize) -> TakeAny<<span class="self">Self</span>> { |
| TakeAny::new(<span class="self">self</span>, n) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that skips `n` elements from *anywhere* in the original iterator. |
| /// |
| /// This is similar to [`IndexedParallelIterator::skip`] without being |
| /// constrained to the "first" `n` of the original iterator order. The |
| /// remaining items will still maintain their relative order where that is |
| /// visible in `collect`, `reduce`, and similar outputs. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..100) |
| /// .into_par_iter() |
| /// .filter(|&x| x % 2 == 0) |
| /// .skip_any(5) |
| /// .collect(); |
| /// |
| /// assert_eq!(result.len(), 45); |
| /// assert!(result.windows(2).all(|w| w[0] < w[1])); |
| /// ``` |
| </span><span class="kw">fn </span>skip_any(<span class="self">self</span>, n: usize) -> SkipAny<<span class="self">Self</span>> { |
| SkipAny::new(<span class="self">self</span>, n) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that takes elements from *anywhere* in the original iterator |
| /// until the given `predicate` returns `false`. |
| /// |
| /// The `predicate` may be anything -- e.g. it could be checking a fact about the item, a |
| /// global condition unrelated to the item itself, or some combination thereof. |
| /// |
| /// If parallel calls to the `predicate` race and give different results, then the |
| /// `true` results will still take those particular items, while respecting the `false` |
| /// result from elsewhere to skip any further items. |
| /// |
| /// This is similar to [`Iterator::take_while`] without being constrained to the original |
| /// iterator order. The taken items will still maintain their relative order where that is |
| /// visible in `collect`, `reduce`, and similar outputs. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..100) |
| /// .into_par_iter() |
| /// .take_any_while(|x| *x < 50) |
| /// .collect(); |
| /// |
| /// assert!(result.len() <= 50); |
| /// assert!(result.windows(2).all(|w| w[0] < w[1])); |
| /// ``` |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::sync::atomic::AtomicUsize; |
| /// use std::sync::atomic::Ordering::Relaxed; |
| /// |
| /// // Collect any group of items that sum <= 1000 |
| /// let quota = AtomicUsize::new(1000); |
| /// let result: Vec<_> = (0_usize..100) |
| /// .into_par_iter() |
| /// .take_any_while(|&x| { |
| /// quota.fetch_update(Relaxed, Relaxed, |q| q.checked_sub(x)) |
| /// .is_ok() |
| /// }) |
| /// .collect(); |
| /// |
| /// let sum = result.iter().sum::<usize>(); |
| /// assert!(matches!(sum, 902..=1000)); |
| /// ``` |
| </span><span class="kw">fn </span>take_any_while<P>(<span class="self">self</span>, predicate: P) -> TakeAnyWhile<<span class="self">Self</span>, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| TakeAnyWhile::new(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that skips elements from *anywhere* in the original iterator |
| /// until the given `predicate` returns `false`. |
| /// |
| /// The `predicate` may be anything -- e.g. it could be checking a fact about the item, a |
| /// global condition unrelated to the item itself, or some combination thereof. |
| /// |
| /// If parallel calls to the `predicate` race and give different results, then the |
| /// `true` results will still skip those particular items, while respecting the `false` |
| /// result from elsewhere to skip any further items. |
| /// |
| /// This is similar to [`Iterator::skip_while`] without being constrained to the original |
| /// iterator order. The remaining items will still maintain their relative order where that is |
| /// visible in `collect`, `reduce`, and similar outputs. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..100) |
| /// .into_par_iter() |
| /// .skip_any_while(|x| *x < 50) |
| /// .collect(); |
| /// |
| /// assert!(result.len() >= 50); |
| /// assert!(result.windows(2).all(|w| w[0] < w[1])); |
| /// ``` |
| </span><span class="kw">fn </span>skip_any_while<P>(<span class="self">self</span>, predicate: P) -> SkipAnyWhile<<span class="self">Self</span>, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="kw-2">&</span><span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| SkipAnyWhile::new(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Internal method used to define the behavior of this parallel |
| /// iterator. You should not need to call this directly. |
| /// |
| /// This method causes the iterator `self` to start producing |
| /// items and to feed them to the consumer `consumer` one by one. |
| /// It may split the consumer before doing so to create the |
| /// opportunity to produce in parallel. |
| /// |
| /// See the [README] for more details on the internals of parallel |
| /// iterators. |
| /// |
| /// [README]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md |
| </span><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="doccomment">/// Internal method used to define the behavior of this parallel |
| /// iterator. You should not need to call this directly. |
| /// |
| /// Returns the number of items produced by this iterator, if known |
| /// statically. This can be used by consumers to trigger special fast |
| /// paths. Therefore, if `Some(_)` is returned, this iterator must only |
| /// use the (indexed) `Consumer` methods when driving a consumer, such |
| /// as `split_at()`. Calling `UnindexedConsumer::split_off_left()` or |
| /// other `UnindexedConsumer` methods -- or returning an inaccurate |
| /// value -- may result in panics. |
| /// |
| /// This method is currently used to optimize `collect` for want |
| /// of true Rust specialization; it may be removed when |
| /// specialization is stable. |
| </span><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">None |
| </span>} |
| } |
| |
| <span class="kw">impl</span><T: ParallelIterator> IntoParallelIterator <span class="kw">for </span>T { |
| <span class="kw">type </span>Iter = T; |
| <span class="kw">type </span>Item = T::Item; |
| |
| <span class="kw">fn </span>into_par_iter(<span class="self">self</span>) -> T { |
| <span class="self">self |
| </span>} |
| } |
| |
| <span class="doccomment">/// An iterator that supports "random access" to its data, meaning |
| /// that you can split it at arbitrary indices and draw data from |
| /// those points. |
| /// |
| /// **Note:** Not implemented for `u64`, `i64`, `u128`, or `i128` ranges |
| </span><span class="comment">// Waiting for `ExactSizeIterator::is_empty` to be stabilized. See rust-lang/rust#35428 |
| </span><span class="attribute">#[allow(clippy::len_without_is_empty)] |
| </span><span class="kw">pub trait </span>IndexedParallelIterator: ParallelIterator { |
| <span class="doccomment">/// Collects the results of the iterator into the specified |
| /// vector. The vector is always cleared before execution |
| /// begins. If possible, reusing the vector across calls can lead |
| /// to better performance since it reuses the same backing buffer. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// // any prior data will be cleared |
| /// let mut vec = vec![-1, -2, -3]; |
| /// |
| /// (0..5).into_par_iter() |
| /// .collect_into_vec(&mut vec); |
| /// |
| /// assert_eq!(vec, [0, 1, 2, 3, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>collect_into_vec(<span class="self">self</span>, target: <span class="kw-2">&mut </span>Vec<<span class="self">Self</span>::Item>) { |
| collect::collect_into_vec(<span class="self">self</span>, target); |
| } |
| |
| <span class="doccomment">/// Unzips the results of the iterator into the specified |
| /// vectors. The vectors are always cleared before execution |
| /// begins. If possible, reusing the vectors across calls can lead |
| /// to better performance since they reuse the same backing buffer. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// // any prior data will be cleared |
| /// let mut left = vec![42; 10]; |
| /// let mut right = vec![-1; 10]; |
| /// |
| /// (10..15).into_par_iter() |
| /// .enumerate() |
| /// .unzip_into_vecs(&mut left, &mut right); |
| /// |
| /// assert_eq!(left, [0, 1, 2, 3, 4]); |
| /// assert_eq!(right, [10, 11, 12, 13, 14]); |
| /// ``` |
| </span><span class="kw">fn </span>unzip_into_vecs<A, B>(<span class="self">self</span>, left: <span class="kw-2">&mut </span>Vec<A>, right: <span class="kw-2">&mut </span>Vec<B>) |
| <span class="kw">where |
| </span><span class="self">Self</span>: IndexedParallelIterator<Item = (A, B)>, |
| A: Send, |
| B: Send, |
| { |
| collect::unzip_into_vecs(<span class="self">self</span>, left, right); |
| } |
| |
| <span class="doccomment">/// Iterates over tuples `(A, B)`, where the items `A` are from |
| /// this iterator and `B` are from the iterator given as argument. |
| /// Like the `zip` method on ordinary iterators, if the two |
| /// iterators are of unequal length, you only get the items they |
| /// have in common. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (1..4) |
| /// .into_par_iter() |
| /// .zip(vec!['a', 'b', 'c']) |
| /// .collect(); |
| /// |
| /// assert_eq!(result, [(1, 'a'), (2, 'b'), (3, 'c')]); |
| /// ``` |
| </span><span class="kw">fn </span>zip<Z>(<span class="self">self</span>, zip_op: Z) -> Zip<<span class="self">Self</span>, Z::Iter> |
| <span class="kw">where |
| </span>Z: IntoParallelIterator, |
| Z::Iter: IndexedParallelIterator, |
| { |
| Zip::new(<span class="self">self</span>, zip_op.into_par_iter()) |
| } |
| |
| <span class="doccomment">/// The same as `Zip`, but requires that both iterators have the same length. |
| /// |
| /// # Panics |
| /// Will panic if `self` and `zip_op` are not the same length. |
| /// |
| /// ```should_panic |
| /// use rayon::prelude::*; |
| /// |
| /// let one = [1u8]; |
| /// let two = [2u8, 2]; |
| /// let one_iter = one.par_iter(); |
| /// let two_iter = two.par_iter(); |
| /// |
| /// // this will panic |
| /// let zipped: Vec<(&u8, &u8)> = one_iter.zip_eq(two_iter).collect(); |
| /// |
| /// // we should never get here |
| /// assert_eq!(1, zipped.len()); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>zip_eq<Z>(<span class="self">self</span>, zip_op: Z) -> ZipEq<<span class="self">Self</span>, Z::Iter> |
| <span class="kw">where |
| </span>Z: IntoParallelIterator, |
| Z::Iter: IndexedParallelIterator, |
| { |
| <span class="kw">let </span>zip_op_iter = zip_op.into_par_iter(); |
| <span class="macro">assert_eq!</span>( |
| <span class="self">self</span>.len(), |
| zip_op_iter.len(), |
| <span class="string">"iterators must have the same length" |
| </span>); |
| ZipEq::new(<span class="self">self</span>, zip_op_iter) |
| } |
| |
| <span class="doccomment">/// Interleaves elements of this iterator and the other given |
| /// iterator. Alternately yields elements from this iterator and |
| /// the given iterator, until both are exhausted. If one iterator |
| /// is exhausted before the other, the last elements are provided |
| /// from the other. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let (x, y) = (vec![1, 2], vec![3, 4, 5, 6]); |
| /// let r: Vec<i32> = x.into_par_iter().interleave(y).collect(); |
| /// assert_eq!(r, vec![1, 3, 2, 4, 5, 6]); |
| /// ``` |
| </span><span class="kw">fn </span>interleave<I>(<span class="self">self</span>, other: I) -> Interleave<<span class="self">Self</span>, I::Iter> |
| <span class="kw">where |
| </span>I: IntoParallelIterator<Item = <span class="self">Self</span>::Item>, |
| I::Iter: IndexedParallelIterator<Item = <span class="self">Self</span>::Item>, |
| { |
| Interleave::new(<span class="self">self</span>, other.into_par_iter()) |
| } |
| |
| <span class="doccomment">/// Interleaves elements of this iterator and the other given |
| /// iterator, until one is exhausted. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let (x, y) = (vec![1, 2, 3, 4], vec![5, 6]); |
| /// let r: Vec<i32> = x.into_par_iter().interleave_shortest(y).collect(); |
| /// assert_eq!(r, vec![1, 5, 2, 6, 3]); |
| /// ``` |
| </span><span class="kw">fn </span>interleave_shortest<I>(<span class="self">self</span>, other: I) -> InterleaveShortest<<span class="self">Self</span>, I::Iter> |
| <span class="kw">where |
| </span>I: IntoParallelIterator<Item = <span class="self">Self</span>::Item>, |
| I::Iter: IndexedParallelIterator<Item = <span class="self">Self</span>::Item>, |
| { |
| InterleaveShortest::new(<span class="self">self</span>, other.into_par_iter()) |
| } |
| |
| <span class="doccomment">/// Splits an iterator up into fixed-size chunks. |
| /// |
| /// Returns an iterator that returns `Vec`s of the given number of elements. |
| /// If the number of elements in the iterator is not divisible by `chunk_size`, |
| /// the last chunk may be shorter than `chunk_size`. |
| /// |
| /// See also [`par_chunks()`] and [`par_chunks_mut()`] for similar behavior on |
| /// slices, without having to allocate intermediate `Vec`s for the chunks. |
| /// |
| /// [`par_chunks()`]: ../slice/trait.ParallelSlice.html#method.par_chunks |
| /// [`par_chunks_mut()`]: ../slice/trait.ParallelSliceMut.html#method.par_chunks_mut |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let a = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
| /// let r: Vec<Vec<i32>> = a.into_par_iter().chunks(3).collect(); |
| /// assert_eq!(r, vec![vec![1,2,3], vec![4,5,6], vec![7,8,9], vec![10]]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>chunks(<span class="self">self</span>, chunk_size: usize) -> Chunks<<span class="self">Self</span>> { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| Chunks::new(<span class="self">self</span>, chunk_size) |
| } |
| |
| <span class="doccomment">/// Splits an iterator into fixed-size chunks, performing a sequential [`fold()`] on |
| /// each chunk. |
| /// |
| /// Returns an iterator that produces a folded result for each chunk of items |
| /// produced by this iterator. |
| /// |
| /// This works essentially like: |
| /// |
| /// ```text |
| /// iter.chunks(chunk_size) |
| /// .map(|chunk| |
| /// chunk.into_iter() |
| /// .fold(identity, fold_op) |
| /// ) |
| /// ``` |
| /// |
| /// except there is no per-chunk allocation overhead. |
| /// |
| /// [`fold()`]: std::iter::Iterator#method.fold |
| /// |
| /// **Panics** if `chunk_size` is 0. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let nums = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
| /// let chunk_sums = nums.into_par_iter().fold_chunks(2, || 0, |a, n| a + n).collect::<Vec<_>>(); |
| /// assert_eq!(chunk_sums, vec![3, 7, 11, 15, 19]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>fold_chunks<T, ID, F>( |
| <span class="self">self</span>, |
| chunk_size: usize, |
| identity: ID, |
| fold_op: F, |
| ) -> FoldChunks<<span class="self">Self</span>, ID, F> |
| <span class="kw">where |
| </span>ID: Fn() -> T + Send + Sync, |
| F: Fn(T, <span class="self">Self</span>::Item) -> T + Send + Sync, |
| T: Send, |
| { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| FoldChunks::new(<span class="self">self</span>, chunk_size, identity, fold_op) |
| } |
| |
| <span class="doccomment">/// Splits an iterator into fixed-size chunks, performing a sequential [`fold()`] on |
| /// each chunk. |
| /// |
| /// Returns an iterator that produces a folded result for each chunk of items |
| /// produced by this iterator. |
| /// |
| /// This works essentially like `fold_chunks(chunk_size, || init.clone(), fold_op)`, |
| /// except it doesn't require the `init` type to be `Sync`, nor any other form of |
| /// added synchronization. |
| /// |
| /// [`fold()`]: std::iter::Iterator#method.fold |
| /// |
| /// **Panics** if `chunk_size` is 0. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// let nums = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; |
| /// let chunk_sums = nums.into_par_iter().fold_chunks_with(2, 0, |a, n| a + n).collect::<Vec<_>>(); |
| /// assert_eq!(chunk_sums, vec![3, 7, 11, 15, 19]); |
| /// ``` |
| </span><span class="attribute">#[track_caller] |
| </span><span class="kw">fn </span>fold_chunks_with<T, F>( |
| <span class="self">self</span>, |
| chunk_size: usize, |
| init: T, |
| fold_op: F, |
| ) -> FoldChunksWith<<span class="self">Self</span>, T, F> |
| <span class="kw">where |
| </span>T: Send + Clone, |
| F: Fn(T, <span class="self">Self</span>::Item) -> T + Send + Sync, |
| { |
| <span class="macro">assert!</span>(chunk_size != <span class="number">0</span>, <span class="string">"chunk_size must not be zero"</span>); |
| FoldChunksWith::new(<span class="self">self</span>, chunk_size, init, fold_op) |
| } |
| |
| <span class="doccomment">/// Lexicographically compares the elements of this `ParallelIterator` with those of |
| /// another. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::cmp::Ordering::*; |
| /// |
| /// let x = vec![1, 2, 3]; |
| /// assert_eq!(x.par_iter().cmp(&vec![1, 3, 0]), Less); |
| /// assert_eq!(x.par_iter().cmp(&vec![1, 2, 3]), Equal); |
| /// assert_eq!(x.par_iter().cmp(&vec![1, 2]), Greater); |
| /// ``` |
| </span><span class="kw">fn </span>cmp<I>(<span class="self">self</span>, other: I) -> Ordering |
| <span class="kw">where |
| </span>I: IntoParallelIterator<Item = <span class="self">Self</span>::Item>, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: Ord, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>ordering<T: Ord>((x, y): (T, T)) -> Ordering { |
| Ord::cmp(<span class="kw-2">&</span>x, <span class="kw-2">&</span>y) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>inequal(<span class="kw-2">&</span>ord: <span class="kw-2">&</span>Ordering) -> bool { |
| ord != Ordering::Equal |
| } |
| |
| <span class="kw">let </span>other = other.into_par_iter(); |
| <span class="kw">let </span>ord_len = <span class="self">self</span>.len().cmp(<span class="kw-2">&</span>other.len()); |
| <span class="self">self</span>.zip(other) |
| .map(ordering) |
| .find_first(inequal) |
| .unwrap_or(ord_len) |
| } |
| |
| <span class="doccomment">/// Lexicographically compares the elements of this `ParallelIterator` with those of |
| /// another. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::cmp::Ordering::*; |
| /// use std::f64::NAN; |
| /// |
| /// let x = vec![1.0, 2.0, 3.0]; |
| /// assert_eq!(x.par_iter().partial_cmp(&vec![1.0, 3.0, 0.0]), Some(Less)); |
| /// assert_eq!(x.par_iter().partial_cmp(&vec![1.0, 2.0, 3.0]), Some(Equal)); |
| /// assert_eq!(x.par_iter().partial_cmp(&vec![1.0, 2.0]), Some(Greater)); |
| /// assert_eq!(x.par_iter().partial_cmp(&vec![1.0, NAN]), None); |
| /// ``` |
| </span><span class="kw">fn </span>partial_cmp<I>(<span class="self">self</span>, other: I) -> <span class="prelude-ty">Option</span><Ordering> |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialOrd<I::Item>, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>ordering<T: PartialOrd<U>, U>((x, y): (T, U)) -> <span class="prelude-ty">Option</span><Ordering> { |
| PartialOrd::partial_cmp(<span class="kw-2">&</span>x, <span class="kw-2">&</span>y) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>inequal(<span class="kw-2">&</span>ord: <span class="kw-2">&</span><span class="prelude-ty">Option</span><Ordering>) -> bool { |
| ord != <span class="prelude-val">Some</span>(Ordering::Equal) |
| } |
| |
| <span class="kw">let </span>other = other.into_par_iter(); |
| <span class="kw">let </span>ord_len = <span class="self">self</span>.len().cmp(<span class="kw-2">&</span>other.len()); |
| <span class="self">self</span>.zip(other) |
| .map(ordering) |
| .find_first(inequal) |
| .unwrap_or(<span class="prelude-val">Some</span>(ord_len)) |
| } |
| |
| <span class="doccomment">/// Determines if the elements of this `ParallelIterator` |
| /// are equal to those of another |
| </span><span class="kw">fn </span>eq<I>(<span class="self">self</span>, other: I) -> bool |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialEq<I::Item>, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>eq<T: PartialEq<U>, U>((x, y): (T, U)) -> bool { |
| PartialEq::eq(<span class="kw-2">&</span>x, <span class="kw-2">&</span>y) |
| } |
| |
| <span class="kw">let </span>other = other.into_par_iter(); |
| <span class="self">self</span>.len() == other.len() && <span class="self">self</span>.zip(other).all(eq) |
| } |
| |
| <span class="doccomment">/// Determines if the elements of this `ParallelIterator` |
| /// are unequal to those of another |
| </span><span class="kw">fn </span>ne<I>(<span class="self">self</span>, other: I) -> bool |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialEq<I::Item>, |
| { |
| !<span class="self">self</span>.eq(other) |
| } |
| |
| <span class="doccomment">/// Determines if the elements of this `ParallelIterator` |
| /// are lexicographically less than those of another. |
| </span><span class="kw">fn </span>lt<I>(<span class="self">self</span>, other: I) -> bool |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialOrd<I::Item>, |
| { |
| <span class="self">self</span>.partial_cmp(other) == <span class="prelude-val">Some</span>(Ordering::Less) |
| } |
| |
| <span class="doccomment">/// Determines if the elements of this `ParallelIterator` |
| /// are less or equal to those of another. |
| </span><span class="kw">fn </span>le<I>(<span class="self">self</span>, other: I) -> bool |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialOrd<I::Item>, |
| { |
| <span class="kw">let </span>ord = <span class="self">self</span>.partial_cmp(other); |
| ord == <span class="prelude-val">Some</span>(Ordering::Equal) || ord == <span class="prelude-val">Some</span>(Ordering::Less) |
| } |
| |
| <span class="doccomment">/// Determines if the elements of this `ParallelIterator` |
| /// are lexicographically greater than those of another. |
| </span><span class="kw">fn </span>gt<I>(<span class="self">self</span>, other: I) -> bool |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialOrd<I::Item>, |
| { |
| <span class="self">self</span>.partial_cmp(other) == <span class="prelude-val">Some</span>(Ordering::Greater) |
| } |
| |
| <span class="doccomment">/// Determines if the elements of this `ParallelIterator` |
| /// are less or equal to those of another. |
| </span><span class="kw">fn </span>ge<I>(<span class="self">self</span>, other: I) -> bool |
| <span class="kw">where |
| </span>I: IntoParallelIterator, |
| I::Iter: IndexedParallelIterator, |
| <span class="self">Self</span>::Item: PartialOrd<I::Item>, |
| { |
| <span class="kw">let </span>ord = <span class="self">self</span>.partial_cmp(other); |
| ord == <span class="prelude-val">Some</span>(Ordering::Equal) || ord == <span class="prelude-val">Some</span>(Ordering::Greater) |
| } |
| |
| <span class="doccomment">/// Yields an index along with each item. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let chars = vec!['a', 'b', 'c']; |
| /// let result: Vec<_> = chars |
| /// .into_par_iter() |
| /// .enumerate() |
| /// .collect(); |
| /// |
| /// assert_eq!(result, [(0, 'a'), (1, 'b'), (2, 'c')]); |
| /// ``` |
| </span><span class="kw">fn </span>enumerate(<span class="self">self</span>) -> Enumerate<<span class="self">Self</span>> { |
| Enumerate::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that steps by the given amount |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| ///use rayon::prelude::*; |
| /// |
| /// let range = (3..10); |
| /// let result: Vec<i32> = range |
| /// .into_par_iter() |
| /// .step_by(3) |
| /// .collect(); |
| /// |
| /// assert_eq!(result, [3, 6, 9]) |
| /// ``` |
| </span><span class="kw">fn </span>step_by(<span class="self">self</span>, step: usize) -> StepBy<<span class="self">Self</span>> { |
| StepBy::new(<span class="self">self</span>, step) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that skips the first `n` elements. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..100) |
| /// .into_par_iter() |
| /// .skip(95) |
| /// .collect(); |
| /// |
| /// assert_eq!(result, [95, 96, 97, 98, 99]); |
| /// ``` |
| </span><span class="kw">fn </span>skip(<span class="self">self</span>, n: usize) -> Skip<<span class="self">Self</span>> { |
| Skip::new(<span class="self">self</span>, n) |
| } |
| |
| <span class="doccomment">/// Creates an iterator that yields the first `n` elements. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..100) |
| /// .into_par_iter() |
| /// .take(5) |
| /// .collect(); |
| /// |
| /// assert_eq!(result, [0, 1, 2, 3, 4]); |
| /// ``` |
| </span><span class="kw">fn </span>take(<span class="self">self</span>, n: usize) -> Take<<span class="self">Self</span>> { |
| Take::new(<span class="self">self</span>, n) |
| } |
| |
| <span class="doccomment">/// Searches for **some** item in the parallel iterator that |
| /// matches the given predicate, and returns its index. Like |
| /// `ParallelIterator::find_any`, the parallel search will not |
| /// necessarily find the **first** match, and once a match is |
| /// found we'll attempt to stop processing any more. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3, 3]; |
| /// |
| /// let i = a.par_iter().position_any(|&x| x == 3).expect("found"); |
| /// assert!(i == 2 || i == 3); |
| /// |
| /// assert_eq!(a.par_iter().position_any(|&x| x == 100), None); |
| /// ``` |
| </span><span class="kw">fn </span>position_any<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><usize> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>check(<span class="kw-2">&</span>(<span class="kw">_</span>, p): <span class="kw-2">&</span>(usize, bool)) -> bool { |
| p |
| } |
| |
| <span class="kw">let </span>(i, <span class="kw">_</span>) = <span class="self">self</span>.map(predicate).enumerate().find_any(check)<span class="question-mark">?</span>; |
| <span class="prelude-val">Some</span>(i) |
| } |
| |
| <span class="doccomment">/// Searches for the sequentially **first** item in the parallel iterator |
| /// that matches the given predicate, and returns its index. |
| /// |
| /// Like `ParallelIterator::find_first`, once a match is found, |
| /// all attempts to the right of the match will be stopped, while |
| /// attempts to the left must continue in case an earlier match |
| /// is found. |
| /// |
| /// Note that not all parallel iterators have a useful order, much like |
| /// sequential `HashMap` iteration, so "first" may be nebulous. If you |
| /// just want the first match that discovered anywhere in the iterator, |
| /// `position_any` is a better choice. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3, 3]; |
| /// |
| /// assert_eq!(a.par_iter().position_first(|&x| x == 3), Some(2)); |
| /// |
| /// assert_eq!(a.par_iter().position_first(|&x| x == 100), None); |
| /// ``` |
| </span><span class="kw">fn </span>position_first<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><usize> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>check(<span class="kw-2">&</span>(<span class="kw">_</span>, p): <span class="kw-2">&</span>(usize, bool)) -> bool { |
| p |
| } |
| |
| <span class="kw">let </span>(i, <span class="kw">_</span>) = <span class="self">self</span>.map(predicate).enumerate().find_first(check)<span class="question-mark">?</span>; |
| <span class="prelude-val">Some</span>(i) |
| } |
| |
| <span class="doccomment">/// Searches for the sequentially **last** item in the parallel iterator |
| /// that matches the given predicate, and returns its index. |
| /// |
| /// Like `ParallelIterator::find_last`, once a match is found, |
| /// all attempts to the left of the match will be stopped, while |
| /// attempts to the right must continue in case a later match |
| /// is found. |
| /// |
| /// Note that not all parallel iterators have a useful order, much like |
| /// sequential `HashMap` iteration, so "last" may be nebulous. When the |
| /// order doesn't actually matter to you, `position_any` is a better |
| /// choice. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let a = [1, 2, 3, 3]; |
| /// |
| /// assert_eq!(a.par_iter().position_last(|&x| x == 3), Some(3)); |
| /// |
| /// assert_eq!(a.par_iter().position_last(|&x| x == 100), None); |
| /// ``` |
| </span><span class="kw">fn </span>position_last<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><usize> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>check(<span class="kw-2">&</span>(<span class="kw">_</span>, p): <span class="kw-2">&</span>(usize, bool)) -> bool { |
| p |
| } |
| |
| <span class="kw">let </span>(i, <span class="kw">_</span>) = <span class="self">self</span>.map(predicate).enumerate().find_last(check)<span class="question-mark">?</span>; |
| <span class="prelude-val">Some</span>(i) |
| } |
| |
| <span class="attribute">#[doc(hidden)] |
| #[deprecated( |
| note = <span class="string">"parallel `position` does not search in order -- use `position_any`, \\ |
| `position_first`, or `position_last`" |
| </span>)] |
| </span><span class="kw">fn </span>position<P>(<span class="self">self</span>, predicate: P) -> <span class="prelude-ty">Option</span><usize> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| <span class="self">self</span>.position_any(predicate) |
| } |
| |
| <span class="doccomment">/// Searches for items in the parallel iterator that match the given |
| /// predicate, and returns their indices. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let primes = vec![2, 3, 5, 7, 11, 13, 17, 19, 23, 29]; |
| /// |
| /// // Find the positions of primes congruent to 1 modulo 6 |
| /// let p1mod6: Vec<_> = primes.par_iter().positions(|&p| p % 6 == 1).collect(); |
| /// assert_eq!(p1mod6, [3, 5, 7]); // primes 7, 13, and 19 |
| /// |
| /// // Find the positions of primes congruent to 5 modulo 6 |
| /// let p5mod6: Vec<_> = primes.par_iter().positions(|&p| p % 6 == 5).collect(); |
| /// assert_eq!(p5mod6, [2, 4, 6, 8, 9]); // primes 5, 11, 17, 23, and 29 |
| /// ``` |
| </span><span class="kw">fn </span>positions<P>(<span class="self">self</span>, predicate: P) -> Positions<<span class="self">Self</span>, P> |
| <span class="kw">where |
| </span>P: Fn(<span class="self">Self</span>::Item) -> bool + Sync + Send, |
| { |
| Positions::new(<span class="self">self</span>, predicate) |
| } |
| |
| <span class="doccomment">/// Produces a new iterator with the elements of this iterator in |
| /// reverse order. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let result: Vec<_> = (0..5) |
| /// .into_par_iter() |
| /// .rev() |
| /// .collect(); |
| /// |
| /// assert_eq!(result, [4, 3, 2, 1, 0]); |
| /// ``` |
| </span><span class="kw">fn </span>rev(<span class="self">self</span>) -> Rev<<span class="self">Self</span>> { |
| Rev::new(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Sets the minimum length of iterators desired to process in each |
| /// rayon job. Rayon will not split any smaller than this length, but |
| /// of course an iterator could already be smaller to begin with. |
| /// |
| /// Producers like `zip` and `interleave` will use greater of the two |
| /// minimums. |
| /// Chained iterators and iterators inside `flat_map` may each use |
| /// their own minimum length. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let min = (0..1_000_000) |
| /// .into_par_iter() |
| /// .with_min_len(1234) |
| /// .fold(|| 0, |acc, _| acc + 1) // count how many are in this segment |
| /// .min().unwrap(); |
| /// |
| /// assert!(min >= 1234); |
| /// ``` |
| </span><span class="kw">fn </span>with_min_len(<span class="self">self</span>, min: usize) -> MinLen<<span class="self">Self</span>> { |
| MinLen::new(<span class="self">self</span>, min) |
| } |
| |
| <span class="doccomment">/// Sets the maximum length of iterators desired to process in each |
| /// rayon job. Rayon will try to split at least below this length, |
| /// unless that would put it below the length from `with_min_len()`. |
| /// For example, given min=10 and max=15, a length of 16 will not be |
| /// split any further. |
| /// |
| /// Producers like `zip` and `interleave` will use lesser of the two |
| /// maximums. |
| /// Chained iterators and iterators inside `flat_map` may each use |
| /// their own maximum length. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let max = (0..1_000_000) |
| /// .into_par_iter() |
| /// .with_max_len(1234) |
| /// .fold(|| 0, |acc, _| acc + 1) // count how many are in this segment |
| /// .max().unwrap(); |
| /// |
| /// assert!(max <= 1234); |
| /// ``` |
| </span><span class="kw">fn </span>with_max_len(<span class="self">self</span>, max: usize) -> MaxLen<<span class="self">Self</span>> { |
| MaxLen::new(<span class="self">self</span>, max) |
| } |
| |
| <span class="doccomment">/// Produces an exact count of how many items this iterator will |
| /// produce, presuming no panic occurs. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let par_iter = (0..100).into_par_iter().zip(vec![0; 10]); |
| /// assert_eq!(par_iter.len(), 10); |
| /// |
| /// let vec: Vec<_> = par_iter.collect(); |
| /// assert_eq!(vec.len(), 10); |
| /// ``` |
| </span><span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize; |
| |
| <span class="doccomment">/// Internal method used to define the behavior of this parallel |
| /// iterator. You should not need to call this directly. |
| /// |
| /// This method causes the iterator `self` to start producing |
| /// items and to feed them to the consumer `consumer` one by one. |
| /// It may split the consumer before doing so to create the |
| /// opportunity to produce in parallel. If a split does happen, it |
| /// will inform the consumer of the index where the split should |
| /// occur (unlike `ParallelIterator::drive_unindexed()`). |
| /// |
| /// See the [README] for more details on the internals of parallel |
| /// iterators. |
| /// |
| /// [README]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md |
| </span><span class="kw">fn </span>drive<C: Consumer<<span class="self">Self</span>::Item>>(<span class="self">self</span>, consumer: C) -> C::Result; |
| |
| <span class="doccomment">/// Internal method used to define the behavior of this parallel |
| /// iterator. You should not need to call this directly. |
| /// |
| /// This method converts the iterator into a producer P and then |
| /// invokes `callback.callback()` with P. Note that the type of |
| /// this producer is not defined as part of the API, since |
| /// `callback` must be defined generically for all producers. This |
| /// allows the producer type to contain references; it also means |
| /// that parallel iterators can adjust that type without causing a |
| /// breaking change. |
| /// |
| /// See the [README] for more details on the internals of parallel |
| /// iterators. |
| /// |
| /// [README]: https://github.com/rayon-rs/rayon/blob/master/src/iter/plumbing/README.md |
| </span><span class="kw">fn </span>with_producer<CB: ProducerCallback<<span class="self">Self</span>::Item>>(<span class="self">self</span>, callback: CB) -> CB::Output; |
| } |
| |
| <span class="doccomment">/// `FromParallelIterator` implements the creation of a collection |
| /// from a [`ParallelIterator`]. By implementing |
| /// `FromParallelIterator` for a given type, you define how it will be |
| /// created from an iterator. |
| /// |
| /// `FromParallelIterator` is used through [`ParallelIterator`]'s [`collect()`] method. |
| /// |
| /// [`ParallelIterator`]: trait.ParallelIterator.html |
| /// [`collect()`]: trait.ParallelIterator.html#method.collect |
| /// |
| /// # Examples |
| /// |
| /// Implementing `FromParallelIterator` for your type: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::mem; |
| /// |
| /// struct BlackHole { |
| /// mass: usize, |
| /// } |
| /// |
| /// impl<T: Send> FromParallelIterator<T> for BlackHole { |
| /// fn from_par_iter<I>(par_iter: I) -> Self |
| /// where I: IntoParallelIterator<Item = T> |
| /// { |
| /// let par_iter = par_iter.into_par_iter(); |
| /// BlackHole { |
| /// mass: par_iter.count() * mem::size_of::<T>(), |
| /// } |
| /// } |
| /// } |
| /// |
| /// let bh: BlackHole = (0i32..1000).into_par_iter().collect(); |
| /// assert_eq!(bh.mass, 4000); |
| /// ``` |
| </span><span class="kw">pub trait </span>FromParallelIterator<T> |
| <span class="kw">where |
| </span>T: Send, |
| { |
| <span class="doccomment">/// Creates an instance of the collection from the parallel iterator `par_iter`. |
| /// |
| /// If your collection is not naturally parallel, the easiest (and |
| /// fastest) way to do this is often to collect `par_iter` into a |
| /// [`LinkedList`] or other intermediate data structure and then |
| /// sequentially extend your collection. However, a more 'native' |
| /// technique is to use the [`par_iter.fold`] or |
| /// [`par_iter.fold_with`] methods to create the collection. |
| /// Alternatively, if your collection is 'natively' parallel, you |
| /// can use `par_iter.for_each` to process each element in turn. |
| /// |
| /// [`LinkedList`]: https://doc.rust-lang.org/std/collections/struct.LinkedList.html |
| /// [`par_iter.fold`]: trait.ParallelIterator.html#method.fold |
| /// [`par_iter.fold_with`]: trait.ParallelIterator.html#method.fold_with |
| /// [`par_iter.for_each`]: trait.ParallelIterator.html#method.for_each |
| </span><span class="kw">fn </span>from_par_iter<I>(par_iter: I) -> <span class="self">Self |
| </span><span class="kw">where |
| </span>I: IntoParallelIterator<Item = T>; |
| } |
| |
| <span class="doccomment">/// `ParallelExtend` extends an existing collection with items from a [`ParallelIterator`]. |
| /// |
| /// [`ParallelIterator`]: trait.ParallelIterator.html |
| /// |
| /// # Examples |
| /// |
| /// Implementing `ParallelExtend` for your type: |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::mem; |
| /// |
| /// struct BlackHole { |
| /// mass: usize, |
| /// } |
| /// |
| /// impl<T: Send> ParallelExtend<T> for BlackHole { |
| /// fn par_extend<I>(&mut self, par_iter: I) |
| /// where I: IntoParallelIterator<Item = T> |
| /// { |
| /// let par_iter = par_iter.into_par_iter(); |
| /// self.mass += par_iter.count() * mem::size_of::<T>(); |
| /// } |
| /// } |
| /// |
| /// let mut bh = BlackHole { mass: 0 }; |
| /// bh.par_extend(0i32..1000); |
| /// assert_eq!(bh.mass, 4000); |
| /// bh.par_extend(0i64..10); |
| /// assert_eq!(bh.mass, 4080); |
| /// ``` |
| </span><span class="kw">pub trait </span>ParallelExtend<T> |
| <span class="kw">where |
| </span>T: Send, |
| { |
| <span class="doccomment">/// Extends an instance of the collection with the elements drawn |
| /// from the parallel iterator `par_iter`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let mut vec = vec![]; |
| /// vec.par_extend(0..5); |
| /// vec.par_extend((0..5).into_par_iter().map(|i| i * i)); |
| /// assert_eq!(vec, [0, 1, 2, 3, 4, 0, 1, 4, 9, 16]); |
| /// ``` |
| </span><span class="kw">fn </span>par_extend<I>(<span class="kw-2">&mut </span><span class="self">self</span>, par_iter: I) |
| <span class="kw">where |
| </span>I: IntoParallelIterator<Item = T>; |
| } |
| |
| <span class="doccomment">/// `ParallelDrainFull` creates a parallel iterator that moves all items |
| /// from a collection while retaining the original capacity. |
| /// |
| /// Types which are indexable typically implement [`ParallelDrainRange`] |
| /// instead, where you can drain fully with `par_drain(..)`. |
| /// |
| /// [`ParallelDrainRange`]: trait.ParallelDrainRange.html |
| </span><span class="kw">pub trait </span>ParallelDrainFull { |
| <span class="doccomment">/// The draining parallel iterator type that will be created. |
| </span><span class="kw">type </span>Iter: ParallelIterator<Item = <span class="self">Self</span>::Item>; |
| |
| <span class="doccomment">/// The type of item that the parallel iterator will produce. |
| /// This is usually the same as `IntoParallelIterator::Item`. |
| </span><span class="kw">type </span>Item: Send; |
| |
| <span class="doccomment">/// Returns a draining parallel iterator over an entire collection. |
| /// |
| /// When the iterator is dropped, all items are removed, even if the |
| /// iterator was not fully consumed. If the iterator is leaked, for example |
| /// using `std::mem::forget`, it is unspecified how many items are removed. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// use std::collections::{BinaryHeap, HashSet}; |
| /// |
| /// let squares: HashSet<i32> = (0..10).map(|x| x * x).collect(); |
| /// |
| /// let mut heap: BinaryHeap<_> = squares.iter().copied().collect(); |
| /// assert_eq!( |
| /// // heaps are drained in arbitrary order |
| /// heap.par_drain() |
| /// .inspect(|x| assert!(squares.contains(x))) |
| /// .count(), |
| /// squares.len(), |
| /// ); |
| /// assert!(heap.is_empty()); |
| /// assert!(heap.capacity() >= squares.len()); |
| /// ``` |
| </span><span class="kw">fn </span>par_drain(<span class="self">self</span>) -> <span class="self">Self</span>::Iter; |
| } |
| |
| <span class="doccomment">/// `ParallelDrainRange` creates a parallel iterator that moves a range of items |
| /// from a collection while retaining the original capacity. |
| /// |
| /// Types which are not indexable may implement [`ParallelDrainFull`] instead. |
| /// |
| /// [`ParallelDrainFull`]: trait.ParallelDrainFull.html |
| </span><span class="kw">pub trait </span>ParallelDrainRange<Idx = usize> { |
| <span class="doccomment">/// The draining parallel iterator type that will be created. |
| </span><span class="kw">type </span>Iter: ParallelIterator<Item = <span class="self">Self</span>::Item>; |
| |
| <span class="doccomment">/// The type of item that the parallel iterator will produce. |
| /// This is usually the same as `IntoParallelIterator::Item`. |
| </span><span class="kw">type </span>Item: Send; |
| |
| <span class="doccomment">/// Returns a draining parallel iterator over a range of the collection. |
| /// |
| /// When the iterator is dropped, all items in the range are removed, even |
| /// if the iterator was not fully consumed. If the iterator is leaked, for |
| /// example using `std::mem::forget`, it is unspecified how many items are |
| /// removed. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use rayon::prelude::*; |
| /// |
| /// let squares: Vec<i32> = (0..10).map(|x| x * x).collect(); |
| /// |
| /// println!("RangeFull"); |
| /// let mut vec = squares.clone(); |
| /// assert!(vec.par_drain(..) |
| /// .eq(squares.par_iter().copied())); |
| /// assert!(vec.is_empty()); |
| /// assert!(vec.capacity() >= squares.len()); |
| /// |
| /// println!("RangeFrom"); |
| /// let mut vec = squares.clone(); |
| /// assert!(vec.par_drain(5..) |
| /// .eq(squares[5..].par_iter().copied())); |
| /// assert_eq!(&vec[..], &squares[..5]); |
| /// assert!(vec.capacity() >= squares.len()); |
| /// |
| /// println!("RangeTo"); |
| /// let mut vec = squares.clone(); |
| /// assert!(vec.par_drain(..5) |
| /// .eq(squares[..5].par_iter().copied())); |
| /// assert_eq!(&vec[..], &squares[5..]); |
| /// assert!(vec.capacity() >= squares.len()); |
| /// |
| /// println!("RangeToInclusive"); |
| /// let mut vec = squares.clone(); |
| /// assert!(vec.par_drain(..=5) |
| /// .eq(squares[..=5].par_iter().copied())); |
| /// assert_eq!(&vec[..], &squares[6..]); |
| /// assert!(vec.capacity() >= squares.len()); |
| /// |
| /// println!("Range"); |
| /// let mut vec = squares.clone(); |
| /// assert!(vec.par_drain(3..7) |
| /// .eq(squares[3..7].par_iter().copied())); |
| /// assert_eq!(&vec[..3], &squares[..3]); |
| /// assert_eq!(&vec[3..], &squares[7..]); |
| /// assert!(vec.capacity() >= squares.len()); |
| /// |
| /// println!("RangeInclusive"); |
| /// let mut vec = squares.clone(); |
| /// assert!(vec.par_drain(3..=7) |
| /// .eq(squares[3..=7].par_iter().copied())); |
| /// assert_eq!(&vec[..3], &squares[..3]); |
| /// assert_eq!(&vec[3..], &squares[8..]); |
| /// assert!(vec.capacity() >= squares.len()); |
| /// ``` |
| </span><span class="kw">fn </span>par_drain<R: RangeBounds<Idx>>(<span class="self">self</span>, range: R) -> <span class="self">Self</span>::Iter; |
| } |
| |
| <span class="doccomment">/// We hide the `Try` trait in a private module, as it's only meant to be a |
| /// stable clone of the standard library's `Try` trait, as yet unstable. |
| </span><span class="kw">mod </span>private { |
| <span class="kw">use </span>std::convert::Infallible; |
| <span class="kw">use </span>std::ops::ControlFlow::{<span class="self">self</span>, Break, Continue}; |
| <span class="kw">use </span>std::task::Poll; |
| |
| <span class="doccomment">/// Clone of `std::ops::Try`. |
| /// |
| /// Implementing this trait is not permitted outside of `rayon`. |
| </span><span class="kw">pub trait </span>Try { |
| <span class="macro">private_decl! </span>{} |
| |
| <span class="kw">type </span>Output; |
| <span class="kw">type </span>Residual; |
| |
| <span class="kw">fn </span>from_output(output: <span class="self">Self</span>::Output) -> <span class="self">Self</span>; |
| |
| <span class="kw">fn </span>from_residual(residual: <span class="self">Self</span>::Residual) -> <span class="self">Self</span>; |
| |
| <span class="kw">fn </span>branch(<span class="self">self</span>) -> ControlFlow<<span class="self">Self</span>::Residual, <span class="self">Self</span>::Output>; |
| } |
| |
| <span class="kw">impl</span><B, C> Try <span class="kw">for </span>ControlFlow<B, C> { |
| <span class="macro">private_impl! </span>{} |
| |
| <span class="kw">type </span>Output = C; |
| <span class="kw">type </span>Residual = ControlFlow<B, Infallible>; |
| |
| <span class="kw">fn </span>from_output(output: <span class="self">Self</span>::Output) -> <span class="self">Self </span>{ |
| Continue(output) |
| } |
| |
| <span class="kw">fn </span>from_residual(residual: <span class="self">Self</span>::Residual) -> <span class="self">Self </span>{ |
| <span class="kw">match </span>residual { |
| Break(b) => Break(b), |
| Continue(<span class="kw">_</span>) => <span class="macro">unreachable!</span>(), |
| } |
| } |
| |
| <span class="kw">fn </span>branch(<span class="self">self</span>) -> ControlFlow<<span class="self">Self</span>::Residual, <span class="self">Self</span>::Output> { |
| <span class="kw">match </span><span class="self">self </span>{ |
| Continue(c) => Continue(c), |
| Break(b) => Break(Break(b)), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T> Try <span class="kw">for </span><span class="prelude-ty">Option</span><T> { |
| <span class="macro">private_impl! </span>{} |
| |
| <span class="kw">type </span>Output = T; |
| <span class="kw">type </span>Residual = <span class="prelude-ty">Option</span><Infallible>; |
| |
| <span class="kw">fn </span>from_output(output: <span class="self">Self</span>::Output) -> <span class="self">Self </span>{ |
| <span class="prelude-val">Some</span>(output) |
| } |
| |
| <span class="kw">fn </span>from_residual(residual: <span class="self">Self</span>::Residual) -> <span class="self">Self </span>{ |
| <span class="kw">match </span>residual { |
| <span class="prelude-val">None </span>=> <span class="prelude-val">None</span>, |
| <span class="prelude-val">Some</span>(<span class="kw">_</span>) => <span class="macro">unreachable!</span>(), |
| } |
| } |
| |
| <span class="kw">fn </span>branch(<span class="self">self</span>) -> ControlFlow<<span class="self">Self</span>::Residual, <span class="self">Self</span>::Output> { |
| <span class="kw">match </span><span class="self">self </span>{ |
| <span class="prelude-val">Some</span>(c) => Continue(c), |
| <span class="prelude-val">None </span>=> Break(<span class="prelude-val">None</span>), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, E> Try <span class="kw">for </span><span class="prelude-ty">Result</span><T, E> { |
| <span class="macro">private_impl! </span>{} |
| |
| <span class="kw">type </span>Output = T; |
| <span class="kw">type </span>Residual = <span class="prelude-ty">Result</span><Infallible, E>; |
| |
| <span class="kw">fn </span>from_output(output: <span class="self">Self</span>::Output) -> <span class="self">Self </span>{ |
| <span class="prelude-val">Ok</span>(output) |
| } |
| |
| <span class="kw">fn </span>from_residual(residual: <span class="self">Self</span>::Residual) -> <span class="self">Self </span>{ |
| <span class="kw">match </span>residual { |
| <span class="prelude-val">Err</span>(e) => <span class="prelude-val">Err</span>(e), |
| <span class="prelude-val">Ok</span>(<span class="kw">_</span>) => <span class="macro">unreachable!</span>(), |
| } |
| } |
| |
| <span class="kw">fn </span>branch(<span class="self">self</span>) -> ControlFlow<<span class="self">Self</span>::Residual, <span class="self">Self</span>::Output> { |
| <span class="kw">match </span><span class="self">self </span>{ |
| <span class="prelude-val">Ok</span>(c) => Continue(c), |
| <span class="prelude-val">Err</span>(e) => Break(<span class="prelude-val">Err</span>(e)), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, E> Try <span class="kw">for </span>Poll<<span class="prelude-ty">Result</span><T, E>> { |
| <span class="macro">private_impl! </span>{} |
| |
| <span class="kw">type </span>Output = Poll<T>; |
| <span class="kw">type </span>Residual = <span class="prelude-ty">Result</span><Infallible, E>; |
| |
| <span class="kw">fn </span>from_output(output: <span class="self">Self</span>::Output) -> <span class="self">Self </span>{ |
| output.map(<span class="prelude-val">Ok</span>) |
| } |
| |
| <span class="kw">fn </span>from_residual(residual: <span class="self">Self</span>::Residual) -> <span class="self">Self </span>{ |
| <span class="kw">match </span>residual { |
| <span class="prelude-val">Err</span>(e) => Poll::Ready(<span class="prelude-val">Err</span>(e)), |
| <span class="prelude-val">Ok</span>(<span class="kw">_</span>) => <span class="macro">unreachable!</span>(), |
| } |
| } |
| |
| <span class="kw">fn </span>branch(<span class="self">self</span>) -> ControlFlow<<span class="self">Self</span>::Residual, <span class="self">Self</span>::Output> { |
| <span class="kw">match </span><span class="self">self </span>{ |
| Poll::Pending => Continue(Poll::Pending), |
| Poll::Ready(<span class="prelude-val">Ok</span>(c)) => Continue(Poll::Ready(c)), |
| Poll::Ready(<span class="prelude-val">Err</span>(e)) => Break(<span class="prelude-val">Err</span>(e)), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, E> Try <span class="kw">for </span>Poll<<span class="prelude-ty">Option</span><<span class="prelude-ty">Result</span><T, E>>> { |
| <span class="macro">private_impl! </span>{} |
| |
| <span class="kw">type </span>Output = Poll<<span class="prelude-ty">Option</span><T>>; |
| <span class="kw">type </span>Residual = <span class="prelude-ty">Result</span><Infallible, E>; |
| |
| <span class="kw">fn </span>from_output(output: <span class="self">Self</span>::Output) -> <span class="self">Self </span>{ |
| <span class="kw">match </span>output { |
| Poll::Ready(o) => Poll::Ready(o.map(<span class="prelude-val">Ok</span>)), |
| Poll::Pending => Poll::Pending, |
| } |
| } |
| |
| <span class="kw">fn </span>from_residual(residual: <span class="self">Self</span>::Residual) -> <span class="self">Self </span>{ |
| <span class="kw">match </span>residual { |
| <span class="prelude-val">Err</span>(e) => Poll::Ready(<span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(e))), |
| <span class="prelude-val">Ok</span>(<span class="kw">_</span>) => <span class="macro">unreachable!</span>(), |
| } |
| } |
| |
| <span class="kw">fn </span>branch(<span class="self">self</span>) -> ControlFlow<<span class="self">Self</span>::Residual, <span class="self">Self</span>::Output> { |
| <span class="kw">match </span><span class="self">self </span>{ |
| Poll::Pending => Continue(Poll::Pending), |
| Poll::Ready(<span class="prelude-val">None</span>) => Continue(Poll::Ready(<span class="prelude-val">None</span>)), |
| Poll::Ready(<span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>(c))) => Continue(Poll::Ready(<span class="prelude-val">Some</span>(c))), |
| Poll::Ready(<span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(e))) => Break(<span class="prelude-val">Err</span>(e)), |
| } |
| } |
| } |
| } |
| </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> |
