diff options
author | 2024-05-28 08:18:05 +0000 | |
---|---|---|
committer | 2024-05-28 08:18:05 +0000 | |
commit | b72715079051a93004b0ad9ccc345ff006267921 (patch) | |
tree | aa10a950c633d11a073c8e368b406bd1dcfbdcf0 /src | |
download | bytes-gh-pages.tar.gz bytes-gh-pages.tar.zst bytes-gh-pages.zip |
Deploy Bytes API documentationgh-pages
Diffstat (limited to 'src')
-rw-r--r-- | src/bytes/buf/buf_impl.rs.html | 2930 | ||||
-rw-r--r-- | src/bytes/buf/buf_mut.rs.html | 3284 | ||||
-rw-r--r-- | src/bytes/buf/chain.rs.html | 482 | ||||
-rw-r--r-- | src/bytes/buf/iter.rs.html | 256 | ||||
-rw-r--r-- | src/bytes/buf/limit.rs.html | 152 | ||||
-rw-r--r-- | src/bytes/buf/mod.rs.html | 80 | ||||
-rw-r--r-- | src/bytes/buf/reader.rs.html | 164 | ||||
-rw-r--r-- | src/bytes/buf/take.rs.html | 312 | ||||
-rw-r--r-- | src/bytes/buf/uninit_slice.rs.html | 516 | ||||
-rw-r--r-- | src/bytes/buf/vec_deque.rs.html | 46 | ||||
-rw-r--r-- | src/bytes/buf/writer.rs.html | 178 | ||||
-rw-r--r-- | src/bytes/bytes.rs.html | 2962 | ||||
-rw-r--r-- | src/bytes/bytes_mut.rs.html | 3670 | ||||
-rw-r--r-- | src/bytes/fmt/debug.rs.html | 100 | ||||
-rw-r--r-- | src/bytes/fmt/hex.rs.html | 76 | ||||
-rw-r--r-- | src/bytes/fmt/mod.rs.html | 12 | ||||
-rw-r--r-- | src/bytes/lib.rs.html | 332 | ||||
-rw-r--r-- | src/bytes/loom.rs.html | 62 | ||||
-rw-r--r-- | src/bytes/serde.rs.html | 180 |
19 files changed, 15794 insertions, 0 deletions
diff --git a/src/bytes/buf/buf_impl.rs.html b/src/bytes/buf/buf_impl.rs.html new file mode 100644 index 0000000..55d225c --- /dev/null +++ b/src/bytes/buf/buf_impl.rs.html @@ -0,0 +1,2930 @@ +<!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 `src/buf/buf_impl.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>buf_impl.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> +<span id="2">2</span> +<span id="3">3</span> +<span id="4">4</span> +<span id="5">5</span> +<span id="6">6</span> +<span id="7">7</span> +<span id="8">8</span> +<span id="9">9</span> +<span id="10">10</span> +<span id="11">11</span> +<span id="12">12</span> +<span id="13">13</span> +<span id="14">14</span> +<span id="15">15</span> +<span id="16">16</span> +<span id="17">17</span> +<span id="18">18</span> +<span id="19">19</span> +<span id="20">20</span> +<span id="21">21</span> +<span id="22">22</span> +<span id="23">23</span> +<span id="24">24</span> +<span id="25">25</span> +<span id="26">26</span> +<span id="27">27</span> +<span id="28">28</span> +<span id="29">29</span> +<span id="30">30</span> +<span id="31">31</span> +<span id="32">32</span> +<span id="33">33</span> +<span id="34">34</span> +<span id="35">35</span> +<span id="36">36</span> +<span id="37">37</span> +<span id="38">38</span> +<span id="39">39</span> +<span id="40">40</span> +<span id="41">41</span> +<span id="42">42</span> +<span id="43">43</span> +<span id="44">44</span> +<span id="45">45</span> +<span id="46">46</span> +<span id="47">47</span> +<span id="48">48</span> +<span id="49">49</span> +<span id="50">50</span> +<span id="51">51</span> +<span id="52">52</span> +<span id="53">53</span> +<span id="54">54</span> +<span id="55">55</span> +<span id="56">56</span> +<span id="57">57</span> +<span id="58">58</span> +<span id="59">59</span> +<span id="60">60</span> +<span id="61">61</span> +<span id="62">62</span> +<span id="63">63</span> +<span id="64">64</span> +<span id="65">65</span> +<span id="66">66</span> +<span id="67">67</span> +<span id="68">68</span> +<span id="69">69</span> +<span id="70">70</span> +<span id="71">71</span> +<span id="72">72</span> +<span id="73">73</span> +<span id="74">74</span> +<span id="75">75</span> +<span id="76">76</span> +<span id="77">77</span> +<span id="78">78</span> +<span id="79">79</span> +<span id="80">80</span> +<span id="81">81</span> +<span id="82">82</span> +<span id="83">83</span> +<span id="84">84</span> +<span id="85">85</span> +<span id="86">86</span> +<span id="87">87</span> +<span id="88">88</span> +<span id="89">89</span> +<span id="90">90</span> +<span id="91">91</span> +<span id="92">92</span> +<span id="93">93</span> +<span id="94">94</span> +<span id="95">95</span> +<span id="96">96</span> +<span id="97">97</span> +<span id="98">98</span> +<span id="99">99</span> +<span id="100">100</span> +<span id="101">101</span> +<span id="102">102</span> +<span id="103">103</span> +<span id="104">104</span> +<span id="105">105</span> +<span id="106">106</span> +<span id="107">107</span> +<span id="108">108</span> +<span id="109">109</span> +<span id="110">110</span> +<span id="111">111</span> +<span id="112">112</span> +<span id="113">113</span> +<span id="114">114</span> +<span id="115">115</span> +<span id="116">116</span> +<span id="117">117</span> +<span id="118">118</span> +<span id="119">119</span> +<span id="120">120</span> +<span id="121">121</span> +<span id="122">122</span> +<span id="123">123</span> +<span id="124">124</span> +<span id="125">125</span> +<span id="126">126</span> +<span id="127">127</span> +<span id="128">128</span> +<span id="129">129</span> +<span id="130">130</span> +<span id="131">131</span> +<span id="132">132</span> +<span id="133">133</span> +<span id="134">134</span> +<span id="135">135</span> +<span id="136">136</span> +<span id="137">137</span> +<span id="138">138</span> +<span id="139">139</span> +<span id="140">140</span> +<span id="141">141</span> +<span id="142">142</span> +<span id="143">143</span> +<span id="144">144</span> +<span id="145">145</span> +<span id="146">146</span> +<span id="147">147</span> +<span id="148">148</span> +<span id="149">149</span> +<span id="150">150</span> +<span id="151">151</span> +<span id="152">152</span> +<span id="153">153</span> +<span id="154">154</span> +<span id="155">155</span> +<span id="156">156</span> +<span id="157">157</span> +<span id="158">158</span> +<span id="159">159</span> +<span id="160">160</span> +<span id="161">161</span> +<span id="162">162</span> +<span id="163">163</span> +<span id="164">164</span> +<span id="165">165</span> +<span id="166">166</span> +<span id="167">167</span> +<span id="168">168</span> +<span id="169">169</span> +<span id="170">170</span> +<span id="171">171</span> +<span id="172">172</span> +<span id="173">173</span> +<span id="174">174</span> +<span id="175">175</span> +<span id="176">176</span> +<span id="177">177</span> +<span id="178">178</span> +<span id="179">179</span> +<span id="180">180</span> +<span id="181">181</span> +<span id="182">182</span> +<span id="183">183</span> +<span id="184">184</span> +<span id="185">185</span> +<span id="186">186</span> +<span id="187">187</span> +<span id="188">188</span> +<span id="189">189</span> +<span id="190">190</span> +<span id="191">191</span> +<span id="192">192</span> +<span id="193">193</span> +<span id="194">194</span> +<span id="195">195</span> +<span id="196">196</span> +<span id="197">197</span> +<span id="198">198</span> +<span id="199">199</span> +<span id="200">200</span> +<span id="201">201</span> +<span id="202">202</span> +<span id="203">203</span> +<span id="204">204</span> +<span id="205">205</span> +<span id="206">206</span> +<span id="207">207</span> +<span id="208">208</span> +<span id="209">209</span> +<span id="210">210</span> +<span id="211">211</span> +<span id="212">212</span> +<span id="213">213</span> +<span id="214">214</span> +<span id="215">215</span> +<span id="216">216</span> +<span id="217">217</span> +<span id="218">218</span> +<span id="219">219</span> +<span id="220">220</span> +<span id="221">221</span> +<span id="222">222</span> +<span id="223">223</span> +<span id="224">224</span> +<span id="225">225</span> +<span id="226">226</span> +<span id="227">227</span> +<span id="228">228</span> +<span id="229">229</span> +<span id="230">230</span> +<span id="231">231</span> +<span id="232">232</span> +<span id="233">233</span> +<span id="234">234</span> +<span id="235">235</span> +<span id="236">236</span> +<span id="237">237</span> +<span id="238">238</span> +<span id="239">239</span> +<span id="240">240</span> +<span id="241">241</span> +<span id="242">242</span> +<span id="243">243</span> +<span id="244">244</span> +<span id="245">245</span> +<span id="246">246</span> +<span id="247">247</span> +<span id="248">248</span> +<span id="249">249</span> +<span id="250">250</span> +<span id="251">251</span> +<span id="252">252</span> +<span id="253">253</span> +<span id="254">254</span> +<span id="255">255</span> +<span id="256">256</span> +<span id="257">257</span> +<span id="258">258</span> +<span id="259">259</span> +<span id="260">260</span> +<span id="261">261</span> +<span id="262">262</span> +<span id="263">263</span> +<span id="264">264</span> +<span id="265">265</span> +<span id="266">266</span> +<span id="267">267</span> +<span id="268">268</span> +<span id="269">269</span> +<span id="270">270</span> +<span id="271">271</span> +<span id="272">272</span> +<span id="273">273</span> +<span id="274">274</span> +<span id="275">275</span> +<span id="276">276</span> +<span id="277">277</span> +<span id="278">278</span> +<span id="279">279</span> +<span id="280">280</span> +<span id="281">281</span> +<span id="282">282</span> +<span id="283">283</span> +<span id="284">284</span> +<span id="285">285</span> +<span id="286">286</span> +<span id="287">287</span> +<span id="288">288</span> +<span id="289">289</span> +<span id="290">290</span> +<span id="291">291</span> +<span id="292">292</span> +<span id="293">293</span> +<span id="294">294</span> +<span id="295">295</span> +<span id="296">296</span> +<span id="297">297</span> +<span id="298">298</span> +<span id="299">299</span> +<span id="300">300</span> +<span id="301">301</span> +<span id="302">302</span> +<span id="303">303</span> +<span id="304">304</span> +<span id="305">305</span> +<span id="306">306</span> +<span id="307">307</span> +<span id="308">308</span> +<span id="309">309</span> +<span id="310">310</span> +<span id="311">311</span> +<span id="312">312</span> +<span id="313">313</span> +<span id="314">314</span> +<span id="315">315</span> +<span id="316">316</span> +<span id="317">317</span> +<span id="318">318</span> +<span id="319">319</span> +<span id="320">320</span> +<span id="321">321</span> +<span id="322">322</span> +<span id="323">323</span> +<span id="324">324</span> +<span id="325">325</span> +<span id="326">326</span> +<span id="327">327</span> +<span id="328">328</span> +<span id="329">329</span> +<span id="330">330</span> +<span id="331">331</span> +<span id="332">332</span> +<span id="333">333</span> +<span id="334">334</span> +<span id="335">335</span> +<span id="336">336</span> +<span id="337">337</span> +<span id="338">338</span> +<span id="339">339</span> +<span id="340">340</span> +<span id="341">341</span> +<span id="342">342</span> +<span id="343">343</span> +<span id="344">344</span> +<span id="345">345</span> +<span id="346">346</span> +<span id="347">347</span> +<span id="348">348</span> +<span id="349">349</span> +<span id="350">350</span> +<span id="351">351</span> +<span id="352">352</span> +<span id="353">353</span> +<span id="354">354</span> +<span id="355">355</span> +<span id="356">356</span> +<span id="357">357</span> +<span id="358">358</span> +<span id="359">359</span> +<span id="360">360</span> +<span id="361">361</span> +<span id="362">362</span> +<span id="363">363</span> +<span id="364">364</span> +<span id="365">365</span> +<span id="366">366</span> +<span id="367">367</span> +<span id="368">368</span> +<span id="369">369</span> +<span id="370">370</span> +<span id="371">371</span> +<span id="372">372</span> +<span id="373">373</span> +<span id="374">374</span> +<span id="375">375</span> +<span id="376">376</span> +<span id="377">377</span> +<span id="378">378</span> +<span id="379">379</span> +<span id="380">380</span> +<span id="381">381</span> +<span id="382">382</span> +<span id="383">383</span> +<span id="384">384</span> +<span id="385">385</span> +<span id="386">386</span> +<span id="387">387</span> +<span id="388">388</span> +<span id="389">389</span> +<span id="390">390</span> +<span id="391">391</span> +<span id="392">392</span> +<span id="393">393</span> +<span id="394">394</span> +<span id="395">395</span> +<span id="396">396</span> +<span id="397">397</span> +<span id="398">398</span> +<span id="399">399</span> +<span id="400">400</span> +<span id="401">401</span> +<span id="402">402</span> +<span id="403">403</span> +<span id="404">404</span> +<span id="405">405</span> +<span id="406">406</span> +<span id="407">407</span> +<span id="408">408</span> +<span id="409">409</span> +<span id="410">410</span> +<span id="411">411</span> +<span id="412">412</span> +<span id="413">413</span> +<span id="414">414</span> +<span id="415">415</span> +<span id="416">416</span> +<span id="417">417</span> +<span id="418">418</span> +<span id="419">419</span> +<span id="420">420</span> +<span id="421">421</span> +<span id="422">422</span> +<span id="423">423</span> +<span id="424">424</span> +<span id="425">425</span> +<span id="426">426</span> +<span id="427">427</span> +<span id="428">428</span> +<span id="429">429</span> +<span id="430">430</span> +<span id="431">431</span> +<span id="432">432</span> +<span id="433">433</span> +<span id="434">434</span> +<span id="435">435</span> +<span id="436">436</span> +<span id="437">437</span> +<span id="438">438</span> +<span id="439">439</span> +<span id="440">440</span> +<span id="441">441</span> +<span id="442">442</span> +<span id="443">443</span> +<span id="444">444</span> +<span id="445">445</span> +<span id="446">446</span> +<span id="447">447</span> +<span id="448">448</span> +<span id="449">449</span> +<span id="450">450</span> +<span id="451">451</span> +<span id="452">452</span> +<span id="453">453</span> +<span id="454">454</span> +<span id="455">455</span> +<span id="456">456</span> +<span id="457">457</span> +<span id="458">458</span> +<span id="459">459</span> +<span id="460">460</span> +<span id="461">461</span> +<span id="462">462</span> +<span id="463">463</span> +<span id="464">464</span> +<span id="465">465</span> +<span id="466">466</span> +<span id="467">467</span> +<span id="468">468</span> +<span id="469">469</span> +<span id="470">470</span> +<span id="471">471</span> +<span id="472">472</span> +<span id="473">473</span> +<span id="474">474</span> +<span id="475">475</span> +<span id="476">476</span> +<span id="477">477</span> +<span id="478">478</span> +<span id="479">479</span> +<span id="480">480</span> +<span id="481">481</span> +<span id="482">482</span> +<span id="483">483</span> +<span id="484">484</span> +<span id="485">485</span> +<span id="486">486</span> +<span id="487">487</span> +<span id="488">488</span> +<span id="489">489</span> +<span id="490">490</span> +<span id="491">491</span> +<span id="492">492</span> +<span id="493">493</span> +<span id="494">494</span> +<span id="495">495</span> +<span id="496">496</span> +<span id="497">497</span> +<span id="498">498</span> +<span id="499">499</span> +<span id="500">500</span> +<span id="501">501</span> +<span id="502">502</span> +<span id="503">503</span> +<span id="504">504</span> +<span id="505">505</span> +<span id="506">506</span> +<span id="507">507</span> +<span id="508">508</span> +<span id="509">509</span> +<span id="510">510</span> +<span id="511">511</span> +<span id="512">512</span> +<span id="513">513</span> +<span id="514">514</span> +<span id="515">515</span> +<span id="516">516</span> +<span id="517">517</span> +<span id="518">518</span> +<span id="519">519</span> +<span id="520">520</span> +<span id="521">521</span> +<span id="522">522</span> +<span id="523">523</span> +<span id="524">524</span> +<span id="525">525</span> +<span id="526">526</span> +<span id="527">527</span> +<span id="528">528</span> +<span id="529">529</span> +<span id="530">530</span> +<span id="531">531</span> +<span id="532">532</span> +<span id="533">533</span> +<span id="534">534</span> +<span id="535">535</span> +<span id="536">536</span> +<span id="537">537</span> +<span id="538">538</span> +<span id="539">539</span> +<span id="540">540</span> +<span id="541">541</span> +<span id="542">542</span> +<span id="543">543</span> +<span id="544">544</span> +<span id="545">545</span> +<span id="546">546</span> +<span id="547">547</span> +<span id="548">548</span> +<span id="549">549</span> +<span id="550">550</span> +<span id="551">551</span> +<span id="552">552</span> +<span id="553">553</span> +<span id="554">554</span> +<span id="555">555</span> +<span id="556">556</span> +<span id="557">557</span> +<span id="558">558</span> +<span id="559">559</span> +<span id="560">560</span> +<span id="561">561</span> +<span id="562">562</span> +<span id="563">563</span> +<span id="564">564</span> +<span id="565">565</span> +<span id="566">566</span> +<span id="567">567</span> +<span id="568">568</span> +<span id="569">569</span> +<span id="570">570</span> +<span id="571">571</span> +<span id="572">572</span> +<span id="573">573</span> +<span id="574">574</span> +<span id="575">575</span> +<span id="576">576</span> +<span id="577">577</span> +<span id="578">578</span> +<span id="579">579</span> +<span id="580">580</span> +<span id="581">581</span> +<span id="582">582</span> +<span id="583">583</span> +<span id="584">584</span> +<span id="585">585</span> +<span id="586">586</span> +<span id="587">587</span> +<span id="588">588</span> +<span id="589">589</span> +<span id="590">590</span> +<span id="591">591</span> +<span id="592">592</span> +<span id="593">593</span> +<span id="594">594</span> +<span id="595">595</span> +<span id="596">596</span> +<span id="597">597</span> +<span id="598">598</span> +<span id="599">599</span> +<span id="600">600</span> +<span id="601">601</span> +<span id="602">602</span> +<span id="603">603</span> +<span id="604">604</span> +<span id="605">605</span> +<span id="606">606</span> +<span id="607">607</span> +<span id="608">608</span> +<span id="609">609</span> +<span id="610">610</span> +<span id="611">611</span> +<span id="612">612</span> +<span id="613">613</span> +<span id="614">614</span> +<span id="615">615</span> +<span id="616">616</span> +<span id="617">617</span> +<span id="618">618</span> +<span id="619">619</span> +<span id="620">620</span> +<span id="621">621</span> +<span id="622">622</span> +<span id="623">623</span> +<span id="624">624</span> +<span id="625">625</span> +<span id="626">626</span> +<span id="627">627</span> +<span id="628">628</span> +<span id="629">629</span> +<span id="630">630</span> +<span id="631">631</span> +<span id="632">632</span> +<span id="633">633</span> +<span id="634">634</span> +<span id="635">635</span> +<span id="636">636</span> +<span id="637">637</span> +<span id="638">638</span> +<span id="639">639</span> +<span id="640">640</span> +<span id="641">641</span> +<span id="642">642</span> +<span id="643">643</span> +<span id="644">644</span> +<span id="645">645</span> +<span id="646">646</span> +<span id="647">647</span> +<span id="648">648</span> +<span id="649">649</span> +<span id="650">650</span> +<span id="651">651</span> +<span id="652">652</span> +<span id="653">653</span> +<span id="654">654</span> +<span id="655">655</span> +<span id="656">656</span> +<span id="657">657</span> +<span id="658">658</span> +<span id="659">659</span> +<span id="660">660</span> +<span id="661">661</span> +<span id="662">662</span> +<span id="663">663</span> +<span id="664">664</span> +<span id="665">665</span> +<span id="666">666</span> +<span id="667">667</span> +<span id="668">668</span> +<span id="669">669</span> +<span id="670">670</span> +<span id="671">671</span> +<span id="672">672</span> +<span id="673">673</span> +<span id="674">674</span> +<span id="675">675</span> +<span id="676">676</span> +<span id="677">677</span> +<span id="678">678</span> +<span id="679">679</span> +<span id="680">680</span> +<span id="681">681</span> +<span id="682">682</span> +<span id="683">683</span> +<span id="684">684</span> +<span id="685">685</span> +<span id="686">686</span> +<span id="687">687</span> +<span id="688">688</span> +<span id="689">689</span> +<span id="690">690</span> +<span id="691">691</span> +<span id="692">692</span> +<span id="693">693</span> +<span id="694">694</span> +<span id="695">695</span> +<span id="696">696</span> +<span id="697">697</span> +<span id="698">698</span> +<span id="699">699</span> +<span id="700">700</span> +<span id="701">701</span> +<span id="702">702</span> +<span id="703">703</span> +<span id="704">704</span> +<span id="705">705</span> +<span id="706">706</span> +<span id="707">707</span> +<span id="708">708</span> +<span id="709">709</span> +<span id="710">710</span> +<span id="711">711</span> +<span id="712">712</span> +<span id="713">713</span> +<span id="714">714</span> +<span id="715">715</span> +<span id="716">716</span> +<span id="717">717</span> +<span id="718">718</span> +<span id="719">719</span> +<span id="720">720</span> +<span id="721">721</span> +<span id="722">722</span> +<span id="723">723</span> +<span id="724">724</span> +<span id="725">725</span> +<span id="726">726</span> +<span id="727">727</span> +<span id="728">728</span> +<span id="729">729</span> +<span id="730">730</span> +<span id="731">731</span> +<span id="732">732</span> +<span id="733">733</span> +<span id="734">734</span> +<span id="735">735</span> +<span id="736">736</span> +<span id="737">737</span> +<span id="738">738</span> +<span id="739">739</span> +<span id="740">740</span> +<span id="741">741</span> +<span id="742">742</span> +<span id="743">743</span> +<span id="744">744</span> +<span id="745">745</span> +<span id="746">746</span> +<span id="747">747</span> +<span id="748">748</span> +<span id="749">749</span> +<span id="750">750</span> +<span id="751">751</span> +<span id="752">752</span> +<span id="753">753</span> +<span id="754">754</span> +<span id="755">755</span> +<span id="756">756</span> +<span id="757">757</span> +<span id="758">758</span> +<span id="759">759</span> +<span id="760">760</span> +<span id="761">761</span> +<span id="762">762</span> +<span id="763">763</span> +<span id="764">764</span> +<span id="765">765</span> +<span id="766">766</span> +<span id="767">767</span> +<span id="768">768</span> +<span id="769">769</span> +<span id="770">770</span> +<span id="771">771</span> +<span id="772">772</span> +<span id="773">773</span> +<span id="774">774</span> +<span id="775">775</span> +<span id="776">776</span> +<span id="777">777</span> +<span id="778">778</span> +<span id="779">779</span> +<span id="780">780</span> +<span id="781">781</span> +<span id="782">782</span> +<span id="783">783</span> +<span id="784">784</span> +<span id="785">785</span> +<span id="786">786</span> +<span id="787">787</span> +<span id="788">788</span> +<span id="789">789</span> +<span id="790">790</span> +<span id="791">791</span> +<span id="792">792</span> +<span id="793">793</span> +<span id="794">794</span> +<span id="795">795</span> +<span id="796">796</span> +<span id="797">797</span> +<span id="798">798</span> +<span id="799">799</span> +<span id="800">800</span> +<span id="801">801</span> +<span id="802">802</span> +<span id="803">803</span> +<span id="804">804</span> +<span id="805">805</span> +<span id="806">806</span> +<span id="807">807</span> +<span id="808">808</span> +<span id="809">809</span> +<span id="810">810</span> +<span id="811">811</span> +<span id="812">812</span> +<span id="813">813</span> +<span id="814">814</span> +<span id="815">815</span> +<span id="816">816</span> +<span id="817">817</span> +<span id="818">818</span> +<span id="819">819</span> +<span id="820">820</span> +<span id="821">821</span> +<span id="822">822</span> +<span id="823">823</span> +<span id="824">824</span> +<span id="825">825</span> +<span id="826">826</span> +<span id="827">827</span> +<span id="828">828</span> +<span id="829">829</span> +<span id="830">830</span> +<span id="831">831</span> +<span id="832">832</span> +<span id="833">833</span> +<span id="834">834</span> +<span id="835">835</span> +<span id="836">836</span> +<span id="837">837</span> +<span id="838">838</span> +<span id="839">839</span> +<span id="840">840</span> +<span id="841">841</span> +<span id="842">842</span> +<span id="843">843</span> +<span id="844">844</span> +<span id="845">845</span> +<span id="846">846</span> +<span id="847">847</span> +<span id="848">848</span> +<span id="849">849</span> +<span id="850">850</span> +<span id="851">851</span> +<span id="852">852</span> +<span id="853">853</span> +<span id="854">854</span> +<span id="855">855</span> +<span id="856">856</span> +<span id="857">857</span> +<span id="858">858</span> +<span id="859">859</span> +<span id="860">860</span> +<span id="861">861</span> +<span id="862">862</span> +<span id="863">863</span> +<span id="864">864</span> +<span id="865">865</span> +<span id="866">866</span> +<span id="867">867</span> +<span id="868">868</span> +<span id="869">869</span> +<span id="870">870</span> +<span id="871">871</span> +<span id="872">872</span> +<span id="873">873</span> +<span id="874">874</span> +<span id="875">875</span> +<span id="876">876</span> +<span id="877">877</span> +<span id="878">878</span> +<span id="879">879</span> +<span id="880">880</span> +<span id="881">881</span> +<span id="882">882</span> +<span id="883">883</span> +<span id="884">884</span> +<span id="885">885</span> +<span id="886">886</span> +<span id="887">887</span> +<span id="888">888</span> +<span id="889">889</span> +<span id="890">890</span> +<span id="891">891</span> +<span id="892">892</span> +<span id="893">893</span> +<span id="894">894</span> +<span id="895">895</span> +<span id="896">896</span> +<span id="897">897</span> +<span id="898">898</span> +<span id="899">899</span> +<span id="900">900</span> +<span id="901">901</span> +<span id="902">902</span> +<span id="903">903</span> +<span id="904">904</span> +<span id="905">905</span> +<span id="906">906</span> +<span id="907">907</span> +<span id="908">908</span> +<span id="909">909</span> +<span id="910">910</span> +<span id="911">911</span> +<span id="912">912</span> +<span id="913">913</span> +<span id="914">914</span> +<span id="915">915</span> +<span id="916">916</span> +<span id="917">917</span> +<span id="918">918</span> +<span id="919">919</span> +<span id="920">920</span> +<span id="921">921</span> +<span id="922">922</span> +<span id="923">923</span> +<span id="924">924</span> +<span id="925">925</span> +<span id="926">926</span> +<span id="927">927</span> +<span id="928">928</span> +<span id="929">929</span> +<span id="930">930</span> +<span id="931">931</span> +<span id="932">932</span> +<span id="933">933</span> +<span id="934">934</span> +<span id="935">935</span> +<span id="936">936</span> +<span id="937">937</span> +<span id="938">938</span> +<span id="939">939</span> +<span id="940">940</span> +<span id="941">941</span> +<span id="942">942</span> +<span id="943">943</span> +<span id="944">944</span> +<span id="945">945</span> +<span id="946">946</span> +<span id="947">947</span> +<span id="948">948</span> +<span id="949">949</span> +<span id="950">950</span> +<span id="951">951</span> +<span id="952">952</span> +<span id="953">953</span> +<span id="954">954</span> +<span id="955">955</span> +<span id="956">956</span> +<span id="957">957</span> +<span id="958">958</span> +<span id="959">959</span> +<span id="960">960</span> +<span id="961">961</span> +<span id="962">962</span> +<span id="963">963</span> +<span id="964">964</span> +<span id="965">965</span> +<span id="966">966</span> +<span id="967">967</span> +<span id="968">968</span> +<span id="969">969</span> +<span id="970">970</span> +<span id="971">971</span> +<span id="972">972</span> +<span id="973">973</span> +<span id="974">974</span> +<span id="975">975</span> +<span id="976">976</span> +<span id="977">977</span> +<span id="978">978</span> +<span id="979">979</span> +<span id="980">980</span> +<span id="981">981</span> +<span id="982">982</span> +<span id="983">983</span> +<span id="984">984</span> +<span id="985">985</span> +<span id="986">986</span> +<span id="987">987</span> +<span id="988">988</span> +<span id="989">989</span> +<span id="990">990</span> +<span id="991">991</span> +<span id="992">992</span> +<span id="993">993</span> +<span id="994">994</span> +<span id="995">995</span> +<span id="996">996</span> +<span id="997">997</span> +<span id="998">998</span> +<span id="999">999</span> +<span id="1000">1000</span> +<span id="1001">1001</span> +<span id="1002">1002</span> +<span id="1003">1003</span> +<span id="1004">1004</span> +<span id="1005">1005</span> +<span id="1006">1006</span> +<span id="1007">1007</span> +<span id="1008">1008</span> +<span id="1009">1009</span> +<span id="1010">1010</span> +<span id="1011">1011</span> +<span id="1012">1012</span> +<span id="1013">1013</span> +<span id="1014">1014</span> +<span id="1015">1015</span> +<span id="1016">1016</span> +<span id="1017">1017</span> +<span id="1018">1018</span> +<span id="1019">1019</span> +<span id="1020">1020</span> +<span id="1021">1021</span> +<span id="1022">1022</span> +<span id="1023">1023</span> +<span id="1024">1024</span> +<span id="1025">1025</span> +<span id="1026">1026</span> +<span id="1027">1027</span> +<span id="1028">1028</span> +<span id="1029">1029</span> +<span id="1030">1030</span> +<span id="1031">1031</span> +<span id="1032">1032</span> +<span id="1033">1033</span> +<span id="1034">1034</span> +<span id="1035">1035</span> +<span id="1036">1036</span> +<span id="1037">1037</span> +<span id="1038">1038</span> +<span id="1039">1039</span> +<span id="1040">1040</span> +<span id="1041">1041</span> +<span id="1042">1042</span> +<span id="1043">1043</span> +<span id="1044">1044</span> +<span id="1045">1045</span> +<span id="1046">1046</span> +<span id="1047">1047</span> +<span id="1048">1048</span> +<span id="1049">1049</span> +<span id="1050">1050</span> +<span id="1051">1051</span> +<span id="1052">1052</span> +<span id="1053">1053</span> +<span id="1054">1054</span> +<span id="1055">1055</span> +<span id="1056">1056</span> +<span id="1057">1057</span> +<span id="1058">1058</span> +<span id="1059">1059</span> +<span id="1060">1060</span> +<span id="1061">1061</span> +<span id="1062">1062</span> +<span id="1063">1063</span> +<span id="1064">1064</span> +<span id="1065">1065</span> +<span id="1066">1066</span> +<span id="1067">1067</span> +<span id="1068">1068</span> +<span id="1069">1069</span> +<span id="1070">1070</span> +<span id="1071">1071</span> +<span id="1072">1072</span> +<span id="1073">1073</span> +<span id="1074">1074</span> +<span id="1075">1075</span> +<span id="1076">1076</span> +<span id="1077">1077</span> +<span id="1078">1078</span> +<span id="1079">1079</span> +<span id="1080">1080</span> +<span id="1081">1081</span> +<span id="1082">1082</span> +<span id="1083">1083</span> +<span id="1084">1084</span> +<span id="1085">1085</span> +<span id="1086">1086</span> +<span id="1087">1087</span> +<span id="1088">1088</span> +<span id="1089">1089</span> +<span id="1090">1090</span> +<span id="1091">1091</span> +<span id="1092">1092</span> +<span id="1093">1093</span> +<span id="1094">1094</span> +<span id="1095">1095</span> +<span id="1096">1096</span> +<span id="1097">1097</span> +<span id="1098">1098</span> +<span id="1099">1099</span> +<span id="1100">1100</span> +<span id="1101">1101</span> +<span id="1102">1102</span> +<span id="1103">1103</span> +<span id="1104">1104</span> +<span id="1105">1105</span> +<span id="1106">1106</span> +<span id="1107">1107</span> +<span id="1108">1108</span> +<span id="1109">1109</span> +<span id="1110">1110</span> +<span id="1111">1111</span> +<span id="1112">1112</span> +<span id="1113">1113</span> +<span id="1114">1114</span> +<span id="1115">1115</span> +<span id="1116">1116</span> +<span id="1117">1117</span> +<span id="1118">1118</span> +<span id="1119">1119</span> +<span id="1120">1120</span> +<span id="1121">1121</span> +<span id="1122">1122</span> +<span id="1123">1123</span> +<span id="1124">1124</span> +<span id="1125">1125</span> +<span id="1126">1126</span> +<span id="1127">1127</span> +<span id="1128">1128</span> +<span id="1129">1129</span> +<span id="1130">1130</span> +<span id="1131">1131</span> +<span id="1132">1132</span> +<span id="1133">1133</span> +<span id="1134">1134</span> +<span id="1135">1135</span> +<span id="1136">1136</span> +<span id="1137">1137</span> +<span id="1138">1138</span> +<span id="1139">1139</span> +<span id="1140">1140</span> +<span id="1141">1141</span> +<span id="1142">1142</span> +<span id="1143">1143</span> +<span id="1144">1144</span> +<span id="1145">1145</span> +<span id="1146">1146</span> +<span id="1147">1147</span> +<span id="1148">1148</span> +<span id="1149">1149</span> +<span id="1150">1150</span> +<span id="1151">1151</span> +<span id="1152">1152</span> +<span id="1153">1153</span> +<span id="1154">1154</span> +<span id="1155">1155</span> +<span id="1156">1156</span> +<span id="1157">1157</span> +<span id="1158">1158</span> +<span id="1159">1159</span> +<span id="1160">1160</span> +<span id="1161">1161</span> +<span id="1162">1162</span> +<span id="1163">1163</span> +<span id="1164">1164</span> +<span id="1165">1165</span> +<span id="1166">1166</span> +<span id="1167">1167</span> +<span id="1168">1168</span> +<span id="1169">1169</span> +<span id="1170">1170</span> +<span id="1171">1171</span> +<span id="1172">1172</span> +<span id="1173">1173</span> +<span id="1174">1174</span> +<span id="1175">1175</span> +<span id="1176">1176</span> +<span id="1177">1177</span> +<span id="1178">1178</span> +<span id="1179">1179</span> +<span id="1180">1180</span> +<span id="1181">1181</span> +<span id="1182">1182</span> +<span id="1183">1183</span> +<span id="1184">1184</span> +<span id="1185">1185</span> +<span id="1186">1186</span> +<span id="1187">1187</span> +<span id="1188">1188</span> +<span id="1189">1189</span> +<span id="1190">1190</span> +<span id="1191">1191</span> +<span id="1192">1192</span> +<span id="1193">1193</span> +<span id="1194">1194</span> +<span id="1195">1195</span> +<span id="1196">1196</span> +<span id="1197">1197</span> +<span id="1198">1198</span> +<span id="1199">1199</span> +<span id="1200">1200</span> +<span id="1201">1201</span> +<span id="1202">1202</span> +<span id="1203">1203</span> +<span id="1204">1204</span> +<span id="1205">1205</span> +<span id="1206">1206</span> +<span id="1207">1207</span> +<span id="1208">1208</span> +<span id="1209">1209</span> +<span id="1210">1210</span> +<span id="1211">1211</span> +<span id="1212">1212</span> +<span id="1213">1213</span> +<span id="1214">1214</span> +<span id="1215">1215</span> +<span id="1216">1216</span> +<span id="1217">1217</span> +<span id="1218">1218</span> +<span id="1219">1219</span> +<span id="1220">1220</span> +<span id="1221">1221</span> +<span id="1222">1222</span> +<span id="1223">1223</span> +<span id="1224">1224</span> +<span id="1225">1225</span> +<span id="1226">1226</span> +<span id="1227">1227</span> +<span id="1228">1228</span> +<span id="1229">1229</span> +<span id="1230">1230</span> +<span id="1231">1231</span> +<span id="1232">1232</span> +<span id="1233">1233</span> +<span id="1234">1234</span> +<span id="1235">1235</span> +<span id="1236">1236</span> +<span id="1237">1237</span> +<span id="1238">1238</span> +<span id="1239">1239</span> +<span id="1240">1240</span> +<span id="1241">1241</span> +<span id="1242">1242</span> +<span id="1243">1243</span> +<span id="1244">1244</span> +<span id="1245">1245</span> +<span id="1246">1246</span> +<span id="1247">1247</span> +<span id="1248">1248</span> +<span id="1249">1249</span> +<span id="1250">1250</span> +<span id="1251">1251</span> +<span id="1252">1252</span> +<span id="1253">1253</span> +<span id="1254">1254</span> +<span id="1255">1255</span> +<span id="1256">1256</span> +<span id="1257">1257</span> +<span id="1258">1258</span> +<span id="1259">1259</span> +<span id="1260">1260</span> +<span id="1261">1261</span> +<span id="1262">1262</span> +<span id="1263">1263</span> +<span id="1264">1264</span> +<span id="1265">1265</span> +<span id="1266">1266</span> +<span id="1267">1267</span> +<span id="1268">1268</span> +<span id="1269">1269</span> +<span id="1270">1270</span> +<span id="1271">1271</span> +<span id="1272">1272</span> +<span id="1273">1273</span> +<span id="1274">1274</span> +<span id="1275">1275</span> +<span id="1276">1276</span> +<span id="1277">1277</span> +<span id="1278">1278</span> +<span id="1279">1279</span> +<span id="1280">1280</span> +<span id="1281">1281</span> +<span id="1282">1282</span> +<span id="1283">1283</span> +<span id="1284">1284</span> +<span id="1285">1285</span> +<span id="1286">1286</span> +<span id="1287">1287</span> +<span id="1288">1288</span> +<span id="1289">1289</span> +<span id="1290">1290</span> +<span id="1291">1291</span> +<span id="1292">1292</span> +<span id="1293">1293</span> +<span id="1294">1294</span> +<span id="1295">1295</span> +<span id="1296">1296</span> +<span id="1297">1297</span> +<span id="1298">1298</span> +<span id="1299">1299</span> +<span id="1300">1300</span> +<span id="1301">1301</span> +<span id="1302">1302</span> +<span id="1303">1303</span> +<span id="1304">1304</span> +<span id="1305">1305</span> +<span id="1306">1306</span> +<span id="1307">1307</span> +<span id="1308">1308</span> +<span id="1309">1309</span> +<span id="1310">1310</span> +<span id="1311">1311</span> +<span id="1312">1312</span> +<span id="1313">1313</span> +<span id="1314">1314</span> +<span id="1315">1315</span> +<span id="1316">1316</span> +<span id="1317">1317</span> +<span id="1318">1318</span> +<span id="1319">1319</span> +<span id="1320">1320</span> +<span id="1321">1321</span> +<span id="1322">1322</span> +<span id="1323">1323</span> +<span id="1324">1324</span> +<span id="1325">1325</span> +<span id="1326">1326</span> +<span id="1327">1327</span> +<span id="1328">1328</span> +<span id="1329">1329</span> +<span id="1330">1330</span> +<span id="1331">1331</span> +<span id="1332">1332</span> +<span id="1333">1333</span> +<span id="1334">1334</span> +<span id="1335">1335</span> +<span id="1336">1336</span> +<span id="1337">1337</span> +<span id="1338">1338</span> +<span id="1339">1339</span> +<span id="1340">1340</span> +<span id="1341">1341</span> +<span id="1342">1342</span> +<span id="1343">1343</span> +<span id="1344">1344</span> +<span id="1345">1345</span> +<span id="1346">1346</span> +<span id="1347">1347</span> +<span id="1348">1348</span> +<span id="1349">1349</span> +<span id="1350">1350</span> +<span id="1351">1351</span> +<span id="1352">1352</span> +<span id="1353">1353</span> +<span id="1354">1354</span> +<span id="1355">1355</span> +<span id="1356">1356</span> +<span id="1357">1357</span> +<span id="1358">1358</span> +<span id="1359">1359</span> +<span id="1360">1360</span> +<span id="1361">1361</span> +<span id="1362">1362</span> +<span id="1363">1363</span> +<span id="1364">1364</span> +<span id="1365">1365</span> +<span id="1366">1366</span> +<span id="1367">1367</span> +<span id="1368">1368</span> +<span id="1369">1369</span> +<span id="1370">1370</span> +<span id="1371">1371</span> +<span id="1372">1372</span> +<span id="1373">1373</span> +<span id="1374">1374</span> +<span id="1375">1375</span> +<span id="1376">1376</span> +<span id="1377">1377</span> +<span id="1378">1378</span> +<span id="1379">1379</span> +<span id="1380">1380</span> +<span id="1381">1381</span> +<span id="1382">1382</span> +<span id="1383">1383</span> +<span id="1384">1384</span> +<span id="1385">1385</span> +<span id="1386">1386</span> +<span id="1387">1387</span> +<span id="1388">1388</span> +<span id="1389">1389</span> +<span id="1390">1390</span> +<span id="1391">1391</span> +<span id="1392">1392</span> +<span id="1393">1393</span> +<span id="1394">1394</span> +<span id="1395">1395</span> +<span id="1396">1396</span> +<span id="1397">1397</span> +<span id="1398">1398</span> +<span id="1399">1399</span> +<span id="1400">1400</span> +<span id="1401">1401</span> +<span id="1402">1402</span> +<span id="1403">1403</span> +<span id="1404">1404</span> +<span id="1405">1405</span> +<span id="1406">1406</span> +<span id="1407">1407</span> +<span id="1408">1408</span> +<span id="1409">1409</span> +<span id="1410">1410</span> +<span id="1411">1411</span> +<span id="1412">1412</span> +<span id="1413">1413</span> +<span id="1414">1414</span> +<span id="1415">1415</span> +<span id="1416">1416</span> +<span id="1417">1417</span> +<span id="1418">1418</span> +<span id="1419">1419</span> +<span id="1420">1420</span> +<span id="1421">1421</span> +<span id="1422">1422</span> +<span id="1423">1423</span> +<span id="1424">1424</span> +<span id="1425">1425</span> +<span id="1426">1426</span> +<span id="1427">1427</span> +<span id="1428">1428</span> +<span id="1429">1429</span> +<span id="1430">1430</span> +<span id="1431">1431</span> +<span id="1432">1432</span> +<span id="1433">1433</span> +<span id="1434">1434</span> +<span id="1435">1435</span> +<span id="1436">1436</span> +<span id="1437">1437</span> +<span id="1438">1438</span> +<span id="1439">1439</span> +<span id="1440">1440</span> +<span id="1441">1441</span> +<span id="1442">1442</span> +<span id="1443">1443</span> +<span id="1444">1444</span> +<span id="1445">1445</span> +<span id="1446">1446</span> +<span id="1447">1447</span> +<span id="1448">1448</span> +<span id="1449">1449</span> +<span id="1450">1450</span> +<span id="1451">1451</span> +<span id="1452">1452</span> +<span id="1453">1453</span> +<span id="1454">1454</span> +<span id="1455">1455</span> +<span id="1456">1456</span> +<span id="1457">1457</span> +<span id="1458">1458</span> +<span id="1459">1459</span> +<span id="1460">1460</span> +<span id="1461">1461</span> +<span id="1462">1462</span> +<span id="1463">1463</span> +<span id="1464">1464</span> +</pre><pre class="rust"><code><span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">use </span><span class="kw">crate</span>::buf::{reader, Reader}; +<span class="kw">use </span><span class="kw">crate</span>::buf::{take, Chain, Take}; +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">use crate</span>::{min_u64_usize, saturating_sub_usize_u64}; +<span class="kw">use crate</span>::{panic_advance, panic_does_not_fit}; + +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">use </span>std::io::IoSlice; + +<span class="kw">use </span>alloc::boxed::Box; + +<span class="macro">macro_rules! </span>buf_get_impl { + (<span class="macro-nonterminal">$this</span>:ident, <span class="macro-nonterminal">$typ</span>:tt::<span class="macro-nonterminal">$conv</span>:tt) => {{ + <span class="kw">const </span>SIZE: usize = core::mem::size_of::<<span class="macro-nonterminal">$typ</span>>(); + + <span class="kw">if </span><span class="macro-nonterminal">$this</span>.remaining() < SIZE { + panic_advance(SIZE, <span class="macro-nonterminal">$this</span>.remaining()); + } + + <span class="comment">// try to convert directly from the bytes + // this Option<ret> trick is to avoid keeping a borrow on self + // when advance() is called (mut borrow) and to call bytes() only once + </span><span class="kw">let </span>ret = <span class="macro-nonterminal">$this + </span>.chunk() + .get(..SIZE) + .map(|src| <span class="kw">unsafe </span>{ <span class="macro-nonterminal">$typ</span>::<span class="macro-nonterminal">$conv</span>(<span class="kw-2">*</span>(src <span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_ as </span><span class="kw-2">*const </span>[<span class="kw">_</span>; SIZE])) }); + + <span class="kw">if let </span><span class="prelude-val">Some</span>(ret) = ret { + <span class="comment">// if the direct conversion was possible, advance and return + </span><span class="macro-nonterminal">$this</span>.advance(SIZE); + <span class="kw">return </span>ret; + } <span class="kw">else </span>{ + <span class="comment">// if not we copy the bytes in a temp buffer then convert + </span><span class="kw">let </span><span class="kw-2">mut </span>buf = [<span class="number">0</span>; SIZE]; + <span class="macro-nonterminal">$this</span>.copy_to_slice(<span class="kw-2">&mut </span>buf); <span class="comment">// (do the advance) + </span><span class="kw">return </span><span class="macro-nonterminal">$typ</span>::<span class="macro-nonterminal">$conv</span>(buf); + } + }}; + (le => <span class="macro-nonterminal">$this</span>:ident, <span class="macro-nonterminal">$typ</span>:tt, <span class="macro-nonterminal">$len_to_read</span>:expr) => {{ + <span class="kw">const </span>SIZE: usize = core::mem::size_of::<<span class="macro-nonterminal">$typ</span>>(); + + <span class="comment">// The same trick as above does not improve the best case speed. + // It seems to be linked to the way the method is optimised by the compiler + </span><span class="kw">let </span><span class="kw-2">mut </span>buf = [<span class="number">0</span>; SIZE]; + + <span class="kw">let </span>subslice = <span class="kw">match </span>buf.get_mut(..<span class="macro-nonterminal">$len_to_read</span>) { + <span class="prelude-val">Some</span>(subslice) => subslice, + <span class="prelude-val">None </span>=> panic_does_not_fit(SIZE, <span class="macro-nonterminal">$len_to_read</span>), + }; + + <span class="macro-nonterminal">$this</span>.copy_to_slice(subslice); + <span class="kw">return </span><span class="macro-nonterminal">$typ::from_le_bytes</span>(buf); + }}; + (be => <span class="macro-nonterminal">$this</span>:ident, <span class="macro-nonterminal">$typ</span>:tt, <span class="macro-nonterminal">$len_to_read</span>:expr) => {{ + <span class="kw">const </span>SIZE: usize = core::mem::size_of::<<span class="macro-nonterminal">$typ</span>>(); + + <span class="kw">let </span>slice_at = <span class="kw">match </span>SIZE.checked_sub(<span class="macro-nonterminal">$len_to_read</span>) { + <span class="prelude-val">Some</span>(slice_at) => slice_at, + <span class="prelude-val">None </span>=> panic_does_not_fit(SIZE, <span class="macro-nonterminal">$len_to_read</span>), + }; + + <span class="kw">let </span><span class="kw-2">mut </span>buf = [<span class="number">0</span>; SIZE]; + <span class="macro-nonterminal">$this</span>.copy_to_slice(<span class="kw-2">&mut </span>buf[slice_at..]); + <span class="kw">return </span><span class="macro-nonterminal">$typ::from_be_bytes</span>(buf); + }}; +} + +<span class="doccomment">/// Read bytes from a buffer. +/// +/// A buffer stores bytes in memory such that read operations are infallible. +/// The underlying storage may or may not be in contiguous memory. A `Buf` value +/// is a cursor into the buffer. Reading from `Buf` advances the cursor +/// position. It can be thought of as an efficient `Iterator` for collections of +/// bytes. +/// +/// The simplest `Buf` is a `&[u8]`. +/// +/// ``` +/// use bytes::Buf; +/// +/// let mut buf = &b"hello world"[..]; +/// +/// assert_eq!(b'h', buf.get_u8()); +/// assert_eq!(b'e', buf.get_u8()); +/// assert_eq!(b'l', buf.get_u8()); +/// +/// let mut rest = [0; 8]; +/// buf.copy_to_slice(&mut rest); +/// +/// assert_eq!(&rest[..], &b"lo world"[..]); +/// ``` +</span><span class="kw">pub trait </span>Buf { + <span class="doccomment">/// Returns the number of bytes between the current position and the end of + /// the buffer. + /// + /// This value is greater than or equal to the length of the slice returned + /// by `chunk()`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"hello world"[..]; + /// + /// assert_eq!(buf.remaining(), 11); + /// + /// buf.get_u8(); + /// + /// assert_eq!(buf.remaining(), 10); + /// ``` + /// + /// # Implementer notes + /// + /// Implementations of `remaining` should ensure that the return value does + /// not change unless a call is made to `advance` or any other function that + /// is documented to change the `Buf`'s current position. + </span><span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize; + + <span class="doccomment">/// Returns a slice starting at the current position and of length between 0 + /// and `Buf::remaining()`. Note that this *can* return shorter slice (this allows + /// non-continuous internal representation). + /// + /// This is a lower level function. Most operations are done with other + /// functions. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"hello world"[..]; + /// + /// assert_eq!(buf.chunk(), &b"hello world"[..]); + /// + /// buf.advance(6); + /// + /// assert_eq!(buf.chunk(), &b"world"[..]); + /// ``` + /// + /// # Implementer notes + /// + /// This function should never panic. Once the end of the buffer is reached, + /// i.e., `Buf::remaining` returns 0, calls to `chunk()` should return an + /// empty slice. + </span><span class="comment">// The `chunk` method was previously called `bytes`. This alias makes the rename + // more easily discoverable. + </span><span class="attr">#[cfg_attr(docsrs, doc(alias = <span class="string">"bytes"</span>))] + </span><span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8]; + + <span class="doccomment">/// Fills `dst` with potentially multiple slices starting at `self`'s + /// current position. + /// + /// If the `Buf` is backed by disjoint slices of bytes, `chunk_vectored` enables + /// fetching more than one slice at once. `dst` is a slice of `IoSlice` + /// references, enabling the slice to be directly used with [`writev`] + /// without any further conversion. The sum of the lengths of all the + /// buffers in `dst` will be less than or equal to `Buf::remaining()`. + /// + /// The entries in `dst` will be overwritten, but the data **contained** by + /// the slices **will not** be modified. If `chunk_vectored` does not fill every + /// entry in `dst`, then `dst` is guaranteed to contain all remaining slices + /// in `self. + /// + /// This is a lower level function. Most operations are done with other + /// functions. + /// + /// # Implementer notes + /// + /// This function should never panic. Once the end of the buffer is reached, + /// i.e., `Buf::remaining` returns 0, calls to `chunk_vectored` must return 0 + /// without mutating `dst`. + /// + /// Implementations should also take care to properly handle being called + /// with `dst` being a zero length slice. + /// + /// [`writev`]: http://man7.org/linux/man-pages/man2/readv.2.html + </span><span class="attr">#[cfg(feature = <span class="string">"std"</span>)] + #[cfg_attr(docsrs, doc(cfg(feature = <span class="string">"std"</span>)))] + </span><span class="kw">fn </span>chunks_vectored<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">self</span>, dst: <span class="kw-2">&mut </span>[IoSlice<<span class="lifetime">'a</span>>]) -> usize { + <span class="kw">if </span>dst.is_empty() { + <span class="kw">return </span><span class="number">0</span>; + } + + <span class="kw">if </span><span class="self">self</span>.has_remaining() { + dst[<span class="number">0</span>] = IoSlice::new(<span class="self">self</span>.chunk()); + <span class="number">1 + </span>} <span class="kw">else </span>{ + <span class="number">0 + </span>} + } + + <span class="doccomment">/// Advance the internal cursor of the Buf + /// + /// The next call to `chunk()` will return a slice starting `cnt` bytes + /// further into the underlying buffer. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"hello world"[..]; + /// + /// assert_eq!(buf.chunk(), &b"hello world"[..]); + /// + /// buf.advance(6); + /// + /// assert_eq!(buf.chunk(), &b"world"[..]); + /// ``` + /// + /// # Panics + /// + /// This function **may** panic if `cnt > self.remaining()`. + /// + /// # Implementer notes + /// + /// It is recommended for implementations of `advance` to panic if `cnt > + /// self.remaining()`. If the implementation does not panic, the call must + /// behave as if `cnt == self.remaining()`. + /// + /// A call with `cnt == 0` should never panic and be a no-op. + </span><span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize); + + <span class="doccomment">/// Returns true if there are any more bytes to consume + /// + /// This is equivalent to `self.remaining() != 0`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"a"[..]; + /// + /// assert!(buf.has_remaining()); + /// + /// buf.get_u8(); + /// + /// assert!(!buf.has_remaining()); + /// ``` + </span><span class="kw">fn </span>has_remaining(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + <span class="self">self</span>.remaining() > <span class="number">0 + </span>} + + <span class="doccomment">/// Copies bytes from `self` into `dst`. + /// + /// The cursor is advanced by the number of bytes copied. `self` must have + /// enough remaining bytes to fill `dst`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"hello world"[..]; + /// let mut dst = [0; 5]; + /// + /// buf.copy_to_slice(&mut dst); + /// assert_eq!(&b"hello"[..], &dst); + /// assert_eq!(6, buf.remaining()); + /// ``` + /// + /// # Panics + /// + /// This function panics if `self.remaining() < dst.len()`. + </span><span class="kw">fn </span>copy_to_slice(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>dst: <span class="kw-2">&mut </span>[u8]) { + <span class="kw">if </span><span class="self">self</span>.remaining() < dst.len() { + panic_advance(dst.len(), <span class="self">self</span>.remaining()); + } + + <span class="kw">while </span>!dst.is_empty() { + <span class="kw">let </span>src = <span class="self">self</span>.chunk(); + <span class="kw">let </span>cnt = usize::min(src.len(), dst.len()); + + dst[..cnt].copy_from_slice(<span class="kw-2">&</span>src[..cnt]); + dst = <span class="kw-2">&mut </span>dst[cnt..]; + + <span class="self">self</span>.advance(cnt); + } + } + + <span class="doccomment">/// Gets an unsigned 8 bit integer from `self`. + /// + /// The current position is advanced by 1. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08 hello"[..]; + /// assert_eq!(8, buf.get_u8()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is no more remaining data in `self`. + </span><span class="kw">fn </span>get_u8(<span class="kw-2">&mut </span><span class="self">self</span>) -> u8 { + <span class="kw">if </span><span class="self">self</span>.remaining() < <span class="number">1 </span>{ + panic_advance(<span class="number">1</span>, <span class="number">0</span>); + } + <span class="kw">let </span>ret = <span class="self">self</span>.chunk()[<span class="number">0</span>]; + <span class="self">self</span>.advance(<span class="number">1</span>); + ret + } + + <span class="doccomment">/// Gets a signed 8 bit integer from `self`. + /// + /// The current position is advanced by 1. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08 hello"[..]; + /// assert_eq!(8, buf.get_i8()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is no more remaining data in `self`. + </span><span class="kw">fn </span>get_i8(<span class="kw-2">&mut </span><span class="self">self</span>) -> i8 { + <span class="kw">if </span><span class="self">self</span>.remaining() < <span class="number">1 </span>{ + panic_advance(<span class="number">1</span>, <span class="number">0</span>); + } + <span class="kw">let </span>ret = <span class="self">self</span>.chunk()[<span class="number">0</span>] <span class="kw">as </span>i8; + <span class="self">self</span>.advance(<span class="number">1</span>); + ret + } + + <span class="doccomment">/// Gets an unsigned 16 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08\x09 hello"[..]; + /// assert_eq!(0x0809, buf.get_u16()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u16(<span class="kw-2">&mut </span><span class="self">self</span>) -> u16 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u16::from_be_bytes); + } + + <span class="doccomment">/// Gets an unsigned 16 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x09\x08 hello"[..]; + /// assert_eq!(0x0809, buf.get_u16_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u16_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u16 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u16::from_le_bytes); + } + + <span class="doccomment">/// Gets an unsigned 16 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x08\x09 hello", + /// false => b"\x09\x08 hello", + /// }; + /// assert_eq!(0x0809, buf.get_u16_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u16_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u16 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u16::from_ne_bytes); + } + + <span class="doccomment">/// Gets a signed 16 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08\x09 hello"[..]; + /// assert_eq!(0x0809, buf.get_i16()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i16(<span class="kw-2">&mut </span><span class="self">self</span>) -> i16 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i16::from_be_bytes); + } + + <span class="doccomment">/// Gets a signed 16 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x09\x08 hello"[..]; + /// assert_eq!(0x0809, buf.get_i16_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i16_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i16 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i16::from_le_bytes); + } + + <span class="doccomment">/// Gets a signed 16 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x08\x09 hello", + /// false => b"\x09\x08 hello", + /// }; + /// assert_eq!(0x0809, buf.get_i16_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i16_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i16 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i16::from_ne_bytes); + } + + <span class="doccomment">/// Gets an unsigned 32 bit integer from `self` in the big-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08\x09\xA0\xA1 hello"[..]; + /// assert_eq!(0x0809A0A1, buf.get_u32()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u32(<span class="kw-2">&mut </span><span class="self">self</span>) -> u32 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u32::from_be_bytes); + } + + <span class="doccomment">/// Gets an unsigned 32 bit integer from `self` in the little-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\xA1\xA0\x09\x08 hello"[..]; + /// assert_eq!(0x0809A0A1, buf.get_u32_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u32_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u32 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u32::from_le_bytes); + } + + <span class="doccomment">/// Gets an unsigned 32 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x08\x09\xA0\xA1 hello", + /// false => b"\xA1\xA0\x09\x08 hello", + /// }; + /// assert_eq!(0x0809A0A1, buf.get_u32_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u32_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u32 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u32::from_ne_bytes); + } + + <span class="doccomment">/// Gets a signed 32 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08\x09\xA0\xA1 hello"[..]; + /// assert_eq!(0x0809A0A1, buf.get_i32()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i32(<span class="kw-2">&mut </span><span class="self">self</span>) -> i32 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i32::from_be_bytes); + } + + <span class="doccomment">/// Gets a signed 32 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\xA1\xA0\x09\x08 hello"[..]; + /// assert_eq!(0x0809A0A1, buf.get_i32_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i32_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i32 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i32::from_le_bytes); + } + + <span class="doccomment">/// Gets a signed 32 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x08\x09\xA0\xA1 hello", + /// false => b"\xA1\xA0\x09\x08 hello", + /// }; + /// assert_eq!(0x0809A0A1, buf.get_i32_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i32_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i32 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i32::from_ne_bytes); + } + + <span class="doccomment">/// Gets an unsigned 64 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x01\x02\x03\x04\x05\x06\x07\x08 hello"[..]; + /// assert_eq!(0x0102030405060708, buf.get_u64()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u64(<span class="kw-2">&mut </span><span class="self">self</span>) -> u64 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u64::from_be_bytes); + } + + <span class="doccomment">/// Gets an unsigned 64 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08\x07\x06\x05\x04\x03\x02\x01 hello"[..]; + /// assert_eq!(0x0102030405060708, buf.get_u64_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u64_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u64 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u64::from_le_bytes); + } + + <span class="doccomment">/// Gets an unsigned 64 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x01\x02\x03\x04\x05\x06\x07\x08 hello", + /// false => b"\x08\x07\x06\x05\x04\x03\x02\x01 hello", + /// }; + /// assert_eq!(0x0102030405060708, buf.get_u64_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u64_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u64 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u64::from_ne_bytes); + } + + <span class="doccomment">/// Gets a signed 64 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x01\x02\x03\x04\x05\x06\x07\x08 hello"[..]; + /// assert_eq!(0x0102030405060708, buf.get_i64()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i64(<span class="kw-2">&mut </span><span class="self">self</span>) -> i64 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i64::from_be_bytes); + } + + <span class="doccomment">/// Gets a signed 64 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x08\x07\x06\x05\x04\x03\x02\x01 hello"[..]; + /// assert_eq!(0x0102030405060708, buf.get_i64_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i64_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i64 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i64::from_le_bytes); + } + + <span class="doccomment">/// Gets a signed 64 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x01\x02\x03\x04\x05\x06\x07\x08 hello", + /// false => b"\x08\x07\x06\x05\x04\x03\x02\x01 hello", + /// }; + /// assert_eq!(0x0102030405060708, buf.get_i64_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i64_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i64 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i64::from_ne_bytes); + } + + <span class="doccomment">/// Gets an unsigned 128 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16 hello"[..]; + /// assert_eq!(0x01020304050607080910111213141516, buf.get_u128()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u128(<span class="kw-2">&mut </span><span class="self">self</span>) -> u128 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u128::from_be_bytes); + } + + <span class="doccomment">/// Gets an unsigned 128 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01 hello"[..]; + /// assert_eq!(0x01020304050607080910111213141516, buf.get_u128_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u128_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u128 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u128::from_le_bytes); + } + + <span class="doccomment">/// Gets an unsigned 128 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16 hello", + /// false => b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01 hello", + /// }; + /// assert_eq!(0x01020304050607080910111213141516, buf.get_u128_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_u128_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u128 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, u128::from_ne_bytes); + } + + <span class="doccomment">/// Gets a signed 128 bit integer from `self` in big-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16 hello"[..]; + /// assert_eq!(0x01020304050607080910111213141516, buf.get_i128()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i128(<span class="kw-2">&mut </span><span class="self">self</span>) -> i128 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i128::from_be_bytes); + } + + <span class="doccomment">/// Gets a signed 128 bit integer from `self` in little-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01 hello"[..]; + /// assert_eq!(0x01020304050607080910111213141516, buf.get_i128_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i128_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i128 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i128::from_le_bytes); + } + + <span class="doccomment">/// Gets a signed 128 bit integer from `self` in native-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16 hello", + /// false => b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01 hello", + /// }; + /// assert_eq!(0x01020304050607080910111213141516, buf.get_i128_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_i128_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i128 { + <span class="macro">buf_get_impl!</span>(<span class="self">self</span>, i128::from_ne_bytes); + } + + <span class="doccomment">/// Gets an unsigned n-byte integer from `self` in big-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x01\x02\x03 hello"[..]; + /// assert_eq!(0x010203, buf.get_uint(3)); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_uint(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> u64 { + <span class="macro">buf_get_impl!</span>(be => <span class="self">self</span>, u64, nbytes); + } + + <span class="doccomment">/// Gets an unsigned n-byte integer from `self` in little-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x03\x02\x01 hello"[..]; + /// assert_eq!(0x010203, buf.get_uint_le(3)); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_uint_le(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> u64 { + <span class="macro">buf_get_impl!</span>(le => <span class="self">self</span>, u64, nbytes); + } + + <span class="doccomment">/// Gets an unsigned n-byte integer from `self` in native-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x01\x02\x03 hello", + /// false => b"\x03\x02\x01 hello", + /// }; + /// assert_eq!(0x010203, buf.get_uint_ne(3)); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`, or + /// if `nbytes` is greater than 8. + </span><span class="kw">fn </span>get_uint_ne(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> u64 { + <span class="kw">if </span><span class="macro">cfg!</span>(target_endian = <span class="string">"big"</span>) { + <span class="self">self</span>.get_uint(nbytes) + } <span class="kw">else </span>{ + <span class="self">self</span>.get_uint_le(nbytes) + } + } + + <span class="doccomment">/// Gets a signed n-byte integer from `self` in big-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x01\x02\x03 hello"[..]; + /// assert_eq!(0x010203, buf.get_int(3)); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`, or + /// if `nbytes` is greater than 8. + </span><span class="kw">fn </span>get_int(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> i64 { + <span class="macro">buf_get_impl!</span>(be => <span class="self">self</span>, i64, nbytes); + } + + <span class="doccomment">/// Gets a signed n-byte integer from `self` in little-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x03\x02\x01 hello"[..]; + /// assert_eq!(0x010203, buf.get_int_le(3)); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`, or + /// if `nbytes` is greater than 8. + </span><span class="kw">fn </span>get_int_le(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> i64 { + <span class="macro">buf_get_impl!</span>(le => <span class="self">self</span>, i64, nbytes); + } + + <span class="doccomment">/// Gets a signed n-byte integer from `self` in native-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x01\x02\x03 hello", + /// false => b"\x03\x02\x01 hello", + /// }; + /// assert_eq!(0x010203, buf.get_int_ne(3)); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`, or + /// if `nbytes` is greater than 8. + </span><span class="kw">fn </span>get_int_ne(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> i64 { + <span class="kw">if </span><span class="macro">cfg!</span>(target_endian = <span class="string">"big"</span>) { + <span class="self">self</span>.get_int(nbytes) + } <span class="kw">else </span>{ + <span class="self">self</span>.get_int_le(nbytes) + } + } + + <span class="doccomment">/// Gets an IEEE754 single-precision (4 bytes) floating point number from + /// `self` in big-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x3F\x99\x99\x9A hello"[..]; + /// assert_eq!(1.2f32, buf.get_f32()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_f32(<span class="kw-2">&mut </span><span class="self">self</span>) -> f32 { + f32::from_bits(<span class="self">self</span>.get_u32()) + } + + <span class="doccomment">/// Gets an IEEE754 single-precision (4 bytes) floating point number from + /// `self` in little-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x9A\x99\x99\x3F hello"[..]; + /// assert_eq!(1.2f32, buf.get_f32_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_f32_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> f32 { + f32::from_bits(<span class="self">self</span>.get_u32_le()) + } + + <span class="doccomment">/// Gets an IEEE754 single-precision (4 bytes) floating point number from + /// `self` in native-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x3F\x99\x99\x9A hello", + /// false => b"\x9A\x99\x99\x3F hello", + /// }; + /// assert_eq!(1.2f32, buf.get_f32_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_f32_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> f32 { + f32::from_bits(<span class="self">self</span>.get_u32_ne()) + } + + <span class="doccomment">/// Gets an IEEE754 double-precision (8 bytes) floating point number from + /// `self` in big-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x3F\xF3\x33\x33\x33\x33\x33\x33 hello"[..]; + /// assert_eq!(1.2f64, buf.get_f64()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_f64(<span class="kw-2">&mut </span><span class="self">self</span>) -> f64 { + f64::from_bits(<span class="self">self</span>.get_u64()) + } + + <span class="doccomment">/// Gets an IEEE754 double-precision (8 bytes) floating point number from + /// `self` in little-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = &b"\x33\x33\x33\x33\x33\x33\xF3\x3F hello"[..]; + /// assert_eq!(1.2f64, buf.get_f64_le()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_f64_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> f64 { + f64::from_bits(<span class="self">self</span>.get_u64_le()) + } + + <span class="doccomment">/// Gets an IEEE754 double-precision (8 bytes) floating point number from + /// `self` in native-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf: &[u8] = match cfg!(target_endian = "big") { + /// true => b"\x3F\xF3\x33\x33\x33\x33\x33\x33 hello", + /// false => b"\x33\x33\x33\x33\x33\x33\xF3\x3F hello", + /// }; + /// assert_eq!(1.2f64, buf.get_f64_ne()); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining data in `self`. + </span><span class="kw">fn </span>get_f64_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> f64 { + f64::from_bits(<span class="self">self</span>.get_u64_ne()) + } + + <span class="doccomment">/// Consumes `len` bytes inside self and returns new instance of `Bytes` + /// with this data. + /// + /// This function may be optimized by the underlying type to avoid actual + /// copies. For example, `Bytes` implementation will do a shallow copy + /// (ref-count increment). + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let bytes = (&b"hello world"[..]).copy_to_bytes(5); + /// assert_eq!(&bytes[..], &b"hello"[..]); + /// ``` + /// + /// # Panics + /// + /// This function panics if `len > self.remaining()`. + </span><span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) -> <span class="kw">crate</span>::Bytes { + <span class="kw">use </span><span class="kw">super</span>::BufMut; + + <span class="kw">if </span><span class="self">self</span>.remaining() < len { + panic_advance(len, <span class="self">self</span>.remaining()); + } + + <span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="kw">crate</span>::BytesMut::with_capacity(len); + ret.put(<span class="self">self</span>.take(len)); + ret.freeze() + } + + <span class="doccomment">/// Creates an adaptor which will read at most `limit` bytes from `self`. + /// + /// This function returns a new instance of `Buf` which will read at most + /// `limit` bytes. + /// + /// # Examples + /// + /// ``` + /// use bytes::{Buf, BufMut}; + /// + /// let mut buf = b"hello world"[..].take(5); + /// let mut dst = vec![]; + /// + /// dst.put(&mut buf); + /// assert_eq!(dst, b"hello"); + /// + /// let mut buf = buf.into_inner(); + /// dst.clear(); + /// dst.put(&mut buf); + /// assert_eq!(dst, b" world"); + /// ``` + </span><span class="kw">fn </span>take(<span class="self">self</span>, limit: usize) -> Take<<span class="self">Self</span>> + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + take::new(<span class="self">self</span>, limit) + } + + <span class="doccomment">/// Creates an adaptor which will chain this buffer with another. + /// + /// The returned `Buf` instance will first consume all bytes from `self`. + /// Afterwards the output is equivalent to the output of next. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut chain = b"hello "[..].chain(&b"world"[..]); + /// + /// let full = chain.copy_to_bytes(11); + /// assert_eq!(full.chunk(), b"hello world"); + /// ``` + </span><span class="kw">fn </span>chain<U: Buf>(<span class="self">self</span>, next: U) -> Chain<<span class="self">Self</span>, U> + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + Chain::new(<span class="self">self</span>, next) + } + + <span class="doccomment">/// Creates an adaptor which implements the `Read` trait for `self`. + /// + /// This function returns a new value which implements `Read` by adapting + /// the `Read` trait functions to the `Buf` trait functions. Given that + /// `Buf` operations are infallible, none of the `Read` functions will + /// return with `Err`. + /// + /// # Examples + /// + /// ``` + /// use bytes::{Bytes, Buf}; + /// use std::io::Read; + /// + /// let buf = Bytes::from("hello world"); + /// + /// let mut reader = buf.reader(); + /// let mut dst = [0; 1024]; + /// + /// let num = reader.read(&mut dst).unwrap(); + /// + /// assert_eq!(11, num); + /// assert_eq!(&dst[..11], &b"hello world"[..]); + /// ``` + </span><span class="attr">#[cfg(feature = <span class="string">"std"</span>)] + #[cfg_attr(docsrs, doc(cfg(feature = <span class="string">"std"</span>)))] + </span><span class="kw">fn </span>reader(<span class="self">self</span>) -> Reader<<span class="self">Self</span>> + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + reader::new(<span class="self">self</span>) + } +} + +<span class="macro">macro_rules! </span>deref_forward_buf { + () => { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + (<span class="kw-2">**</span><span class="self">self</span>).remaining() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + (<span class="kw-2">**</span><span class="self">self</span>).chunk() + } + + <span class="attr">#[cfg(feature = <span class="string">"std"</span>)] + #[inline] + </span><span class="kw">fn </span>chunks_vectored<<span class="lifetime">'b</span>>(<span class="kw-2">&</span><span class="lifetime">'b </span><span class="self">self</span>, dst: <span class="kw-2">&mut </span>[IoSlice<<span class="lifetime">'b</span>>]) -> usize { + (<span class="kw-2">**</span><span class="self">self</span>).chunks_vectored(dst) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + (<span class="kw-2">**</span><span class="self">self</span>).advance(cnt) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>has_remaining(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + (<span class="kw-2">**</span><span class="self">self</span>).has_remaining() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>copy_to_slice(<span class="kw-2">&mut </span><span class="self">self</span>, dst: <span class="kw-2">&mut </span>[u8]) { + (<span class="kw-2">**</span><span class="self">self</span>).copy_to_slice(dst) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u8(<span class="kw-2">&mut </span><span class="self">self</span>) -> u8 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u8() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i8(<span class="kw-2">&mut </span><span class="self">self</span>) -> i8 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i8() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u16(<span class="kw-2">&mut </span><span class="self">self</span>) -> u16 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u16() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u16_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u16 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u16_le() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u16_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u16 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u16_ne() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i16(<span class="kw-2">&mut </span><span class="self">self</span>) -> i16 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i16() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i16_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i16 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i16_le() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i16_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i16 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i16_ne() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u32(<span class="kw-2">&mut </span><span class="self">self</span>) -> u32 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u32() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u32_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u32 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u32_le() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u32_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u32 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u32_ne() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i32(<span class="kw-2">&mut </span><span class="self">self</span>) -> i32 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i32() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i32_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i32 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i32_le() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i32_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i32 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i32_ne() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u64(<span class="kw-2">&mut </span><span class="self">self</span>) -> u64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u64() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u64_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> u64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u64_le() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_u64_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> u64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_u64_ne() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i64(<span class="kw-2">&mut </span><span class="self">self</span>) -> i64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i64() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i64_le(<span class="kw-2">&mut </span><span class="self">self</span>) -> i64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i64_le() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_i64_ne(<span class="kw-2">&mut </span><span class="self">self</span>) -> i64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_i64_ne() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_uint(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> u64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_uint(nbytes) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_uint_le(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> u64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_uint_le(nbytes) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_uint_ne(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> u64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_uint_ne(nbytes) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_int(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> i64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_int(nbytes) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_int_le(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> i64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_int_le(nbytes) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>get_int_ne(<span class="kw-2">&mut </span><span class="self">self</span>, nbytes: usize) -> i64 { + (<span class="kw-2">**</span><span class="self">self</span>).get_int_ne(nbytes) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) -> <span class="kw">crate</span>::Bytes { + (<span class="kw-2">**</span><span class="self">self</span>).copy_to_bytes(len) + } + }; +} + +<span class="kw">impl</span><T: Buf + <span class="question-mark">?</span>Sized> Buf <span class="kw">for </span><span class="kw-2">&mut </span>T { + <span class="macro">deref_forward_buf!</span>(); +} + +<span class="kw">impl</span><T: Buf + <span class="question-mark">?</span>Sized> Buf <span class="kw">for </span>Box<T> { + <span class="macro">deref_forward_buf!</span>(); +} + +<span class="kw">impl </span>Buf <span class="kw">for </span><span class="kw-2">&</span>[u8] { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self + </span>} + + <span class="attr">#[inline] + </span><span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="kw">if </span><span class="self">self</span>.len() < cnt { + panic_advance(cnt, <span class="self">self</span>.len()); + } + + <span class="kw-2">*</span><span class="self">self </span>= <span class="kw-2">&</span><span class="self">self</span>[cnt..]; + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>copy_to_slice(<span class="kw-2">&mut </span><span class="self">self</span>, dst: <span class="kw-2">&mut </span>[u8]) { + <span class="kw">if </span><span class="self">self</span>.len() < dst.len() { + panic_advance(dst.len(), <span class="self">self</span>.len()); + } + + dst.copy_from_slice(<span class="kw-2">&</span><span class="self">self</span>[..dst.len()]); + <span class="self">self</span>.advance(dst.len()); + } +} + +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">impl</span><T: AsRef<[u8]>> Buf <span class="kw">for </span>std::io::Cursor<T> { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + saturating_sub_usize_u64(<span class="self">self</span>.get_ref().as_ref().len(), <span class="self">self</span>.position()) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="kw">let </span>slice = <span class="self">self</span>.get_ref().as_ref(); + <span class="kw">let </span>pos = min_u64_usize(<span class="self">self</span>.position(), slice.len()); + <span class="kw-2">&</span>slice[pos..] + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="kw">let </span>len = <span class="self">self</span>.get_ref().as_ref().len(); + <span class="kw">let </span>pos = <span class="self">self</span>.position(); + + <span class="comment">// We intentionally allow `cnt == 0` here even if `pos > len`. + </span><span class="kw">let </span>max_cnt = saturating_sub_usize_u64(len, pos); + <span class="kw">if </span>cnt > max_cnt { + panic_advance(cnt, max_cnt); + } + + <span class="comment">// This will not overflow because either `cnt == 0` or the sum is not + // greater than `len`. + </span><span class="self">self</span>.set_position(pos + cnt <span class="kw">as </span>u64); + } +} + +<span class="comment">// The existence of this function makes the compiler catch if the Buf +// trait is "object-safe" or not. +</span><span class="kw">fn </span>_assert_trait_object(_b: <span class="kw-2">&</span><span class="kw">dyn </span>Buf) {} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/buf_mut.rs.html b/src/bytes/buf/buf_mut.rs.html new file mode 100644 index 0000000..d072b8d --- /dev/null +++ b/src/bytes/buf/buf_mut.rs.html @@ -0,0 +1,3284 @@ +<!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 `src/buf/buf_mut.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>buf_mut.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> +<span id="2">2</span> +<span id="3">3</span> +<span id="4">4</span> +<span id="5">5</span> +<span id="6">6</span> +<span id="7">7</span> +<span id="8">8</span> +<span id="9">9</span> +<span id="10">10</span> +<span id="11">11</span> +<span id="12">12</span> +<span id="13">13</span> +<span id="14">14</span> +<span id="15">15</span> +<span id="16">16</span> +<span id="17">17</span> +<span id="18">18</span> +<span id="19">19</span> +<span id="20">20</span> +<span id="21">21</span> +<span id="22">22</span> +<span id="23">23</span> +<span id="24">24</span> +<span id="25">25</span> +<span id="26">26</span> +<span id="27">27</span> +<span id="28">28</span> +<span id="29">29</span> +<span id="30">30</span> +<span id="31">31</span> +<span id="32">32</span> +<span id="33">33</span> +<span id="34">34</span> +<span id="35">35</span> +<span id="36">36</span> +<span id="37">37</span> +<span id="38">38</span> +<span id="39">39</span> +<span id="40">40</span> +<span id="41">41</span> +<span id="42">42</span> +<span id="43">43</span> +<span id="44">44</span> +<span id="45">45</span> +<span id="46">46</span> +<span id="47">47</span> +<span id="48">48</span> +<span id="49">49</span> +<span id="50">50</span> +<span id="51">51</span> +<span id="52">52</span> +<span id="53">53</span> +<span id="54">54</span> +<span id="55">55</span> +<span id="56">56</span> +<span id="57">57</span> +<span id="58">58</span> +<span id="59">59</span> +<span id="60">60</span> +<span id="61">61</span> +<span id="62">62</span> +<span id="63">63</span> +<span id="64">64</span> +<span id="65">65</span> +<span id="66">66</span> +<span id="67">67</span> +<span id="68">68</span> +<span id="69">69</span> +<span id="70">70</span> +<span id="71">71</span> +<span id="72">72</span> +<span id="73">73</span> +<span id="74">74</span> +<span id="75">75</span> +<span id="76">76</span> +<span id="77">77</span> +<span id="78">78</span> +<span id="79">79</span> +<span id="80">80</span> +<span id="81">81</span> +<span id="82">82</span> +<span id="83">83</span> +<span id="84">84</span> +<span id="85">85</span> +<span id="86">86</span> +<span id="87">87</span> +<span id="88">88</span> +<span id="89">89</span> +<span id="90">90</span> +<span id="91">91</span> +<span id="92">92</span> +<span id="93">93</span> +<span id="94">94</span> +<span id="95">95</span> +<span id="96">96</span> +<span id="97">97</span> +<span id="98">98</span> +<span id="99">99</span> +<span id="100">100</span> +<span id="101">101</span> +<span id="102">102</span> +<span id="103">103</span> +<span id="104">104</span> +<span id="105">105</span> +<span id="106">106</span> +<span id="107">107</span> +<span id="108">108</span> +<span id="109">109</span> +<span id="110">110</span> +<span id="111">111</span> +<span id="112">112</span> +<span id="113">113</span> +<span id="114">114</span> +<span id="115">115</span> +<span id="116">116</span> +<span id="117">117</span> +<span id="118">118</span> +<span id="119">119</span> +<span id="120">120</span> +<span id="121">121</span> +<span id="122">122</span> +<span id="123">123</span> +<span id="124">124</span> +<span id="125">125</span> +<span id="126">126</span> +<span id="127">127</span> +<span id="128">128</span> +<span id="129">129</span> +<span id="130">130</span> +<span id="131">131</span> +<span id="132">132</span> +<span id="133">133</span> +<span id="134">134</span> +<span id="135">135</span> +<span id="136">136</span> +<span id="137">137</span> +<span id="138">138</span> +<span id="139">139</span> +<span id="140">140</span> +<span id="141">141</span> +<span id="142">142</span> +<span id="143">143</span> +<span id="144">144</span> +<span id="145">145</span> +<span id="146">146</span> +<span id="147">147</span> +<span id="148">148</span> +<span id="149">149</span> +<span id="150">150</span> +<span id="151">151</span> +<span id="152">152</span> +<span id="153">153</span> +<span id="154">154</span> +<span id="155">155</span> +<span id="156">156</span> +<span id="157">157</span> +<span id="158">158</span> +<span id="159">159</span> +<span id="160">160</span> +<span id="161">161</span> +<span id="162">162</span> +<span id="163">163</span> +<span id="164">164</span> +<span id="165">165</span> +<span id="166">166</span> +<span id="167">167</span> +<span id="168">168</span> +<span id="169">169</span> +<span id="170">170</span> +<span id="171">171</span> +<span id="172">172</span> +<span id="173">173</span> +<span id="174">174</span> +<span id="175">175</span> +<span id="176">176</span> +<span id="177">177</span> +<span id="178">178</span> +<span id="179">179</span> +<span id="180">180</span> +<span id="181">181</span> +<span id="182">182</span> +<span id="183">183</span> +<span id="184">184</span> +<span id="185">185</span> +<span id="186">186</span> +<span id="187">187</span> +<span id="188">188</span> +<span id="189">189</span> +<span id="190">190</span> +<span id="191">191</span> +<span id="192">192</span> +<span id="193">193</span> +<span id="194">194</span> +<span id="195">195</span> +<span id="196">196</span> +<span id="197">197</span> +<span id="198">198</span> +<span id="199">199</span> +<span id="200">200</span> +<span id="201">201</span> +<span id="202">202</span> +<span id="203">203</span> +<span id="204">204</span> +<span id="205">205</span> +<span id="206">206</span> +<span id="207">207</span> +<span id="208">208</span> +<span id="209">209</span> +<span id="210">210</span> +<span id="211">211</span> +<span id="212">212</span> +<span id="213">213</span> +<span id="214">214</span> +<span id="215">215</span> +<span id="216">216</span> +<span id="217">217</span> +<span id="218">218</span> +<span id="219">219</span> +<span id="220">220</span> +<span id="221">221</span> +<span id="222">222</span> +<span id="223">223</span> +<span id="224">224</span> +<span id="225">225</span> +<span id="226">226</span> +<span id="227">227</span> +<span id="228">228</span> +<span id="229">229</span> +<span id="230">230</span> +<span id="231">231</span> +<span id="232">232</span> +<span id="233">233</span> +<span id="234">234</span> +<span id="235">235</span> +<span id="236">236</span> +<span id="237">237</span> +<span id="238">238</span> +<span id="239">239</span> +<span id="240">240</span> +<span id="241">241</span> +<span id="242">242</span> +<span id="243">243</span> +<span id="244">244</span> +<span id="245">245</span> +<span id="246">246</span> +<span id="247">247</span> +<span id="248">248</span> +<span id="249">249</span> +<span id="250">250</span> +<span id="251">251</span> +<span id="252">252</span> +<span id="253">253</span> +<span id="254">254</span> +<span id="255">255</span> +<span id="256">256</span> +<span id="257">257</span> +<span id="258">258</span> +<span id="259">259</span> +<span id="260">260</span> +<span id="261">261</span> +<span id="262">262</span> +<span id="263">263</span> +<span id="264">264</span> +<span id="265">265</span> +<span id="266">266</span> +<span id="267">267</span> +<span id="268">268</span> +<span id="269">269</span> +<span id="270">270</span> +<span id="271">271</span> +<span id="272">272</span> +<span id="273">273</span> +<span id="274">274</span> +<span id="275">275</span> +<span id="276">276</span> +<span id="277">277</span> +<span id="278">278</span> +<span id="279">279</span> +<span id="280">280</span> +<span id="281">281</span> +<span id="282">282</span> +<span id="283">283</span> +<span id="284">284</span> +<span id="285">285</span> +<span id="286">286</span> +<span id="287">287</span> +<span id="288">288</span> +<span id="289">289</span> +<span id="290">290</span> +<span id="291">291</span> +<span id="292">292</span> +<span id="293">293</span> +<span id="294">294</span> +<span id="295">295</span> +<span id="296">296</span> +<span id="297">297</span> +<span id="298">298</span> +<span id="299">299</span> +<span id="300">300</span> +<span id="301">301</span> +<span id="302">302</span> +<span id="303">303</span> +<span id="304">304</span> +<span id="305">305</span> +<span id="306">306</span> +<span id="307">307</span> +<span id="308">308</span> +<span id="309">309</span> +<span id="310">310</span> +<span id="311">311</span> +<span id="312">312</span> +<span id="313">313</span> +<span id="314">314</span> +<span id="315">315</span> +<span id="316">316</span> +<span id="317">317</span> +<span id="318">318</span> +<span id="319">319</span> +<span id="320">320</span> +<span id="321">321</span> +<span id="322">322</span> +<span id="323">323</span> +<span id="324">324</span> +<span id="325">325</span> +<span id="326">326</span> +<span id="327">327</span> +<span id="328">328</span> +<span id="329">329</span> +<span id="330">330</span> +<span id="331">331</span> +<span id="332">332</span> +<span id="333">333</span> +<span id="334">334</span> +<span id="335">335</span> +<span id="336">336</span> +<span id="337">337</span> +<span id="338">338</span> +<span id="339">339</span> +<span id="340">340</span> +<span id="341">341</span> +<span id="342">342</span> +<span id="343">343</span> +<span id="344">344</span> +<span id="345">345</span> +<span id="346">346</span> +<span id="347">347</span> +<span id="348">348</span> +<span id="349">349</span> +<span id="350">350</span> +<span id="351">351</span> +<span id="352">352</span> +<span id="353">353</span> +<span id="354">354</span> +<span id="355">355</span> +<span id="356">356</span> +<span id="357">357</span> +<span id="358">358</span> +<span id="359">359</span> +<span id="360">360</span> +<span id="361">361</span> +<span id="362">362</span> +<span id="363">363</span> +<span id="364">364</span> +<span id="365">365</span> +<span id="366">366</span> +<span id="367">367</span> +<span id="368">368</span> +<span id="369">369</span> +<span id="370">370</span> +<span id="371">371</span> +<span id="372">372</span> +<span id="373">373</span> +<span id="374">374</span> +<span id="375">375</span> +<span id="376">376</span> +<span id="377">377</span> +<span id="378">378</span> +<span id="379">379</span> +<span id="380">380</span> +<span id="381">381</span> +<span id="382">382</span> +<span id="383">383</span> +<span id="384">384</span> +<span id="385">385</span> +<span id="386">386</span> +<span id="387">387</span> +<span id="388">388</span> +<span id="389">389</span> +<span id="390">390</span> +<span id="391">391</span> +<span id="392">392</span> +<span id="393">393</span> +<span id="394">394</span> +<span id="395">395</span> +<span id="396">396</span> +<span id="397">397</span> +<span id="398">398</span> +<span id="399">399</span> +<span id="400">400</span> +<span id="401">401</span> +<span id="402">402</span> +<span id="403">403</span> +<span id="404">404</span> +<span id="405">405</span> +<span id="406">406</span> +<span id="407">407</span> +<span id="408">408</span> +<span id="409">409</span> +<span id="410">410</span> +<span id="411">411</span> +<span id="412">412</span> +<span id="413">413</span> +<span id="414">414</span> +<span id="415">415</span> +<span id="416">416</span> +<span id="417">417</span> +<span id="418">418</span> +<span id="419">419</span> +<span id="420">420</span> +<span id="421">421</span> +<span id="422">422</span> +<span id="423">423</span> +<span id="424">424</span> +<span id="425">425</span> +<span id="426">426</span> +<span id="427">427</span> +<span id="428">428</span> +<span id="429">429</span> +<span id="430">430</span> +<span id="431">431</span> +<span id="432">432</span> +<span id="433">433</span> +<span id="434">434</span> +<span id="435">435</span> +<span id="436">436</span> +<span id="437">437</span> +<span id="438">438</span> +<span id="439">439</span> +<span id="440">440</span> +<span id="441">441</span> +<span id="442">442</span> +<span id="443">443</span> +<span id="444">444</span> +<span id="445">445</span> +<span id="446">446</span> +<span id="447">447</span> +<span id="448">448</span> +<span id="449">449</span> +<span id="450">450</span> +<span id="451">451</span> +<span id="452">452</span> +<span id="453">453</span> +<span id="454">454</span> +<span id="455">455</span> +<span id="456">456</span> +<span id="457">457</span> +<span id="458">458</span> +<span id="459">459</span> +<span id="460">460</span> +<span id="461">461</span> +<span id="462">462</span> +<span id="463">463</span> +<span id="464">464</span> +<span id="465">465</span> +<span id="466">466</span> +<span id="467">467</span> +<span id="468">468</span> +<span id="469">469</span> +<span id="470">470</span> +<span id="471">471</span> +<span id="472">472</span> +<span id="473">473</span> +<span id="474">474</span> +<span id="475">475</span> +<span id="476">476</span> +<span id="477">477</span> +<span id="478">478</span> +<span id="479">479</span> +<span id="480">480</span> +<span id="481">481</span> +<span id="482">482</span> +<span id="483">483</span> +<span id="484">484</span> +<span id="485">485</span> +<span id="486">486</span> +<span id="487">487</span> +<span id="488">488</span> +<span id="489">489</span> +<span id="490">490</span> +<span id="491">491</span> +<span id="492">492</span> +<span id="493">493</span> +<span id="494">494</span> +<span id="495">495</span> +<span id="496">496</span> +<span id="497">497</span> +<span id="498">498</span> +<span id="499">499</span> +<span id="500">500</span> +<span id="501">501</span> +<span id="502">502</span> +<span id="503">503</span> +<span id="504">504</span> +<span id="505">505</span> +<span id="506">506</span> +<span id="507">507</span> +<span id="508">508</span> +<span id="509">509</span> +<span id="510">510</span> +<span id="511">511</span> +<span id="512">512</span> +<span id="513">513</span> +<span id="514">514</span> +<span id="515">515</span> +<span id="516">516</span> +<span id="517">517</span> +<span id="518">518</span> +<span id="519">519</span> +<span id="520">520</span> +<span id="521">521</span> +<span id="522">522</span> +<span id="523">523</span> +<span id="524">524</span> +<span id="525">525</span> +<span id="526">526</span> +<span id="527">527</span> +<span id="528">528</span> +<span id="529">529</span> +<span id="530">530</span> +<span id="531">531</span> +<span id="532">532</span> +<span id="533">533</span> +<span id="534">534</span> +<span id="535">535</span> +<span id="536">536</span> +<span id="537">537</span> +<span id="538">538</span> +<span id="539">539</span> +<span id="540">540</span> +<span id="541">541</span> +<span id="542">542</span> +<span id="543">543</span> +<span id="544">544</span> +<span id="545">545</span> +<span id="546">546</span> +<span id="547">547</span> +<span id="548">548</span> +<span id="549">549</span> +<span id="550">550</span> +<span id="551">551</span> +<span id="552">552</span> +<span id="553">553</span> +<span id="554">554</span> +<span id="555">555</span> +<span id="556">556</span> +<span id="557">557</span> +<span id="558">558</span> +<span id="559">559</span> +<span id="560">560</span> +<span id="561">561</span> +<span id="562">562</span> +<span id="563">563</span> +<span id="564">564</span> +<span id="565">565</span> +<span id="566">566</span> +<span id="567">567</span> +<span id="568">568</span> +<span id="569">569</span> +<span id="570">570</span> +<span id="571">571</span> +<span id="572">572</span> +<span id="573">573</span> +<span id="574">574</span> +<span id="575">575</span> +<span id="576">576</span> +<span id="577">577</span> +<span id="578">578</span> +<span id="579">579</span> +<span id="580">580</span> +<span id="581">581</span> +<span id="582">582</span> +<span id="583">583</span> +<span id="584">584</span> +<span id="585">585</span> +<span id="586">586</span> +<span id="587">587</span> +<span id="588">588</span> +<span id="589">589</span> +<span id="590">590</span> +<span id="591">591</span> +<span id="592">592</span> +<span id="593">593</span> +<span id="594">594</span> +<span id="595">595</span> +<span id="596">596</span> +<span id="597">597</span> +<span id="598">598</span> +<span id="599">599</span> +<span id="600">600</span> +<span id="601">601</span> +<span id="602">602</span> +<span id="603">603</span> +<span id="604">604</span> +<span id="605">605</span> +<span id="606">606</span> +<span id="607">607</span> +<span id="608">608</span> +<span id="609">609</span> +<span id="610">610</span> +<span id="611">611</span> +<span id="612">612</span> +<span id="613">613</span> +<span id="614">614</span> +<span id="615">615</span> +<span id="616">616</span> +<span id="617">617</span> +<span id="618">618</span> +<span id="619">619</span> +<span id="620">620</span> +<span id="621">621</span> +<span id="622">622</span> +<span id="623">623</span> +<span id="624">624</span> +<span id="625">625</span> +<span id="626">626</span> +<span id="627">627</span> +<span id="628">628</span> +<span id="629">629</span> +<span id="630">630</span> +<span id="631">631</span> +<span id="632">632</span> +<span id="633">633</span> +<span id="634">634</span> +<span id="635">635</span> +<span id="636">636</span> +<span id="637">637</span> +<span id="638">638</span> +<span id="639">639</span> +<span id="640">640</span> +<span id="641">641</span> +<span id="642">642</span> +<span id="643">643</span> +<span id="644">644</span> +<span id="645">645</span> +<span id="646">646</span> +<span id="647">647</span> +<span id="648">648</span> +<span id="649">649</span> +<span id="650">650</span> +<span id="651">651</span> +<span id="652">652</span> +<span id="653">653</span> +<span id="654">654</span> +<span id="655">655</span> +<span id="656">656</span> +<span id="657">657</span> +<span id="658">658</span> +<span id="659">659</span> +<span id="660">660</span> +<span id="661">661</span> +<span id="662">662</span> +<span id="663">663</span> +<span id="664">664</span> +<span id="665">665</span> +<span id="666">666</span> +<span id="667">667</span> +<span id="668">668</span> +<span id="669">669</span> +<span id="670">670</span> +<span id="671">671</span> +<span id="672">672</span> +<span id="673">673</span> +<span id="674">674</span> +<span id="675">675</span> +<span id="676">676</span> +<span id="677">677</span> +<span id="678">678</span> +<span id="679">679</span> +<span id="680">680</span> +<span id="681">681</span> +<span id="682">682</span> +<span id="683">683</span> +<span id="684">684</span> +<span id="685">685</span> +<span id="686">686</span> +<span id="687">687</span> +<span id="688">688</span> +<span id="689">689</span> +<span id="690">690</span> +<span id="691">691</span> +<span id="692">692</span> +<span id="693">693</span> +<span id="694">694</span> +<span id="695">695</span> +<span id="696">696</span> +<span id="697">697</span> +<span id="698">698</span> +<span id="699">699</span> +<span id="700">700</span> +<span id="701">701</span> +<span id="702">702</span> +<span id="703">703</span> +<span id="704">704</span> +<span id="705">705</span> +<span id="706">706</span> +<span id="707">707</span> +<span id="708">708</span> +<span id="709">709</span> +<span id="710">710</span> +<span id="711">711</span> +<span id="712">712</span> +<span id="713">713</span> +<span id="714">714</span> +<span id="715">715</span> +<span id="716">716</span> +<span id="717">717</span> +<span id="718">718</span> +<span id="719">719</span> +<span id="720">720</span> +<span id="721">721</span> +<span id="722">722</span> +<span id="723">723</span> +<span id="724">724</span> +<span id="725">725</span> +<span id="726">726</span> +<span id="727">727</span> +<span id="728">728</span> +<span id="729">729</span> +<span id="730">730</span> +<span id="731">731</span> +<span id="732">732</span> +<span id="733">733</span> +<span id="734">734</span> +<span id="735">735</span> +<span id="736">736</span> +<span id="737">737</span> +<span id="738">738</span> +<span id="739">739</span> +<span id="740">740</span> +<span id="741">741</span> +<span id="742">742</span> +<span id="743">743</span> +<span id="744">744</span> +<span id="745">745</span> +<span id="746">746</span> +<span id="747">747</span> +<span id="748">748</span> +<span id="749">749</span> +<span id="750">750</span> +<span id="751">751</span> +<span id="752">752</span> +<span id="753">753</span> +<span id="754">754</span> +<span id="755">755</span> +<span id="756">756</span> +<span id="757">757</span> +<span id="758">758</span> +<span id="759">759</span> +<span id="760">760</span> +<span id="761">761</span> +<span id="762">762</span> +<span id="763">763</span> +<span id="764">764</span> +<span id="765">765</span> +<span id="766">766</span> +<span id="767">767</span> +<span id="768">768</span> +<span id="769">769</span> +<span id="770">770</span> +<span id="771">771</span> +<span id="772">772</span> +<span id="773">773</span> +<span id="774">774</span> +<span id="775">775</span> +<span id="776">776</span> +<span id="777">777</span> +<span id="778">778</span> +<span id="779">779</span> +<span id="780">780</span> +<span id="781">781</span> +<span id="782">782</span> +<span id="783">783</span> +<span id="784">784</span> +<span id="785">785</span> +<span id="786">786</span> +<span id="787">787</span> +<span id="788">788</span> +<span id="789">789</span> +<span id="790">790</span> +<span id="791">791</span> +<span id="792">792</span> +<span id="793">793</span> +<span id="794">794</span> +<span id="795">795</span> +<span id="796">796</span> +<span id="797">797</span> +<span id="798">798</span> +<span id="799">799</span> +<span id="800">800</span> +<span id="801">801</span> +<span id="802">802</span> +<span id="803">803</span> +<span id="804">804</span> +<span id="805">805</span> +<span id="806">806</span> +<span id="807">807</span> +<span id="808">808</span> +<span id="809">809</span> +<span id="810">810</span> +<span id="811">811</span> +<span id="812">812</span> +<span id="813">813</span> +<span id="814">814</span> +<span id="815">815</span> +<span id="816">816</span> +<span id="817">817</span> +<span id="818">818</span> +<span id="819">819</span> +<span id="820">820</span> +<span id="821">821</span> +<span id="822">822</span> +<span id="823">823</span> +<span id="824">824</span> +<span id="825">825</span> +<span id="826">826</span> +<span id="827">827</span> +<span id="828">828</span> +<span id="829">829</span> +<span id="830">830</span> +<span id="831">831</span> +<span id="832">832</span> +<span id="833">833</span> +<span id="834">834</span> +<span id="835">835</span> +<span id="836">836</span> +<span id="837">837</span> +<span id="838">838</span> +<span id="839">839</span> +<span id="840">840</span> +<span id="841">841</span> +<span id="842">842</span> +<span id="843">843</span> +<span id="844">844</span> +<span id="845">845</span> +<span id="846">846</span> +<span id="847">847</span> +<span id="848">848</span> +<span id="849">849</span> +<span id="850">850</span> +<span id="851">851</span> +<span id="852">852</span> +<span id="853">853</span> +<span id="854">854</span> +<span id="855">855</span> +<span id="856">856</span> +<span id="857">857</span> +<span id="858">858</span> +<span id="859">859</span> +<span id="860">860</span> +<span id="861">861</span> +<span id="862">862</span> +<span id="863">863</span> +<span id="864">864</span> +<span id="865">865</span> +<span id="866">866</span> +<span id="867">867</span> +<span id="868">868</span> +<span id="869">869</span> +<span id="870">870</span> +<span id="871">871</span> +<span id="872">872</span> +<span id="873">873</span> +<span id="874">874</span> +<span id="875">875</span> +<span id="876">876</span> +<span id="877">877</span> +<span id="878">878</span> +<span id="879">879</span> +<span id="880">880</span> +<span id="881">881</span> +<span id="882">882</span> +<span id="883">883</span> +<span id="884">884</span> +<span id="885">885</span> +<span id="886">886</span> +<span id="887">887</span> +<span id="888">888</span> +<span id="889">889</span> +<span id="890">890</span> +<span id="891">891</span> +<span id="892">892</span> +<span id="893">893</span> +<span id="894">894</span> +<span id="895">895</span> +<span id="896">896</span> +<span id="897">897</span> +<span id="898">898</span> +<span id="899">899</span> +<span id="900">900</span> +<span id="901">901</span> +<span id="902">902</span> +<span id="903">903</span> +<span id="904">904</span> +<span id="905">905</span> +<span id="906">906</span> +<span id="907">907</span> +<span id="908">908</span> +<span id="909">909</span> +<span id="910">910</span> +<span id="911">911</span> +<span id="912">912</span> +<span id="913">913</span> +<span id="914">914</span> +<span id="915">915</span> +<span id="916">916</span> +<span id="917">917</span> +<span id="918">918</span> +<span id="919">919</span> +<span id="920">920</span> +<span id="921">921</span> +<span id="922">922</span> +<span id="923">923</span> +<span id="924">924</span> +<span id="925">925</span> +<span id="926">926</span> +<span id="927">927</span> +<span id="928">928</span> +<span id="929">929</span> +<span id="930">930</span> +<span id="931">931</span> +<span id="932">932</span> +<span id="933">933</span> +<span id="934">934</span> +<span id="935">935</span> +<span id="936">936</span> +<span id="937">937</span> +<span id="938">938</span> +<span id="939">939</span> +<span id="940">940</span> +<span id="941">941</span> +<span id="942">942</span> +<span id="943">943</span> +<span id="944">944</span> +<span id="945">945</span> +<span id="946">946</span> +<span id="947">947</span> +<span id="948">948</span> +<span id="949">949</span> +<span id="950">950</span> +<span id="951">951</span> +<span id="952">952</span> +<span id="953">953</span> +<span id="954">954</span> +<span id="955">955</span> +<span id="956">956</span> +<span id="957">957</span> +<span id="958">958</span> +<span id="959">959</span> +<span id="960">960</span> +<span id="961">961</span> +<span id="962">962</span> +<span id="963">963</span> +<span id="964">964</span> +<span id="965">965</span> +<span id="966">966</span> +<span id="967">967</span> +<span id="968">968</span> +<span id="969">969</span> +<span id="970">970</span> +<span id="971">971</span> +<span id="972">972</span> +<span id="973">973</span> +<span id="974">974</span> +<span id="975">975</span> +<span id="976">976</span> +<span id="977">977</span> +<span id="978">978</span> +<span id="979">979</span> +<span id="980">980</span> +<span id="981">981</span> +<span id="982">982</span> +<span id="983">983</span> +<span id="984">984</span> +<span id="985">985</span> +<span id="986">986</span> +<span id="987">987</span> +<span id="988">988</span> +<span id="989">989</span> +<span id="990">990</span> +<span id="991">991</span> +<span id="992">992</span> +<span id="993">993</span> +<span id="994">994</span> +<span id="995">995</span> +<span id="996">996</span> +<span id="997">997</span> +<span id="998">998</span> +<span id="999">999</span> +<span id="1000">1000</span> +<span id="1001">1001</span> +<span id="1002">1002</span> +<span id="1003">1003</span> +<span id="1004">1004</span> +<span id="1005">1005</span> +<span id="1006">1006</span> +<span id="1007">1007</span> +<span id="1008">1008</span> +<span id="1009">1009</span> +<span id="1010">1010</span> +<span id="1011">1011</span> +<span id="1012">1012</span> +<span id="1013">1013</span> +<span id="1014">1014</span> +<span id="1015">1015</span> +<span id="1016">1016</span> +<span id="1017">1017</span> +<span id="1018">1018</span> +<span id="1019">1019</span> +<span id="1020">1020</span> +<span id="1021">1021</span> +<span id="1022">1022</span> +<span id="1023">1023</span> +<span id="1024">1024</span> +<span id="1025">1025</span> +<span id="1026">1026</span> +<span id="1027">1027</span> +<span id="1028">1028</span> +<span id="1029">1029</span> +<span id="1030">1030</span> +<span id="1031">1031</span> +<span id="1032">1032</span> +<span id="1033">1033</span> +<span id="1034">1034</span> +<span id="1035">1035</span> +<span id="1036">1036</span> +<span id="1037">1037</span> +<span id="1038">1038</span> +<span id="1039">1039</span> +<span id="1040">1040</span> +<span id="1041">1041</span> +<span id="1042">1042</span> +<span id="1043">1043</span> +<span id="1044">1044</span> +<span id="1045">1045</span> +<span id="1046">1046</span> +<span id="1047">1047</span> +<span id="1048">1048</span> +<span id="1049">1049</span> +<span id="1050">1050</span> +<span id="1051">1051</span> +<span id="1052">1052</span> +<span id="1053">1053</span> +<span id="1054">1054</span> +<span id="1055">1055</span> +<span id="1056">1056</span> +<span id="1057">1057</span> +<span id="1058">1058</span> +<span id="1059">1059</span> +<span id="1060">1060</span> +<span id="1061">1061</span> +<span id="1062">1062</span> +<span id="1063">1063</span> +<span id="1064">1064</span> +<span id="1065">1065</span> +<span id="1066">1066</span> +<span id="1067">1067</span> +<span id="1068">1068</span> +<span id="1069">1069</span> +<span id="1070">1070</span> +<span id="1071">1071</span> +<span id="1072">1072</span> +<span id="1073">1073</span> +<span id="1074">1074</span> +<span id="1075">1075</span> +<span id="1076">1076</span> +<span id="1077">1077</span> +<span id="1078">1078</span> +<span id="1079">1079</span> +<span id="1080">1080</span> +<span id="1081">1081</span> +<span id="1082">1082</span> +<span id="1083">1083</span> +<span id="1084">1084</span> +<span id="1085">1085</span> +<span id="1086">1086</span> +<span id="1087">1087</span> +<span id="1088">1088</span> +<span id="1089">1089</span> +<span id="1090">1090</span> +<span id="1091">1091</span> +<span id="1092">1092</span> +<span id="1093">1093</span> +<span id="1094">1094</span> +<span id="1095">1095</span> +<span id="1096">1096</span> +<span id="1097">1097</span> +<span id="1098">1098</span> +<span id="1099">1099</span> +<span id="1100">1100</span> +<span id="1101">1101</span> +<span id="1102">1102</span> +<span id="1103">1103</span> +<span id="1104">1104</span> +<span id="1105">1105</span> +<span id="1106">1106</span> +<span id="1107">1107</span> +<span id="1108">1108</span> +<span id="1109">1109</span> +<span id="1110">1110</span> +<span id="1111">1111</span> +<span id="1112">1112</span> +<span id="1113">1113</span> +<span id="1114">1114</span> +<span id="1115">1115</span> +<span id="1116">1116</span> +<span id="1117">1117</span> +<span id="1118">1118</span> +<span id="1119">1119</span> +<span id="1120">1120</span> +<span id="1121">1121</span> +<span id="1122">1122</span> +<span id="1123">1123</span> +<span id="1124">1124</span> +<span id="1125">1125</span> +<span id="1126">1126</span> +<span id="1127">1127</span> +<span id="1128">1128</span> +<span id="1129">1129</span> +<span id="1130">1130</span> +<span id="1131">1131</span> +<span id="1132">1132</span> +<span id="1133">1133</span> +<span id="1134">1134</span> +<span id="1135">1135</span> +<span id="1136">1136</span> +<span id="1137">1137</span> +<span id="1138">1138</span> +<span id="1139">1139</span> +<span id="1140">1140</span> +<span id="1141">1141</span> +<span id="1142">1142</span> +<span id="1143">1143</span> +<span id="1144">1144</span> +<span id="1145">1145</span> +<span id="1146">1146</span> +<span id="1147">1147</span> +<span id="1148">1148</span> +<span id="1149">1149</span> +<span id="1150">1150</span> +<span id="1151">1151</span> +<span id="1152">1152</span> +<span id="1153">1153</span> +<span id="1154">1154</span> +<span id="1155">1155</span> +<span id="1156">1156</span> +<span id="1157">1157</span> +<span id="1158">1158</span> +<span id="1159">1159</span> +<span id="1160">1160</span> +<span id="1161">1161</span> +<span id="1162">1162</span> +<span id="1163">1163</span> +<span id="1164">1164</span> +<span id="1165">1165</span> +<span id="1166">1166</span> +<span id="1167">1167</span> +<span id="1168">1168</span> +<span id="1169">1169</span> +<span id="1170">1170</span> +<span id="1171">1171</span> +<span id="1172">1172</span> +<span id="1173">1173</span> +<span id="1174">1174</span> +<span id="1175">1175</span> +<span id="1176">1176</span> +<span id="1177">1177</span> +<span id="1178">1178</span> +<span id="1179">1179</span> +<span id="1180">1180</span> +<span id="1181">1181</span> +<span id="1182">1182</span> +<span id="1183">1183</span> +<span id="1184">1184</span> +<span id="1185">1185</span> +<span id="1186">1186</span> +<span id="1187">1187</span> +<span id="1188">1188</span> +<span id="1189">1189</span> +<span id="1190">1190</span> +<span id="1191">1191</span> +<span id="1192">1192</span> +<span id="1193">1193</span> +<span id="1194">1194</span> +<span id="1195">1195</span> +<span id="1196">1196</span> +<span id="1197">1197</span> +<span id="1198">1198</span> +<span id="1199">1199</span> +<span id="1200">1200</span> +<span id="1201">1201</span> +<span id="1202">1202</span> +<span id="1203">1203</span> +<span id="1204">1204</span> +<span id="1205">1205</span> +<span id="1206">1206</span> +<span id="1207">1207</span> +<span id="1208">1208</span> +<span id="1209">1209</span> +<span id="1210">1210</span> +<span id="1211">1211</span> +<span id="1212">1212</span> +<span id="1213">1213</span> +<span id="1214">1214</span> +<span id="1215">1215</span> +<span id="1216">1216</span> +<span id="1217">1217</span> +<span id="1218">1218</span> +<span id="1219">1219</span> +<span id="1220">1220</span> +<span id="1221">1221</span> +<span id="1222">1222</span> +<span id="1223">1223</span> +<span id="1224">1224</span> +<span id="1225">1225</span> +<span id="1226">1226</span> +<span id="1227">1227</span> +<span id="1228">1228</span> +<span id="1229">1229</span> +<span id="1230">1230</span> +<span id="1231">1231</span> +<span id="1232">1232</span> +<span id="1233">1233</span> +<span id="1234">1234</span> +<span id="1235">1235</span> +<span id="1236">1236</span> +<span id="1237">1237</span> +<span id="1238">1238</span> +<span id="1239">1239</span> +<span id="1240">1240</span> +<span id="1241">1241</span> +<span id="1242">1242</span> +<span id="1243">1243</span> +<span id="1244">1244</span> +<span id="1245">1245</span> +<span id="1246">1246</span> +<span id="1247">1247</span> +<span id="1248">1248</span> +<span id="1249">1249</span> +<span id="1250">1250</span> +<span id="1251">1251</span> +<span id="1252">1252</span> +<span id="1253">1253</span> +<span id="1254">1254</span> +<span id="1255">1255</span> +<span id="1256">1256</span> +<span id="1257">1257</span> +<span id="1258">1258</span> +<span id="1259">1259</span> +<span id="1260">1260</span> +<span id="1261">1261</span> +<span id="1262">1262</span> +<span id="1263">1263</span> +<span id="1264">1264</span> +<span id="1265">1265</span> +<span id="1266">1266</span> +<span id="1267">1267</span> +<span id="1268">1268</span> +<span id="1269">1269</span> +<span id="1270">1270</span> +<span id="1271">1271</span> +<span id="1272">1272</span> +<span id="1273">1273</span> +<span id="1274">1274</span> +<span id="1275">1275</span> +<span id="1276">1276</span> +<span id="1277">1277</span> +<span id="1278">1278</span> +<span id="1279">1279</span> +<span id="1280">1280</span> +<span id="1281">1281</span> +<span id="1282">1282</span> +<span id="1283">1283</span> +<span id="1284">1284</span> +<span id="1285">1285</span> +<span id="1286">1286</span> +<span id="1287">1287</span> +<span id="1288">1288</span> +<span id="1289">1289</span> +<span id="1290">1290</span> +<span id="1291">1291</span> +<span id="1292">1292</span> +<span id="1293">1293</span> +<span id="1294">1294</span> +<span id="1295">1295</span> +<span id="1296">1296</span> +<span id="1297">1297</span> +<span id="1298">1298</span> +<span id="1299">1299</span> +<span id="1300">1300</span> +<span id="1301">1301</span> +<span id="1302">1302</span> +<span id="1303">1303</span> +<span id="1304">1304</span> +<span id="1305">1305</span> +<span id="1306">1306</span> +<span id="1307">1307</span> +<span id="1308">1308</span> +<span id="1309">1309</span> +<span id="1310">1310</span> +<span id="1311">1311</span> +<span id="1312">1312</span> +<span id="1313">1313</span> +<span id="1314">1314</span> +<span id="1315">1315</span> +<span id="1316">1316</span> +<span id="1317">1317</span> +<span id="1318">1318</span> +<span id="1319">1319</span> +<span id="1320">1320</span> +<span id="1321">1321</span> +<span id="1322">1322</span> +<span id="1323">1323</span> +<span id="1324">1324</span> +<span id="1325">1325</span> +<span id="1326">1326</span> +<span id="1327">1327</span> +<span id="1328">1328</span> +<span id="1329">1329</span> +<span id="1330">1330</span> +<span id="1331">1331</span> +<span id="1332">1332</span> +<span id="1333">1333</span> +<span id="1334">1334</span> +<span id="1335">1335</span> +<span id="1336">1336</span> +<span id="1337">1337</span> +<span id="1338">1338</span> +<span id="1339">1339</span> +<span id="1340">1340</span> +<span id="1341">1341</span> +<span id="1342">1342</span> +<span id="1343">1343</span> +<span id="1344">1344</span> +<span id="1345">1345</span> +<span id="1346">1346</span> +<span id="1347">1347</span> +<span id="1348">1348</span> +<span id="1349">1349</span> +<span id="1350">1350</span> +<span id="1351">1351</span> +<span id="1352">1352</span> +<span id="1353">1353</span> +<span id="1354">1354</span> +<span id="1355">1355</span> +<span id="1356">1356</span> +<span id="1357">1357</span> +<span id="1358">1358</span> +<span id="1359">1359</span> +<span id="1360">1360</span> +<span id="1361">1361</span> +<span id="1362">1362</span> +<span id="1363">1363</span> +<span id="1364">1364</span> +<span id="1365">1365</span> +<span id="1366">1366</span> +<span id="1367">1367</span> +<span id="1368">1368</span> +<span id="1369">1369</span> +<span id="1370">1370</span> +<span id="1371">1371</span> +<span id="1372">1372</span> +<span id="1373">1373</span> +<span id="1374">1374</span> +<span id="1375">1375</span> +<span id="1376">1376</span> +<span id="1377">1377</span> +<span id="1378">1378</span> +<span id="1379">1379</span> +<span id="1380">1380</span> +<span id="1381">1381</span> +<span id="1382">1382</span> +<span id="1383">1383</span> +<span id="1384">1384</span> +<span id="1385">1385</span> +<span id="1386">1386</span> +<span id="1387">1387</span> +<span id="1388">1388</span> +<span id="1389">1389</span> +<span id="1390">1390</span> +<span id="1391">1391</span> +<span id="1392">1392</span> +<span id="1393">1393</span> +<span id="1394">1394</span> +<span id="1395">1395</span> +<span id="1396">1396</span> +<span id="1397">1397</span> +<span id="1398">1398</span> +<span id="1399">1399</span> +<span id="1400">1400</span> +<span id="1401">1401</span> +<span id="1402">1402</span> +<span id="1403">1403</span> +<span id="1404">1404</span> +<span id="1405">1405</span> +<span id="1406">1406</span> +<span id="1407">1407</span> +<span id="1408">1408</span> +<span id="1409">1409</span> +<span id="1410">1410</span> +<span id="1411">1411</span> +<span id="1412">1412</span> +<span id="1413">1413</span> +<span id="1414">1414</span> +<span id="1415">1415</span> +<span id="1416">1416</span> +<span id="1417">1417</span> +<span id="1418">1418</span> +<span id="1419">1419</span> +<span id="1420">1420</span> +<span id="1421">1421</span> +<span id="1422">1422</span> +<span id="1423">1423</span> +<span id="1424">1424</span> +<span id="1425">1425</span> +<span id="1426">1426</span> +<span id="1427">1427</span> +<span id="1428">1428</span> +<span id="1429">1429</span> +<span id="1430">1430</span> +<span id="1431">1431</span> +<span id="1432">1432</span> +<span id="1433">1433</span> +<span id="1434">1434</span> +<span id="1435">1435</span> +<span id="1436">1436</span> +<span id="1437">1437</span> +<span id="1438">1438</span> +<span id="1439">1439</span> +<span id="1440">1440</span> +<span id="1441">1441</span> +<span id="1442">1442</span> +<span id="1443">1443</span> +<span id="1444">1444</span> +<span id="1445">1445</span> +<span id="1446">1446</span> +<span id="1447">1447</span> +<span id="1448">1448</span> +<span id="1449">1449</span> +<span id="1450">1450</span> +<span id="1451">1451</span> +<span id="1452">1452</span> +<span id="1453">1453</span> +<span id="1454">1454</span> +<span id="1455">1455</span> +<span id="1456">1456</span> +<span id="1457">1457</span> +<span id="1458">1458</span> +<span id="1459">1459</span> +<span id="1460">1460</span> +<span id="1461">1461</span> +<span id="1462">1462</span> +<span id="1463">1463</span> +<span id="1464">1464</span> +<span id="1465">1465</span> +<span id="1466">1466</span> +<span id="1467">1467</span> +<span id="1468">1468</span> +<span id="1469">1469</span> +<span id="1470">1470</span> +<span id="1471">1471</span> +<span id="1472">1472</span> +<span id="1473">1473</span> +<span id="1474">1474</span> +<span id="1475">1475</span> +<span id="1476">1476</span> +<span id="1477">1477</span> +<span id="1478">1478</span> +<span id="1479">1479</span> +<span id="1480">1480</span> +<span id="1481">1481</span> +<span id="1482">1482</span> +<span id="1483">1483</span> +<span id="1484">1484</span> +<span id="1485">1485</span> +<span id="1486">1486</span> +<span id="1487">1487</span> +<span id="1488">1488</span> +<span id="1489">1489</span> +<span id="1490">1490</span> +<span id="1491">1491</span> +<span id="1492">1492</span> +<span id="1493">1493</span> +<span id="1494">1494</span> +<span id="1495">1495</span> +<span id="1496">1496</span> +<span id="1497">1497</span> +<span id="1498">1498</span> +<span id="1499">1499</span> +<span id="1500">1500</span> +<span id="1501">1501</span> +<span id="1502">1502</span> +<span id="1503">1503</span> +<span id="1504">1504</span> +<span id="1505">1505</span> +<span id="1506">1506</span> +<span id="1507">1507</span> +<span id="1508">1508</span> +<span id="1509">1509</span> +<span id="1510">1510</span> +<span id="1511">1511</span> +<span id="1512">1512</span> +<span id="1513">1513</span> +<span id="1514">1514</span> +<span id="1515">1515</span> +<span id="1516">1516</span> +<span id="1517">1517</span> +<span id="1518">1518</span> +<span id="1519">1519</span> +<span id="1520">1520</span> +<span id="1521">1521</span> +<span id="1522">1522</span> +<span id="1523">1523</span> +<span id="1524">1524</span> +<span id="1525">1525</span> +<span id="1526">1526</span> +<span id="1527">1527</span> +<span id="1528">1528</span> +<span id="1529">1529</span> +<span id="1530">1530</span> +<span id="1531">1531</span> +<span id="1532">1532</span> +<span id="1533">1533</span> +<span id="1534">1534</span> +<span id="1535">1535</span> +<span id="1536">1536</span> +<span id="1537">1537</span> +<span id="1538">1538</span> +<span id="1539">1539</span> +<span id="1540">1540</span> +<span id="1541">1541</span> +<span id="1542">1542</span> +<span id="1543">1543</span> +<span id="1544">1544</span> +<span id="1545">1545</span> +<span id="1546">1546</span> +<span id="1547">1547</span> +<span id="1548">1548</span> +<span id="1549">1549</span> +<span id="1550">1550</span> +<span id="1551">1551</span> +<span id="1552">1552</span> +<span id="1553">1553</span> +<span id="1554">1554</span> +<span id="1555">1555</span> +<span id="1556">1556</span> +<span id="1557">1557</span> +<span id="1558">1558</span> +<span id="1559">1559</span> +<span id="1560">1560</span> +<span id="1561">1561</span> +<span id="1562">1562</span> +<span id="1563">1563</span> +<span id="1564">1564</span> +<span id="1565">1565</span> +<span id="1566">1566</span> +<span id="1567">1567</span> +<span id="1568">1568</span> +<span id="1569">1569</span> +<span id="1570">1570</span> +<span id="1571">1571</span> +<span id="1572">1572</span> +<span id="1573">1573</span> +<span id="1574">1574</span> +<span id="1575">1575</span> +<span id="1576">1576</span> +<span id="1577">1577</span> +<span id="1578">1578</span> +<span id="1579">1579</span> +<span id="1580">1580</span> +<span id="1581">1581</span> +<span id="1582">1582</span> +<span id="1583">1583</span> +<span id="1584">1584</span> +<span id="1585">1585</span> +<span id="1586">1586</span> +<span id="1587">1587</span> +<span id="1588">1588</span> +<span id="1589">1589</span> +<span id="1590">1590</span> +<span id="1591">1591</span> +<span id="1592">1592</span> +<span id="1593">1593</span> +<span id="1594">1594</span> +<span id="1595">1595</span> +<span id="1596">1596</span> +<span id="1597">1597</span> +<span id="1598">1598</span> +<span id="1599">1599</span> +<span id="1600">1600</span> +<span id="1601">1601</span> +<span id="1602">1602</span> +<span id="1603">1603</span> +<span id="1604">1604</span> +<span id="1605">1605</span> +<span id="1606">1606</span> +<span id="1607">1607</span> +<span id="1608">1608</span> +<span id="1609">1609</span> +<span id="1610">1610</span> +<span id="1611">1611</span> +<span id="1612">1612</span> +<span id="1613">1613</span> +<span id="1614">1614</span> +<span id="1615">1615</span> +<span id="1616">1616</span> +<span id="1617">1617</span> +<span id="1618">1618</span> +<span id="1619">1619</span> +<span id="1620">1620</span> +<span id="1621">1621</span> +<span id="1622">1622</span> +<span id="1623">1623</span> +<span id="1624">1624</span> +<span id="1625">1625</span> +<span id="1626">1626</span> +<span id="1627">1627</span> +<span id="1628">1628</span> +<span id="1629">1629</span> +<span id="1630">1630</span> +<span id="1631">1631</span> +<span id="1632">1632</span> +<span id="1633">1633</span> +<span id="1634">1634</span> +<span id="1635">1635</span> +<span id="1636">1636</span> +<span id="1637">1637</span> +<span id="1638">1638</span> +<span id="1639">1639</span> +<span id="1640">1640</span> +<span id="1641">1641</span> +</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::buf::{limit, Chain, Limit, UninitSlice}; +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">use </span><span class="kw">crate</span>::buf::{writer, Writer}; +<span class="kw">use crate</span>::{panic_advance, panic_does_not_fit}; + +<span class="kw">use </span>core::{mem, ptr, usize}; + +<span class="kw">use </span>alloc::{boxed::Box, vec::Vec}; + +<span class="doccomment">/// A trait for values that provide sequential write access to bytes. +/// +/// Write bytes to a buffer +/// +/// A buffer stores bytes in memory such that write operations are infallible. +/// The underlying storage may or may not be in contiguous memory. A `BufMut` +/// value is a cursor into the buffer. Writing to `BufMut` advances the cursor +/// position. +/// +/// The simplest `BufMut` is a `Vec<u8>`. +/// +/// ``` +/// use bytes::BufMut; +/// +/// let mut buf = vec![]; +/// +/// buf.put(&b"hello world"[..]); +/// +/// assert_eq!(buf, b"hello world"); +/// ``` +</span><span class="kw">pub unsafe trait </span>BufMut { + <span class="doccomment">/// Returns the number of bytes that can be written from the current + /// position until the end of the buffer is reached. + /// + /// This value is greater than or equal to the length of the slice returned + /// by `chunk_mut()`. + /// + /// Writing to a `BufMut` may involve allocating more memory on the fly. + /// Implementations may fail before reaching the number of bytes indicated + /// by this method if they encounter an allocation failure. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut dst = [0; 10]; + /// let mut buf = &mut dst[..]; + /// + /// let original_remaining = buf.remaining_mut(); + /// buf.put(&b"hello"[..]); + /// + /// assert_eq!(original_remaining - 5, buf.remaining_mut()); + /// ``` + /// + /// # Implementer notes + /// + /// Implementations of `remaining_mut` should ensure that the return value + /// does not change unless a call is made to `advance_mut` or any other + /// function that is documented to change the `BufMut`'s current position. + /// + /// # Note + /// + /// `remaining_mut` may return value smaller than actual available space. + </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize; + + <span class="doccomment">/// Advance the internal cursor of the BufMut + /// + /// The next call to `chunk_mut` will return a slice starting `cnt` bytes + /// further into the underlying buffer. + /// + /// # Safety + /// + /// The caller must ensure that the next `cnt` bytes of `chunk` are + /// initialized. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = Vec::with_capacity(16); + /// + /// // Write some data + /// buf.chunk_mut()[0..2].copy_from_slice(b"he"); + /// unsafe { buf.advance_mut(2) }; + /// + /// // write more bytes + /// buf.chunk_mut()[0..3].copy_from_slice(b"llo"); + /// + /// unsafe { buf.advance_mut(3); } + /// + /// assert_eq!(5, buf.len()); + /// assert_eq!(buf, b"hello"); + /// ``` + /// + /// # Panics + /// + /// This function **may** panic if `cnt > self.remaining_mut()`. + /// + /// # Implementer notes + /// + /// It is recommended for implementations of `advance_mut` to panic if + /// `cnt > self.remaining_mut()`. If the implementation does not panic, + /// the call must behave as if `cnt == self.remaining_mut()`. + /// + /// A call with `cnt == 0` should never panic and be a no-op. + </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize); + + <span class="doccomment">/// Returns true if there is space in `self` for more bytes. + /// + /// This is equivalent to `self.remaining_mut() != 0`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut dst = [0; 5]; + /// let mut buf = &mut dst[..]; + /// + /// assert!(buf.has_remaining_mut()); + /// + /// buf.put(&b"hello"[..]); + /// + /// assert!(!buf.has_remaining_mut()); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>has_remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + <span class="self">self</span>.remaining_mut() > <span class="number">0 + </span>} + + <span class="doccomment">/// Returns a mutable slice starting at the current BufMut position and of + /// length between 0 and `BufMut::remaining_mut()`. Note that this *can* be shorter than the + /// whole remainder of the buffer (this allows non-continuous implementation). + /// + /// This is a lower level function. Most operations are done with other + /// functions. + /// + /// The returned byte slice may represent uninitialized memory. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = Vec::with_capacity(16); + /// + /// unsafe { + /// // MaybeUninit::as_mut_ptr + /// buf.chunk_mut()[0..].as_mut_ptr().write(b'h'); + /// buf.chunk_mut()[1..].as_mut_ptr().write(b'e'); + /// + /// buf.advance_mut(2); + /// + /// buf.chunk_mut()[0..].as_mut_ptr().write(b'l'); + /// buf.chunk_mut()[1..].as_mut_ptr().write(b'l'); + /// buf.chunk_mut()[2..].as_mut_ptr().write(b'o'); + /// + /// buf.advance_mut(3); + /// } + /// + /// assert_eq!(5, buf.len()); + /// assert_eq!(buf, b"hello"); + /// ``` + /// + /// # Implementer notes + /// + /// This function should never panic. `chunk_mut` should return an empty + /// slice **if and only if** `remaining_mut()` returns 0. In other words, + /// `chunk_mut()` returning an empty slice implies that `remaining_mut()` will + /// return 0 and `remaining_mut()` returning 0 implies that `chunk_mut()` will + /// return an empty slice. + /// + /// This function may trigger an out-of-memory abort if it tries to allocate + /// memory and fails to do so. + </span><span class="comment">// The `chunk_mut` method was previously called `bytes_mut`. This alias makes the + // rename more easily discoverable. + </span><span class="attr">#[cfg_attr(docsrs, doc(alias = <span class="string">"bytes_mut"</span>))] + </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice; + + <span class="doccomment">/// Transfer bytes into `self` from `src` and advance the cursor by the + /// number of bytes written. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// + /// buf.put_u8(b'h'); + /// buf.put(&b"ello"[..]); + /// buf.put(&b" world"[..]); + /// + /// assert_eq!(buf, b"hello world"); + /// ``` + /// + /// # Panics + /// + /// Panics if `self` does not have enough capacity to contain `src`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put<T: <span class="kw">super</span>::Buf>(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>src: T) + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + <span class="kw">if </span><span class="self">self</span>.remaining_mut() < src.remaining() { + panic_advance(src.remaining(), <span class="self">self</span>.remaining_mut()); + } + + <span class="kw">while </span>src.has_remaining() { + <span class="kw">let </span>s = src.chunk(); + <span class="kw">let </span>d = <span class="self">self</span>.chunk_mut(); + <span class="kw">let </span>cnt = usize::min(s.len(), d.len()); + + d[..cnt].copy_from_slice(<span class="kw-2">&</span>s[..cnt]); + + <span class="comment">// SAFETY: We just initialized `cnt` bytes in `self`. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.advance_mut(cnt) }; + src.advance(cnt); + } + } + + <span class="doccomment">/// Transfer bytes into `self` from `src` and advance the cursor by the + /// number of bytes written. + /// + /// `self` must have enough remaining capacity to contain all of `src`. + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut dst = [0; 6]; + /// + /// { + /// let mut buf = &mut dst[..]; + /// buf.put_slice(b"hello"); + /// + /// assert_eq!(1, buf.remaining_mut()); + /// } + /// + /// assert_eq!(b"hello\0", &dst); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_slice(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>src: <span class="kw-2">&</span>[u8]) { + <span class="kw">if </span><span class="self">self</span>.remaining_mut() < src.len() { + panic_advance(src.len(), <span class="self">self</span>.remaining_mut()); + } + + <span class="kw">while </span>!src.is_empty() { + <span class="kw">let </span>dst = <span class="self">self</span>.chunk_mut(); + <span class="kw">let </span>cnt = usize::min(src.len(), dst.len()); + + dst[..cnt].copy_from_slice(<span class="kw-2">&</span>src[..cnt]); + src = <span class="kw-2">&</span>src[cnt..]; + + <span class="comment">// SAFETY: We just initialized `cnt` bytes in `self`. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.advance_mut(cnt) }; + } + } + + <span class="doccomment">/// Put `cnt` bytes `val` into `self`. + /// + /// Logically equivalent to calling `self.put_u8(val)` `cnt` times, but may work faster. + /// + /// `self` must have at least `cnt` remaining capacity. + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut dst = [0; 6]; + /// + /// { + /// let mut buf = &mut dst[..]; + /// buf.put_bytes(b'a', 4); + /// + /// assert_eq!(2, buf.remaining_mut()); + /// } + /// + /// assert_eq!(b"aaaa\0\0", &dst); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, val: u8, <span class="kw-2">mut </span>cnt: usize) { + <span class="kw">if </span><span class="self">self</span>.remaining_mut() < cnt { + panic_advance(cnt, <span class="self">self</span>.remaining_mut()); + } + + <span class="kw">while </span>cnt > <span class="number">0 </span>{ + <span class="kw">let </span>dst = <span class="self">self</span>.chunk_mut(); + <span class="kw">let </span>dst_len = usize::min(dst.len(), cnt); + <span class="comment">// SAFETY: The pointer is valid for `dst_len <= dst.len()` bytes. + </span><span class="kw">unsafe </span>{ core::ptr::write_bytes(dst.as_mut_ptr(), val, dst_len) }; + <span class="comment">// SAFETY: We just initialized `dst_len` bytes in `self`. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.advance_mut(dst_len) }; + cnt -= dst_len; + } + } + + <span class="doccomment">/// Writes an unsigned 8 bit integer to `self`. + /// + /// The current position is advanced by 1. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u8(0x01); + /// assert_eq!(buf, b"\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u8(<span class="kw-2">&mut </span><span class="self">self</span>, n: u8) { + <span class="kw">let </span>src = [n]; + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>src); + } + + <span class="doccomment">/// Writes a signed 8 bit integer to `self`. + /// + /// The current position is advanced by 1. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i8(0x01); + /// assert_eq!(buf, b"\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i8(<span class="kw-2">&mut </span><span class="self">self</span>, n: i8) { + <span class="kw">let </span>src = [n <span class="kw">as </span>u8]; + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>src) + } + + <span class="doccomment">/// Writes an unsigned 16 bit integer to `self` in big-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u16(0x0809); + /// assert_eq!(buf, b"\x08\x09"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u16(<span class="kw-2">&mut </span><span class="self">self</span>, n: u16) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 16 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u16_le(0x0809); + /// assert_eq!(buf, b"\x09\x08"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u16_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u16) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 16 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u16_ne(0x0809); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x08\x09"); + /// } else { + /// assert_eq!(buf, b"\x09\x08"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u16_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u16) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes a signed 16 bit integer to `self` in big-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i16(0x0809); + /// assert_eq!(buf, b"\x08\x09"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i16(<span class="kw-2">&mut </span><span class="self">self</span>, n: i16) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes a signed 16 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i16_le(0x0809); + /// assert_eq!(buf, b"\x09\x08"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i16_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i16) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes a signed 16 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 2. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i16_ne(0x0809); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x08\x09"); + /// } else { + /// assert_eq!(buf, b"\x09\x08"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i16_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i16) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 32 bit integer to `self` in big-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u32(0x0809A0A1); + /// assert_eq!(buf, b"\x08\x09\xA0\xA1"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u32(<span class="kw-2">&mut </span><span class="self">self</span>, n: u32) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 32 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u32_le(0x0809A0A1); + /// assert_eq!(buf, b"\xA1\xA0\x09\x08"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u32_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u32) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 32 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u32_ne(0x0809A0A1); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x08\x09\xA0\xA1"); + /// } else { + /// assert_eq!(buf, b"\xA1\xA0\x09\x08"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u32_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u32) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes a signed 32 bit integer to `self` in big-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i32(0x0809A0A1); + /// assert_eq!(buf, b"\x08\x09\xA0\xA1"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i32(<span class="kw-2">&mut </span><span class="self">self</span>, n: i32) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes a signed 32 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i32_le(0x0809A0A1); + /// assert_eq!(buf, b"\xA1\xA0\x09\x08"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i32_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i32) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes a signed 32 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i32_ne(0x0809A0A1); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x08\x09\xA0\xA1"); + /// } else { + /// assert_eq!(buf, b"\xA1\xA0\x09\x08"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i32_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i32) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 64 bit integer to `self` in the big-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u64(0x0102030405060708); + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u64(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 64 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u64_le(0x0102030405060708); + /// assert_eq!(buf, b"\x08\x07\x06\x05\x04\x03\x02\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u64_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 64 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u64_ne(0x0102030405060708); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08"); + /// } else { + /// assert_eq!(buf, b"\x08\x07\x06\x05\x04\x03\x02\x01"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u64_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes a signed 64 bit integer to `self` in the big-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i64(0x0102030405060708); + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i64(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes a signed 64 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i64_le(0x0102030405060708); + /// assert_eq!(buf, b"\x08\x07\x06\x05\x04\x03\x02\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i64_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes a signed 64 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i64_ne(0x0102030405060708); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08"); + /// } else { + /// assert_eq!(buf, b"\x08\x07\x06\x05\x04\x03\x02\x01"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i64_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 128 bit integer to `self` in the big-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u128(0x01020304050607080910111213141516); + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u128(<span class="kw-2">&mut </span><span class="self">self</span>, n: u128) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 128 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u128_le(0x01020304050607080910111213141516); + /// assert_eq!(buf, b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u128_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u128) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes an unsigned 128 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_u128_ne(0x01020304050607080910111213141516); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16"); + /// } else { + /// assert_eq!(buf, b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_u128_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u128) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes a signed 128 bit integer to `self` in the big-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i128(0x01020304050607080910111213141516); + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i128(<span class="kw-2">&mut </span><span class="self">self</span>, n: i128) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()) + } + + <span class="doccomment">/// Writes a signed 128 bit integer to `self` in little-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i128_le(0x01020304050607080910111213141516); + /// assert_eq!(buf, b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i128_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i128) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_le_bytes()) + } + + <span class="doccomment">/// Writes a signed 128 bit integer to `self` in native-endian byte order. + /// + /// The current position is advanced by 16. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_i128_ne(0x01020304050607080910111213141516); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x01\x02\x03\x04\x05\x06\x07\x08\x09\x10\x11\x12\x13\x14\x15\x16"); + /// } else { + /// assert_eq!(buf, b"\x16\x15\x14\x13\x12\x11\x10\x09\x08\x07\x06\x05\x04\x03\x02\x01"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_i128_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i128) { + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_ne_bytes()) + } + + <span class="doccomment">/// Writes an unsigned n-byte integer to `self` in big-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_uint(0x010203, 3); + /// assert_eq!(buf, b"\x01\x02\x03"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self` or if `nbytes` is greater than 8. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_uint(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64, nbytes: usize) { + <span class="kw">let </span>start = <span class="kw">match </span>mem::size_of_val(<span class="kw-2">&</span>n).checked_sub(nbytes) { + <span class="prelude-val">Some</span>(start) => start, + <span class="prelude-val">None </span>=> panic_does_not_fit(nbytes, mem::size_of_val(<span class="kw-2">&</span>n)), + }; + + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()[start..]); + } + + <span class="doccomment">/// Writes an unsigned n-byte integer to `self` in the little-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_uint_le(0x010203, 3); + /// assert_eq!(buf, b"\x03\x02\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self` or if `nbytes` is greater than 8. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_uint_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64, nbytes: usize) { + <span class="kw">let </span>slice = n.to_le_bytes(); + <span class="kw">let </span>slice = <span class="kw">match </span>slice.get(..nbytes) { + <span class="prelude-val">Some</span>(slice) => slice, + <span class="prelude-val">None </span>=> panic_does_not_fit(nbytes, slice.len()), + }; + + <span class="self">self</span>.put_slice(slice); + } + + <span class="doccomment">/// Writes an unsigned n-byte integer to `self` in the native-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_uint_ne(0x010203, 3); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x01\x02\x03"); + /// } else { + /// assert_eq!(buf, b"\x03\x02\x01"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self` or if `nbytes` is greater than 8. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_uint_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64, nbytes: usize) { + <span class="kw">if </span><span class="macro">cfg!</span>(target_endian = <span class="string">"big"</span>) { + <span class="self">self</span>.put_uint(n, nbytes) + } <span class="kw">else </span>{ + <span class="self">self</span>.put_uint_le(n, nbytes) + } + } + + <span class="doccomment">/// Writes low `nbytes` of a signed integer to `self` in big-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_int(0x0504010203, 3); + /// assert_eq!(buf, b"\x01\x02\x03"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self` or if `nbytes` is greater than 8. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_int(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64, nbytes: usize) { + <span class="kw">let </span>start = <span class="kw">match </span>mem::size_of_val(<span class="kw-2">&</span>n).checked_sub(nbytes) { + <span class="prelude-val">Some</span>(start) => start, + <span class="prelude-val">None </span>=> panic_does_not_fit(nbytes, mem::size_of_val(<span class="kw-2">&</span>n)), + }; + + <span class="self">self</span>.put_slice(<span class="kw-2">&</span>n.to_be_bytes()[start..]); + } + + <span class="doccomment">/// Writes low `nbytes` of a signed integer to `self` in little-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_int_le(0x0504010203, 3); + /// assert_eq!(buf, b"\x03\x02\x01"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self` or if `nbytes` is greater than 8. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_int_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64, nbytes: usize) { + <span class="kw">let </span>slice = n.to_le_bytes(); + <span class="kw">let </span>slice = <span class="kw">match </span>slice.get(..nbytes) { + <span class="prelude-val">Some</span>(slice) => slice, + <span class="prelude-val">None </span>=> panic_does_not_fit(nbytes, slice.len()), + }; + + <span class="self">self</span>.put_slice(slice); + } + + <span class="doccomment">/// Writes low `nbytes` of a signed integer to `self` in native-endian byte order. + /// + /// The current position is advanced by `nbytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_int_ne(0x010203, 3); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x01\x02\x03"); + /// } else { + /// assert_eq!(buf, b"\x03\x02\x01"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self` or if `nbytes` is greater than 8. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_int_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64, nbytes: usize) { + <span class="kw">if </span><span class="macro">cfg!</span>(target_endian = <span class="string">"big"</span>) { + <span class="self">self</span>.put_int(n, nbytes) + } <span class="kw">else </span>{ + <span class="self">self</span>.put_int_le(n, nbytes) + } + } + + <span class="doccomment">/// Writes an IEEE754 single-precision (4 bytes) floating point number to + /// `self` in big-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_f32(1.2f32); + /// assert_eq!(buf, b"\x3F\x99\x99\x9A"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_f32(<span class="kw-2">&mut </span><span class="self">self</span>, n: f32) { + <span class="self">self</span>.put_u32(n.to_bits()); + } + + <span class="doccomment">/// Writes an IEEE754 single-precision (4 bytes) floating point number to + /// `self` in little-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_f32_le(1.2f32); + /// assert_eq!(buf, b"\x9A\x99\x99\x3F"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_f32_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: f32) { + <span class="self">self</span>.put_u32_le(n.to_bits()); + } + + <span class="doccomment">/// Writes an IEEE754 single-precision (4 bytes) floating point number to + /// `self` in native-endian byte order. + /// + /// The current position is advanced by 4. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_f32_ne(1.2f32); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x3F\x99\x99\x9A"); + /// } else { + /// assert_eq!(buf, b"\x9A\x99\x99\x3F"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_f32_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: f32) { + <span class="self">self</span>.put_u32_ne(n.to_bits()); + } + + <span class="doccomment">/// Writes an IEEE754 double-precision (8 bytes) floating point number to + /// `self` in big-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_f64(1.2f64); + /// assert_eq!(buf, b"\x3F\xF3\x33\x33\x33\x33\x33\x33"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_f64(<span class="kw-2">&mut </span><span class="self">self</span>, n: f64) { + <span class="self">self</span>.put_u64(n.to_bits()); + } + + <span class="doccomment">/// Writes an IEEE754 double-precision (8 bytes) floating point number to + /// `self` in little-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_f64_le(1.2f64); + /// assert_eq!(buf, b"\x33\x33\x33\x33\x33\x33\xF3\x3F"); + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_f64_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: f64) { + <span class="self">self</span>.put_u64_le(n.to_bits()); + } + + <span class="doccomment">/// Writes an IEEE754 double-precision (8 bytes) floating point number to + /// `self` in native-endian byte order. + /// + /// The current position is advanced by 8. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut buf = vec![]; + /// buf.put_f64_ne(1.2f64); + /// if cfg!(target_endian = "big") { + /// assert_eq!(buf, b"\x3F\xF3\x33\x33\x33\x33\x33\x33"); + /// } else { + /// assert_eq!(buf, b"\x33\x33\x33\x33\x33\x33\xF3\x3F"); + /// } + /// ``` + /// + /// # Panics + /// + /// This function panics if there is not enough remaining capacity in + /// `self`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put_f64_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: f64) { + <span class="self">self</span>.put_u64_ne(n.to_bits()); + } + + <span class="doccomment">/// Creates an adaptor which can write at most `limit` bytes to `self`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let arr = &mut [0u8; 128][..]; + /// assert_eq!(arr.remaining_mut(), 128); + /// + /// let dst = arr.limit(10); + /// assert_eq!(dst.remaining_mut(), 10); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>limit(<span class="self">self</span>, limit: usize) -> Limit<<span class="self">Self</span>> + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + limit::new(<span class="self">self</span>, limit) + } + + <span class="doccomment">/// Creates an adaptor which implements the `Write` trait for `self`. + /// + /// This function returns a new value which implements `Write` by adapting + /// the `Write` trait functions to the `BufMut` trait functions. Given that + /// `BufMut` operations are infallible, none of the `Write` functions will + /// return with `Err`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// use std::io::Write; + /// + /// let mut buf = vec![].writer(); + /// + /// let num = buf.write(&b"hello world"[..]).unwrap(); + /// assert_eq!(11, num); + /// + /// let buf = buf.into_inner(); + /// + /// assert_eq!(*buf, b"hello world"[..]); + /// ``` + </span><span class="attr">#[cfg(feature = <span class="string">"std"</span>)] + #[cfg_attr(docsrs, doc(cfg(feature = <span class="string">"std"</span>)))] + #[inline] + </span><span class="kw">fn </span>writer(<span class="self">self</span>) -> Writer<<span class="self">Self</span>> + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + writer::new(<span class="self">self</span>) + } + + <span class="doccomment">/// Creates an adapter which will chain this buffer with another. + /// + /// The returned `BufMut` instance will first write to all bytes from + /// `self`. Afterwards, it will write to `next`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut a = [0u8; 5]; + /// let mut b = [0u8; 6]; + /// + /// let mut chain = (&mut a[..]).chain_mut(&mut b[..]); + /// + /// chain.put_slice(b"hello world"); + /// + /// assert_eq!(&a[..], b"hello"); + /// assert_eq!(&b[..], b" world"); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>chain_mut<U: BufMut>(<span class="self">self</span>, next: U) -> Chain<<span class="self">Self</span>, U> + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + Chain::new(<span class="self">self</span>, next) + } +} + +<span class="macro">macro_rules! </span>deref_forward_bufmut { + () => { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + (<span class="kw-2">**</span><span class="self">self</span>).remaining_mut() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + (<span class="kw-2">**</span><span class="self">self</span>).chunk_mut() + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + (<span class="kw-2">**</span><span class="self">self</span>).advance_mut(cnt) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_slice(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) { + (<span class="kw-2">**</span><span class="self">self</span>).put_slice(src) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u8(<span class="kw-2">&mut </span><span class="self">self</span>, n: u8) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u8(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i8(<span class="kw-2">&mut </span><span class="self">self</span>, n: i8) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i8(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u16(<span class="kw-2">&mut </span><span class="self">self</span>, n: u16) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u16(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u16_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u16) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u16_le(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u16_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u16) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u16_ne(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i16(<span class="kw-2">&mut </span><span class="self">self</span>, n: i16) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i16(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i16_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i16) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i16_le(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i16_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i16) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i16_ne(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u32(<span class="kw-2">&mut </span><span class="self">self</span>, n: u32) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u32(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u32_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u32) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u32_le(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u32_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u32) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u32_ne(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i32(<span class="kw-2">&mut </span><span class="self">self</span>, n: i32) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i32(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i32_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i32) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i32_le(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i32_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i32) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i32_ne(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u64(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u64(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u64_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u64_le(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_u64_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: u64) { + (<span class="kw-2">**</span><span class="self">self</span>).put_u64_ne(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i64(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i64(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i64_le(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i64_le(n) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_i64_ne(<span class="kw-2">&mut </span><span class="self">self</span>, n: i64) { + (<span class="kw-2">**</span><span class="self">self</span>).put_i64_ne(n) + } + }; +} + +<span class="kw">unsafe impl</span><T: BufMut + <span class="question-mark">?</span>Sized> BufMut <span class="kw">for </span><span class="kw-2">&mut </span>T { + <span class="macro">deref_forward_bufmut!</span>(); +} + +<span class="kw">unsafe impl</span><T: BufMut + <span class="question-mark">?</span>Sized> BufMut <span class="kw">for </span>Box<T> { + <span class="macro">deref_forward_bufmut!</span>(); +} + +<span class="kw">unsafe impl </span>BufMut <span class="kw">for </span><span class="kw-2">&mut </span>[u8] { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + UninitSlice::new(<span class="self">self</span>) + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="kw">if </span><span class="self">self</span>.len() < cnt { + panic_advance(cnt, <span class="self">self</span>.len()); + } + + <span class="comment">// Lifetime dance taken from `impl Write for &mut [u8]`. + </span><span class="kw">let </span>(<span class="kw">_</span>, b) = core::mem::replace(<span class="self">self</span>, <span class="kw-2">&mut </span>[]).split_at_mut(cnt); + <span class="kw-2">*</span><span class="self">self </span>= b; + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_slice(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) { + <span class="kw">if </span><span class="self">self</span>.len() < src.len() { + panic_advance(src.len(), <span class="self">self</span>.len()); + } + + <span class="self">self</span>[..src.len()].copy_from_slice(src); + <span class="comment">// SAFETY: We just initialized `src.len()` bytes. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.advance_mut(src.len()) }; + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, val: u8, cnt: usize) { + <span class="kw">if </span><span class="self">self</span>.len() < cnt { + panic_advance(cnt, <span class="self">self</span>.len()); + } + + <span class="comment">// SAFETY: We just checked that the pointer is valid for `cnt` bytes. + </span><span class="kw">unsafe </span>{ + ptr::write_bytes(<span class="self">self</span>.as_mut_ptr(), val, cnt); + <span class="self">self</span>.advance_mut(cnt); + } + } +} + +<span class="kw">unsafe impl </span>BufMut <span class="kw">for </span><span class="kw-2">&mut </span>[core::mem::MaybeUninit<u8>] { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + UninitSlice::uninit(<span class="self">self</span>) + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="kw">if </span><span class="self">self</span>.len() < cnt { + panic_advance(cnt, <span class="self">self</span>.len()); + } + + <span class="comment">// Lifetime dance taken from `impl Write for &mut [u8]`. + </span><span class="kw">let </span>(<span class="kw">_</span>, b) = core::mem::replace(<span class="self">self</span>, <span class="kw-2">&mut </span>[]).split_at_mut(cnt); + <span class="kw-2">*</span><span class="self">self </span>= b; + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_slice(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) { + <span class="kw">if </span><span class="self">self</span>.len() < src.len() { + panic_advance(src.len(), <span class="self">self</span>.len()); + } + + <span class="comment">// SAFETY: We just checked that the pointer is valid for `src.len()` bytes. + </span><span class="kw">unsafe </span>{ + ptr::copy_nonoverlapping(src.as_ptr(), <span class="self">self</span>.as_mut_ptr().cast(), src.len()); + <span class="self">self</span>.advance_mut(src.len()); + } + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, val: u8, cnt: usize) { + <span class="kw">if </span><span class="self">self</span>.len() < cnt { + panic_advance(cnt, <span class="self">self</span>.len()); + } + + <span class="comment">// SAFETY: We just checked that the pointer is valid for `cnt` bytes. + </span><span class="kw">unsafe </span>{ + ptr::write_bytes(<span class="self">self</span>.as_mut_ptr() <span class="kw">as </span><span class="kw-2">*mut </span>u8, val, cnt); + <span class="self">self</span>.advance_mut(cnt); + } + } +} + +<span class="kw">unsafe impl </span>BufMut <span class="kw">for </span>Vec<u8> { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="comment">// A vector can never have more than isize::MAX bytes + </span>core::isize::MAX <span class="kw">as </span>usize - <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="kw">let </span>len = <span class="self">self</span>.len(); + <span class="kw">let </span>remaining = <span class="self">self</span>.capacity() - len; + + <span class="kw">if </span>remaining < cnt { + panic_advance(cnt, remaining); + } + + <span class="comment">// Addition will not overflow since the sum is at most the capacity. + </span><span class="self">self</span>.set_len(len + cnt); + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + <span class="kw">if </span><span class="self">self</span>.capacity() == <span class="self">self</span>.len() { + <span class="self">self</span>.reserve(<span class="number">64</span>); <span class="comment">// Grow the vec + </span>} + + <span class="kw">let </span>cap = <span class="self">self</span>.capacity(); + <span class="kw">let </span>len = <span class="self">self</span>.len(); + + <span class="kw">let </span>ptr = <span class="self">self</span>.as_mut_ptr(); + <span class="comment">// SAFETY: Since `ptr` is valid for `cap` bytes, `ptr.add(len)` must be + // valid for `cap - len` bytes. The subtraction will not underflow since + // `len <= cap`. + </span><span class="kw">unsafe </span>{ UninitSlice::from_raw_parts_mut(ptr.add(len), cap - len) } + } + + <span class="comment">// Specialize these methods so they can skip checking `remaining_mut` + // and `advance_mut`. + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>put<T: <span class="kw">super</span>::Buf>(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>src: T) + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + <span class="comment">// In case the src isn't contiguous, reserve upfront. + </span><span class="self">self</span>.reserve(src.remaining()); + + <span class="kw">while </span>src.has_remaining() { + <span class="kw">let </span>s = src.chunk(); + <span class="kw">let </span>l = s.len(); + <span class="self">self</span>.extend_from_slice(s); + src.advance(l); + } + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_slice(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) { + <span class="self">self</span>.extend_from_slice(src); + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>put_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, val: u8, cnt: usize) { + <span class="comment">// If the addition overflows, then the `resize` will fail. + </span><span class="kw">let </span>new_len = <span class="self">self</span>.len().saturating_add(cnt); + <span class="self">self</span>.resize(new_len, val); + } +} + +<span class="comment">// The existence of this function makes the compiler catch if the BufMut +// trait is "object-safe" or not. +</span><span class="kw">fn </span>_assert_trait_object(_b: <span class="kw-2">&</span><span class="kw">dyn </span>BufMut) {} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/chain.rs.html b/src/bytes/buf/chain.rs.html new file mode 100644 index 0000000..addd856 --- /dev/null +++ b/src/bytes/buf/chain.rs.html @@ -0,0 +1,482 @@ +<!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 `src/buf/chain.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>chain.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::buf::{IntoIter, UninitSlice}; +<span class="kw">use crate</span>::{Buf, BufMut, Bytes}; + +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">use </span>std::io::IoSlice; + +<span class="doccomment">/// A `Chain` sequences two buffers. +/// +/// `Chain` is an adapter that links two underlying buffers and provides a +/// continuous view across both buffers. It is able to sequence either immutable +/// buffers ([`Buf`] values) or mutable buffers ([`BufMut`] values). +/// +/// This struct is generally created by calling [`Buf::chain`]. Please see that +/// function's documentation for more detail. +/// +/// # Examples +/// +/// ``` +/// use bytes::{Bytes, Buf}; +/// +/// let mut buf = (&b"hello "[..]) +/// .chain(&b"world"[..]); +/// +/// let full: Bytes = buf.copy_to_bytes(11); +/// assert_eq!(full[..], b"hello world"[..]); +/// ``` +/// +/// [`Buf::chain`]: Buf::chain +</span><span class="attr">#[derive(Debug)] +</span><span class="kw">pub struct </span>Chain<T, U> { + a: T, + b: U, +} + +<span class="kw">impl</span><T, U> Chain<T, U> { + <span class="doccomment">/// Creates a new `Chain` sequencing the provided values. + </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>new(a: T, b: U) -> Chain<T, U> { + Chain { a, b } + } + + <span class="doccomment">/// Gets a reference to the first underlying `Buf`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let buf = (&b"hello"[..]) + /// .chain(&b"world"[..]); + /// + /// assert_eq!(buf.first_ref()[..], b"hello"[..]); + /// ``` + </span><span class="kw">pub fn </span>first_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { + <span class="kw-2">&</span><span class="self">self</span>.a + } + + <span class="doccomment">/// Gets a mutable reference to the first underlying `Buf`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = (&b"hello"[..]) + /// .chain(&b"world"[..]); + /// + /// buf.first_mut().advance(1); + /// + /// let full = buf.copy_to_bytes(9); + /// assert_eq!(full, b"elloworld"[..]); + /// ``` + </span><span class="kw">pub fn </span>first_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>T { + <span class="kw-2">&mut </span><span class="self">self</span>.a + } + + <span class="doccomment">/// Gets a reference to the last underlying `Buf`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let buf = (&b"hello"[..]) + /// .chain(&b"world"[..]); + /// + /// assert_eq!(buf.last_ref()[..], b"world"[..]); + /// ``` + </span><span class="kw">pub fn </span>last_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>U { + <span class="kw-2">&</span><span class="self">self</span>.b + } + + <span class="doccomment">/// Gets a mutable reference to the last underlying `Buf`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let mut buf = (&b"hello "[..]) + /// .chain(&b"world"[..]); + /// + /// buf.last_mut().advance(1); + /// + /// let full = buf.copy_to_bytes(10); + /// assert_eq!(full, b"hello orld"[..]); + /// ``` + </span><span class="kw">pub fn </span>last_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>U { + <span class="kw-2">&mut </span><span class="self">self</span>.b + } + + <span class="doccomment">/// Consumes this `Chain`, returning the underlying values. + /// + /// # Examples + /// + /// ``` + /// use bytes::Buf; + /// + /// let chain = (&b"hello"[..]) + /// .chain(&b"world"[..]); + /// + /// let (first, last) = chain.into_inner(); + /// assert_eq!(first[..], b"hello"[..]); + /// assert_eq!(last[..], b"world"[..]); + /// ``` + </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -> (T, U) { + (<span class="self">self</span>.a, <span class="self">self</span>.b) + } +} + +<span class="kw">impl</span><T, U> Buf <span class="kw">for </span>Chain<T, U> +<span class="kw">where + </span>T: Buf, + U: Buf, +{ + <span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.a.remaining().saturating_add(<span class="self">self</span>.b.remaining()) + } + + <span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="kw">if </span><span class="self">self</span>.a.has_remaining() { + <span class="self">self</span>.a.chunk() + } <span class="kw">else </span>{ + <span class="self">self</span>.b.chunk() + } + } + + <span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>cnt: usize) { + <span class="kw">let </span>a_rem = <span class="self">self</span>.a.remaining(); + + <span class="kw">if </span>a_rem != <span class="number">0 </span>{ + <span class="kw">if </span>a_rem >= cnt { + <span class="self">self</span>.a.advance(cnt); + <span class="kw">return</span>; + } + + <span class="comment">// Consume what is left of a + </span><span class="self">self</span>.a.advance(a_rem); + + cnt -= a_rem; + } + + <span class="self">self</span>.b.advance(cnt); + } + + <span class="attr">#[cfg(feature = <span class="string">"std"</span>)] + </span><span class="kw">fn </span>chunks_vectored<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">self</span>, dst: <span class="kw-2">&mut </span>[IoSlice<<span class="lifetime">'a</span>>]) -> usize { + <span class="kw">let </span><span class="kw-2">mut </span>n = <span class="self">self</span>.a.chunks_vectored(dst); + n += <span class="self">self</span>.b.chunks_vectored(<span class="kw-2">&mut </span>dst[n..]); + n + } + + <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) -> Bytes { + <span class="kw">let </span>a_rem = <span class="self">self</span>.a.remaining(); + <span class="kw">if </span>a_rem >= len { + <span class="self">self</span>.a.copy_to_bytes(len) + } <span class="kw">else if </span>a_rem == <span class="number">0 </span>{ + <span class="self">self</span>.b.copy_to_bytes(len) + } <span class="kw">else </span>{ + <span class="macro">assert!</span>( + len - a_rem <= <span class="self">self</span>.b.remaining(), + <span class="string">"`len` greater than remaining" + </span>); + <span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="kw">crate</span>::BytesMut::with_capacity(len); + ret.put(<span class="kw-2">&mut </span><span class="self">self</span>.a); + ret.put((<span class="kw-2">&mut </span><span class="self">self</span>.b).take(len - a_rem)); + ret.freeze() + } + } +} + +<span class="kw">unsafe impl</span><T, U> BufMut <span class="kw">for </span>Chain<T, U> +<span class="kw">where + </span>T: BufMut, + U: BufMut, +{ + <span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.a + .remaining_mut() + .saturating_add(<span class="self">self</span>.b.remaining_mut()) + } + + <span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + <span class="kw">if </span><span class="self">self</span>.a.has_remaining_mut() { + <span class="self">self</span>.a.chunk_mut() + } <span class="kw">else </span>{ + <span class="self">self</span>.b.chunk_mut() + } + } + + <span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>cnt: usize) { + <span class="kw">let </span>a_rem = <span class="self">self</span>.a.remaining_mut(); + + <span class="kw">if </span>a_rem != <span class="number">0 </span>{ + <span class="kw">if </span>a_rem >= cnt { + <span class="self">self</span>.a.advance_mut(cnt); + <span class="kw">return</span>; + } + + <span class="comment">// Consume what is left of a + </span><span class="self">self</span>.a.advance_mut(a_rem); + + cnt -= a_rem; + } + + <span class="self">self</span>.b.advance_mut(cnt); + } +} + +<span class="kw">impl</span><T, U> IntoIterator <span class="kw">for </span>Chain<T, U> +<span class="kw">where + </span>T: Buf, + U: Buf, +{ + <span class="kw">type </span>Item = u8; + <span class="kw">type </span>IntoIter = IntoIter<Chain<T, U>>; + + <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { + IntoIter::new(<span class="self">self</span>) + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/iter.rs.html b/src/bytes/buf/iter.rs.html new file mode 100644 index 0000000..766cf21 --- /dev/null +++ b/src/bytes/buf/iter.rs.html @@ -0,0 +1,256 @@ +<!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 `src/buf/iter.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>iter.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::Buf; + +<span class="doccomment">/// Iterator over the bytes contained by the buffer. +/// +/// # Examples +/// +/// Basic usage: +/// +/// ``` +/// use bytes::Bytes; +/// +/// let buf = Bytes::from(&b"abc"[..]); +/// let mut iter = buf.into_iter(); +/// +/// assert_eq!(iter.next(), Some(b'a')); +/// assert_eq!(iter.next(), Some(b'b')); +/// assert_eq!(iter.next(), Some(b'c')); +/// assert_eq!(iter.next(), None); +/// ``` +</span><span class="attr">#[derive(Debug)] +</span><span class="kw">pub struct </span>IntoIter<T> { + inner: T, +} + +<span class="kw">impl</span><T> IntoIter<T> { + <span class="doccomment">/// Creates an iterator over the bytes contained by the buffer. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let buf = Bytes::from_static(b"abc"); + /// let mut iter = buf.into_iter(); + /// + /// assert_eq!(iter.next(), Some(b'a')); + /// assert_eq!(iter.next(), Some(b'b')); + /// assert_eq!(iter.next(), Some(b'c')); + /// assert_eq!(iter.next(), None); + /// ``` + </span><span class="kw">pub fn </span>new(inner: T) -> IntoIter<T> { + IntoIter { inner } + } + + <span class="doccomment">/// Consumes this `IntoIter`, returning the underlying value. + /// + /// # Examples + /// + /// ```rust + /// use bytes::{Buf, Bytes}; + /// + /// let buf = Bytes::from(&b"abc"[..]); + /// let mut iter = buf.into_iter(); + /// + /// assert_eq!(iter.next(), Some(b'a')); + /// + /// let buf = iter.into_inner(); + /// assert_eq!(2, buf.remaining()); + /// ``` + </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -> T { + <span class="self">self</span>.inner + } + + <span class="doccomment">/// Gets a reference to the underlying `Buf`. + /// + /// It is inadvisable to directly read from the underlying `Buf`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::{Buf, Bytes}; + /// + /// let buf = Bytes::from(&b"abc"[..]); + /// let mut iter = buf.into_iter(); + /// + /// assert_eq!(iter.next(), Some(b'a')); + /// + /// assert_eq!(2, iter.get_ref().remaining()); + /// ``` + </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { + <span class="kw-2">&</span><span class="self">self</span>.inner + } + + <span class="doccomment">/// Gets a mutable reference to the underlying `Buf`. + /// + /// It is inadvisable to directly read from the underlying `Buf`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::{Buf, BytesMut}; + /// + /// let buf = BytesMut::from(&b"abc"[..]); + /// let mut iter = buf.into_iter(); + /// + /// assert_eq!(iter.next(), Some(b'a')); + /// + /// iter.get_mut().advance(1); + /// + /// assert_eq!(iter.next(), Some(b'c')); + /// ``` + </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>T { + <span class="kw-2">&mut </span><span class="self">self</span>.inner + } +} + +<span class="kw">impl</span><T: Buf> Iterator <span class="kw">for </span>IntoIter<T> { + <span class="kw">type </span>Item = u8; + + <span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><u8> { + <span class="kw">if </span>!<span class="self">self</span>.inner.has_remaining() { + <span class="kw">return </span><span class="prelude-val">None</span>; + } + + <span class="kw">let </span>b = <span class="self">self</span>.inner.chunk()[<span class="number">0</span>]; + <span class="self">self</span>.inner.advance(<span class="number">1</span>); + + <span class="prelude-val">Some</span>(b) + } + + <span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { + <span class="kw">let </span>rem = <span class="self">self</span>.inner.remaining(); + (rem, <span class="prelude-val">Some</span>(rem)) + } +} + +<span class="kw">impl</span><T: Buf> ExactSizeIterator <span class="kw">for </span>IntoIter<T> {} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/limit.rs.html b/src/bytes/buf/limit.rs.html new file mode 100644 index 0000000..c4ed6d6 --- /dev/null +++ b/src/bytes/buf/limit.rs.html @@ -0,0 +1,152 @@ +<!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 `src/buf/limit.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>limit.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::buf::UninitSlice; +<span class="kw">use </span><span class="kw">crate</span>::BufMut; + +<span class="kw">use </span>core::cmp; + +<span class="doccomment">/// A `BufMut` adapter which limits the amount of bytes that can be written +/// to an underlying buffer. +</span><span class="attr">#[derive(Debug)] +</span><span class="kw">pub struct </span>Limit<T> { + inner: T, + limit: usize, +} + +<span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>new<T>(inner: T, limit: usize) -> Limit<T> { + Limit { inner, limit } +} + +<span class="kw">impl</span><T> Limit<T> { + <span class="doccomment">/// Consumes this `Limit`, returning the underlying value. + </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -> T { + <span class="self">self</span>.inner + } + + <span class="doccomment">/// Gets a reference to the underlying `BufMut`. + /// + /// It is inadvisable to directly write to the underlying `BufMut`. + </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { + <span class="kw-2">&</span><span class="self">self</span>.inner + } + + <span class="doccomment">/// Gets a mutable reference to the underlying `BufMut`. + /// + /// It is inadvisable to directly write to the underlying `BufMut`. + </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>T { + <span class="kw-2">&mut </span><span class="self">self</span>.inner + } + + <span class="doccomment">/// Returns the maximum number of bytes that can be written + /// + /// # Note + /// + /// If the inner `BufMut` has fewer bytes than indicated by this method then + /// that is the actual number of available bytes. + </span><span class="kw">pub fn </span>limit(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.limit + } + + <span class="doccomment">/// Sets the maximum number of bytes that can be written. + /// + /// # Note + /// + /// If the inner `BufMut` has fewer bytes than `lim` then that is the actual + /// number of available bytes. + </span><span class="kw">pub fn </span>set_limit(<span class="kw-2">&mut </span><span class="self">self</span>, lim: usize) { + <span class="self">self</span>.limit = lim + } +} + +<span class="kw">unsafe impl</span><T: BufMut> BufMut <span class="kw">for </span>Limit<T> { + <span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + cmp::min(<span class="self">self</span>.inner.remaining_mut(), <span class="self">self</span>.limit) + } + + <span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + <span class="kw">let </span>bytes = <span class="self">self</span>.inner.chunk_mut(); + <span class="kw">let </span>end = cmp::min(bytes.len(), <span class="self">self</span>.limit); + <span class="kw-2">&mut </span>bytes[..end] + } + + <span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="macro">assert!</span>(cnt <= <span class="self">self</span>.limit); + <span class="self">self</span>.inner.advance_mut(cnt); + <span class="self">self</span>.limit -= cnt; + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/mod.rs.html b/src/bytes/buf/mod.rs.html new file mode 100644 index 0000000..fbd7ae7 --- /dev/null +++ b/src/bytes/buf/mod.rs.html @@ -0,0 +1,80 @@ +<!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 `src/buf/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="doccomment">//! Utilities for working with buffers. +//! +//! A buffer is any structure that contains a sequence of bytes. The bytes may +//! or may not be stored in contiguous memory. This module contains traits used +//! to abstract over buffers as well as utilities for working with buffer types. +//! +//! # `Buf`, `BufMut` +//! +//! These are the two foundational traits for abstractly working with buffers. +//! They can be thought as iterators for byte structures. They offer additional +//! performance over `Iterator` by providing an API optimized for byte slices. +//! +//! See [`Buf`] and [`BufMut`] for more details. +//! +//! [rope]: https://en.wikipedia.org/wiki/Rope_(data_structure) + +</span><span class="kw">mod </span>buf_impl; +<span class="kw">mod </span>buf_mut; +<span class="kw">mod </span>chain; +<span class="kw">mod </span>iter; +<span class="kw">mod </span>limit; +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">mod </span>reader; +<span class="kw">mod </span>take; +<span class="kw">mod </span>uninit_slice; +<span class="kw">mod </span>vec_deque; +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">mod </span>writer; + +<span class="kw">pub use </span><span class="self">self</span>::buf_impl::Buf; +<span class="kw">pub use </span><span class="self">self</span>::buf_mut::BufMut; +<span class="kw">pub use </span><span class="self">self</span>::chain::Chain; +<span class="kw">pub use </span><span class="self">self</span>::iter::IntoIter; +<span class="kw">pub use </span><span class="self">self</span>::limit::Limit; +<span class="kw">pub use </span><span class="self">self</span>::take::Take; +<span class="kw">pub use </span><span class="self">self</span>::uninit_slice::UninitSlice; + +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">pub use </span><span class="self">self</span>::{reader::Reader, writer::Writer}; +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/reader.rs.html b/src/bytes/buf/reader.rs.html new file mode 100644 index 0000000..a32bc56 --- /dev/null +++ b/src/bytes/buf/reader.rs.html @@ -0,0 +1,164 @@ +<!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 `src/buf/reader.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>reader.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::Buf; + +<span class="kw">use </span>std::{cmp, io}; + +<span class="doccomment">/// A `Buf` adapter which implements `io::Read` for the inner value. +/// +/// This struct is generally created by calling `reader()` on `Buf`. See +/// documentation of [`reader()`](Buf::reader) for more +/// details. +</span><span class="attr">#[derive(Debug)] +</span><span class="kw">pub struct </span>Reader<B> { + buf: B, +} + +<span class="kw">pub fn </span>new<B>(buf: B) -> Reader<B> { + Reader { buf } +} + +<span class="kw">impl</span><B: Buf> Reader<B> { + <span class="doccomment">/// Gets a reference to the underlying `Buf`. + /// + /// It is inadvisable to directly read from the underlying `Buf`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::Buf; + /// + /// let buf = b"hello world".reader(); + /// + /// assert_eq!(b"hello world", buf.get_ref()); + /// ``` + </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>B { + <span class="kw-2">&</span><span class="self">self</span>.buf + } + + <span class="doccomment">/// Gets a mutable reference to the underlying `Buf`. + /// + /// It is inadvisable to directly read from the underlying `Buf`. + </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>B { + <span class="kw-2">&mut </span><span class="self">self</span>.buf + } + + <span class="doccomment">/// Consumes this `Reader`, returning the underlying value. + /// + /// # Examples + /// + /// ```rust + /// use bytes::Buf; + /// use std::io; + /// + /// let mut buf = b"hello world".reader(); + /// let mut dst = vec![]; + /// + /// io::copy(&mut buf, &mut dst).unwrap(); + /// + /// let buf = buf.into_inner(); + /// assert_eq!(0, buf.remaining()); + /// ``` + </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -> B { + <span class="self">self</span>.buf + } +} + +<span class="kw">impl</span><B: Buf + Sized> io::Read <span class="kw">for </span>Reader<B> { + <span class="kw">fn </span>read(<span class="kw-2">&mut </span><span class="self">self</span>, dst: <span class="kw-2">&mut </span>[u8]) -> io::Result<usize> { + <span class="kw">let </span>len = cmp::min(<span class="self">self</span>.buf.remaining(), dst.len()); + + Buf::copy_to_slice(<span class="kw-2">&mut </span><span class="self">self</span>.buf, <span class="kw-2">&mut </span>dst[<span class="number">0</span>..len]); + <span class="prelude-val">Ok</span>(len) + } +} + +<span class="kw">impl</span><B: Buf + Sized> io::BufRead <span class="kw">for </span>Reader<B> { + <span class="kw">fn </span>fill_buf(<span class="kw-2">&mut </span><span class="self">self</span>) -> io::Result<<span class="kw-2">&</span>[u8]> { + <span class="prelude-val">Ok</span>(<span class="self">self</span>.buf.chunk()) + } + <span class="kw">fn </span>consume(<span class="kw-2">&mut </span><span class="self">self</span>, amt: usize) { + <span class="self">self</span>.buf.advance(amt) + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/take.rs.html b/src/bytes/buf/take.rs.html new file mode 100644 index 0000000..e1c5f52 --- /dev/null +++ b/src/bytes/buf/take.rs.html @@ -0,0 +1,312 @@ +<!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 `src/buf/take.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>take.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use crate</span>::{Buf, Bytes}; + +<span class="kw">use </span>core::cmp; + +<span class="doccomment">/// A `Buf` adapter which limits the bytes read from an underlying buffer. +/// +/// This struct is generally created by calling `take()` on `Buf`. See +/// documentation of [`take()`](Buf::take) for more details. +</span><span class="attr">#[derive(Debug)] +</span><span class="kw">pub struct </span>Take<T> { + inner: T, + limit: usize, +} + +<span class="kw">pub fn </span>new<T>(inner: T, limit: usize) -> Take<T> { + Take { inner, limit } +} + +<span class="kw">impl</span><T> Take<T> { + <span class="doccomment">/// Consumes this `Take`, returning the underlying value. + /// + /// # Examples + /// + /// ```rust + /// use bytes::{Buf, BufMut}; + /// + /// let mut buf = b"hello world".take(2); + /// let mut dst = vec![]; + /// + /// dst.put(&mut buf); + /// assert_eq!(*dst, b"he"[..]); + /// + /// let mut buf = buf.into_inner(); + /// + /// dst.clear(); + /// dst.put(&mut buf); + /// assert_eq!(*dst, b"llo world"[..]); + /// ``` + </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -> T { + <span class="self">self</span>.inner + } + + <span class="doccomment">/// Gets a reference to the underlying `Buf`. + /// + /// It is inadvisable to directly read from the underlying `Buf`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::Buf; + /// + /// let buf = b"hello world".take(2); + /// + /// assert_eq!(11, buf.get_ref().remaining()); + /// ``` + </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { + <span class="kw-2">&</span><span class="self">self</span>.inner + } + + <span class="doccomment">/// Gets a mutable reference to the underlying `Buf`. + /// + /// It is inadvisable to directly read from the underlying `Buf`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::{Buf, BufMut}; + /// + /// let mut buf = b"hello world".take(2); + /// let mut dst = vec![]; + /// + /// buf.get_mut().advance(2); + /// + /// dst.put(&mut buf); + /// assert_eq!(*dst, b"ll"[..]); + /// ``` + </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>T { + <span class="kw-2">&mut </span><span class="self">self</span>.inner + } + + <span class="doccomment">/// Returns the maximum number of bytes that can be read. + /// + /// # Note + /// + /// If the inner `Buf` has fewer bytes than indicated by this method then + /// that is the actual number of available bytes. + /// + /// # Examples + /// + /// ```rust + /// use bytes::Buf; + /// + /// let mut buf = b"hello world".take(2); + /// + /// assert_eq!(2, buf.limit()); + /// assert_eq!(b'h', buf.get_u8()); + /// assert_eq!(1, buf.limit()); + /// ``` + </span><span class="kw">pub fn </span>limit(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.limit + } + + <span class="doccomment">/// Sets the maximum number of bytes that can be read. + /// + /// # Note + /// + /// If the inner `Buf` has fewer bytes than `lim` then that is the actual + /// number of available bytes. + /// + /// # Examples + /// + /// ```rust + /// use bytes::{Buf, BufMut}; + /// + /// let mut buf = b"hello world".take(2); + /// let mut dst = vec![]; + /// + /// dst.put(&mut buf); + /// assert_eq!(*dst, b"he"[..]); + /// + /// dst.clear(); + /// + /// buf.set_limit(3); + /// dst.put(&mut buf); + /// assert_eq!(*dst, b"llo"[..]); + /// ``` + </span><span class="kw">pub fn </span>set_limit(<span class="kw-2">&mut </span><span class="self">self</span>, lim: usize) { + <span class="self">self</span>.limit = lim + } +} + +<span class="kw">impl</span><T: Buf> Buf <span class="kw">for </span>Take<T> { + <span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + cmp::min(<span class="self">self</span>.inner.remaining(), <span class="self">self</span>.limit) + } + + <span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="kw">let </span>bytes = <span class="self">self</span>.inner.chunk(); + <span class="kw-2">&</span>bytes[..cmp::min(bytes.len(), <span class="self">self</span>.limit)] + } + + <span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="macro">assert!</span>(cnt <= <span class="self">self</span>.limit); + <span class="self">self</span>.inner.advance(cnt); + <span class="self">self</span>.limit -= cnt; + } + + <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) -> Bytes { + <span class="macro">assert!</span>(len <= <span class="self">self</span>.remaining(), <span class="string">"`len` greater than remaining"</span>); + + <span class="kw">let </span>r = <span class="self">self</span>.inner.copy_to_bytes(len); + <span class="self">self</span>.limit -= len; + r + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/uninit_slice.rs.html b/src/bytes/buf/uninit_slice.rs.html new file mode 100644 index 0000000..d474bbe --- /dev/null +++ b/src/bytes/buf/uninit_slice.rs.html @@ -0,0 +1,516 @@ +<!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 `src/buf/uninit_slice.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>uninit_slice.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span>core::fmt; +<span class="kw">use </span>core::mem::MaybeUninit; +<span class="kw">use </span>core::ops::{ + Index, IndexMut, Range, RangeFrom, RangeFull, RangeInclusive, RangeTo, RangeToInclusive, +}; + +<span class="doccomment">/// Uninitialized byte slice. +/// +/// Returned by `BufMut::chunk_mut()`, the referenced byte slice may be +/// uninitialized. The wrapper provides safe access without introducing +/// undefined behavior. +/// +/// The safety invariants of this wrapper are: +/// +/// 1. Reading from an `UninitSlice` is undefined behavior. +/// 2. Writing uninitialized bytes to an `UninitSlice` is undefined behavior. +/// +/// The difference between `&mut UninitSlice` and `&mut [MaybeUninit<u8>]` is +/// that it is possible in safe code to write uninitialized bytes to an +/// `&mut [MaybeUninit<u8>]`, which this type prohibits. +</span><span class="attr">#[repr(transparent)] +</span><span class="kw">pub struct </span>UninitSlice([MaybeUninit<u8>]); + +<span class="kw">impl </span>UninitSlice { + <span class="doccomment">/// Creates a `&mut UninitSlice` wrapping a slice of initialised memory. + /// + /// # Examples + /// + /// ``` + /// use bytes::buf::UninitSlice; + /// + /// let mut buffer = [0u8; 64]; + /// let slice = UninitSlice::new(&mut buffer[..]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>new(slice: <span class="kw-2">&mut </span>[u8]) -> <span class="kw-2">&mut </span>UninitSlice { + <span class="kw">unsafe </span>{ <span class="kw-2">&mut *</span>(slice <span class="kw">as </span><span class="kw-2">*mut </span>[u8] <span class="kw">as </span><span class="kw-2">*mut </span>[MaybeUninit<u8>] <span class="kw">as </span><span class="kw-2">*mut </span>UninitSlice) } + } + + <span class="doccomment">/// Creates a `&mut UninitSlice` wrapping a slice of uninitialised memory. + /// + /// # Examples + /// + /// ``` + /// use bytes::buf::UninitSlice; + /// use core::mem::MaybeUninit; + /// + /// let mut buffer = [MaybeUninit::uninit(); 64]; + /// let slice = UninitSlice::uninit(&mut buffer[..]); + /// + /// let mut vec = Vec::with_capacity(1024); + /// let spare: &mut UninitSlice = vec.spare_capacity_mut().into(); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>uninit(slice: <span class="kw-2">&mut </span>[MaybeUninit<u8>]) -> <span class="kw-2">&mut </span>UninitSlice { + <span class="kw">unsafe </span>{ <span class="kw-2">&mut *</span>(slice <span class="kw">as </span><span class="kw-2">*mut </span>[MaybeUninit<u8>] <span class="kw">as </span><span class="kw-2">*mut </span>UninitSlice) } + } + + <span class="kw">fn </span>uninit_ref(slice: <span class="kw-2">&</span>[MaybeUninit<u8>]) -> <span class="kw-2">&</span>UninitSlice { + <span class="kw">unsafe </span>{ <span class="kw-2">&*</span>(slice <span class="kw">as </span><span class="kw-2">*const </span>[MaybeUninit<u8>] <span class="kw">as </span><span class="kw-2">*const </span>UninitSlice) } + } + + <span class="doccomment">/// Create a `&mut UninitSlice` from a pointer and a length. + /// + /// # Safety + /// + /// The caller must ensure that `ptr` references a valid memory region owned + /// by the caller representing a byte slice for the duration of `'a`. + /// + /// # Examples + /// + /// ``` + /// use bytes::buf::UninitSlice; + /// + /// let bytes = b"hello world".to_vec(); + /// let ptr = bytes.as_ptr() as *mut _; + /// let len = bytes.len(); + /// + /// let slice = unsafe { UninitSlice::from_raw_parts_mut(ptr, len) }; + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub unsafe fn </span>from_raw_parts_mut<<span class="lifetime">'a</span>>(ptr: <span class="kw-2">*mut </span>u8, len: usize) -> <span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>UninitSlice { + <span class="kw">let </span>maybe_init: <span class="kw-2">&mut </span>[MaybeUninit<u8>] = + core::slice::from_raw_parts_mut(ptr <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>, len); + <span class="self">Self</span>::uninit(maybe_init) + } + + <span class="doccomment">/// Write a single byte at the specified offset. + /// + /// # Panics + /// + /// The function panics if `index` is out of bounds. + /// + /// # Examples + /// + /// ``` + /// use bytes::buf::UninitSlice; + /// + /// let mut data = [b'f', b'o', b'o']; + /// let slice = unsafe { UninitSlice::from_raw_parts_mut(data.as_mut_ptr(), 3) }; + /// + /// slice.write_byte(0, b'b'); + /// + /// assert_eq!(b"boo", &data[..]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>write_byte(<span class="kw-2">&mut </span><span class="self">self</span>, index: usize, byte: u8) { + <span class="macro">assert!</span>(index < <span class="self">self</span>.len()); + + <span class="kw">unsafe </span>{ <span class="self">self</span>[index..].as_mut_ptr().write(byte) } + } + + <span class="doccomment">/// Copies bytes from `src` into `self`. + /// + /// The length of `src` must be the same as `self`. + /// + /// # Panics + /// + /// The function panics if `src` has a different length than `self`. + /// + /// # Examples + /// + /// ``` + /// use bytes::buf::UninitSlice; + /// + /// let mut data = [b'f', b'o', b'o']; + /// let slice = unsafe { UninitSlice::from_raw_parts_mut(data.as_mut_ptr(), 3) }; + /// + /// slice.copy_from_slice(b"bar"); + /// + /// assert_eq!(b"bar", &data[..]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>copy_from_slice(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) { + <span class="kw">use </span>core::ptr; + + <span class="macro">assert_eq!</span>(<span class="self">self</span>.len(), src.len()); + + <span class="kw">unsafe </span>{ + ptr::copy_nonoverlapping(src.as_ptr(), <span class="self">self</span>.as_mut_ptr(), <span class="self">self</span>.len()); + } + } + + <span class="doccomment">/// Return a raw pointer to the slice's buffer. + /// + /// # Safety + /// + /// The caller **must not** read from the referenced memory and **must not** + /// write **uninitialized** bytes to the slice either. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut data = [0, 1, 2]; + /// let mut slice = &mut data[..]; + /// let ptr = BufMut::chunk_mut(&mut slice).as_mut_ptr(); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>as_mut_ptr(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">*mut </span>u8 { + <span class="self">self</span>.<span class="number">0</span>.as_mut_ptr() <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_ + </span>} + + <span class="doccomment">/// Return a `&mut [MaybeUninit<u8>]` to this slice's buffer. + /// + /// # Safety + /// + /// The caller **must not** read from the referenced memory and **must not** write + /// **uninitialized** bytes to the slice either. This is because `BufMut` implementation + /// that created the `UninitSlice` knows which parts are initialized. Writing uninitialized + /// bytes to the slice may cause the `BufMut` to read those bytes and trigger undefined + /// behavior. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut data = [0, 1, 2]; + /// let mut slice = &mut data[..]; + /// unsafe { + /// let uninit_slice = BufMut::chunk_mut(&mut slice).as_uninit_slice_mut(); + /// }; + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub unsafe fn </span>as_uninit_slice_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[MaybeUninit<u8>] { + <span class="kw-2">&mut </span><span class="self">self</span>.<span class="number">0 + </span>} + + <span class="doccomment">/// Returns the number of bytes in the slice. + /// + /// # Examples + /// + /// ``` + /// use bytes::BufMut; + /// + /// let mut data = [0, 1, 2]; + /// let mut slice = &mut data[..]; + /// let len = BufMut::chunk_mut(&mut slice).len(); + /// + /// assert_eq!(len, 3); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.<span class="number">0</span>.len() + } +} + +<span class="kw">impl </span>fmt::Debug <span class="kw">for </span>UninitSlice { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, fmt: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { + fmt.debug_struct(<span class="string">"UninitSlice[...]"</span>).finish() + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> From<<span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[u8]> <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>UninitSlice { + <span class="kw">fn </span>from(slice: <span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[u8]) -> <span class="self">Self </span>{ + UninitSlice::new(slice) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> From<<span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[MaybeUninit<u8>]> <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>UninitSlice { + <span class="kw">fn </span>from(slice: <span class="kw-2">&</span><span class="lifetime">'a </span><span class="kw-2">mut </span>[MaybeUninit<u8>]) -> <span class="self">Self </span>{ + UninitSlice::uninit(slice) + } +} + +<span class="macro">macro_rules! </span>impl_index { + ($(<span class="macro-nonterminal">$t</span>:ty),<span class="kw-2">*</span>) => { + $( + <span class="kw">impl </span>Index<<span class="macro-nonterminal">$t</span>> <span class="kw">for </span>UninitSlice { + <span class="kw">type </span>Output = UninitSlice; + + <span class="attr">#[inline] + </span><span class="kw">fn </span>index(<span class="kw-2">&</span><span class="self">self</span>, index: <span class="macro-nonterminal">$t</span>) -> <span class="kw-2">&</span>UninitSlice { + UninitSlice::uninit_ref(<span class="kw-2">&</span><span class="self">self</span>.<span class="number">0</span>[index]) + } + } + + <span class="kw">impl </span>IndexMut<<span class="macro-nonterminal">$t</span>> <span class="kw">for </span>UninitSlice { + <span class="attr">#[inline] + </span><span class="kw">fn </span>index_mut(<span class="kw-2">&mut </span><span class="self">self</span>, index: <span class="macro-nonterminal">$t</span>) -> <span class="kw-2">&mut </span>UninitSlice { + UninitSlice::uninit(<span class="kw-2">&mut </span><span class="self">self</span>.<span class="number">0</span>[index]) + } + } + )* + }; +} + +<span class="macro">impl_index!</span>( + Range<usize>, + RangeFrom<usize>, + RangeFull, + RangeInclusive<usize>, + RangeTo<usize>, + RangeToInclusive<usize> +); +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/vec_deque.rs.html b/src/bytes/buf/vec_deque.rs.html new file mode 100644 index 0000000..a276b6f --- /dev/null +++ b/src/bytes/buf/vec_deque.rs.html @@ -0,0 +1,46 @@ +<!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 `src/buf/vec_deque.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>vec_deque.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span>alloc::collections::VecDeque; + +<span class="kw">use </span><span class="kw">super</span>::Buf; + +<span class="kw">impl </span>Buf <span class="kw">for </span>VecDeque<u8> { + <span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len() + } + + <span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="kw">let </span>(s1, s2) = <span class="self">self</span>.as_slices(); + <span class="kw">if </span>s1.is_empty() { + s2 + } <span class="kw">else </span>{ + s1 + } + } + + <span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="self">self</span>.drain(..cnt); + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/buf/writer.rs.html b/src/bytes/buf/writer.rs.html new file mode 100644 index 0000000..25aa759 --- /dev/null +++ b/src/bytes/buf/writer.rs.html @@ -0,0 +1,178 @@ +<!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 `src/buf/writer.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>writer.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::BufMut; + +<span class="kw">use </span>std::{cmp, io}; + +<span class="doccomment">/// A `BufMut` adapter which implements `io::Write` for the inner value. +/// +/// This struct is generally created by calling `writer()` on `BufMut`. See +/// documentation of [`writer()`](BufMut::writer) for more +/// details. +</span><span class="attr">#[derive(Debug)] +</span><span class="kw">pub struct </span>Writer<B> { + buf: B, +} + +<span class="kw">pub fn </span>new<B>(buf: B) -> Writer<B> { + Writer { buf } +} + +<span class="kw">impl</span><B: BufMut> Writer<B> { + <span class="doccomment">/// Gets a reference to the underlying `BufMut`. + /// + /// It is inadvisable to directly write to the underlying `BufMut`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::BufMut; + /// + /// let buf = Vec::with_capacity(1024).writer(); + /// + /// assert_eq!(1024, buf.get_ref().capacity()); + /// ``` + </span><span class="kw">pub fn </span>get_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>B { + <span class="kw-2">&</span><span class="self">self</span>.buf + } + + <span class="doccomment">/// Gets a mutable reference to the underlying `BufMut`. + /// + /// It is inadvisable to directly write to the underlying `BufMut`. + /// + /// # Examples + /// + /// ```rust + /// use bytes::BufMut; + /// + /// let mut buf = vec![].writer(); + /// + /// buf.get_mut().reserve(1024); + /// + /// assert_eq!(1024, buf.get_ref().capacity()); + /// ``` + </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>B { + <span class="kw-2">&mut </span><span class="self">self</span>.buf + } + + <span class="doccomment">/// Consumes this `Writer`, returning the underlying value. + /// + /// # Examples + /// + /// ```rust + /// use bytes::BufMut; + /// use std::io; + /// + /// let mut buf = vec![].writer(); + /// let mut src = &b"hello world"[..]; + /// + /// io::copy(&mut src, &mut buf).unwrap(); + /// + /// let buf = buf.into_inner(); + /// assert_eq!(*buf, b"hello world"[..]); + /// ``` + </span><span class="kw">pub fn </span>into_inner(<span class="self">self</span>) -> B { + <span class="self">self</span>.buf + } +} + +<span class="kw">impl</span><B: BufMut + Sized> io::Write <span class="kw">for </span>Writer<B> { + <span class="kw">fn </span>write(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) -> io::Result<usize> { + <span class="kw">let </span>n = cmp::min(<span class="self">self</span>.buf.remaining_mut(), src.len()); + + <span class="self">self</span>.buf.put(<span class="kw-2">&</span>src[<span class="number">0</span>..n]); + <span class="prelude-val">Ok</span>(n) + } + + <span class="kw">fn </span>flush(<span class="kw-2">&mut </span><span class="self">self</span>) -> io::Result<()> { + <span class="prelude-val">Ok</span>(()) + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/bytes.rs.html b/src/bytes/bytes.rs.html new file mode 100644 index 0000000..b454be1 --- /dev/null +++ b/src/bytes/bytes.rs.html @@ -0,0 +1,2962 @@ +<!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 `src/bytes.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>bytes.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../source-files.js"></script><script defer src="../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../bytes/index.html"><img class="rust-logo" src="../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../static.files/wheel-5ec35bf9ca753509.svg"></a></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> +<span id="2">2</span> +<span id="3">3</span> +<span id="4">4</span> +<span id="5">5</span> +<span id="6">6</span> +<span id="7">7</span> +<span id="8">8</span> +<span id="9">9</span> +<span id="10">10</span> +<span id="11">11</span> +<span id="12">12</span> +<span id="13">13</span> +<span id="14">14</span> +<span id="15">15</span> +<span id="16">16</span> +<span id="17">17</span> +<span id="18">18</span> +<span id="19">19</span> +<span id="20">20</span> +<span id="21">21</span> +<span id="22">22</span> +<span id="23">23</span> +<span id="24">24</span> +<span id="25">25</span> +<span id="26">26</span> +<span id="27">27</span> +<span id="28">28</span> +<span id="29">29</span> +<span id="30">30</span> +<span id="31">31</span> +<span id="32">32</span> +<span id="33">33</span> +<span id="34">34</span> +<span id="35">35</span> +<span id="36">36</span> +<span id="37">37</span> +<span id="38">38</span> +<span id="39">39</span> +<span id="40">40</span> +<span id="41">41</span> +<span id="42">42</span> +<span id="43">43</span> +<span id="44">44</span> +<span id="45">45</span> +<span id="46">46</span> +<span id="47">47</span> +<span id="48">48</span> +<span id="49">49</span> +<span id="50">50</span> +<span id="51">51</span> +<span id="52">52</span> +<span id="53">53</span> +<span id="54">54</span> +<span id="55">55</span> +<span id="56">56</span> +<span id="57">57</span> +<span id="58">58</span> +<span id="59">59</span> +<span id="60">60</span> +<span id="61">61</span> +<span id="62">62</span> +<span id="63">63</span> +<span id="64">64</span> +<span id="65">65</span> +<span id="66">66</span> +<span id="67">67</span> +<span id="68">68</span> +<span id="69">69</span> +<span id="70">70</span> +<span id="71">71</span> +<span id="72">72</span> +<span id="73">73</span> +<span id="74">74</span> +<span id="75">75</span> +<span id="76">76</span> +<span id="77">77</span> +<span id="78">78</span> +<span id="79">79</span> +<span id="80">80</span> +<span id="81">81</span> +<span id="82">82</span> +<span id="83">83</span> +<span id="84">84</span> +<span id="85">85</span> +<span id="86">86</span> +<span id="87">87</span> +<span id="88">88</span> +<span id="89">89</span> +<span id="90">90</span> +<span id="91">91</span> +<span id="92">92</span> +<span id="93">93</span> +<span id="94">94</span> +<span id="95">95</span> +<span id="96">96</span> +<span id="97">97</span> +<span id="98">98</span> +<span id="99">99</span> +<span id="100">100</span> +<span id="101">101</span> +<span id="102">102</span> +<span id="103">103</span> +<span id="104">104</span> +<span id="105">105</span> +<span id="106">106</span> +<span id="107">107</span> +<span id="108">108</span> +<span id="109">109</span> +<span id="110">110</span> +<span id="111">111</span> +<span id="112">112</span> +<span id="113">113</span> +<span id="114">114</span> +<span id="115">115</span> +<span id="116">116</span> +<span id="117">117</span> +<span id="118">118</span> +<span id="119">119</span> +<span id="120">120</span> +<span id="121">121</span> +<span id="122">122</span> +<span id="123">123</span> +<span id="124">124</span> +<span id="125">125</span> +<span id="126">126</span> +<span id="127">127</span> +<span id="128">128</span> +<span id="129">129</span> +<span id="130">130</span> +<span id="131">131</span> +<span id="132">132</span> +<span id="133">133</span> +<span id="134">134</span> +<span id="135">135</span> +<span id="136">136</span> +<span id="137">137</span> +<span id="138">138</span> +<span id="139">139</span> +<span id="140">140</span> +<span id="141">141</span> +<span id="142">142</span> +<span id="143">143</span> +<span id="144">144</span> +<span id="145">145</span> +<span id="146">146</span> +<span id="147">147</span> +<span id="148">148</span> +<span id="149">149</span> +<span id="150">150</span> +<span id="151">151</span> +<span id="152">152</span> +<span id="153">153</span> +<span id="154">154</span> +<span id="155">155</span> +<span id="156">156</span> +<span id="157">157</span> +<span id="158">158</span> +<span id="159">159</span> +<span id="160">160</span> +<span id="161">161</span> +<span id="162">162</span> +<span id="163">163</span> +<span id="164">164</span> +<span id="165">165</span> +<span id="166">166</span> +<span id="167">167</span> +<span id="168">168</span> +<span id="169">169</span> +<span id="170">170</span> +<span id="171">171</span> +<span id="172">172</span> +<span id="173">173</span> +<span id="174">174</span> +<span id="175">175</span> +<span id="176">176</span> +<span id="177">177</span> +<span id="178">178</span> +<span id="179">179</span> +<span id="180">180</span> +<span id="181">181</span> +<span id="182">182</span> +<span id="183">183</span> +<span id="184">184</span> +<span id="185">185</span> +<span id="186">186</span> +<span id="187">187</span> +<span id="188">188</span> +<span id="189">189</span> +<span id="190">190</span> +<span id="191">191</span> +<span id="192">192</span> +<span id="193">193</span> +<span id="194">194</span> +<span id="195">195</span> +<span id="196">196</span> +<span id="197">197</span> +<span id="198">198</span> +<span id="199">199</span> +<span id="200">200</span> +<span id="201">201</span> +<span id="202">202</span> +<span id="203">203</span> +<span id="204">204</span> +<span id="205">205</span> +<span id="206">206</span> +<span id="207">207</span> +<span id="208">208</span> +<span id="209">209</span> +<span id="210">210</span> +<span id="211">211</span> +<span id="212">212</span> +<span id="213">213</span> +<span id="214">214</span> +<span id="215">215</span> +<span id="216">216</span> +<span id="217">217</span> +<span id="218">218</span> +<span id="219">219</span> +<span id="220">220</span> +<span id="221">221</span> +<span id="222">222</span> +<span id="223">223</span> +<span id="224">224</span> +<span id="225">225</span> +<span id="226">226</span> +<span id="227">227</span> +<span id="228">228</span> +<span id="229">229</span> +<span id="230">230</span> +<span id="231">231</span> +<span id="232">232</span> +<span id="233">233</span> +<span id="234">234</span> +<span id="235">235</span> +<span id="236">236</span> +<span id="237">237</span> +<span id="238">238</span> +<span id="239">239</span> +<span id="240">240</span> +<span id="241">241</span> +<span id="242">242</span> +<span id="243">243</span> +<span id="244">244</span> +<span id="245">245</span> +<span id="246">246</span> +<span id="247">247</span> +<span id="248">248</span> +<span id="249">249</span> +<span id="250">250</span> +<span id="251">251</span> +<span id="252">252</span> +<span id="253">253</span> +<span id="254">254</span> +<span id="255">255</span> +<span id="256">256</span> +<span id="257">257</span> +<span id="258">258</span> +<span id="259">259</span> +<span id="260">260</span> +<span id="261">261</span> +<span id="262">262</span> +<span id="263">263</span> +<span id="264">264</span> +<span id="265">265</span> +<span id="266">266</span> +<span id="267">267</span> +<span id="268">268</span> +<span id="269">269</span> +<span id="270">270</span> +<span id="271">271</span> +<span id="272">272</span> +<span id="273">273</span> +<span id="274">274</span> +<span id="275">275</span> +<span id="276">276</span> +<span id="277">277</span> +<span id="278">278</span> +<span id="279">279</span> +<span id="280">280</span> +<span id="281">281</span> +<span id="282">282</span> +<span id="283">283</span> +<span id="284">284</span> +<span id="285">285</span> +<span id="286">286</span> +<span id="287">287</span> +<span id="288">288</span> +<span id="289">289</span> +<span id="290">290</span> +<span id="291">291</span> +<span id="292">292</span> +<span id="293">293</span> +<span id="294">294</span> +<span id="295">295</span> +<span id="296">296</span> +<span id="297">297</span> +<span id="298">298</span> +<span id="299">299</span> +<span id="300">300</span> +<span id="301">301</span> +<span id="302">302</span> +<span id="303">303</span> +<span id="304">304</span> +<span id="305">305</span> +<span id="306">306</span> +<span id="307">307</span> +<span id="308">308</span> +<span id="309">309</span> +<span id="310">310</span> +<span id="311">311</span> +<span id="312">312</span> +<span id="313">313</span> +<span id="314">314</span> +<span id="315">315</span> +<span id="316">316</span> +<span id="317">317</span> +<span id="318">318</span> +<span id="319">319</span> +<span id="320">320</span> +<span id="321">321</span> +<span id="322">322</span> +<span id="323">323</span> +<span id="324">324</span> +<span id="325">325</span> +<span id="326">326</span> +<span id="327">327</span> +<span id="328">328</span> +<span id="329">329</span> +<span id="330">330</span> +<span id="331">331</span> +<span id="332">332</span> +<span id="333">333</span> +<span id="334">334</span> +<span id="335">335</span> +<span id="336">336</span> +<span id="337">337</span> +<span id="338">338</span> +<span id="339">339</span> +<span id="340">340</span> +<span id="341">341</span> +<span id="342">342</span> +<span id="343">343</span> +<span id="344">344</span> +<span id="345">345</span> +<span id="346">346</span> +<span id="347">347</span> +<span id="348">348</span> +<span id="349">349</span> +<span id="350">350</span> +<span id="351">351</span> +<span id="352">352</span> +<span id="353">353</span> +<span id="354">354</span> +<span id="355">355</span> +<span id="356">356</span> +<span id="357">357</span> +<span id="358">358</span> +<span id="359">359</span> +<span id="360">360</span> +<span id="361">361</span> +<span id="362">362</span> +<span id="363">363</span> +<span id="364">364</span> +<span id="365">365</span> +<span id="366">366</span> +<span id="367">367</span> +<span id="368">368</span> +<span id="369">369</span> +<span id="370">370</span> +<span id="371">371</span> +<span id="372">372</span> +<span id="373">373</span> +<span id="374">374</span> +<span id="375">375</span> +<span id="376">376</span> +<span id="377">377</span> +<span id="378">378</span> +<span id="379">379</span> +<span id="380">380</span> +<span id="381">381</span> +<span id="382">382</span> +<span id="383">383</span> +<span id="384">384</span> +<span id="385">385</span> +<span id="386">386</span> +<span id="387">387</span> +<span id="388">388</span> +<span id="389">389</span> +<span id="390">390</span> +<span id="391">391</span> +<span id="392">392</span> +<span id="393">393</span> +<span id="394">394</span> +<span id="395">395</span> +<span id="396">396</span> +<span id="397">397</span> +<span id="398">398</span> +<span id="399">399</span> +<span id="400">400</span> +<span id="401">401</span> +<span id="402">402</span> +<span id="403">403</span> +<span id="404">404</span> +<span id="405">405</span> +<span id="406">406</span> +<span id="407">407</span> +<span id="408">408</span> +<span id="409">409</span> +<span id="410">410</span> +<span id="411">411</span> +<span id="412">412</span> +<span id="413">413</span> +<span id="414">414</span> +<span id="415">415</span> +<span id="416">416</span> +<span id="417">417</span> +<span id="418">418</span> +<span id="419">419</span> +<span id="420">420</span> +<span id="421">421</span> +<span id="422">422</span> +<span id="423">423</span> +<span id="424">424</span> +<span id="425">425</span> +<span id="426">426</span> +<span id="427">427</span> +<span id="428">428</span> +<span id="429">429</span> +<span id="430">430</span> +<span id="431">431</span> +<span id="432">432</span> +<span id="433">433</span> +<span id="434">434</span> +<span id="435">435</span> +<span id="436">436</span> +<span id="437">437</span> +<span id="438">438</span> +<span id="439">439</span> +<span id="440">440</span> +<span id="441">441</span> +<span id="442">442</span> +<span id="443">443</span> +<span id="444">444</span> +<span id="445">445</span> +<span id="446">446</span> +<span id="447">447</span> +<span id="448">448</span> +<span id="449">449</span> +<span id="450">450</span> +<span id="451">451</span> +<span id="452">452</span> +<span id="453">453</span> +<span id="454">454</span> +<span id="455">455</span> +<span id="456">456</span> +<span id="457">457</span> +<span id="458">458</span> +<span id="459">459</span> +<span id="460">460</span> +<span id="461">461</span> +<span id="462">462</span> +<span id="463">463</span> +<span id="464">464</span> +<span id="465">465</span> +<span id="466">466</span> +<span id="467">467</span> +<span id="468">468</span> +<span id="469">469</span> +<span id="470">470</span> +<span id="471">471</span> +<span id="472">472</span> +<span id="473">473</span> +<span id="474">474</span> +<span id="475">475</span> +<span id="476">476</span> +<span id="477">477</span> +<span id="478">478</span> +<span id="479">479</span> +<span id="480">480</span> +<span id="481">481</span> +<span id="482">482</span> +<span id="483">483</span> +<span id="484">484</span> +<span id="485">485</span> +<span id="486">486</span> +<span id="487">487</span> +<span id="488">488</span> +<span id="489">489</span> +<span id="490">490</span> +<span id="491">491</span> +<span id="492">492</span> +<span id="493">493</span> +<span id="494">494</span> +<span id="495">495</span> +<span id="496">496</span> +<span id="497">497</span> +<span id="498">498</span> +<span id="499">499</span> +<span id="500">500</span> +<span id="501">501</span> +<span id="502">502</span> +<span id="503">503</span> +<span id="504">504</span> +<span id="505">505</span> +<span id="506">506</span> +<span id="507">507</span> +<span id="508">508</span> +<span id="509">509</span> +<span id="510">510</span> +<span id="511">511</span> +<span id="512">512</span> +<span id="513">513</span> +<span id="514">514</span> +<span id="515">515</span> +<span id="516">516</span> +<span id="517">517</span> +<span id="518">518</span> +<span id="519">519</span> +<span id="520">520</span> +<span id="521">521</span> +<span id="522">522</span> +<span id="523">523</span> +<span id="524">524</span> +<span id="525">525</span> +<span id="526">526</span> +<span id="527">527</span> +<span id="528">528</span> +<span id="529">529</span> +<span id="530">530</span> +<span id="531">531</span> +<span id="532">532</span> +<span id="533">533</span> +<span id="534">534</span> +<span id="535">535</span> +<span id="536">536</span> +<span id="537">537</span> +<span id="538">538</span> +<span id="539">539</span> +<span id="540">540</span> +<span id="541">541</span> +<span id="542">542</span> +<span id="543">543</span> +<span id="544">544</span> +<span id="545">545</span> +<span id="546">546</span> +<span id="547">547</span> +<span id="548">548</span> +<span id="549">549</span> +<span id="550">550</span> +<span id="551">551</span> +<span id="552">552</span> +<span id="553">553</span> +<span id="554">554</span> +<span id="555">555</span> +<span id="556">556</span> +<span id="557">557</span> +<span id="558">558</span> +<span id="559">559</span> +<span id="560">560</span> +<span id="561">561</span> +<span id="562">562</span> +<span id="563">563</span> +<span id="564">564</span> +<span id="565">565</span> +<span id="566">566</span> +<span id="567">567</span> +<span id="568">568</span> +<span id="569">569</span> +<span id="570">570</span> +<span id="571">571</span> +<span id="572">572</span> +<span id="573">573</span> +<span id="574">574</span> +<span id="575">575</span> +<span id="576">576</span> +<span id="577">577</span> +<span id="578">578</span> +<span id="579">579</span> +<span id="580">580</span> +<span id="581">581</span> +<span id="582">582</span> +<span id="583">583</span> +<span id="584">584</span> +<span id="585">585</span> +<span id="586">586</span> +<span id="587">587</span> +<span id="588">588</span> +<span id="589">589</span> +<span id="590">590</span> +<span id="591">591</span> +<span id="592">592</span> +<span id="593">593</span> +<span id="594">594</span> +<span id="595">595</span> +<span id="596">596</span> +<span id="597">597</span> +<span id="598">598</span> +<span id="599">599</span> +<span id="600">600</span> +<span id="601">601</span> +<span id="602">602</span> +<span id="603">603</span> +<span id="604">604</span> +<span id="605">605</span> +<span id="606">606</span> +<span id="607">607</span> +<span id="608">608</span> +<span id="609">609</span> +<span id="610">610</span> +<span id="611">611</span> +<span id="612">612</span> +<span id="613">613</span> +<span id="614">614</span> +<span id="615">615</span> +<span id="616">616</span> +<span id="617">617</span> +<span id="618">618</span> +<span id="619">619</span> +<span id="620">620</span> +<span id="621">621</span> +<span id="622">622</span> +<span id="623">623</span> +<span id="624">624</span> +<span id="625">625</span> +<span id="626">626</span> +<span id="627">627</span> +<span id="628">628</span> +<span id="629">629</span> +<span id="630">630</span> +<span id="631">631</span> +<span id="632">632</span> +<span id="633">633</span> +<span id="634">634</span> +<span id="635">635</span> +<span id="636">636</span> +<span id="637">637</span> +<span id="638">638</span> +<span id="639">639</span> +<span id="640">640</span> +<span id="641">641</span> +<span id="642">642</span> +<span id="643">643</span> +<span id="644">644</span> +<span id="645">645</span> +<span id="646">646</span> +<span id="647">647</span> +<span id="648">648</span> +<span id="649">649</span> +<span id="650">650</span> +<span id="651">651</span> +<span id="652">652</span> +<span id="653">653</span> +<span id="654">654</span> +<span id="655">655</span> +<span id="656">656</span> +<span id="657">657</span> +<span id="658">658</span> +<span id="659">659</span> +<span id="660">660</span> +<span id="661">661</span> +<span id="662">662</span> +<span id="663">663</span> +<span id="664">664</span> +<span id="665">665</span> +<span id="666">666</span> +<span id="667">667</span> +<span id="668">668</span> +<span id="669">669</span> +<span id="670">670</span> +<span id="671">671</span> +<span id="672">672</span> +<span id="673">673</span> +<span id="674">674</span> +<span id="675">675</span> +<span id="676">676</span> +<span id="677">677</span> +<span id="678">678</span> +<span id="679">679</span> +<span id="680">680</span> +<span id="681">681</span> +<span id="682">682</span> +<span id="683">683</span> +<span id="684">684</span> +<span id="685">685</span> +<span id="686">686</span> +<span id="687">687</span> +<span id="688">688</span> +<span id="689">689</span> +<span id="690">690</span> +<span id="691">691</span> +<span id="692">692</span> +<span id="693">693</span> +<span id="694">694</span> +<span id="695">695</span> +<span id="696">696</span> +<span id="697">697</span> +<span id="698">698</span> +<span id="699">699</span> +<span id="700">700</span> +<span id="701">701</span> +<span id="702">702</span> +<span id="703">703</span> +<span id="704">704</span> +<span id="705">705</span> +<span id="706">706</span> +<span id="707">707</span> +<span id="708">708</span> +<span id="709">709</span> +<span id="710">710</span> +<span id="711">711</span> +<span id="712">712</span> +<span id="713">713</span> +<span id="714">714</span> +<span id="715">715</span> +<span id="716">716</span> +<span id="717">717</span> +<span id="718">718</span> +<span id="719">719</span> +<span id="720">720</span> +<span id="721">721</span> +<span id="722">722</span> +<span id="723">723</span> +<span id="724">724</span> +<span id="725">725</span> +<span id="726">726</span> +<span id="727">727</span> +<span id="728">728</span> +<span id="729">729</span> +<span id="730">730</span> +<span id="731">731</span> +<span id="732">732</span> +<span id="733">733</span> +<span id="734">734</span> +<span id="735">735</span> +<span id="736">736</span> +<span id="737">737</span> +<span id="738">738</span> +<span id="739">739</span> +<span id="740">740</span> +<span id="741">741</span> +<span id="742">742</span> +<span id="743">743</span> +<span id="744">744</span> +<span id="745">745</span> +<span id="746">746</span> +<span id="747">747</span> +<span id="748">748</span> +<span id="749">749</span> +<span id="750">750</span> +<span id="751">751</span> +<span id="752">752</span> +<span id="753">753</span> +<span id="754">754</span> +<span id="755">755</span> +<span id="756">756</span> +<span id="757">757</span> +<span id="758">758</span> +<span id="759">759</span> +<span id="760">760</span> +<span id="761">761</span> +<span id="762">762</span> +<span id="763">763</span> +<span id="764">764</span> +<span id="765">765</span> +<span id="766">766</span> +<span id="767">767</span> +<span id="768">768</span> +<span id="769">769</span> +<span id="770">770</span> +<span id="771">771</span> +<span id="772">772</span> +<span id="773">773</span> +<span id="774">774</span> +<span id="775">775</span> +<span id="776">776</span> +<span id="777">777</span> +<span id="778">778</span> +<span id="779">779</span> +<span id="780">780</span> +<span id="781">781</span> +<span id="782">782</span> +<span id="783">783</span> +<span id="784">784</span> +<span id="785">785</span> +<span id="786">786</span> +<span id="787">787</span> +<span id="788">788</span> +<span id="789">789</span> +<span id="790">790</span> +<span id="791">791</span> +<span id="792">792</span> +<span id="793">793</span> +<span id="794">794</span> +<span id="795">795</span> +<span id="796">796</span> +<span id="797">797</span> +<span id="798">798</span> +<span id="799">799</span> +<span id="800">800</span> +<span id="801">801</span> +<span id="802">802</span> +<span id="803">803</span> +<span id="804">804</span> +<span id="805">805</span> +<span id="806">806</span> +<span id="807">807</span> +<span id="808">808</span> +<span id="809">809</span> +<span id="810">810</span> +<span id="811">811</span> +<span id="812">812</span> +<span id="813">813</span> +<span id="814">814</span> +<span id="815">815</span> +<span id="816">816</span> +<span id="817">817</span> +<span id="818">818</span> +<span id="819">819</span> +<span id="820">820</span> +<span id="821">821</span> +<span id="822">822</span> +<span id="823">823</span> +<span id="824">824</span> +<span id="825">825</span> +<span id="826">826</span> +<span id="827">827</span> +<span id="828">828</span> +<span id="829">829</span> +<span id="830">830</span> +<span id="831">831</span> +<span id="832">832</span> +<span id="833">833</span> +<span id="834">834</span> +<span id="835">835</span> +<span id="836">836</span> +<span id="837">837</span> +<span id="838">838</span> +<span id="839">839</span> +<span id="840">840</span> +<span id="841">841</span> +<span id="842">842</span> +<span id="843">843</span> +<span id="844">844</span> +<span id="845">845</span> +<span id="846">846</span> +<span id="847">847</span> +<span id="848">848</span> +<span id="849">849</span> +<span id="850">850</span> +<span id="851">851</span> +<span id="852">852</span> +<span id="853">853</span> +<span id="854">854</span> +<span id="855">855</span> +<span id="856">856</span> +<span id="857">857</span> +<span id="858">858</span> +<span id="859">859</span> +<span id="860">860</span> +<span id="861">861</span> +<span id="862">862</span> +<span id="863">863</span> +<span id="864">864</span> +<span id="865">865</span> +<span id="866">866</span> +<span id="867">867</span> +<span id="868">868</span> +<span id="869">869</span> +<span id="870">870</span> +<span id="871">871</span> +<span id="872">872</span> +<span id="873">873</span> +<span id="874">874</span> +<span id="875">875</span> +<span id="876">876</span> +<span id="877">877</span> +<span id="878">878</span> +<span id="879">879</span> +<span id="880">880</span> +<span id="881">881</span> +<span id="882">882</span> +<span id="883">883</span> +<span id="884">884</span> +<span id="885">885</span> +<span id="886">886</span> +<span id="887">887</span> +<span id="888">888</span> +<span id="889">889</span> +<span id="890">890</span> +<span id="891">891</span> +<span id="892">892</span> +<span id="893">893</span> +<span id="894">894</span> +<span id="895">895</span> +<span id="896">896</span> +<span id="897">897</span> +<span id="898">898</span> +<span id="899">899</span> +<span id="900">900</span> +<span id="901">901</span> +<span id="902">902</span> +<span id="903">903</span> +<span id="904">904</span> +<span id="905">905</span> +<span id="906">906</span> +<span id="907">907</span> +<span id="908">908</span> +<span id="909">909</span> +<span id="910">910</span> +<span id="911">911</span> +<span id="912">912</span> +<span id="913">913</span> +<span id="914">914</span> +<span id="915">915</span> +<span id="916">916</span> +<span id="917">917</span> +<span id="918">918</span> +<span id="919">919</span> +<span id="920">920</span> +<span id="921">921</span> +<span id="922">922</span> +<span id="923">923</span> +<span id="924">924</span> +<span id="925">925</span> +<span id="926">926</span> +<span id="927">927</span> +<span id="928">928</span> +<span id="929">929</span> +<span id="930">930</span> +<span id="931">931</span> +<span id="932">932</span> +<span id="933">933</span> +<span id="934">934</span> +<span id="935">935</span> +<span id="936">936</span> +<span id="937">937</span> +<span id="938">938</span> +<span id="939">939</span> +<span id="940">940</span> +<span id="941">941</span> +<span id="942">942</span> +<span id="943">943</span> +<span id="944">944</span> +<span id="945">945</span> +<span id="946">946</span> +<span id="947">947</span> +<span id="948">948</span> +<span id="949">949</span> +<span id="950">950</span> +<span id="951">951</span> +<span id="952">952</span> +<span id="953">953</span> +<span id="954">954</span> +<span id="955">955</span> +<span id="956">956</span> +<span id="957">957</span> +<span id="958">958</span> +<span id="959">959</span> +<span id="960">960</span> +<span id="961">961</span> +<span id="962">962</span> +<span id="963">963</span> +<span id="964">964</span> +<span id="965">965</span> +<span id="966">966</span> +<span id="967">967</span> +<span id="968">968</span> +<span id="969">969</span> +<span id="970">970</span> +<span id="971">971</span> +<span id="972">972</span> +<span id="973">973</span> +<span id="974">974</span> +<span id="975">975</span> +<span id="976">976</span> +<span id="977">977</span> +<span id="978">978</span> +<span id="979">979</span> +<span id="980">980</span> +<span id="981">981</span> +<span id="982">982</span> +<span id="983">983</span> +<span id="984">984</span> +<span id="985">985</span> +<span id="986">986</span> +<span id="987">987</span> +<span id="988">988</span> +<span id="989">989</span> +<span id="990">990</span> +<span id="991">991</span> +<span id="992">992</span> +<span id="993">993</span> +<span id="994">994</span> +<span id="995">995</span> +<span id="996">996</span> +<span id="997">997</span> +<span id="998">998</span> +<span id="999">999</span> +<span id="1000">1000</span> +<span id="1001">1001</span> +<span id="1002">1002</span> +<span id="1003">1003</span> +<span id="1004">1004</span> +<span id="1005">1005</span> +<span id="1006">1006</span> +<span id="1007">1007</span> +<span id="1008">1008</span> +<span id="1009">1009</span> +<span id="1010">1010</span> +<span id="1011">1011</span> +<span id="1012">1012</span> +<span id="1013">1013</span> +<span id="1014">1014</span> +<span id="1015">1015</span> +<span id="1016">1016</span> +<span id="1017">1017</span> +<span id="1018">1018</span> +<span id="1019">1019</span> +<span id="1020">1020</span> +<span id="1021">1021</span> +<span id="1022">1022</span> +<span id="1023">1023</span> +<span id="1024">1024</span> +<span id="1025">1025</span> +<span id="1026">1026</span> +<span id="1027">1027</span> +<span id="1028">1028</span> +<span id="1029">1029</span> +<span id="1030">1030</span> +<span id="1031">1031</span> +<span id="1032">1032</span> +<span id="1033">1033</span> +<span id="1034">1034</span> +<span id="1035">1035</span> +<span id="1036">1036</span> +<span id="1037">1037</span> +<span id="1038">1038</span> +<span id="1039">1039</span> +<span id="1040">1040</span> +<span id="1041">1041</span> +<span id="1042">1042</span> +<span id="1043">1043</span> +<span id="1044">1044</span> +<span id="1045">1045</span> +<span id="1046">1046</span> +<span id="1047">1047</span> +<span id="1048">1048</span> +<span id="1049">1049</span> +<span id="1050">1050</span> +<span id="1051">1051</span> +<span id="1052">1052</span> +<span id="1053">1053</span> +<span id="1054">1054</span> +<span id="1055">1055</span> +<span id="1056">1056</span> +<span id="1057">1057</span> +<span id="1058">1058</span> +<span id="1059">1059</span> +<span id="1060">1060</span> +<span id="1061">1061</span> +<span id="1062">1062</span> +<span id="1063">1063</span> +<span id="1064">1064</span> +<span id="1065">1065</span> +<span id="1066">1066</span> +<span id="1067">1067</span> +<span id="1068">1068</span> +<span id="1069">1069</span> +<span id="1070">1070</span> +<span id="1071">1071</span> +<span id="1072">1072</span> +<span id="1073">1073</span> +<span id="1074">1074</span> +<span id="1075">1075</span> +<span id="1076">1076</span> +<span id="1077">1077</span> +<span id="1078">1078</span> +<span id="1079">1079</span> +<span id="1080">1080</span> +<span id="1081">1081</span> +<span id="1082">1082</span> +<span id="1083">1083</span> +<span id="1084">1084</span> +<span id="1085">1085</span> +<span id="1086">1086</span> +<span id="1087">1087</span> +<span id="1088">1088</span> +<span id="1089">1089</span> +<span id="1090">1090</span> +<span id="1091">1091</span> +<span id="1092">1092</span> +<span id="1093">1093</span> +<span id="1094">1094</span> +<span id="1095">1095</span> +<span id="1096">1096</span> +<span id="1097">1097</span> +<span id="1098">1098</span> +<span id="1099">1099</span> +<span id="1100">1100</span> +<span id="1101">1101</span> +<span id="1102">1102</span> +<span id="1103">1103</span> +<span id="1104">1104</span> +<span id="1105">1105</span> +<span id="1106">1106</span> +<span id="1107">1107</span> +<span id="1108">1108</span> +<span id="1109">1109</span> +<span id="1110">1110</span> +<span id="1111">1111</span> +<span id="1112">1112</span> +<span id="1113">1113</span> +<span id="1114">1114</span> +<span id="1115">1115</span> +<span id="1116">1116</span> +<span id="1117">1117</span> +<span id="1118">1118</span> +<span id="1119">1119</span> +<span id="1120">1120</span> +<span id="1121">1121</span> +<span id="1122">1122</span> +<span id="1123">1123</span> +<span id="1124">1124</span> +<span id="1125">1125</span> +<span id="1126">1126</span> +<span id="1127">1127</span> +<span id="1128">1128</span> +<span id="1129">1129</span> +<span id="1130">1130</span> +<span id="1131">1131</span> +<span id="1132">1132</span> +<span id="1133">1133</span> +<span id="1134">1134</span> +<span id="1135">1135</span> +<span id="1136">1136</span> +<span id="1137">1137</span> +<span id="1138">1138</span> +<span id="1139">1139</span> +<span id="1140">1140</span> +<span id="1141">1141</span> +<span id="1142">1142</span> +<span id="1143">1143</span> +<span id="1144">1144</span> +<span id="1145">1145</span> +<span id="1146">1146</span> +<span id="1147">1147</span> +<span id="1148">1148</span> +<span id="1149">1149</span> +<span id="1150">1150</span> +<span id="1151">1151</span> +<span id="1152">1152</span> +<span id="1153">1153</span> +<span id="1154">1154</span> +<span id="1155">1155</span> +<span id="1156">1156</span> +<span id="1157">1157</span> +<span id="1158">1158</span> +<span id="1159">1159</span> +<span id="1160">1160</span> +<span id="1161">1161</span> +<span id="1162">1162</span> +<span id="1163">1163</span> +<span id="1164">1164</span> +<span id="1165">1165</span> +<span id="1166">1166</span> +<span id="1167">1167</span> +<span id="1168">1168</span> +<span id="1169">1169</span> +<span id="1170">1170</span> +<span id="1171">1171</span> +<span id="1172">1172</span> +<span id="1173">1173</span> +<span id="1174">1174</span> +<span id="1175">1175</span> +<span id="1176">1176</span> +<span id="1177">1177</span> +<span id="1178">1178</span> +<span id="1179">1179</span> +<span id="1180">1180</span> +<span id="1181">1181</span> +<span id="1182">1182</span> +<span id="1183">1183</span> +<span id="1184">1184</span> +<span id="1185">1185</span> +<span id="1186">1186</span> +<span id="1187">1187</span> +<span id="1188">1188</span> +<span id="1189">1189</span> +<span id="1190">1190</span> +<span id="1191">1191</span> +<span id="1192">1192</span> +<span id="1193">1193</span> +<span id="1194">1194</span> +<span id="1195">1195</span> +<span id="1196">1196</span> +<span id="1197">1197</span> +<span id="1198">1198</span> +<span id="1199">1199</span> +<span id="1200">1200</span> +<span id="1201">1201</span> +<span id="1202">1202</span> +<span id="1203">1203</span> +<span id="1204">1204</span> +<span id="1205">1205</span> +<span id="1206">1206</span> +<span id="1207">1207</span> +<span id="1208">1208</span> +<span id="1209">1209</span> +<span id="1210">1210</span> +<span id="1211">1211</span> +<span id="1212">1212</span> +<span id="1213">1213</span> +<span id="1214">1214</span> +<span id="1215">1215</span> +<span id="1216">1216</span> +<span id="1217">1217</span> +<span id="1218">1218</span> +<span id="1219">1219</span> +<span id="1220">1220</span> +<span id="1221">1221</span> +<span id="1222">1222</span> +<span id="1223">1223</span> +<span id="1224">1224</span> +<span id="1225">1225</span> +<span id="1226">1226</span> +<span id="1227">1227</span> +<span id="1228">1228</span> +<span id="1229">1229</span> +<span id="1230">1230</span> +<span id="1231">1231</span> +<span id="1232">1232</span> +<span id="1233">1233</span> +<span id="1234">1234</span> +<span id="1235">1235</span> +<span id="1236">1236</span> +<span id="1237">1237</span> +<span id="1238">1238</span> +<span id="1239">1239</span> +<span id="1240">1240</span> +<span id="1241">1241</span> +<span id="1242">1242</span> +<span id="1243">1243</span> +<span id="1244">1244</span> +<span id="1245">1245</span> +<span id="1246">1246</span> +<span id="1247">1247</span> +<span id="1248">1248</span> +<span id="1249">1249</span> +<span id="1250">1250</span> +<span id="1251">1251</span> +<span id="1252">1252</span> +<span id="1253">1253</span> +<span id="1254">1254</span> +<span id="1255">1255</span> +<span id="1256">1256</span> +<span id="1257">1257</span> +<span id="1258">1258</span> +<span id="1259">1259</span> +<span id="1260">1260</span> +<span id="1261">1261</span> +<span id="1262">1262</span> +<span id="1263">1263</span> +<span id="1264">1264</span> +<span id="1265">1265</span> +<span id="1266">1266</span> +<span id="1267">1267</span> +<span id="1268">1268</span> +<span id="1269">1269</span> +<span id="1270">1270</span> +<span id="1271">1271</span> +<span id="1272">1272</span> +<span id="1273">1273</span> +<span id="1274">1274</span> +<span id="1275">1275</span> +<span id="1276">1276</span> +<span id="1277">1277</span> +<span id="1278">1278</span> +<span id="1279">1279</span> +<span id="1280">1280</span> +<span id="1281">1281</span> +<span id="1282">1282</span> +<span id="1283">1283</span> +<span id="1284">1284</span> +<span id="1285">1285</span> +<span id="1286">1286</span> +<span id="1287">1287</span> +<span id="1288">1288</span> +<span id="1289">1289</span> +<span id="1290">1290</span> +<span id="1291">1291</span> +<span id="1292">1292</span> +<span id="1293">1293</span> +<span id="1294">1294</span> +<span id="1295">1295</span> +<span id="1296">1296</span> +<span id="1297">1297</span> +<span id="1298">1298</span> +<span id="1299">1299</span> +<span id="1300">1300</span> +<span id="1301">1301</span> +<span id="1302">1302</span> +<span id="1303">1303</span> +<span id="1304">1304</span> +<span id="1305">1305</span> +<span id="1306">1306</span> +<span id="1307">1307</span> +<span id="1308">1308</span> +<span id="1309">1309</span> +<span id="1310">1310</span> +<span id="1311">1311</span> +<span id="1312">1312</span> +<span id="1313">1313</span> +<span id="1314">1314</span> +<span id="1315">1315</span> +<span id="1316">1316</span> +<span id="1317">1317</span> +<span id="1318">1318</span> +<span id="1319">1319</span> +<span id="1320">1320</span> +<span id="1321">1321</span> +<span id="1322">1322</span> +<span id="1323">1323</span> +<span id="1324">1324</span> +<span id="1325">1325</span> +<span id="1326">1326</span> +<span id="1327">1327</span> +<span id="1328">1328</span> +<span id="1329">1329</span> +<span id="1330">1330</span> +<span id="1331">1331</span> +<span id="1332">1332</span> +<span id="1333">1333</span> +<span id="1334">1334</span> +<span id="1335">1335</span> +<span id="1336">1336</span> +<span id="1337">1337</span> +<span id="1338">1338</span> +<span id="1339">1339</span> +<span id="1340">1340</span> +<span id="1341">1341</span> +<span id="1342">1342</span> +<span id="1343">1343</span> +<span id="1344">1344</span> +<span id="1345">1345</span> +<span id="1346">1346</span> +<span id="1347">1347</span> +<span id="1348">1348</span> +<span id="1349">1349</span> +<span id="1350">1350</span> +<span id="1351">1351</span> +<span id="1352">1352</span> +<span id="1353">1353</span> +<span id="1354">1354</span> +<span id="1355">1355</span> +<span id="1356">1356</span> +<span id="1357">1357</span> +<span id="1358">1358</span> +<span id="1359">1359</span> +<span id="1360">1360</span> +<span id="1361">1361</span> +<span id="1362">1362</span> +<span id="1363">1363</span> +<span id="1364">1364</span> +<span id="1365">1365</span> +<span id="1366">1366</span> +<span id="1367">1367</span> +<span id="1368">1368</span> +<span id="1369">1369</span> +<span id="1370">1370</span> +<span id="1371">1371</span> +<span id="1372">1372</span> +<span id="1373">1373</span> +<span id="1374">1374</span> +<span id="1375">1375</span> +<span id="1376">1376</span> +<span id="1377">1377</span> +<span id="1378">1378</span> +<span id="1379">1379</span> +<span id="1380">1380</span> +<span id="1381">1381</span> +<span id="1382">1382</span> +<span id="1383">1383</span> +<span id="1384">1384</span> +<span id="1385">1385</span> +<span id="1386">1386</span> +<span id="1387">1387</span> +<span id="1388">1388</span> +<span id="1389">1389</span> +<span id="1390">1390</span> +<span id="1391">1391</span> +<span id="1392">1392</span> +<span id="1393">1393</span> +<span id="1394">1394</span> +<span id="1395">1395</span> +<span id="1396">1396</span> +<span id="1397">1397</span> +<span id="1398">1398</span> +<span id="1399">1399</span> +<span id="1400">1400</span> +<span id="1401">1401</span> +<span id="1402">1402</span> +<span id="1403">1403</span> +<span id="1404">1404</span> +<span id="1405">1405</span> +<span id="1406">1406</span> +<span id="1407">1407</span> +<span id="1408">1408</span> +<span id="1409">1409</span> +<span id="1410">1410</span> +<span id="1411">1411</span> +<span id="1412">1412</span> +<span id="1413">1413</span> +<span id="1414">1414</span> +<span id="1415">1415</span> +<span id="1416">1416</span> +<span id="1417">1417</span> +<span id="1418">1418</span> +<span id="1419">1419</span> +<span id="1420">1420</span> +<span id="1421">1421</span> +<span id="1422">1422</span> +<span id="1423">1423</span> +<span id="1424">1424</span> +<span id="1425">1425</span> +<span id="1426">1426</span> +<span id="1427">1427</span> +<span id="1428">1428</span> +<span id="1429">1429</span> +<span id="1430">1430</span> +<span id="1431">1431</span> +<span id="1432">1432</span> +<span id="1433">1433</span> +<span id="1434">1434</span> +<span id="1435">1435</span> +<span id="1436">1436</span> +<span id="1437">1437</span> +<span id="1438">1438</span> +<span id="1439">1439</span> +<span id="1440">1440</span> +<span id="1441">1441</span> +<span id="1442">1442</span> +<span id="1443">1443</span> +<span id="1444">1444</span> +<span id="1445">1445</span> +<span id="1446">1446</span> +<span id="1447">1447</span> +<span id="1448">1448</span> +<span id="1449">1449</span> +<span id="1450">1450</span> +<span id="1451">1451</span> +<span id="1452">1452</span> +<span id="1453">1453</span> +<span id="1454">1454</span> +<span id="1455">1455</span> +<span id="1456">1456</span> +<span id="1457">1457</span> +<span id="1458">1458</span> +<span id="1459">1459</span> +<span id="1460">1460</span> +<span id="1461">1461</span> +<span id="1462">1462</span> +<span id="1463">1463</span> +<span id="1464">1464</span> +<span id="1465">1465</span> +<span id="1466">1466</span> +<span id="1467">1467</span> +<span id="1468">1468</span> +<span id="1469">1469</span> +<span id="1470">1470</span> +<span id="1471">1471</span> +<span id="1472">1472</span> +<span id="1473">1473</span> +<span id="1474">1474</span> +<span id="1475">1475</span> +<span id="1476">1476</span> +<span id="1477">1477</span> +<span id="1478">1478</span> +<span id="1479">1479</span> +<span id="1480">1480</span> +</pre><pre class="rust"><code><span class="kw">use </span>core::iter::FromIterator; +<span class="kw">use </span>core::mem::{<span class="self">self</span>, ManuallyDrop}; +<span class="kw">use </span>core::ops::{Deref, RangeBounds}; +<span class="kw">use </span>core::{cmp, fmt, hash, ptr, slice, usize}; + +<span class="kw">use </span>alloc::{ + alloc::{dealloc, Layout}, + borrow::Borrow, + boxed::Box, + string::String, + vec::Vec, +}; + +<span class="kw">use </span><span class="kw">crate</span>::buf::IntoIter; +<span class="attr">#[allow(unused)] +</span><span class="kw">use </span><span class="kw">crate</span>::loom::sync::atomic::AtomicMut; +<span class="kw">use </span><span class="kw">crate</span>::loom::sync::atomic::{AtomicPtr, AtomicUsize, Ordering}; +<span class="kw">use crate</span>::{offset_from, Buf, BytesMut}; + +<span class="doccomment">/// A cheaply cloneable and sliceable chunk of contiguous memory. +/// +/// `Bytes` is an efficient container for storing and operating on contiguous +/// slices of memory. It is intended for use primarily in networking code, but +/// could have applications elsewhere as well. +/// +/// `Bytes` values facilitate zero-copy network programming by allowing multiple +/// `Bytes` objects to point to the same underlying memory. +/// +/// `Bytes` does not have a single implementation. It is an interface, whose +/// exact behavior is implemented through dynamic dispatch in several underlying +/// implementations of `Bytes`. +/// +/// All `Bytes` implementations must fulfill the following requirements: +/// - They are cheaply cloneable and thereby shareable between an unlimited amount +/// of components, for example by modifying a reference count. +/// - Instances can be sliced to refer to a subset of the original buffer. +/// +/// ``` +/// use bytes::Bytes; +/// +/// let mut mem = Bytes::from("Hello world"); +/// let a = mem.slice(0..5); +/// +/// assert_eq!(a, "Hello"); +/// +/// let b = mem.split_to(6); +/// +/// assert_eq!(mem, "world"); +/// assert_eq!(b, "Hello "); +/// ``` +/// +/// # Memory layout +/// +/// The `Bytes` struct itself is fairly small, limited to 4 `usize` fields used +/// to track information about which segment of the underlying memory the +/// `Bytes` handle has access to. +/// +/// `Bytes` keeps both a pointer to the shared state containing the full memory +/// slice and a pointer to the start of the region visible by the handle. +/// `Bytes` also tracks the length of its view into the memory. +/// +/// # Sharing +/// +/// `Bytes` contains a vtable, which allows implementations of `Bytes` to define +/// how sharing/cloning is implemented in detail. +/// When `Bytes::clone()` is called, `Bytes` will call the vtable function for +/// cloning the backing storage in order to share it behind multiple `Bytes` +/// instances. +/// +/// For `Bytes` implementations which refer to constant memory (e.g. created +/// via `Bytes::from_static()`) the cloning implementation will be a no-op. +/// +/// For `Bytes` implementations which point to a reference counted shared storage +/// (e.g. an `Arc<[u8]>`), sharing will be implemented by increasing the +/// reference count. +/// +/// Due to this mechanism, multiple `Bytes` instances may point to the same +/// shared memory region. +/// Each `Bytes` instance can point to different sections within that +/// memory region, and `Bytes` instances may or may not have overlapping views +/// into the memory. +/// +/// The following diagram visualizes a scenario where 2 `Bytes` instances make +/// use of an `Arc`-based backing storage, and provide access to different views: +/// +/// ```text +/// +/// Arc ptrs ┌─────────┐ +/// ________________________ / │ Bytes 2 │ +/// / └─────────┘ +/// / ┌───────────┐ | | +/// |_________/ │ Bytes 1 │ | | +/// | └───────────┘ | | +/// | | | ___/ data | tail +/// | data | tail |/ | +/// v v v v +/// ┌─────┬─────┬───────────┬───────────────┬─────┐ +/// │ Arc │ │ │ │ │ +/// └─────┴─────┴───────────┴───────────────┴─────┘ +/// ``` +</span><span class="kw">pub struct </span>Bytes { + ptr: <span class="kw-2">*const </span>u8, + len: usize, + <span class="comment">// inlined "trait object" + </span>data: AtomicPtr<()>, + vtable: <span class="kw-2">&</span><span class="lifetime">'static </span>Vtable, +} + +<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>Vtable { + <span class="doccomment">/// fn(data, ptr, len) + </span><span class="kw">pub </span>clone: <span class="kw">unsafe fn</span>(<span class="kw-2">&</span>AtomicPtr<()>, <span class="kw-2">*const </span>u8, usize) -> Bytes, + <span class="doccomment">/// fn(data, ptr, len) + /// + /// takes `Bytes` to value + </span><span class="kw">pub </span>to_vec: <span class="kw">unsafe fn</span>(<span class="kw-2">&</span>AtomicPtr<()>, <span class="kw-2">*const </span>u8, usize) -> Vec<u8>, + <span class="kw">pub </span>to_mut: <span class="kw">unsafe fn</span>(<span class="kw-2">&</span>AtomicPtr<()>, <span class="kw-2">*const </span>u8, usize) -> BytesMut, + <span class="doccomment">/// fn(data) + </span><span class="kw">pub </span>is_unique: <span class="kw">unsafe fn</span>(<span class="kw-2">&</span>AtomicPtr<()>) -> bool, + <span class="doccomment">/// fn(data, ptr, len) + </span><span class="kw">pub </span>drop: <span class="kw">unsafe fn</span>(<span class="kw-2">&mut </span>AtomicPtr<()>, <span class="kw-2">*const </span>u8, usize), +} + +<span class="kw">impl </span>Bytes { + <span class="doccomment">/// Creates a new empty `Bytes`. + /// + /// This will not allocate and the returned `Bytes` handle will be empty. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let b = Bytes::new(); + /// assert_eq!(&b[..], b""); + /// ``` + </span><span class="attr">#[inline] + #[cfg(not(all(loom, test)))] + </span><span class="kw">pub const fn </span>new() -> <span class="self">Self </span>{ + <span class="comment">// Make it a named const to work around + // "unsizing casts are not allowed in const fn" + </span><span class="kw">const </span>EMPTY: <span class="kw-2">&</span>[u8] = <span class="kw-2">&</span>[]; + Bytes::from_static(EMPTY) + } + + <span class="attr">#[cfg(all(loom, test))] + </span><span class="kw">pub fn </span>new() -> <span class="self">Self </span>{ + <span class="kw">const </span>EMPTY: <span class="kw-2">&</span>[u8] = <span class="kw-2">&</span>[]; + Bytes::from_static(EMPTY) + } + + <span class="doccomment">/// Creates a new `Bytes` from a static slice. + /// + /// The returned `Bytes` will point directly to the static slice. There is + /// no allocating or copying. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let b = Bytes::from_static(b"hello"); + /// assert_eq!(&b[..], b"hello"); + /// ``` + </span><span class="attr">#[inline] + #[cfg(not(all(loom, test)))] + </span><span class="kw">pub const fn </span>from_static(bytes: <span class="kw-2">&</span><span class="lifetime">'static </span>[u8]) -> <span class="self">Self </span>{ + Bytes { + ptr: bytes.as_ptr(), + len: bytes.len(), + data: AtomicPtr::new(ptr::null_mut()), + vtable: <span class="kw-2">&</span>STATIC_VTABLE, + } + } + + <span class="attr">#[cfg(all(loom, test))] + </span><span class="kw">pub fn </span>from_static(bytes: <span class="kw-2">&</span><span class="lifetime">'static </span>[u8]) -> <span class="self">Self </span>{ + Bytes { + ptr: bytes.as_ptr(), + len: bytes.len(), + data: AtomicPtr::new(ptr::null_mut()), + vtable: <span class="kw-2">&</span>STATIC_VTABLE, + } + } + + <span class="doccomment">/// Returns the number of bytes contained in this `Bytes`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let b = Bytes::from(&b"hello"[..]); + /// assert_eq!(b.len(), 5); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub const fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len + } + + <span class="doccomment">/// Returns true if the `Bytes` has a length of 0. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let b = Bytes::new(); + /// assert!(b.is_empty()); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub const fn </span>is_empty(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + <span class="self">self</span>.len == <span class="number">0 + </span>} + + <span class="doccomment">/// Returns true if this is the only reference to the data. + /// + /// Always returns false if the data is backed by a static slice. + /// + /// The result of this method may be invalidated immediately if another + /// thread clones this value while this is being called. Ensure you have + /// unique access to this value (`&mut Bytes`) first if you need to be + /// certain the result is valid (i.e. for safety reasons) + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let a = Bytes::from(vec![1, 2, 3]); + /// assert!(a.is_unique()); + /// let b = a.clone(); + /// assert!(!a.is_unique()); + /// ``` + </span><span class="kw">pub fn </span>is_unique(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + <span class="kw">unsafe </span>{ (<span class="self">self</span>.vtable.is_unique)(<span class="kw-2">&</span><span class="self">self</span>.data) } + } + + <span class="doccomment">/// Creates `Bytes` instance from slice, by copying it. + </span><span class="kw">pub fn </span>copy_from_slice(data: <span class="kw-2">&</span>[u8]) -> <span class="self">Self </span>{ + data.to_vec().into() + } + + <span class="doccomment">/// Returns a slice of self for the provided range. + /// + /// This will increment the reference count for the underlying memory and + /// return a new `Bytes` handle set to the slice. + /// + /// This operation is `O(1)`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let a = Bytes::from(&b"hello world"[..]); + /// let b = a.slice(2..5); + /// + /// assert_eq!(&b[..], b"llo"); + /// ``` + /// + /// # Panics + /// + /// Requires that `begin <= end` and `end <= self.len()`, otherwise slicing + /// will panic. + </span><span class="kw">pub fn </span>slice(<span class="kw-2">&</span><span class="self">self</span>, range: <span class="kw">impl </span>RangeBounds<usize>) -> <span class="self">Self </span>{ + <span class="kw">use </span>core::ops::Bound; + + <span class="kw">let </span>len = <span class="self">self</span>.len(); + + <span class="kw">let </span>begin = <span class="kw">match </span>range.start_bound() { + Bound::Included(<span class="kw-2">&</span>n) => n, + Bound::Excluded(<span class="kw-2">&</span>n) => n.checked_add(<span class="number">1</span>).expect(<span class="string">"out of range"</span>), + Bound::Unbounded => <span class="number">0</span>, + }; + + <span class="kw">let </span>end = <span class="kw">match </span>range.end_bound() { + Bound::Included(<span class="kw-2">&</span>n) => n.checked_add(<span class="number">1</span>).expect(<span class="string">"out of range"</span>), + Bound::Excluded(<span class="kw-2">&</span>n) => n, + Bound::Unbounded => len, + }; + + <span class="macro">assert!</span>( + begin <= end, + <span class="string">"range start must not be greater than end: {:?} <= {:?}"</span>, + begin, + end, + ); + <span class="macro">assert!</span>( + end <= len, + <span class="string">"range end out of bounds: {:?} <= {:?}"</span>, + end, + len, + ); + + <span class="kw">if </span>end == begin { + <span class="kw">return </span>Bytes::new(); + } + + <span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="self">self</span>.clone(); + + ret.len = end - begin; + ret.ptr = <span class="kw">unsafe </span>{ ret.ptr.add(begin) }; + + ret + } + + <span class="doccomment">/// Returns a slice of self that is equivalent to the given `subset`. + /// + /// When processing a `Bytes` buffer with other tools, one often gets a + /// `&[u8]` which is in fact a slice of the `Bytes`, i.e. a subset of it. + /// This function turns that `&[u8]` into another `Bytes`, as if one had + /// called `self.slice()` with the offsets that correspond to `subset`. + /// + /// This operation is `O(1)`. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let bytes = Bytes::from(&b"012345678"[..]); + /// let as_slice = bytes.as_ref(); + /// let subset = &as_slice[2..6]; + /// let subslice = bytes.slice_ref(&subset); + /// assert_eq!(&subslice[..], b"2345"); + /// ``` + /// + /// # Panics + /// + /// Requires that the given `sub` slice is in fact contained within the + /// `Bytes` buffer; otherwise this function will panic. + </span><span class="kw">pub fn </span>slice_ref(<span class="kw-2">&</span><span class="self">self</span>, subset: <span class="kw-2">&</span>[u8]) -> <span class="self">Self </span>{ + <span class="comment">// Empty slice and empty Bytes may have their pointers reset + // so explicitly allow empty slice to be a subslice of any slice. + </span><span class="kw">if </span>subset.is_empty() { + <span class="kw">return </span>Bytes::new(); + } + + <span class="kw">let </span>bytes_p = <span class="self">self</span>.as_ptr() <span class="kw">as </span>usize; + <span class="kw">let </span>bytes_len = <span class="self">self</span>.len(); + + <span class="kw">let </span>sub_p = subset.as_ptr() <span class="kw">as </span>usize; + <span class="kw">let </span>sub_len = subset.len(); + + <span class="macro">assert!</span>( + sub_p >= bytes_p, + <span class="string">"subset pointer ({:p}) is smaller than self pointer ({:p})"</span>, + subset.as_ptr(), + <span class="self">self</span>.as_ptr(), + ); + <span class="macro">assert!</span>( + sub_p + sub_len <= bytes_p + bytes_len, + <span class="string">"subset is out of bounds: self = ({:p}, {}), subset = ({:p}, {})"</span>, + <span class="self">self</span>.as_ptr(), + bytes_len, + subset.as_ptr(), + sub_len, + ); + + <span class="kw">let </span>sub_offset = sub_p - bytes_p; + + <span class="self">self</span>.slice(sub_offset..(sub_offset + sub_len)) + } + + <span class="doccomment">/// Splits the bytes into two at the given index. + /// + /// Afterwards `self` contains elements `[0, at)`, and the returned `Bytes` + /// contains elements `[at, len)`. + /// + /// This is an `O(1)` operation that just increases the reference count and + /// sets a few indices. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let mut a = Bytes::from(&b"hello world"[..]); + /// let b = a.split_off(5); + /// + /// assert_eq!(&a[..], b"hello"); + /// assert_eq!(&b[..], b" world"); + /// ``` + /// + /// # Panics + /// + /// Panics if `at > len`. + </span><span class="attr">#[must_use = <span class="string">"consider Bytes::truncate if you don't need the other half"</span>] + </span><span class="kw">pub fn </span>split_off(<span class="kw-2">&mut </span><span class="self">self</span>, at: usize) -> <span class="self">Self </span>{ + <span class="kw">if </span>at == <span class="self">self</span>.len() { + <span class="kw">return </span>Bytes::new(); + } + + <span class="kw">if </span>at == <span class="number">0 </span>{ + <span class="kw">return </span>mem::replace(<span class="self">self</span>, Bytes::new()); + } + + <span class="macro">assert!</span>( + at <= <span class="self">self</span>.len(), + <span class="string">"split_off out of bounds: {:?} <= {:?}"</span>, + at, + <span class="self">self</span>.len(), + ); + + <span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="self">self</span>.clone(); + + <span class="self">self</span>.len = at; + + <span class="kw">unsafe </span>{ ret.inc_start(at) }; + + ret + } + + <span class="doccomment">/// Splits the bytes into two at the given index. + /// + /// Afterwards `self` contains elements `[at, len)`, and the returned + /// `Bytes` contains elements `[0, at)`. + /// + /// This is an `O(1)` operation that just increases the reference count and + /// sets a few indices. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let mut a = Bytes::from(&b"hello world"[..]); + /// let b = a.split_to(5); + /// + /// assert_eq!(&a[..], b" world"); + /// assert_eq!(&b[..], b"hello"); + /// ``` + /// + /// # Panics + /// + /// Panics if `at > len`. + </span><span class="attr">#[must_use = <span class="string">"consider Bytes::advance if you don't need the other half"</span>] + </span><span class="kw">pub fn </span>split_to(<span class="kw-2">&mut </span><span class="self">self</span>, at: usize) -> <span class="self">Self </span>{ + <span class="kw">if </span>at == <span class="self">self</span>.len() { + <span class="kw">return </span>mem::replace(<span class="self">self</span>, Bytes::new()); + } + + <span class="kw">if </span>at == <span class="number">0 </span>{ + <span class="kw">return </span>Bytes::new(); + } + + <span class="macro">assert!</span>( + at <= <span class="self">self</span>.len(), + <span class="string">"split_to out of bounds: {:?} <= {:?}"</span>, + at, + <span class="self">self</span>.len(), + ); + + <span class="kw">let </span><span class="kw-2">mut </span>ret = <span class="self">self</span>.clone(); + + <span class="kw">unsafe </span>{ <span class="self">self</span>.inc_start(at) }; + + ret.len = at; + ret + } + + <span class="doccomment">/// Shortens the buffer, keeping the first `len` bytes and dropping the + /// rest. + /// + /// If `len` is greater than the buffer's current length, this has no + /// effect. + /// + /// The [split_off](`Self::split_off()`) method can emulate `truncate`, but this causes the + /// excess bytes to be returned instead of dropped. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let mut buf = Bytes::from(&b"hello world"[..]); + /// buf.truncate(5); + /// assert_eq!(buf, b"hello"[..]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>truncate(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) { + <span class="kw">if </span>len < <span class="self">self</span>.len { + <span class="comment">// The Vec "promotable" vtables do not store the capacity, + // so we cannot truncate while using this repr. We *have* to + // promote using `split_off` so the capacity can be stored. + </span><span class="kw">if </span><span class="self">self</span>.vtable <span class="kw">as </span><span class="kw-2">*const </span>Vtable == <span class="kw-2">&</span>PROMOTABLE_EVEN_VTABLE + || <span class="self">self</span>.vtable <span class="kw">as </span><span class="kw-2">*const </span>Vtable == <span class="kw-2">&</span>PROMOTABLE_ODD_VTABLE + { + drop(<span class="self">self</span>.split_off(len)); + } <span class="kw">else </span>{ + <span class="self">self</span>.len = len; + } + } + } + + <span class="doccomment">/// Clears the buffer, removing all data. + /// + /// # Examples + /// + /// ``` + /// use bytes::Bytes; + /// + /// let mut buf = Bytes::from(&b"hello world"[..]); + /// buf.clear(); + /// assert!(buf.is_empty()); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>clear(<span class="kw-2">&mut </span><span class="self">self</span>) { + <span class="self">self</span>.truncate(<span class="number">0</span>); + } + + <span class="doccomment">/// Try to convert self into `BytesMut`. + /// + /// If `self` is unique for the entire original buffer, this will succeed + /// and return a `BytesMut` with the contents of `self` without copying. + /// If `self` is not unique for the entire original buffer, this will fail + /// and return self. + /// + /// # Examples + /// + /// ``` + /// use bytes::{Bytes, BytesMut}; + /// + /// let bytes = Bytes::from(b"hello".to_vec()); + /// assert_eq!(bytes.try_into_mut(), Ok(BytesMut::from(&b"hello"[..]))); + /// ``` + </span><span class="kw">pub fn </span>try_into_mut(<span class="self">self</span>) -> <span class="prelude-ty">Result</span><BytesMut, Bytes> { + <span class="kw">if </span><span class="self">self</span>.is_unique() { + <span class="prelude-val">Ok</span>(<span class="self">self</span>.into()) + } <span class="kw">else </span>{ + <span class="prelude-val">Err</span>(<span class="self">self</span>) + } + } + + <span class="attr">#[inline] + </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">unsafe fn </span>with_vtable( + ptr: <span class="kw-2">*const </span>u8, + len: usize, + data: AtomicPtr<()>, + vtable: <span class="kw-2">&</span><span class="lifetime">'static </span>Vtable, + ) -> Bytes { + Bytes { + ptr, + len, + data, + vtable, + } + } + + <span class="comment">// private + + </span><span class="attr">#[inline] + </span><span class="kw">fn </span>as_slice(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="kw">unsafe </span>{ slice::from_raw_parts(<span class="self">self</span>.ptr, <span class="self">self</span>.len) } + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>inc_start(<span class="kw-2">&mut </span><span class="self">self</span>, by: usize) { + <span class="comment">// should already be asserted, but debug assert for tests + </span><span class="macro">debug_assert!</span>(<span class="self">self</span>.len >= by, <span class="string">"internal: inc_start out of bounds"</span>); + <span class="self">self</span>.len -= by; + <span class="self">self</span>.ptr = <span class="self">self</span>.ptr.add(by); + } +} + +<span class="comment">// Vtable must enforce this behavior +</span><span class="kw">unsafe impl </span>Send <span class="kw">for </span>Bytes {} +<span class="kw">unsafe impl </span>Sync <span class="kw">for </span>Bytes {} + +<span class="kw">impl </span>Drop <span class="kw">for </span>Bytes { + <span class="attr">#[inline] + </span><span class="kw">fn </span>drop(<span class="kw-2">&mut </span><span class="self">self</span>) { + <span class="kw">unsafe </span>{ (<span class="self">self</span>.vtable.drop)(<span class="kw-2">&mut </span><span class="self">self</span>.data, <span class="self">self</span>.ptr, <span class="self">self</span>.len) } + } +} + +<span class="kw">impl </span>Clone <span class="kw">for </span>Bytes { + <span class="attr">#[inline] + </span><span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> Bytes { + <span class="kw">unsafe </span>{ (<span class="self">self</span>.vtable.clone)(<span class="kw-2">&</span><span class="self">self</span>.data, <span class="self">self</span>.ptr, <span class="self">self</span>.len) } + } +} + +<span class="kw">impl </span>Buf <span class="kw">for </span>Bytes { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_slice() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="macro">assert!</span>( + cnt <= <span class="self">self</span>.len(), + <span class="string">"cannot advance past `remaining`: {:?} <= {:?}"</span>, + cnt, + <span class="self">self</span>.len(), + ); + + <span class="kw">unsafe </span>{ + <span class="self">self</span>.inc_start(cnt); + } + } + + <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) -> <span class="self">Self </span>{ + <span class="self">self</span>.split_to(len) + } +} + +<span class="kw">impl </span>Deref <span class="kw">for </span>Bytes { + <span class="kw">type </span>Target = [u8]; + + <span class="attr">#[inline] + </span><span class="kw">fn </span>deref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_slice() + } +} + +<span class="kw">impl </span>AsRef<[u8]> <span class="kw">for </span>Bytes { + <span class="attr">#[inline] + </span><span class="kw">fn </span>as_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_slice() + } +} + +<span class="kw">impl </span>hash::Hash <span class="kw">for </span>Bytes { + <span class="kw">fn </span>hash<H>(<span class="kw-2">&</span><span class="self">self</span>, state: <span class="kw-2">&mut </span>H) + <span class="kw">where + </span>H: hash::Hasher, + { + <span class="self">self</span>.as_slice().hash(state); + } +} + +<span class="kw">impl </span>Borrow<[u8]> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>borrow(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_slice() + } +} + +<span class="kw">impl </span>IntoIterator <span class="kw">for </span>Bytes { + <span class="kw">type </span>Item = u8; + <span class="kw">type </span>IntoIter = IntoIter<Bytes>; + + <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { + IntoIter::new(<span class="self">self</span>) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> IntoIterator <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'a </span>Bytes { + <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>u8; + <span class="kw">type </span>IntoIter = core::slice::Iter<<span class="lifetime">'a</span>, u8>; + + <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { + <span class="self">self</span>.as_slice().iter() + } +} + +<span class="kw">impl </span>FromIterator<u8> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from_iter<T: IntoIterator<Item = u8>>(into_iter: T) -> <span class="self">Self </span>{ + Vec::from_iter(into_iter).into() + } +} + +<span class="comment">// impl Eq + +</span><span class="kw">impl </span>PartialEq <span class="kw">for </span>Bytes { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="self">self</span>.as_slice() == other.as_slice() + } +} + +<span class="kw">impl </span>PartialOrd <span class="kw">for </span>Bytes { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.as_slice().partial_cmp(other.as_slice()) + } +} + +<span class="kw">impl </span>Ord <span class="kw">for </span>Bytes { + <span class="kw">fn </span>cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> cmp::Ordering { + <span class="self">self</span>.as_slice().cmp(other.as_slice()) + } +} + +<span class="kw">impl </span>Eq <span class="kw">for </span>Bytes {} + +<span class="kw">impl </span>PartialEq<[u8]> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>[u8]) -> bool { + <span class="self">self</span>.as_slice() == other + } +} + +<span class="kw">impl </span>PartialOrd<[u8]> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>[u8]) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.as_slice().partial_cmp(other) + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span>[u8] { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<Bytes> <span class="kw">for </span>[u8] { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>, other) + } +} + +<span class="kw">impl </span>PartialEq<str> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>str) -> bool { + <span class="self">self</span>.as_slice() == other.as_bytes() + } +} + +<span class="kw">impl </span>PartialOrd<str> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>str) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.as_slice().partial_cmp(other.as_bytes()) + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span>str { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<Bytes> <span class="kw">for </span>str { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>.as_bytes(), other) + } +} + +<span class="kw">impl </span>PartialEq<Vec<u8>> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Vec<u8>) -> bool { + <span class="kw-2">*</span><span class="self">self </span>== other[..] + } +} + +<span class="kw">impl </span>PartialOrd<Vec<u8>> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Vec<u8>) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.as_slice().partial_cmp(<span class="kw-2">&</span>other[..]) + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span>Vec<u8> { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<Bytes> <span class="kw">for </span>Vec<u8> { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>, other) + } +} + +<span class="kw">impl </span>PartialEq<String> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>String) -> bool { + <span class="kw-2">*</span><span class="self">self </span>== other[..] + } +} + +<span class="kw">impl </span>PartialOrd<String> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>String) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.as_slice().partial_cmp(other.as_bytes()) + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span>String { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<Bytes> <span class="kw">for </span>String { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>.as_bytes(), other) + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span><span class="kw-2">&</span>[u8] { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<Bytes> <span class="kw">for </span><span class="kw-2">&</span>[u8] { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>, other) + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span><span class="kw-2">&</span>str { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<Bytes> <span class="kw">for </span><span class="kw-2">&</span>str { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>.as_bytes(), other) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>, T: <span class="question-mark">?</span>Sized> PartialEq<<span class="kw-2">&</span><span class="lifetime">'a </span>T> <span class="kw">for </span>Bytes +<span class="kw">where + </span>Bytes: PartialEq<T>, +{ + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: &&<span class="lifetime">'a </span>T) -> bool { + <span class="kw-2">*</span><span class="self">self </span>== <span class="kw-2">**</span>other + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>, T: <span class="question-mark">?</span>Sized> PartialOrd<<span class="kw-2">&</span><span class="lifetime">'a </span>T> <span class="kw">for </span>Bytes +<span class="kw">where + </span>Bytes: PartialOrd<T>, +{ + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: &&<span class="lifetime">'a </span>T) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.partial_cmp(<span class="kw-2">&**</span>other) + } +} + +<span class="comment">// impl From + +</span><span class="kw">impl </span>Default <span class="kw">for </span>Bytes { + <span class="attr">#[inline] + </span><span class="kw">fn </span>default() -> Bytes { + Bytes::new() + } +} + +<span class="kw">impl </span>From<<span class="kw-2">&</span><span class="lifetime">'static </span>[u8]> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from(slice: <span class="kw-2">&</span><span class="lifetime">'static </span>[u8]) -> Bytes { + Bytes::from_static(slice) + } +} + +<span class="kw">impl </span>From<<span class="kw-2">&</span><span class="lifetime">'static </span>str> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from(slice: <span class="kw-2">&</span><span class="lifetime">'static </span>str) -> Bytes { + Bytes::from_static(slice.as_bytes()) + } +} + +<span class="kw">impl </span>From<Vec<u8>> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from(vec: Vec<u8>) -> Bytes { + <span class="kw">let </span><span class="kw-2">mut </span>vec = ManuallyDrop::new(vec); + <span class="kw">let </span>ptr = vec.as_mut_ptr(); + <span class="kw">let </span>len = vec.len(); + <span class="kw">let </span>cap = vec.capacity(); + + <span class="comment">// Avoid an extra allocation if possible. + </span><span class="kw">if </span>len == cap { + <span class="kw">let </span>vec = ManuallyDrop::into_inner(vec); + <span class="kw">return </span>Bytes::from(vec.into_boxed_slice()); + } + + <span class="kw">let </span>shared = Box::new(Shared { + buf: ptr, + cap, + ref_cnt: AtomicUsize::new(<span class="number">1</span>), + }); + + <span class="kw">let </span>shared = Box::into_raw(shared); + <span class="comment">// The pointer should be aligned, so this assert should + // always succeed. + </span><span class="macro">debug_assert!</span>( + <span class="number">0 </span>== (shared <span class="kw">as </span>usize & KIND_MASK), + <span class="string">"internal: Box<Shared> should have an aligned pointer"</span>, + ); + Bytes { + ptr, + len, + data: AtomicPtr::new(shared <span class="kw">as _</span>), + vtable: <span class="kw-2">&</span>SHARED_VTABLE, + } + } +} + +<span class="kw">impl </span>From<Box<[u8]>> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from(slice: Box<[u8]>) -> Bytes { + <span class="comment">// Box<[u8]> doesn't contain a heap allocation for empty slices, + // so the pointer isn't aligned enough for the KIND_VEC stashing to + // work. + </span><span class="kw">if </span>slice.is_empty() { + <span class="kw">return </span>Bytes::new(); + } + + <span class="kw">let </span>len = slice.len(); + <span class="kw">let </span>ptr = Box::into_raw(slice) <span class="kw">as </span><span class="kw-2">*mut </span>u8; + + <span class="kw">if </span>ptr <span class="kw">as </span>usize & <span class="number">0x1 </span>== <span class="number">0 </span>{ + <span class="kw">let </span>data = ptr_map(ptr, |addr| addr | KIND_VEC); + Bytes { + ptr, + len, + data: AtomicPtr::new(data.cast()), + vtable: <span class="kw-2">&</span>PROMOTABLE_EVEN_VTABLE, + } + } <span class="kw">else </span>{ + Bytes { + ptr, + len, + data: AtomicPtr::new(ptr.cast()), + vtable: <span class="kw-2">&</span>PROMOTABLE_ODD_VTABLE, + } + } + } +} + +<span class="kw">impl </span>From<Bytes> <span class="kw">for </span>BytesMut { + <span class="doccomment">/// Convert self into `BytesMut`. + /// + /// If `bytes` is unique for the entire original buffer, this will return a + /// `BytesMut` with the contents of `bytes` without copying. + /// If `bytes` is not unique for the entire original buffer, this will make + /// a copy of `bytes` subset of the original buffer in a new `BytesMut`. + /// + /// # Examples + /// + /// ``` + /// use bytes::{Bytes, BytesMut}; + /// + /// let bytes = Bytes::from(b"hello".to_vec()); + /// assert_eq!(BytesMut::from(bytes), BytesMut::from(&b"hello"[..])); + /// ``` + </span><span class="kw">fn </span>from(bytes: Bytes) -> <span class="self">Self </span>{ + <span class="kw">let </span>bytes = ManuallyDrop::new(bytes); + <span class="kw">unsafe </span>{ (bytes.vtable.to_mut)(<span class="kw-2">&</span>bytes.data, bytes.ptr, bytes.len) } + } +} + +<span class="kw">impl </span>From<String> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from(s: String) -> Bytes { + Bytes::from(s.into_bytes()) + } +} + +<span class="kw">impl </span>From<Bytes> <span class="kw">for </span>Vec<u8> { + <span class="kw">fn </span>from(bytes: Bytes) -> Vec<u8> { + <span class="kw">let </span>bytes = ManuallyDrop::new(bytes); + <span class="kw">unsafe </span>{ (bytes.vtable.to_vec)(<span class="kw-2">&</span>bytes.data, bytes.ptr, bytes.len) } + } +} + +<span class="comment">// ===== impl Vtable ===== + +</span><span class="kw">impl </span>fmt::Debug <span class="kw">for </span>Vtable { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { + f.debug_struct(<span class="string">"Vtable"</span>) + .field(<span class="string">"clone"</span>, <span class="kw-2">&</span>(<span class="self">self</span>.clone <span class="kw">as </span><span class="kw-2">*const </span>())) + .field(<span class="string">"drop"</span>, <span class="kw-2">&</span>(<span class="self">self</span>.drop <span class="kw">as </span><span class="kw-2">*const </span>())) + .finish() + } +} + +<span class="comment">// ===== impl StaticVtable ===== + +</span><span class="kw">const </span>STATIC_VTABLE: Vtable = Vtable { + clone: static_clone, + to_vec: static_to_vec, + to_mut: static_to_mut, + is_unique: static_is_unique, + drop: static_drop, +}; + +<span class="kw">unsafe fn </span>static_clone(<span class="kw">_</span>: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Bytes { + <span class="kw">let </span>slice = slice::from_raw_parts(ptr, len); + Bytes::from_static(slice) +} + +<span class="kw">unsafe fn </span>static_to_vec(<span class="kw">_</span>: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Vec<u8> { + <span class="kw">let </span>slice = slice::from_raw_parts(ptr, len); + slice.to_vec() +} + +<span class="kw">unsafe fn </span>static_to_mut(<span class="kw">_</span>: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> BytesMut { + <span class="kw">let </span>slice = slice::from_raw_parts(ptr, len); + BytesMut::from(slice) +} + +<span class="kw">fn </span>static_is_unique(<span class="kw">_</span>: <span class="kw-2">&</span>AtomicPtr<()>) -> bool { + <span class="bool-val">false +</span>} + +<span class="kw">unsafe fn </span>static_drop(<span class="kw">_</span>: <span class="kw-2">&mut </span>AtomicPtr<()>, <span class="kw">_</span>: <span class="kw-2">*const </span>u8, <span class="kw">_</span>: usize) { + <span class="comment">// nothing to drop for &'static [u8] +</span>} + +<span class="comment">// ===== impl PromotableVtable ===== + +</span><span class="kw">static </span>PROMOTABLE_EVEN_VTABLE: Vtable = Vtable { + clone: promotable_even_clone, + to_vec: promotable_even_to_vec, + to_mut: promotable_even_to_mut, + is_unique: promotable_is_unique, + drop: promotable_even_drop, +}; + +<span class="kw">static </span>PROMOTABLE_ODD_VTABLE: Vtable = Vtable { + clone: promotable_odd_clone, + to_vec: promotable_odd_to_vec, + to_mut: promotable_odd_to_mut, + is_unique: promotable_is_unique, + drop: promotable_odd_drop, +}; + +<span class="kw">unsafe fn </span>promotable_even_clone(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Bytes { + <span class="kw">let </span>shared = data.load(Ordering::Acquire); + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + shallow_clone_arc(shared.cast(), ptr, len) + } <span class="kw">else </span>{ + <span class="macro">debug_assert_eq!</span>(kind, KIND_VEC); + <span class="kw">let </span>buf = ptr_map(shared.cast(), |addr| addr & !KIND_MASK); + shallow_clone_vec(data, shared, buf, ptr, len) + } +} + +<span class="kw">unsafe fn </span>promotable_to_vec( + data: <span class="kw-2">&</span>AtomicPtr<()>, + ptr: <span class="kw-2">*const </span>u8, + len: usize, + f: <span class="kw">fn</span>(<span class="kw-2">*mut </span>()) -> <span class="kw-2">*mut </span>u8, +) -> Vec<u8> { + <span class="kw">let </span>shared = data.load(Ordering::Acquire); + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + shared_to_vec_impl(shared.cast(), ptr, len) + } <span class="kw">else </span>{ + <span class="comment">// If Bytes holds a Vec, then the offset must be 0. + </span><span class="macro">debug_assert_eq!</span>(kind, KIND_VEC); + + <span class="kw">let </span>buf = f(shared); + + <span class="kw">let </span>cap = offset_from(ptr, buf) + len; + + <span class="comment">// Copy back buffer + </span>ptr::copy(ptr, buf, len); + + Vec::from_raw_parts(buf, len, cap) + } +} + +<span class="kw">unsafe fn </span>promotable_to_mut( + data: <span class="kw-2">&</span>AtomicPtr<()>, + ptr: <span class="kw-2">*const </span>u8, + len: usize, + f: <span class="kw">fn</span>(<span class="kw-2">*mut </span>()) -> <span class="kw-2">*mut </span>u8, +) -> BytesMut { + <span class="kw">let </span>shared = data.load(Ordering::Acquire); + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + shared_to_mut_impl(shared.cast(), ptr, len) + } <span class="kw">else </span>{ + <span class="comment">// KIND_VEC is a view of an underlying buffer at a certain offset. + // The ptr + len always represents the end of that buffer. + // Before truncating it, it is first promoted to KIND_ARC. + // Thus, we can safely reconstruct a Vec from it without leaking memory. + </span><span class="macro">debug_assert_eq!</span>(kind, KIND_VEC); + + <span class="kw">let </span>buf = f(shared); + <span class="kw">let </span>off = offset_from(ptr, buf); + <span class="kw">let </span>cap = off + len; + <span class="kw">let </span>v = Vec::from_raw_parts(buf, cap, cap); + + <span class="kw">let </span><span class="kw-2">mut </span>b = BytesMut::from_vec(v); + b.advance_unchecked(off); + b + } +} + +<span class="kw">unsafe fn </span>promotable_even_to_vec(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Vec<u8> { + promotable_to_vec(data, ptr, len, |shared| { + ptr_map(shared.cast(), |addr| addr & !KIND_MASK) + }) +} + +<span class="kw">unsafe fn </span>promotable_even_to_mut(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> BytesMut { + promotable_to_mut(data, ptr, len, |shared| { + ptr_map(shared.cast(), |addr| addr & !KIND_MASK) + }) +} + +<span class="kw">unsafe fn </span>promotable_even_drop(data: <span class="kw-2">&mut </span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) { + data.with_mut(|shared| { + <span class="kw">let </span>shared = <span class="kw-2">*</span>shared; + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + release_shared(shared.cast()); + } <span class="kw">else </span>{ + <span class="macro">debug_assert_eq!</span>(kind, KIND_VEC); + <span class="kw">let </span>buf = ptr_map(shared.cast(), |addr| addr & !KIND_MASK); + free_boxed_slice(buf, ptr, len); + } + }); +} + +<span class="kw">unsafe fn </span>promotable_odd_clone(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Bytes { + <span class="kw">let </span>shared = data.load(Ordering::Acquire); + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + shallow_clone_arc(shared <span class="kw">as _</span>, ptr, len) + } <span class="kw">else </span>{ + <span class="macro">debug_assert_eq!</span>(kind, KIND_VEC); + shallow_clone_vec(data, shared, shared.cast(), ptr, len) + } +} + +<span class="kw">unsafe fn </span>promotable_odd_to_vec(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Vec<u8> { + promotable_to_vec(data, ptr, len, |shared| shared.cast()) +} + +<span class="kw">unsafe fn </span>promotable_odd_to_mut(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> BytesMut { + promotable_to_mut(data, ptr, len, |shared| shared.cast()) +} + +<span class="kw">unsafe fn </span>promotable_odd_drop(data: <span class="kw-2">&mut </span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) { + data.with_mut(|shared| { + <span class="kw">let </span>shared = <span class="kw-2">*</span>shared; + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + release_shared(shared.cast()); + } <span class="kw">else </span>{ + <span class="macro">debug_assert_eq!</span>(kind, KIND_VEC); + + free_boxed_slice(shared.cast(), ptr, len); + } + }); +} + +<span class="kw">unsafe fn </span>promotable_is_unique(data: <span class="kw-2">&</span>AtomicPtr<()>) -> bool { + <span class="kw">let </span>shared = data.load(Ordering::Acquire); + <span class="kw">let </span>kind = shared <span class="kw">as </span>usize & KIND_MASK; + + <span class="kw">if </span>kind == KIND_ARC { + <span class="kw">let </span>ref_cnt = (<span class="kw-2">*</span>shared.cast::<Shared>()).ref_cnt.load(Ordering::Relaxed); + ref_cnt == <span class="number">1 + </span>} <span class="kw">else </span>{ + <span class="bool-val">true + </span>} +} + +<span class="kw">unsafe fn </span>free_boxed_slice(buf: <span class="kw-2">*mut </span>u8, offset: <span class="kw-2">*const </span>u8, len: usize) { + <span class="kw">let </span>cap = offset_from(offset, buf) + len; + dealloc(buf, Layout::from_size_align(cap, <span class="number">1</span>).unwrap()) +} + +<span class="comment">// ===== impl SharedVtable ===== + +</span><span class="kw">struct </span>Shared { + <span class="comment">// Holds arguments to dealloc upon Drop, but otherwise doesn't use them + </span>buf: <span class="kw-2">*mut </span>u8, + cap: usize, + ref_cnt: AtomicUsize, +} + +<span class="kw">impl </span>Drop <span class="kw">for </span>Shared { + <span class="kw">fn </span>drop(<span class="kw-2">&mut </span><span class="self">self</span>) { + <span class="kw">unsafe </span>{ dealloc(<span class="self">self</span>.buf, Layout::from_size_align(<span class="self">self</span>.cap, <span class="number">1</span>).unwrap()) } + } +} + +<span class="comment">// Assert that the alignment of `Shared` is divisible by 2. +// This is a necessary invariant since we depend on allocating `Shared` a +// shared object to implicitly carry the `KIND_ARC` flag in its pointer. +// This flag is set when the LSB is 0. +</span><span class="kw">const _</span>: [(); <span class="number">0 </span>- mem::align_of::<Shared>() % <span class="number">2</span>] = []; <span class="comment">// Assert that the alignment of `Shared` is divisible by 2. + +</span><span class="kw">static </span>SHARED_VTABLE: Vtable = Vtable { + clone: shared_clone, + to_vec: shared_to_vec, + to_mut: shared_to_mut, + is_unique: shared_is_unique, + drop: shared_drop, +}; + +<span class="kw">const </span>KIND_ARC: usize = <span class="number">0b0</span>; +<span class="kw">const </span>KIND_VEC: usize = <span class="number">0b1</span>; +<span class="kw">const </span>KIND_MASK: usize = <span class="number">0b1</span>; + +<span class="kw">unsafe fn </span>shared_clone(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Bytes { + <span class="kw">let </span>shared = data.load(Ordering::Relaxed); + shallow_clone_arc(shared <span class="kw">as _</span>, ptr, len) +} + +<span class="kw">unsafe fn </span>shared_to_vec_impl(shared: <span class="kw-2">*mut </span>Shared, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Vec<u8> { + <span class="comment">// Check that the ref_cnt is 1 (unique). + // + // If it is unique, then it is set to 0 with AcqRel fence for the same + // reason in release_shared. + // + // Otherwise, we take the other branch and call release_shared. + </span><span class="kw">if </span>(<span class="kw-2">*</span>shared) + .ref_cnt + .compare_exchange(<span class="number">1</span>, <span class="number">0</span>, Ordering::AcqRel, Ordering::Relaxed) + .is_ok() + { + <span class="comment">// Deallocate the `Shared` instance without running its destructor. + </span><span class="kw">let </span>shared = <span class="kw-2">*</span>Box::from_raw(shared); + <span class="kw">let </span>shared = ManuallyDrop::new(shared); + <span class="kw">let </span>buf = shared.buf; + <span class="kw">let </span>cap = shared.cap; + + <span class="comment">// Copy back buffer + </span>ptr::copy(ptr, buf, len); + + Vec::from_raw_parts(buf, len, cap) + } <span class="kw">else </span>{ + <span class="kw">let </span>v = slice::from_raw_parts(ptr, len).to_vec(); + release_shared(shared); + v + } +} + +<span class="kw">unsafe fn </span>shared_to_vec(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Vec<u8> { + shared_to_vec_impl(data.load(Ordering::Relaxed).cast(), ptr, len) +} + +<span class="kw">unsafe fn </span>shared_to_mut_impl(shared: <span class="kw-2">*mut </span>Shared, ptr: <span class="kw-2">*const </span>u8, len: usize) -> BytesMut { + <span class="comment">// The goal is to check if the current handle is the only handle + // that currently has access to the buffer. This is done by + // checking if the `ref_cnt` is currently 1. + // + // The `Acquire` ordering synchronizes with the `Release` as + // part of the `fetch_sub` in `release_shared`. The `fetch_sub` + // operation guarantees that any mutations done in other threads + // are ordered before the `ref_cnt` is decremented. As such, + // this `Acquire` will guarantee that those mutations are + // visible to the current thread. + // + // Otherwise, we take the other branch, copy the data and call `release_shared`. + </span><span class="kw">if </span>(<span class="kw-2">*</span>shared).ref_cnt.load(Ordering::Acquire) == <span class="number">1 </span>{ + <span class="comment">// Deallocate the `Shared` instance without running its destructor. + </span><span class="kw">let </span>shared = <span class="kw-2">*</span>Box::from_raw(shared); + <span class="kw">let </span>shared = ManuallyDrop::new(shared); + <span class="kw">let </span>buf = shared.buf; + <span class="kw">let </span>cap = shared.cap; + + <span class="comment">// Rebuild Vec + </span><span class="kw">let </span>off = offset_from(ptr, buf); + <span class="kw">let </span>v = Vec::from_raw_parts(buf, len + off, cap); + + <span class="kw">let </span><span class="kw-2">mut </span>b = BytesMut::from_vec(v); + b.advance_unchecked(off); + b + } <span class="kw">else </span>{ + <span class="comment">// Copy the data from Shared in a new Vec, then release it + </span><span class="kw">let </span>v = slice::from_raw_parts(ptr, len).to_vec(); + release_shared(shared); + BytesMut::from_vec(v) + } +} + +<span class="kw">unsafe fn </span>shared_to_mut(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> BytesMut { + shared_to_mut_impl(data.load(Ordering::Relaxed).cast(), ptr, len) +} + +<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">unsafe fn </span>shared_is_unique(data: <span class="kw-2">&</span>AtomicPtr<()>) -> bool { + <span class="kw">let </span>shared = data.load(Ordering::Acquire); + <span class="kw">let </span>ref_cnt = (<span class="kw-2">*</span>shared.cast::<Shared>()).ref_cnt.load(Ordering::Relaxed); + ref_cnt == <span class="number">1 +</span>} + +<span class="kw">unsafe fn </span>shared_drop(data: <span class="kw-2">&mut </span>AtomicPtr<()>, _ptr: <span class="kw-2">*const </span>u8, _len: usize) { + data.with_mut(|shared| { + release_shared(shared.cast()); + }); +} + +<span class="kw">unsafe fn </span>shallow_clone_arc(shared: <span class="kw-2">*mut </span>Shared, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Bytes { + <span class="kw">let </span>old_size = (<span class="kw-2">*</span>shared).ref_cnt.fetch_add(<span class="number">1</span>, Ordering::Relaxed); + + <span class="kw">if </span>old_size > usize::MAX >> <span class="number">1 </span>{ + <span class="kw">crate</span>::abort(); + } + + Bytes { + ptr, + len, + data: AtomicPtr::new(shared <span class="kw">as _</span>), + vtable: <span class="kw-2">&</span>SHARED_VTABLE, + } +} + +<span class="attr">#[cold] +</span><span class="kw">unsafe fn </span>shallow_clone_vec( + atom: <span class="kw-2">&</span>AtomicPtr<()>, + ptr: <span class="kw-2">*const </span>(), + buf: <span class="kw-2">*mut </span>u8, + offset: <span class="kw-2">*const </span>u8, + len: usize, +) -> Bytes { + <span class="comment">// If the buffer is still tracked in a `Vec<u8>`. It is time to + // promote the vec to an `Arc`. This could potentially be called + // concurrently, so some care must be taken. + + // First, allocate a new `Shared` instance containing the + // `Vec` fields. It's important to note that `ptr`, `len`, + // and `cap` cannot be mutated without having `&mut self`. + // This means that these fields will not be concurrently + // updated and since the buffer hasn't been promoted to an + // `Arc`, those three fields still are the components of the + // vector. + </span><span class="kw">let </span>shared = Box::new(Shared { + buf, + cap: offset_from(offset, buf) + len, + <span class="comment">// Initialize refcount to 2. One for this reference, and one + // for the new clone that will be returned from + // `shallow_clone`. + </span>ref_cnt: AtomicUsize::new(<span class="number">2</span>), + }); + + <span class="kw">let </span>shared = Box::into_raw(shared); + + <span class="comment">// The pointer should be aligned, so this assert should + // always succeed. + </span><span class="macro">debug_assert!</span>( + <span class="number">0 </span>== (shared <span class="kw">as </span>usize & KIND_MASK), + <span class="string">"internal: Box<Shared> should have an aligned pointer"</span>, + ); + + <span class="comment">// Try compare & swapping the pointer into the `arc` field. + // `Release` is used synchronize with other threads that + // will load the `arc` field. + // + // If the `compare_exchange` fails, then the thread lost the + // race to promote the buffer to shared. The `Acquire` + // ordering will synchronize with the `compare_exchange` + // that happened in the other thread and the `Shared` + // pointed to by `actual` will be visible. + </span><span class="kw">match </span>atom.compare_exchange(ptr <span class="kw">as _</span>, shared <span class="kw">as _</span>, Ordering::AcqRel, Ordering::Acquire) { + <span class="prelude-val">Ok</span>(actual) => { + <span class="macro">debug_assert!</span>(actual <span class="kw">as </span>usize == ptr <span class="kw">as </span>usize); + <span class="comment">// The upgrade was successful, the new handle can be + // returned. + </span>Bytes { + ptr: offset, + len, + data: AtomicPtr::new(shared <span class="kw">as _</span>), + vtable: <span class="kw-2">&</span>SHARED_VTABLE, + } + } + <span class="prelude-val">Err</span>(actual) => { + <span class="comment">// The upgrade failed, a concurrent clone happened. Release + // the allocation that was made in this thread, it will not + // be needed. + </span><span class="kw">let </span>shared = Box::from_raw(shared); + mem::forget(<span class="kw-2">*</span>shared); + + <span class="comment">// Buffer already promoted to shared storage, so increment ref + // count. + </span>shallow_clone_arc(actual <span class="kw">as _</span>, offset, len) + } + } +} + +<span class="kw">unsafe fn </span>release_shared(ptr: <span class="kw-2">*mut </span>Shared) { + <span class="comment">// `Shared` storage... follow the drop steps from Arc. + </span><span class="kw">if </span>(<span class="kw-2">*</span>ptr).ref_cnt.fetch_sub(<span class="number">1</span>, Ordering::Release) != <span class="number">1 </span>{ + <span class="kw">return</span>; + } + + <span class="comment">// This fence is needed to prevent reordering of use of the data and + // deletion of the data. Because it is marked `Release`, the decreasing + // of the reference count synchronizes with this `Acquire` fence. This + // means that use of the data happens before decreasing the reference + // count, which happens before this fence, which happens before the + // deletion of the data. + // + // As explained in the [Boost documentation][1], + // + // > It is important to enforce any possible access to the object in one + // > thread (through an existing reference) to *happen before* deleting + // > the object in a different thread. This is achieved by a "release" + // > operation after dropping a reference (any access to the object + // > through this reference must obviously happened before), and an + // > "acquire" operation before deleting the object. + // + // [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html) + // + // Thread sanitizer does not support atomic fences. Use an atomic load + // instead. + </span>(<span class="kw-2">*</span>ptr).ref_cnt.load(Ordering::Acquire); + + <span class="comment">// Drop the data + </span>drop(Box::from_raw(ptr)); +} + +<span class="comment">// Ideally we would always use this version of `ptr_map` since it is strict +// provenance compatible, but it results in worse codegen. We will however still +// use it on miri because it gives better diagnostics for people who test bytes +// code with miri. +// +// See https://github.com/tokio-rs/bytes/pull/545 for more info. +</span><span class="attr">#[cfg(miri)] +</span><span class="kw">fn </span>ptr_map<F>(ptr: <span class="kw-2">*mut </span>u8, f: F) -> <span class="kw-2">*mut </span>u8 +<span class="kw">where + </span>F: FnOnce(usize) -> usize, +{ + <span class="kw">let </span>old_addr = ptr <span class="kw">as </span>usize; + <span class="kw">let </span>new_addr = f(old_addr); + <span class="kw">let </span>diff = new_addr.wrapping_sub(old_addr); + ptr.wrapping_add(diff) +} + +<span class="attr">#[cfg(not(miri))] +</span><span class="kw">fn </span>ptr_map<F>(ptr: <span class="kw-2">*mut </span>u8, f: F) -> <span class="kw-2">*mut </span>u8 +<span class="kw">where + </span>F: FnOnce(usize) -> usize, +{ + <span class="kw">let </span>old_addr = ptr <span class="kw">as </span>usize; + <span class="kw">let </span>new_addr = f(old_addr); + new_addr <span class="kw">as </span><span class="kw-2">*mut </span>u8 +} + +<span class="comment">// compile-fails + +</span><span class="doccomment">/// ```compile_fail +/// use bytes::Bytes; +/// #[deny(unused_must_use)] +/// { +/// let mut b1 = Bytes::from("hello world"); +/// b1.split_to(6); +/// } +/// ``` +</span><span class="kw">fn </span>_split_to_must_use() {} + +<span class="doccomment">/// ```compile_fail +/// use bytes::Bytes; +/// #[deny(unused_must_use)] +/// { +/// let mut b1 = Bytes::from("hello world"); +/// b1.split_off(6); +/// } +/// ``` +</span><span class="kw">fn </span>_split_off_must_use() {} + +<span class="comment">// fuzz tests +</span><span class="attr">#[cfg(all(test, loom))] +</span><span class="kw">mod </span>fuzz { + <span class="kw">use </span>loom::sync::Arc; + <span class="kw">use </span>loom::thread; + + <span class="kw">use </span><span class="kw">super</span>::Bytes; + <span class="attr">#[test] + </span><span class="kw">fn </span>bytes_cloning_vec() { + loom::model(|| { + <span class="kw">let </span>a = Bytes::from(<span class="string">b"abcdefgh"</span>.to_vec()); + <span class="kw">let </span>addr = a.as_ptr() <span class="kw">as </span>usize; + + <span class="comment">// test the Bytes::clone is Sync by putting it in an Arc + </span><span class="kw">let </span>a1 = Arc::new(a); + <span class="kw">let </span>a2 = a1.clone(); + + <span class="kw">let </span>t1 = thread::spawn(<span class="kw">move </span>|| { + <span class="kw">let </span>b: Bytes = (<span class="kw-2">*</span>a1).clone(); + <span class="macro">assert_eq!</span>(b.as_ptr() <span class="kw">as </span>usize, addr); + }); + + <span class="kw">let </span>t2 = thread::spawn(<span class="kw">move </span>|| { + <span class="kw">let </span>b: Bytes = (<span class="kw-2">*</span>a2).clone(); + <span class="macro">assert_eq!</span>(b.as_ptr() <span class="kw">as </span>usize, addr); + }); + + t1.join().unwrap(); + t2.join().unwrap(); + }); + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/bytes_mut.rs.html b/src/bytes/bytes_mut.rs.html new file mode 100644 index 0000000..fde2361 --- /dev/null +++ b/src/bytes/bytes_mut.rs.html @@ -0,0 +1,3670 @@ +<!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 `src/bytes_mut.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>bytes_mut.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../source-files.js"></script><script defer src="../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../bytes/index.html"><img class="rust-logo" src="../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../static.files/wheel-5ec35bf9ca753509.svg"></a></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> +<span id="2">2</span> +<span id="3">3</span> +<span id="4">4</span> +<span id="5">5</span> +<span id="6">6</span> +<span id="7">7</span> +<span id="8">8</span> +<span id="9">9</span> +<span id="10">10</span> +<span id="11">11</span> +<span id="12">12</span> +<span id="13">13</span> +<span id="14">14</span> +<span id="15">15</span> +<span id="16">16</span> +<span id="17">17</span> +<span id="18">18</span> +<span id="19">19</span> +<span id="20">20</span> +<span id="21">21</span> +<span id="22">22</span> +<span id="23">23</span> +<span id="24">24</span> +<span id="25">25</span> +<span id="26">26</span> +<span id="27">27</span> +<span id="28">28</span> +<span id="29">29</span> +<span id="30">30</span> +<span id="31">31</span> +<span id="32">32</span> +<span id="33">33</span> +<span id="34">34</span> +<span id="35">35</span> +<span id="36">36</span> +<span id="37">37</span> +<span id="38">38</span> +<span id="39">39</span> +<span id="40">40</span> +<span id="41">41</span> +<span id="42">42</span> +<span id="43">43</span> +<span id="44">44</span> +<span id="45">45</span> +<span id="46">46</span> +<span id="47">47</span> +<span id="48">48</span> +<span id="49">49</span> +<span id="50">50</span> +<span id="51">51</span> +<span id="52">52</span> +<span id="53">53</span> +<span id="54">54</span> +<span id="55">55</span> +<span id="56">56</span> +<span id="57">57</span> +<span id="58">58</span> +<span id="59">59</span> +<span id="60">60</span> +<span id="61">61</span> +<span id="62">62</span> +<span id="63">63</span> +<span id="64">64</span> +<span id="65">65</span> +<span id="66">66</span> +<span id="67">67</span> +<span id="68">68</span> +<span id="69">69</span> +<span id="70">70</span> +<span id="71">71</span> +<span id="72">72</span> +<span id="73">73</span> +<span id="74">74</span> +<span id="75">75</span> +<span id="76">76</span> +<span id="77">77</span> +<span id="78">78</span> +<span id="79">79</span> +<span id="80">80</span> +<span id="81">81</span> +<span id="82">82</span> +<span id="83">83</span> +<span id="84">84</span> +<span id="85">85</span> +<span id="86">86</span> +<span id="87">87</span> +<span id="88">88</span> +<span id="89">89</span> +<span id="90">90</span> +<span id="91">91</span> +<span id="92">92</span> +<span id="93">93</span> +<span id="94">94</span> +<span id="95">95</span> +<span id="96">96</span> +<span id="97">97</span> +<span id="98">98</span> +<span id="99">99</span> +<span id="100">100</span> +<span id="101">101</span> +<span id="102">102</span> +<span id="103">103</span> +<span id="104">104</span> +<span id="105">105</span> +<span id="106">106</span> +<span id="107">107</span> +<span id="108">108</span> +<span id="109">109</span> +<span id="110">110</span> +<span id="111">111</span> +<span id="112">112</span> +<span id="113">113</span> +<span id="114">114</span> +<span id="115">115</span> +<span id="116">116</span> +<span id="117">117</span> +<span id="118">118</span> +<span id="119">119</span> +<span id="120">120</span> +<span id="121">121</span> +<span id="122">122</span> +<span id="123">123</span> +<span id="124">124</span> +<span id="125">125</span> +<span id="126">126</span> +<span id="127">127</span> +<span id="128">128</span> +<span id="129">129</span> +<span id="130">130</span> +<span id="131">131</span> +<span id="132">132</span> +<span id="133">133</span> +<span id="134">134</span> +<span id="135">135</span> +<span id="136">136</span> +<span id="137">137</span> +<span id="138">138</span> +<span id="139">139</span> +<span id="140">140</span> +<span id="141">141</span> +<span id="142">142</span> +<span id="143">143</span> +<span id="144">144</span> +<span id="145">145</span> +<span id="146">146</span> +<span id="147">147</span> +<span id="148">148</span> +<span id="149">149</span> +<span id="150">150</span> +<span id="151">151</span> +<span id="152">152</span> +<span id="153">153</span> +<span id="154">154</span> +<span id="155">155</span> +<span id="156">156</span> +<span id="157">157</span> +<span id="158">158</span> +<span id="159">159</span> +<span id="160">160</span> +<span id="161">161</span> +<span id="162">162</span> +<span id="163">163</span> +<span id="164">164</span> +<span id="165">165</span> +<span id="166">166</span> +<span id="167">167</span> +<span id="168">168</span> +<span id="169">169</span> +<span id="170">170</span> +<span id="171">171</span> +<span id="172">172</span> +<span id="173">173</span> +<span id="174">174</span> +<span id="175">175</span> +<span id="176">176</span> +<span id="177">177</span> +<span id="178">178</span> +<span id="179">179</span> +<span id="180">180</span> +<span id="181">181</span> +<span id="182">182</span> +<span id="183">183</span> +<span id="184">184</span> +<span id="185">185</span> +<span id="186">186</span> +<span id="187">187</span> +<span id="188">188</span> +<span id="189">189</span> +<span id="190">190</span> +<span id="191">191</span> +<span id="192">192</span> +<span id="193">193</span> +<span id="194">194</span> +<span id="195">195</span> +<span id="196">196</span> +<span id="197">197</span> +<span id="198">198</span> +<span id="199">199</span> +<span id="200">200</span> +<span id="201">201</span> +<span id="202">202</span> +<span id="203">203</span> +<span id="204">204</span> +<span id="205">205</span> +<span id="206">206</span> +<span id="207">207</span> +<span id="208">208</span> +<span id="209">209</span> +<span id="210">210</span> +<span id="211">211</span> +<span id="212">212</span> +<span id="213">213</span> +<span id="214">214</span> +<span id="215">215</span> +<span id="216">216</span> +<span id="217">217</span> +<span id="218">218</span> +<span id="219">219</span> +<span id="220">220</span> +<span id="221">221</span> +<span id="222">222</span> +<span id="223">223</span> +<span id="224">224</span> +<span id="225">225</span> +<span id="226">226</span> +<span id="227">227</span> +<span id="228">228</span> +<span id="229">229</span> +<span id="230">230</span> +<span id="231">231</span> +<span id="232">232</span> +<span id="233">233</span> +<span id="234">234</span> +<span id="235">235</span> +<span id="236">236</span> +<span id="237">237</span> +<span id="238">238</span> +<span id="239">239</span> +<span id="240">240</span> +<span id="241">241</span> +<span id="242">242</span> +<span id="243">243</span> +<span id="244">244</span> +<span id="245">245</span> +<span id="246">246</span> +<span id="247">247</span> +<span id="248">248</span> +<span id="249">249</span> +<span id="250">250</span> +<span id="251">251</span> +<span id="252">252</span> +<span id="253">253</span> +<span id="254">254</span> +<span id="255">255</span> +<span id="256">256</span> +<span id="257">257</span> +<span id="258">258</span> +<span id="259">259</span> +<span id="260">260</span> +<span id="261">261</span> +<span id="262">262</span> +<span id="263">263</span> +<span id="264">264</span> +<span id="265">265</span> +<span id="266">266</span> +<span id="267">267</span> +<span id="268">268</span> +<span id="269">269</span> +<span id="270">270</span> +<span id="271">271</span> +<span id="272">272</span> +<span id="273">273</span> +<span id="274">274</span> +<span id="275">275</span> +<span id="276">276</span> +<span id="277">277</span> +<span id="278">278</span> +<span id="279">279</span> +<span id="280">280</span> +<span id="281">281</span> +<span id="282">282</span> +<span id="283">283</span> +<span id="284">284</span> +<span id="285">285</span> +<span id="286">286</span> +<span id="287">287</span> +<span id="288">288</span> +<span id="289">289</span> +<span id="290">290</span> +<span id="291">291</span> +<span id="292">292</span> +<span id="293">293</span> +<span id="294">294</span> +<span id="295">295</span> +<span id="296">296</span> +<span id="297">297</span> +<span id="298">298</span> +<span id="299">299</span> +<span id="300">300</span> +<span id="301">301</span> +<span id="302">302</span> +<span id="303">303</span> +<span id="304">304</span> +<span id="305">305</span> +<span id="306">306</span> +<span id="307">307</span> +<span id="308">308</span> +<span id="309">309</span> +<span id="310">310</span> +<span id="311">311</span> +<span id="312">312</span> +<span id="313">313</span> +<span id="314">314</span> +<span id="315">315</span> +<span id="316">316</span> +<span id="317">317</span> +<span id="318">318</span> +<span id="319">319</span> +<span id="320">320</span> +<span id="321">321</span> +<span id="322">322</span> +<span id="323">323</span> +<span id="324">324</span> +<span id="325">325</span> +<span id="326">326</span> +<span id="327">327</span> +<span id="328">328</span> +<span id="329">329</span> +<span id="330">330</span> +<span id="331">331</span> +<span id="332">332</span> +<span id="333">333</span> +<span id="334">334</span> +<span id="335">335</span> +<span id="336">336</span> +<span id="337">337</span> +<span id="338">338</span> +<span id="339">339</span> +<span id="340">340</span> +<span id="341">341</span> +<span id="342">342</span> +<span id="343">343</span> +<span id="344">344</span> +<span id="345">345</span> +<span id="346">346</span> +<span id="347">347</span> +<span id="348">348</span> +<span id="349">349</span> +<span id="350">350</span> +<span id="351">351</span> +<span id="352">352</span> +<span id="353">353</span> +<span id="354">354</span> +<span id="355">355</span> +<span id="356">356</span> +<span id="357">357</span> +<span id="358">358</span> +<span id="359">359</span> +<span id="360">360</span> +<span id="361">361</span> +<span id="362">362</span> +<span id="363">363</span> +<span id="364">364</span> +<span id="365">365</span> +<span id="366">366</span> +<span id="367">367</span> +<span id="368">368</span> +<span id="369">369</span> +<span id="370">370</span> +<span id="371">371</span> +<span id="372">372</span> +<span id="373">373</span> +<span id="374">374</span> +<span id="375">375</span> +<span id="376">376</span> +<span id="377">377</span> +<span id="378">378</span> +<span id="379">379</span> +<span id="380">380</span> +<span id="381">381</span> +<span id="382">382</span> +<span id="383">383</span> +<span id="384">384</span> +<span id="385">385</span> +<span id="386">386</span> +<span id="387">387</span> +<span id="388">388</span> +<span id="389">389</span> +<span id="390">390</span> +<span id="391">391</span> +<span id="392">392</span> +<span id="393">393</span> +<span id="394">394</span> +<span id="395">395</span> +<span id="396">396</span> +<span id="397">397</span> +<span id="398">398</span> +<span id="399">399</span> +<span id="400">400</span> +<span id="401">401</span> +<span id="402">402</span> +<span id="403">403</span> +<span id="404">404</span> +<span id="405">405</span> +<span id="406">406</span> +<span id="407">407</span> +<span id="408">408</span> +<span id="409">409</span> +<span id="410">410</span> +<span id="411">411</span> +<span id="412">412</span> +<span id="413">413</span> +<span id="414">414</span> +<span id="415">415</span> +<span id="416">416</span> +<span id="417">417</span> +<span id="418">418</span> +<span id="419">419</span> +<span id="420">420</span> +<span id="421">421</span> +<span id="422">422</span> +<span id="423">423</span> +<span id="424">424</span> +<span id="425">425</span> +<span id="426">426</span> +<span id="427">427</span> +<span id="428">428</span> +<span id="429">429</span> +<span id="430">430</span> +<span id="431">431</span> +<span id="432">432</span> +<span id="433">433</span> +<span id="434">434</span> +<span id="435">435</span> +<span id="436">436</span> +<span id="437">437</span> +<span id="438">438</span> +<span id="439">439</span> +<span id="440">440</span> +<span id="441">441</span> +<span id="442">442</span> +<span id="443">443</span> +<span id="444">444</span> +<span id="445">445</span> +<span id="446">446</span> +<span id="447">447</span> +<span id="448">448</span> +<span id="449">449</span> +<span id="450">450</span> +<span id="451">451</span> +<span id="452">452</span> +<span id="453">453</span> +<span id="454">454</span> +<span id="455">455</span> +<span id="456">456</span> +<span id="457">457</span> +<span id="458">458</span> +<span id="459">459</span> +<span id="460">460</span> +<span id="461">461</span> +<span id="462">462</span> +<span id="463">463</span> +<span id="464">464</span> +<span id="465">465</span> +<span id="466">466</span> +<span id="467">467</span> +<span id="468">468</span> +<span id="469">469</span> +<span id="470">470</span> +<span id="471">471</span> +<span id="472">472</span> +<span id="473">473</span> +<span id="474">474</span> +<span id="475">475</span> +<span id="476">476</span> +<span id="477">477</span> +<span id="478">478</span> +<span id="479">479</span> +<span id="480">480</span> +<span id="481">481</span> +<span id="482">482</span> +<span id="483">483</span> +<span id="484">484</span> +<span id="485">485</span> +<span id="486">486</span> +<span id="487">487</span> +<span id="488">488</span> +<span id="489">489</span> +<span id="490">490</span> +<span id="491">491</span> +<span id="492">492</span> +<span id="493">493</span> +<span id="494">494</span> +<span id="495">495</span> +<span id="496">496</span> +<span id="497">497</span> +<span id="498">498</span> +<span id="499">499</span> +<span id="500">500</span> +<span id="501">501</span> +<span id="502">502</span> +<span id="503">503</span> +<span id="504">504</span> +<span id="505">505</span> +<span id="506">506</span> +<span id="507">507</span> +<span id="508">508</span> +<span id="509">509</span> +<span id="510">510</span> +<span id="511">511</span> +<span id="512">512</span> +<span id="513">513</span> +<span id="514">514</span> +<span id="515">515</span> +<span id="516">516</span> +<span id="517">517</span> +<span id="518">518</span> +<span id="519">519</span> +<span id="520">520</span> +<span id="521">521</span> +<span id="522">522</span> +<span id="523">523</span> +<span id="524">524</span> +<span id="525">525</span> +<span id="526">526</span> +<span id="527">527</span> +<span id="528">528</span> +<span id="529">529</span> +<span id="530">530</span> +<span id="531">531</span> +<span id="532">532</span> +<span id="533">533</span> +<span id="534">534</span> +<span id="535">535</span> +<span id="536">536</span> +<span id="537">537</span> +<span id="538">538</span> +<span id="539">539</span> +<span id="540">540</span> +<span id="541">541</span> +<span id="542">542</span> +<span id="543">543</span> +<span id="544">544</span> +<span id="545">545</span> +<span id="546">546</span> +<span id="547">547</span> +<span id="548">548</span> +<span id="549">549</span> +<span id="550">550</span> +<span id="551">551</span> +<span id="552">552</span> +<span id="553">553</span> +<span id="554">554</span> +<span id="555">555</span> +<span id="556">556</span> +<span id="557">557</span> +<span id="558">558</span> +<span id="559">559</span> +<span id="560">560</span> +<span id="561">561</span> +<span id="562">562</span> +<span id="563">563</span> +<span id="564">564</span> +<span id="565">565</span> +<span id="566">566</span> +<span id="567">567</span> +<span id="568">568</span> +<span id="569">569</span> +<span id="570">570</span> +<span id="571">571</span> +<span id="572">572</span> +<span id="573">573</span> +<span id="574">574</span> +<span id="575">575</span> +<span id="576">576</span> +<span id="577">577</span> +<span id="578">578</span> +<span id="579">579</span> +<span id="580">580</span> +<span id="581">581</span> +<span id="582">582</span> +<span id="583">583</span> +<span id="584">584</span> +<span id="585">585</span> +<span id="586">586</span> +<span id="587">587</span> +<span id="588">588</span> +<span id="589">589</span> +<span id="590">590</span> +<span id="591">591</span> +<span id="592">592</span> +<span id="593">593</span> +<span id="594">594</span> +<span id="595">595</span> +<span id="596">596</span> +<span id="597">597</span> +<span id="598">598</span> +<span id="599">599</span> +<span id="600">600</span> +<span id="601">601</span> +<span id="602">602</span> +<span id="603">603</span> +<span id="604">604</span> +<span id="605">605</span> +<span id="606">606</span> +<span id="607">607</span> +<span id="608">608</span> +<span id="609">609</span> +<span id="610">610</span> +<span id="611">611</span> +<span id="612">612</span> +<span id="613">613</span> +<span id="614">614</span> +<span id="615">615</span> +<span id="616">616</span> +<span id="617">617</span> +<span id="618">618</span> +<span id="619">619</span> +<span id="620">620</span> +<span id="621">621</span> +<span id="622">622</span> +<span id="623">623</span> +<span id="624">624</span> +<span id="625">625</span> +<span id="626">626</span> +<span id="627">627</span> +<span id="628">628</span> +<span id="629">629</span> +<span id="630">630</span> +<span id="631">631</span> +<span id="632">632</span> +<span id="633">633</span> +<span id="634">634</span> +<span id="635">635</span> +<span id="636">636</span> +<span id="637">637</span> +<span id="638">638</span> +<span id="639">639</span> +<span id="640">640</span> +<span id="641">641</span> +<span id="642">642</span> +<span id="643">643</span> +<span id="644">644</span> +<span id="645">645</span> +<span id="646">646</span> +<span id="647">647</span> +<span id="648">648</span> +<span id="649">649</span> +<span id="650">650</span> +<span id="651">651</span> +<span id="652">652</span> +<span id="653">653</span> +<span id="654">654</span> +<span id="655">655</span> +<span id="656">656</span> +<span id="657">657</span> +<span id="658">658</span> +<span id="659">659</span> +<span id="660">660</span> +<span id="661">661</span> +<span id="662">662</span> +<span id="663">663</span> +<span id="664">664</span> +<span id="665">665</span> +<span id="666">666</span> +<span id="667">667</span> +<span id="668">668</span> +<span id="669">669</span> +<span id="670">670</span> +<span id="671">671</span> +<span id="672">672</span> +<span id="673">673</span> +<span id="674">674</span> +<span id="675">675</span> +<span id="676">676</span> +<span id="677">677</span> +<span id="678">678</span> +<span id="679">679</span> +<span id="680">680</span> +<span id="681">681</span> +<span id="682">682</span> +<span id="683">683</span> +<span id="684">684</span> +<span id="685">685</span> +<span id="686">686</span> +<span id="687">687</span> +<span id="688">688</span> +<span id="689">689</span> +<span id="690">690</span> +<span id="691">691</span> +<span id="692">692</span> +<span id="693">693</span> +<span id="694">694</span> +<span id="695">695</span> +<span id="696">696</span> +<span id="697">697</span> +<span id="698">698</span> +<span id="699">699</span> +<span id="700">700</span> +<span id="701">701</span> +<span id="702">702</span> +<span id="703">703</span> +<span id="704">704</span> +<span id="705">705</span> +<span id="706">706</span> +<span id="707">707</span> +<span id="708">708</span> +<span id="709">709</span> +<span id="710">710</span> +<span id="711">711</span> +<span id="712">712</span> +<span id="713">713</span> +<span id="714">714</span> +<span id="715">715</span> +<span id="716">716</span> +<span id="717">717</span> +<span id="718">718</span> +<span id="719">719</span> +<span id="720">720</span> +<span id="721">721</span> +<span id="722">722</span> +<span id="723">723</span> +<span id="724">724</span> +<span id="725">725</span> +<span id="726">726</span> +<span id="727">727</span> +<span id="728">728</span> +<span id="729">729</span> +<span id="730">730</span> +<span id="731">731</span> +<span id="732">732</span> +<span id="733">733</span> +<span id="734">734</span> +<span id="735">735</span> +<span id="736">736</span> +<span id="737">737</span> +<span id="738">738</span> +<span id="739">739</span> +<span id="740">740</span> +<span id="741">741</span> +<span id="742">742</span> +<span id="743">743</span> +<span id="744">744</span> +<span id="745">745</span> +<span id="746">746</span> +<span id="747">747</span> +<span id="748">748</span> +<span id="749">749</span> +<span id="750">750</span> +<span id="751">751</span> +<span id="752">752</span> +<span id="753">753</span> +<span id="754">754</span> +<span id="755">755</span> +<span id="756">756</span> +<span id="757">757</span> +<span id="758">758</span> +<span id="759">759</span> +<span id="760">760</span> +<span id="761">761</span> +<span id="762">762</span> +<span id="763">763</span> +<span id="764">764</span> +<span id="765">765</span> +<span id="766">766</span> +<span id="767">767</span> +<span id="768">768</span> +<span id="769">769</span> +<span id="770">770</span> +<span id="771">771</span> +<span id="772">772</span> +<span id="773">773</span> +<span id="774">774</span> +<span id="775">775</span> +<span id="776">776</span> +<span id="777">777</span> +<span id="778">778</span> +<span id="779">779</span> +<span id="780">780</span> +<span id="781">781</span> +<span id="782">782</span> +<span id="783">783</span> +<span id="784">784</span> +<span id="785">785</span> +<span id="786">786</span> +<span id="787">787</span> +<span id="788">788</span> +<span id="789">789</span> +<span id="790">790</span> +<span id="791">791</span> +<span id="792">792</span> +<span id="793">793</span> +<span id="794">794</span> +<span id="795">795</span> +<span id="796">796</span> +<span id="797">797</span> +<span id="798">798</span> +<span id="799">799</span> +<span id="800">800</span> +<span id="801">801</span> +<span id="802">802</span> +<span id="803">803</span> +<span id="804">804</span> +<span id="805">805</span> +<span id="806">806</span> +<span id="807">807</span> +<span id="808">808</span> +<span id="809">809</span> +<span id="810">810</span> +<span id="811">811</span> +<span id="812">812</span> +<span id="813">813</span> +<span id="814">814</span> +<span id="815">815</span> +<span id="816">816</span> +<span id="817">817</span> +<span id="818">818</span> +<span id="819">819</span> +<span id="820">820</span> +<span id="821">821</span> +<span id="822">822</span> +<span id="823">823</span> +<span id="824">824</span> +<span id="825">825</span> +<span id="826">826</span> +<span id="827">827</span> +<span id="828">828</span> +<span id="829">829</span> +<span id="830">830</span> +<span id="831">831</span> +<span id="832">832</span> +<span id="833">833</span> +<span id="834">834</span> +<span id="835">835</span> +<span id="836">836</span> +<span id="837">837</span> +<span id="838">838</span> +<span id="839">839</span> +<span id="840">840</span> +<span id="841">841</span> +<span id="842">842</span> +<span id="843">843</span> +<span id="844">844</span> +<span id="845">845</span> +<span id="846">846</span> +<span id="847">847</span> +<span id="848">848</span> +<span id="849">849</span> +<span id="850">850</span> +<span id="851">851</span> +<span id="852">852</span> +<span id="853">853</span> +<span id="854">854</span> +<span id="855">855</span> +<span id="856">856</span> +<span id="857">857</span> +<span id="858">858</span> +<span id="859">859</span> +<span id="860">860</span> +<span id="861">861</span> +<span id="862">862</span> +<span id="863">863</span> +<span id="864">864</span> +<span id="865">865</span> +<span id="866">866</span> +<span id="867">867</span> +<span id="868">868</span> +<span id="869">869</span> +<span id="870">870</span> +<span id="871">871</span> +<span id="872">872</span> +<span id="873">873</span> +<span id="874">874</span> +<span id="875">875</span> +<span id="876">876</span> +<span id="877">877</span> +<span id="878">878</span> +<span id="879">879</span> +<span id="880">880</span> +<span id="881">881</span> +<span id="882">882</span> +<span id="883">883</span> +<span id="884">884</span> +<span id="885">885</span> +<span id="886">886</span> +<span id="887">887</span> +<span id="888">888</span> +<span id="889">889</span> +<span id="890">890</span> +<span id="891">891</span> +<span id="892">892</span> +<span id="893">893</span> +<span id="894">894</span> +<span id="895">895</span> +<span id="896">896</span> +<span id="897">897</span> +<span id="898">898</span> +<span id="899">899</span> +<span id="900">900</span> +<span id="901">901</span> +<span id="902">902</span> +<span id="903">903</span> +<span id="904">904</span> +<span id="905">905</span> +<span id="906">906</span> +<span id="907">907</span> +<span id="908">908</span> +<span id="909">909</span> +<span id="910">910</span> +<span id="911">911</span> +<span id="912">912</span> +<span id="913">913</span> +<span id="914">914</span> +<span id="915">915</span> +<span id="916">916</span> +<span id="917">917</span> +<span id="918">918</span> +<span id="919">919</span> +<span id="920">920</span> +<span id="921">921</span> +<span id="922">922</span> +<span id="923">923</span> +<span id="924">924</span> +<span id="925">925</span> +<span id="926">926</span> +<span id="927">927</span> +<span id="928">928</span> +<span id="929">929</span> +<span id="930">930</span> +<span id="931">931</span> +<span id="932">932</span> +<span id="933">933</span> +<span id="934">934</span> +<span id="935">935</span> +<span id="936">936</span> +<span id="937">937</span> +<span id="938">938</span> +<span id="939">939</span> +<span id="940">940</span> +<span id="941">941</span> +<span id="942">942</span> +<span id="943">943</span> +<span id="944">944</span> +<span id="945">945</span> +<span id="946">946</span> +<span id="947">947</span> +<span id="948">948</span> +<span id="949">949</span> +<span id="950">950</span> +<span id="951">951</span> +<span id="952">952</span> +<span id="953">953</span> +<span id="954">954</span> +<span id="955">955</span> +<span id="956">956</span> +<span id="957">957</span> +<span id="958">958</span> +<span id="959">959</span> +<span id="960">960</span> +<span id="961">961</span> +<span id="962">962</span> +<span id="963">963</span> +<span id="964">964</span> +<span id="965">965</span> +<span id="966">966</span> +<span id="967">967</span> +<span id="968">968</span> +<span id="969">969</span> +<span id="970">970</span> +<span id="971">971</span> +<span id="972">972</span> +<span id="973">973</span> +<span id="974">974</span> +<span id="975">975</span> +<span id="976">976</span> +<span id="977">977</span> +<span id="978">978</span> +<span id="979">979</span> +<span id="980">980</span> +<span id="981">981</span> +<span id="982">982</span> +<span id="983">983</span> +<span id="984">984</span> +<span id="985">985</span> +<span id="986">986</span> +<span id="987">987</span> +<span id="988">988</span> +<span id="989">989</span> +<span id="990">990</span> +<span id="991">991</span> +<span id="992">992</span> +<span id="993">993</span> +<span id="994">994</span> +<span id="995">995</span> +<span id="996">996</span> +<span id="997">997</span> +<span id="998">998</span> +<span id="999">999</span> +<span id="1000">1000</span> +<span id="1001">1001</span> +<span id="1002">1002</span> +<span id="1003">1003</span> +<span id="1004">1004</span> +<span id="1005">1005</span> +<span id="1006">1006</span> +<span id="1007">1007</span> +<span id="1008">1008</span> +<span id="1009">1009</span> +<span id="1010">1010</span> +<span id="1011">1011</span> +<span id="1012">1012</span> +<span id="1013">1013</span> +<span id="1014">1014</span> +<span id="1015">1015</span> +<span id="1016">1016</span> +<span id="1017">1017</span> +<span id="1018">1018</span> +<span id="1019">1019</span> +<span id="1020">1020</span> +<span id="1021">1021</span> +<span id="1022">1022</span> +<span id="1023">1023</span> +<span id="1024">1024</span> +<span id="1025">1025</span> +<span id="1026">1026</span> +<span id="1027">1027</span> +<span id="1028">1028</span> +<span id="1029">1029</span> +<span id="1030">1030</span> +<span id="1031">1031</span> +<span id="1032">1032</span> +<span id="1033">1033</span> +<span id="1034">1034</span> +<span id="1035">1035</span> +<span id="1036">1036</span> +<span id="1037">1037</span> +<span id="1038">1038</span> +<span id="1039">1039</span> +<span id="1040">1040</span> +<span id="1041">1041</span> +<span id="1042">1042</span> +<span id="1043">1043</span> +<span id="1044">1044</span> +<span id="1045">1045</span> +<span id="1046">1046</span> +<span id="1047">1047</span> +<span id="1048">1048</span> +<span id="1049">1049</span> +<span id="1050">1050</span> +<span id="1051">1051</span> +<span id="1052">1052</span> +<span id="1053">1053</span> +<span id="1054">1054</span> +<span id="1055">1055</span> +<span id="1056">1056</span> +<span id="1057">1057</span> +<span id="1058">1058</span> +<span id="1059">1059</span> +<span id="1060">1060</span> +<span id="1061">1061</span> +<span id="1062">1062</span> +<span id="1063">1063</span> +<span id="1064">1064</span> +<span id="1065">1065</span> +<span id="1066">1066</span> +<span id="1067">1067</span> +<span id="1068">1068</span> +<span id="1069">1069</span> +<span id="1070">1070</span> +<span id="1071">1071</span> +<span id="1072">1072</span> +<span id="1073">1073</span> +<span id="1074">1074</span> +<span id="1075">1075</span> +<span id="1076">1076</span> +<span id="1077">1077</span> +<span id="1078">1078</span> +<span id="1079">1079</span> +<span id="1080">1080</span> +<span id="1081">1081</span> +<span id="1082">1082</span> +<span id="1083">1083</span> +<span id="1084">1084</span> +<span id="1085">1085</span> +<span id="1086">1086</span> +<span id="1087">1087</span> +<span id="1088">1088</span> +<span id="1089">1089</span> +<span id="1090">1090</span> +<span id="1091">1091</span> +<span id="1092">1092</span> +<span id="1093">1093</span> +<span id="1094">1094</span> +<span id="1095">1095</span> +<span id="1096">1096</span> +<span id="1097">1097</span> +<span id="1098">1098</span> +<span id="1099">1099</span> +<span id="1100">1100</span> +<span id="1101">1101</span> +<span id="1102">1102</span> +<span id="1103">1103</span> +<span id="1104">1104</span> +<span id="1105">1105</span> +<span id="1106">1106</span> +<span id="1107">1107</span> +<span id="1108">1108</span> +<span id="1109">1109</span> +<span id="1110">1110</span> +<span id="1111">1111</span> +<span id="1112">1112</span> +<span id="1113">1113</span> +<span id="1114">1114</span> +<span id="1115">1115</span> +<span id="1116">1116</span> +<span id="1117">1117</span> +<span id="1118">1118</span> +<span id="1119">1119</span> +<span id="1120">1120</span> +<span id="1121">1121</span> +<span id="1122">1122</span> +<span id="1123">1123</span> +<span id="1124">1124</span> +<span id="1125">1125</span> +<span id="1126">1126</span> +<span id="1127">1127</span> +<span id="1128">1128</span> +<span id="1129">1129</span> +<span id="1130">1130</span> +<span id="1131">1131</span> +<span id="1132">1132</span> +<span id="1133">1133</span> +<span id="1134">1134</span> +<span id="1135">1135</span> +<span id="1136">1136</span> +<span id="1137">1137</span> +<span id="1138">1138</span> +<span id="1139">1139</span> +<span id="1140">1140</span> +<span id="1141">1141</span> +<span id="1142">1142</span> +<span id="1143">1143</span> +<span id="1144">1144</span> +<span id="1145">1145</span> +<span id="1146">1146</span> +<span id="1147">1147</span> +<span id="1148">1148</span> +<span id="1149">1149</span> +<span id="1150">1150</span> +<span id="1151">1151</span> +<span id="1152">1152</span> +<span id="1153">1153</span> +<span id="1154">1154</span> +<span id="1155">1155</span> +<span id="1156">1156</span> +<span id="1157">1157</span> +<span id="1158">1158</span> +<span id="1159">1159</span> +<span id="1160">1160</span> +<span id="1161">1161</span> +<span id="1162">1162</span> +<span id="1163">1163</span> +<span id="1164">1164</span> +<span id="1165">1165</span> +<span id="1166">1166</span> +<span id="1167">1167</span> +<span id="1168">1168</span> +<span id="1169">1169</span> +<span id="1170">1170</span> +<span id="1171">1171</span> +<span id="1172">1172</span> +<span id="1173">1173</span> +<span id="1174">1174</span> +<span id="1175">1175</span> +<span id="1176">1176</span> +<span id="1177">1177</span> +<span id="1178">1178</span> +<span id="1179">1179</span> +<span id="1180">1180</span> +<span id="1181">1181</span> +<span id="1182">1182</span> +<span id="1183">1183</span> +<span id="1184">1184</span> +<span id="1185">1185</span> +<span id="1186">1186</span> +<span id="1187">1187</span> +<span id="1188">1188</span> +<span id="1189">1189</span> +<span id="1190">1190</span> +<span id="1191">1191</span> +<span id="1192">1192</span> +<span id="1193">1193</span> +<span id="1194">1194</span> +<span id="1195">1195</span> +<span id="1196">1196</span> +<span id="1197">1197</span> +<span id="1198">1198</span> +<span id="1199">1199</span> +<span id="1200">1200</span> +<span id="1201">1201</span> +<span id="1202">1202</span> +<span id="1203">1203</span> +<span id="1204">1204</span> +<span id="1205">1205</span> +<span id="1206">1206</span> +<span id="1207">1207</span> +<span id="1208">1208</span> +<span id="1209">1209</span> +<span id="1210">1210</span> +<span id="1211">1211</span> +<span id="1212">1212</span> +<span id="1213">1213</span> +<span id="1214">1214</span> +<span id="1215">1215</span> +<span id="1216">1216</span> +<span id="1217">1217</span> +<span id="1218">1218</span> +<span id="1219">1219</span> +<span id="1220">1220</span> +<span id="1221">1221</span> +<span id="1222">1222</span> +<span id="1223">1223</span> +<span id="1224">1224</span> +<span id="1225">1225</span> +<span id="1226">1226</span> +<span id="1227">1227</span> +<span id="1228">1228</span> +<span id="1229">1229</span> +<span id="1230">1230</span> +<span id="1231">1231</span> +<span id="1232">1232</span> +<span id="1233">1233</span> +<span id="1234">1234</span> +<span id="1235">1235</span> +<span id="1236">1236</span> +<span id="1237">1237</span> +<span id="1238">1238</span> +<span id="1239">1239</span> +<span id="1240">1240</span> +<span id="1241">1241</span> +<span id="1242">1242</span> +<span id="1243">1243</span> +<span id="1244">1244</span> +<span id="1245">1245</span> +<span id="1246">1246</span> +<span id="1247">1247</span> +<span id="1248">1248</span> +<span id="1249">1249</span> +<span id="1250">1250</span> +<span id="1251">1251</span> +<span id="1252">1252</span> +<span id="1253">1253</span> +<span id="1254">1254</span> +<span id="1255">1255</span> +<span id="1256">1256</span> +<span id="1257">1257</span> +<span id="1258">1258</span> +<span id="1259">1259</span> +<span id="1260">1260</span> +<span id="1261">1261</span> +<span id="1262">1262</span> +<span id="1263">1263</span> +<span id="1264">1264</span> +<span id="1265">1265</span> +<span id="1266">1266</span> +<span id="1267">1267</span> +<span id="1268">1268</span> +<span id="1269">1269</span> +<span id="1270">1270</span> +<span id="1271">1271</span> +<span id="1272">1272</span> +<span id="1273">1273</span> +<span id="1274">1274</span> +<span id="1275">1275</span> +<span id="1276">1276</span> +<span id="1277">1277</span> +<span id="1278">1278</span> +<span id="1279">1279</span> +<span id="1280">1280</span> +<span id="1281">1281</span> +<span id="1282">1282</span> +<span id="1283">1283</span> +<span id="1284">1284</span> +<span id="1285">1285</span> +<span id="1286">1286</span> +<span id="1287">1287</span> +<span id="1288">1288</span> +<span id="1289">1289</span> +<span id="1290">1290</span> +<span id="1291">1291</span> +<span id="1292">1292</span> +<span id="1293">1293</span> +<span id="1294">1294</span> +<span id="1295">1295</span> +<span id="1296">1296</span> +<span id="1297">1297</span> +<span id="1298">1298</span> +<span id="1299">1299</span> +<span id="1300">1300</span> +<span id="1301">1301</span> +<span id="1302">1302</span> +<span id="1303">1303</span> +<span id="1304">1304</span> +<span id="1305">1305</span> +<span id="1306">1306</span> +<span id="1307">1307</span> +<span id="1308">1308</span> +<span id="1309">1309</span> +<span id="1310">1310</span> +<span id="1311">1311</span> +<span id="1312">1312</span> +<span id="1313">1313</span> +<span id="1314">1314</span> +<span id="1315">1315</span> +<span id="1316">1316</span> +<span id="1317">1317</span> +<span id="1318">1318</span> +<span id="1319">1319</span> +<span id="1320">1320</span> +<span id="1321">1321</span> +<span id="1322">1322</span> +<span id="1323">1323</span> +<span id="1324">1324</span> +<span id="1325">1325</span> +<span id="1326">1326</span> +<span id="1327">1327</span> +<span id="1328">1328</span> +<span id="1329">1329</span> +<span id="1330">1330</span> +<span id="1331">1331</span> +<span id="1332">1332</span> +<span id="1333">1333</span> +<span id="1334">1334</span> +<span id="1335">1335</span> +<span id="1336">1336</span> +<span id="1337">1337</span> +<span id="1338">1338</span> +<span id="1339">1339</span> +<span id="1340">1340</span> +<span id="1341">1341</span> +<span id="1342">1342</span> +<span id="1343">1343</span> +<span id="1344">1344</span> +<span id="1345">1345</span> +<span id="1346">1346</span> +<span id="1347">1347</span> +<span id="1348">1348</span> +<span id="1349">1349</span> +<span id="1350">1350</span> +<span id="1351">1351</span> +<span id="1352">1352</span> +<span id="1353">1353</span> +<span id="1354">1354</span> +<span id="1355">1355</span> +<span id="1356">1356</span> +<span id="1357">1357</span> +<span id="1358">1358</span> +<span id="1359">1359</span> +<span id="1360">1360</span> +<span id="1361">1361</span> +<span id="1362">1362</span> +<span id="1363">1363</span> +<span id="1364">1364</span> +<span id="1365">1365</span> +<span id="1366">1366</span> +<span id="1367">1367</span> +<span id="1368">1368</span> +<span id="1369">1369</span> +<span id="1370">1370</span> +<span id="1371">1371</span> +<span id="1372">1372</span> +<span id="1373">1373</span> +<span id="1374">1374</span> +<span id="1375">1375</span> +<span id="1376">1376</span> +<span id="1377">1377</span> +<span id="1378">1378</span> +<span id="1379">1379</span> +<span id="1380">1380</span> +<span id="1381">1381</span> +<span id="1382">1382</span> +<span id="1383">1383</span> +<span id="1384">1384</span> +<span id="1385">1385</span> +<span id="1386">1386</span> +<span id="1387">1387</span> +<span id="1388">1388</span> +<span id="1389">1389</span> +<span id="1390">1390</span> +<span id="1391">1391</span> +<span id="1392">1392</span> +<span id="1393">1393</span> +<span id="1394">1394</span> +<span id="1395">1395</span> +<span id="1396">1396</span> +<span id="1397">1397</span> +<span id="1398">1398</span> +<span id="1399">1399</span> +<span id="1400">1400</span> +<span id="1401">1401</span> +<span id="1402">1402</span> +<span id="1403">1403</span> +<span id="1404">1404</span> +<span id="1405">1405</span> +<span id="1406">1406</span> +<span id="1407">1407</span> +<span id="1408">1408</span> +<span id="1409">1409</span> +<span id="1410">1410</span> +<span id="1411">1411</span> +<span id="1412">1412</span> +<span id="1413">1413</span> +<span id="1414">1414</span> +<span id="1415">1415</span> +<span id="1416">1416</span> +<span id="1417">1417</span> +<span id="1418">1418</span> +<span id="1419">1419</span> +<span id="1420">1420</span> +<span id="1421">1421</span> +<span id="1422">1422</span> +<span id="1423">1423</span> +<span id="1424">1424</span> +<span id="1425">1425</span> +<span id="1426">1426</span> +<span id="1427">1427</span> +<span id="1428">1428</span> +<span id="1429">1429</span> +<span id="1430">1430</span> +<span id="1431">1431</span> +<span id="1432">1432</span> +<span id="1433">1433</span> +<span id="1434">1434</span> +<span id="1435">1435</span> +<span id="1436">1436</span> +<span id="1437">1437</span> +<span id="1438">1438</span> +<span id="1439">1439</span> +<span id="1440">1440</span> +<span id="1441">1441</span> +<span id="1442">1442</span> +<span id="1443">1443</span> +<span id="1444">1444</span> +<span id="1445">1445</span> +<span id="1446">1446</span> +<span id="1447">1447</span> +<span id="1448">1448</span> +<span id="1449">1449</span> +<span id="1450">1450</span> +<span id="1451">1451</span> +<span id="1452">1452</span> +<span id="1453">1453</span> +<span id="1454">1454</span> +<span id="1455">1455</span> +<span id="1456">1456</span> +<span id="1457">1457</span> +<span id="1458">1458</span> +<span id="1459">1459</span> +<span id="1460">1460</span> +<span id="1461">1461</span> +<span id="1462">1462</span> +<span id="1463">1463</span> +<span id="1464">1464</span> +<span id="1465">1465</span> +<span id="1466">1466</span> +<span id="1467">1467</span> +<span id="1468">1468</span> +<span id="1469">1469</span> +<span id="1470">1470</span> +<span id="1471">1471</span> +<span id="1472">1472</span> +<span id="1473">1473</span> +<span id="1474">1474</span> +<span id="1475">1475</span> +<span id="1476">1476</span> +<span id="1477">1477</span> +<span id="1478">1478</span> +<span id="1479">1479</span> +<span id="1480">1480</span> +<span id="1481">1481</span> +<span id="1482">1482</span> +<span id="1483">1483</span> +<span id="1484">1484</span> +<span id="1485">1485</span> +<span id="1486">1486</span> +<span id="1487">1487</span> +<span id="1488">1488</span> +<span id="1489">1489</span> +<span id="1490">1490</span> +<span id="1491">1491</span> +<span id="1492">1492</span> +<span id="1493">1493</span> +<span id="1494">1494</span> +<span id="1495">1495</span> +<span id="1496">1496</span> +<span id="1497">1497</span> +<span id="1498">1498</span> +<span id="1499">1499</span> +<span id="1500">1500</span> +<span id="1501">1501</span> +<span id="1502">1502</span> +<span id="1503">1503</span> +<span id="1504">1504</span> +<span id="1505">1505</span> +<span id="1506">1506</span> +<span id="1507">1507</span> +<span id="1508">1508</span> +<span id="1509">1509</span> +<span id="1510">1510</span> +<span id="1511">1511</span> +<span id="1512">1512</span> +<span id="1513">1513</span> +<span id="1514">1514</span> +<span id="1515">1515</span> +<span id="1516">1516</span> +<span id="1517">1517</span> +<span id="1518">1518</span> +<span id="1519">1519</span> +<span id="1520">1520</span> +<span id="1521">1521</span> +<span id="1522">1522</span> +<span id="1523">1523</span> +<span id="1524">1524</span> +<span id="1525">1525</span> +<span id="1526">1526</span> +<span id="1527">1527</span> +<span id="1528">1528</span> +<span id="1529">1529</span> +<span id="1530">1530</span> +<span id="1531">1531</span> +<span id="1532">1532</span> +<span id="1533">1533</span> +<span id="1534">1534</span> +<span id="1535">1535</span> +<span id="1536">1536</span> +<span id="1537">1537</span> +<span id="1538">1538</span> +<span id="1539">1539</span> +<span id="1540">1540</span> +<span id="1541">1541</span> +<span id="1542">1542</span> +<span id="1543">1543</span> +<span id="1544">1544</span> +<span id="1545">1545</span> +<span id="1546">1546</span> +<span id="1547">1547</span> +<span id="1548">1548</span> +<span id="1549">1549</span> +<span id="1550">1550</span> +<span id="1551">1551</span> +<span id="1552">1552</span> +<span id="1553">1553</span> +<span id="1554">1554</span> +<span id="1555">1555</span> +<span id="1556">1556</span> +<span id="1557">1557</span> +<span id="1558">1558</span> +<span id="1559">1559</span> +<span id="1560">1560</span> +<span id="1561">1561</span> +<span id="1562">1562</span> +<span id="1563">1563</span> +<span id="1564">1564</span> +<span id="1565">1565</span> +<span id="1566">1566</span> +<span id="1567">1567</span> +<span id="1568">1568</span> +<span id="1569">1569</span> +<span id="1570">1570</span> +<span id="1571">1571</span> +<span id="1572">1572</span> +<span id="1573">1573</span> +<span id="1574">1574</span> +<span id="1575">1575</span> +<span id="1576">1576</span> +<span id="1577">1577</span> +<span id="1578">1578</span> +<span id="1579">1579</span> +<span id="1580">1580</span> +<span id="1581">1581</span> +<span id="1582">1582</span> +<span id="1583">1583</span> +<span id="1584">1584</span> +<span id="1585">1585</span> +<span id="1586">1586</span> +<span id="1587">1587</span> +<span id="1588">1588</span> +<span id="1589">1589</span> +<span id="1590">1590</span> +<span id="1591">1591</span> +<span id="1592">1592</span> +<span id="1593">1593</span> +<span id="1594">1594</span> +<span id="1595">1595</span> +<span id="1596">1596</span> +<span id="1597">1597</span> +<span id="1598">1598</span> +<span id="1599">1599</span> +<span id="1600">1600</span> +<span id="1601">1601</span> +<span id="1602">1602</span> +<span id="1603">1603</span> +<span id="1604">1604</span> +<span id="1605">1605</span> +<span id="1606">1606</span> +<span id="1607">1607</span> +<span id="1608">1608</span> +<span id="1609">1609</span> +<span id="1610">1610</span> +<span id="1611">1611</span> +<span id="1612">1612</span> +<span id="1613">1613</span> +<span id="1614">1614</span> +<span id="1615">1615</span> +<span id="1616">1616</span> +<span id="1617">1617</span> +<span id="1618">1618</span> +<span id="1619">1619</span> +<span id="1620">1620</span> +<span id="1621">1621</span> +<span id="1622">1622</span> +<span id="1623">1623</span> +<span id="1624">1624</span> +<span id="1625">1625</span> +<span id="1626">1626</span> +<span id="1627">1627</span> +<span id="1628">1628</span> +<span id="1629">1629</span> +<span id="1630">1630</span> +<span id="1631">1631</span> +<span id="1632">1632</span> +<span id="1633">1633</span> +<span id="1634">1634</span> +<span id="1635">1635</span> +<span id="1636">1636</span> +<span id="1637">1637</span> +<span id="1638">1638</span> +<span id="1639">1639</span> +<span id="1640">1640</span> +<span id="1641">1641</span> +<span id="1642">1642</span> +<span id="1643">1643</span> +<span id="1644">1644</span> +<span id="1645">1645</span> +<span id="1646">1646</span> +<span id="1647">1647</span> +<span id="1648">1648</span> +<span id="1649">1649</span> +<span id="1650">1650</span> +<span id="1651">1651</span> +<span id="1652">1652</span> +<span id="1653">1653</span> +<span id="1654">1654</span> +<span id="1655">1655</span> +<span id="1656">1656</span> +<span id="1657">1657</span> +<span id="1658">1658</span> +<span id="1659">1659</span> +<span id="1660">1660</span> +<span id="1661">1661</span> +<span id="1662">1662</span> +<span id="1663">1663</span> +<span id="1664">1664</span> +<span id="1665">1665</span> +<span id="1666">1666</span> +<span id="1667">1667</span> +<span id="1668">1668</span> +<span id="1669">1669</span> +<span id="1670">1670</span> +<span id="1671">1671</span> +<span id="1672">1672</span> +<span id="1673">1673</span> +<span id="1674">1674</span> +<span id="1675">1675</span> +<span id="1676">1676</span> +<span id="1677">1677</span> +<span id="1678">1678</span> +<span id="1679">1679</span> +<span id="1680">1680</span> +<span id="1681">1681</span> +<span id="1682">1682</span> +<span id="1683">1683</span> +<span id="1684">1684</span> +<span id="1685">1685</span> +<span id="1686">1686</span> +<span id="1687">1687</span> +<span id="1688">1688</span> +<span id="1689">1689</span> +<span id="1690">1690</span> +<span id="1691">1691</span> +<span id="1692">1692</span> +<span id="1693">1693</span> +<span id="1694">1694</span> +<span id="1695">1695</span> +<span id="1696">1696</span> +<span id="1697">1697</span> +<span id="1698">1698</span> +<span id="1699">1699</span> +<span id="1700">1700</span> +<span id="1701">1701</span> +<span id="1702">1702</span> +<span id="1703">1703</span> +<span id="1704">1704</span> +<span id="1705">1705</span> +<span id="1706">1706</span> +<span id="1707">1707</span> +<span id="1708">1708</span> +<span id="1709">1709</span> +<span id="1710">1710</span> +<span id="1711">1711</span> +<span id="1712">1712</span> +<span id="1713">1713</span> +<span id="1714">1714</span> +<span id="1715">1715</span> +<span id="1716">1716</span> +<span id="1717">1717</span> +<span id="1718">1718</span> +<span id="1719">1719</span> +<span id="1720">1720</span> +<span id="1721">1721</span> +<span id="1722">1722</span> +<span id="1723">1723</span> +<span id="1724">1724</span> +<span id="1725">1725</span> +<span id="1726">1726</span> +<span id="1727">1727</span> +<span id="1728">1728</span> +<span id="1729">1729</span> +<span id="1730">1730</span> +<span id="1731">1731</span> +<span id="1732">1732</span> +<span id="1733">1733</span> +<span id="1734">1734</span> +<span id="1735">1735</span> +<span id="1736">1736</span> +<span id="1737">1737</span> +<span id="1738">1738</span> +<span id="1739">1739</span> +<span id="1740">1740</span> +<span id="1741">1741</span> +<span id="1742">1742</span> +<span id="1743">1743</span> +<span id="1744">1744</span> +<span id="1745">1745</span> +<span id="1746">1746</span> +<span id="1747">1747</span> +<span id="1748">1748</span> +<span id="1749">1749</span> +<span id="1750">1750</span> +<span id="1751">1751</span> +<span id="1752">1752</span> +<span id="1753">1753</span> +<span id="1754">1754</span> +<span id="1755">1755</span> +<span id="1756">1756</span> +<span id="1757">1757</span> +<span id="1758">1758</span> +<span id="1759">1759</span> +<span id="1760">1760</span> +<span id="1761">1761</span> +<span id="1762">1762</span> +<span id="1763">1763</span> +<span id="1764">1764</span> +<span id="1765">1765</span> +<span id="1766">1766</span> +<span id="1767">1767</span> +<span id="1768">1768</span> +<span id="1769">1769</span> +<span id="1770">1770</span> +<span id="1771">1771</span> +<span id="1772">1772</span> +<span id="1773">1773</span> +<span id="1774">1774</span> +<span id="1775">1775</span> +<span id="1776">1776</span> +<span id="1777">1777</span> +<span id="1778">1778</span> +<span id="1779">1779</span> +<span id="1780">1780</span> +<span id="1781">1781</span> +<span id="1782">1782</span> +<span id="1783">1783</span> +<span id="1784">1784</span> +<span id="1785">1785</span> +<span id="1786">1786</span> +<span id="1787">1787</span> +<span id="1788">1788</span> +<span id="1789">1789</span> +<span id="1790">1790</span> +<span id="1791">1791</span> +<span id="1792">1792</span> +<span id="1793">1793</span> +<span id="1794">1794</span> +<span id="1795">1795</span> +<span id="1796">1796</span> +<span id="1797">1797</span> +<span id="1798">1798</span> +<span id="1799">1799</span> +<span id="1800">1800</span> +<span id="1801">1801</span> +<span id="1802">1802</span> +<span id="1803">1803</span> +<span id="1804">1804</span> +<span id="1805">1805</span> +<span id="1806">1806</span> +<span id="1807">1807</span> +<span id="1808">1808</span> +<span id="1809">1809</span> +<span id="1810">1810</span> +<span id="1811">1811</span> +<span id="1812">1812</span> +<span id="1813">1813</span> +<span id="1814">1814</span> +<span id="1815">1815</span> +<span id="1816">1816</span> +<span id="1817">1817</span> +<span id="1818">1818</span> +<span id="1819">1819</span> +<span id="1820">1820</span> +<span id="1821">1821</span> +<span id="1822">1822</span> +<span id="1823">1823</span> +<span id="1824">1824</span> +<span id="1825">1825</span> +<span id="1826">1826</span> +<span id="1827">1827</span> +<span id="1828">1828</span> +<span id="1829">1829</span> +<span id="1830">1830</span> +<span id="1831">1831</span> +<span id="1832">1832</span> +<span id="1833">1833</span> +<span id="1834">1834</span> +</pre><pre class="rust"><code><span class="kw">use </span>core::iter::FromIterator; +<span class="kw">use </span>core::mem::{<span class="self">self</span>, ManuallyDrop, MaybeUninit}; +<span class="kw">use </span>core::ops::{Deref, DerefMut}; +<span class="kw">use </span>core::ptr::{<span class="self">self</span>, NonNull}; +<span class="kw">use </span>core::{cmp, fmt, hash, isize, slice, usize}; + +<span class="kw">use </span>alloc::{ + borrow::{Borrow, BorrowMut}, + boxed::Box, + string::String, + vec, + vec::Vec, +}; + +<span class="kw">use </span><span class="kw">crate</span>::buf::{IntoIter, UninitSlice}; +<span class="kw">use </span><span class="kw">crate</span>::bytes::Vtable; +<span class="attr">#[allow(unused)] +</span><span class="kw">use </span><span class="kw">crate</span>::loom::sync::atomic::AtomicMut; +<span class="kw">use </span><span class="kw">crate</span>::loom::sync::atomic::{AtomicPtr, AtomicUsize, Ordering}; +<span class="kw">use crate</span>::{offset_from, Buf, BufMut, Bytes}; + +<span class="doccomment">/// A unique reference to a contiguous slice of memory. +/// +/// `BytesMut` represents a unique view into a potentially shared memory region. +/// Given the uniqueness guarantee, owners of `BytesMut` handles are able to +/// mutate the memory. +/// +/// `BytesMut` can be thought of as containing a `buf: Arc<Vec<u8>>`, an offset +/// into `buf`, a slice length, and a guarantee that no other `BytesMut` for the +/// same `buf` overlaps with its slice. That guarantee means that a write lock +/// is not required. +/// +/// # Growth +/// +/// `BytesMut`'s `BufMut` implementation will implicitly grow its buffer as +/// necessary. However, explicitly reserving the required space up-front before +/// a series of inserts will be more efficient. +/// +/// # Examples +/// +/// ``` +/// use bytes::{BytesMut, BufMut}; +/// +/// let mut buf = BytesMut::with_capacity(64); +/// +/// buf.put_u8(b'h'); +/// buf.put_u8(b'e'); +/// buf.put(&b"llo"[..]); +/// +/// assert_eq!(&buf[..], b"hello"); +/// +/// // Freeze the buffer so that it can be shared +/// let a = buf.freeze(); +/// +/// // This does not allocate, instead `b` points to the same memory. +/// let b = a.clone(); +/// +/// assert_eq!(&a[..], b"hello"); +/// assert_eq!(&b[..], b"hello"); +/// ``` +</span><span class="kw">pub struct </span>BytesMut { + ptr: NonNull<u8>, + len: usize, + cap: usize, + data: <span class="kw-2">*mut </span>Shared, +} + +<span class="comment">// Thread-safe reference-counted container for the shared storage. This mostly +// the same as `core::sync::Arc` but without the weak counter. The ref counting +// fns are based on the ones found in `std`. +// +// The main reason to use `Shared` instead of `core::sync::Arc` is that it ends +// up making the overall code simpler and easier to reason about. This is due to +// some of the logic around setting `Inner::arc` and other ways the `arc` field +// is used. Using `Arc` ended up requiring a number of funky transmutes and +// other shenanigans to make it work. +</span><span class="kw">struct </span>Shared { + vec: Vec<u8>, + original_capacity_repr: usize, + ref_count: AtomicUsize, +} + +<span class="comment">// Assert that the alignment of `Shared` is divisible by 2. +// This is a necessary invariant since we depend on allocating `Shared` a +// shared object to implicitly carry the `KIND_ARC` flag in its pointer. +// This flag is set when the LSB is 0. +</span><span class="kw">const _</span>: [(); <span class="number">0 </span>- mem::align_of::<Shared>() % <span class="number">2</span>] = []; <span class="comment">// Assert that the alignment of `Shared` is divisible by 2. + +// Buffer storage strategy flags. +</span><span class="kw">const </span>KIND_ARC: usize = <span class="number">0b0</span>; +<span class="kw">const </span>KIND_VEC: usize = <span class="number">0b1</span>; +<span class="kw">const </span>KIND_MASK: usize = <span class="number">0b1</span>; + +<span class="comment">// The max original capacity value. Any `Bytes` allocated with a greater initial +// capacity will default to this. +</span><span class="kw">const </span>MAX_ORIGINAL_CAPACITY_WIDTH: usize = <span class="number">17</span>; +<span class="comment">// The original capacity algorithm will not take effect unless the originally +// allocated capacity was at least 1kb in size. +</span><span class="kw">const </span>MIN_ORIGINAL_CAPACITY_WIDTH: usize = <span class="number">10</span>; +<span class="comment">// The original capacity is stored in powers of 2 starting at 1kb to a max of +// 64kb. Representing it as such requires only 3 bits of storage. +</span><span class="kw">const </span>ORIGINAL_CAPACITY_MASK: usize = <span class="number">0b11100</span>; +<span class="kw">const </span>ORIGINAL_CAPACITY_OFFSET: usize = <span class="number">2</span>; + +<span class="kw">const </span>VEC_POS_OFFSET: usize = <span class="number">5</span>; +<span class="comment">// When the storage is in the `Vec` representation, the pointer can be advanced +// at most this value. This is due to the amount of storage available to track +// the offset is usize - number of KIND bits and number of ORIGINAL_CAPACITY +// bits. +</span><span class="kw">const </span>MAX_VEC_POS: usize = usize::MAX >> VEC_POS_OFFSET; +<span class="kw">const </span>NOT_VEC_POS_MASK: usize = <span class="number">0b11111</span>; + +<span class="attr">#[cfg(target_pointer_width = <span class="string">"64"</span>)] +</span><span class="kw">const </span>PTR_WIDTH: usize = <span class="number">64</span>; +<span class="attr">#[cfg(target_pointer_width = <span class="string">"32"</span>)] +</span><span class="kw">const </span>PTR_WIDTH: usize = <span class="number">32</span>; + +<span class="comment">/* + * + * ===== BytesMut ===== + * + */ + +</span><span class="kw">impl </span>BytesMut { + <span class="doccomment">/// Creates a new `BytesMut` with the specified capacity. + /// + /// The returned `BytesMut` will be able to hold at least `capacity` bytes + /// without reallocating. + /// + /// It is important to note that this function does not specify the length + /// of the returned `BytesMut`, but only the capacity. + /// + /// # Examples + /// + /// ``` + /// use bytes::{BytesMut, BufMut}; + /// + /// let mut bytes = BytesMut::with_capacity(64); + /// + /// // `bytes` contains no data, even though there is capacity + /// assert_eq!(bytes.len(), 0); + /// + /// bytes.put(&b"hello world"[..]); + /// + /// assert_eq!(&bytes[..], b"hello world"); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>with_capacity(capacity: usize) -> BytesMut { + BytesMut::from_vec(Vec::with_capacity(capacity)) + } + + <span class="doccomment">/// Creates a new `BytesMut` with default capacity. + /// + /// Resulting object has length 0 and unspecified capacity. + /// This function does not allocate. + /// + /// # Examples + /// + /// ``` + /// use bytes::{BytesMut, BufMut}; + /// + /// let mut bytes = BytesMut::new(); + /// + /// assert_eq!(0, bytes.len()); + /// + /// bytes.reserve(2); + /// bytes.put_slice(b"xy"); + /// + /// assert_eq!(&b"xy"[..], &bytes[..]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>new() -> BytesMut { + BytesMut::with_capacity(<span class="number">0</span>) + } + + <span class="doccomment">/// Returns the number of bytes contained in this `BytesMut`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let b = BytesMut::from(&b"hello"[..]); + /// assert_eq!(b.len(), 5); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len + } + + <span class="doccomment">/// Returns true if the `BytesMut` has a length of 0. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let b = BytesMut::with_capacity(64); + /// assert!(b.is_empty()); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>is_empty(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + <span class="self">self</span>.len == <span class="number">0 + </span>} + + <span class="doccomment">/// Returns the number of bytes the `BytesMut` can hold without reallocating. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let b = BytesMut::with_capacity(64); + /// assert_eq!(b.capacity(), 64); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>capacity(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.cap + } + + <span class="doccomment">/// Converts `self` into an immutable `Bytes`. + /// + /// The conversion is zero cost and is used to indicate that the slice + /// referenced by the handle will no longer be mutated. Once the conversion + /// is done, the handle can be cloned and shared across threads. + /// + /// # Examples + /// + /// ``` + /// use bytes::{BytesMut, BufMut}; + /// use std::thread; + /// + /// let mut b = BytesMut::with_capacity(64); + /// b.put(&b"hello world"[..]); + /// let b1 = b.freeze(); + /// let b2 = b1.clone(); + /// + /// let th = thread::spawn(move || { + /// assert_eq!(&b1[..], b"hello world"); + /// }); + /// + /// assert_eq!(&b2[..], b"hello world"); + /// th.join().unwrap(); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>freeze(<span class="self">self</span>) -> Bytes { + <span class="kw">let </span>bytes = ManuallyDrop::new(<span class="self">self</span>); + <span class="kw">if </span>bytes.kind() == KIND_VEC { + <span class="comment">// Just re-use `Bytes` internal Vec vtable + </span><span class="kw">unsafe </span>{ + <span class="kw">let </span>off = bytes.get_vec_pos(); + <span class="kw">let </span>vec = rebuild_vec(bytes.ptr.as_ptr(), bytes.len, bytes.cap, off); + <span class="kw">let </span><span class="kw-2">mut </span>b: Bytes = vec.into(); + b.advance(off); + b + } + } <span class="kw">else </span>{ + <span class="macro">debug_assert_eq!</span>(bytes.kind(), KIND_ARC); + + <span class="kw">let </span>ptr = bytes.ptr.as_ptr(); + <span class="kw">let </span>len = bytes.len; + <span class="kw">let </span>data = AtomicPtr::new(bytes.data.cast()); + <span class="kw">unsafe </span>{ Bytes::with_vtable(ptr, len, data, <span class="kw-2">&</span>SHARED_VTABLE) } + } + } + + <span class="doccomment">/// Creates a new `BytesMut`, which is initialized with zero. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let zeros = BytesMut::zeroed(42); + /// + /// assert_eq!(zeros.len(), 42); + /// zeros.into_iter().for_each(|x| assert_eq!(x, 0)); + /// ``` + </span><span class="kw">pub fn </span>zeroed(len: usize) -> BytesMut { + BytesMut::from_vec(<span class="macro">vec!</span>[<span class="number">0</span>; len]) + } + + <span class="doccomment">/// Splits the bytes into two at the given index. + /// + /// Afterwards `self` contains elements `[0, at)`, and the returned + /// `BytesMut` contains elements `[at, capacity)`. + /// + /// This is an `O(1)` operation that just increases the reference count + /// and sets a few indices. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut a = BytesMut::from(&b"hello world"[..]); + /// let mut b = a.split_off(5); + /// + /// a[0] = b'j'; + /// b[0] = b'!'; + /// + /// assert_eq!(&a[..], b"jello"); + /// assert_eq!(&b[..], b"!world"); + /// ``` + /// + /// # Panics + /// + /// Panics if `at > capacity`. + </span><span class="attr">#[must_use = <span class="string">"consider BytesMut::truncate if you don't need the other half"</span>] + </span><span class="kw">pub fn </span>split_off(<span class="kw-2">&mut </span><span class="self">self</span>, at: usize) -> BytesMut { + <span class="macro">assert!</span>( + at <= <span class="self">self</span>.capacity(), + <span class="string">"split_off out of bounds: {:?} <= {:?}"</span>, + at, + <span class="self">self</span>.capacity(), + ); + <span class="kw">unsafe </span>{ + <span class="kw">let </span><span class="kw-2">mut </span>other = <span class="self">self</span>.shallow_clone(); + <span class="comment">// SAFETY: We've checked that `at` <= `self.capacity()` above. + </span>other.advance_unchecked(at); + <span class="self">self</span>.cap = at; + <span class="self">self</span>.len = cmp::min(<span class="self">self</span>.len, at); + other + } + } + + <span class="doccomment">/// Removes the bytes from the current view, returning them in a new + /// `BytesMut` handle. + /// + /// Afterwards, `self` will be empty, but will retain any additional + /// capacity that it had before the operation. This is identical to + /// `self.split_to(self.len())`. + /// + /// This is an `O(1)` operation that just increases the reference count and + /// sets a few indices. + /// + /// # Examples + /// + /// ``` + /// use bytes::{BytesMut, BufMut}; + /// + /// let mut buf = BytesMut::with_capacity(1024); + /// buf.put(&b"hello world"[..]); + /// + /// let other = buf.split(); + /// + /// assert!(buf.is_empty()); + /// assert_eq!(1013, buf.capacity()); + /// + /// assert_eq!(other, b"hello world"[..]); + /// ``` + </span><span class="attr">#[must_use = <span class="string">"consider BytesMut::clear if you don't need the other half"</span>] + </span><span class="kw">pub fn </span>split(<span class="kw-2">&mut </span><span class="self">self</span>) -> BytesMut { + <span class="kw">let </span>len = <span class="self">self</span>.len(); + <span class="self">self</span>.split_to(len) + } + + <span class="doccomment">/// Splits the buffer into two at the given index. + /// + /// Afterwards `self` contains elements `[at, len)`, and the returned `BytesMut` + /// contains elements `[0, at)`. + /// + /// This is an `O(1)` operation that just increases the reference count and + /// sets a few indices. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut a = BytesMut::from(&b"hello world"[..]); + /// let mut b = a.split_to(5); + /// + /// a[0] = b'!'; + /// b[0] = b'j'; + /// + /// assert_eq!(&a[..], b"!world"); + /// assert_eq!(&b[..], b"jello"); + /// ``` + /// + /// # Panics + /// + /// Panics if `at > len`. + </span><span class="attr">#[must_use = <span class="string">"consider BytesMut::advance if you don't need the other half"</span>] + </span><span class="kw">pub fn </span>split_to(<span class="kw-2">&mut </span><span class="self">self</span>, at: usize) -> BytesMut { + <span class="macro">assert!</span>( + at <= <span class="self">self</span>.len(), + <span class="string">"split_to out of bounds: {:?} <= {:?}"</span>, + at, + <span class="self">self</span>.len(), + ); + + <span class="kw">unsafe </span>{ + <span class="kw">let </span><span class="kw-2">mut </span>other = <span class="self">self</span>.shallow_clone(); + <span class="comment">// SAFETY: We've checked that `at` <= `self.len()` and we know that `self.len()` <= + // `self.capacity()`. + </span><span class="self">self</span>.advance_unchecked(at); + other.cap = at; + other.len = at; + other + } + } + + <span class="doccomment">/// Shortens the buffer, keeping the first `len` bytes and dropping the + /// rest. + /// + /// If `len` is greater than the buffer's current length, this has no + /// effect. + /// + /// Existing underlying capacity is preserved. + /// + /// The [split_off](`Self::split_off()`) method can emulate `truncate`, but this causes the + /// excess bytes to be returned instead of dropped. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut buf = BytesMut::from(&b"hello world"[..]); + /// buf.truncate(5); + /// assert_eq!(buf, b"hello"[..]); + /// ``` + </span><span class="kw">pub fn </span>truncate(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) { + <span class="kw">if </span>len <= <span class="self">self</span>.len() { + <span class="comment">// SAFETY: Shrinking the buffer cannot expose uninitialized bytes. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.set_len(len) }; + } + } + + <span class="doccomment">/// Clears the buffer, removing all data. Existing capacity is preserved. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut buf = BytesMut::from(&b"hello world"[..]); + /// buf.clear(); + /// assert!(buf.is_empty()); + /// ``` + </span><span class="kw">pub fn </span>clear(<span class="kw-2">&mut </span><span class="self">self</span>) { + <span class="comment">// SAFETY: Setting the length to zero cannot expose uninitialized bytes. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.set_len(<span class="number">0</span>) }; + } + + <span class="doccomment">/// Resizes the buffer so that `len` is equal to `new_len`. + /// + /// If `new_len` is greater than `len`, the buffer is extended by the + /// difference with each additional byte set to `value`. If `new_len` is + /// less than `len`, the buffer is simply truncated. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut buf = BytesMut::new(); + /// + /// buf.resize(3, 0x1); + /// assert_eq!(&buf[..], &[0x1, 0x1, 0x1]); + /// + /// buf.resize(2, 0x2); + /// assert_eq!(&buf[..], &[0x1, 0x1]); + /// + /// buf.resize(4, 0x3); + /// assert_eq!(&buf[..], &[0x1, 0x1, 0x3, 0x3]); + /// ``` + </span><span class="kw">pub fn </span>resize(<span class="kw-2">&mut </span><span class="self">self</span>, new_len: usize, value: u8) { + <span class="kw">let </span>additional = <span class="kw">if let </span><span class="prelude-val">Some</span>(additional) = new_len.checked_sub(<span class="self">self</span>.len()) { + additional + } <span class="kw">else </span>{ + <span class="self">self</span>.truncate(new_len); + <span class="kw">return</span>; + }; + + <span class="kw">if </span>additional == <span class="number">0 </span>{ + <span class="kw">return</span>; + } + + <span class="self">self</span>.reserve(additional); + <span class="kw">let </span>dst = <span class="self">self</span>.spare_capacity_mut().as_mut_ptr(); + <span class="comment">// SAFETY: `spare_capacity_mut` returns a valid, properly aligned pointer and we've + // reserved enough space to write `additional` bytes. + </span><span class="kw">unsafe </span>{ ptr::write_bytes(dst, value, additional) }; + + <span class="comment">// SAFETY: There are at least `new_len` initialized bytes in the buffer so no + // uninitialized bytes are being exposed. + </span><span class="kw">unsafe </span>{ <span class="self">self</span>.set_len(new_len) }; + } + + <span class="doccomment">/// Sets the length of the buffer. + /// + /// This will explicitly set the size of the buffer without actually + /// modifying the data, so it is up to the caller to ensure that the data + /// has been initialized. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut b = BytesMut::from(&b"hello world"[..]); + /// + /// unsafe { + /// b.set_len(5); + /// } + /// + /// assert_eq!(&b[..], b"hello"); + /// + /// unsafe { + /// b.set_len(11); + /// } + /// + /// assert_eq!(&b[..], b"hello world"); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub unsafe fn </span>set_len(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) { + <span class="macro">debug_assert!</span>(len <= <span class="self">self</span>.cap, <span class="string">"set_len out of bounds"</span>); + <span class="self">self</span>.len = len; + } + + <span class="doccomment">/// Reserves capacity for at least `additional` more bytes to be inserted + /// into the given `BytesMut`. + /// + /// More than `additional` bytes may be reserved in order to avoid frequent + /// reallocations. A call to `reserve` may result in an allocation. + /// + /// Before allocating new buffer space, the function will attempt to reclaim + /// space in the existing buffer. If the current handle references a view + /// into a larger original buffer, and all other handles referencing part + /// of the same original buffer have been dropped, then the current view + /// can be copied/shifted to the front of the buffer and the handle can take + /// ownership of the full buffer, provided that the full buffer is large + /// enough to fit the requested additional capacity. + /// + /// This optimization will only happen if shifting the data from the current + /// view to the front of the buffer is not too expensive in terms of the + /// (amortized) time required. The precise condition is subject to change; + /// as of now, the length of the data being shifted needs to be at least as + /// large as the distance that it's shifted by. If the current view is empty + /// and the original buffer is large enough to fit the requested additional + /// capacity, then reallocations will never happen. + /// + /// # Examples + /// + /// In the following example, a new buffer is allocated. + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut buf = BytesMut::from(&b"hello"[..]); + /// buf.reserve(64); + /// assert!(buf.capacity() >= 69); + /// ``` + /// + /// In the following example, the existing buffer is reclaimed. + /// + /// ``` + /// use bytes::{BytesMut, BufMut}; + /// + /// let mut buf = BytesMut::with_capacity(128); + /// buf.put(&[0; 64][..]); + /// + /// let ptr = buf.as_ptr(); + /// let other = buf.split(); + /// + /// assert!(buf.is_empty()); + /// assert_eq!(buf.capacity(), 64); + /// + /// drop(other); + /// buf.reserve(128); + /// + /// assert_eq!(buf.capacity(), 128); + /// assert_eq!(buf.as_ptr(), ptr); + /// ``` + /// + /// # Panics + /// + /// Panics if the new capacity overflows `usize`. + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>reserve(<span class="kw-2">&mut </span><span class="self">self</span>, additional: usize) { + <span class="kw">let </span>len = <span class="self">self</span>.len(); + <span class="kw">let </span>rem = <span class="self">self</span>.capacity() - len; + + <span class="kw">if </span>additional <= rem { + <span class="comment">// The handle can already store at least `additional` more bytes, so + // there is no further work needed to be done. + </span><span class="kw">return</span>; + } + + <span class="self">self</span>.reserve_inner(additional); + } + + <span class="comment">// In separate function to allow the short-circuits in `reserve` to + // be inline-able. Significant helps performance. + </span><span class="kw">fn </span>reserve_inner(<span class="kw-2">&mut </span><span class="self">self</span>, additional: usize) { + <span class="kw">let </span>len = <span class="self">self</span>.len(); + <span class="kw">let </span>kind = <span class="self">self</span>.kind(); + + <span class="kw">if </span>kind == KIND_VEC { + <span class="comment">// If there's enough free space before the start of the buffer, then + // just copy the data backwards and reuse the already-allocated + // space. + // + // Otherwise, since backed by a vector, use `Vec::reserve` + // + // We need to make sure that this optimization does not kill the + // amortized runtimes of BytesMut's operations. + </span><span class="kw">unsafe </span>{ + <span class="kw">let </span>off = <span class="self">self</span>.get_vec_pos(); + + <span class="comment">// Only reuse space if we can satisfy the requested additional space. + // + // Also check if the value of `off` suggests that enough bytes + // have been read to account for the overhead of shifting all + // the data (in an amortized analysis). + // Hence the condition `off >= self.len()`. + // + // This condition also already implies that the buffer is going + // to be (at least) half-empty in the end; so we do not break + // the (amortized) runtime with future resizes of the underlying + // `Vec`. + // + // [For more details check issue #524, and PR #525.] + </span><span class="kw">if </span><span class="self">self</span>.capacity() - <span class="self">self</span>.len() + off >= additional && off >= <span class="self">self</span>.len() { + <span class="comment">// There's enough space, and it's not too much overhead: + // reuse the space! + // + // Just move the pointer back to the start after copying + // data back. + </span><span class="kw">let </span>base_ptr = <span class="self">self</span>.ptr.as_ptr().sub(off); + <span class="comment">// Since `off >= self.len()`, the two regions don't overlap. + </span>ptr::copy_nonoverlapping(<span class="self">self</span>.ptr.as_ptr(), base_ptr, <span class="self">self</span>.len); + <span class="self">self</span>.ptr = vptr(base_ptr); + <span class="self">self</span>.set_vec_pos(<span class="number">0</span>); + + <span class="comment">// Length stays constant, but since we moved backwards we + // can gain capacity back. + </span><span class="self">self</span>.cap += off; + } <span class="kw">else </span>{ + <span class="comment">// Not enough space, or reusing might be too much overhead: + // allocate more space! + </span><span class="kw">let </span><span class="kw-2">mut </span>v = + ManuallyDrop::new(rebuild_vec(<span class="self">self</span>.ptr.as_ptr(), <span class="self">self</span>.len, <span class="self">self</span>.cap, off)); + v.reserve(additional); + + <span class="comment">// Update the info + </span><span class="self">self</span>.ptr = vptr(v.as_mut_ptr().add(off)); + <span class="self">self</span>.cap = v.capacity() - off; + <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.len, v.len() - off); + } + + <span class="kw">return</span>; + } + } + + <span class="macro">debug_assert_eq!</span>(kind, KIND_ARC); + <span class="kw">let </span>shared: <span class="kw-2">*mut </span>Shared = <span class="self">self</span>.data; + + <span class="comment">// Reserving involves abandoning the currently shared buffer and + // allocating a new vector with the requested capacity. + // + // Compute the new capacity + </span><span class="kw">let </span><span class="kw-2">mut </span>new_cap = len.checked_add(additional).expect(<span class="string">"overflow"</span>); + + <span class="kw">unsafe </span>{ + <span class="comment">// First, try to reclaim the buffer. This is possible if the current + // handle is the only outstanding handle pointing to the buffer. + </span><span class="kw">if </span>(<span class="kw-2">*</span>shared).is_unique() { + <span class="comment">// This is the only handle to the buffer. It can be reclaimed. + // However, before doing the work of copying data, check to make + // sure that the vector has enough capacity. + </span><span class="kw">let </span>v = <span class="kw-2">&mut </span>(<span class="kw-2">*</span>shared).vec; + + <span class="kw">let </span>v_capacity = v.capacity(); + <span class="kw">let </span>ptr = v.as_mut_ptr(); + + <span class="kw">let </span>offset = offset_from(<span class="self">self</span>.ptr.as_ptr(), ptr); + + <span class="comment">// Compare the condition in the `kind == KIND_VEC` case above + // for more details. + </span><span class="kw">if </span>v_capacity >= new_cap + offset { + <span class="self">self</span>.cap = new_cap; + <span class="comment">// no copy is necessary + </span>} <span class="kw">else if </span>v_capacity >= new_cap && offset >= len { + <span class="comment">// The capacity is sufficient, and copying is not too much + // overhead: reclaim the buffer! + + // `offset >= len` means: no overlap + </span>ptr::copy_nonoverlapping(<span class="self">self</span>.ptr.as_ptr(), ptr, len); + + <span class="self">self</span>.ptr = vptr(ptr); + <span class="self">self</span>.cap = v.capacity(); + } <span class="kw">else </span>{ + <span class="comment">// calculate offset + </span><span class="kw">let </span>off = (<span class="self">self</span>.ptr.as_ptr() <span class="kw">as </span>usize) - (v.as_ptr() <span class="kw">as </span>usize); + + <span class="comment">// new_cap is calculated in terms of `BytesMut`, not the underlying + // `Vec`, so it does not take the offset into account. + // + // Thus we have to manually add it here. + </span>new_cap = new_cap.checked_add(off).expect(<span class="string">"overflow"</span>); + + <span class="comment">// The vector capacity is not sufficient. The reserve request is + // asking for more than the initial buffer capacity. Allocate more + // than requested if `new_cap` is not much bigger than the current + // capacity. + // + // There are some situations, using `reserve_exact` that the + // buffer capacity could be below `original_capacity`, so do a + // check. + </span><span class="kw">let </span>double = v.capacity().checked_shl(<span class="number">1</span>).unwrap_or(new_cap); + + new_cap = cmp::max(double, new_cap); + + <span class="comment">// No space - allocate more + // + // The length field of `Shared::vec` is not used by the `BytesMut`; + // instead we use the `len` field in the `BytesMut` itself. However, + // when calling `reserve`, it doesn't guarantee that data stored in + // the unused capacity of the vector is copied over to the new + // allocation, so we need to ensure that we don't have any data we + // care about in the unused capacity before calling `reserve`. + </span><span class="macro">debug_assert!</span>(off + len <= v.capacity()); + v.set_len(off + len); + v.reserve(new_cap - v.len()); + + <span class="comment">// Update the info + </span><span class="self">self</span>.ptr = vptr(v.as_mut_ptr().add(off)); + <span class="self">self</span>.cap = v.capacity() - off; + } + + <span class="kw">return</span>; + } + } + + <span class="kw">let </span>original_capacity_repr = <span class="kw">unsafe </span>{ (<span class="kw-2">*</span>shared).original_capacity_repr }; + <span class="kw">let </span>original_capacity = original_capacity_from_repr(original_capacity_repr); + + new_cap = cmp::max(new_cap, original_capacity); + + <span class="comment">// Create a new vector to store the data + </span><span class="kw">let </span><span class="kw-2">mut </span>v = ManuallyDrop::new(Vec::with_capacity(new_cap)); + + <span class="comment">// Copy the bytes + </span>v.extend_from_slice(<span class="self">self</span>.as_ref()); + + <span class="comment">// Release the shared handle. This must be done *after* the bytes are + // copied. + </span><span class="kw">unsafe </span>{ release_shared(shared) }; + + <span class="comment">// Update self + </span><span class="kw">let </span>data = (original_capacity_repr << ORIGINAL_CAPACITY_OFFSET) | KIND_VEC; + <span class="self">self</span>.data = invalid_ptr(data); + <span class="self">self</span>.ptr = vptr(v.as_mut_ptr()); + <span class="self">self</span>.cap = v.capacity(); + <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.len, v.len()); + } + + <span class="doccomment">/// Appends given bytes to this `BytesMut`. + /// + /// If this `BytesMut` object does not have enough capacity, it is resized + /// first. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut buf = BytesMut::with_capacity(0); + /// buf.extend_from_slice(b"aaabbb"); + /// buf.extend_from_slice(b"cccddd"); + /// + /// assert_eq!(b"aaabbbcccddd", &buf[..]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>extend_from_slice(<span class="kw-2">&mut </span><span class="self">self</span>, extend: <span class="kw-2">&</span>[u8]) { + <span class="kw">let </span>cnt = extend.len(); + <span class="self">self</span>.reserve(cnt); + + <span class="kw">unsafe </span>{ + <span class="kw">let </span>dst = <span class="self">self</span>.spare_capacity_mut(); + <span class="comment">// Reserved above + </span><span class="macro">debug_assert!</span>(dst.len() >= cnt); + + ptr::copy_nonoverlapping(extend.as_ptr(), dst.as_mut_ptr().cast(), cnt); + } + + <span class="kw">unsafe </span>{ + <span class="self">self</span>.advance_mut(cnt); + } + } + + <span class="doccomment">/// Absorbs a `BytesMut` that was previously split off. + /// + /// If the two `BytesMut` objects were previously contiguous and not mutated + /// in a way that causes re-allocation i.e., if `other` was created by + /// calling `split_off` on this `BytesMut`, then this is an `O(1)` operation + /// that just decreases a reference count and sets a few indices. + /// Otherwise this method degenerates to + /// `self.extend_from_slice(other.as_ref())`. + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// let mut buf = BytesMut::with_capacity(64); + /// buf.extend_from_slice(b"aaabbbcccddd"); + /// + /// let split = buf.split_off(6); + /// assert_eq!(b"aaabbb", &buf[..]); + /// assert_eq!(b"cccddd", &split[..]); + /// + /// buf.unsplit(split); + /// assert_eq!(b"aaabbbcccddd", &buf[..]); + /// ``` + </span><span class="kw">pub fn </span>unsplit(<span class="kw-2">&mut </span><span class="self">self</span>, other: BytesMut) { + <span class="kw">if </span><span class="self">self</span>.is_empty() { + <span class="kw-2">*</span><span class="self">self </span>= other; + <span class="kw">return</span>; + } + + <span class="kw">if let </span><span class="prelude-val">Err</span>(other) = <span class="self">self</span>.try_unsplit(other) { + <span class="self">self</span>.extend_from_slice(other.as_ref()); + } + } + + <span class="comment">// private + + // For now, use a `Vec` to manage the memory for us, but we may want to + // change that in the future to some alternate allocator strategy. + // + // Thus, we don't expose an easy way to construct from a `Vec` since an + // internal change could make a simple pattern (`BytesMut::from(vec)`) + // suddenly a lot more expensive. + </span><span class="attr">#[inline] + </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>from_vec(vec: Vec<u8>) -> BytesMut { + <span class="kw">let </span><span class="kw-2">mut </span>vec = ManuallyDrop::new(vec); + <span class="kw">let </span>ptr = vptr(vec.as_mut_ptr()); + <span class="kw">let </span>len = vec.len(); + <span class="kw">let </span>cap = vec.capacity(); + + <span class="kw">let </span>original_capacity_repr = original_capacity_to_repr(cap); + <span class="kw">let </span>data = (original_capacity_repr << ORIGINAL_CAPACITY_OFFSET) | KIND_VEC; + + BytesMut { + ptr, + len, + cap, + data: invalid_ptr(data), + } + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>as_slice(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="kw">unsafe </span>{ slice::from_raw_parts(<span class="self">self</span>.ptr.as_ptr(), <span class="self">self</span>.len) } + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>as_slice_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[u8] { + <span class="kw">unsafe </span>{ slice::from_raw_parts_mut(<span class="self">self</span>.ptr.as_ptr(), <span class="self">self</span>.len) } + } + + <span class="doccomment">/// Advance the buffer without bounds checking. + /// + /// # SAFETY + /// + /// The caller must ensure that `count` <= `self.cap`. + </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">unsafe fn </span>advance_unchecked(<span class="kw-2">&mut </span><span class="self">self</span>, count: usize) { + <span class="comment">// Setting the start to 0 is a no-op, so return early if this is the + // case. + </span><span class="kw">if </span>count == <span class="number">0 </span>{ + <span class="kw">return</span>; + } + + <span class="macro">debug_assert!</span>(count <= <span class="self">self</span>.cap, <span class="string">"internal: set_start out of bounds"</span>); + + <span class="kw">let </span>kind = <span class="self">self</span>.kind(); + + <span class="kw">if </span>kind == KIND_VEC { + <span class="comment">// Setting the start when in vec representation is a little more + // complicated. First, we have to track how far ahead the + // "start" of the byte buffer from the beginning of the vec. We + // also have to ensure that we don't exceed the maximum shift. + </span><span class="kw">let </span>pos = <span class="self">self</span>.get_vec_pos() + count; + + <span class="kw">if </span>pos <= MAX_VEC_POS { + <span class="self">self</span>.set_vec_pos(pos); + } <span class="kw">else </span>{ + <span class="comment">// The repr must be upgraded to ARC. This will never happen + // on 64 bit systems and will only happen on 32 bit systems + // when shifting past 134,217,727 bytes. As such, we don't + // worry too much about performance here. + </span><span class="self">self</span>.promote_to_shared(<span class="comment">/*ref_count = */ </span><span class="number">1</span>); + } + } + + <span class="comment">// Updating the start of the view is setting `ptr` to point to the + // new start and updating the `len` field to reflect the new length + // of the view. + </span><span class="self">self</span>.ptr = vptr(<span class="self">self</span>.ptr.as_ptr().add(count)); + <span class="self">self</span>.len = <span class="self">self</span>.len.checked_sub(count).unwrap_or(<span class="number">0</span>); + <span class="self">self</span>.cap -= count; + } + + <span class="kw">fn </span>try_unsplit(<span class="kw-2">&mut </span><span class="self">self</span>, other: BytesMut) -> <span class="prelude-ty">Result</span><(), BytesMut> { + <span class="kw">if </span>other.capacity() == <span class="number">0 </span>{ + <span class="kw">return </span><span class="prelude-val">Ok</span>(()); + } + + <span class="kw">let </span>ptr = <span class="kw">unsafe </span>{ <span class="self">self</span>.ptr.as_ptr().add(<span class="self">self</span>.len) }; + <span class="kw">if </span>ptr == other.ptr.as_ptr() + && <span class="self">self</span>.kind() == KIND_ARC + && other.kind() == KIND_ARC + && <span class="self">self</span>.data == other.data + { + <span class="comment">// Contiguous blocks, just combine directly + </span><span class="self">self</span>.len += other.len; + <span class="self">self</span>.cap += other.cap; + <span class="prelude-val">Ok</span>(()) + } <span class="kw">else </span>{ + <span class="prelude-val">Err</span>(other) + } + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>kind(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.data <span class="kw">as </span>usize & KIND_MASK + } + + <span class="kw">unsafe fn </span>promote_to_shared(<span class="kw-2">&mut </span><span class="self">self</span>, ref_cnt: usize) { + <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.kind(), KIND_VEC); + <span class="macro">debug_assert!</span>(ref_cnt == <span class="number">1 </span>|| ref_cnt == <span class="number">2</span>); + + <span class="kw">let </span>original_capacity_repr = + (<span class="self">self</span>.data <span class="kw">as </span>usize & ORIGINAL_CAPACITY_MASK) >> ORIGINAL_CAPACITY_OFFSET; + + <span class="comment">// The vec offset cannot be concurrently mutated, so there + // should be no danger reading it. + </span><span class="kw">let </span>off = (<span class="self">self</span>.data <span class="kw">as </span>usize) >> VEC_POS_OFFSET; + + <span class="comment">// First, allocate a new `Shared` instance containing the + // `Vec` fields. It's important to note that `ptr`, `len`, + // and `cap` cannot be mutated without having `&mut self`. + // This means that these fields will not be concurrently + // updated and since the buffer hasn't been promoted to an + // `Arc`, those three fields still are the components of the + // vector. + </span><span class="kw">let </span>shared = Box::new(Shared { + vec: rebuild_vec(<span class="self">self</span>.ptr.as_ptr(), <span class="self">self</span>.len, <span class="self">self</span>.cap, off), + original_capacity_repr, + ref_count: AtomicUsize::new(ref_cnt), + }); + + <span class="kw">let </span>shared = Box::into_raw(shared); + + <span class="comment">// The pointer should be aligned, so this assert should + // always succeed. + </span><span class="macro">debug_assert_eq!</span>(shared <span class="kw">as </span>usize & KIND_MASK, KIND_ARC); + + <span class="self">self</span>.data = shared; + } + + <span class="doccomment">/// Makes an exact shallow clone of `self`. + /// + /// The kind of `self` doesn't matter, but this is unsafe + /// because the clone will have the same offsets. You must + /// be sure the returned value to the user doesn't allow + /// two views into the same range. + </span><span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>shallow_clone(<span class="kw-2">&mut </span><span class="self">self</span>) -> BytesMut { + <span class="kw">if </span><span class="self">self</span>.kind() == KIND_ARC { + increment_shared(<span class="self">self</span>.data); + ptr::read(<span class="self">self</span>) + } <span class="kw">else </span>{ + <span class="self">self</span>.promote_to_shared(<span class="comment">/*ref_count = */ </span><span class="number">2</span>); + ptr::read(<span class="self">self</span>) + } + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>get_vec_pos(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.kind(), KIND_VEC); + + <span class="self">self</span>.data <span class="kw">as </span>usize >> VEC_POS_OFFSET + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>set_vec_pos(<span class="kw-2">&mut </span><span class="self">self</span>, pos: usize) { + <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.kind(), KIND_VEC); + <span class="macro">debug_assert!</span>(pos <= MAX_VEC_POS); + + <span class="self">self</span>.data = invalid_ptr((pos << VEC_POS_OFFSET) | (<span class="self">self</span>.data <span class="kw">as </span>usize & NOT_VEC_POS_MASK)); + } + + <span class="doccomment">/// Returns the remaining spare capacity of the buffer as a slice of `MaybeUninit<u8>`. + /// + /// The returned slice can be used to fill the buffer with data (e.g. by + /// reading from a file) before marking the data as initialized using the + /// [`set_len`] method. + /// + /// [`set_len`]: BytesMut::set_len + /// + /// # Examples + /// + /// ``` + /// use bytes::BytesMut; + /// + /// // Allocate buffer big enough for 10 bytes. + /// let mut buf = BytesMut::with_capacity(10); + /// + /// // Fill in the first 3 elements. + /// let uninit = buf.spare_capacity_mut(); + /// uninit[0].write(0); + /// uninit[1].write(1); + /// uninit[2].write(2); + /// + /// // Mark the first 3 bytes of the buffer as being initialized. + /// unsafe { + /// buf.set_len(3); + /// } + /// + /// assert_eq!(&buf[..], &[0, 1, 2]); + /// ``` + </span><span class="attr">#[inline] + </span><span class="kw">pub fn </span>spare_capacity_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[MaybeUninit<u8>] { + <span class="kw">unsafe </span>{ + <span class="kw">let </span>ptr = <span class="self">self</span>.ptr.as_ptr().add(<span class="self">self</span>.len); + <span class="kw">let </span>len = <span class="self">self</span>.cap - <span class="self">self</span>.len; + + slice::from_raw_parts_mut(ptr.cast(), len) + } + } +} + +<span class="kw">impl </span>Drop <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>drop(<span class="kw-2">&mut </span><span class="self">self</span>) { + <span class="kw">let </span>kind = <span class="self">self</span>.kind(); + + <span class="kw">if </span>kind == KIND_VEC { + <span class="kw">unsafe </span>{ + <span class="kw">let </span>off = <span class="self">self</span>.get_vec_pos(); + + <span class="comment">// Vector storage, free the vector + </span><span class="kw">let _ </span>= rebuild_vec(<span class="self">self</span>.ptr.as_ptr(), <span class="self">self</span>.len, <span class="self">self</span>.cap, off); + } + } <span class="kw">else if </span>kind == KIND_ARC { + <span class="kw">unsafe </span>{ release_shared(<span class="self">self</span>.data) }; + } + } +} + +<span class="kw">impl </span>Buf <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_slice() + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>advance(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="comment">// Advancing by the length is the same as resetting the length to 0, + // except this way we get to reuse the full capacity. + </span><span class="kw">if </span>cnt == <span class="self">self</span>.remaining() { + <span class="self">self</span>.clear(); + <span class="kw">return</span>; + } + + <span class="macro">assert!</span>( + cnt <= <span class="self">self</span>.remaining(), + <span class="string">"cannot advance past `remaining`: {:?} <= {:?}"</span>, + cnt, + <span class="self">self</span>.remaining(), + ); + <span class="kw">unsafe </span>{ + <span class="comment">// SAFETY: We've checked that `cnt` <= `self.remaining()` and we know that + // `self.remaining()` <= `self.cap`. + </span><span class="self">self</span>.advance_unchecked(cnt); + } + } + + <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, len: usize) -> Bytes { + <span class="self">self</span>.split_to(len).freeze() + } +} + +<span class="kw">unsafe impl </span>BufMut <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&</span><span class="self">self</span>) -> usize { + usize::MAX - <span class="self">self</span>.len() + } + + <span class="attr">#[inline] + </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&mut </span><span class="self">self</span>, cnt: usize) { + <span class="kw">let </span>remaining = <span class="self">self</span>.cap - <span class="self">self</span>.len(); + <span class="kw">if </span>cnt > remaining { + <span class="kw">super</span>::panic_advance(cnt, remaining); + } + <span class="comment">// Addition won't overflow since it is at most `self.cap`. + </span><span class="self">self</span>.len = <span class="self">self</span>.len() + cnt; + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>UninitSlice { + <span class="kw">if </span><span class="self">self</span>.capacity() == <span class="self">self</span>.len() { + <span class="self">self</span>.reserve(<span class="number">64</span>); + } + <span class="self">self</span>.spare_capacity_mut().into() + } + + <span class="comment">// Specialize these methods so they can skip checking `remaining_mut` + // and `advance_mut`. + + </span><span class="kw">fn </span>put<T: Buf>(<span class="kw-2">&mut </span><span class="self">self</span>, <span class="kw-2">mut </span>src: T) + <span class="kw">where + </span><span class="self">Self</span>: Sized, + { + <span class="kw">while </span>src.has_remaining() { + <span class="kw">let </span>s = src.chunk(); + <span class="kw">let </span>l = s.len(); + <span class="self">self</span>.extend_from_slice(s); + src.advance(l); + } + } + + <span class="kw">fn </span>put_slice(<span class="kw-2">&mut </span><span class="self">self</span>, src: <span class="kw-2">&</span>[u8]) { + <span class="self">self</span>.extend_from_slice(src); + } + + <span class="kw">fn </span>put_bytes(<span class="kw-2">&mut </span><span class="self">self</span>, val: u8, cnt: usize) { + <span class="self">self</span>.reserve(cnt); + <span class="kw">unsafe </span>{ + <span class="kw">let </span>dst = <span class="self">self</span>.spare_capacity_mut(); + <span class="comment">// Reserved above + </span><span class="macro">debug_assert!</span>(dst.len() >= cnt); + + ptr::write_bytes(dst.as_mut_ptr(), val, cnt); + + <span class="self">self</span>.advance_mut(cnt); + } + } +} + +<span class="kw">impl </span>AsRef<[u8]> <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>as_ref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_slice() + } +} + +<span class="kw">impl </span>Deref <span class="kw">for </span>BytesMut { + <span class="kw">type </span>Target = [u8]; + + <span class="attr">#[inline] + </span><span class="kw">fn </span>deref(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_ref() + } +} + +<span class="kw">impl </span>AsMut<[u8]> <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>as_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[u8] { + <span class="self">self</span>.as_slice_mut() + } +} + +<span class="kw">impl </span>DerefMut <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>deref_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[u8] { + <span class="self">self</span>.as_mut() + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> From<<span class="kw-2">&</span><span class="lifetime">'a </span>[u8]> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>from(src: <span class="kw-2">&</span><span class="lifetime">'a </span>[u8]) -> BytesMut { + BytesMut::from_vec(src.to_vec()) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> From<<span class="kw-2">&</span><span class="lifetime">'a </span>str> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>from(src: <span class="kw-2">&</span><span class="lifetime">'a </span>str) -> BytesMut { + BytesMut::from(src.as_bytes()) + } +} + +<span class="kw">impl </span>From<BytesMut> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>from(src: BytesMut) -> Bytes { + src.freeze() + } +} + +<span class="kw">impl </span>PartialEq <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="self">self</span>.as_slice() == other.as_slice() + } +} + +<span class="kw">impl </span>PartialOrd <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.as_slice().partial_cmp(other.as_slice()) + } +} + +<span class="kw">impl </span>Ord <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> cmp::Ordering { + <span class="self">self</span>.as_slice().cmp(other.as_slice()) + } +} + +<span class="kw">impl </span>Eq <span class="kw">for </span>BytesMut {} + +<span class="kw">impl </span>Default <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>default() -> BytesMut { + BytesMut::new() + } +} + +<span class="kw">impl </span>hash::Hash <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>hash<H>(<span class="kw-2">&</span><span class="self">self</span>, state: <span class="kw-2">&mut </span>H) + <span class="kw">where + </span>H: hash::Hasher, + { + <span class="kw">let </span>s: <span class="kw-2">&</span>[u8] = <span class="self">self</span>.as_ref(); + s.hash(state); + } +} + +<span class="kw">impl </span>Borrow<[u8]> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>borrow(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>[u8] { + <span class="self">self</span>.as_ref() + } +} + +<span class="kw">impl </span>BorrowMut<[u8]> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>borrow_mut(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="kw-2">&mut </span>[u8] { + <span class="self">self</span>.as_mut() + } +} + +<span class="kw">impl </span>fmt::Write <span class="kw">for </span>BytesMut { + <span class="attr">#[inline] + </span><span class="kw">fn </span>write_str(<span class="kw-2">&mut </span><span class="self">self</span>, s: <span class="kw-2">&</span>str) -> fmt::Result { + <span class="kw">if </span><span class="self">self</span>.remaining_mut() >= s.len() { + <span class="self">self</span>.put_slice(s.as_bytes()); + <span class="prelude-val">Ok</span>(()) + } <span class="kw">else </span>{ + <span class="prelude-val">Err</span>(fmt::Error) + } + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>write_fmt(<span class="kw-2">&mut </span><span class="self">self</span>, args: fmt::Arguments<<span class="lifetime">'_</span>>) -> fmt::Result { + fmt::write(<span class="self">self</span>, args) + } +} + +<span class="kw">impl </span>Clone <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> BytesMut { + BytesMut::from(<span class="kw-2">&</span><span class="self">self</span>[..]) + } +} + +<span class="kw">impl </span>IntoIterator <span class="kw">for </span>BytesMut { + <span class="kw">type </span>Item = u8; + <span class="kw">type </span>IntoIter = IntoIter<BytesMut>; + + <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { + IntoIter::new(<span class="self">self</span>) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> IntoIterator <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'a </span>BytesMut { + <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>u8; + <span class="kw">type </span>IntoIter = core::slice::Iter<<span class="lifetime">'a</span>, u8>; + + <span class="kw">fn </span>into_iter(<span class="self">self</span>) -> <span class="self">Self</span>::IntoIter { + <span class="self">self</span>.as_ref().iter() + } +} + +<span class="kw">impl </span>Extend<u8> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>extend<T>(<span class="kw-2">&mut </span><span class="self">self</span>, iter: T) + <span class="kw">where + </span>T: IntoIterator<Item = u8>, + { + <span class="kw">let </span>iter = iter.into_iter(); + + <span class="kw">let </span>(lower, <span class="kw">_</span>) = iter.size_hint(); + <span class="self">self</span>.reserve(lower); + + <span class="comment">// TODO: optimize + // 1. If self.kind() == KIND_VEC, use Vec::extend + </span><span class="kw">for </span>b <span class="kw">in </span>iter { + <span class="self">self</span>.put_u8(b); + } + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> Extend<<span class="kw-2">&</span><span class="lifetime">'a </span>u8> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>extend<T>(<span class="kw-2">&mut </span><span class="self">self</span>, iter: T) + <span class="kw">where + </span>T: IntoIterator<Item = <span class="kw-2">&</span><span class="lifetime">'a </span>u8>, + { + <span class="self">self</span>.extend(iter.into_iter().copied()) + } +} + +<span class="kw">impl </span>Extend<Bytes> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>extend<T>(<span class="kw-2">&mut </span><span class="self">self</span>, iter: T) + <span class="kw">where + </span>T: IntoIterator<Item = Bytes>, + { + <span class="kw">for </span>bytes <span class="kw">in </span>iter { + <span class="self">self</span>.extend_from_slice(<span class="kw-2">&</span>bytes) + } + } +} + +<span class="kw">impl </span>FromIterator<u8> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>from_iter<T: IntoIterator<Item = u8>>(into_iter: T) -> <span class="self">Self </span>{ + BytesMut::from_vec(Vec::from_iter(into_iter)) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>> FromIterator<<span class="kw-2">&</span><span class="lifetime">'a </span>u8> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>from_iter<T: IntoIterator<Item = <span class="kw-2">&</span><span class="lifetime">'a </span>u8>>(into_iter: T) -> <span class="self">Self </span>{ + BytesMut::from_iter(into_iter.into_iter().copied()) + } +} + +<span class="comment">/* + * + * ===== Inner ===== + * + */ + +</span><span class="kw">unsafe fn </span>increment_shared(ptr: <span class="kw-2">*mut </span>Shared) { + <span class="kw">let </span>old_size = (<span class="kw-2">*</span>ptr).ref_count.fetch_add(<span class="number">1</span>, Ordering::Relaxed); + + <span class="kw">if </span>old_size > isize::MAX <span class="kw">as </span>usize { + <span class="kw">crate</span>::abort(); + } +} + +<span class="kw">unsafe fn </span>release_shared(ptr: <span class="kw-2">*mut </span>Shared) { + <span class="comment">// `Shared` storage... follow the drop steps from Arc. + </span><span class="kw">if </span>(<span class="kw-2">*</span>ptr).ref_count.fetch_sub(<span class="number">1</span>, Ordering::Release) != <span class="number">1 </span>{ + <span class="kw">return</span>; + } + + <span class="comment">// This fence is needed to prevent reordering of use of the data and + // deletion of the data. Because it is marked `Release`, the decreasing + // of the reference count synchronizes with this `Acquire` fence. This + // means that use of the data happens before decreasing the reference + // count, which happens before this fence, which happens before the + // deletion of the data. + // + // As explained in the [Boost documentation][1], + // + // > It is important to enforce any possible access to the object in one + // > thread (through an existing reference) to *happen before* deleting + // > the object in a different thread. This is achieved by a "release" + // > operation after dropping a reference (any access to the object + // > through this reference must obviously happened before), and an + // > "acquire" operation before deleting the object. + // + // [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html) + // + // Thread sanitizer does not support atomic fences. Use an atomic load + // instead. + </span>(<span class="kw-2">*</span>ptr).ref_count.load(Ordering::Acquire); + + <span class="comment">// Drop the data + </span>drop(Box::from_raw(ptr)); +} + +<span class="kw">impl </span>Shared { + <span class="kw">fn </span>is_unique(<span class="kw-2">&</span><span class="self">self</span>) -> bool { + <span class="comment">// The goal is to check if the current handle is the only handle + // that currently has access to the buffer. This is done by + // checking if the `ref_count` is currently 1. + // + // The `Acquire` ordering synchronizes with the `Release` as + // part of the `fetch_sub` in `release_shared`. The `fetch_sub` + // operation guarantees that any mutations done in other threads + // are ordered before the `ref_count` is decremented. As such, + // this `Acquire` will guarantee that those mutations are + // visible to the current thread. + </span><span class="self">self</span>.ref_count.load(Ordering::Acquire) == <span class="number">1 + </span>} +} + +<span class="attr">#[inline] +</span><span class="kw">fn </span>original_capacity_to_repr(cap: usize) -> usize { + <span class="kw">let </span>width = PTR_WIDTH - ((cap >> MIN_ORIGINAL_CAPACITY_WIDTH).leading_zeros() <span class="kw">as </span>usize); + cmp::min( + width, + MAX_ORIGINAL_CAPACITY_WIDTH - MIN_ORIGINAL_CAPACITY_WIDTH, + ) +} + +<span class="kw">fn </span>original_capacity_from_repr(repr: usize) -> usize { + <span class="kw">if </span>repr == <span class="number">0 </span>{ + <span class="kw">return </span><span class="number">0</span>; + } + + <span class="number">1 </span><< (repr + (MIN_ORIGINAL_CAPACITY_WIDTH - <span class="number">1</span>)) +} + +<span class="attr">#[cfg(test)] +</span><span class="kw">mod </span>tests { + <span class="kw">use super</span>::<span class="kw-2">*</span>; + + <span class="attr">#[test] + </span><span class="kw">fn </span>test_original_capacity_to_repr() { + <span class="macro">assert_eq!</span>(original_capacity_to_repr(<span class="number">0</span>), <span class="number">0</span>); + + <span class="kw">let </span>max_width = <span class="number">32</span>; + + <span class="kw">for </span>width <span class="kw">in </span><span class="number">1</span>..(max_width + <span class="number">1</span>) { + <span class="kw">let </span>cap = <span class="number">1 </span><< width - <span class="number">1</span>; + + <span class="kw">let </span>expected = <span class="kw">if </span>width < MIN_ORIGINAL_CAPACITY_WIDTH { + <span class="number">0 + </span>} <span class="kw">else if </span>width < MAX_ORIGINAL_CAPACITY_WIDTH { + width - MIN_ORIGINAL_CAPACITY_WIDTH + } <span class="kw">else </span>{ + MAX_ORIGINAL_CAPACITY_WIDTH - MIN_ORIGINAL_CAPACITY_WIDTH + }; + + <span class="macro">assert_eq!</span>(original_capacity_to_repr(cap), expected); + + <span class="kw">if </span>width > <span class="number">1 </span>{ + <span class="macro">assert_eq!</span>(original_capacity_to_repr(cap + <span class="number">1</span>), expected); + } + + <span class="comment">// MIN_ORIGINAL_CAPACITY_WIDTH must be bigger than 7 to pass tests below + </span><span class="kw">if </span>width == MIN_ORIGINAL_CAPACITY_WIDTH + <span class="number">1 </span>{ + <span class="macro">assert_eq!</span>(original_capacity_to_repr(cap - <span class="number">24</span>), expected - <span class="number">1</span>); + <span class="macro">assert_eq!</span>(original_capacity_to_repr(cap + <span class="number">76</span>), expected); + } <span class="kw">else if </span>width == MIN_ORIGINAL_CAPACITY_WIDTH + <span class="number">2 </span>{ + <span class="macro">assert_eq!</span>(original_capacity_to_repr(cap - <span class="number">1</span>), expected - <span class="number">1</span>); + <span class="macro">assert_eq!</span>(original_capacity_to_repr(cap - <span class="number">48</span>), expected - <span class="number">1</span>); + } + } + } + + <span class="attr">#[test] + </span><span class="kw">fn </span>test_original_capacity_from_repr() { + <span class="macro">assert_eq!</span>(<span class="number">0</span>, original_capacity_from_repr(<span class="number">0</span>)); + + <span class="kw">let </span>min_cap = <span class="number">1 </span><< MIN_ORIGINAL_CAPACITY_WIDTH; + + <span class="macro">assert_eq!</span>(min_cap, original_capacity_from_repr(<span class="number">1</span>)); + <span class="macro">assert_eq!</span>(min_cap * <span class="number">2</span>, original_capacity_from_repr(<span class="number">2</span>)); + <span class="macro">assert_eq!</span>(min_cap * <span class="number">4</span>, original_capacity_from_repr(<span class="number">3</span>)); + <span class="macro">assert_eq!</span>(min_cap * <span class="number">8</span>, original_capacity_from_repr(<span class="number">4</span>)); + <span class="macro">assert_eq!</span>(min_cap * <span class="number">16</span>, original_capacity_from_repr(<span class="number">5</span>)); + <span class="macro">assert_eq!</span>(min_cap * <span class="number">32</span>, original_capacity_from_repr(<span class="number">6</span>)); + <span class="macro">assert_eq!</span>(min_cap * <span class="number">64</span>, original_capacity_from_repr(<span class="number">7</span>)); + } +} + +<span class="kw">unsafe impl </span>Send <span class="kw">for </span>BytesMut {} +<span class="kw">unsafe impl </span>Sync <span class="kw">for </span>BytesMut {} + +<span class="comment">/* + * + * ===== PartialEq / PartialOrd ===== + * + */ + +</span><span class="kw">impl </span>PartialEq<[u8]> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>[u8]) -> bool { + <span class="kw-2">&**</span><span class="self">self </span>== other + } +} + +<span class="kw">impl </span>PartialOrd<[u8]> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>[u8]) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(other) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span>[u8] { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<BytesMut> <span class="kw">for </span>[u8] { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>, other) + } +} + +<span class="kw">impl </span>PartialEq<str> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>str) -> bool { + <span class="kw-2">&**</span><span class="self">self </span>== other.as_bytes() + } +} + +<span class="kw">impl </span>PartialOrd<str> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>str) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(other.as_bytes()) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span>str { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<BytesMut> <span class="kw">for </span>str { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>.as_bytes(), other) + } +} + +<span class="kw">impl </span>PartialEq<Vec<u8>> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Vec<u8>) -> bool { + <span class="kw-2">*</span><span class="self">self </span>== other[..] + } +} + +<span class="kw">impl </span>PartialOrd<Vec<u8>> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Vec<u8>) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(<span class="kw-2">&</span>other[..]) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span>Vec<u8> { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<BytesMut> <span class="kw">for </span>Vec<u8> { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + other.partial_cmp(<span class="self">self</span>) + } +} + +<span class="kw">impl </span>PartialEq<String> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>String) -> bool { + <span class="kw-2">*</span><span class="self">self </span>== other[..] + } +} + +<span class="kw">impl </span>PartialOrd<String> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>String) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(other.as_bytes()) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span>String { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<BytesMut> <span class="kw">for </span>String { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>.as_bytes(), other) + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>, T: <span class="question-mark">?</span>Sized> PartialEq<<span class="kw-2">&</span><span class="lifetime">'a </span>T> <span class="kw">for </span>BytesMut +<span class="kw">where + </span>BytesMut: PartialEq<T>, +{ + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: &&<span class="lifetime">'a </span>T) -> bool { + <span class="kw-2">*</span><span class="self">self </span>== <span class="kw-2">**</span>other + } +} + +<span class="kw">impl</span><<span class="lifetime">'a</span>, T: <span class="question-mark">?</span>Sized> PartialOrd<<span class="kw-2">&</span><span class="lifetime">'a </span>T> <span class="kw">for </span>BytesMut +<span class="kw">where + </span>BytesMut: PartialOrd<T>, +{ + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: &&<span class="lifetime">'a </span>T) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <span class="self">self</span>.partial_cmp(<span class="kw-2">*</span>other) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span><span class="kw-2">&</span>[u8] { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<BytesMut> <span class="kw">for </span><span class="kw-2">&</span>[u8] { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + <[u8] <span class="kw">as </span>PartialOrd<[u8]>>::partial_cmp(<span class="self">self</span>, other) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span><span class="kw-2">&</span>str { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self + </span>} +} + +<span class="kw">impl </span>PartialOrd<BytesMut> <span class="kw">for </span><span class="kw-2">&</span>str { + <span class="kw">fn </span>partial_cmp(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> <span class="prelude-ty">Option</span><cmp::Ordering> { + other.partial_cmp(<span class="self">self</span>) + } +} + +<span class="kw">impl </span>PartialEq<BytesMut> <span class="kw">for </span>Bytes { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>BytesMut) -> bool { + other[..] == <span class="self">self</span>[..] + } +} + +<span class="kw">impl </span>PartialEq<Bytes> <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span>Bytes) -> bool { + other[..] == <span class="self">self</span>[..] + } +} + +<span class="kw">impl </span>From<BytesMut> <span class="kw">for </span>Vec<u8> { + <span class="kw">fn </span>from(bytes: BytesMut) -> <span class="self">Self </span>{ + <span class="kw">let </span>kind = bytes.kind(); + <span class="kw">let </span>bytes = ManuallyDrop::new(bytes); + + <span class="kw">let </span><span class="kw-2">mut </span>vec = <span class="kw">if </span>kind == KIND_VEC { + <span class="kw">unsafe </span>{ + <span class="kw">let </span>off = bytes.get_vec_pos(); + rebuild_vec(bytes.ptr.as_ptr(), bytes.len, bytes.cap, off) + } + } <span class="kw">else </span>{ + <span class="kw">let </span>shared = bytes.data <span class="kw">as </span><span class="kw-2">*mut </span>Shared; + + <span class="kw">if unsafe </span>{ (<span class="kw-2">*</span>shared).is_unique() } { + <span class="kw">let </span>vec = mem::replace(<span class="kw">unsafe </span>{ <span class="kw-2">&mut </span>(<span class="kw-2">*</span>shared).vec }, Vec::new()); + + <span class="kw">unsafe </span>{ release_shared(shared) }; + + vec + } <span class="kw">else </span>{ + <span class="kw">return </span>ManuallyDrop::into_inner(bytes).deref().to_vec(); + } + }; + + <span class="kw">let </span>len = bytes.len; + + <span class="kw">unsafe </span>{ + ptr::copy(bytes.ptr.as_ptr(), vec.as_mut_ptr(), len); + vec.set_len(len); + } + + vec + } +} + +<span class="attr">#[inline] +</span><span class="kw">fn </span>vptr(ptr: <span class="kw-2">*mut </span>u8) -> NonNull<u8> { + <span class="kw">if </span><span class="macro">cfg!</span>(debug_assertions) { + NonNull::new(ptr).expect(<span class="string">"Vec pointer should be non-null"</span>) + } <span class="kw">else </span>{ + <span class="kw">unsafe </span>{ NonNull::new_unchecked(ptr) } + } +} + +<span class="doccomment">/// Returns a dangling pointer with the given address. This is used to store +/// integer data in pointer fields. +/// +/// It is equivalent to `addr as *mut T`, but this fails on miri when strict +/// provenance checking is enabled. +</span><span class="attr">#[inline] +</span><span class="kw">fn </span>invalid_ptr<T>(addr: usize) -> <span class="kw-2">*mut </span>T { + <span class="kw">let </span>ptr = core::ptr::null_mut::<u8>().wrapping_add(addr); + <span class="macro">debug_assert_eq!</span>(ptr <span class="kw">as </span>usize, addr); + ptr.cast::<T>() +} + +<span class="kw">unsafe fn </span>rebuild_vec(ptr: <span class="kw-2">*mut </span>u8, <span class="kw-2">mut </span>len: usize, <span class="kw-2">mut </span>cap: usize, off: usize) -> Vec<u8> { + <span class="kw">let </span>ptr = ptr.sub(off); + len += off; + cap += off; + + Vec::from_raw_parts(ptr, len, cap) +} + +<span class="comment">// ===== impl SharedVtable ===== + +</span><span class="kw">static </span>SHARED_VTABLE: Vtable = Vtable { + clone: shared_v_clone, + to_vec: shared_v_to_vec, + to_mut: shared_v_to_mut, + is_unique: <span class="kw">crate</span>::bytes::shared_is_unique, + drop: shared_v_drop, +}; + +<span class="kw">unsafe fn </span>shared_v_clone(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Bytes { + <span class="kw">let </span>shared = data.load(Ordering::Relaxed) <span class="kw">as </span><span class="kw-2">*mut </span>Shared; + increment_shared(shared); + + <span class="kw">let </span>data = AtomicPtr::new(shared <span class="kw">as </span><span class="kw-2">*mut </span>()); + Bytes::with_vtable(ptr, len, data, <span class="kw-2">&</span>SHARED_VTABLE) +} + +<span class="kw">unsafe fn </span>shared_v_to_vec(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> Vec<u8> { + <span class="kw">let </span>shared: <span class="kw-2">*mut </span>Shared = data.load(Ordering::Relaxed).cast(); + + <span class="kw">if </span>(<span class="kw-2">*</span>shared).is_unique() { + <span class="kw">let </span>shared = <span class="kw-2">&mut *</span>shared; + + <span class="comment">// Drop shared + </span><span class="kw">let </span><span class="kw-2">mut </span>vec = mem::replace(<span class="kw-2">&mut </span>shared.vec, Vec::new()); + release_shared(shared); + + <span class="comment">// Copy back buffer + </span>ptr::copy(ptr, vec.as_mut_ptr(), len); + vec.set_len(len); + + vec + } <span class="kw">else </span>{ + <span class="kw">let </span>v = slice::from_raw_parts(ptr, len).to_vec(); + release_shared(shared); + v + } +} + +<span class="kw">unsafe fn </span>shared_v_to_mut(data: <span class="kw-2">&</span>AtomicPtr<()>, ptr: <span class="kw-2">*const </span>u8, len: usize) -> BytesMut { + <span class="kw">let </span>shared: <span class="kw-2">*mut </span>Shared = data.load(Ordering::Relaxed).cast(); + + <span class="kw">if </span>(<span class="kw-2">*</span>shared).is_unique() { + <span class="kw">let </span>shared = <span class="kw-2">&mut *</span>shared; + + <span class="comment">// The capacity is always the original capacity of the buffer + // minus the offset from the start of the buffer + </span><span class="kw">let </span>v = <span class="kw-2">&mut </span>shared.vec; + <span class="kw">let </span>v_capacity = v.capacity(); + <span class="kw">let </span>v_ptr = v.as_mut_ptr(); + <span class="kw">let </span>offset = offset_from(ptr <span class="kw">as </span><span class="kw-2">*mut </span>u8, v_ptr); + <span class="kw">let </span>cap = v_capacity - offset; + + <span class="kw">let </span>ptr = vptr(ptr <span class="kw">as </span><span class="kw-2">*mut </span>u8); + + BytesMut { + ptr, + len, + cap, + data: shared, + } + } <span class="kw">else </span>{ + <span class="kw">let </span>v = slice::from_raw_parts(ptr, len).to_vec(); + release_shared(shared); + BytesMut::from_vec(v) + } +} + +<span class="kw">unsafe fn </span>shared_v_drop(data: <span class="kw-2">&mut </span>AtomicPtr<()>, _ptr: <span class="kw-2">*const </span>u8, _len: usize) { + data.with_mut(|shared| { + release_shared(<span class="kw-2">*</span>shared <span class="kw">as </span><span class="kw-2">*mut </span>Shared); + }); +} + +<span class="comment">// compile-fails + +</span><span class="doccomment">/// ```compile_fail +/// use bytes::BytesMut; +/// #[deny(unused_must_use)] +/// { +/// let mut b1 = BytesMut::from("hello world"); +/// b1.split_to(6); +/// } +/// ``` +</span><span class="kw">fn </span>_split_to_must_use() {} + +<span class="doccomment">/// ```compile_fail +/// use bytes::BytesMut; +/// #[deny(unused_must_use)] +/// { +/// let mut b1 = BytesMut::from("hello world"); +/// b1.split_off(6); +/// } +/// ``` +</span><span class="kw">fn </span>_split_off_must_use() {} + +<span class="doccomment">/// ```compile_fail +/// use bytes::BytesMut; +/// #[deny(unused_must_use)] +/// { +/// let mut b1 = BytesMut::from("hello world"); +/// b1.split(); +/// } +/// ``` +</span><span class="kw">fn </span>_split_must_use() {} + +<span class="comment">// fuzz tests +</span><span class="attr">#[cfg(all(test, loom))] +</span><span class="kw">mod </span>fuzz { + <span class="kw">use </span>loom::sync::Arc; + <span class="kw">use </span>loom::thread; + + <span class="kw">use </span><span class="kw">super</span>::BytesMut; + <span class="kw">use </span><span class="kw">crate</span>::Bytes; + + <span class="attr">#[test] + </span><span class="kw">fn </span>bytes_mut_cloning_frozen() { + loom::model(|| { + <span class="kw">let </span>a = BytesMut::from(<span class="kw-2">&</span><span class="string">b"abcdefgh"</span>[..]).split().freeze(); + <span class="kw">let </span>addr = a.as_ptr() <span class="kw">as </span>usize; + + <span class="comment">// test the Bytes::clone is Sync by putting it in an Arc + </span><span class="kw">let </span>a1 = Arc::new(a); + <span class="kw">let </span>a2 = a1.clone(); + + <span class="kw">let </span>t1 = thread::spawn(<span class="kw">move </span>|| { + <span class="kw">let </span>b: Bytes = (<span class="kw-2">*</span>a1).clone(); + <span class="macro">assert_eq!</span>(b.as_ptr() <span class="kw">as </span>usize, addr); + }); + + <span class="kw">let </span>t2 = thread::spawn(<span class="kw">move </span>|| { + <span class="kw">let </span>b: Bytes = (<span class="kw-2">*</span>a2).clone(); + <span class="macro">assert_eq!</span>(b.as_ptr() <span class="kw">as </span>usize, addr); + }); + + t1.join().unwrap(); + t2.join().unwrap(); + }); + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/fmt/debug.rs.html b/src/bytes/fmt/debug.rs.html new file mode 100644 index 0000000..f3aa0df --- /dev/null +++ b/src/bytes/fmt/debug.rs.html @@ -0,0 +1,100 @@ +<!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 `src/fmt/debug.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>debug.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span>core::fmt::{Debug, Formatter, <span class="prelude-ty">Result</span>}; + +<span class="kw">use </span><span class="kw">super</span>::BytesRef; +<span class="kw">use crate</span>::{Bytes, BytesMut}; + +<span class="doccomment">/// Alternative implementation of `std::fmt::Debug` for byte slice. +/// +/// Standard `Debug` implementation for `[u8]` is comma separated +/// list of numbers. Since large amount of byte strings are in fact +/// ASCII strings or contain a lot of ASCII strings (e. g. HTTP), +/// it is convenient to print strings as ASCII when possible. +</span><span class="kw">impl </span>Debug <span class="kw">for </span>BytesRef<<span class="lifetime">'_</span>> { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>Formatter<<span class="lifetime">'_</span>>) -> <span class="prelude-ty">Result </span>{ + <span class="macro">write!</span>(f, <span class="string">"b\""</span>)<span class="question-mark">?</span>; + <span class="kw">for </span><span class="kw-2">&</span>b <span class="kw">in </span><span class="self">self</span>.<span class="number">0 </span>{ + <span class="comment">// https://doc.rust-lang.org/reference/tokens.html#byte-escapes + </span><span class="kw">if </span>b == <span class="string">b'\n' </span>{ + <span class="macro">write!</span>(f, <span class="string">"\\n"</span>)<span class="question-mark">?</span>; + } <span class="kw">else if </span>b == <span class="string">b'\r' </span>{ + <span class="macro">write!</span>(f, <span class="string">"\\r"</span>)<span class="question-mark">?</span>; + } <span class="kw">else if </span>b == <span class="string">b'\t' </span>{ + <span class="macro">write!</span>(f, <span class="string">"\\t"</span>)<span class="question-mark">?</span>; + } <span class="kw">else if </span>b == <span class="string">b'\\' </span>|| b == <span class="string">b'"' </span>{ + <span class="macro">write!</span>(f, <span class="string">"\\{}"</span>, b <span class="kw">as </span>char)<span class="question-mark">?</span>; + } <span class="kw">else if </span>b == <span class="string">b'\0' </span>{ + <span class="macro">write!</span>(f, <span class="string">"\\0"</span>)<span class="question-mark">?</span>; + <span class="comment">// ASCII printable + </span>} <span class="kw">else if </span>(<span class="number">0x20</span>..<span class="number">0x7f</span>).contains(<span class="kw-2">&</span>b) { + <span class="macro">write!</span>(f, <span class="string">"{}"</span>, b <span class="kw">as </span>char)<span class="question-mark">?</span>; + } <span class="kw">else </span>{ + <span class="macro">write!</span>(f, <span class="string">"\\x{:02x}"</span>, b)<span class="question-mark">?</span>; + } + } + <span class="macro">write!</span>(f, <span class="string">"\""</span>)<span class="question-mark">?</span>; + <span class="prelude-val">Ok</span>(()) + } +} + +<span class="kw">impl </span>Debug <span class="kw">for </span>Bytes { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>Formatter<<span class="lifetime">'_</span>>) -> <span class="prelude-ty">Result </span>{ + Debug::fmt(<span class="kw-2">&</span>BytesRef(<span class="self">self</span>.as_ref()), f) + } +} + +<span class="kw">impl </span>Debug <span class="kw">for </span>BytesMut { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>Formatter<<span class="lifetime">'_</span>>) -> <span class="prelude-ty">Result </span>{ + Debug::fmt(<span class="kw-2">&</span>BytesRef(<span class="self">self</span>.as_ref()), f) + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/fmt/hex.rs.html b/src/bytes/fmt/hex.rs.html new file mode 100644 index 0000000..3554e0e --- /dev/null +++ b/src/bytes/fmt/hex.rs.html @@ -0,0 +1,76 @@ +<!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 `src/fmt/hex.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>hex.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use </span>core::fmt::{Formatter, LowerHex, <span class="prelude-ty">Result</span>, UpperHex}; + +<span class="kw">use </span><span class="kw">super</span>::BytesRef; +<span class="kw">use crate</span>::{Bytes, BytesMut}; + +<span class="kw">impl </span>LowerHex <span class="kw">for </span>BytesRef<<span class="lifetime">'_</span>> { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>Formatter<<span class="lifetime">'_</span>>) -> <span class="prelude-ty">Result </span>{ + <span class="kw">for </span><span class="kw-2">&</span>b <span class="kw">in </span><span class="self">self</span>.<span class="number">0 </span>{ + <span class="macro">write!</span>(f, <span class="string">"{:02x}"</span>, b)<span class="question-mark">?</span>; + } + <span class="prelude-val">Ok</span>(()) + } +} + +<span class="kw">impl </span>UpperHex <span class="kw">for </span>BytesRef<<span class="lifetime">'_</span>> { + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>Formatter<<span class="lifetime">'_</span>>) -> <span class="prelude-ty">Result </span>{ + <span class="kw">for </span><span class="kw-2">&</span>b <span class="kw">in </span><span class="self">self</span>.<span class="number">0 </span>{ + <span class="macro">write!</span>(f, <span class="string">"{:02X}"</span>, b)<span class="question-mark">?</span>; + } + <span class="prelude-val">Ok</span>(()) + } +} + +<span class="macro">macro_rules! </span>hex_impl { + (<span class="macro-nonterminal">$tr</span>:ident, <span class="macro-nonterminal">$ty</span>:ty) => { + <span class="kw">impl </span><span class="macro-nonterminal">$tr </span><span class="kw">for </span><span class="macro-nonterminal">$ty </span>{ + <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>Formatter<<span class="lifetime">'_</span>>) -> <span class="prelude-ty">Result </span>{ + <span class="macro-nonterminal">$tr::fmt</span>(<span class="kw-2">&</span>BytesRef(<span class="self">self</span>.as_ref()), f) + } + } + }; +} + +<span class="macro">hex_impl!</span>(LowerHex, Bytes); +<span class="macro">hex_impl!</span>(LowerHex, BytesMut); +<span class="macro">hex_impl!</span>(UpperHex, Bytes); +<span class="macro">hex_impl!</span>(UpperHex, BytesMut); +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/fmt/mod.rs.html b/src/bytes/fmt/mod.rs.html new file mode 100644 index 0000000..aafa5c7 --- /dev/null +++ b/src/bytes/fmt/mod.rs.html @@ -0,0 +1,12 @@ +<!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 `src/fmt/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../bytes/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">mod </span>debug; +<span class="kw">mod </span>hex; + +<span class="doccomment">/// `BytesRef` is not a part of public API of bytes crate. +</span><span class="kw">struct </span>BytesRef<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span>[u8]); +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-static-root-path="../../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/lib.rs.html b/src/bytes/lib.rs.html new file mode 100644 index 0000000..b9bfb3a --- /dev/null +++ b/src/bytes/lib.rs.html @@ -0,0 +1,332 @@ +<!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 `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="../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../source-files.js"></script><script defer src="../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../bytes/index.html"><img class="rust-logo" src="../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="attr">#![allow(unknown_lints, unexpected_cfgs)] +#![warn(missing_docs, missing_debug_implementations, rust_2018_idioms)] +#![doc(test( + no_crate_inject, + attr(deny(warnings, rust_2018_idioms), allow(dead_code, unused_variables)) +))] +#![no_std] +#![cfg_attr(docsrs, feature(doc_cfg))] + +</span><span class="doccomment">//! Provides abstractions for working with bytes. +//! +//! The `bytes` crate provides an efficient byte buffer structure +//! ([`Bytes`]) and traits for working with buffer +//! implementations ([`Buf`], [`BufMut`]). +//! +//! # `Bytes` +//! +//! `Bytes` is an efficient container for storing and operating on contiguous +//! slices of memory. It is intended for use primarily in networking code, but +//! could have applications elsewhere as well. +//! +//! `Bytes` values facilitate zero-copy network programming by allowing multiple +//! `Bytes` objects to point to the same underlying memory. This is managed by +//! using a reference count to track when the memory is no longer needed and can +//! be freed. +//! +//! A `Bytes` handle can be created directly from an existing byte store (such as `&[u8]` +//! or `Vec<u8>`), but usually a `BytesMut` is used first and written to. For +//! example: +//! +//! ```rust +//! use bytes::{BytesMut, BufMut}; +//! +//! let mut buf = BytesMut::with_capacity(1024); +//! buf.put(&b"hello world"[..]); +//! buf.put_u16(1234); +//! +//! let a = buf.split(); +//! assert_eq!(a, b"hello world\x04\xD2"[..]); +//! +//! buf.put(&b"goodbye world"[..]); +//! +//! let b = buf.split(); +//! assert_eq!(b, b"goodbye world"[..]); +//! +//! assert_eq!(buf.capacity(), 998); +//! ``` +//! +//! In the above example, only a single buffer of 1024 is allocated. The handles +//! `a` and `b` will share the underlying buffer and maintain indices tracking +//! the view into the buffer represented by the handle. +//! +//! See the [struct docs](`Bytes`) for more details. +//! +//! # `Buf`, `BufMut` +//! +//! These two traits provide read and write access to buffers. The underlying +//! storage may or may not be in contiguous memory. For example, `Bytes` is a +//! buffer that guarantees contiguous memory, but a [rope] stores the bytes in +//! disjoint chunks. `Buf` and `BufMut` maintain cursors tracking the current +//! position in the underlying byte storage. When bytes are read or written, the +//! cursor is advanced. +//! +//! [rope]: https://en.wikipedia.org/wiki/Rope_(data_structure) +//! +//! ## Relation with `Read` and `Write` +//! +//! At first glance, it may seem that `Buf` and `BufMut` overlap in +//! functionality with [`std::io::Read`] and [`std::io::Write`]. However, they +//! serve different purposes. A buffer is the value that is provided as an +//! argument to `Read::read` and `Write::write`. `Read` and `Write` may then +//! perform a syscall, which has the potential of failing. Operations on `Buf` +//! and `BufMut` are infallible. + +</span><span class="kw">extern crate </span>alloc; + +<span class="attr">#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">extern crate </span>std; + +<span class="kw">pub mod </span>buf; +<span class="kw">pub use </span><span class="kw">crate</span>::buf::{Buf, BufMut}; + +<span class="kw">mod </span>bytes; +<span class="kw">mod </span>bytes_mut; +<span class="kw">mod </span>fmt; +<span class="kw">mod </span>loom; +<span class="kw">pub use </span><span class="kw">crate</span>::bytes::Bytes; +<span class="kw">pub use </span><span class="kw">crate</span>::bytes_mut::BytesMut; + +<span class="comment">// Optional Serde support +</span><span class="attr">#[cfg(feature = <span class="string">"serde"</span>)] +</span><span class="kw">mod </span>serde; + +<span class="attr">#[inline(never)] +#[cold] +</span><span class="kw">fn </span>abort() -> ! { + <span class="attr">#[cfg(feature = <span class="string">"std"</span>)] + </span>{ + std::process::abort(); + } + + <span class="attr">#[cfg(not(feature = <span class="string">"std"</span>))] + </span>{ + <span class="kw">struct </span>Abort; + <span class="kw">impl </span>Drop <span class="kw">for </span>Abort { + <span class="kw">fn </span>drop(<span class="kw-2">&mut </span><span class="self">self</span>) { + <span class="macro">panic!</span>(); + } + } + <span class="kw">let </span>_a = Abort; + <span class="macro">panic!</span>(<span class="string">"abort"</span>); + } +} + +<span class="attr">#[inline(always)] +#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">fn </span>saturating_sub_usize_u64(a: usize, b: u64) -> usize { + <span class="kw">use </span>core::convert::TryFrom; + <span class="kw">match </span>usize::try_from(b) { + <span class="prelude-val">Ok</span>(b) => a.saturating_sub(b), + <span class="prelude-val">Err</span>(<span class="kw">_</span>) => <span class="number">0</span>, + } +} + +<span class="attr">#[inline(always)] +#[cfg(feature = <span class="string">"std"</span>)] +</span><span class="kw">fn </span>min_u64_usize(a: u64, b: usize) -> usize { + <span class="kw">use </span>core::convert::TryFrom; + <span class="kw">match </span>usize::try_from(a) { + <span class="prelude-val">Ok</span>(a) => usize::min(a, b), + <span class="prelude-val">Err</span>(<span class="kw">_</span>) => b, + } +} + +<span class="doccomment">/// Panic with a nice error message. +</span><span class="attr">#[cold] +</span><span class="kw">fn </span>panic_advance(idx: usize, len: usize) -> ! { + <span class="macro">panic!</span>( + <span class="string">"advance out of bounds: the len is {} but advancing by {}"</span>, + len, idx + ); +} + +<span class="attr">#[cold] +</span><span class="kw">fn </span>panic_does_not_fit(size: usize, nbytes: usize) -> ! { + <span class="macro">panic!</span>( + <span class="string">"size too large: the integer type can fit {} bytes, but nbytes is {}"</span>, + size, nbytes + ); +} + +<span class="doccomment">/// Precondition: dst >= original +/// +/// The following line is equivalent to: +/// +/// ```rust,ignore +/// self.ptr.as_ptr().offset_from(ptr) as usize; +/// ``` +/// +/// But due to min rust is 1.39 and it is only stabilized +/// in 1.47, we cannot use it. +</span><span class="attr">#[inline] +</span><span class="kw">fn </span>offset_from(dst: <span class="kw-2">*const </span>u8, original: <span class="kw-2">*const </span>u8) -> usize { + dst <span class="kw">as </span>usize - original <span class="kw">as </span>usize +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/loom.rs.html b/src/bytes/loom.rs.html new file mode 100644 index 0000000..cc90586 --- /dev/null +++ b/src/bytes/loom.rs.html @@ -0,0 +1,62 @@ +<!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 `src/loom.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>loom.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../source-files.js"></script><script defer src="../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../bytes/index.html"><img class="rust-logo" src="../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="attr">#[cfg(not(all(test, loom)))] +</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>sync { + <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>atomic { + <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">use </span>core::sync::atomic::{AtomicPtr, AtomicUsize, Ordering}; + + <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">trait </span>AtomicMut<T> { + <span class="kw">fn </span>with_mut<F, R>(<span class="kw-2">&mut </span><span class="self">self</span>, f: F) -> R + <span class="kw">where + </span>F: FnOnce(<span class="kw-2">&mut *mut </span>T) -> R; + } + + <span class="kw">impl</span><T> AtomicMut<T> <span class="kw">for </span>AtomicPtr<T> { + <span class="kw">fn </span>with_mut<F, R>(<span class="kw-2">&mut </span><span class="self">self</span>, f: F) -> R + <span class="kw">where + </span>F: FnOnce(<span class="kw-2">&mut *mut </span>T) -> R, + { + f(<span class="self">self</span>.get_mut()) + } + } + } +} + +<span class="attr">#[cfg(all(test, loom))] +</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>sync { + <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">mod </span>atomic { + <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">use </span>loom::sync::atomic::{AtomicPtr, AtomicUsize, Ordering}; + + <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">trait </span>AtomicMut<T> {} + } +} +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file diff --git a/src/bytes/serde.rs.html b/src/bytes/serde.rs.html new file mode 100644 index 0000000..7946f8c --- /dev/null +++ b/src/bytes/serde.rs.html @@ -0,0 +1,180 @@ +<!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 `src/serde.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>serde.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-eabf764633b9d7be.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../static.files/light-777f3e9583f8c92d.css"><link rel="stylesheet" disabled href="../../static.files/dark-e2f4109f2e82e3af.css"><link rel="stylesheet" disabled href="../../static.files/ayu-c360e709a65bed99.css"><script id="default-settings" ></script><script src="../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../static.files/source-script-74087aa2e88f4475.js"></script><script defer src="../../source-files.js"></script><script defer src="../../static.files/main-c2d2a5dbaed13e6b.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../bytes/index.html"><img class="rust-logo" src="../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><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="../../static.files/wheel-5ec35bf9ca753509.svg"></a></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> +</pre><pre class="rust"><code><span class="kw">use super</span>::{Bytes, BytesMut}; +<span class="kw">use </span>alloc::string::String; +<span class="kw">use </span>alloc::vec::Vec; +<span class="kw">use </span>core::{cmp, fmt}; +<span class="kw">use </span>serde::{de, Deserialize, Deserializer, Serialize, Serializer}; + +<span class="macro">macro_rules! </span>serde_impl { + (<span class="macro-nonterminal">$ty</span>:ident, <span class="macro-nonterminal">$visitor_ty</span>:ident, <span class="macro-nonterminal">$from_slice</span>:ident, <span class="macro-nonterminal">$from_vec</span>:ident) => { + <span class="kw">impl </span>Serialize <span class="kw">for </span><span class="macro-nonterminal">$ty </span>{ + <span class="attr">#[inline] + </span><span class="kw">fn </span>serialize<S>(<span class="kw-2">&</span><span class="self">self</span>, serializer: S) -> <span class="prelude-ty">Result</span><S::Ok, S::Error> + <span class="kw">where + </span>S: Serializer, + { + serializer.serialize_bytes(<span class="kw-2">&</span><span class="self">self</span>) + } + } + + <span class="kw">struct </span><span class="macro-nonterminal">$visitor_ty</span>; + + <span class="kw">impl</span><<span class="lifetime">'de</span>> de::Visitor<<span class="lifetime">'de</span>> <span class="kw">for </span><span class="macro-nonterminal">$visitor_ty </span>{ + <span class="kw">type </span>Value = <span class="macro-nonterminal">$ty</span>; + + <span class="kw">fn </span>expecting(<span class="kw-2">&</span><span class="self">self</span>, formatter: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { + formatter.write_str(<span class="string">"byte array"</span>) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>visit_seq<V>(<span class="self">self</span>, <span class="kw-2">mut </span>seq: V) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>::Value, V::Error> + <span class="kw">where + </span>V: de::SeqAccess<<span class="lifetime">'de</span>>, + { + <span class="kw">let </span>len = cmp::min(seq.size_hint().unwrap_or(<span class="number">0</span>), <span class="number">4096</span>); + <span class="kw">let </span><span class="kw-2">mut </span>values: Vec<u8> = Vec::with_capacity(len); + + <span class="kw">while let </span><span class="prelude-val">Some</span>(value) = seq.next_element()<span class="question-mark">? </span>{ + values.push(value); + } + + <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_vec</span>(values)) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>visit_bytes<E>(<span class="self">self</span>, v: <span class="kw-2">&</span>[u8]) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>::Value, E> + <span class="kw">where + </span>E: de::Error, + { + <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_slice</span>(v)) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>visit_byte_buf<E>(<span class="self">self</span>, v: Vec<u8>) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>::Value, E> + <span class="kw">where + </span>E: de::Error, + { + <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_vec</span>(v)) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>visit_str<E>(<span class="self">self</span>, v: <span class="kw-2">&</span>str) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>::Value, E> + <span class="kw">where + </span>E: de::Error, + { + <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_slice</span>(v.as_bytes())) + } + + <span class="attr">#[inline] + </span><span class="kw">fn </span>visit_string<E>(<span class="self">self</span>, v: String) -> <span class="prelude-ty">Result</span><<span class="self">Self</span>::Value, E> + <span class="kw">where + </span>E: de::Error, + { + <span class="prelude-val">Ok</span>(<span class="macro-nonterminal">$ty</span>::<span class="macro-nonterminal">$from_vec</span>(v.into_bytes())) + } + } + + <span class="kw">impl</span><<span class="lifetime">'de</span>> Deserialize<<span class="lifetime">'de</span>> <span class="kw">for </span><span class="macro-nonterminal">$ty </span>{ + <span class="attr">#[inline] + </span><span class="kw">fn </span>deserialize<D>(deserializer: D) -> <span class="prelude-ty">Result</span><<span class="macro-nonterminal">$ty</span>, D::Error> + <span class="kw">where + </span>D: Deserializer<<span class="lifetime">'de</span>>, + { + deserializer.deserialize_byte_buf(<span class="macro-nonterminal">$visitor_ty</span>) + } + } + }; +} + +<span class="macro">serde_impl!</span>(Bytes, BytesVisitor, copy_from_slice, from); +<span class="macro">serde_impl!</span>(BytesMut, BytesMutVisitor, from, from_vec); +</code></pre></div> +</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="bytes" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.0-nightly (42325c525 2022-11-11)" data-search-js="search-39ee4160c7dc16c9.js" data-settings-js="settings-3a0b9947ba1bd99a.js" data-settings-css="settings-a66f7524084a489a.css" ></div></body></html>
\ No newline at end of file |