api-docs/crates-app/src/bytes/bytes_mut.rs.html - incubator-teaclave-website - Git at Google

 <!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/bytes-1.4.0/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="../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../normalize.css"><link rel="stylesheet" href="../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../ayu.css" disabled><link rel="stylesheet" href="../../dark.css" disabled><link rel="stylesheet" href="../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../storage.js"></script><script defer src="../../source-script.js"></script><script defer src="../../source-files.js"></script><script defer src="../../main.js"></script><noscript><link rel="stylesheet" href="../../noscript.css"></noscript><link rel="alternate icon" type="image/png" href="../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../favicon.svg"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../bytes/index.html"><div class="logo-container"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../bytes/index.html"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span>
 <span id="2">2</span>
 <span id="3">3</span>
 <span id="4">4</span>
 <span id="5">5</span>
 <span id="6">6</span>
 <span id="7">7</span>
 <span id="8">8</span>
 <span id="9">9</span>
 <span id="10">10</span>
 <span id="11">11</span>
 <span id="12">12</span>
 <span id="13">13</span>
 <span id="14">14</span>
 <span id="15">15</span>
 <span id="16">16</span>
 <span id="17">17</span>
 <span id="18">18</span>
 <span id="19">19</span>
 <span id="20">20</span>
 <span id="21">21</span>
 <span id="22">22</span>
 <span id="23">23</span>
 <span id="24">24</span>
 <span id="25">25</span>
 <span id="26">26</span>
 <span id="27">27</span>
 <span id="28">28</span>
 <span id="29">29</span>
 <span id="30">30</span>
 <span id="31">31</span>
 <span id="32">32</span>
 <span id="33">33</span>
 <span id="34">34</span>
 <span id="35">35</span>
 <span id="36">36</span>
 <span id="37">37</span>
 <span id="38">38</span>
 <span id="39">39</span>
 <span id="40">40</span>
 <span id="41">41</span>
 <span id="42">42</span>
 <span id="43">43</span>
 <span id="44">44</span>
 <span id="45">45</span>
 <span id="46">46</span>
 <span id="47">47</span>
 <span id="48">48</span>
 <span id="49">49</span>
 <span id="50">50</span>
 <span id="51">51</span>
 <span id="52">52</span>
 <span id="53">53</span>
 <span id="54">54</span>
 <span id="55">55</span>
 <span id="56">56</span>
 <span id="57">57</span>
 <span id="58">58</span>
 <span id="59">59</span>
 <span id="60">60</span>
 <span id="61">61</span>
 <span id="62">62</span>
 <span id="63">63</span>
 <span id="64">64</span>
 <span id="65">65</span>
 <span id="66">66</span>
 <span id="67">67</span>
 <span id="68">68</span>
 <span id="69">69</span>
 <span id="70">70</span>
 <span id="71">71</span>
 <span id="72">72</span>
 <span id="73">73</span>
 <span id="74">74</span>
 <span id="75">75</span>
 <span id="76">76</span>
 <span id="77">77</span>
 <span id="78">78</span>
 <span id="79">79</span>
 <span id="80">80</span>
 <span id="81">81</span>
 <span id="82">82</span>
 <span id="83">83</span>
 <span id="84">84</span>
 <span id="85">85</span>
 <span id="86">86</span>
 <span id="87">87</span>
 <span id="88">88</span>
 <span id="89">89</span>
 <span id="90">90</span>
 <span id="91">91</span>
 <span id="92">92</span>
 <span id="93">93</span>
 <span id="94">94</span>
 <span id="95">95</span>
 <span id="96">96</span>
 <span id="97">97</span>
 <span id="98">98</span>
 <span id="99">99</span>
 <span id="100">100</span>
 <span id="101">101</span>
 <span id="102">102</span>
 <span id="103">103</span>
 <span id="104">104</span>
 <span id="105">105</span>
 <span id="106">106</span>
 <span id="107">107</span>
 <span id="108">108</span>
 <span id="109">109</span>
 <span id="110">110</span>
 <span id="111">111</span>
 <span id="112">112</span>
 <span id="113">113</span>
 <span id="114">114</span>
 <span id="115">115</span>
 <span id="116">116</span>
 <span id="117">117</span>
 <span id="118">118</span>
 <span id="119">119</span>
 <span id="120">120</span>
 <span id="121">121</span>
 <span id="122">122</span>
 <span id="123">123</span>
 <span id="124">124</span>
 <span id="125">125</span>
 <span id="126">126</span>
 <span id="127">127</span>
 <span id="128">128</span>
 <span id="129">129</span>
 <span id="130">130</span>
 <span id="131">131</span>
 <span id="132">132</span>
 <span id="133">133</span>
 <span id="134">134</span>
 <span id="135">135</span>
 <span id="136">136</span>
 <span id="137">137</span>
 <span id="138">138</span>
 <span id="139">139</span>
 <span id="140">140</span>
 <span id="141">141</span>
 <span id="142">142</span>
 <span id="143">143</span>
 <span id="144">144</span>
 <span id="145">145</span>
 <span id="146">146</span>
 <span id="147">147</span>
 <span id="148">148</span>
 <span id="149">149</span>
 <span id="150">150</span>
 <span id="151">151</span>
 <span id="152">152</span>
 <span id="153">153</span>
 <span id="154">154</span>
 <span id="155">155</span>
 <span id="156">156</span>
 <span id="157">157</span>
 <span id="158">158</span>
 <span id="159">159</span>
 <span id="160">160</span>
 <span id="161">161</span>
 <span id="162">162</span>
 <span id="163">163</span>
 <span id="164">164</span>
 <span id="165">165</span>
 <span id="166">166</span>
 <span id="167">167</span>
 <span id="168">168</span>
 <span id="169">169</span>
 <span id="170">170</span>
 <span id="171">171</span>
 <span id="172">172</span>
 <span id="173">173</span>
 <span id="174">174</span>
 <span id="175">175</span>
 <span id="176">176</span>
 <span id="177">177</span>
 <span id="178">178</span>
 <span id="179">179</span>
 <span id="180">180</span>
 <span id="181">181</span>
 <span id="182">182</span>
 <span id="183">183</span>
 <span id="184">184</span>
 <span id="185">185</span>
 <span id="186">186</span>
 <span id="187">187</span>
 <span id="188">188</span>
 <span id="189">189</span>
 <span id="190">190</span>
 <span id="191">191</span>
 <span id="192">192</span>
 <span id="193">193</span>
 <span id="194">194</span>
 <span id="195">195</span>
 <span id="196">196</span>
 <span id="197">197</span>
 <span id="198">198</span>
 <span id="199">199</span>
 <span id="200">200</span>
 <span id="201">201</span>
 <span id="202">202</span>
 <span id="203">203</span>
 <span id="204">204</span>
 <span id="205">205</span>
 <span id="206">206</span>
 <span id="207">207</span>
 <span id="208">208</span>
 <span id="209">209</span>
 <span id="210">210</span>
 <span id="211">211</span>
 <span id="212">212</span>
 <span id="213">213</span>
 <span id="214">214</span>
 <span id="215">215</span>
 <span id="216">216</span>
 <span id="217">217</span>
 <span id="218">218</span>
 <span id="219">219</span>
 <span id="220">220</span>
 <span id="221">221</span>
 <span id="222">222</span>
 <span id="223">223</span>
 <span id="224">224</span>
 <span id="225">225</span>
 <span id="226">226</span>
 <span id="227">227</span>
 <span id="228">228</span>
 <span id="229">229</span>
 <span id="230">230</span>
 <span id="231">231</span>
 <span id="232">232</span>
 <span id="233">233</span>
 <span id="234">234</span>
 <span id="235">235</span>
 <span id="236">236</span>
 <span id="237">237</span>
 <span id="238">238</span>
 <span id="239">239</span>
 <span id="240">240</span>
 <span id="241">241</span>
 <span id="242">242</span>
 <span id="243">243</span>
 <span id="244">244</span>
 <span id="245">245</span>
 <span id="246">246</span>
 <span id="247">247</span>
 <span id="248">248</span>
 <span id="249">249</span>
 <span id="250">250</span>
 <span id="251">251</span>
 <span id="252">252</span>
 <span id="253">253</span>
 <span id="254">254</span>
 <span id="255">255</span>
 <span id="256">256</span>
 <span id="257">257</span>
 <span id="258">258</span>
 <span id="259">259</span>
 <span id="260">260</span>
 <span id="261">261</span>
 <span id="262">262</span>
 <span id="263">263</span>
 <span id="264">264</span>
 <span id="265">265</span>
 <span id="266">266</span>
 <span id="267">267</span>
 <span id="268">268</span>
 <span id="269">269</span>
 <span id="270">270</span>
 <span id="271">271</span>
 <span id="272">272</span>
 <span id="273">273</span>
 <span id="274">274</span>
 <span id="275">275</span>
 <span id="276">276</span>
 <span id="277">277</span>
 <span id="278">278</span>
 <span id="279">279</span>
 <span id="280">280</span>
 <span id="281">281</span>
 <span id="282">282</span>
 <span id="283">283</span>
 <span id="284">284</span>
 <span id="285">285</span>
 <span id="286">286</span>
 <span id="287">287</span>
 <span id="288">288</span>
 <span id="289">289</span>
 <span id="290">290</span>
 <span id="291">291</span>
 <span id="292">292</span>
 <span id="293">293</span>
 <span id="294">294</span>
 <span id="295">295</span>
 <span id="296">296</span>
 <span id="297">297</span>
 <span id="298">298</span>
 <span id="299">299</span>
 <span id="300">300</span>
 <span id="301">301</span>
 <span id="302">302</span>
 <span id="303">303</span>
 <span id="304">304</span>
 <span id="305">305</span>
 <span id="306">306</span>
 <span id="307">307</span>
 <span id="308">308</span>
 <span id="309">309</span>
 <span id="310">310</span>
 <span id="311">311</span>
 <span id="312">312</span>
 <span id="313">313</span>
 <span id="314">314</span>
 <span id="315">315</span>
 <span id="316">316</span>
 <span id="317">317</span>
 <span id="318">318</span>
 <span id="319">319</span>
 <span id="320">320</span>
 <span id="321">321</span>
 <span id="322">322</span>
 <span id="323">323</span>
 <span id="324">324</span>
 <span id="325">325</span>
 <span id="326">326</span>
 <span id="327">327</span>
 <span id="328">328</span>
 <span id="329">329</span>
 <span id="330">330</span>
 <span id="331">331</span>
 <span id="332">332</span>
 <span id="333">333</span>
 <span id="334">334</span>
 <span id="335">335</span>
 <span id="336">336</span>
 <span id="337">337</span>
 <span id="338">338</span>
 <span id="339">339</span>
 <span id="340">340</span>
 <span id="341">341</span>
 <span id="342">342</span>
 <span id="343">343</span>
 <span id="344">344</span>
 <span id="345">345</span>
 <span id="346">346</span>
 <span id="347">347</span>
 <span id="348">348</span>
 <span id="349">349</span>
 <span id="350">350</span>
 <span id="351">351</span>
 <span id="352">352</span>
 <span id="353">353</span>
 <span id="354">354</span>
 <span id="355">355</span>
 <span id="356">356</span>
 <span id="357">357</span>
 <span id="358">358</span>
 <span id="359">359</span>
 <span id="360">360</span>
 <span id="361">361</span>
 <span id="362">362</span>
 <span id="363">363</span>
 <span id="364">364</span>
 <span id="365">365</span>
 <span id="366">366</span>
 <span id="367">367</span>
 <span id="368">368</span>
 <span id="369">369</span>
 <span id="370">370</span>
 <span id="371">371</span>
 <span id="372">372</span>
 <span id="373">373</span>
 <span id="374">374</span>
 <span id="375">375</span>
 <span id="376">376</span>
 <span id="377">377</span>
 <span id="378">378</span>
 <span id="379">379</span>
 <span id="380">380</span>
 <span id="381">381</span>
 <span id="382">382</span>
 <span id="383">383</span>
 <span id="384">384</span>
 <span id="385">385</span>
 <span id="386">386</span>
 <span id="387">387</span>
 <span id="388">388</span>
 <span id="389">389</span>
 <span id="390">390</span>
 <span id="391">391</span>
 <span id="392">392</span>
 <span id="393">393</span>
 <span id="394">394</span>
 <span id="395">395</span>
 <span id="396">396</span>
 <span id="397">397</span>
 <span id="398">398</span>
 <span id="399">399</span>
 <span id="400">400</span>
 <span id="401">401</span>
 <span id="402">402</span>
 <span id="403">403</span>
 <span id="404">404</span>
 <span id="405">405</span>
 <span id="406">406</span>
 <span id="407">407</span>
 <span id="408">408</span>
 <span id="409">409</span>
 <span id="410">410</span>
 <span id="411">411</span>
 <span id="412">412</span>
 <span id="413">413</span>
 <span id="414">414</span>
 <span id="415">415</span>
 <span id="416">416</span>
 <span id="417">417</span>
 <span id="418">418</span>
 <span id="419">419</span>
 <span id="420">420</span>
 <span id="421">421</span>
 <span id="422">422</span>
 <span id="423">423</span>
 <span id="424">424</span>
 <span id="425">425</span>
 <span id="426">426</span>
 <span id="427">427</span>
 <span id="428">428</span>
 <span id="429">429</span>
 <span id="430">430</span>
 <span id="431">431</span>
 <span id="432">432</span>
 <span id="433">433</span>
 <span id="434">434</span>
 <span id="435">435</span>
 <span id="436">436</span>
 <span id="437">437</span>
 <span id="438">438</span>
 <span id="439">439</span>
 <span id="440">440</span>
 <span id="441">441</span>
 <span id="442">442</span>
 <span id="443">443</span>
 <span id="444">444</span>
 <span id="445">445</span>
 <span id="446">446</span>
 <span id="447">447</span>
 <span id="448">448</span>
 <span id="449">449</span>
 <span id="450">450</span>
 <span id="451">451</span>
 <span id="452">452</span>
 <span id="453">453</span>
 <span id="454">454</span>
 <span id="455">455</span>
 <span id="456">456</span>
 <span id="457">457</span>
 <span id="458">458</span>
 <span id="459">459</span>
 <span id="460">460</span>
 <span id="461">461</span>
 <span id="462">462</span>
 <span id="463">463</span>
 <span id="464">464</span>
 <span id="465">465</span>
 <span id="466">466</span>
 <span id="467">467</span>
 <span id="468">468</span>
 <span id="469">469</span>
 <span id="470">470</span>
 <span id="471">471</span>
 <span id="472">472</span>
 <span id="473">473</span>
 <span id="474">474</span>
 <span id="475">475</span>
 <span id="476">476</span>
 <span id="477">477</span>
 <span id="478">478</span>
 <span id="479">479</span>
 <span id="480">480</span>
 <span id="481">481</span>
 <span id="482">482</span>
 <span id="483">483</span>
 <span id="484">484</span>
 <span id="485">485</span>
 <span id="486">486</span>
 <span id="487">487</span>
 <span id="488">488</span>
 <span id="489">489</span>
 <span id="490">490</span>
 <span id="491">491</span>
 <span id="492">492</span>
 <span id="493">493</span>
 <span id="494">494</span>
 <span id="495">495</span>
 <span id="496">496</span>
 <span id="497">497</span>
 <span id="498">498</span>
 <span id="499">499</span>
 <span id="500">500</span>
 <span id="501">501</span>
 <span id="502">502</span>
 <span id="503">503</span>
 <span id="504">504</span>
 <span id="505">505</span>
 <span id="506">506</span>
 <span id="507">507</span>
 <span id="508">508</span>
 <span id="509">509</span>
 <span id="510">510</span>
 <span id="511">511</span>
 <span id="512">512</span>
 <span id="513">513</span>
 <span id="514">514</span>
 <span id="515">515</span>
 <span id="516">516</span>
 <span id="517">517</span>
 <span id="518">518</span>
 <span id="519">519</span>
 <span id="520">520</span>
 <span id="521">521</span>
 <span id="522">522</span>
 <span id="523">523</span>
 <span id="524">524</span>
 <span id="525">525</span>
 <span id="526">526</span>
 <span id="527">527</span>
 <span id="528">528</span>
 <span id="529">529</span>
 <span id="530">530</span>
 <span id="531">531</span>
 <span id="532">532</span>
 <span id="533">533</span>
 <span id="534">534</span>
 <span id="535">535</span>
 <span id="536">536</span>
 <span id="537">537</span>
 <span id="538">538</span>
 <span id="539">539</span>
 <span id="540">540</span>
 <span id="541">541</span>
 <span id="542">542</span>
 <span id="543">543</span>
 <span id="544">544</span>
 <span id="545">545</span>
 <span id="546">546</span>
 <span id="547">547</span>
 <span id="548">548</span>
 <span id="549">549</span>
 <span id="550">550</span>
 <span id="551">551</span>
 <span id="552">552</span>
 <span id="553">553</span>
 <span id="554">554</span>
 <span id="555">555</span>
 <span id="556">556</span>
 <span id="557">557</span>
 <span id="558">558</span>
 <span id="559">559</span>
 <span id="560">560</span>
 <span id="561">561</span>
 <span id="562">562</span>
 <span id="563">563</span>
 <span id="564">564</span>
 <span id="565">565</span>
 <span id="566">566</span>
 <span id="567">567</span>
 <span id="568">568</span>
 <span id="569">569</span>
 <span id="570">570</span>
 <span id="571">571</span>
 <span id="572">572</span>
 <span id="573">573</span>
 <span id="574">574</span>
 <span id="575">575</span>
 <span id="576">576</span>
 <span id="577">577</span>
 <span id="578">578</span>
 <span id="579">579</span>
 <span id="580">580</span>
 <span id="581">581</span>
 <span id="582">582</span>
 <span id="583">583</span>
 <span id="584">584</span>
 <span id="585">585</span>
 <span id="586">586</span>
 <span id="587">587</span>
 <span id="588">588</span>
 <span id="589">589</span>
 <span id="590">590</span>
 <span id="591">591</span>
 <span id="592">592</span>
 <span id="593">593</span>
 <span id="594">594</span>
 <span id="595">595</span>
 <span id="596">596</span>
 <span id="597">597</span>
 <span id="598">598</span>
 <span id="599">599</span>
 <span id="600">600</span>
 <span id="601">601</span>
 <span id="602">602</span>
 <span id="603">603</span>
 <span id="604">604</span>
 <span id="605">605</span>
 <span id="606">606</span>
 <span id="607">607</span>
 <span id="608">608</span>
 <span id="609">609</span>
 <span id="610">610</span>
 <span id="611">611</span>
 <span id="612">612</span>
 <span id="613">613</span>
 <span id="614">614</span>
 <span id="615">615</span>
 <span id="616">616</span>
 <span id="617">617</span>
 <span id="618">618</span>
 <span id="619">619</span>
 <span id="620">620</span>
 <span id="621">621</span>
 <span id="622">622</span>
 <span id="623">623</span>
 <span id="624">624</span>
 <span id="625">625</span>
 <span id="626">626</span>
 <span id="627">627</span>
 <span id="628">628</span>
 <span id="629">629</span>
 <span id="630">630</span>
 <span id="631">631</span>
 <span id="632">632</span>
 <span id="633">633</span>
 <span id="634">634</span>
 <span id="635">635</span>
 <span id="636">636</span>
 <span id="637">637</span>
 <span id="638">638</span>
 <span id="639">639</span>
 <span id="640">640</span>
 <span id="641">641</span>
 <span id="642">642</span>
 <span id="643">643</span>
 <span id="644">644</span>
 <span id="645">645</span>
 <span id="646">646</span>
 <span id="647">647</span>
 <span id="648">648</span>
 <span id="649">649</span>
 <span id="650">650</span>
 <span id="651">651</span>
 <span id="652">652</span>
 <span id="653">653</span>
 <span id="654">654</span>
 <span id="655">655</span>
 <span id="656">656</span>
 <span id="657">657</span>
 <span id="658">658</span>
 <span id="659">659</span>
 <span id="660">660</span>
 <span id="661">661</span>
 <span id="662">662</span>
 <span id="663">663</span>
 <span id="664">664</span>
 <span id="665">665</span>
 <span id="666">666</span>
 <span id="667">667</span>
 <span id="668">668</span>
 <span id="669">669</span>
 <span id="670">670</span>
 <span id="671">671</span>
 <span id="672">672</span>
 <span id="673">673</span>
 <span id="674">674</span>
 <span id="675">675</span>
 <span id="676">676</span>
 <span id="677">677</span>
 <span id="678">678</span>
 <span id="679">679</span>
 <span id="680">680</span>
 <span id="681">681</span>
 <span id="682">682</span>
 <span id="683">683</span>
 <span id="684">684</span>
 <span id="685">685</span>
 <span id="686">686</span>
 <span id="687">687</span>
 <span id="688">688</span>
 <span id="689">689</span>
 <span id="690">690</span>
 <span id="691">691</span>
 <span id="692">692</span>
 <span id="693">693</span>
 <span id="694">694</span>
 <span id="695">695</span>
 <span id="696">696</span>
 <span id="697">697</span>
 <span id="698">698</span>
 <span id="699">699</span>
 <span id="700">700</span>
 <span id="701">701</span>
 <span id="702">702</span>
 <span id="703">703</span>
 <span id="704">704</span>
 <span id="705">705</span>
 <span id="706">706</span>
 <span id="707">707</span>
 <span id="708">708</span>
 <span id="709">709</span>
 <span id="710">710</span>
 <span id="711">711</span>
 <span id="712">712</span>
 <span id="713">713</span>
 <span id="714">714</span>
 <span id="715">715</span>
 <span id="716">716</span>
 <span id="717">717</span>
 <span id="718">718</span>
 <span id="719">719</span>
 <span id="720">720</span>
 <span id="721">721</span>
 <span id="722">722</span>
 <span id="723">723</span>
 <span id="724">724</span>
 <span id="725">725</span>
 <span id="726">726</span>
 <span id="727">727</span>
 <span id="728">728</span>
 <span id="729">729</span>
 <span id="730">730</span>
 <span id="731">731</span>
 <span id="732">732</span>
 <span id="733">733</span>
 <span id="734">734</span>
 <span id="735">735</span>
 <span id="736">736</span>
 <span id="737">737</span>
 <span id="738">738</span>
 <span id="739">739</span>
 <span id="740">740</span>
 <span id="741">741</span>
 <span id="742">742</span>
 <span id="743">743</span>
 <span id="744">744</span>
 <span id="745">745</span>
 <span id="746">746</span>
 <span id="747">747</span>
 <span id="748">748</span>
 <span id="749">749</span>
 <span id="750">750</span>
 <span id="751">751</span>
 <span id="752">752</span>
 <span id="753">753</span>
 <span id="754">754</span>
 <span id="755">755</span>
 <span id="756">756</span>
 <span id="757">757</span>
 <span id="758">758</span>
 <span id="759">759</span>
 <span id="760">760</span>
 <span id="761">761</span>
 <span id="762">762</span>
 <span id="763">763</span>
 <span id="764">764</span>
 <span id="765">765</span>
 <span id="766">766</span>
 <span id="767">767</span>
 <span id="768">768</span>
 <span id="769">769</span>
 <span id="770">770</span>
 <span id="771">771</span>
 <span id="772">772</span>
 <span id="773">773</span>
 <span id="774">774</span>
 <span id="775">775</span>
 <span id="776">776</span>
 <span id="777">777</span>
 <span id="778">778</span>
 <span id="779">779</span>
 <span id="780">780</span>
 <span id="781">781</span>
 <span id="782">782</span>
 <span id="783">783</span>
 <span id="784">784</span>
 <span id="785">785</span>
 <span id="786">786</span>
 <span id="787">787</span>
 <span id="788">788</span>
 <span id="789">789</span>
 <span id="790">790</span>
 <span id="791">791</span>
 <span id="792">792</span>
 <span id="793">793</span>
 <span id="794">794</span>
 <span id="795">795</span>
 <span id="796">796</span>
 <span id="797">797</span>
 <span id="798">798</span>
 <span id="799">799</span>
 <span id="800">800</span>
 <span id="801">801</span>
 <span id="802">802</span>
 <span id="803">803</span>
 <span id="804">804</span>
 <span id="805">805</span>
 <span id="806">806</span>
 <span id="807">807</span>
 <span id="808">808</span>
 <span id="809">809</span>
 <span id="810">810</span>
 <span id="811">811</span>
 <span id="812">812</span>
 <span id="813">813</span>
 <span id="814">814</span>
 <span id="815">815</span>
 <span id="816">816</span>
 <span id="817">817</span>
 <span id="818">818</span>
 <span id="819">819</span>
 <span id="820">820</span>
 <span id="821">821</span>
 <span id="822">822</span>
 <span id="823">823</span>
 <span id="824">824</span>
 <span id="825">825</span>
 <span id="826">826</span>
 <span id="827">827</span>
 <span id="828">828</span>
 <span id="829">829</span>
 <span id="830">830</span>
 <span id="831">831</span>
 <span id="832">832</span>
 <span id="833">833</span>
 <span id="834">834</span>
 <span id="835">835</span>
 <span id="836">836</span>
 <span id="837">837</span>
 <span id="838">838</span>
 <span id="839">839</span>
 <span id="840">840</span>
 <span id="841">841</span>
 <span id="842">842</span>
 <span id="843">843</span>
 <span id="844">844</span>
 <span id="845">845</span>
 <span id="846">846</span>
 <span id="847">847</span>
 <span id="848">848</span>
 <span id="849">849</span>
 <span id="850">850</span>
 <span id="851">851</span>
 <span id="852">852</span>
 <span id="853">853</span>
 <span id="854">854</span>
 <span id="855">855</span>
 <span id="856">856</span>
 <span id="857">857</span>
 <span id="858">858</span>
 <span id="859">859</span>
 <span id="860">860</span>
 <span id="861">861</span>
 <span id="862">862</span>
 <span id="863">863</span>
 <span id="864">864</span>
 <span id="865">865</span>
 <span id="866">866</span>
 <span id="867">867</span>
 <span id="868">868</span>
 <span id="869">869</span>
 <span id="870">870</span>
 <span id="871">871</span>
 <span id="872">872</span>
 <span id="873">873</span>
 <span id="874">874</span>
 <span id="875">875</span>
 <span id="876">876</span>
 <span id="877">877</span>
 <span id="878">878</span>
 <span id="879">879</span>
 <span id="880">880</span>
 <span id="881">881</span>
 <span id="882">882</span>
 <span id="883">883</span>
 <span id="884">884</span>
 <span id="885">885</span>
 <span id="886">886</span>
 <span id="887">887</span>
 <span id="888">888</span>
 <span id="889">889</span>
 <span id="890">890</span>
 <span id="891">891</span>
 <span id="892">892</span>
 <span id="893">893</span>
 <span id="894">894</span>
 <span id="895">895</span>
 <span id="896">896</span>
 <span id="897">897</span>
 <span id="898">898</span>
 <span id="899">899</span>
 <span id="900">900</span>
 <span id="901">901</span>
 <span id="902">902</span>
 <span id="903">903</span>
 <span id="904">904</span>
 <span id="905">905</span>
 <span id="906">906</span>
 <span id="907">907</span>
 <span id="908">908</span>
 <span id="909">909</span>
 <span id="910">910</span>
 <span id="911">911</span>
 <span id="912">912</span>
 <span id="913">913</span>
 <span id="914">914</span>
 <span id="915">915</span>
 <span id="916">916</span>
 <span id="917">917</span>
 <span id="918">918</span>
 <span id="919">919</span>
 <span id="920">920</span>
 <span id="921">921</span>
 <span id="922">922</span>
 <span id="923">923</span>
 <span id="924">924</span>
 <span id="925">925</span>
 <span id="926">926</span>
 <span id="927">927</span>
 <span id="928">928</span>
 <span id="929">929</span>
 <span id="930">930</span>
 <span id="931">931</span>
 <span id="932">932</span>
 <span id="933">933</span>
 <span id="934">934</span>
 <span id="935">935</span>
 <span id="936">936</span>
 <span id="937">937</span>
 <span id="938">938</span>
 <span id="939">939</span>
 <span id="940">940</span>
 <span id="941">941</span>
 <span id="942">942</span>
 <span id="943">943</span>
 <span id="944">944</span>
 <span id="945">945</span>
 <span id="946">946</span>
 <span id="947">947</span>
 <span id="948">948</span>
 <span id="949">949</span>
 <span id="950">950</span>
 <span id="951">951</span>
 <span id="952">952</span>
 <span id="953">953</span>
 <span id="954">954</span>
 <span id="955">955</span>
 <span id="956">956</span>
 <span id="957">957</span>
 <span id="958">958</span>
 <span id="959">959</span>
 <span id="960">960</span>
 <span id="961">961</span>
 <span id="962">962</span>
 <span id="963">963</span>
 <span id="964">964</span>
 <span id="965">965</span>
 <span id="966">966</span>
 <span id="967">967</span>
 <span id="968">968</span>
 <span id="969">969</span>
 <span id="970">970</span>
 <span id="971">971</span>
 <span id="972">972</span>
 <span id="973">973</span>
 <span id="974">974</span>
 <span id="975">975</span>
 <span id="976">976</span>
 <span id="977">977</span>
 <span id="978">978</span>
 <span id="979">979</span>
 <span id="980">980</span>
 <span id="981">981</span>
 <span id="982">982</span>
 <span id="983">983</span>
 <span id="984">984</span>
 <span id="985">985</span>
 <span id="986">986</span>
 <span id="987">987</span>
 <span id="988">988</span>
 <span id="989">989</span>
 <span id="990">990</span>
 <span id="991">991</span>
 <span id="992">992</span>
 <span id="993">993</span>
 <span id="994">994</span>
 <span id="995">995</span>
 <span id="996">996</span>
 <span id="997">997</span>
 <span id="998">998</span>
 <span id="999">999</span>
 <span id="1000">1000</span>
 <span id="1001">1001</span>
 <span id="1002">1002</span>
 <span id="1003">1003</span>
 <span id="1004">1004</span>
 <span id="1005">1005</span>
 <span id="1006">1006</span>
 <span id="1007">1007</span>
 <span id="1008">1008</span>
 <span id="1009">1009</span>
 <span id="1010">1010</span>
 <span id="1011">1011</span>
 <span id="1012">1012</span>
 <span id="1013">1013</span>
 <span id="1014">1014</span>
 <span id="1015">1015</span>
 <span id="1016">1016</span>
 <span id="1017">1017</span>
 <span id="1018">1018</span>
 <span id="1019">1019</span>
 <span id="1020">1020</span>
 <span id="1021">1021</span>
 <span id="1022">1022</span>
 <span id="1023">1023</span>
 <span id="1024">1024</span>
 <span id="1025">1025</span>
 <span id="1026">1026</span>
 <span id="1027">1027</span>
 <span id="1028">1028</span>
 <span id="1029">1029</span>
 <span id="1030">1030</span>
 <span id="1031">1031</span>
 <span id="1032">1032</span>
 <span id="1033">1033</span>
 <span id="1034">1034</span>
 <span id="1035">1035</span>
 <span id="1036">1036</span>
 <span id="1037">1037</span>
 <span id="1038">1038</span>
 <span id="1039">1039</span>
 <span id="1040">1040</span>
 <span id="1041">1041</span>
 <span id="1042">1042</span>
 <span id="1043">1043</span>
 <span id="1044">1044</span>
 <span id="1045">1045</span>
 <span id="1046">1046</span>
 <span id="1047">1047</span>
 <span id="1048">1048</span>
 <span id="1049">1049</span>
 <span id="1050">1050</span>
 <span id="1051">1051</span>
 <span id="1052">1052</span>
 <span id="1053">1053</span>
 <span id="1054">1054</span>
 <span id="1055">1055</span>
 <span id="1056">1056</span>
 <span id="1057">1057</span>
 <span id="1058">1058</span>
 <span id="1059">1059</span>
 <span id="1060">1060</span>
 <span id="1061">1061</span>
 <span id="1062">1062</span>
 <span id="1063">1063</span>
 <span id="1064">1064</span>
 <span id="1065">1065</span>
 <span id="1066">1066</span>
 <span id="1067">1067</span>
 <span id="1068">1068</span>
 <span id="1069">1069</span>
 <span id="1070">1070</span>
 <span id="1071">1071</span>
 <span id="1072">1072</span>
 <span id="1073">1073</span>
 <span id="1074">1074</span>
 <span id="1075">1075</span>
 <span id="1076">1076</span>
 <span id="1077">1077</span>
 <span id="1078">1078</span>
 <span id="1079">1079</span>
 <span id="1080">1080</span>
 <span id="1081">1081</span>
 <span id="1082">1082</span>
 <span id="1083">1083</span>
 <span id="1084">1084</span>
 <span id="1085">1085</span>
 <span id="1086">1086</span>
 <span id="1087">1087</span>
 <span id="1088">1088</span>
 <span id="1089">1089</span>
 <span id="1090">1090</span>
 <span id="1091">1091</span>
 <span id="1092">1092</span>
 <span id="1093">1093</span>
 <span id="1094">1094</span>
 <span id="1095">1095</span>
 <span id="1096">1096</span>
 <span id="1097">1097</span>
 <span id="1098">1098</span>
 <span id="1099">1099</span>
 <span id="1100">1100</span>
 <span id="1101">1101</span>
 <span id="1102">1102</span>
 <span id="1103">1103</span>
 <span id="1104">1104</span>
 <span id="1105">1105</span>
 <span id="1106">1106</span>
 <span id="1107">1107</span>
 <span id="1108">1108</span>
 <span id="1109">1109</span>
 <span id="1110">1110</span>
 <span id="1111">1111</span>
 <span id="1112">1112</span>
 <span id="1113">1113</span>
 <span id="1114">1114</span>
 <span id="1115">1115</span>
 <span id="1116">1116</span>
 <span id="1117">1117</span>
 <span id="1118">1118</span>
 <span id="1119">1119</span>
 <span id="1120">1120</span>
 <span id="1121">1121</span>
 <span id="1122">1122</span>
 <span id="1123">1123</span>
 <span id="1124">1124</span>
 <span id="1125">1125</span>
 <span id="1126">1126</span>
 <span id="1127">1127</span>
 <span id="1128">1128</span>
 <span id="1129">1129</span>
 <span id="1130">1130</span>
 <span id="1131">1131</span>
 <span id="1132">1132</span>
 <span id="1133">1133</span>
 <span id="1134">1134</span>
 <span id="1135">1135</span>
 <span id="1136">1136</span>
 <span id="1137">1137</span>
 <span id="1138">1138</span>
 <span id="1139">1139</span>
 <span id="1140">1140</span>
 <span id="1141">1141</span>
 <span id="1142">1142</span>
 <span id="1143">1143</span>
 <span id="1144">1144</span>
 <span id="1145">1145</span>
 <span id="1146">1146</span>
 <span id="1147">1147</span>
 <span id="1148">1148</span>
 <span id="1149">1149</span>
 <span id="1150">1150</span>
 <span id="1151">1151</span>
 <span id="1152">1152</span>
 <span id="1153">1153</span>
 <span id="1154">1154</span>
 <span id="1155">1155</span>
 <span id="1156">1156</span>
 <span id="1157">1157</span>
 <span id="1158">1158</span>
 <span id="1159">1159</span>
 <span id="1160">1160</span>
 <span id="1161">1161</span>
 <span id="1162">1162</span>
 <span id="1163">1163</span>
 <span id="1164">1164</span>
 <span id="1165">1165</span>
 <span id="1166">1166</span>
 <span id="1167">1167</span>
 <span id="1168">1168</span>
 <span id="1169">1169</span>
 <span id="1170">1170</span>
 <span id="1171">1171</span>
 <span id="1172">1172</span>
 <span id="1173">1173</span>
 <span id="1174">1174</span>
 <span id="1175">1175</span>
 <span id="1176">1176</span>
 <span id="1177">1177</span>
 <span id="1178">1178</span>
 <span id="1179">1179</span>
 <span id="1180">1180</span>
 <span id="1181">1181</span>
 <span id="1182">1182</span>
 <span id="1183">1183</span>
 <span id="1184">1184</span>
 <span id="1185">1185</span>
 <span id="1186">1186</span>
 <span id="1187">1187</span>
 <span id="1188">1188</span>
 <span id="1189">1189</span>
 <span id="1190">1190</span>
 <span id="1191">1191</span>
 <span id="1192">1192</span>
 <span id="1193">1193</span>
 <span id="1194">1194</span>
 <span id="1195">1195</span>
 <span id="1196">1196</span>
 <span id="1197">1197</span>
 <span id="1198">1198</span>
 <span id="1199">1199</span>
 <span id="1200">1200</span>
 <span id="1201">1201</span>
 <span id="1202">1202</span>
 <span id="1203">1203</span>
 <span id="1204">1204</span>
 <span id="1205">1205</span>
 <span id="1206">1206</span>
 <span id="1207">1207</span>
 <span id="1208">1208</span>
 <span id="1209">1209</span>
 <span id="1210">1210</span>
 <span id="1211">1211</span>
 <span id="1212">1212</span>
 <span id="1213">1213</span>
 <span id="1214">1214</span>
 <span id="1215">1215</span>
 <span id="1216">1216</span>
 <span id="1217">1217</span>
 <span id="1218">1218</span>
 <span id="1219">1219</span>
 <span id="1220">1220</span>
 <span id="1221">1221</span>
 <span id="1222">1222</span>
 <span id="1223">1223</span>
 <span id="1224">1224</span>
 <span id="1225">1225</span>
 <span id="1226">1226</span>
 <span id="1227">1227</span>
 <span id="1228">1228</span>
 <span id="1229">1229</span>
 <span id="1230">1230</span>
 <span id="1231">1231</span>
 <span id="1232">1232</span>
 <span id="1233">1233</span>
 <span id="1234">1234</span>
 <span id="1235">1235</span>
 <span id="1236">1236</span>
 <span id="1237">1237</span>
 <span id="1238">1238</span>
 <span id="1239">1239</span>
 <span id="1240">1240</span>
 <span id="1241">1241</span>
 <span id="1242">1242</span>
 <span id="1243">1243</span>
 <span id="1244">1244</span>
 <span id="1245">1245</span>
 <span id="1246">1246</span>
 <span id="1247">1247</span>
 <span id="1248">1248</span>
 <span id="1249">1249</span>
 <span id="1250">1250</span>
 <span id="1251">1251</span>
 <span id="1252">1252</span>
 <span id="1253">1253</span>
 <span id="1254">1254</span>
 <span id="1255">1255</span>
 <span id="1256">1256</span>
 <span id="1257">1257</span>
 <span id="1258">1258</span>
 <span id="1259">1259</span>
 <span id="1260">1260</span>
 <span id="1261">1261</span>
 <span id="1262">1262</span>
 <span id="1263">1263</span>
 <span id="1264">1264</span>
 <span id="1265">1265</span>
 <span id="1266">1266</span>
 <span id="1267">1267</span>
 <span id="1268">1268</span>
 <span id="1269">1269</span>
 <span id="1270">1270</span>
 <span id="1271">1271</span>
 <span id="1272">1272</span>
 <span id="1273">1273</span>
 <span id="1274">1274</span>
 <span id="1275">1275</span>
 <span id="1276">1276</span>
 <span id="1277">1277</span>
 <span id="1278">1278</span>
 <span id="1279">1279</span>
 <span id="1280">1280</span>
 <span id="1281">1281</span>
 <span id="1282">1282</span>
 <span id="1283">1283</span>
 <span id="1284">1284</span>
 <span id="1285">1285</span>
 <span id="1286">1286</span>
 <span id="1287">1287</span>
 <span id="1288">1288</span>
 <span id="1289">1289</span>
 <span id="1290">1290</span>
 <span id="1291">1291</span>
 <span id="1292">1292</span>
 <span id="1293">1293</span>
 <span id="1294">1294</span>
 <span id="1295">1295</span>
 <span id="1296">1296</span>
 <span id="1297">1297</span>
 <span id="1298">1298</span>
 <span id="1299">1299</span>
 <span id="1300">1300</span>
 <span id="1301">1301</span>
 <span id="1302">1302</span>
 <span id="1303">1303</span>
 <span id="1304">1304</span>
 <span id="1305">1305</span>
 <span id="1306">1306</span>
 <span id="1307">1307</span>
 <span id="1308">1308</span>
 <span id="1309">1309</span>
 <span id="1310">1310</span>
 <span id="1311">1311</span>
 <span id="1312">1312</span>
 <span id="1313">1313</span>
 <span id="1314">1314</span>
 <span id="1315">1315</span>
 <span id="1316">1316</span>
 <span id="1317">1317</span>
 <span id="1318">1318</span>
 <span id="1319">1319</span>
 <span id="1320">1320</span>
 <span id="1321">1321</span>
 <span id="1322">1322</span>
 <span id="1323">1323</span>
 <span id="1324">1324</span>
 <span id="1325">1325</span>
 <span id="1326">1326</span>
 <span id="1327">1327</span>
 <span id="1328">1328</span>
 <span id="1329">1329</span>
 <span id="1330">1330</span>
 <span id="1331">1331</span>
 <span id="1332">1332</span>
 <span id="1333">1333</span>
 <span id="1334">1334</span>
 <span id="1335">1335</span>
 <span id="1336">1336</span>
 <span id="1337">1337</span>
 <span id="1338">1338</span>
 <span id="1339">1339</span>
 <span id="1340">1340</span>
 <span id="1341">1341</span>
 <span id="1342">1342</span>
 <span id="1343">1343</span>
 <span id="1344">1344</span>
 <span id="1345">1345</span>
 <span id="1346">1346</span>
 <span id="1347">1347</span>
 <span id="1348">1348</span>
 <span id="1349">1349</span>
 <span id="1350">1350</span>
 <span id="1351">1351</span>
 <span id="1352">1352</span>
 <span id="1353">1353</span>
 <span id="1354">1354</span>
 <span id="1355">1355</span>
 <span id="1356">1356</span>
 <span id="1357">1357</span>
 <span id="1358">1358</span>
 <span id="1359">1359</span>
 <span id="1360">1360</span>
 <span id="1361">1361</span>
 <span id="1362">1362</span>
 <span id="1363">1363</span>
 <span id="1364">1364</span>
 <span id="1365">1365</span>
 <span id="1366">1366</span>
 <span id="1367">1367</span>
 <span id="1368">1368</span>
 <span id="1369">1369</span>
 <span id="1370">1370</span>
 <span id="1371">1371</span>
 <span id="1372">1372</span>
 <span id="1373">1373</span>
 <span id="1374">1374</span>
 <span id="1375">1375</span>
 <span id="1376">1376</span>
 <span id="1377">1377</span>
 <span id="1378">1378</span>
 <span id="1379">1379</span>
 <span id="1380">1380</span>
 <span id="1381">1381</span>
 <span id="1382">1382</span>
 <span id="1383">1383</span>
 <span id="1384">1384</span>
 <span id="1385">1385</span>
 <span id="1386">1386</span>
 <span id="1387">1387</span>
 <span id="1388">1388</span>
 <span id="1389">1389</span>
 <span id="1390">1390</span>
 <span id="1391">1391</span>
 <span id="1392">1392</span>
 <span id="1393">1393</span>
 <span id="1394">1394</span>
 <span id="1395">1395</span>
 <span id="1396">1396</span>
 <span id="1397">1397</span>
 <span id="1398">1398</span>
 <span id="1399">1399</span>
 <span id="1400">1400</span>
 <span id="1401">1401</span>
 <span id="1402">1402</span>
 <span id="1403">1403</span>
 <span id="1404">1404</span>
 <span id="1405">1405</span>
 <span id="1406">1406</span>
 <span id="1407">1407</span>
 <span id="1408">1408</span>
 <span id="1409">1409</span>
 <span id="1410">1410</span>
 <span id="1411">1411</span>
 <span id="1412">1412</span>
 <span id="1413">1413</span>
 <span id="1414">1414</span>
 <span id="1415">1415</span>
 <span id="1416">1416</span>
 <span id="1417">1417</span>
 <span id="1418">1418</span>
 <span id="1419">1419</span>
 <span id="1420">1420</span>
 <span id="1421">1421</span>
 <span id="1422">1422</span>
 <span id="1423">1423</span>
 <span id="1424">1424</span>
 <span id="1425">1425</span>
 <span id="1426">1426</span>
 <span id="1427">1427</span>
 <span id="1428">1428</span>
 <span id="1429">1429</span>
 <span id="1430">1430</span>
 <span id="1431">1431</span>
 <span id="1432">1432</span>
 <span id="1433">1433</span>
 <span id="1434">1434</span>
 <span id="1435">1435</span>
 <span id="1436">1436</span>
 <span id="1437">1437</span>
 <span id="1438">1438</span>
 <span id="1439">1439</span>
 <span id="1440">1440</span>
 <span id="1441">1441</span>
 <span id="1442">1442</span>
 <span id="1443">1443</span>
 <span id="1444">1444</span>
 <span id="1445">1445</span>
 <span id="1446">1446</span>
 <span id="1447">1447</span>
 <span id="1448">1448</span>
 <span id="1449">1449</span>
 <span id="1450">1450</span>
 <span id="1451">1451</span>
 <span id="1452">1452</span>
 <span id="1453">1453</span>
 <span id="1454">1454</span>
 <span id="1455">1455</span>
 <span id="1456">1456</span>
 <span id="1457">1457</span>
 <span id="1458">1458</span>
 <span id="1459">1459</span>
 <span id="1460">1460</span>
 <span id="1461">1461</span>
 <span id="1462">1462</span>
 <span id="1463">1463</span>
 <span id="1464">1464</span>
 <span id="1465">1465</span>
 <span id="1466">1466</span>
 <span id="1467">1467</span>
 <span id="1468">1468</span>
 <span id="1469">1469</span>
 <span id="1470">1470</span>
 <span id="1471">1471</span>
 <span id="1472">1472</span>
 <span id="1473">1473</span>
 <span id="1474">1474</span>
 <span id="1475">1475</span>
 <span id="1476">1476</span>
 <span id="1477">1477</span>
 <span id="1478">1478</span>
 <span id="1479">1479</span>
 <span id="1480">1480</span>
 <span id="1481">1481</span>
 <span id="1482">1482</span>
 <span id="1483">1483</span>
 <span id="1484">1484</span>
 <span id="1485">1485</span>
 <span id="1486">1486</span>
 <span id="1487">1487</span>
 <span id="1488">1488</span>
 <span id="1489">1489</span>
 <span id="1490">1490</span>
 <span id="1491">1491</span>
 <span id="1492">1492</span>
 <span id="1493">1493</span>
 <span id="1494">1494</span>
 <span id="1495">1495</span>
 <span id="1496">1496</span>
 <span id="1497">1497</span>
 <span id="1498">1498</span>
 <span id="1499">1499</span>
 <span id="1500">1500</span>
 <span id="1501">1501</span>
 <span id="1502">1502</span>
 <span id="1503">1503</span>
 <span id="1504">1504</span>
 <span id="1505">1505</span>
 <span id="1506">1506</span>
 <span id="1507">1507</span>
 <span id="1508">1508</span>
 <span id="1509">1509</span>
 <span id="1510">1510</span>
 <span id="1511">1511</span>
 <span id="1512">1512</span>
 <span id="1513">1513</span>
 <span id="1514">1514</span>
 <span id="1515">1515</span>
 <span id="1516">1516</span>
 <span id="1517">1517</span>
 <span id="1518">1518</span>
 <span id="1519">1519</span>
 <span id="1520">1520</span>
 <span id="1521">1521</span>
 <span id="1522">1522</span>
 <span id="1523">1523</span>
 <span id="1524">1524</span>
 <span id="1525">1525</span>
 <span id="1526">1526</span>
 <span id="1527">1527</span>
 <span id="1528">1528</span>
 <span id="1529">1529</span>
 <span id="1530">1530</span>
 <span id="1531">1531</span>
 <span id="1532">1532</span>
 <span id="1533">1533</span>
 <span id="1534">1534</span>
 <span id="1535">1535</span>
 <span id="1536">1536</span>
 <span id="1537">1537</span>
 <span id="1538">1538</span>
 <span id="1539">1539</span>
 <span id="1540">1540</span>
 <span id="1541">1541</span>
 <span id="1542">1542</span>
 <span id="1543">1543</span>
 <span id="1544">1544</span>
 <span id="1545">1545</span>
 <span id="1546">1546</span>
 <span id="1547">1547</span>
 <span id="1548">1548</span>
 <span id="1549">1549</span>
 <span id="1550">1550</span>
 <span id="1551">1551</span>
 <span id="1552">1552</span>
 <span id="1553">1553</span>
 <span id="1554">1554</span>
 <span id="1555">1555</span>
 <span id="1556">1556</span>
 <span id="1557">1557</span>
 <span id="1558">1558</span>
 <span id="1559">1559</span>
 <span id="1560">1560</span>
 <span id="1561">1561</span>
 <span id="1562">1562</span>
 <span id="1563">1563</span>
 <span id="1564">1564</span>
 <span id="1565">1565</span>
 <span id="1566">1566</span>
 <span id="1567">1567</span>
 <span id="1568">1568</span>
 <span id="1569">1569</span>
 <span id="1570">1570</span>
 <span id="1571">1571</span>
 <span id="1572">1572</span>
 <span id="1573">1573</span>
 <span id="1574">1574</span>
 <span id="1575">1575</span>
 <span id="1576">1576</span>
 <span id="1577">1577</span>
 <span id="1578">1578</span>
 <span id="1579">1579</span>
 <span id="1580">1580</span>
 <span id="1581">1581</span>
 <span id="1582">1582</span>
 <span id="1583">1583</span>
 <span id="1584">1584</span>
 <span id="1585">1585</span>
 <span id="1586">1586</span>
 <span id="1587">1587</span>
 <span id="1588">1588</span>
 <span id="1589">1589</span>
 <span id="1590">1590</span>
 <span id="1591">1591</span>
 <span id="1592">1592</span>
 <span id="1593">1593</span>
 <span id="1594">1594</span>
 <span id="1595">1595</span>
 <span id="1596">1596</span>
 <span id="1597">1597</span>
 <span id="1598">1598</span>
 <span id="1599">1599</span>
 <span id="1600">1600</span>
 <span id="1601">1601</span>
 <span id="1602">1602</span>
 <span id="1603">1603</span>
 <span id="1604">1604</span>
 <span id="1605">1605</span>
 <span id="1606">1606</span>
 <span id="1607">1607</span>
 <span id="1608">1608</span>
 <span id="1609">1609</span>
 <span id="1610">1610</span>
 <span id="1611">1611</span>
 <span id="1612">1612</span>
 <span id="1613">1613</span>
 <span id="1614">1614</span>
 <span id="1615">1615</span>
 <span id="1616">1616</span>
 <span id="1617">1617</span>
 <span id="1618">1618</span>
 <span id="1619">1619</span>
 <span id="1620">1620</span>
 <span id="1621">1621</span>
 <span id="1622">1622</span>
 <span id="1623">1623</span>
 <span id="1624">1624</span>
 <span id="1625">1625</span>
 <span id="1626">1626</span>
 <span id="1627">1627</span>
 <span id="1628">1628</span>
 <span id="1629">1629</span>
 <span id="1630">1630</span>
 <span id="1631">1631</span>
 <span id="1632">1632</span>
 <span id="1633">1633</span>
 <span id="1634">1634</span>
 <span id="1635">1635</span>
 <span id="1636">1636</span>
 <span id="1637">1637</span>
 <span id="1638">1638</span>
 <span id="1639">1639</span>
 <span id="1640">1640</span>
 <span id="1641">1641</span>
 <span id="1642">1642</span>
 <span id="1643">1643</span>
 <span id="1644">1644</span>
 <span id="1645">1645</span>
 <span id="1646">1646</span>
 <span id="1647">1647</span>
 <span id="1648">1648</span>
 <span id="1649">1649</span>
 <span id="1650">1650</span>
 <span id="1651">1651</span>
 <span id="1652">1652</span>
 <span id="1653">1653</span>
 <span id="1654">1654</span>
 <span id="1655">1655</span>
 <span id="1656">1656</span>
 <span id="1657">1657</span>
 <span id="1658">1658</span>
 <span id="1659">1659</span>
 <span id="1660">1660</span>
 <span id="1661">1661</span>
 <span id="1662">1662</span>
 <span id="1663">1663</span>
 <span id="1664">1664</span>
 <span id="1665">1665</span>
 <span id="1666">1666</span>
 <span id="1667">1667</span>
 <span id="1668">1668</span>
 <span id="1669">1669</span>
 <span id="1670">1670</span>
 <span id="1671">1671</span>
 <span id="1672">1672</span>
 <span id="1673">1673</span>
 <span id="1674">1674</span>
 <span id="1675">1675</span>
 <span id="1676">1676</span>
 <span id="1677">1677</span>
 <span id="1678">1678</span>
 <span id="1679">1679</span>
 <span id="1680">1680</span>
 <span id="1681">1681</span>
 <span id="1682">1682</span>
 <span id="1683">1683</span>
 <span id="1684">1684</span>
 <span id="1685">1685</span>
 <span id="1686">1686</span>
 <span id="1687">1687</span>
 <span id="1688">1688</span>
 <span id="1689">1689</span>
 <span id="1690">1690</span>
 <span id="1691">1691</span>
 <span id="1692">1692</span>
 <span id="1693">1693</span>
 <span id="1694">1694</span>
 <span id="1695">1695</span>
 <span id="1696">1696</span>
 <span id="1697">1697</span>
 <span id="1698">1698</span>
 <span id="1699">1699</span>
 <span id="1700">1700</span>
 <span id="1701">1701</span>
 <span id="1702">1702</span>
 <span id="1703">1703</span>
 <span id="1704">1704</span>
 <span id="1705">1705</span>
 <span id="1706">1706</span>
 <span id="1707">1707</span>
 <span id="1708">1708</span>
 <span id="1709">1709</span>
 <span id="1710">1710</span>
 <span id="1711">1711</span>
 <span id="1712">1712</span>
 <span id="1713">1713</span>
 <span id="1714">1714</span>
 <span id="1715">1715</span>
 <span id="1716">1716</span>
 <span id="1717">1717</span>
 <span id="1718">1718</span>
 <span id="1719">1719</span>
 <span id="1720">1720</span>
 <span id="1721">1721</span>
 <span id="1722">1722</span>
 <span id="1723">1723</span>
 <span id="1724">1724</span>
 <span id="1725">1725</span>
 <span id="1726">1726</span>
 <span id="1727">1727</span>
 <span id="1728">1728</span>
 <span id="1729">1729</span>
 <span id="1730">1730</span>
 <span id="1731">1731</span>
 <span id="1732">1732</span>
 <span id="1733">1733</span>
 <span id="1734">1734</span>
 <span id="1735">1735</span>
 <span id="1736">1736</span>
 <span id="1737">1737</span>
 <span id="1738">1738</span>
 <span id="1739">1739</span>
 <span id="1740">1740</span>
 <span id="1741">1741</span>
 <span id="1742">1742</span>
 <span id="1743">1743</span>
 <span id="1744">1744</span>
 <span id="1745">1745</span>
 <span id="1746">1746</span>
 <span id="1747">1747</span>
 <span id="1748">1748</span>
 <span id="1749">1749</span>
 <span id="1750">1750</span>
 <span id="1751">1751</span>
 <span id="1752">1752</span>
 <span id="1753">1753</span>
 <span id="1754">1754</span>
 <span id="1755">1755</span>
 <span id="1756">1756</span>
 <span id="1757">1757</span>
 <span id="1758">1758</span>
 <span id="1759">1759</span>
 <span id="1760">1760</span>
 <span id="1761">1761</span>
 <span id="1762">1762</span>
 <span id="1763">1763</span>
 <span id="1764">1764</span>
 <span id="1765">1765</span>
 <span id="1766">1766</span>
 <span id="1767">1767</span>
 <span id="1768">1768</span>
 <span id="1769">1769</span>
 <span id="1770">1770</span>
 <span id="1771">1771</span>
 <span id="1772">1772</span>
 <span id="1773">1773</span>
 <span id="1774">1774</span>
 <span id="1775">1775</span>
 <span id="1776">1776</span>
 <span id="1777">1777</span>
 <span id="1778">1778</span>
 <span id="1779">1779</span>
 <span id="1780">1780</span>
 <span id="1781">1781</span>
 <span id="1782">1782</span>
 <span id="1783">1783</span>
 <span id="1784">1784</span>
 <span id="1785">1785</span>
 <span id="1786">1786</span>
 <span id="1787">1787</span>
 <span id="1788">1788</span>
 <span id="1789">1789</span>
 <span id="1790">1790</span>
 <span id="1791">1791</span>
 <span id="1792">1792</span>
 <span id="1793">1793</span>
 <span id="1794">1794</span>
 <span id="1795">1795</span>
 <span id="1796">1796</span>
 <span id="1797">1797</span>
 <span id="1798">1798</span>
 <span id="1799">1799</span>
 <span id="1800">1800</span>
 <span id="1801">1801</span>
 <span id="1802">1802</span>
 <span id="1803">1803</span>
 <span id="1804">1804</span>
 <span id="1805">1805</span>
 <span id="1806">1806</span>
 <span id="1807">1807</span>
 <span id="1808">1808</span>
 <span id="1809">1809</span>
 <span id="1810">1810</span>
 <span id="1811">1811</span>
 <span id="1812">1812</span>
 </pre><pre class="rust"><code><span class="kw">use </span>core::iter::{FromIterator, Iterator};
 <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="attribute">#[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>::{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&lt;Vec&lt;u8&gt;&gt;`, 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`&#39;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&#39;h&#39;);
 /// buf.put_u8(b&#39;e&#39;);
 /// buf.put(&amp;b&quot;llo&quot;[..]);
 ///
 /// assert_eq!(&amp;buf[..], b&quot;hello&quot;);
 ///
 /// // 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!(&amp;a[..], b&quot;hello&quot;);
 /// assert_eq!(&amp;b[..], b&quot;hello&quot;);
 /// ```
 </span><span class="kw">pub struct </span>BytesMut {
     ptr: NonNull&lt;u8&gt;,
     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&lt;u8&gt;,
     original_capacity_repr: usize,
     ref_count: AtomicUsize,
 }

 <span class="comment">// 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="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>VEC_POS_OFFSET: usize = <span class="number">5</span>;
 <span class="kw">const </span>MAX_VEC_POS: usize = usize::MAX &gt;&gt; VEC_POS_OFFSET;
 <span class="kw">const </span>NOT_VEC_POS_MASK: usize = <span class="number">0b11111</span>;

 <span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;64&quot;</span>)]
 </span><span class="kw">const </span>PTR_WIDTH: usize = <span class="number">64</span>;
 <span class="attribute">#[cfg(target_pointer_width = <span class="string">&quot;32&quot;</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(&amp;b&quot;hello world&quot;[..]);
     ///
     /// assert_eq!(&amp;bytes[..], b&quot;hello world&quot;);
     /// ```
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>with_capacity(capacity: usize) -&gt; 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&quot;xy&quot;);
     ///
     /// assert_eq!(&amp;b&quot;xy&quot;[..], &amp;bytes[..]);
     /// ```
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>new() -&gt; 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(&amp;b&quot;hello&quot;[..]);
     /// assert_eq!(b.len(), 5);
     /// ```
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; 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="attribute">#[inline]
     </span><span class="kw">pub fn </span>is_empty(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; 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="attribute">#[inline]
     </span><span class="kw">pub fn </span>capacity(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; 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(&amp;b&quot;hello world&quot;[..]);
     /// let b1 = b.freeze();
     /// let b2 = b1.clone();
     ///
     /// let th = thread::spawn(move || {
     ///     assert_eq!(&amp;b1[..], b&quot;hello world&quot;);
     /// });
     ///
     /// assert_eq!(&amp;b2[..], b&quot;hello world&quot;);
     /// th.join().unwrap();
     /// ```
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>freeze(<span class="kw-2">mut </span><span class="self">self</span>) -&gt; Bytes {
         <span class="kw">if </span><span class="self">self</span>.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, <span class="kw">_</span>) = <span class="self">self</span>.get_vec_pos();
                 <span class="kw">let </span>vec = rebuild_vec(<span class="self">self</span>.ptr.as_ptr(), <span class="self">self</span>.len, <span class="self">self</span>.cap, off);
                 mem::forget(<span class="self">self</span>);
                 <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>(<span class="self">self</span>.kind(), KIND_ARC);

             <span class="kw">let </span>ptr = <span class="self">self</span>.ptr.as_ptr();
             <span class="kw">let </span>len = <span class="self">self</span>.len;
             <span class="kw">let </span>data = AtomicPtr::new(<span class="self">self</span>.data.cast());
             mem::forget(<span class="self">self</span>);
             <span class="kw">unsafe </span>{ Bytes::with_vtable(ptr, len, data, <span class="kw-2">&amp;</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) -&gt; 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(&amp;b&quot;hello world&quot;[..]);
     /// let mut b = a.split_off(5);
     ///
     /// a[0] = b&#39;j&#39;;
     /// b[0] = b&#39;!&#39;;
     ///
     /// assert_eq!(&amp;a[..], b&quot;jello&quot;);
     /// assert_eq!(&amp;b[..], b&quot;!world&quot;);
     /// ```
     ///
     /// # Panics
     ///
     /// Panics if `at &gt; capacity`.
     </span><span class="attribute">#[must_use = <span class="string">&quot;consider BytesMut::truncate if you don&#39;t need the other half&quot;</span>]
     </span><span class="kw">pub fn </span>split_off(<span class="kw-2">&amp;mut </span><span class="self">self</span>, at: usize) -&gt; BytesMut {
         <span class="macro">assert!</span>(
             at &lt;= <span class="self">self</span>.capacity(),
             <span class="string">&quot;split_off out of bounds: {:?} &lt;= {:?}&quot;</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();
             other.set_start(at);
             <span class="self">self</span>.set_end(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(&amp;b&quot;hello world&quot;[..]);
     ///
     /// let other = buf.split();
     ///
     /// assert!(buf.is_empty());
     /// assert_eq!(1013, buf.capacity());
     ///
     /// assert_eq!(other, b&quot;hello world&quot;[..]);
     /// ```
     </span><span class="attribute">#[must_use = <span class="string">&quot;consider BytesMut::advance(len()) if you don&#39;t need the other half&quot;</span>]
     </span><span class="kw">pub fn </span>split(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; 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(&amp;b&quot;hello world&quot;[..]);
     /// let mut b = a.split_to(5);
     ///
     /// a[0] = b&#39;!&#39;;
     /// b[0] = b&#39;j&#39;;
     ///
     /// assert_eq!(&amp;a[..], b&quot;!world&quot;);
     /// assert_eq!(&amp;b[..], b&quot;jello&quot;);
     /// ```
     ///
     /// # Panics
     ///
     /// Panics if `at &gt; len`.
     </span><span class="attribute">#[must_use = <span class="string">&quot;consider BytesMut::advance if you don&#39;t need the other half&quot;</span>]
     </span><span class="kw">pub fn </span>split_to(<span class="kw-2">&amp;mut </span><span class="self">self</span>, at: usize) -&gt; BytesMut {
         <span class="macro">assert!</span>(
             at &lt;= <span class="self">self</span>.len(),
             <span class="string">&quot;split_to out of bounds: {:?} &lt;= {:?}&quot;</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();
             other.set_end(at);
             <span class="self">self</span>.set_start(at);
             other
         }
     }

     <span class="doccomment">/// Shortens the buffer, keeping the first `len` bytes and dropping the
     /// rest.
     ///
     /// If `len` is greater than the buffer&#39;s current length, this has no
     /// effect.
     ///
     /// Existing underlying capacity is preserved.
     ///
     /// The [`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(&amp;b&quot;hello world&quot;[..]);
     /// buf.truncate(5);
     /// assert_eq!(buf, b&quot;hello&quot;[..]);
     /// ```
     ///
     /// [`split_off`]: #method.split_off
     </span><span class="kw">pub fn </span>truncate(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize) {
         <span class="kw">if </span>len &lt;= <span class="self">self</span>.len() {
             <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(&amp;b&quot;hello world&quot;[..]);
     /// buf.clear();
     /// assert!(buf.is_empty());
     /// ```
     </span><span class="kw">pub fn </span>clear(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="self">self</span>.truncate(<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!(&amp;buf[..], &amp;[0x1, 0x1, 0x1]);
     ///
     /// buf.resize(2, 0x2);
     /// assert_eq!(&amp;buf[..], &amp;[0x1, 0x1]);
     ///
     /// buf.resize(4, 0x3);
     /// assert_eq!(&amp;buf[..], &amp;[0x1, 0x1, 0x3, 0x3]);
     /// ```
     </span><span class="kw">pub fn </span>resize(<span class="kw-2">&amp;mut </span><span class="self">self</span>, new_len: usize, value: u8) {
         <span class="kw">let </span>len = <span class="self">self</span>.len();
         <span class="kw">if </span>new_len &gt; len {
             <span class="kw">let </span>additional = new_len - len;
             <span class="self">self</span>.reserve(additional);
             <span class="kw">unsafe </span>{
                 <span class="kw">let </span>dst = <span class="self">self</span>.chunk_mut().as_mut_ptr();
                 ptr::write_bytes(dst, value, additional);
                 <span class="self">self</span>.set_len(new_len);
             }
         } <span class="kw">else </span>{
             <span class="self">self</span>.truncate(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(&amp;b&quot;hello world&quot;[..]);
     ///
     /// unsafe {
     ///     b.set_len(5);
     /// }
     ///
     /// assert_eq!(&amp;b[..], b&quot;hello&quot;);
     ///
     /// unsafe {
     ///     b.set_len(11);
     /// }
     ///
     /// assert_eq!(&amp;b[..], b&quot;hello world&quot;);
     /// ```
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>set_len(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize) {
         <span class="macro">debug_assert!</span>(len &lt;= <span class="self">self</span>.cap, <span class="string">&quot;set_len out of bounds&quot;</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&#39;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(&amp;b&quot;hello&quot;[..]);
     /// buf.reserve(64);
     /// assert!(buf.capacity() &gt;= 69);
     /// ```
     ///
     /// In the following example, the existing buffer is reclaimed.
     ///
     /// ```
     /// use bytes::{BytesMut, BufMut};
     ///
     /// let mut buf = BytesMut::with_capacity(128);
     /// buf.put(&amp;[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="attribute">#[inline]
     </span><span class="kw">pub fn </span>reserve(<span class="kw-2">&amp;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 &lt;= 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">&amp;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&#39;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&#39;s operations.
             </span><span class="kw">unsafe </span>{
                 <span class="kw">let </span>(off, prev) = <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 &gt;= 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 &gt;= additional &amp;&amp; off &gt;= <span class="self">self</span>.len() {
                     <span class="comment">// There&#39;s enough space, and it&#39;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().offset(-(off <span class="kw">as </span>isize));
                     <span class="comment">// Since `off &gt;= self.len()`, the two regions don&#39;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>, prev);

                     <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>.len = v.len() - off;
                     <span class="self">self</span>.cap = v.capacity() - 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">&quot;overflow&quot;</span>);

         <span class="kw">let </span>original_capacity;
         <span class="kw">let </span>original_capacity_repr;

         <span class="kw">unsafe </span>{
             original_capacity_repr = (<span class="kw-2">*</span>shared).original_capacity_repr;
             original_capacity = original_capacity_from_repr(original_capacity_repr);

             <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">&amp;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 &gt;= 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 &gt;= new_cap &amp;&amp; offset &gt;= len {
                     <span class="comment">// The capacity is sufficient, and copying is not too much
                     // overhead: reclaim the buffer!

                     // `offset &gt;= 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">&quot;overflow&quot;</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&#39;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&#39;t have any data we
                     // care about in the unused capacity before calling `reserve`.
                     </span><span class="macro">debug_assert!</span>(off + len &lt;= 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">else </span>{
                 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 &lt;&lt; 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>.len = v.len();
         <span class="self">self</span>.cap = v.capacity();
     }

     <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&quot;aaabbb&quot;);
     /// buf.extend_from_slice(b&quot;cccddd&quot;);
     ///
     /// assert_eq!(b&quot;aaabbbcccddd&quot;, &amp;buf[..]);
     /// ```
     </span><span class="kw">pub fn </span>extend_from_slice(<span class="kw-2">&amp;mut </span><span class="self">self</span>, extend: <span class="kw-2">&amp;</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() &gt;= 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&quot;aaabbbcccddd&quot;);
     ///
     /// let split = buf.split_off(6);
     /// assert_eq!(b&quot;aaabbb&quot;, &amp;buf[..]);
     /// assert_eq!(b&quot;cccddd&quot;, &amp;split[..]);
     ///
     /// buf.unsplit(split);
     /// assert_eq!(b&quot;aaabbbcccddd&quot;, &amp;buf[..]);
     /// ```
     </span><span class="kw">pub fn </span>unsplit(<span class="kw-2">&amp;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&#39;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="attribute">#[inline]
     </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>from_vec(<span class="kw-2">mut </span>vec: Vec&lt;u8&gt;) -&gt; BytesMut {
         <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();
         mem::forget(vec);

         <span class="kw">let </span>original_capacity_repr = original_capacity_to_repr(cap);
         <span class="kw">let </span>data = (original_capacity_repr &lt;&lt; ORIGINAL_CAPACITY_OFFSET) | KIND_VEC;

         BytesMut {
             ptr,
             len,
             cap,
             data: invalid_ptr(data),
         }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>as_slice(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</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="attribute">#[inline]
     </span><span class="kw">fn </span>as_slice_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;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="kw">unsafe fn </span>set_start(<span class="kw-2">&amp;mut </span><span class="self">self</span>, start: 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>start == <span class="number">0 </span>{
             <span class="kw">return</span>;
         }

         <span class="macro">debug_assert!</span>(start &lt;= <span class="self">self</span>.cap, <span class="string">&quot;internal: set_start out of bounds&quot;</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
             // &quot;start&quot; of the byte buffer from the beginning of the vec. We
             // also have to ensure that we don&#39;t exceed the maximum shift.
             </span><span class="kw">let </span>(<span class="kw-2">mut </span>pos, prev) = <span class="self">self</span>.get_vec_pos();
             pos += start;

             <span class="kw">if </span>pos &lt;= MAX_VEC_POS {
                 <span class="self">self</span>.set_vec_pos(pos, prev);
             } <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&#39;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(start));

         <span class="kw">if </span><span class="self">self</span>.len &gt;= start {
             <span class="self">self</span>.len -= start;
         } <span class="kw">else </span>{
             <span class="self">self</span>.len = <span class="number">0</span>;
         }

         <span class="self">self</span>.cap -= start;
     }

     <span class="kw">unsafe fn </span>set_end(<span class="kw-2">&amp;mut </span><span class="self">self</span>, end: usize) {
         <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.kind(), KIND_ARC);
         <span class="macro">assert!</span>(end &lt;= <span class="self">self</span>.cap, <span class="string">&quot;set_end out of bounds&quot;</span>);

         <span class="self">self</span>.cap = end;
         <span class="self">self</span>.len = cmp::min(<span class="self">self</span>.len, end);
     }

     <span class="kw">fn </span>try_unsplit(<span class="kw-2">&amp;mut </span><span class="self">self</span>, other: BytesMut) -&gt; <span class="prelude-ty">Result</span>&lt;(), BytesMut&gt; {
         <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()
             &amp;&amp; <span class="self">self</span>.kind() == KIND_ARC
             &amp;&amp; other.kind() == KIND_ARC
             &amp;&amp; <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="attribute">#[inline]
     </span><span class="kw">fn </span>kind(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.data <span class="kw">as </span>usize &amp; KIND_MASK
     }

     <span class="kw">unsafe fn </span>promote_to_shared(<span class="kw-2">&amp;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 &amp; ORIGINAL_CAPACITY_MASK) &gt;&gt; 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) &gt;&gt; VEC_POS_OFFSET;

         <span class="comment">// First, allocate a new `Shared` instance containing the
         // `Vec` fields. It&#39;s important to note that `ptr`, `len`,
         // and `cap` cannot be mutated without having `&amp;mut self`.
         // This means that these fields will not be concurrently
         // updated and since the buffer hasn&#39;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 &amp; 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&#39;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&#39;t allow
     /// two views into the same range.
     </span><span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>shallow_clone(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; 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="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>get_vec_pos(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; (usize, usize) {
         <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.kind(), KIND_VEC);

         <span class="kw">let </span>prev = <span class="self">self</span>.data <span class="kw">as </span>usize;
         (prev &gt;&gt; VEC_POS_OFFSET, prev)
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>set_vec_pos(<span class="kw-2">&amp;mut </span><span class="self">self</span>, pos: usize, prev: usize) {
         <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.kind(), KIND_VEC);
         <span class="macro">debug_assert!</span>(pos &lt;= MAX_VEC_POS);

         <span class="self">self</span>.data = invalid_ptr((pos &lt;&lt; VEC_POS_OFFSET) | (prev &amp; NOT_VEC_POS_MASK));
     }

     <span class="doccomment">/// Returns the remaining spare capacity of the buffer as a slice of `MaybeUninit&lt;u8&gt;`.
     ///
     /// 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!(&amp;buf[..], &amp;[0, 1, 2]);
     /// ```
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>spare_capacity_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>[MaybeUninit&lt;u8&gt;] {
         <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">&amp;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="kw">_</span>) = <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="attribute">#[inline]
     </span><span class="kw">fn </span>remaining(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.len()
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>chunk(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[u8] {
         <span class="self">self</span>.as_slice()
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cnt: usize) {
         <span class="macro">assert!</span>(
             cnt &lt;= <span class="self">self</span>.remaining(),
             <span class="string">&quot;cannot advance past `remaining`: {:?} &lt;= {:?}&quot;</span>,
             cnt,
             <span class="self">self</span>.remaining(),
         );
         <span class="kw">unsafe </span>{
             <span class="self">self</span>.set_start(cnt);
         }
     }

     <span class="kw">fn </span>copy_to_bytes(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize) -&gt; <span class="kw">crate</span>::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="attribute">#[inline]
     </span><span class="kw">fn </span>remaining_mut(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         usize::MAX - <span class="self">self</span>.len()
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>advance_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cnt: usize) {
         <span class="kw">let </span>new_len = <span class="self">self</span>.len() + cnt;
         <span class="macro">assert!</span>(
             new_len &lt;= <span class="self">self</span>.cap,
             <span class="string">&quot;new_len = {}; capacity = {}&quot;</span>,
             new_len,
             <span class="self">self</span>.cap
         );
         <span class="self">self</span>.len = new_len;
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>chunk_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;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>);
         }
         UninitSlice::from_slice(<span class="self">self</span>.spare_capacity_mut())
     }

     <span class="comment">// Specialize these methods so they can skip checking `remaining_mut`
     // and `advance_mut`.

     </span><span class="kw">fn </span>put&lt;T: <span class="kw">crate</span>::Buf&gt;(<span class="kw-2">&amp;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">&amp;mut </span><span class="self">self</span>, src: <span class="kw-2">&amp;</span>[u8]) {
         <span class="self">self</span>.extend_from_slice(src);
     }

     <span class="kw">fn </span>put_bytes(<span class="kw-2">&amp;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() &gt;= cnt);

             ptr::write_bytes(dst.as_mut_ptr(), val, cnt);

             <span class="self">self</span>.advance_mut(cnt);
         }
     }
 }

 <span class="kw">impl </span>AsRef&lt;[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>as_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</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="attribute">#[inline]
     </span><span class="kw">fn </span>deref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[u8] {
         <span class="self">self</span>.as_ref()
     }
 }

 <span class="kw">impl </span>AsMut&lt;[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>as_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;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="attribute">#[inline]
     </span><span class="kw">fn </span>deref_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>[u8] {
         <span class="self">self</span>.as_mut()
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>from(src: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[u8]) -&gt; BytesMut {
         BytesMut::from_vec(src.to_vec())
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>str&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>from(src: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>str) -&gt; BytesMut {
         BytesMut::from(src.as_bytes())
     }
 }

 <span class="kw">impl </span>From&lt;BytesMut&gt; <span class="kw">for </span>Bytes {
     <span class="kw">fn </span>from(src: BytesMut) -&gt; 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">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; 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">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         <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">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; 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="attribute">#[inline]
     </span><span class="kw">fn </span>default() -&gt; BytesMut {
         BytesMut::new()
     }
 }

 <span class="kw">impl </span>hash::Hash <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>hash&lt;H&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, state: <span class="kw-2">&amp;mut </span>H)
     <span class="kw">where
         </span>H: hash::Hasher,
     {
         <span class="kw">let </span>s: <span class="kw-2">&amp;</span>[u8] = <span class="self">self</span>.as_ref();
         s.hash(state);
     }
 }

 <span class="kw">impl </span>Borrow&lt;[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>borrow(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[u8] {
         <span class="self">self</span>.as_ref()
     }
 }

 <span class="kw">impl </span>BorrowMut&lt;[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>borrow_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;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="attribute">#[inline]
     </span><span class="kw">fn </span>write_str(<span class="kw-2">&amp;mut </span><span class="self">self</span>, s: <span class="kw-2">&amp;</span>str) -&gt; fmt::Result {
         <span class="kw">if </span><span class="self">self</span>.remaining_mut() &gt;= 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="attribute">#[inline]
     </span><span class="kw">fn </span>write_fmt(<span class="kw-2">&amp;mut </span><span class="self">self</span>, args: fmt::Arguments&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; 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">&amp;</span><span class="self">self</span>) -&gt; BytesMut {
         BytesMut::from(<span class="kw-2">&amp;</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&lt;BytesMut&gt;;

     <span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; <span class="self">Self</span>::IntoIter {
         IntoIter::new(<span class="self">self</span>)
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>BytesMut {
     <span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>u8;
     <span class="kw">type </span>IntoIter = core::slice::Iter&lt;<span class="lifetime">&#39;a</span>, u8&gt;;

     <span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; <span class="self">Self</span>::IntoIter {
         <span class="self">self</span>.as_ref().iter()
     }
 }

 <span class="kw">impl </span>Extend&lt;u8&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>extend&lt;T&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: T)
     <span class="kw">where
         </span>T: IntoIterator&lt;Item = u8&gt;,
     {
         <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
         // 2. Make `reserve` inline-able
         </span><span class="kw">for </span>b <span class="kw">in </span>iter {
             <span class="self">self</span>.reserve(<span class="number">1</span>);
             <span class="self">self</span>.put_u8(b);
         }
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; Extend&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>u8&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>extend&lt;T&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: T)
     <span class="kw">where
         </span>T: IntoIterator&lt;Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>u8&gt;,
     {
         <span class="self">self</span>.extend(iter.into_iter().copied())
     }
 }

 <span class="kw">impl </span>Extend&lt;Bytes&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>extend&lt;T&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: T)
     <span class="kw">where
         </span>T: IntoIterator&lt;Item = Bytes&gt;,
     {
         <span class="kw">for </span>bytes <span class="kw">in </span>iter {
             <span class="self">self</span>.extend_from_slice(<span class="kw-2">&amp;</span>bytes)
         }
     }
 }

 <span class="kw">impl </span>FromIterator&lt;u8&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>from_iter&lt;T: IntoIterator&lt;Item = u8&gt;&gt;(into_iter: T) -&gt; <span class="self">Self </span>{
         BytesMut::from_vec(Vec::from_iter(into_iter))
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; FromIterator&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>u8&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>from_iter&lt;T: IntoIterator&lt;Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>u8&gt;&gt;(into_iter: T) -&gt; <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 &gt; 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],
     //
     // &gt; It is important to enforce any possible access to the object in one
     // &gt; thread (through an existing reference) to *happen before* deleting
     // &gt; the object in a different thread. This is achieved by a &quot;release&quot;
     // &gt; operation after dropping a reference (any access to the object
     // &gt; through this reference must obviously happened before), and an
     // &gt; &quot;acquire&quot; 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">&amp;</span><span class="self">self</span>) -&gt; 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="attribute">#[inline]
 </span><span class="kw">fn </span>original_capacity_to_repr(cap: usize) -&gt; usize {
     <span class="kw">let </span>width = PTR_WIDTH - ((cap &gt;&gt; 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) -&gt; 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>&lt;&lt; (repr + (MIN_ORIGINAL_CAPACITY_WIDTH - <span class="number">1</span>))
 }

 <span class="comment">/*
 #[test]
 fn test_original_capacity_to_repr() {
     assert_eq!(original_capacity_to_repr(0), 0);

     let max_width = 32;

     for width in 1..(max_width + 1) {
         let cap = 1 &lt;&lt; width - 1;

         let expected = if width &lt; MIN_ORIGINAL_CAPACITY_WIDTH {
             0
         } else if width &lt; MAX_ORIGINAL_CAPACITY_WIDTH {
             width - MIN_ORIGINAL_CAPACITY_WIDTH
         } else {
             MAX_ORIGINAL_CAPACITY_WIDTH - MIN_ORIGINAL_CAPACITY_WIDTH
         };

         assert_eq!(original_capacity_to_repr(cap), expected);

         if width &gt; 1 {
             assert_eq!(original_capacity_to_repr(cap + 1), expected);
         }

         //  MIN_ORIGINAL_CAPACITY_WIDTH must be bigger than 7 to pass tests below
         if width == MIN_ORIGINAL_CAPACITY_WIDTH + 1 {
             assert_eq!(original_capacity_to_repr(cap - 24), expected - 1);
             assert_eq!(original_capacity_to_repr(cap + 76), expected);
         } else if width == MIN_ORIGINAL_CAPACITY_WIDTH + 2 {
             assert_eq!(original_capacity_to_repr(cap - 1), expected - 1);
             assert_eq!(original_capacity_to_repr(cap - 48), expected - 1);
         }
     }
 }

 #[test]
 fn test_original_capacity_from_repr() {
     assert_eq!(0, original_capacity_from_repr(0));

     let min_cap = 1 &lt;&lt; MIN_ORIGINAL_CAPACITY_WIDTH;

     assert_eq!(min_cap, original_capacity_from_repr(1));
     assert_eq!(min_cap * 2, original_capacity_from_repr(2));
     assert_eq!(min_cap * 4, original_capacity_from_repr(3));
     assert_eq!(min_cap * 8, original_capacity_from_repr(4));
     assert_eq!(min_cap * 16, original_capacity_from_repr(5));
     assert_eq!(min_cap * 32, original_capacity_from_repr(6));
     assert_eq!(min_cap * 64, original_capacity_from_repr(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&lt;[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
         <span class="kw-2">&amp;**</span><span class="self">self </span>== other
     }
 }

 <span class="kw">impl </span>PartialOrd&lt;[u8]&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(other)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span>[u8] {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self
     </span>}
 }

 <span class="kw">impl </span>PartialOrd&lt;BytesMut&gt; <span class="kw">for </span>[u8] {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         &lt;[u8] <span class="kw">as </span>PartialOrd&lt;[u8]&gt;&gt;::partial_cmp(<span class="self">self</span>, other)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;str&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>str) -&gt; bool {
         <span class="kw-2">&amp;**</span><span class="self">self </span>== other.as_bytes()
     }
 }

 <span class="kw">impl </span>PartialOrd&lt;str&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>str) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(other.as_bytes())
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span>str {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self
     </span>}
 }

 <span class="kw">impl </span>PartialOrd&lt;BytesMut&gt; <span class="kw">for </span>str {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         &lt;[u8] <span class="kw">as </span>PartialOrd&lt;[u8]&gt;&gt;::partial_cmp(<span class="self">self</span>.as_bytes(), other)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;Vec&lt;u8&gt;&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>Vec&lt;u8&gt;) -&gt; bool {
         <span class="kw-2">*</span><span class="self">self </span>== other[..]
     }
 }

 <span class="kw">impl </span>PartialOrd&lt;Vec&lt;u8&gt;&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>Vec&lt;u8&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(<span class="kw-2">&amp;</span>other[..])
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span>Vec&lt;u8&gt; {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self
     </span>}
 }

 <span class="kw">impl </span>PartialOrd&lt;BytesMut&gt; <span class="kw">for </span>Vec&lt;u8&gt; {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         other.partial_cmp(<span class="self">self</span>)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;String&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>String) -&gt; bool {
         <span class="kw-2">*</span><span class="self">self </span>== other[..]
     }
 }

 <span class="kw">impl </span>PartialOrd&lt;String&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>String) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         (<span class="kw-2">**</span><span class="self">self</span>).partial_cmp(other.as_bytes())
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span>String {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self
     </span>}
 }

 <span class="kw">impl </span>PartialOrd&lt;BytesMut&gt; <span class="kw">for </span>String {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         &lt;[u8] <span class="kw">as </span>PartialOrd&lt;[u8]&gt;&gt;::partial_cmp(<span class="self">self</span>.as_bytes(), other)
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="question-mark">?</span>Sized&gt; PartialEq&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T&gt; <span class="kw">for </span>BytesMut
 <span class="kw">where
     </span>BytesMut: PartialEq&lt;T&gt;,
 {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: &amp;&amp;<span class="lifetime">&#39;a </span>T) -&gt; bool {
         <span class="kw-2">*</span><span class="self">self </span>== <span class="kw-2">**</span>other
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="question-mark">?</span>Sized&gt; PartialOrd&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T&gt; <span class="kw">for </span>BytesMut
 <span class="kw">where
     </span>BytesMut: PartialOrd&lt;T&gt;,
 {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: &amp;&amp;<span class="lifetime">&#39;a </span>T) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         <span class="self">self</span>.partial_cmp(<span class="kw-2">*</span>other)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span><span class="kw-2">&amp;</span>[u8] {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self
     </span>}
 }

 <span class="kw">impl </span>PartialOrd&lt;BytesMut&gt; <span class="kw">for </span><span class="kw-2">&amp;</span>[u8] {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         &lt;[u8] <span class="kw">as </span>PartialOrd&lt;[u8]&gt;&gt;::partial_cmp(<span class="self">self</span>, other)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span><span class="kw-2">&amp;</span>str {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         <span class="kw-2">*</span>other == <span class="kw-2">*</span><span class="self">self
     </span>}
 }

 <span class="kw">impl </span>PartialOrd&lt;BytesMut&gt; <span class="kw">for </span><span class="kw-2">&amp;</span>str {
     <span class="kw">fn </span>partial_cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; <span class="prelude-ty">Option</span>&lt;cmp::Ordering&gt; {
         other.partial_cmp(<span class="self">self</span>)
     }
 }

 <span class="kw">impl </span>PartialEq&lt;BytesMut&gt; <span class="kw">for </span>Bytes {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>BytesMut) -&gt; bool {
         other[..] == <span class="self">self</span>[..]
     }
 }

 <span class="kw">impl </span>PartialEq&lt;Bytes&gt; <span class="kw">for </span>BytesMut {
     <span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span>Bytes) -&gt; bool {
         other[..] == <span class="self">self</span>[..]
     }
 }

 <span class="kw">impl </span>From&lt;BytesMut&gt; <span class="kw">for </span>Vec&lt;u8&gt; {
     <span class="kw">fn </span>from(<span class="kw-2">mut </span>bytes: BytesMut) -&gt; <span class="self">Self </span>{
         <span class="kw">let </span>kind = bytes.kind();

         <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, <span class="kw">_</span>) = bytes.get_vec_pos();
                 rebuild_vec(bytes.ptr.as_ptr(), bytes.len, bytes.cap, off)
             }
         } <span class="kw">else if </span>kind == KIND_ARC {
             <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">&amp;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>bytes.deref().to_vec();
             }
         } <span class="kw">else </span>{
             <span class="kw">return </span>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);
         }

         mem::forget(bytes);

         vec
     }
 }

 <span class="attribute">#[inline]
 </span><span class="kw">fn </span>vptr(ptr: <span class="kw-2">*mut </span>u8) -&gt; NonNull&lt;u8&gt; {
     <span class="kw">if </span><span class="macro">cfg!</span>(debug_assertions) {
         NonNull::new(ptr).expect(<span class="string">&quot;Vec pointer should be non-null&quot;</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="attribute">#[inline]
 </span><span class="kw">fn </span>invalid_ptr&lt;T&gt;(addr: usize) -&gt; <span class="kw-2">*mut </span>T {
     <span class="kw">let </span>ptr = core::ptr::null_mut::&lt;u8&gt;().wrapping_add(addr);
     <span class="macro">debug_assert_eq!</span>(ptr <span class="kw">as </span>usize, addr);
     ptr.cast::&lt;T&gt;()
 }

 <span class="doccomment">/// Precondition: dst &gt;= 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 stablised
 /// in 1.47, we cannot use it.
 </span><span class="attribute">#[inline]
 </span><span class="kw">fn </span>offset_from(dst: <span class="kw-2">*mut </span>u8, original: <span class="kw-2">*mut </span>u8) -&gt; usize {
     <span class="macro">debug_assert!</span>(dst &gt;= original);

     dst <span class="kw">as </span>usize - original <span class="kw">as </span>usize
 }

 <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) -&gt; Vec&lt;u8&gt; {
     <span class="kw">let </span>ptr = ptr.offset(-(off <span class="kw">as </span>isize));
     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,
     drop: shared_v_drop,
 };

 <span class="kw">unsafe fn </span>shared_v_clone(data: <span class="kw-2">&amp;</span>AtomicPtr&lt;()&gt;, ptr: <span class="kw-2">*const </span>u8, len: usize) -&gt; 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">&amp;</span>SHARED_VTABLE)
 }

 <span class="kw">unsafe fn </span>shared_v_to_vec(data: <span class="kw-2">&amp;</span>AtomicPtr&lt;()&gt;, ptr: <span class="kw-2">*const </span>u8, len: usize) -&gt; Vec&lt;u8&gt; {
     <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">&amp;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">&amp;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_drop(data: <span class="kw-2">&amp;mut </span>AtomicPtr&lt;()&gt;, _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(&quot;hello world&quot;);
 ///     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(&quot;hello world&quot;);
 ///     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(&quot;hello world&quot;);
 ///     b1.split();
 /// }
 /// ```
 </span><span class="kw">fn </span>_split_must_use() {}

 <span class="comment">// fuzz tests
 </span><span class="attribute">#[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="attribute">#[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">&amp;</span><span class="string">b&quot;abcdefgh&quot;</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-current-crate="bytes" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>