Google Git
Sign in
apache / incubator-teaclave-website / refs/heads/asf-site / . / api-docs / crates-app / src / sgx_rand / lib.rs.html
blob: b433877a9a888285c40a06341ebd7753735ad481 [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/sunhe/incubator-teaclave/third_party/rust-sgx-sdk/sgx_rand/src/lib.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>lib.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="../../sgx_rand/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="../../sgx_rand/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>
</pre><pre class="rust"><code><span class="comment">// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// &quot;License&quot;); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// &quot;AS IS&quot; BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License..
</span><span class="doccomment">//! Utilities for random number generation
</span><span class="attribute">#![cfg_attr(all(feature = <span class="string">&quot;trand&quot;</span>, not(target_vendor = <span class="string">&quot;teaclave&quot;</span>)), no_std)]
#![cfg_attr(target_vendor = <span class="string">&quot;teaclave&quot;</span>, feature(rustc_private))]
#[cfg(all(feature = <span class="string">&quot;trand&quot;</span>, feature = <span class="string">&quot;urand&quot;</span>))]
</span><span class="macro">compile_error!</span>(<span class="string">&quot;feature \&quot;trand\&quot; and feature \&quot;urand\&quot; cannot be enabled at the same time&quot;</span>);
<span class="attribute">#[cfg(not(any(feature = <span class="string">&quot;trand&quot;</span>, feature = <span class="string">&quot;urand&quot;</span>)))]
</span><span class="macro">compile_error!</span>(<span class="string">&quot;need to enable feature \&quot;trand\&quot; or feature \&quot;urand\&quot;&quot;</span>);
<span class="attribute">#[cfg(all(feature = <span class="string">&quot;trand&quot;</span>, not(target_vendor = <span class="string">&quot;teaclave&quot;</span>)))]
#[macro_use]
</span><span class="kw">extern crate </span>sgx_tstd <span class="kw">as </span>std;
<span class="attribute">#[cfg(feature = <span class="string">&quot;trand&quot;</span>)]
</span><span class="kw">extern crate </span>sgx_trts;
<span class="kw">use </span>std::boxed::Box;
<span class="kw">use </span>std::cell::RefCell;
<span class="kw">use </span>std::io;
<span class="kw">use </span>std::marker;
<span class="kw">use </span>std::num::Wrapping <span class="kw">as </span>w;
<span class="kw">use </span>std::rc::Rc;
<span class="kw">use </span>std::vec::Vec;
<span class="kw">pub use </span>os::RdRand;
<span class="attribute">#[cfg(feature = <span class="string">&quot;derive&quot;</span>)]
</span><span class="kw">pub use </span>sgx_rand_derive::Random;
<span class="kw">pub use </span>chacha::ChaChaRng;
<span class="kw">pub use </span>isaac::{Isaac64Rng, IsaacRng};
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
</span><span class="kw">use </span>Isaac64Rng <span class="kw">as </span>IsaacWordRng;
<span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</span>)]
</span><span class="kw">use </span>IsaacRng <span class="kw">as </span>IsaacWordRng;
<span class="kw">use </span>distributions::range::SampleRange;
<span class="kw">use </span>distributions::{IndependentSample, Range};
<span class="kw">pub mod </span>chacha;
<span class="kw">pub mod </span>distributions;
<span class="kw">pub mod </span>isaac;
<span class="kw">pub mod </span>os;
<span class="kw">pub mod </span>read;
<span class="kw">pub mod </span>reseeding;
<span class="kw">mod </span>rand_impls;
<span class="attribute">#[allow(bad_style)]
</span><span class="kw">type </span>w64 = w&lt;u64&gt;;
<span class="attribute">#[allow(bad_style)]
</span><span class="kw">type </span>w32 = w&lt;u32&gt;;
<span class="doccomment">/// A type that can be randomly generated using an `Rng`.
///
/// ## Built-in Implementations
///
/// This crate implements `Rand` for various primitive types. Assuming the
/// provided `Rng` is well-behaved, these implementations generate values with
/// the following ranges and distributions:
///
/// * Integers (`i32`, `u32`, `isize`, `usize`, etc.): Uniformly distributed
/// over all values of the type.
/// * `char`: Uniformly distributed over all Unicode scalar values, i.e. all
/// code points in the range `0...0x10_FFFF`, except for the range
/// `0xD800...0xDFFF` (the surrogate code points). This includes
/// unassigned/reserved code points.
/// * `bool`: Generates `false` or `true`, each with probability 0.5.
/// * Floating point types (`f32` and `f64`): Uniformly distributed in the
/// half-open range `[0, 1)`. (The [`Open01`], [`Closed01`], [`Exp1`], and
/// [`StandardNormal`] wrapper types produce floating point numbers with
/// alternative ranges or distributions.)
///
/// [`Open01`]: struct.Open01.html
/// [`Closed01`]: struct.Closed01.html
/// [`Exp1`]: struct.Exp1.html
/// [`StandardNormal`]: struct.StandardNormal.html
///
/// The following aggregate types also implement `Rand` as long as their
/// component types implement it:
///
/// * Tuples and arrays: Each element of the tuple or array is generated
/// independently, using its own `Rand` implementation.
/// * `Option&lt;T&gt;`: Returns `None` with probability 0.5; otherwise generates a
/// random `T` and returns `Some(T)`.
</span><span class="kw">pub trait </span>Rand: Sized {
<span class="doccomment">/// Generates a random instance of this type using the specified source of
/// randomness.
</span><span class="kw">fn </span>rand&lt;R: Rng&gt;(rng: <span class="kw-2">&amp;mut </span>R) -&gt; <span class="self">Self</span>;
}
<span class="doccomment">/// A random number generator.
</span><span class="kw">pub trait </span>Rng {
<span class="doccomment">/// Return the next random u32.
///
/// This rarely needs to be called directly, prefer `r.gen()` to
/// `r.next_u32()`.
</span><span class="comment">// FIXME #rust-lang/rfcs#628: Should be implemented in terms of next_u64
</span><span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32;
<span class="doccomment">/// Return the next random u64.
///
/// By default this is implemented in terms of `next_u32`. An
/// implementation of this trait must provide at least one of
/// these two methods. Similarly to `next_u32`, this rarely needs
/// to be called directly, prefer `r.gen()` to `r.next_u64()`.
</span><span class="kw">fn </span>next_u64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u64 {
((<span class="self">self</span>.next_u32() <span class="kw">as </span>u64) &lt;&lt; <span class="number">32</span>) | (<span class="self">self</span>.next_u32() <span class="kw">as </span>u64)
}
<span class="doccomment">/// Return the next random f32 selected from the half-open
/// interval `[0, 1)`.
///
/// This uses a technique described by Saito and Matsumoto at
/// MCQMC&#39;08. Given that the IEEE floating point numbers are
/// uniformly distributed over [1,2), we generate a number in
/// this range and then offset it onto the range [0,1). Our
/// choice of bits (masking v. shifting) is arbitrary and
/// should be immaterial for high quality generators. For low
/// quality generators (ex. LCG), prefer bitshifting due to
/// correlation between sequential low order bits.
///
/// See:
/// A PRNG specialized in double precision floating point numbers using
/// an affine transition
/// &lt;http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/ARTICLES/dSFMT.pdf&gt;
/// &lt;http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/dSFMT-slide-e.pdf&gt;
///
/// By default this is implemented in terms of `next_u32`, but a
/// random number generator which can generate numbers satisfying
/// the requirements directly can overload this for performance.
/// It is required that the return value lies in `[0, 1)`.
///
/// See `Closed01` for the closed interval `[0,1]`, and
/// `Open01` for the open interval `(0,1)`.
</span><span class="kw">fn </span>next_f32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; f32 {
<span class="kw">const </span>UPPER_MASK: u32 = <span class="number">0x3F800000</span>;
<span class="kw">const </span>LOWER_MASK: u32 = <span class="number">0x7FFFFF</span>;
<span class="kw">let </span>tmp = UPPER_MASK | (<span class="self">self</span>.next_u32() &amp; LOWER_MASK);
<span class="kw">let </span>result = f32::from_bits(tmp);
result - <span class="number">1.0
</span>}
<span class="doccomment">/// Return the next random f64 selected from the half-open
/// interval `[0, 1)`.
///
/// By default this is implemented in terms of `next_u64`, but a
/// random number generator which can generate numbers satisfying
/// the requirements directly can overload this for performance.
/// It is required that the return value lies in `[0, 1)`.
///
/// See `Closed01` for the closed interval `[0,1]`, and
/// `Open01` for the open interval `(0,1)`.
</span><span class="kw">fn </span>next_f64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; f64 {
<span class="kw">const </span>UPPER_MASK: u64 = <span class="number">0x3FF0000000000000</span>;
<span class="kw">const </span>LOWER_MASK: u64 = <span class="number">0xFFFFFFFFFFFFF</span>;
<span class="kw">let </span>tmp = UPPER_MASK | (<span class="self">self</span>.next_u64() &amp; LOWER_MASK);
<span class="kw">let </span>result = f64::from_bits(tmp);
result - <span class="number">1.0
</span>}
<span class="doccomment">/// Fill `dest` with random data.
///
/// This has a default implementation in terms of `next_u64` and
/// `next_u32`, but should be overridden by implementations that
/// offer a more efficient solution than just calling those
/// methods repeatedly.
///
/// This method does *not* have a requirement to bear any fixed
/// relationship to the other methods, for example, it does *not*
/// have to result in the same output as progressively filling
/// `dest` with `self.gen::&lt;u8&gt;()`, and any such behaviour should
/// not be relied upon.
///
/// This method should guarantee that `dest` is entirely filled
/// with new data, and may panic if this is impossible
/// (e.g. reading past the end of a file that is being used as the
/// source of randomness).
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, Rng};
///
/// let mut v = [0u8; 13579];
/// thread_rng().fill_bytes(&amp;mut v);
/// println!(&quot;{:?}&quot;, &amp;v[..]);
/// ```
</span><span class="kw">fn </span>fill_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, dest: <span class="kw-2">&amp;mut </span>[u8]) {
<span class="comment">// this could, in theory, be done by transmuting dest to a
// [u64], but this is (1) likely to be undefined behaviour for
// LLVM, (2) has to be very careful about alignment concerns,
// (3) adds more `unsafe` that needs to be checked, (4)
// probably doesn&#39;t give much performance gain if
// optimisations are on.
</span><span class="kw">let </span><span class="kw-2">mut </span>count = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>num = <span class="number">0</span>;
<span class="kw">for </span>byte <span class="kw">in </span>dest.iter_mut() {
<span class="kw">if </span>count == <span class="number">0 </span>{
<span class="comment">// we could micro-optimise here by generating a u32 if
// we only need a few more bytes to fill the vector
// (i.e. at most 4).
</span>num = <span class="self">self</span>.next_u64();
count = <span class="number">8</span>;
}
<span class="kw-2">*</span>byte = (num &amp; <span class="number">0xff</span>) <span class="kw">as </span>u8;
num &gt;&gt;= <span class="number">8</span>;
count -= <span class="number">1</span>;
}
}
<span class="doccomment">/// Return a random value of a `Rand` type.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, Rng};
///
/// let mut rng = thread_rng();
/// let x: u32 = rng.gen();
/// println!(&quot;{}&quot;, x);
/// println!(&quot;{:?}&quot;, rng.gen::&lt;(f64, bool)&gt;());
/// ```
</span><span class="attribute">#[inline(always)]
</span><span class="kw">fn </span>gen&lt;T: Rand&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; T
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
Rand::rand(<span class="self">self</span>)
}
<span class="doccomment">/// Return an iterator that will yield an infinite number of randomly
/// generated items.
///
/// # Example
///
/// ```
/// use sgx_rand::{thread_rng, Rng};
///
/// let mut rng = thread_rng();
/// let x = rng.gen_iter::&lt;u32&gt;().take(10).collect::&lt;Vec&lt;u32&gt;&gt;();
/// println!(&quot;{:?}&quot;, x);
/// println!(&quot;{:?}&quot;, rng.gen_iter::&lt;(f64, bool)&gt;().take(5)
/// .collect::&lt;Vec&lt;(f64, bool)&gt;&gt;());
/// ```
</span><span class="kw">fn </span>gen_iter&lt;T: Rand&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; Generator&lt;<span class="lifetime">&#39;_</span>, T, <span class="self">Self</span>&gt;
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
Generator {
rng: <span class="self">self</span>,
_marker: marker::PhantomData,
}
}
<span class="doccomment">/// Generate a random value in the range [`low`, `high`).
///
/// This is a convenience wrapper around
/// `distributions::Range`. If this function will be called
/// repeatedly with the same arguments, one should use `Range`, as
/// that will amortize the computations that allow for perfect
/// uniformity, as they only happen on initialization.
///
/// # Panics
///
/// Panics if `low &gt;= high`.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, Rng};
///
/// let mut rng = thread_rng();
/// let n: u32 = rng.gen_range(0, 10);
/// println!(&quot;{}&quot;, n);
/// let m: f64 = rng.gen_range(-40.0f64, 1.3e5f64);
/// println!(&quot;{}&quot;, m);
/// ```
</span><span class="kw">fn </span>gen_range&lt;T: PartialOrd + SampleRange&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, low: T, high: T) -&gt; T
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
<span class="macro">assert!</span>(low &lt; high, <span class="string">&quot;Rng.gen_range called with low &gt;= high&quot;</span>);
Range::new(low, high).ind_sample(<span class="self">self</span>)
}
<span class="doccomment">/// Return a bool with a 1 in n chance of true
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, Rng};
///
/// let mut rng = thread_rng();
/// println!(&quot;{}&quot;, rng.gen_weighted_bool(3));
/// ```
</span><span class="kw">fn </span>gen_weighted_bool(<span class="kw-2">&amp;mut </span><span class="self">self</span>, n: u32) -&gt; bool
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
n &lt;= <span class="number">1 </span>|| <span class="self">self</span>.gen_range(<span class="number">0</span>, n) == <span class="number">0
</span>}
<span class="doccomment">/// Return an iterator of random characters from the set A-Z,a-z,0-9.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, Rng};
///
/// let s: String = thread_rng().gen_ascii_chars().take(10).collect();
/// println!(&quot;{}&quot;, s);
/// ```
</span><span class="kw">fn </span>gen_ascii_chars(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; AsciiGenerator&lt;<span class="lifetime">&#39;_</span>, <span class="self">Self</span>&gt;
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
AsciiGenerator { rng: <span class="self">self </span>}
}
<span class="doccomment">/// Return a random element from `values`.
///
/// Return `None` if `values` is empty.
///
/// # Example
///
/// ```
/// use sgx_rand::{thread_rng, Rng};
///
/// let choices = [1, 2, 4, 8, 16, 32];
/// let mut rng = thread_rng();
/// println!(&quot;{:?}&quot;, rng.choose(&amp;choices));
/// assert_eq!(rng.choose(&amp;choices[..0]), None);
/// ```
</span><span class="kw">fn </span>choose&lt;<span class="lifetime">&#39;a</span>, T&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, values: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[T]) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T&gt;
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
<span class="kw">if </span>values.is_empty() {
<span class="prelude-val">None
</span>} <span class="kw">else </span>{
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>values[<span class="self">self</span>.gen_range(<span class="number">0</span>, values.len())])
}
}
<span class="doccomment">/// Return a mutable pointer to a random element from `values`.
///
/// Return `None` if `values` is empty.
</span><span class="kw">fn </span>choose_mut&lt;<span class="lifetime">&#39;a</span>, T&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, values: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>[T]) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T&gt;
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
<span class="kw">if </span>values.is_empty() {
<span class="prelude-val">None
</span>} <span class="kw">else </span>{
<span class="kw">let </span>len = values.len();
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>values[<span class="self">self</span>.gen_range(<span class="number">0</span>, len)])
}
}
<span class="doccomment">/// Shuffle a mutable slice in place.
///
/// This applies Durstenfeld&#39;s algorithm for the [Fisher�CYates shuffle](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#The_modern_algorithm)
/// which produces an unbiased permutation.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, Rng};
///
/// let mut rng = thread_rng();
/// let mut y = [1, 2, 3];
/// rng.shuffle(&amp;mut y);
/// println!(&quot;{:?}&quot;, y);
/// rng.shuffle(&amp;mut y);
/// println!(&quot;{:?}&quot;, y);
/// ```
</span><span class="kw">fn </span>shuffle&lt;T&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, values: <span class="kw-2">&amp;mut </span>[T])
<span class="kw">where
</span><span class="self">Self</span>: Sized,
{
<span class="kw">let </span><span class="kw-2">mut </span>i = values.len();
<span class="kw">while </span>i &gt;= <span class="number">2 </span>{
<span class="comment">// invariant: elements with index &gt;= i have been locked in place.
</span>i -= <span class="number">1</span>;
<span class="comment">// lock element i in place.
</span>values.swap(i, <span class="self">self</span>.gen_range(<span class="number">0</span>, i + <span class="number">1</span>));
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, R: <span class="question-mark">?</span>Sized&gt; Rng <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>R
<span class="kw">where
</span>R: Rng,
{
<span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32 {
(<span class="kw-2">**</span><span class="self">self</span>).next_u32()
}
<span class="kw">fn </span>next_u64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u64 {
(<span class="kw-2">**</span><span class="self">self</span>).next_u64()
}
<span class="kw">fn </span>next_f32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; f32 {
(<span class="kw-2">**</span><span class="self">self</span>).next_f32()
}
<span class="kw">fn </span>next_f64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; f64 {
(<span class="kw-2">**</span><span class="self">self</span>).next_f64()
}
<span class="kw">fn </span>fill_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, dest: <span class="kw-2">&amp;mut </span>[u8]) {
(<span class="kw-2">**</span><span class="self">self</span>).fill_bytes(dest)
}
}
<span class="kw">impl</span>&lt;R: <span class="question-mark">?</span>Sized&gt; Rng <span class="kw">for </span>Box&lt;R&gt;
<span class="kw">where
</span>R: Rng,
{
<span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32 {
(<span class="kw-2">**</span><span class="self">self</span>).next_u32()
}
<span class="kw">fn </span>next_u64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u64 {
(<span class="kw-2">**</span><span class="self">self</span>).next_u64()
}
<span class="kw">fn </span>next_f32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; f32 {
(<span class="kw-2">**</span><span class="self">self</span>).next_f32()
}
<span class="kw">fn </span>next_f64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; f64 {
(<span class="kw-2">**</span><span class="self">self</span>).next_f64()
}
<span class="kw">fn </span>fill_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, dest: <span class="kw-2">&amp;mut </span>[u8]) {
(<span class="kw-2">**</span><span class="self">self</span>).fill_bytes(dest)
}
}
<span class="doccomment">/// Iterator which will generate a stream of random items.
///
/// This iterator is created via the [`gen_iter`] method on [`Rng`].
///
/// [`gen_iter`]: trait.Rng.html#method.gen_iter
/// [`Rng`]: trait.Rng.html
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Generator&lt;<span class="lifetime">&#39;a</span>, T, R: <span class="lifetime">&#39;a</span>&gt; {
rng: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>R,
_marker: marker::PhantomData&lt;<span class="kw">fn</span>() -&gt; T&gt;,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Rand, R: Rng&gt; Iterator <span class="kw">for </span>Generator&lt;<span class="lifetime">&#39;a</span>, T, R&gt; {
<span class="kw">type </span>Item = T;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
<span class="prelude-val">Some</span>(<span class="self">self</span>.rng.gen())
}
}
<span class="doccomment">/// Iterator which will continuously generate random ascii characters.
///
/// This iterator is created via the [`gen_ascii_chars`] method on [`Rng`].
///
/// [`gen_ascii_chars`]: trait.Rng.html#method.gen_ascii_chars
/// [`Rng`]: trait.Rng.html
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>AsciiGenerator&lt;<span class="lifetime">&#39;a</span>, R: <span class="lifetime">&#39;a</span>&gt; {
rng: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>R,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, R: Rng&gt; Iterator <span class="kw">for </span>AsciiGenerator&lt;<span class="lifetime">&#39;a</span>, R&gt; {
<span class="kw">type </span>Item = char;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;char&gt; {
<span class="kw">const </span>GEN_ASCII_STR_CHARSET: <span class="kw-2">&amp;</span>[u8] = <span class="string">b&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZ\
abcdefghijklmnopqrstuvwxyz\
0123456789&quot;</span>;
<span class="prelude-val">Some</span>(<span class="kw-2">*</span><span class="self">self</span>.rng.choose(GEN_ASCII_STR_CHARSET).unwrap() <span class="kw">as </span>char)
}
}
<span class="doccomment">/// A random number generator that can be explicitly seeded to produce
/// the same stream of randomness multiple times.
</span><span class="kw">pub trait </span>SeedableRng&lt;Seed&gt;: Rng {
<span class="doccomment">/// Reseed an RNG with the given seed.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{Rng, SeedableRng, StdRng};
///
/// let seed: &amp;[_] = &amp;[1, 2, 3, 4];
/// let mut rng: StdRng = SeedableRng::from_seed(seed);
/// println!(&quot;{}&quot;, rng.gen::&lt;f64&gt;());
/// rng.reseed(&amp;[5, 6, 7, 8]);
/// println!(&quot;{}&quot;, rng.gen::&lt;f64&gt;());
/// ```
</span><span class="kw">fn </span>reseed(<span class="kw-2">&amp;mut </span><span class="self">self</span>, seed: Seed);
<span class="doccomment">/// Create a new RNG with the given seed.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{Rng, SeedableRng, StdRng};
///
/// let seed: &amp;[_] = &amp;[1, 2, 3, 4];
/// let mut rng: StdRng = SeedableRng::from_seed(seed);
/// println!(&quot;{}&quot;, rng.gen::&lt;f64&gt;());
/// ```
</span><span class="kw">fn </span>from_seed(seed: Seed) -&gt; <span class="self">Self</span>;
}
<span class="doccomment">/// An Xorshift\[1\] random number
/// generator.
///
/// The Xorshift algorithm is not suitable for cryptographic purposes
/// but is very fast. If you do not know for sure that it fits your
/// requirements, use a more secure one such as `IsaacRng` or `RdRand`.
///
/// \[1\]: Marsaglia, George (July 2003). [&quot;Xorshift
/// RNGs&quot;](http://www.jstatsoft.org/v08/i14/paper). *Journal of
/// Statistical Software*. Vol. 8 (Issue 14).
</span><span class="attribute">#[allow(missing_copy_implementations)]
#[derive(Clone, Debug)]
</span><span class="kw">pub struct </span>XorShiftRng {
x: w32,
y: w32,
z: w32,
w: w32,
}
<span class="kw">impl </span>XorShiftRng {
<span class="doccomment">/// Creates a new XorShiftRng instance which is not seeded.
///
/// The initial values of this RNG are constants, so all generators created
/// by this function will yield the same stream of random numbers. It is
/// highly recommended that this is created through `SeedableRng` instead of
/// this function
</span><span class="kw">pub fn </span>new_unseeded() -&gt; XorShiftRng {
XorShiftRng {
x: w(<span class="number">0x193a6754</span>),
y: w(<span class="number">0xa8a7d469</span>),
z: w(<span class="number">0x97830e05</span>),
w: w(<span class="number">0x113ba7bb</span>),
}
}
}
<span class="kw">impl </span>Rng <span class="kw">for </span>XorShiftRng {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32 {
<span class="kw">let </span>x = <span class="self">self</span>.x;
<span class="kw">let </span>t = x ^ (x &lt;&lt; <span class="number">11</span>);
<span class="self">self</span>.x = <span class="self">self</span>.y;
<span class="self">self</span>.y = <span class="self">self</span>.z;
<span class="self">self</span>.z = <span class="self">self</span>.w;
<span class="kw">let </span>w_ = <span class="self">self</span>.w;
<span class="self">self</span>.w = w_ ^ (w_ &gt;&gt; <span class="number">19</span>) ^ (t ^ (t &gt;&gt; <span class="number">8</span>));
<span class="self">self</span>.w.<span class="number">0
</span>}
}
<span class="kw">impl </span>SeedableRng&lt;[u32; <span class="number">4</span>]&gt; <span class="kw">for </span>XorShiftRng {
<span class="doccomment">/// Reseed an XorShiftRng. This will panic if `seed` is entirely 0.
</span><span class="kw">fn </span>reseed(<span class="kw-2">&amp;mut </span><span class="self">self</span>, seed: [u32; <span class="number">4</span>]) {
<span class="macro">assert!</span>(
!seed.iter().all(|<span class="kw-2">&amp;</span>x| x == <span class="number">0</span>),
<span class="string">&quot;XorShiftRng.reseed called with an all zero seed.&quot;
</span>);
<span class="self">self</span>.x = w(seed[<span class="number">0</span>]);
<span class="self">self</span>.y = w(seed[<span class="number">1</span>]);
<span class="self">self</span>.z = w(seed[<span class="number">2</span>]);
<span class="self">self</span>.w = w(seed[<span class="number">3</span>]);
}
<span class="doccomment">/// Create a new XorShiftRng. This will panic if `seed` is entirely 0.
</span><span class="kw">fn </span>from_seed(seed: [u32; <span class="number">4</span>]) -&gt; XorShiftRng {
<span class="macro">assert!</span>(
!seed.iter().all(|<span class="kw-2">&amp;</span>x| x == <span class="number">0</span>),
<span class="string">&quot;XorShiftRng::from_seed called with an all zero seed.&quot;
</span>);
XorShiftRng {
x: w(seed[<span class="number">0</span>]),
y: w(seed[<span class="number">1</span>]),
z: w(seed[<span class="number">2</span>]),
w: w(seed[<span class="number">3</span>]),
}
}
}
<span class="kw">impl </span>Rand <span class="kw">for </span>XorShiftRng {
<span class="kw">fn </span>rand&lt;R: Rng&gt;(rng: <span class="kw-2">&amp;mut </span>R) -&gt; XorShiftRng {
<span class="kw">let </span><span class="kw-2">mut </span>tuple: (u32, u32, u32, u32) = rng.gen();
<span class="kw">while </span>tuple == (<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>) {
tuple = rng.gen();
}
<span class="kw">let </span>(x, y, z, w_) = tuple;
XorShiftRng {
x: w(x),
y: w(y),
z: w(z),
w: w(w_),
}
}
}
<span class="doccomment">/// A wrapper for generating floating point numbers uniformly in the
/// open interval `(0,1)` (not including either endpoint).
///
/// Use `Closed01` for the closed interval `[0,1]`, and the default
/// `Rand` implementation for `f32` and `f64` for the half-open
/// `[0,1)`.
///
/// # Example
/// ```rust
/// use sgx_rand::{random, Open01};
///
/// let Open01(val) = random::&lt;Open01&lt;f32&gt;&gt;();
/// println!(&quot;f32 from (0,1): {}&quot;, val);
/// ```
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Open01&lt;F&gt;(<span class="kw">pub </span>F);
<span class="doccomment">/// A wrapper for generating floating point numbers uniformly in the
/// closed interval `[0,1]` (including both endpoints).
///
/// Use `Open01` for the closed interval `(0,1)`, and the default
/// `Rand` implementation of `f32` and `f64` for the half-open
/// `[0,1)`.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{random, Closed01};
///
/// let Closed01(val) = random::&lt;Closed01&lt;f32&gt;&gt;();
/// println!(&quot;f32 from [0,1]: {}&quot;, val);
/// ```
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Closed01&lt;F&gt;(<span class="kw">pub </span>F);
<span class="doccomment">/// The standard RNG. This is designed to be efficient on the current
/// platform.
</span><span class="attribute">#[derive(Copy, Clone, Debug)]
</span><span class="kw">pub struct </span>StdRng {
rng: IsaacWordRng,
}
<span class="kw">impl </span>StdRng {
<span class="doccomment">/// Create a randomly seeded instance of `StdRng`.
///
/// This is a very expensive operation as it has to read
/// randomness from the operating system and use this in an
/// expensive seeding operation. If one is only generating a small
/// number of random numbers, or doesn&#39;t need the utmost speed for
/// generating each number, `thread_rng` and/or `random` may be more
/// appropriate.
///
/// Reading the randomness from the OS may fail, and any error is
/// propagated via the `io::Result` return value.
</span><span class="kw">pub fn </span>new() -&gt; io::Result&lt;StdRng&gt; {
RdRand::new().map(|<span class="kw-2">mut </span>r| StdRng { rng: r.gen() })
}
}
<span class="kw">impl </span>Rng <span class="kw">for </span>StdRng {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32 {
<span class="self">self</span>.rng.next_u32()
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>next_u64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u64 {
<span class="self">self</span>.rng.next_u64()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; SeedableRng&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[usize]&gt; <span class="kw">for </span>StdRng {
<span class="kw">fn </span>reseed(<span class="kw-2">&amp;mut </span><span class="self">self</span>, seed: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[usize]) {
<span class="comment">// the internal RNG can just be seeded from the above
// randomness.
</span><span class="self">self</span>.rng
.reseed(<span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>(seed <span class="kw">as </span><span class="kw-2">*const </span>[usize] <span class="kw">as </span><span class="kw-2">*const </span>[u64]) })
}
<span class="kw">fn </span>from_seed(seed: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[usize]) -&gt; StdRng {
StdRng {
rng: SeedableRng::from_seed(<span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>(seed <span class="kw">as </span><span class="kw-2">*const </span>[usize] <span class="kw">as </span><span class="kw-2">*const </span>[u64]) }),
}
}
}
<span class="doccomment">/// Create a weak random number generator with a default algorithm and seed.
///
/// It returns the fastest `Rng` algorithm currently available in Rust without
/// consideration for cryptography or security. If you require a specifically
/// seeded `Rng` for consistency over time you should pick one algorithm and
/// create the `Rng` yourself.
///
/// This will read randomness from the operating system to seed the
/// generator.
</span><span class="kw">pub fn </span>weak_rng() -&gt; XorShiftRng {
<span class="kw">match </span>RdRand::new() {
<span class="prelude-val">Ok</span>(<span class="kw-2">mut </span>r) =&gt; r.gen(),
<span class="prelude-val">Err</span>(e) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;weak_rng: failed to create seeded RNG: {:?}&quot;</span>, e),
}
}
<span class="doccomment">/// Controls how the thread-local RNG is reseeded.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">struct </span>ThreadRngReseeder;
<span class="kw">impl </span>reseeding::Reseeder&lt;StdRng&gt; <span class="kw">for </span>ThreadRngReseeder {
<span class="kw">fn </span>reseed(<span class="kw-2">&amp;mut </span><span class="self">self</span>, rng: <span class="kw-2">&amp;mut </span>StdRng) {
<span class="kw-2">*</span>rng = <span class="kw">match </span>StdRng::new() {
<span class="prelude-val">Ok</span>(r) =&gt; r,
<span class="prelude-val">Err</span>(e) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;could not reseed thread_rng: {}&quot;</span>, e),
}
}
}
<span class="kw">const </span>THREAD_RNG_RESEED_THRESHOLD: u64 = <span class="number">32_768</span>;
<span class="kw">type </span>ThreadRngInner = reseeding::ReseedingRng&lt;StdRng, ThreadRngReseeder&gt;;
<span class="doccomment">/// The thread-local RNG.
</span><span class="attribute">#[derive(Clone, Debug)]
</span><span class="kw">pub struct </span>ThreadRng {
rng: Rc&lt;RefCell&lt;ThreadRngInner&gt;&gt;,
}
<span class="doccomment">/// Retrieve the lazily-initialized thread-local random number
/// generator, seeded by the system. Intended to be used in method
/// chaining style, e.g. `thread_rng().gen::&lt;i32&gt;()`.
///
/// The RNG provided will reseed itself from the operating system
/// after generating a certain amount of randomness.
///
/// The internal RNG used is platform and architecture dependent, even
/// if the operating system random number generator is rigged to give
/// the same sequence always. If absolute consistency is required,
/// explicitly select an RNG, e.g. `IsaacRng` or `Isaac64Rng`.
</span><span class="kw">pub fn </span>thread_rng() -&gt; ThreadRng {
<span class="comment">// used to make space in TLS for a random number generator
</span><span class="macro">thread_local!</span>(<span class="kw">static </span>THREAD_RNG_KEY: Rc&lt;RefCell&lt;ThreadRngInner&gt;&gt; = {
<span class="kw">let </span>r = <span class="kw">match </span>StdRng::new() {
<span class="prelude-val">Ok</span>(r) =&gt; r,
<span class="prelude-val">Err</span>(e) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;could not initialize thread_rng: {}&quot;</span>, e)
};
<span class="kw">let </span>rng = reseeding::ReseedingRng::new(r,
THREAD_RNG_RESEED_THRESHOLD,
ThreadRngReseeder);
Rc::new(RefCell::new(rng))
});
ThreadRng {
rng: THREAD_RNG_KEY.with(|t| t.clone()),
}
}
<span class="kw">impl </span>Rng <span class="kw">for </span>ThreadRng {
<span class="kw">fn </span>next_u32(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u32 {
<span class="self">self</span>.rng.borrow_mut().next_u32()
}
<span class="kw">fn </span>next_u64(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; u64 {
<span class="self">self</span>.rng.borrow_mut().next_u64()
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>fill_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, bytes: <span class="kw-2">&amp;mut </span>[u8]) {
<span class="self">self</span>.rng.borrow_mut().fill_bytes(bytes)
}
}
<span class="doccomment">/// Generates a random value using the thread-local random number generator.
///
/// `random()` can generate various types of random things, and so may require
/// type hinting to generate the specific type you want.
///
/// This function uses the thread local random number generator. This means
/// that if you&#39;re calling `random()` in a loop, caching the generator can
/// increase performance. An example is shown below.
///
/// # Examples
///
/// ```
/// let x = sgx_rand::random::&lt;u8&gt;();
/// println!(&quot;{}&quot;, x);
///
/// let y = sgx_rand::random::&lt;f64&gt;();
/// println!(&quot;{}&quot;, y);
///
/// if sgx_rand::random() { // generates a boolean
/// println!(&quot;Better lucky than good!&quot;);
/// }
/// ```
///
/// Caching the thread local random number generator:
///
/// ```
/// use sgx_rand::Rng;
///
/// let mut v = vec![1, 2, 3];
///
/// for x in v.iter_mut() {
/// *x = sgx_rand::random()
/// }
///
/// // would be faster as
///
/// let mut rng = sgx_rand::thread_rng();
///
/// for x in v.iter_mut() {
/// *x = rng.gen();
/// }
/// ```
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>random&lt;T: Rand&gt;() -&gt; T {
thread_rng().gen()
}
<span class="doccomment">/// Randomly sample up to `amount` elements from a finite iterator.
/// The order of elements in the sample is not random.
///
/// # Example
///
/// ```rust
/// use sgx_rand::{thread_rng, sample};
///
/// let mut rng = thread_rng();
/// let sample = sample(&amp;mut rng, 1..100, 5);
/// println!(&quot;{:?}&quot;, sample);
/// ```
</span><span class="kw">pub fn </span>sample&lt;T, I, R&gt;(rng: <span class="kw-2">&amp;mut </span>R, iterable: I, amount: usize) -&gt; Vec&lt;T&gt;
<span class="kw">where
</span>I: IntoIterator&lt;Item = T&gt;,
R: Rng,
{
<span class="kw">let </span><span class="kw-2">mut </span>iter = iterable.into_iter();
<span class="kw">let </span><span class="kw-2">mut </span>reservoir: Vec&lt;T&gt; = iter.by_ref().take(amount).collect();
<span class="comment">// continue unless the iterator was exhausted
</span><span class="kw">if </span>reservoir.len() == amount {
<span class="kw">for </span>(i, elem) <span class="kw">in </span>iter.enumerate() {
<span class="kw">let </span>k = rng.gen_range(<span class="number">0</span>, i + <span class="number">1 </span>+ amount);
<span class="kw">if let </span><span class="prelude-val">Some</span>(spot) = reservoir.get_mut(k) {
<span class="kw-2">*</span>spot = elem;
}
}
}
reservoir
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="sgx_rand" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>