<!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 `/home/sangenya/.cargo/registry/src/github.com-1ecc6299db9ec823/rayon-1.5.1/src/iter/collect/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.rs - source</title><link rel="stylesheet" type="text/css" href="../../../../normalize.css"><link rel="stylesheet" type="text/css" href="../../../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" type="text/css" href="../../../../light.css" id="themeStyle"><link rel="stylesheet" type="text/css" href="../../../../dark.css" disabled ><link rel="stylesheet" type="text/css" href="../../../../ayu.css" disabled ><script id="default-settings"></script><script src="../../../../storage.js"></script><script src="../../../../crates.js"></script><noscript><link rel="stylesheet" href="../../../../noscript.css"></noscript><link rel="icon" type="image/svg+xml" href="../../../../favicon.svg">
<link rel="alternate icon" type="image/png" href="../../../../favicon-16x16.png">
<link rel="alternate icon" type="image/png" href="../../../../favicon-32x32.png"><style type="text/css">#crate-search{background-image:url("../../../../down-arrow.svg");}</style></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"><div class="sidebar-menu" role="button">☰</div><a href='../../../../rayon/index.html'><div class='logo-container rust-logo'><img src='../../../../rust-logo.png' alt='logo'></div></a></nav><div class="theme-picker"><button id="theme-picker" aria-label="Pick another theme!" aria-haspopup="menu" title="themes"><img src="../../../../brush.svg" width="18" height="18" alt="Pick another theme!"></button><div id="theme-choices" role="menu"></div></div><nav class="sub"><form class="search-form"><div class="search-container"><div><select id="crate-search"><option value="All crates">All crates</option></select><input class="search-input" name="search" disabled autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"></div><button type="button" id="help-button" title="help">?</button><a id="settings-menu" href="../../../../settings.html" title="settings"><img src="../../../../wheel.svg" width="18" height="18" alt="Change settings"></a></div></form></nav><section id="main" class="content"><div class="example-wrap"><pre class="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>
</pre><pre class="rust">
<span class="kw">use</span> <span class="kw">super</span>::{<span class="ident">IndexedParallelIterator</span>, <span class="ident">IntoParallelIterator</span>, <span class="ident">ParallelExtend</span>, <span class="ident">ParallelIterator</span>};
<span class="kw">use</span> <span class="ident">std::mem::MaybeUninit</span>;
<span class="kw">use</span> <span class="ident">std::slice</span>;
<span class="kw">mod</span> <span class="ident">consumer</span>;
<span class="kw">use</span> <span class="self">self</span><span class="ident">::consumer::CollectConsumer</span>;
<span class="kw">use</span> <span class="self">self</span><span class="ident">::consumer::CollectResult</span>;
<span class="kw">use</span> <span class="kw">super</span><span class="ident">::unzip::unzip_indexed</span>;
<span class="kw">mod</span> <span class="ident">test</span>;
<span class="doccomment">/// Collects the results of the exact iterator into the specified vector.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This is called by `IndexedParallelIterator::collect_into_vec`.</span>
<span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn</span> <span class="ident">collect_into_vec</span><span class="op"><</span><span class="ident">I</span>, <span class="ident">T</span><span class="op">></span>(<span class="ident">pi</span>: <span class="ident">I</span>, <span class="ident">v</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>)
<span class="kw">where</span>
<span class="ident">I</span>: <span class="ident">IndexedParallelIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">></span>,
<span class="ident">T</span>: <span class="ident">Send</span>,
{
<span class="ident">v</span>.<span class="ident">truncate</span>(<span class="number">0</span>); <span class="comment">// clear any old data</span>
<span class="kw">let</span> <span class="ident">len</span> <span class="op">=</span> <span class="ident">pi</span>.<span class="ident">len</span>();
<span class="ident">Collect::new</span>(<span class="ident">v</span>, <span class="ident">len</span>).<span class="ident">with_consumer</span>(<span class="op">|</span><span class="ident">consumer</span><span class="op">|</span> <span class="ident">pi</span>.<span class="ident">drive</span>(<span class="ident">consumer</span>));
}
<span class="doccomment">/// Collects the results of the iterator into the specified vector.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Technically, this only works for `IndexedParallelIterator`, but we're faking a</span>
<span class="doccomment">/// bit of specialization here until Rust can do that natively. Callers are</span>
<span class="doccomment">/// using `opt_len` to find the length before calling this, and only exact</span>
<span class="doccomment">/// iterators will return anything but `None` there.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Since the type system doesn't understand that contract, we have to allow</span>
<span class="doccomment">/// *any* `ParallelIterator` here, and `CollectConsumer` has to also implement</span>
<span class="doccomment">/// `UnindexedConsumer`. That implementation panics `unreachable!` in case</span>
<span class="doccomment">/// there's a bug where we actually do try to use this unindexed.</span>
<span class="kw">fn</span> <span class="ident">special_extend</span><span class="op"><</span><span class="ident">I</span>, <span class="ident">T</span><span class="op">></span>(<span class="ident">pi</span>: <span class="ident">I</span>, <span class="ident">len</span>: <span class="ident">usize</span>, <span class="ident">v</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>)
<span class="kw">where</span>
<span class="ident">I</span>: <span class="ident">ParallelIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">></span>,
<span class="ident">T</span>: <span class="ident">Send</span>,
{
<span class="ident">Collect::new</span>(<span class="ident">v</span>, <span class="ident">len</span>).<span class="ident">with_consumer</span>(<span class="op">|</span><span class="ident">consumer</span><span class="op">|</span> <span class="ident">pi</span>.<span class="ident">drive_unindexed</span>(<span class="ident">consumer</span>));
}
<span class="doccomment">/// Unzips the results of the exact iterator into the specified vectors.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This is called by `IndexedParallelIterator::unzip_into_vecs`.</span>
<span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn</span> <span class="ident">unzip_into_vecs</span><span class="op"><</span><span class="ident">I</span>, <span class="ident">A</span>, <span class="ident">B</span><span class="op">></span>(<span class="ident">pi</span>: <span class="ident">I</span>, <span class="ident">left</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">A</span><span class="op">></span>, <span class="ident">right</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">B</span><span class="op">></span>)
<span class="kw">where</span>
<span class="ident">I</span>: <span class="ident">IndexedParallelIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> (<span class="ident">A</span>, <span class="ident">B</span>)<span class="op">></span>,
<span class="ident">A</span>: <span class="ident">Send</span>,
<span class="ident">B</span>: <span class="ident">Send</span>,
{
<span class="comment">// clear any old data</span>
<span class="ident">left</span>.<span class="ident">truncate</span>(<span class="number">0</span>);
<span class="ident">right</span>.<span class="ident">truncate</span>(<span class="number">0</span>);
<span class="kw">let</span> <span class="ident">len</span> <span class="op">=</span> <span class="ident">pi</span>.<span class="ident">len</span>();
<span class="ident">Collect::new</span>(<span class="ident">right</span>, <span class="ident">len</span>).<span class="ident">with_consumer</span>(<span class="op">|</span><span class="ident">right_consumer</span><span class="op">|</span> {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">right_result</span> <span class="op">=</span> <span class="prelude-val">None</span>;
<span class="ident">Collect::new</span>(<span class="ident">left</span>, <span class="ident">len</span>).<span class="ident">with_consumer</span>(<span class="op">|</span><span class="ident">left_consumer</span><span class="op">|</span> {
<span class="kw">let</span> (<span class="ident">left_r</span>, <span class="ident">right_r</span>) <span class="op">=</span> <span class="ident">unzip_indexed</span>(<span class="ident">pi</span>, <span class="ident">left_consumer</span>, <span class="ident">right_consumer</span>);
<span class="ident">right_result</span> <span class="op">=</span> <span class="prelude-val">Some</span>(<span class="ident">right_r</span>);
<span class="ident">left_r</span>
});
<span class="ident">right_result</span>.<span class="ident">unwrap</span>()
});
}
<span class="doccomment">/// Manage the collection vector.</span>
<span class="kw">struct</span> <span class="ident">Collect</span><span class="op"><</span><span class="lifetime">'c</span>, <span class="ident">T</span>: <span class="ident">Send</span><span class="op">></span> {
<span class="ident">vec</span>: <span class="kw-2">&</span><span class="lifetime">'c</span> <span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
<span class="ident">len</span>: <span class="ident">usize</span>,
}
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'c</span>, <span class="ident">T</span>: <span class="ident">Send</span> <span class="op">+</span> <span class="lifetime">'c</span><span class="op">></span> <span class="ident">Collect</span><span class="op"><</span><span class="lifetime">'c</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">new</span>(<span class="ident">vec</span>: <span class="kw-2">&</span><span class="lifetime">'c</span> <span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>, <span class="ident">len</span>: <span class="ident">usize</span>) <span class="op">-</span><span class="op">></span> <span class="self">Self</span> {
<span class="ident">Collect</span> { <span class="ident">vec</span>, <span class="ident">len</span> }
}
<span class="doccomment">/// Create a consumer on the slice of memory we are collecting into.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// The consumer needs to be used inside the scope function, and the</span>
<span class="doccomment">/// complete collect result passed back.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This method will verify the collect result, and panic if the slice</span>
<span class="doccomment">/// was not fully written into. Otherwise, in the successful case,</span>
<span class="doccomment">/// the vector is complete with the collected result.</span>
<span class="kw">fn</span> <span class="ident">with_consumer</span><span class="op"><</span><span class="ident">F</span><span class="op">></span>(<span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">scope_fn</span>: <span class="ident">F</span>)
<span class="kw">where</span>
<span class="ident">F</span>: <span class="ident">FnOnce</span>(<span class="ident">CollectConsumer</span><span class="op"><</span><span class="lifetime">'_</span>, <span class="ident">T</span><span class="op">></span>) <span class="op">-</span><span class="op">></span> <span class="ident">CollectResult</span><span class="op"><</span><span class="lifetime">'_</span>, <span class="ident">T</span><span class="op">></span>,
{
<span class="kw">let</span> <span class="ident">slice</span> <span class="op">=</span> <span class="self">Self</span><span class="ident">::reserve_get_tail_slice</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>.<span class="ident">vec</span>, <span class="self">self</span>.<span class="ident">len</span>);
<span class="kw">let</span> <span class="ident">result</span> <span class="op">=</span> <span class="ident">scope_fn</span>(<span class="ident">CollectConsumer::new</span>(<span class="ident">slice</span>));
<span class="comment">// The CollectResult represents a contiguous part of the</span>
<span class="comment">// slice, that has been written to.</span>
<span class="comment">// On unwind here, the CollectResult will be dropped.</span>
<span class="comment">// If some producers on the way did not produce enough elements,</span>
<span class="comment">// partial CollectResults may have been dropped without</span>
<span class="comment">// being reduced to the final result, and we will see</span>
<span class="comment">// that as the length coming up short.</span>
<span class="comment">//</span>
<span class="comment">// Here, we assert that `slice` is fully initialized. This is</span>
<span class="comment">// checked by the following assert, which verifies if a</span>
<span class="comment">// complete CollectResult was produced; if the length is</span>
<span class="comment">// correct, it is necessarily covering the target slice.</span>
<span class="comment">// Since we know that the consumer cannot have escaped from</span>
<span class="comment">// `drive` (by parametricity, essentially), we know that any</span>
<span class="comment">// stores that will happen, have happened. Unless some code is buggy,</span>
<span class="comment">// that means we should have seen `len` total writes.</span>
<span class="kw">let</span> <span class="ident">actual_writes</span> <span class="op">=</span> <span class="ident">result</span>.<span class="ident">len</span>();
<span class="macro">assert!</span>(
<span class="ident">actual_writes</span> <span class="op">=</span><span class="op">=</span> <span class="self">self</span>.<span class="ident">len</span>,
<span class="string">"expected {} total writes, but got {}"</span>,
<span class="self">self</span>.<span class="ident">len</span>,
<span class="ident">actual_writes</span>
);
<span class="comment">// Release the result's mutable borrow and "proxy ownership"</span>
<span class="comment">// of the elements, before the vector takes it over.</span>
<span class="ident">result</span>.<span class="ident">release_ownership</span>();
<span class="kw">let</span> <span class="ident">new_len</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">vec</span>.<span class="ident">len</span>() <span class="op">+</span> <span class="self">self</span>.<span class="ident">len</span>;
<span class="kw">unsafe</span> {
<span class="self">self</span>.<span class="ident">vec</span>.<span class="ident">set_len</span>(<span class="ident">new_len</span>);
}
}
<span class="doccomment">/// Reserve space for `len` more elements in the vector,</span>
<span class="doccomment">/// and return a slice to the uninitialized tail of the vector</span>
<span class="kw">fn</span> <span class="ident">reserve_get_tail_slice</span>(<span class="ident">vec</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>, <span class="ident">len</span>: <span class="ident">usize</span>) <span class="op">-</span><span class="op">></span> <span class="kw-2">&</span><span class="kw-2">mut</span> [<span class="ident">MaybeUninit</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>] {
<span class="comment">// Reserve the new space.</span>
<span class="ident">vec</span>.<span class="ident">reserve</span>(<span class="ident">len</span>);
<span class="comment">// TODO: use `Vec::spare_capacity_mut` instead</span>
<span class="comment">// SAFETY: `MaybeUninit<T>` is guaranteed to have the same layout</span>
<span class="comment">// as `T`, and we already made sure to have the additional space.</span>
<span class="kw">let</span> <span class="ident">start</span> <span class="op">=</span> <span class="ident">vec</span>.<span class="ident">len</span>();
<span class="kw">let</span> <span class="ident">tail_ptr</span> <span class="op">=</span> <span class="ident">vec</span>[<span class="ident">start</span>..].<span class="ident">as_mut_ptr</span>() <span class="kw">as</span> <span class="kw-2">*</span><span class="kw-2">mut</span> <span class="ident">MaybeUninit</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>;
<span class="kw">unsafe</span> { <span class="ident">slice::from_raw_parts_mut</span>(<span class="ident">tail_ptr</span>, <span class="ident">len</span>) }
}
}
<span class="doccomment">/// Extends a vector with items from a parallel iterator.</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">ParallelExtend</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">T</span>: <span class="ident">Send</span>,
{
<span class="kw">fn</span> <span class="ident">par_extend</span><span class="op"><</span><span class="ident">I</span><span class="op">></span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">par_iter</span>: <span class="ident">I</span>)
<span class="kw">where</span>
<span class="ident">I</span>: <span class="ident">IntoParallelIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">></span>,
{
<span class="comment">// See the vec_collect benchmarks in rayon-demo for different strategies.</span>
<span class="kw">let</span> <span class="ident">par_iter</span> <span class="op">=</span> <span class="ident">par_iter</span>.<span class="ident">into_par_iter</span>();
<span class="kw">match</span> <span class="ident">par_iter</span>.<span class="ident">opt_len</span>() {
<span class="prelude-val">Some</span>(<span class="ident">len</span>) <span class="op">=</span><span class="op">></span> {
<span class="comment">// When Rust gets specialization, we can get here for indexed iterators</span>
<span class="comment">// without relying on `opt_len`. Until then, `special_extend()` fakes</span>
<span class="comment">// an unindexed mode on the promise that `opt_len()` is accurate.</span>
<span class="ident">special_extend</span>(<span class="ident">par_iter</span>, <span class="ident">len</span>, <span class="self">self</span>);
}
<span class="prelude-val">None</span> <span class="op">=</span><span class="op">></span> {
<span class="comment">// This works like `extend`, but `Vec::append` is more efficient.</span>
<span class="kw">let</span> <span class="ident">list</span> <span class="op">=</span> <span class="kw">super</span><span class="ident">::extend::collect</span>(<span class="ident">par_iter</span>);
<span class="self">self</span>.<span class="ident">reserve</span>(<span class="kw">super</span><span class="ident">::extend::len</span>(<span class="kw-2">&</span><span class="ident">list</span>));
<span class="kw">for</span> <span class="kw-2">mut</span> <span class="ident">vec</span> <span class="kw">in</span> <span class="ident">list</span> {
<span class="self">self</span>.<span class="ident">append</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">vec</span>);
}
}
}
}
}
</pre></div>
</section><section id="search" class="content hidden"></section><div id="rustdoc-vars" data-root-path="../../../../" data-current-crate="rayon" data-search-index-js="../../../../search-index.js" data-search-js="../../../../search.js"></div><script src="../../../../main.js"></script><script src="../../../../source-script.js"></script><script src="../../../../source-files.js"></script></body></html>