<!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 to the Rust file `src/libstd/sync/mpsc/mpsc_queue.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mpsc_queue.rs.html -- source</title><link rel="stylesheet" type="text/css" href="../../../../normalize1.35.0.css"><link rel="stylesheet" type="text/css" href="../../../../rustdoc1.35.0.css" id="mainThemeStyle"><link rel="stylesheet" type="text/css" href="../../../../dark1.35.0.css"><link rel="stylesheet" type="text/css" href="../../../../light1.35.0.css" id="themeStyle"><script src="../../../../storage1.35.0.js"></script><noscript><link rel="stylesheet" href="../../../../noscript1.35.0.css"></noscript><link rel="shortcut icon" href="../../../../favicon1.35.0.ico"><style type="text/css">#crate-search{background-image:url("../../../../down-arrow1.35.0.svg");}</style></head><body class="rustdoc source"><!--[if lte IE 8]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="sidebar-menu">☰</div><a href='../../../../std/index.html'><img src='../../../../rust-logo1.35.0.png' alt='logo' width='100'></a></nav><div class="theme-picker"><button id="theme-picker" aria-label="Pick another theme!"><img src="../../../../brush1.35.0.svg" width="18" alt="Pick another theme!"></button><div id="theme-choices"></div></div><script src="../../../../theme1.35.0.js"></script><nav class="sub"><form class="search-form js-only"><div class="search-container"><div><select id="crate-search"><option value="All crates">All crates</option></select><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"></div><a id="settings-menu" href="../../../../settings.html"><img src="../../../../wheel1.35.0.svg" width="18" alt="Change settings"></a></div></form></nav><section id="main" class="content"><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>
</pre><div class="example-wrap"><pre class="rust ">
<span class="doccomment">//! A mostly lock-free multi-producer, single consumer queue.</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! This module contains an implementation of a concurrent MPSC queue. This</span>
<span class="doccomment">//! queue can be used to share data between threads, and is also used as the</span>
<span class="doccomment">//! building block of channels in rust.</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! Note that the current implementation of this queue has a caveat of the `pop`</span>
<span class="doccomment">//! method, and see the method for more information about it. Due to this</span>
<span class="doccomment">//! caveat, this queue may not be appropriate for all use-cases.</span>
<span class="comment">// http://www.1024cores.net/home/lock-free-algorithms</span>
<span class="comment">// /queues/non-intrusive-mpsc-node-based-queue</span>
<span class="kw">pub</span> <span class="kw">use</span> <span class="self">self</span>::<span class="ident">PopResult</span>::<span class="kw-2">*</span>;
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">ptr</span>;
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">cell</span>::<span class="ident">UnsafeCell</span>;
<span class="kw">use</span> <span class="kw">crate</span>::<span class="ident">boxed</span>::<span class="ident">Box</span>;
<span class="kw">use</span> <span class="kw">crate</span>::<span class="ident">sync</span>::<span class="ident">atomic</span>::{<span class="ident">AtomicPtr</span>, <span class="ident">Ordering</span>};
<span class="doccomment">/// A result of the `pop` function.</span>
<span class="kw">pub</span> <span class="kw">enum</span> <span class="ident">PopResult</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="doccomment">/// Some data has been popped</span>
<span class="ident">Data</span>(<span class="ident">T</span>),
<span class="doccomment">/// The queue is empty</span>
<span class="ident">Empty</span>,
<span class="doccomment">/// The queue is in an inconsistent state. Popping data should succeed, but</span>
<span class="doccomment">/// some pushers have yet to make enough progress in order allow a pop to</span>
<span class="doccomment">/// succeed. It is recommended that a pop() occur "in the near future" in</span>
<span class="doccomment">/// order to see if the sender has made progress or not</span>
<span class="ident">Inconsistent</span>,
}
<span class="kw">struct</span> <span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">next</span>: <span class="ident">AtomicPtr</span><span class="op"><</span><span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span>,
<span class="ident">value</span>: <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
}
<span class="doccomment">/// The multi-producer single-consumer structure. This is not cloneable, but it</span>
<span class="doccomment">/// may be safely shared so long as it is guaranteed that there is only one</span>
<span class="doccomment">/// popper at a time (many pushers are allowed).</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">Queue</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">head</span>: <span class="ident">AtomicPtr</span><span class="op"><</span><span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span>,
<span class="ident">tail</span>: <span class="ident">UnsafeCell</span><span class="op"><</span><span class="kw-2">*</span><span class="kw-2">mut</span> <span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span>,
}
<span class="kw">unsafe</span> <span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Send</span><span class="op">></span> <span class="ident">Send</span> <span class="kw">for</span> <span class="ident">Queue</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> { }
<span class="kw">unsafe</span> <span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Send</span><span class="op">></span> <span class="ident">Sync</span> <span class="kw">for</span> <span class="ident">Queue</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> { }
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">unsafe</span> <span class="kw">fn</span> <span class="ident">new</span>(<span class="ident">v</span>: <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>) <span class="op">-></span> <span class="kw-2">*</span><span class="kw-2">mut</span> <span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">Box</span>::<span class="ident">into_raw</span>(<span class="kw">box</span> <span class="ident">Node</span> {
<span class="ident">next</span>: <span class="ident">AtomicPtr</span>::<span class="ident">new</span>(<span class="ident">ptr</span>::<span class="ident">null_mut</span>()),
<span class="ident">value</span>: <span class="ident">v</span>,
})
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">Queue</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="doccomment">/// Creates a new queue that is safe to share among multiple producers and</span>
<span class="doccomment">/// one consumer.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">new</span>() <span class="op">-></span> <span class="ident">Queue</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">let</span> <span class="ident">stub</span> <span class="op">=</span> <span class="kw">unsafe</span> { <span class="ident">Node</span>::<span class="ident">new</span>(<span class="prelude-val">None</span>) };
<span class="ident">Queue</span> {
<span class="ident">head</span>: <span class="ident">AtomicPtr</span>::<span class="ident">new</span>(<span class="ident">stub</span>),
<span class="ident">tail</span>: <span class="ident">UnsafeCell</span>::<span class="ident">new</span>(<span class="ident">stub</span>),
}
}
<span class="doccomment">/// Pushes a new value onto this queue.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">push</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">t</span>: <span class="ident">T</span>) {
<span class="kw">unsafe</span> {
<span class="kw">let</span> <span class="ident">n</span> <span class="op">=</span> <span class="ident">Node</span>::<span class="ident">new</span>(<span class="prelude-val">Some</span>(<span class="ident">t</span>));
<span class="kw">let</span> <span class="ident">prev</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">head</span>.<span class="ident">swap</span>(<span class="ident">n</span>, <span class="ident">Ordering</span>::<span class="ident">AcqRel</span>);
(<span class="kw-2">*</span><span class="ident">prev</span>).<span class="ident">next</span>.<span class="ident">store</span>(<span class="ident">n</span>, <span class="ident">Ordering</span>::<span class="ident">Release</span>);
}
}
<span class="doccomment">/// Pops some data from this queue.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Note that the current implementation means that this function cannot</span>
<span class="doccomment">/// return `Option<T>`. It is possible for this queue to be in an</span>
<span class="doccomment">/// inconsistent state where many pushes have succeeded and completely</span>
<span class="doccomment">/// finished, but pops cannot return `Some(t)`. This inconsistent state</span>
<span class="doccomment">/// happens when a pusher is pre-empted at an inopportune moment.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This inconsistent state means that this queue does indeed have data, but</span>
<span class="doccomment">/// it does not currently have access to it at this time.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">pop</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">PopResult</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">unsafe</span> {
<span class="kw">let</span> <span class="ident">tail</span> <span class="op">=</span> <span class="kw-2">*</span><span class="self">self</span>.<span class="ident">tail</span>.<span class="ident">get</span>();
<span class="kw">let</span> <span class="ident">next</span> <span class="op">=</span> (<span class="kw-2">*</span><span class="ident">tail</span>).<span class="ident">next</span>.<span class="ident">load</span>(<span class="ident">Ordering</span>::<span class="ident">Acquire</span>);
<span class="kw">if</span> <span class="op">!</span><span class="ident">next</span>.<span class="ident">is_null</span>() {
<span class="kw-2">*</span><span class="self">self</span>.<span class="ident">tail</span>.<span class="ident">get</span>() <span class="op">=</span> <span class="ident">next</span>;
<span class="macro">assert</span><span class="macro">!</span>((<span class="kw-2">*</span><span class="ident">tail</span>).<span class="ident">value</span>.<span class="ident">is_none</span>());
<span class="macro">assert</span><span class="macro">!</span>((<span class="kw-2">*</span><span class="ident">next</span>).<span class="ident">value</span>.<span class="ident">is_some</span>());
<span class="kw">let</span> <span class="ident">ret</span> <span class="op">=</span> (<span class="kw-2">*</span><span class="ident">next</span>).<span class="ident">value</span>.<span class="ident">take</span>().<span class="ident">unwrap</span>();
<span class="kw">let</span> <span class="kw">_</span>: <span class="ident">Box</span><span class="op"><</span><span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span> <span class="op">=</span> <span class="ident">Box</span>::<span class="ident">from_raw</span>(<span class="ident">tail</span>);
<span class="kw">return</span> <span class="ident">Data</span>(<span class="ident">ret</span>);
}
<span class="kw">if</span> <span class="self">self</span>.<span class="ident">head</span>.<span class="ident">load</span>(<span class="ident">Ordering</span>::<span class="ident">Acquire</span>) <span class="op">==</span> <span class="ident">tail</span> {<span class="ident">Empty</span>} <span class="kw">else</span> {<span class="ident">Inconsistent</span>}
}
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">Drop</span> <span class="kw">for</span> <span class="ident">Queue</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">drop</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) {
<span class="kw">unsafe</span> {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">cur</span> <span class="op">=</span> <span class="kw-2">*</span><span class="self">self</span>.<span class="ident">tail</span>.<span class="ident">get</span>();
<span class="kw">while</span> <span class="op">!</span><span class="ident">cur</span>.<span class="ident">is_null</span>() {
<span class="kw">let</span> <span class="ident">next</span> <span class="op">=</span> (<span class="kw-2">*</span><span class="ident">cur</span>).<span class="ident">next</span>.<span class="ident">load</span>(<span class="ident">Ordering</span>::<span class="ident">Relaxed</span>);
<span class="kw">let</span> <span class="kw">_</span>: <span class="ident">Box</span><span class="op"><</span><span class="ident">Node</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span> <span class="op">=</span> <span class="ident">Box</span>::<span class="ident">from_raw</span>(<span class="ident">cur</span>);
<span class="ident">cur</span> <span class="op">=</span> <span class="ident">next</span>;
}
}
}
}
<span class="attribute">#[<span class="ident">cfg</span>(<span class="ident">all</span>(<span class="ident">test</span>, <span class="ident">not</span>(<span class="ident">target_os</span> <span class="op">=</span> <span class="string">"emscripten"</span>)))]</span>
<span class="kw">mod</span> <span class="ident">tests</span> {
<span class="kw">use</span> <span class="kw">super</span>::{<span class="ident">Queue</span>, <span class="ident">Data</span>, <span class="ident">Empty</span>, <span class="ident">Inconsistent</span>};
<span class="kw">use</span> <span class="kw">crate</span>::<span class="ident">sync</span>::<span class="ident">mpsc</span>::<span class="ident">channel</span>;
<span class="kw">use</span> <span class="kw">crate</span>::<span class="ident">sync</span>::<span class="ident">Arc</span>;
<span class="kw">use</span> <span class="kw">crate</span>::<span class="ident">thread</span>;
<span class="attribute">#[<span class="ident">test</span>]</span>
<span class="kw">fn</span> <span class="ident">test_full</span>() {
<span class="kw">let</span> <span class="ident">q</span>: <span class="ident">Queue</span><span class="op"><</span><span class="ident">Box</span><span class="op"><</span><span class="kw">_</span><span class="op">>></span> <span class="op">=</span> <span class="ident">Queue</span>::<span class="ident">new</span>();
<span class="ident">q</span>.<span class="ident">push</span>(<span class="kw">box</span> <span class="number">1</span>);
<span class="ident">q</span>.<span class="ident">push</span>(<span class="kw">box</span> <span class="number">2</span>);
}
<span class="attribute">#[<span class="ident">test</span>]</span>
<span class="kw">fn</span> <span class="ident">test</span>() {
<span class="kw">let</span> <span class="ident">nthreads</span> <span class="op">=</span> <span class="number">8</span>;
<span class="kw">let</span> <span class="ident">nmsgs</span> <span class="op">=</span> <span class="number">1000</span>;
<span class="kw">let</span> <span class="ident">q</span> <span class="op">=</span> <span class="ident">Queue</span>::<span class="ident">new</span>();
<span class="kw">match</span> <span class="ident">q</span>.<span class="ident">pop</span>() {
<span class="ident">Empty</span> <span class="op">=></span> {}
<span class="ident">Inconsistent</span> <span class="op">|</span> <span class="ident">Data</span>(..) <span class="op">=></span> <span class="macro">panic</span><span class="macro">!</span>()
}
<span class="kw">let</span> (<span class="ident">tx</span>, <span class="ident">rx</span>) <span class="op">=</span> <span class="ident">channel</span>();
<span class="kw">let</span> <span class="ident">q</span> <span class="op">=</span> <span class="ident">Arc</span>::<span class="ident">new</span>(<span class="ident">q</span>);
<span class="kw">for</span> <span class="kw">_</span> <span class="kw">in</span> <span class="number">0</span>..<span class="ident">nthreads</span> {
<span class="kw">let</span> <span class="ident">tx</span> <span class="op">=</span> <span class="ident">tx</span>.<span class="ident">clone</span>();
<span class="kw">let</span> <span class="ident">q</span> <span class="op">=</span> <span class="ident">q</span>.<span class="ident">clone</span>();
<span class="ident">thread</span>::<span class="ident">spawn</span>(<span class="kw">move</span><span class="op">||</span> {
<span class="kw">for</span> <span class="ident">i</span> <span class="kw">in</span> <span class="number">0</span>..<span class="ident">nmsgs</span> {
<span class="ident">q</span>.<span class="ident">push</span>(<span class="ident">i</span>);
}
<span class="ident">tx</span>.<span class="ident">send</span>(()).<span class="ident">unwrap</span>();
});
}
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">i</span> <span class="op">=</span> <span class="number">0</span>;
<span class="kw">while</span> <span class="ident">i</span> <span class="op"><</span> <span class="ident">nthreads</span> <span class="op">*</span> <span class="ident">nmsgs</span> {
<span class="kw">match</span> <span class="ident">q</span>.<span class="ident">pop</span>() {
<span class="ident">Empty</span> <span class="op">|</span> <span class="ident">Inconsistent</span> <span class="op">=></span> {},
<span class="ident">Data</span>(<span class="kw">_</span>) <span class="op">=></span> { <span class="ident">i</span> <span class="op">+=</span> <span class="number">1</span> }
}
}
<span class="ident">drop</span>(<span class="ident">tx</span>);
<span class="kw">for</span> <span class="kw">_</span> <span class="kw">in</span> <span class="number">0</span>..<span class="ident">nthreads</span> {
<span class="ident">rx</span>.<span class="ident">recv</span>().<span class="ident">unwrap</span>();
}
}
}
</pre></div>
</section><section id="search" class="content hidden"></section><section class="footer"></section><aside id="help" class="hidden"><div><h1 class="hidden">Help</h1><div class="shortcuts"><h2>Keyboard Shortcuts</h2><dl><dt><kbd>?</kbd></dt><dd>Show this help dialog</dd><dt><kbd>S</kbd></dt><dd>Focus the search field</dd><dt><kbd>↑</kbd></dt><dd>Move up in search results</dd><dt><kbd>↓</kbd></dt><dd>Move down in search results</dd><dt><kbd>↹</kbd></dt><dd>Switch tab</dd><dt><kbd>⏎</kbd></dt><dd>Go to active search result</dd><dt><kbd>+</kbd></dt><dd>Expand all sections</dd><dt><kbd>-</kbd></dt><dd>Collapse all sections</dd></dl></div><div class="infos"><h2>Search Tricks</h2><p>Prefix searches with a type followed by a colon (e.g., <code>fn:</code>) to restrict the search to a given type.</p><p>Accepted types are: <code>fn</code>, <code>mod</code>, <code>struct</code>, <code>enum</code>, <code>trait</code>, <code>type</code>, <code>macro</code>, and <code>const</code>.</p><p>Search functions by type signature (e.g., <code>vec -> usize</code> or <code>* -> vec</code>)</p><p>Search multiple things at once by splitting your query with comma (e.g., <code>str,u8</code> or <code>String,struct:Vec,test</code>)</p></div></div></aside><script>window.rootPath = "../../../../";window.currentCrate = "std";</script><script src="../../../../aliases.js"></script><script src="../../../../main1.35.0.js"></script><script src="../../../../source-script1.35.0.js"></script><script src="../../../../source-files.js"></script><script defer src="../../../../search-index.js"></script></body></html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-release
>
by-pkgid
>
0c2243f8a1696816431e7210e991fa52
>
files
>
14142
