blob: c9ae935673623e638a4ab4a91abe88924bf10d08 [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/http-0.2.9/src/header/map.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>map.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="../../../http/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="../../../http/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>
<span id="1813">1813</span>
<span id="1814">1814</span>
<span id="1815">1815</span>
<span id="1816">1816</span>
<span id="1817">1817</span>
<span id="1818">1818</span>
<span id="1819">1819</span>
<span id="1820">1820</span>
<span id="1821">1821</span>
<span id="1822">1822</span>
<span id="1823">1823</span>
<span id="1824">1824</span>
<span id="1825">1825</span>
<span id="1826">1826</span>
<span id="1827">1827</span>
<span id="1828">1828</span>
<span id="1829">1829</span>
<span id="1830">1830</span>
<span id="1831">1831</span>
<span id="1832">1832</span>
<span id="1833">1833</span>
<span id="1834">1834</span>
<span id="1835">1835</span>
<span id="1836">1836</span>
<span id="1837">1837</span>
<span id="1838">1838</span>
<span id="1839">1839</span>
<span id="1840">1840</span>
<span id="1841">1841</span>
<span id="1842">1842</span>
<span id="1843">1843</span>
<span id="1844">1844</span>
<span id="1845">1845</span>
<span id="1846">1846</span>
<span id="1847">1847</span>
<span id="1848">1848</span>
<span id="1849">1849</span>
<span id="1850">1850</span>
<span id="1851">1851</span>
<span id="1852">1852</span>
<span id="1853">1853</span>
<span id="1854">1854</span>
<span id="1855">1855</span>
<span id="1856">1856</span>
<span id="1857">1857</span>
<span id="1858">1858</span>
<span id="1859">1859</span>
<span id="1860">1860</span>
<span id="1861">1861</span>
<span id="1862">1862</span>
<span id="1863">1863</span>
<span id="1864">1864</span>
<span id="1865">1865</span>
<span id="1866">1866</span>
<span id="1867">1867</span>
<span id="1868">1868</span>
<span id="1869">1869</span>
<span id="1870">1870</span>
<span id="1871">1871</span>
<span id="1872">1872</span>
<span id="1873">1873</span>
<span id="1874">1874</span>
<span id="1875">1875</span>
<span id="1876">1876</span>
<span id="1877">1877</span>
<span id="1878">1878</span>
<span id="1879">1879</span>
<span id="1880">1880</span>
<span id="1881">1881</span>
<span id="1882">1882</span>
<span id="1883">1883</span>
<span id="1884">1884</span>
<span id="1885">1885</span>
<span id="1886">1886</span>
<span id="1887">1887</span>
<span id="1888">1888</span>
<span id="1889">1889</span>
<span id="1890">1890</span>
<span id="1891">1891</span>
<span id="1892">1892</span>
<span id="1893">1893</span>
<span id="1894">1894</span>
<span id="1895">1895</span>
<span id="1896">1896</span>
<span id="1897">1897</span>
<span id="1898">1898</span>
<span id="1899">1899</span>
<span id="1900">1900</span>
<span id="1901">1901</span>
<span id="1902">1902</span>
<span id="1903">1903</span>
<span id="1904">1904</span>
<span id="1905">1905</span>
<span id="1906">1906</span>
<span id="1907">1907</span>
<span id="1908">1908</span>
<span id="1909">1909</span>
<span id="1910">1910</span>
<span id="1911">1911</span>
<span id="1912">1912</span>
<span id="1913">1913</span>
<span id="1914">1914</span>
<span id="1915">1915</span>
<span id="1916">1916</span>
<span id="1917">1917</span>
<span id="1918">1918</span>
<span id="1919">1919</span>
<span id="1920">1920</span>
<span id="1921">1921</span>
<span id="1922">1922</span>
<span id="1923">1923</span>
<span id="1924">1924</span>
<span id="1925">1925</span>
<span id="1926">1926</span>
<span id="1927">1927</span>
<span id="1928">1928</span>
<span id="1929">1929</span>
<span id="1930">1930</span>
<span id="1931">1931</span>
<span id="1932">1932</span>
<span id="1933">1933</span>
<span id="1934">1934</span>
<span id="1935">1935</span>
<span id="1936">1936</span>
<span id="1937">1937</span>
<span id="1938">1938</span>
<span id="1939">1939</span>
<span id="1940">1940</span>
<span id="1941">1941</span>
<span id="1942">1942</span>
<span id="1943">1943</span>
<span id="1944">1944</span>
<span id="1945">1945</span>
<span id="1946">1946</span>
<span id="1947">1947</span>
<span id="1948">1948</span>
<span id="1949">1949</span>
<span id="1950">1950</span>
<span id="1951">1951</span>
<span id="1952">1952</span>
<span id="1953">1953</span>
<span id="1954">1954</span>
<span id="1955">1955</span>
<span id="1956">1956</span>
<span id="1957">1957</span>
<span id="1958">1958</span>
<span id="1959">1959</span>
<span id="1960">1960</span>
<span id="1961">1961</span>
<span id="1962">1962</span>
<span id="1963">1963</span>
<span id="1964">1964</span>
<span id="1965">1965</span>
<span id="1966">1966</span>
<span id="1967">1967</span>
<span id="1968">1968</span>
<span id="1969">1969</span>
<span id="1970">1970</span>
<span id="1971">1971</span>
<span id="1972">1972</span>
<span id="1973">1973</span>
<span id="1974">1974</span>
<span id="1975">1975</span>
<span id="1976">1976</span>
<span id="1977">1977</span>
<span id="1978">1978</span>
<span id="1979">1979</span>
<span id="1980">1980</span>
<span id="1981">1981</span>
<span id="1982">1982</span>
<span id="1983">1983</span>
<span id="1984">1984</span>
<span id="1985">1985</span>
<span id="1986">1986</span>
<span id="1987">1987</span>
<span id="1988">1988</span>
<span id="1989">1989</span>
<span id="1990">1990</span>
<span id="1991">1991</span>
<span id="1992">1992</span>
<span id="1993">1993</span>
<span id="1994">1994</span>
<span id="1995">1995</span>
<span id="1996">1996</span>
<span id="1997">1997</span>
<span id="1998">1998</span>
<span id="1999">1999</span>
<span id="2000">2000</span>
<span id="2001">2001</span>
<span id="2002">2002</span>
<span id="2003">2003</span>
<span id="2004">2004</span>
<span id="2005">2005</span>
<span id="2006">2006</span>
<span id="2007">2007</span>
<span id="2008">2008</span>
<span id="2009">2009</span>
<span id="2010">2010</span>
<span id="2011">2011</span>
<span id="2012">2012</span>
<span id="2013">2013</span>
<span id="2014">2014</span>
<span id="2015">2015</span>
<span id="2016">2016</span>
<span id="2017">2017</span>
<span id="2018">2018</span>
<span id="2019">2019</span>
<span id="2020">2020</span>
<span id="2021">2021</span>
<span id="2022">2022</span>
<span id="2023">2023</span>
<span id="2024">2024</span>
<span id="2025">2025</span>
<span id="2026">2026</span>
<span id="2027">2027</span>
<span id="2028">2028</span>
<span id="2029">2029</span>
<span id="2030">2030</span>
<span id="2031">2031</span>
<span id="2032">2032</span>
<span id="2033">2033</span>
<span id="2034">2034</span>
<span id="2035">2035</span>
<span id="2036">2036</span>
<span id="2037">2037</span>
<span id="2038">2038</span>
<span id="2039">2039</span>
<span id="2040">2040</span>
<span id="2041">2041</span>
<span id="2042">2042</span>
<span id="2043">2043</span>
<span id="2044">2044</span>
<span id="2045">2045</span>
<span id="2046">2046</span>
<span id="2047">2047</span>
<span id="2048">2048</span>
<span id="2049">2049</span>
<span id="2050">2050</span>
<span id="2051">2051</span>
<span id="2052">2052</span>
<span id="2053">2053</span>
<span id="2054">2054</span>
<span id="2055">2055</span>
<span id="2056">2056</span>
<span id="2057">2057</span>
<span id="2058">2058</span>
<span id="2059">2059</span>
<span id="2060">2060</span>
<span id="2061">2061</span>
<span id="2062">2062</span>
<span id="2063">2063</span>
<span id="2064">2064</span>
<span id="2065">2065</span>
<span id="2066">2066</span>
<span id="2067">2067</span>
<span id="2068">2068</span>
<span id="2069">2069</span>
<span id="2070">2070</span>
<span id="2071">2071</span>
<span id="2072">2072</span>
<span id="2073">2073</span>
<span id="2074">2074</span>
<span id="2075">2075</span>
<span id="2076">2076</span>
<span id="2077">2077</span>
<span id="2078">2078</span>
<span id="2079">2079</span>
<span id="2080">2080</span>
<span id="2081">2081</span>
<span id="2082">2082</span>
<span id="2083">2083</span>
<span id="2084">2084</span>
<span id="2085">2085</span>
<span id="2086">2086</span>
<span id="2087">2087</span>
<span id="2088">2088</span>
<span id="2089">2089</span>
<span id="2090">2090</span>
<span id="2091">2091</span>
<span id="2092">2092</span>
<span id="2093">2093</span>
<span id="2094">2094</span>
<span id="2095">2095</span>
<span id="2096">2096</span>
<span id="2097">2097</span>
<span id="2098">2098</span>
<span id="2099">2099</span>
<span id="2100">2100</span>
<span id="2101">2101</span>
<span id="2102">2102</span>
<span id="2103">2103</span>
<span id="2104">2104</span>
<span id="2105">2105</span>
<span id="2106">2106</span>
<span id="2107">2107</span>
<span id="2108">2108</span>
<span id="2109">2109</span>
<span id="2110">2110</span>
<span id="2111">2111</span>
<span id="2112">2112</span>
<span id="2113">2113</span>
<span id="2114">2114</span>
<span id="2115">2115</span>
<span id="2116">2116</span>
<span id="2117">2117</span>
<span id="2118">2118</span>
<span id="2119">2119</span>
<span id="2120">2120</span>
<span id="2121">2121</span>
<span id="2122">2122</span>
<span id="2123">2123</span>
<span id="2124">2124</span>
<span id="2125">2125</span>
<span id="2126">2126</span>
<span id="2127">2127</span>
<span id="2128">2128</span>
<span id="2129">2129</span>
<span id="2130">2130</span>
<span id="2131">2131</span>
<span id="2132">2132</span>
<span id="2133">2133</span>
<span id="2134">2134</span>
<span id="2135">2135</span>
<span id="2136">2136</span>
<span id="2137">2137</span>
<span id="2138">2138</span>
<span id="2139">2139</span>
<span id="2140">2140</span>
<span id="2141">2141</span>
<span id="2142">2142</span>
<span id="2143">2143</span>
<span id="2144">2144</span>
<span id="2145">2145</span>
<span id="2146">2146</span>
<span id="2147">2147</span>
<span id="2148">2148</span>
<span id="2149">2149</span>
<span id="2150">2150</span>
<span id="2151">2151</span>
<span id="2152">2152</span>
<span id="2153">2153</span>
<span id="2154">2154</span>
<span id="2155">2155</span>
<span id="2156">2156</span>
<span id="2157">2157</span>
<span id="2158">2158</span>
<span id="2159">2159</span>
<span id="2160">2160</span>
<span id="2161">2161</span>
<span id="2162">2162</span>
<span id="2163">2163</span>
<span id="2164">2164</span>
<span id="2165">2165</span>
<span id="2166">2166</span>
<span id="2167">2167</span>
<span id="2168">2168</span>
<span id="2169">2169</span>
<span id="2170">2170</span>
<span id="2171">2171</span>
<span id="2172">2172</span>
<span id="2173">2173</span>
<span id="2174">2174</span>
<span id="2175">2175</span>
<span id="2176">2176</span>
<span id="2177">2177</span>
<span id="2178">2178</span>
<span id="2179">2179</span>
<span id="2180">2180</span>
<span id="2181">2181</span>
<span id="2182">2182</span>
<span id="2183">2183</span>
<span id="2184">2184</span>
<span id="2185">2185</span>
<span id="2186">2186</span>
<span id="2187">2187</span>
<span id="2188">2188</span>
<span id="2189">2189</span>
<span id="2190">2190</span>
<span id="2191">2191</span>
<span id="2192">2192</span>
<span id="2193">2193</span>
<span id="2194">2194</span>
<span id="2195">2195</span>
<span id="2196">2196</span>
<span id="2197">2197</span>
<span id="2198">2198</span>
<span id="2199">2199</span>
<span id="2200">2200</span>
<span id="2201">2201</span>
<span id="2202">2202</span>
<span id="2203">2203</span>
<span id="2204">2204</span>
<span id="2205">2205</span>
<span id="2206">2206</span>
<span id="2207">2207</span>
<span id="2208">2208</span>
<span id="2209">2209</span>
<span id="2210">2210</span>
<span id="2211">2211</span>
<span id="2212">2212</span>
<span id="2213">2213</span>
<span id="2214">2214</span>
<span id="2215">2215</span>
<span id="2216">2216</span>
<span id="2217">2217</span>
<span id="2218">2218</span>
<span id="2219">2219</span>
<span id="2220">2220</span>
<span id="2221">2221</span>
<span id="2222">2222</span>
<span id="2223">2223</span>
<span id="2224">2224</span>
<span id="2225">2225</span>
<span id="2226">2226</span>
<span id="2227">2227</span>
<span id="2228">2228</span>
<span id="2229">2229</span>
<span id="2230">2230</span>
<span id="2231">2231</span>
<span id="2232">2232</span>
<span id="2233">2233</span>
<span id="2234">2234</span>
<span id="2235">2235</span>
<span id="2236">2236</span>
<span id="2237">2237</span>
<span id="2238">2238</span>
<span id="2239">2239</span>
<span id="2240">2240</span>
<span id="2241">2241</span>
<span id="2242">2242</span>
<span id="2243">2243</span>
<span id="2244">2244</span>
<span id="2245">2245</span>
<span id="2246">2246</span>
<span id="2247">2247</span>
<span id="2248">2248</span>
<span id="2249">2249</span>
<span id="2250">2250</span>
<span id="2251">2251</span>
<span id="2252">2252</span>
<span id="2253">2253</span>
<span id="2254">2254</span>
<span id="2255">2255</span>
<span id="2256">2256</span>
<span id="2257">2257</span>
<span id="2258">2258</span>
<span id="2259">2259</span>
<span id="2260">2260</span>
<span id="2261">2261</span>
<span id="2262">2262</span>
<span id="2263">2263</span>
<span id="2264">2264</span>
<span id="2265">2265</span>
<span id="2266">2266</span>
<span id="2267">2267</span>
<span id="2268">2268</span>
<span id="2269">2269</span>
<span id="2270">2270</span>
<span id="2271">2271</span>
<span id="2272">2272</span>
<span id="2273">2273</span>
<span id="2274">2274</span>
<span id="2275">2275</span>
<span id="2276">2276</span>
<span id="2277">2277</span>
<span id="2278">2278</span>
<span id="2279">2279</span>
<span id="2280">2280</span>
<span id="2281">2281</span>
<span id="2282">2282</span>
<span id="2283">2283</span>
<span id="2284">2284</span>
<span id="2285">2285</span>
<span id="2286">2286</span>
<span id="2287">2287</span>
<span id="2288">2288</span>
<span id="2289">2289</span>
<span id="2290">2290</span>
<span id="2291">2291</span>
<span id="2292">2292</span>
<span id="2293">2293</span>
<span id="2294">2294</span>
<span id="2295">2295</span>
<span id="2296">2296</span>
<span id="2297">2297</span>
<span id="2298">2298</span>
<span id="2299">2299</span>
<span id="2300">2300</span>
<span id="2301">2301</span>
<span id="2302">2302</span>
<span id="2303">2303</span>
<span id="2304">2304</span>
<span id="2305">2305</span>
<span id="2306">2306</span>
<span id="2307">2307</span>
<span id="2308">2308</span>
<span id="2309">2309</span>
<span id="2310">2310</span>
<span id="2311">2311</span>
<span id="2312">2312</span>
<span id="2313">2313</span>
<span id="2314">2314</span>
<span id="2315">2315</span>
<span id="2316">2316</span>
<span id="2317">2317</span>
<span id="2318">2318</span>
<span id="2319">2319</span>
<span id="2320">2320</span>
<span id="2321">2321</span>
<span id="2322">2322</span>
<span id="2323">2323</span>
<span id="2324">2324</span>
<span id="2325">2325</span>
<span id="2326">2326</span>
<span id="2327">2327</span>
<span id="2328">2328</span>
<span id="2329">2329</span>
<span id="2330">2330</span>
<span id="2331">2331</span>
<span id="2332">2332</span>
<span id="2333">2333</span>
<span id="2334">2334</span>
<span id="2335">2335</span>
<span id="2336">2336</span>
<span id="2337">2337</span>
<span id="2338">2338</span>
<span id="2339">2339</span>
<span id="2340">2340</span>
<span id="2341">2341</span>
<span id="2342">2342</span>
<span id="2343">2343</span>
<span id="2344">2344</span>
<span id="2345">2345</span>
<span id="2346">2346</span>
<span id="2347">2347</span>
<span id="2348">2348</span>
<span id="2349">2349</span>
<span id="2350">2350</span>
<span id="2351">2351</span>
<span id="2352">2352</span>
<span id="2353">2353</span>
<span id="2354">2354</span>
<span id="2355">2355</span>
<span id="2356">2356</span>
<span id="2357">2357</span>
<span id="2358">2358</span>
<span id="2359">2359</span>
<span id="2360">2360</span>
<span id="2361">2361</span>
<span id="2362">2362</span>
<span id="2363">2363</span>
<span id="2364">2364</span>
<span id="2365">2365</span>
<span id="2366">2366</span>
<span id="2367">2367</span>
<span id="2368">2368</span>
<span id="2369">2369</span>
<span id="2370">2370</span>
<span id="2371">2371</span>
<span id="2372">2372</span>
<span id="2373">2373</span>
<span id="2374">2374</span>
<span id="2375">2375</span>
<span id="2376">2376</span>
<span id="2377">2377</span>
<span id="2378">2378</span>
<span id="2379">2379</span>
<span id="2380">2380</span>
<span id="2381">2381</span>
<span id="2382">2382</span>
<span id="2383">2383</span>
<span id="2384">2384</span>
<span id="2385">2385</span>
<span id="2386">2386</span>
<span id="2387">2387</span>
<span id="2388">2388</span>
<span id="2389">2389</span>
<span id="2390">2390</span>
<span id="2391">2391</span>
<span id="2392">2392</span>
<span id="2393">2393</span>
<span id="2394">2394</span>
<span id="2395">2395</span>
<span id="2396">2396</span>
<span id="2397">2397</span>
<span id="2398">2398</span>
<span id="2399">2399</span>
<span id="2400">2400</span>
<span id="2401">2401</span>
<span id="2402">2402</span>
<span id="2403">2403</span>
<span id="2404">2404</span>
<span id="2405">2405</span>
<span id="2406">2406</span>
<span id="2407">2407</span>
<span id="2408">2408</span>
<span id="2409">2409</span>
<span id="2410">2410</span>
<span id="2411">2411</span>
<span id="2412">2412</span>
<span id="2413">2413</span>
<span id="2414">2414</span>
<span id="2415">2415</span>
<span id="2416">2416</span>
<span id="2417">2417</span>
<span id="2418">2418</span>
<span id="2419">2419</span>
<span id="2420">2420</span>
<span id="2421">2421</span>
<span id="2422">2422</span>
<span id="2423">2423</span>
<span id="2424">2424</span>
<span id="2425">2425</span>
<span id="2426">2426</span>
<span id="2427">2427</span>
<span id="2428">2428</span>
<span id="2429">2429</span>
<span id="2430">2430</span>
<span id="2431">2431</span>
<span id="2432">2432</span>
<span id="2433">2433</span>
<span id="2434">2434</span>
<span id="2435">2435</span>
<span id="2436">2436</span>
<span id="2437">2437</span>
<span id="2438">2438</span>
<span id="2439">2439</span>
<span id="2440">2440</span>
<span id="2441">2441</span>
<span id="2442">2442</span>
<span id="2443">2443</span>
<span id="2444">2444</span>
<span id="2445">2445</span>
<span id="2446">2446</span>
<span id="2447">2447</span>
<span id="2448">2448</span>
<span id="2449">2449</span>
<span id="2450">2450</span>
<span id="2451">2451</span>
<span id="2452">2452</span>
<span id="2453">2453</span>
<span id="2454">2454</span>
<span id="2455">2455</span>
<span id="2456">2456</span>
<span id="2457">2457</span>
<span id="2458">2458</span>
<span id="2459">2459</span>
<span id="2460">2460</span>
<span id="2461">2461</span>
<span id="2462">2462</span>
<span id="2463">2463</span>
<span id="2464">2464</span>
<span id="2465">2465</span>
<span id="2466">2466</span>
<span id="2467">2467</span>
<span id="2468">2468</span>
<span id="2469">2469</span>
<span id="2470">2470</span>
<span id="2471">2471</span>
<span id="2472">2472</span>
<span id="2473">2473</span>
<span id="2474">2474</span>
<span id="2475">2475</span>
<span id="2476">2476</span>
<span id="2477">2477</span>
<span id="2478">2478</span>
<span id="2479">2479</span>
<span id="2480">2480</span>
<span id="2481">2481</span>
<span id="2482">2482</span>
<span id="2483">2483</span>
<span id="2484">2484</span>
<span id="2485">2485</span>
<span id="2486">2486</span>
<span id="2487">2487</span>
<span id="2488">2488</span>
<span id="2489">2489</span>
<span id="2490">2490</span>
<span id="2491">2491</span>
<span id="2492">2492</span>
<span id="2493">2493</span>
<span id="2494">2494</span>
<span id="2495">2495</span>
<span id="2496">2496</span>
<span id="2497">2497</span>
<span id="2498">2498</span>
<span id="2499">2499</span>
<span id="2500">2500</span>
<span id="2501">2501</span>
<span id="2502">2502</span>
<span id="2503">2503</span>
<span id="2504">2504</span>
<span id="2505">2505</span>
<span id="2506">2506</span>
<span id="2507">2507</span>
<span id="2508">2508</span>
<span id="2509">2509</span>
<span id="2510">2510</span>
<span id="2511">2511</span>
<span id="2512">2512</span>
<span id="2513">2513</span>
<span id="2514">2514</span>
<span id="2515">2515</span>
<span id="2516">2516</span>
<span id="2517">2517</span>
<span id="2518">2518</span>
<span id="2519">2519</span>
<span id="2520">2520</span>
<span id="2521">2521</span>
<span id="2522">2522</span>
<span id="2523">2523</span>
<span id="2524">2524</span>
<span id="2525">2525</span>
<span id="2526">2526</span>
<span id="2527">2527</span>
<span id="2528">2528</span>
<span id="2529">2529</span>
<span id="2530">2530</span>
<span id="2531">2531</span>
<span id="2532">2532</span>
<span id="2533">2533</span>
<span id="2534">2534</span>
<span id="2535">2535</span>
<span id="2536">2536</span>
<span id="2537">2537</span>
<span id="2538">2538</span>
<span id="2539">2539</span>
<span id="2540">2540</span>
<span id="2541">2541</span>
<span id="2542">2542</span>
<span id="2543">2543</span>
<span id="2544">2544</span>
<span id="2545">2545</span>
<span id="2546">2546</span>
<span id="2547">2547</span>
<span id="2548">2548</span>
<span id="2549">2549</span>
<span id="2550">2550</span>
<span id="2551">2551</span>
<span id="2552">2552</span>
<span id="2553">2553</span>
<span id="2554">2554</span>
<span id="2555">2555</span>
<span id="2556">2556</span>
<span id="2557">2557</span>
<span id="2558">2558</span>
<span id="2559">2559</span>
<span id="2560">2560</span>
<span id="2561">2561</span>
<span id="2562">2562</span>
<span id="2563">2563</span>
<span id="2564">2564</span>
<span id="2565">2565</span>
<span id="2566">2566</span>
<span id="2567">2567</span>
<span id="2568">2568</span>
<span id="2569">2569</span>
<span id="2570">2570</span>
<span id="2571">2571</span>
<span id="2572">2572</span>
<span id="2573">2573</span>
<span id="2574">2574</span>
<span id="2575">2575</span>
<span id="2576">2576</span>
<span id="2577">2577</span>
<span id="2578">2578</span>
<span id="2579">2579</span>
<span id="2580">2580</span>
<span id="2581">2581</span>
<span id="2582">2582</span>
<span id="2583">2583</span>
<span id="2584">2584</span>
<span id="2585">2585</span>
<span id="2586">2586</span>
<span id="2587">2587</span>
<span id="2588">2588</span>
<span id="2589">2589</span>
<span id="2590">2590</span>
<span id="2591">2591</span>
<span id="2592">2592</span>
<span id="2593">2593</span>
<span id="2594">2594</span>
<span id="2595">2595</span>
<span id="2596">2596</span>
<span id="2597">2597</span>
<span id="2598">2598</span>
<span id="2599">2599</span>
<span id="2600">2600</span>
<span id="2601">2601</span>
<span id="2602">2602</span>
<span id="2603">2603</span>
<span id="2604">2604</span>
<span id="2605">2605</span>
<span id="2606">2606</span>
<span id="2607">2607</span>
<span id="2608">2608</span>
<span id="2609">2609</span>
<span id="2610">2610</span>
<span id="2611">2611</span>
<span id="2612">2612</span>
<span id="2613">2613</span>
<span id="2614">2614</span>
<span id="2615">2615</span>
<span id="2616">2616</span>
<span id="2617">2617</span>
<span id="2618">2618</span>
<span id="2619">2619</span>
<span id="2620">2620</span>
<span id="2621">2621</span>
<span id="2622">2622</span>
<span id="2623">2623</span>
<span id="2624">2624</span>
<span id="2625">2625</span>
<span id="2626">2626</span>
<span id="2627">2627</span>
<span id="2628">2628</span>
<span id="2629">2629</span>
<span id="2630">2630</span>
<span id="2631">2631</span>
<span id="2632">2632</span>
<span id="2633">2633</span>
<span id="2634">2634</span>
<span id="2635">2635</span>
<span id="2636">2636</span>
<span id="2637">2637</span>
<span id="2638">2638</span>
<span id="2639">2639</span>
<span id="2640">2640</span>
<span id="2641">2641</span>
<span id="2642">2642</span>
<span id="2643">2643</span>
<span id="2644">2644</span>
<span id="2645">2645</span>
<span id="2646">2646</span>
<span id="2647">2647</span>
<span id="2648">2648</span>
<span id="2649">2649</span>
<span id="2650">2650</span>
<span id="2651">2651</span>
<span id="2652">2652</span>
<span id="2653">2653</span>
<span id="2654">2654</span>
<span id="2655">2655</span>
<span id="2656">2656</span>
<span id="2657">2657</span>
<span id="2658">2658</span>
<span id="2659">2659</span>
<span id="2660">2660</span>
<span id="2661">2661</span>
<span id="2662">2662</span>
<span id="2663">2663</span>
<span id="2664">2664</span>
<span id="2665">2665</span>
<span id="2666">2666</span>
<span id="2667">2667</span>
<span id="2668">2668</span>
<span id="2669">2669</span>
<span id="2670">2670</span>
<span id="2671">2671</span>
<span id="2672">2672</span>
<span id="2673">2673</span>
<span id="2674">2674</span>
<span id="2675">2675</span>
<span id="2676">2676</span>
<span id="2677">2677</span>
<span id="2678">2678</span>
<span id="2679">2679</span>
<span id="2680">2680</span>
<span id="2681">2681</span>
<span id="2682">2682</span>
<span id="2683">2683</span>
<span id="2684">2684</span>
<span id="2685">2685</span>
<span id="2686">2686</span>
<span id="2687">2687</span>
<span id="2688">2688</span>
<span id="2689">2689</span>
<span id="2690">2690</span>
<span id="2691">2691</span>
<span id="2692">2692</span>
<span id="2693">2693</span>
<span id="2694">2694</span>
<span id="2695">2695</span>
<span id="2696">2696</span>
<span id="2697">2697</span>
<span id="2698">2698</span>
<span id="2699">2699</span>
<span id="2700">2700</span>
<span id="2701">2701</span>
<span id="2702">2702</span>
<span id="2703">2703</span>
<span id="2704">2704</span>
<span id="2705">2705</span>
<span id="2706">2706</span>
<span id="2707">2707</span>
<span id="2708">2708</span>
<span id="2709">2709</span>
<span id="2710">2710</span>
<span id="2711">2711</span>
<span id="2712">2712</span>
<span id="2713">2713</span>
<span id="2714">2714</span>
<span id="2715">2715</span>
<span id="2716">2716</span>
<span id="2717">2717</span>
<span id="2718">2718</span>
<span id="2719">2719</span>
<span id="2720">2720</span>
<span id="2721">2721</span>
<span id="2722">2722</span>
<span id="2723">2723</span>
<span id="2724">2724</span>
<span id="2725">2725</span>
<span id="2726">2726</span>
<span id="2727">2727</span>
<span id="2728">2728</span>
<span id="2729">2729</span>
<span id="2730">2730</span>
<span id="2731">2731</span>
<span id="2732">2732</span>
<span id="2733">2733</span>
<span id="2734">2734</span>
<span id="2735">2735</span>
<span id="2736">2736</span>
<span id="2737">2737</span>
<span id="2738">2738</span>
<span id="2739">2739</span>
<span id="2740">2740</span>
<span id="2741">2741</span>
<span id="2742">2742</span>
<span id="2743">2743</span>
<span id="2744">2744</span>
<span id="2745">2745</span>
<span id="2746">2746</span>
<span id="2747">2747</span>
<span id="2748">2748</span>
<span id="2749">2749</span>
<span id="2750">2750</span>
<span id="2751">2751</span>
<span id="2752">2752</span>
<span id="2753">2753</span>
<span id="2754">2754</span>
<span id="2755">2755</span>
<span id="2756">2756</span>
<span id="2757">2757</span>
<span id="2758">2758</span>
<span id="2759">2759</span>
<span id="2760">2760</span>
<span id="2761">2761</span>
<span id="2762">2762</span>
<span id="2763">2763</span>
<span id="2764">2764</span>
<span id="2765">2765</span>
<span id="2766">2766</span>
<span id="2767">2767</span>
<span id="2768">2768</span>
<span id="2769">2769</span>
<span id="2770">2770</span>
<span id="2771">2771</span>
<span id="2772">2772</span>
<span id="2773">2773</span>
<span id="2774">2774</span>
<span id="2775">2775</span>
<span id="2776">2776</span>
<span id="2777">2777</span>
<span id="2778">2778</span>
<span id="2779">2779</span>
<span id="2780">2780</span>
<span id="2781">2781</span>
<span id="2782">2782</span>
<span id="2783">2783</span>
<span id="2784">2784</span>
<span id="2785">2785</span>
<span id="2786">2786</span>
<span id="2787">2787</span>
<span id="2788">2788</span>
<span id="2789">2789</span>
<span id="2790">2790</span>
<span id="2791">2791</span>
<span id="2792">2792</span>
<span id="2793">2793</span>
<span id="2794">2794</span>
<span id="2795">2795</span>
<span id="2796">2796</span>
<span id="2797">2797</span>
<span id="2798">2798</span>
<span id="2799">2799</span>
<span id="2800">2800</span>
<span id="2801">2801</span>
<span id="2802">2802</span>
<span id="2803">2803</span>
<span id="2804">2804</span>
<span id="2805">2805</span>
<span id="2806">2806</span>
<span id="2807">2807</span>
<span id="2808">2808</span>
<span id="2809">2809</span>
<span id="2810">2810</span>
<span id="2811">2811</span>
<span id="2812">2812</span>
<span id="2813">2813</span>
<span id="2814">2814</span>
<span id="2815">2815</span>
<span id="2816">2816</span>
<span id="2817">2817</span>
<span id="2818">2818</span>
<span id="2819">2819</span>
<span id="2820">2820</span>
<span id="2821">2821</span>
<span id="2822">2822</span>
<span id="2823">2823</span>
<span id="2824">2824</span>
<span id="2825">2825</span>
<span id="2826">2826</span>
<span id="2827">2827</span>
<span id="2828">2828</span>
<span id="2829">2829</span>
<span id="2830">2830</span>
<span id="2831">2831</span>
<span id="2832">2832</span>
<span id="2833">2833</span>
<span id="2834">2834</span>
<span id="2835">2835</span>
<span id="2836">2836</span>
<span id="2837">2837</span>
<span id="2838">2838</span>
<span id="2839">2839</span>
<span id="2840">2840</span>
<span id="2841">2841</span>
<span id="2842">2842</span>
<span id="2843">2843</span>
<span id="2844">2844</span>
<span id="2845">2845</span>
<span id="2846">2846</span>
<span id="2847">2847</span>
<span id="2848">2848</span>
<span id="2849">2849</span>
<span id="2850">2850</span>
<span id="2851">2851</span>
<span id="2852">2852</span>
<span id="2853">2853</span>
<span id="2854">2854</span>
<span id="2855">2855</span>
<span id="2856">2856</span>
<span id="2857">2857</span>
<span id="2858">2858</span>
<span id="2859">2859</span>
<span id="2860">2860</span>
<span id="2861">2861</span>
<span id="2862">2862</span>
<span id="2863">2863</span>
<span id="2864">2864</span>
<span id="2865">2865</span>
<span id="2866">2866</span>
<span id="2867">2867</span>
<span id="2868">2868</span>
<span id="2869">2869</span>
<span id="2870">2870</span>
<span id="2871">2871</span>
<span id="2872">2872</span>
<span id="2873">2873</span>
<span id="2874">2874</span>
<span id="2875">2875</span>
<span id="2876">2876</span>
<span id="2877">2877</span>
<span id="2878">2878</span>
<span id="2879">2879</span>
<span id="2880">2880</span>
<span id="2881">2881</span>
<span id="2882">2882</span>
<span id="2883">2883</span>
<span id="2884">2884</span>
<span id="2885">2885</span>
<span id="2886">2886</span>
<span id="2887">2887</span>
<span id="2888">2888</span>
<span id="2889">2889</span>
<span id="2890">2890</span>
<span id="2891">2891</span>
<span id="2892">2892</span>
<span id="2893">2893</span>
<span id="2894">2894</span>
<span id="2895">2895</span>
<span id="2896">2896</span>
<span id="2897">2897</span>
<span id="2898">2898</span>
<span id="2899">2899</span>
<span id="2900">2900</span>
<span id="2901">2901</span>
<span id="2902">2902</span>
<span id="2903">2903</span>
<span id="2904">2904</span>
<span id="2905">2905</span>
<span id="2906">2906</span>
<span id="2907">2907</span>
<span id="2908">2908</span>
<span id="2909">2909</span>
<span id="2910">2910</span>
<span id="2911">2911</span>
<span id="2912">2912</span>
<span id="2913">2913</span>
<span id="2914">2914</span>
<span id="2915">2915</span>
<span id="2916">2916</span>
<span id="2917">2917</span>
<span id="2918">2918</span>
<span id="2919">2919</span>
<span id="2920">2920</span>
<span id="2921">2921</span>
<span id="2922">2922</span>
<span id="2923">2923</span>
<span id="2924">2924</span>
<span id="2925">2925</span>
<span id="2926">2926</span>
<span id="2927">2927</span>
<span id="2928">2928</span>
<span id="2929">2929</span>
<span id="2930">2930</span>
<span id="2931">2931</span>
<span id="2932">2932</span>
<span id="2933">2933</span>
<span id="2934">2934</span>
<span id="2935">2935</span>
<span id="2936">2936</span>
<span id="2937">2937</span>
<span id="2938">2938</span>
<span id="2939">2939</span>
<span id="2940">2940</span>
<span id="2941">2941</span>
<span id="2942">2942</span>
<span id="2943">2943</span>
<span id="2944">2944</span>
<span id="2945">2945</span>
<span id="2946">2946</span>
<span id="2947">2947</span>
<span id="2948">2948</span>
<span id="2949">2949</span>
<span id="2950">2950</span>
<span id="2951">2951</span>
<span id="2952">2952</span>
<span id="2953">2953</span>
<span id="2954">2954</span>
<span id="2955">2955</span>
<span id="2956">2956</span>
<span id="2957">2957</span>
<span id="2958">2958</span>
<span id="2959">2959</span>
<span id="2960">2960</span>
<span id="2961">2961</span>
<span id="2962">2962</span>
<span id="2963">2963</span>
<span id="2964">2964</span>
<span id="2965">2965</span>
<span id="2966">2966</span>
<span id="2967">2967</span>
<span id="2968">2968</span>
<span id="2969">2969</span>
<span id="2970">2970</span>
<span id="2971">2971</span>
<span id="2972">2972</span>
<span id="2973">2973</span>
<span id="2974">2974</span>
<span id="2975">2975</span>
<span id="2976">2976</span>
<span id="2977">2977</span>
<span id="2978">2978</span>
<span id="2979">2979</span>
<span id="2980">2980</span>
<span id="2981">2981</span>
<span id="2982">2982</span>
<span id="2983">2983</span>
<span id="2984">2984</span>
<span id="2985">2985</span>
<span id="2986">2986</span>
<span id="2987">2987</span>
<span id="2988">2988</span>
<span id="2989">2989</span>
<span id="2990">2990</span>
<span id="2991">2991</span>
<span id="2992">2992</span>
<span id="2993">2993</span>
<span id="2994">2994</span>
<span id="2995">2995</span>
<span id="2996">2996</span>
<span id="2997">2997</span>
<span id="2998">2998</span>
<span id="2999">2999</span>
<span id="3000">3000</span>
<span id="3001">3001</span>
<span id="3002">3002</span>
<span id="3003">3003</span>
<span id="3004">3004</span>
<span id="3005">3005</span>
<span id="3006">3006</span>
<span id="3007">3007</span>
<span id="3008">3008</span>
<span id="3009">3009</span>
<span id="3010">3010</span>
<span id="3011">3011</span>
<span id="3012">3012</span>
<span id="3013">3013</span>
<span id="3014">3014</span>
<span id="3015">3015</span>
<span id="3016">3016</span>
<span id="3017">3017</span>
<span id="3018">3018</span>
<span id="3019">3019</span>
<span id="3020">3020</span>
<span id="3021">3021</span>
<span id="3022">3022</span>
<span id="3023">3023</span>
<span id="3024">3024</span>
<span id="3025">3025</span>
<span id="3026">3026</span>
<span id="3027">3027</span>
<span id="3028">3028</span>
<span id="3029">3029</span>
<span id="3030">3030</span>
<span id="3031">3031</span>
<span id="3032">3032</span>
<span id="3033">3033</span>
<span id="3034">3034</span>
<span id="3035">3035</span>
<span id="3036">3036</span>
<span id="3037">3037</span>
<span id="3038">3038</span>
<span id="3039">3039</span>
<span id="3040">3040</span>
<span id="3041">3041</span>
<span id="3042">3042</span>
<span id="3043">3043</span>
<span id="3044">3044</span>
<span id="3045">3045</span>
<span id="3046">3046</span>
<span id="3047">3047</span>
<span id="3048">3048</span>
<span id="3049">3049</span>
<span id="3050">3050</span>
<span id="3051">3051</span>
<span id="3052">3052</span>
<span id="3053">3053</span>
<span id="3054">3054</span>
<span id="3055">3055</span>
<span id="3056">3056</span>
<span id="3057">3057</span>
<span id="3058">3058</span>
<span id="3059">3059</span>
<span id="3060">3060</span>
<span id="3061">3061</span>
<span id="3062">3062</span>
<span id="3063">3063</span>
<span id="3064">3064</span>
<span id="3065">3065</span>
<span id="3066">3066</span>
<span id="3067">3067</span>
<span id="3068">3068</span>
<span id="3069">3069</span>
<span id="3070">3070</span>
<span id="3071">3071</span>
<span id="3072">3072</span>
<span id="3073">3073</span>
<span id="3074">3074</span>
<span id="3075">3075</span>
<span id="3076">3076</span>
<span id="3077">3077</span>
<span id="3078">3078</span>
<span id="3079">3079</span>
<span id="3080">3080</span>
<span id="3081">3081</span>
<span id="3082">3082</span>
<span id="3083">3083</span>
<span id="3084">3084</span>
<span id="3085">3085</span>
<span id="3086">3086</span>
<span id="3087">3087</span>
<span id="3088">3088</span>
<span id="3089">3089</span>
<span id="3090">3090</span>
<span id="3091">3091</span>
<span id="3092">3092</span>
<span id="3093">3093</span>
<span id="3094">3094</span>
<span id="3095">3095</span>
<span id="3096">3096</span>
<span id="3097">3097</span>
<span id="3098">3098</span>
<span id="3099">3099</span>
<span id="3100">3100</span>
<span id="3101">3101</span>
<span id="3102">3102</span>
<span id="3103">3103</span>
<span id="3104">3104</span>
<span id="3105">3105</span>
<span id="3106">3106</span>
<span id="3107">3107</span>
<span id="3108">3108</span>
<span id="3109">3109</span>
<span id="3110">3110</span>
<span id="3111">3111</span>
<span id="3112">3112</span>
<span id="3113">3113</span>
<span id="3114">3114</span>
<span id="3115">3115</span>
<span id="3116">3116</span>
<span id="3117">3117</span>
<span id="3118">3118</span>
<span id="3119">3119</span>
<span id="3120">3120</span>
<span id="3121">3121</span>
<span id="3122">3122</span>
<span id="3123">3123</span>
<span id="3124">3124</span>
<span id="3125">3125</span>
<span id="3126">3126</span>
<span id="3127">3127</span>
<span id="3128">3128</span>
<span id="3129">3129</span>
<span id="3130">3130</span>
<span id="3131">3131</span>
<span id="3132">3132</span>
<span id="3133">3133</span>
<span id="3134">3134</span>
<span id="3135">3135</span>
<span id="3136">3136</span>
<span id="3137">3137</span>
<span id="3138">3138</span>
<span id="3139">3139</span>
<span id="3140">3140</span>
<span id="3141">3141</span>
<span id="3142">3142</span>
<span id="3143">3143</span>
<span id="3144">3144</span>
<span id="3145">3145</span>
<span id="3146">3146</span>
<span id="3147">3147</span>
<span id="3148">3148</span>
<span id="3149">3149</span>
<span id="3150">3150</span>
<span id="3151">3151</span>
<span id="3152">3152</span>
<span id="3153">3153</span>
<span id="3154">3154</span>
<span id="3155">3155</span>
<span id="3156">3156</span>
<span id="3157">3157</span>
<span id="3158">3158</span>
<span id="3159">3159</span>
<span id="3160">3160</span>
<span id="3161">3161</span>
<span id="3162">3162</span>
<span id="3163">3163</span>
<span id="3164">3164</span>
<span id="3165">3165</span>
<span id="3166">3166</span>
<span id="3167">3167</span>
<span id="3168">3168</span>
<span id="3169">3169</span>
<span id="3170">3170</span>
<span id="3171">3171</span>
<span id="3172">3172</span>
<span id="3173">3173</span>
<span id="3174">3174</span>
<span id="3175">3175</span>
<span id="3176">3176</span>
<span id="3177">3177</span>
<span id="3178">3178</span>
<span id="3179">3179</span>
<span id="3180">3180</span>
<span id="3181">3181</span>
<span id="3182">3182</span>
<span id="3183">3183</span>
<span id="3184">3184</span>
<span id="3185">3185</span>
<span id="3186">3186</span>
<span id="3187">3187</span>
<span id="3188">3188</span>
<span id="3189">3189</span>
<span id="3190">3190</span>
<span id="3191">3191</span>
<span id="3192">3192</span>
<span id="3193">3193</span>
<span id="3194">3194</span>
<span id="3195">3195</span>
<span id="3196">3196</span>
<span id="3197">3197</span>
<span id="3198">3198</span>
<span id="3199">3199</span>
<span id="3200">3200</span>
<span id="3201">3201</span>
<span id="3202">3202</span>
<span id="3203">3203</span>
<span id="3204">3204</span>
<span id="3205">3205</span>
<span id="3206">3206</span>
<span id="3207">3207</span>
<span id="3208">3208</span>
<span id="3209">3209</span>
<span id="3210">3210</span>
<span id="3211">3211</span>
<span id="3212">3212</span>
<span id="3213">3213</span>
<span id="3214">3214</span>
<span id="3215">3215</span>
<span id="3216">3216</span>
<span id="3217">3217</span>
<span id="3218">3218</span>
<span id="3219">3219</span>
<span id="3220">3220</span>
<span id="3221">3221</span>
<span id="3222">3222</span>
<span id="3223">3223</span>
<span id="3224">3224</span>
<span id="3225">3225</span>
<span id="3226">3226</span>
<span id="3227">3227</span>
<span id="3228">3228</span>
<span id="3229">3229</span>
<span id="3230">3230</span>
<span id="3231">3231</span>
<span id="3232">3232</span>
<span id="3233">3233</span>
<span id="3234">3234</span>
<span id="3235">3235</span>
<span id="3236">3236</span>
<span id="3237">3237</span>
<span id="3238">3238</span>
<span id="3239">3239</span>
<span id="3240">3240</span>
<span id="3241">3241</span>
<span id="3242">3242</span>
<span id="3243">3243</span>
<span id="3244">3244</span>
<span id="3245">3245</span>
<span id="3246">3246</span>
<span id="3247">3247</span>
<span id="3248">3248</span>
<span id="3249">3249</span>
<span id="3250">3250</span>
<span id="3251">3251</span>
<span id="3252">3252</span>
<span id="3253">3253</span>
<span id="3254">3254</span>
<span id="3255">3255</span>
<span id="3256">3256</span>
<span id="3257">3257</span>
<span id="3258">3258</span>
<span id="3259">3259</span>
<span id="3260">3260</span>
<span id="3261">3261</span>
<span id="3262">3262</span>
<span id="3263">3263</span>
<span id="3264">3264</span>
<span id="3265">3265</span>
<span id="3266">3266</span>
<span id="3267">3267</span>
<span id="3268">3268</span>
<span id="3269">3269</span>
<span id="3270">3270</span>
<span id="3271">3271</span>
<span id="3272">3272</span>
<span id="3273">3273</span>
<span id="3274">3274</span>
<span id="3275">3275</span>
<span id="3276">3276</span>
<span id="3277">3277</span>
<span id="3278">3278</span>
<span id="3279">3279</span>
<span id="3280">3280</span>
<span id="3281">3281</span>
<span id="3282">3282</span>
<span id="3283">3283</span>
<span id="3284">3284</span>
<span id="3285">3285</span>
<span id="3286">3286</span>
<span id="3287">3287</span>
<span id="3288">3288</span>
<span id="3289">3289</span>
<span id="3290">3290</span>
<span id="3291">3291</span>
<span id="3292">3292</span>
<span id="3293">3293</span>
<span id="3294">3294</span>
<span id="3295">3295</span>
<span id="3296">3296</span>
<span id="3297">3297</span>
<span id="3298">3298</span>
<span id="3299">3299</span>
<span id="3300">3300</span>
<span id="3301">3301</span>
<span id="3302">3302</span>
<span id="3303">3303</span>
<span id="3304">3304</span>
<span id="3305">3305</span>
<span id="3306">3306</span>
<span id="3307">3307</span>
<span id="3308">3308</span>
<span id="3309">3309</span>
<span id="3310">3310</span>
<span id="3311">3311</span>
<span id="3312">3312</span>
<span id="3313">3313</span>
<span id="3314">3314</span>
<span id="3315">3315</span>
<span id="3316">3316</span>
<span id="3317">3317</span>
<span id="3318">3318</span>
<span id="3319">3319</span>
<span id="3320">3320</span>
<span id="3321">3321</span>
<span id="3322">3322</span>
<span id="3323">3323</span>
<span id="3324">3324</span>
<span id="3325">3325</span>
<span id="3326">3326</span>
<span id="3327">3327</span>
<span id="3328">3328</span>
<span id="3329">3329</span>
<span id="3330">3330</span>
<span id="3331">3331</span>
<span id="3332">3332</span>
<span id="3333">3333</span>
<span id="3334">3334</span>
<span id="3335">3335</span>
<span id="3336">3336</span>
<span id="3337">3337</span>
<span id="3338">3338</span>
<span id="3339">3339</span>
<span id="3340">3340</span>
<span id="3341">3341</span>
<span id="3342">3342</span>
<span id="3343">3343</span>
<span id="3344">3344</span>
<span id="3345">3345</span>
<span id="3346">3346</span>
<span id="3347">3347</span>
<span id="3348">3348</span>
<span id="3349">3349</span>
<span id="3350">3350</span>
<span id="3351">3351</span>
<span id="3352">3352</span>
<span id="3353">3353</span>
<span id="3354">3354</span>
<span id="3355">3355</span>
<span id="3356">3356</span>
<span id="3357">3357</span>
<span id="3358">3358</span>
<span id="3359">3359</span>
<span id="3360">3360</span>
<span id="3361">3361</span>
<span id="3362">3362</span>
<span id="3363">3363</span>
<span id="3364">3364</span>
<span id="3365">3365</span>
<span id="3366">3366</span>
<span id="3367">3367</span>
<span id="3368">3368</span>
<span id="3369">3369</span>
<span id="3370">3370</span>
<span id="3371">3371</span>
<span id="3372">3372</span>
<span id="3373">3373</span>
<span id="3374">3374</span>
<span id="3375">3375</span>
<span id="3376">3376</span>
<span id="3377">3377</span>
<span id="3378">3378</span>
<span id="3379">3379</span>
<span id="3380">3380</span>
<span id="3381">3381</span>
<span id="3382">3382</span>
<span id="3383">3383</span>
<span id="3384">3384</span>
<span id="3385">3385</span>
<span id="3386">3386</span>
<span id="3387">3387</span>
<span id="3388">3388</span>
<span id="3389">3389</span>
<span id="3390">3390</span>
<span id="3391">3391</span>
<span id="3392">3392</span>
<span id="3393">3393</span>
<span id="3394">3394</span>
<span id="3395">3395</span>
<span id="3396">3396</span>
<span id="3397">3397</span>
<span id="3398">3398</span>
<span id="3399">3399</span>
<span id="3400">3400</span>
<span id="3401">3401</span>
<span id="3402">3402</span>
<span id="3403">3403</span>
<span id="3404">3404</span>
<span id="3405">3405</span>
<span id="3406">3406</span>
<span id="3407">3407</span>
<span id="3408">3408</span>
<span id="3409">3409</span>
<span id="3410">3410</span>
<span id="3411">3411</span>
<span id="3412">3412</span>
<span id="3413">3413</span>
<span id="3414">3414</span>
<span id="3415">3415</span>
<span id="3416">3416</span>
<span id="3417">3417</span>
<span id="3418">3418</span>
<span id="3419">3419</span>
<span id="3420">3420</span>
<span id="3421">3421</span>
<span id="3422">3422</span>
<span id="3423">3423</span>
<span id="3424">3424</span>
<span id="3425">3425</span>
<span id="3426">3426</span>
<span id="3427">3427</span>
<span id="3428">3428</span>
<span id="3429">3429</span>
<span id="3430">3430</span>
<span id="3431">3431</span>
<span id="3432">3432</span>
<span id="3433">3433</span>
<span id="3434">3434</span>
<span id="3435">3435</span>
<span id="3436">3436</span>
<span id="3437">3437</span>
<span id="3438">3438</span>
<span id="3439">3439</span>
<span id="3440">3440</span>
<span id="3441">3441</span>
<span id="3442">3442</span>
<span id="3443">3443</span>
<span id="3444">3444</span>
<span id="3445">3445</span>
<span id="3446">3446</span>
<span id="3447">3447</span>
<span id="3448">3448</span>
<span id="3449">3449</span>
<span id="3450">3450</span>
<span id="3451">3451</span>
<span id="3452">3452</span>
<span id="3453">3453</span>
<span id="3454">3454</span>
<span id="3455">3455</span>
<span id="3456">3456</span>
<span id="3457">3457</span>
<span id="3458">3458</span>
<span id="3459">3459</span>
<span id="3460">3460</span>
<span id="3461">3461</span>
<span id="3462">3462</span>
<span id="3463">3463</span>
<span id="3464">3464</span>
<span id="3465">3465</span>
<span id="3466">3466</span>
<span id="3467">3467</span>
<span id="3468">3468</span>
<span id="3469">3469</span>
<span id="3470">3470</span>
<span id="3471">3471</span>
<span id="3472">3472</span>
<span id="3473">3473</span>
<span id="3474">3474</span>
<span id="3475">3475</span>
<span id="3476">3476</span>
<span id="3477">3477</span>
<span id="3478">3478</span>
<span id="3479">3479</span>
<span id="3480">3480</span>
<span id="3481">3481</span>
<span id="3482">3482</span>
<span id="3483">3483</span>
<span id="3484">3484</span>
<span id="3485">3485</span>
<span id="3486">3486</span>
<span id="3487">3487</span>
<span id="3488">3488</span>
<span id="3489">3489</span>
<span id="3490">3490</span>
<span id="3491">3491</span>
<span id="3492">3492</span>
<span id="3493">3493</span>
<span id="3494">3494</span>
<span id="3495">3495</span>
<span id="3496">3496</span>
</pre><pre class="rust"><code><span class="kw">use </span>std::collections::HashMap;
<span class="kw">use </span>std::collections::hash_map::RandomState;
<span class="kw">use </span>std::convert::TryFrom;
<span class="kw">use </span>std::hash::{BuildHasher, Hash, Hasher};
<span class="kw">use </span>std::iter::{FromIterator, FusedIterator};
<span class="kw">use </span>std::marker::PhantomData;
<span class="kw">use </span>std::{fmt, mem, ops, ptr, vec};
<span class="kw">use </span><span class="kw">crate</span>::Error;
<span class="kw">use </span><span class="kw">super</span>::HeaderValue;
<span class="kw">use </span><span class="kw">super</span>::name::{HdrName, HeaderName, InvalidHeaderName};
<span class="kw">pub use </span><span class="self">self</span>::as_header_name::AsHeaderName;
<span class="kw">pub use </span><span class="self">self</span>::into_header_name::IntoHeaderName;
<span class="doccomment">/// A set of HTTP headers
///
/// `HeaderMap` is an multimap of [`HeaderName`] to values.
///
/// [`HeaderName`]: struct.HeaderName.html
///
/// # Examples
///
/// Basic usage
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST, LOCATION};
/// let mut headers = HeaderMap::new();
///
/// headers.insert(HOST, &quot;example.com&quot;.parse().unwrap());
/// headers.insert(CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
///
/// assert!(headers.contains_key(HOST));
/// assert!(!headers.contains_key(LOCATION));
///
/// assert_eq!(headers[HOST], &quot;example.com&quot;);
///
/// headers.remove(HOST);
///
/// assert!(!headers.contains_key(HOST));
/// ```
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>HeaderMap&lt;T = HeaderValue&gt; {
<span class="comment">// Used to mask values to get an index
</span>mask: Size,
indices: Box&lt;[Pos]&gt;,
entries: Vec&lt;Bucket&lt;T&gt;&gt;,
extra_values: Vec&lt;ExtraValue&lt;T&gt;&gt;,
danger: Danger,
}
<span class="comment">// # Implementation notes
//
// Below, you will find a fairly large amount of code. Most of this is to
// provide the necessary functions to efficiently manipulate the header
// multimap. The core hashing table is based on robin hood hashing [1]. While
// this is the same hashing algorithm used as part of Rust&#39;s `HashMap` in
// stdlib, many implementation details are different. The two primary reasons
// for this divergence are that `HeaderMap` is a multimap and the structure has
// been optimized to take advantage of the characteristics of HTTP headers.
//
// ## Structure Layout
//
// Most of the data contained by `HeaderMap` is *not* stored in the hash table.
// Instead, pairs of header name and *first* associated header value are stored
// in the `entries` vector. If the header name has more than one associated
// header value, then additional values are stored in `extra_values`. The actual
// hash table (`indices`) only maps hash codes to indices in `entries`. This
// means that, when an eviction happens, the actual header name and value stay
// put and only a tiny amount of memory has to be copied.
//
// Extra values associated with a header name are tracked using a linked list.
// Links are formed with offsets into `extra_values` and not pointers.
//
// [1]: https://en.wikipedia.org/wiki/Hash_table#Robin_Hood_hashing
</span><span class="doccomment">/// `HeaderMap` entry iterator.
///
/// Yields `(&amp;HeaderName, &amp;value)` tuples. The same header name may be yielded
/// more than once if it has more than one associated value.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Iter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
inner: IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt;,
}
<span class="doccomment">/// `HeaderMap` mutable entry iterator
///
/// Yields `(&amp;HeaderName, &amp;mut value)` tuples. The same header name may be
/// yielded more than once if it has more than one associated value.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
map: <span class="kw-2">*mut </span>HeaderMap&lt;T&gt;,
entry: usize,
cursor: <span class="prelude-ty">Option</span>&lt;Cursor&gt;,
lt: PhantomData&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt;&gt;,
}
<span class="doccomment">/// An owning iterator over the entries of a `HeaderMap`.
///
/// This struct is created by the `into_iter` method on `HeaderMap`.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>IntoIter&lt;T&gt; {
<span class="comment">// If None, pull from `entries`
</span>next: <span class="prelude-ty">Option</span>&lt;usize&gt;,
entries: vec::IntoIter&lt;Bucket&lt;T&gt;&gt;,
extra_values: Vec&lt;ExtraValue&lt;T&gt;&gt;,
}
<span class="doccomment">/// An iterator over `HeaderMap` keys.
///
/// Each header name is yielded only once, even if it has more than one
/// associated value.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Keys&lt;<span class="lifetime">&#39;a</span>, T&gt; {
inner: ::std::slice::Iter&lt;<span class="lifetime">&#39;a</span>, Bucket&lt;T&gt;&gt;,
}
<span class="doccomment">/// `HeaderMap` value iterator.
///
/// Each value contained in the `HeaderMap` will be yielded.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Values&lt;<span class="lifetime">&#39;a</span>, T&gt; {
inner: Iter&lt;<span class="lifetime">&#39;a</span>, T&gt;,
}
<span class="doccomment">/// `HeaderMap` mutable value iterator
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>ValuesMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
inner: IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt;,
}
<span class="doccomment">/// A drain iterator for `HeaderMap`.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>Drain&lt;<span class="lifetime">&#39;a</span>, T&gt; {
idx: usize,
len: usize,
entries: <span class="kw-2">*mut </span>[Bucket&lt;T&gt;],
<span class="comment">// If None, pull from `entries`
</span>next: <span class="prelude-ty">Option</span>&lt;usize&gt;,
extra_values: <span class="kw-2">*mut </span>Vec&lt;ExtraValue&lt;T&gt;&gt;,
lt: PhantomData&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt;&gt;,
}
<span class="doccomment">/// A view to all values stored in a single entry.
///
/// This struct is returned by `HeaderMap::get_all`.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>GetAll&lt;<span class="lifetime">&#39;a</span>, T&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderMap&lt;T&gt;,
index: <span class="prelude-ty">Option</span>&lt;usize&gt;,
}
<span class="doccomment">/// A view into a single location in a `HeaderMap`, which may be vacant or occupied.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub enum </span>Entry&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; {
<span class="doccomment">/// An occupied entry
</span>Occupied(OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt;),
<span class="doccomment">/// A vacant entry
</span>Vacant(VacantEntry&lt;<span class="lifetime">&#39;a</span>, T&gt;),
}
<span class="doccomment">/// A view into a single empty location in a `HeaderMap`.
///
/// This struct is returned as part of the `Entry` enum.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>VacantEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt;,
key: HeaderName,
hash: HashValue,
probe: usize,
danger: bool,
}
<span class="doccomment">/// A view into a single occupied location in a `HeaderMap`.
///
/// This struct is returned as part of the `Entry` enum.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt;,
probe: usize,
index: usize,
}
<span class="doccomment">/// An iterator of all values associated with a single header name.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderMap&lt;T&gt;,
index: usize,
front: <span class="prelude-ty">Option</span>&lt;Cursor&gt;,
back: <span class="prelude-ty">Option</span>&lt;Cursor&gt;,
}
<span class="doccomment">/// A mutable iterator of all values associated with a single header name.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
map: <span class="kw-2">*mut </span>HeaderMap&lt;T&gt;,
index: usize,
front: <span class="prelude-ty">Option</span>&lt;Cursor&gt;,
back: <span class="prelude-ty">Option</span>&lt;Cursor&gt;,
lt: PhantomData&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt;&gt;,
}
<span class="doccomment">/// An drain iterator of all values associated with a single header name.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">pub struct </span>ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt; {
first: <span class="prelude-ty">Option</span>&lt;T&gt;,
next: <span class="prelude-ty">Option</span>&lt;::std::vec::IntoIter&lt;T&gt;&gt;,
lt: PhantomData&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt;&gt;,
}
<span class="doccomment">/// Tracks the value iterator state
</span><span class="attribute">#[derive(Debug, Copy, Clone, Eq, PartialEq)]
</span><span class="kw">enum </span>Cursor {
Head,
Values(usize),
}
<span class="doccomment">/// Type used for representing the size of a HeaderMap value.
///
/// 32,768 is more than enough entries for a single header map. Setting this
/// limit enables using `u16` to represent all offsets, which takes 2 bytes
/// instead of 8 on 64 bit processors.
///
/// Setting this limit is especially benificial for `indices`, making it more
/// cache friendly. More hash codes can fit in a cache line.
///
/// You may notice that `u16` may represent more than 32,768 values. This is
/// true, but 32,768 should be plenty and it allows us to reserve the top bit
/// for future usage.
</span><span class="kw">type </span>Size = u16;
<span class="doccomment">/// This limit falls out from above.
</span><span class="kw">const </span>MAX_SIZE: usize = <span class="number">1 </span>&lt;&lt; <span class="number">15</span>;
<span class="doccomment">/// An entry in the hash table. This represents the full hash code for an entry
/// as well as the position of the entry in the `entries` vector.
</span><span class="attribute">#[derive(Copy, Clone)]
</span><span class="kw">struct </span>Pos {
<span class="comment">// Index in the `entries` vec
</span>index: Size,
<span class="comment">// Full hash value for the entry.
</span>hash: HashValue,
}
<span class="doccomment">/// Hash values are limited to u16 as well. While `fast_hash` and `Hasher`
/// return `usize` hash codes, limiting the effective hash code to the lower 16
/// bits is fine since we know that the `indices` vector will never grow beyond
/// that size.
</span><span class="attribute">#[derive(Debug, Copy, Clone, Eq, PartialEq)]
</span><span class="kw">struct </span>HashValue(u16);
<span class="doccomment">/// Stores the data associated with a `HeaderMap` entry. Only the first value is
/// included in this struct. If a header name has more than one associated
/// value, all extra values are stored in the `extra_values` vector. A doubly
/// linked list of entries is maintained. The doubly linked list is used so that
/// removing a value is constant time. This also has the nice property of
/// enabling double ended iteration.
</span><span class="attribute">#[derive(Debug, Clone)]
</span><span class="kw">struct </span>Bucket&lt;T&gt; {
hash: HashValue,
key: HeaderName,
value: T,
links: <span class="prelude-ty">Option</span>&lt;Links&gt;,
}
<span class="doccomment">/// The head and tail of the value linked list.
</span><span class="attribute">#[derive(Debug, Copy, Clone)]
</span><span class="kw">struct </span>Links {
next: usize,
tail: usize,
}
<span class="doccomment">/// Access to the `links` value in a slice of buckets.
///
/// It&#39;s important that no other field is accessed, since it may have been
/// freed in a `Drain` iterator.
</span><span class="attribute">#[derive(Debug)]
</span><span class="kw">struct </span>RawLinks&lt;T&gt;(<span class="kw-2">*mut </span>[Bucket&lt;T&gt;]);
<span class="doccomment">/// Node in doubly-linked list of header value entries
</span><span class="attribute">#[derive(Debug, Clone)]
</span><span class="kw">struct </span>ExtraValue&lt;T&gt; {
value: T,
prev: Link,
next: Link,
}
<span class="doccomment">/// A header value node is either linked to another node in the `extra_values`
/// list or it points to an entry in `entries`. The entry in `entries` is the
/// start of the list and holds the associated header name.
</span><span class="attribute">#[derive(Debug, Copy, Clone, Eq, PartialEq)]
</span><span class="kw">enum </span>Link {
Entry(usize),
Extra(usize),
}
<span class="doccomment">/// Tracks the header map danger level! This relates to the adaptive hashing
/// algorithm. A HeaderMap starts in the &quot;green&quot; state, when a large number of
/// collisions are detected, it transitions to the yellow state. At this point,
/// the header map will either grow and switch back to the green state OR it
/// will transition to the red state.
///
/// When in the red state, a safe hashing algorithm is used and all values in
/// the header map have to be rehashed.
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">enum </span>Danger {
Green,
Yellow,
Red(RandomState),
}
<span class="comment">// Constants related to detecting DOS attacks.
//
// Displacement is the number of entries that get shifted when inserting a new
// value. Forward shift is how far the entry gets stored from the ideal
// position.
//
// The current constant values were picked from another implementation. It could
// be that there are different values better suited to the header map case.
</span><span class="kw">const </span>DISPLACEMENT_THRESHOLD: usize = <span class="number">128</span>;
<span class="kw">const </span>FORWARD_SHIFT_THRESHOLD: usize = <span class="number">512</span>;
<span class="comment">// The default strategy for handling the yellow danger state is to increase the
// header map capacity in order to (hopefully) reduce the number of collisions.
// If growing the hash map would cause the load factor to drop bellow this
// threshold, then instead of growing, the headermap is switched to the red
// danger state and safe hashing is used instead.
</span><span class="kw">const </span>LOAD_FACTOR_THRESHOLD: f32 = <span class="number">0.2</span>;
<span class="comment">// Macro used to iterate the hash table starting at a given point, looping when
// the end is hit.
</span><span class="macro">macro_rules! </span>probe_loop {
(<span class="macro-nonterminal">$label</span>:tt: <span class="macro-nonterminal">$probe_var</span>: ident &lt; <span class="macro-nonterminal">$len</span>: expr, <span class="macro-nonterminal">$body</span>: expr) =&gt; {
<span class="macro">debug_assert!</span>(<span class="macro-nonterminal">$len </span>&gt; <span class="number">0</span>);
<span class="macro-nonterminal">$label</span>:
<span class="kw">loop </span>{
<span class="kw">if </span><span class="macro-nonterminal">$probe_var </span>&lt; <span class="macro-nonterminal">$len </span>{
<span class="macro-nonterminal">$body
$probe_var </span>+= <span class="number">1</span>;
} <span class="kw">else </span>{
<span class="macro-nonterminal">$probe_var </span>= <span class="number">0</span>;
}
}
};
(<span class="macro-nonterminal">$probe_var</span>: ident &lt; <span class="macro-nonterminal">$len</span>: expr, <span class="macro-nonterminal">$body</span>: expr) =&gt; {
<span class="macro">debug_assert!</span>(<span class="macro-nonterminal">$len </span>&gt; <span class="number">0</span>);
<span class="kw">loop </span>{
<span class="kw">if </span><span class="macro-nonterminal">$probe_var </span>&lt; <span class="macro-nonterminal">$len </span>{
<span class="macro-nonterminal">$body
$probe_var </span>+= <span class="number">1</span>;
} <span class="kw">else </span>{
<span class="macro-nonterminal">$probe_var </span>= <span class="number">0</span>;
}
}
};
}
<span class="comment">// First part of the robinhood algorithm. Given a key, find the slot in which it
// will be inserted. This is done by starting at the &quot;ideal&quot; spot. Then scanning
// until the destination slot is found. A destination slot is either the next
// empty slot or the next slot that is occupied by an entry that has a lower
// displacement (displacement is the distance from the ideal spot).
//
// This is implemented as a macro instead of a function that takes a closure in
// order to guarantee that it is &quot;inlined&quot;. There is no way to annotate closures
// to guarantee inlining.
</span><span class="macro">macro_rules! </span>insert_phase_one {
(<span class="macro-nonterminal">$map</span>:ident,
<span class="macro-nonterminal">$key</span>:expr,
<span class="macro-nonterminal">$probe</span>:ident,
<span class="macro-nonterminal">$pos</span>:ident,
<span class="macro-nonterminal">$hash</span>:ident,
<span class="macro-nonterminal">$danger</span>:ident,
<span class="macro-nonterminal">$vacant</span>:expr,
<span class="macro-nonterminal">$occupied</span>:expr,
<span class="macro-nonterminal">$robinhood</span>:expr) =&gt;
{{
<span class="kw">let </span><span class="macro-nonterminal">$hash </span>= hash_elem_using(<span class="kw-2">&amp;</span><span class="macro-nonterminal">$map</span>.danger, <span class="kw-2">&amp;</span><span class="macro-nonterminal">$key</span>);
<span class="kw">let </span><span class="kw-2">mut </span><span class="macro-nonterminal">$probe </span>= desired_pos(<span class="macro-nonterminal">$map</span>.mask, <span class="macro-nonterminal">$hash</span>);
<span class="kw">let </span><span class="kw-2">mut </span>dist = <span class="number">0</span>;
<span class="kw">let </span>ret;
<span class="comment">// Start at the ideal position, checking all slots
</span><span class="macro">probe_loop!</span>(<span class="lifetime">&#39;probe</span>: <span class="macro-nonterminal">$probe </span>&lt; <span class="macro-nonterminal">$map</span>.indices.len(), {
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="macro-nonterminal">$pos</span>, entry_hash)) = <span class="macro-nonterminal">$map</span>.indices[<span class="macro-nonterminal">$probe</span>].resolve() {
<span class="comment">// The slot is already occupied, but check if it has a lower
// displacement.
</span><span class="kw">let </span>their_dist = probe_distance(<span class="macro-nonterminal">$map</span>.mask, entry_hash, <span class="macro-nonterminal">$probe</span>);
<span class="kw">if </span>their_dist &lt; dist {
<span class="comment">// The new key&#39;s distance is larger, so claim this spot and
// displace the current entry.
//
// Check if this insertion is above the danger threshold.
</span><span class="kw">let </span><span class="macro-nonterminal">$danger </span>=
dist &gt;= FORWARD_SHIFT_THRESHOLD &amp;&amp; !<span class="macro-nonterminal">$map</span>.danger.is_red();
ret = <span class="macro-nonterminal">$robinhood</span>;
<span class="kw">break </span><span class="lifetime">&#39;probe</span>;
} <span class="kw">else if </span>entry_hash == <span class="macro-nonterminal">$hash </span>&amp;&amp; <span class="macro-nonterminal">$map</span>.entries[<span class="macro-nonterminal">$pos</span>].key == <span class="macro-nonterminal">$key </span>{
<span class="comment">// There already is an entry with the same key.
</span>ret = <span class="macro-nonterminal">$occupied</span>;
<span class="kw">break </span><span class="lifetime">&#39;probe</span>;
}
} <span class="kw">else </span>{
<span class="comment">// The entry is vacant, use it for this key.
</span><span class="kw">let </span><span class="macro-nonterminal">$danger </span>=
dist &gt;= FORWARD_SHIFT_THRESHOLD &amp;&amp; !<span class="macro-nonterminal">$map</span>.danger.is_red();
ret = <span class="macro-nonterminal">$vacant</span>;
<span class="kw">break </span><span class="lifetime">&#39;probe</span>;
}
dist += <span class="number">1</span>;
});
ret
}}
}
<span class="comment">// ===== impl HeaderMap =====
</span><span class="kw">impl </span>HeaderMap {
<span class="doccomment">/// Create an empty `HeaderMap`.
///
/// The map will be created without any capacity. This function will not
/// allocate.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// let map = HeaderMap::new();
///
/// assert!(map.is_empty());
/// assert_eq!(0, map.capacity());
/// ```
</span><span class="kw">pub fn </span>new() -&gt; <span class="self">Self </span>{
HeaderMap::with_capacity(<span class="number">0</span>)
}
}
<span class="kw">impl</span>&lt;T&gt; HeaderMap&lt;T&gt; {
<span class="doccomment">/// Create an empty `HeaderMap` with the specified capacity.
///
/// The returned map will allocate internal storage in order to hold about
/// `capacity` elements without reallocating. However, this is a &quot;best
/// effort&quot; as there are usage patterns that could cause additional
/// allocations before `capacity` headers are stored in the map.
///
/// More capacity than requested may be allocated.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// let map: HeaderMap&lt;u32&gt; = HeaderMap::with_capacity(10);
///
/// assert!(map.is_empty());
/// assert_eq!(12, map.capacity());
/// ```
</span><span class="kw">pub fn </span>with_capacity(capacity: usize) -&gt; HeaderMap&lt;T&gt; {
<span class="kw">if </span>capacity == <span class="number">0 </span>{
HeaderMap {
mask: <span class="number">0</span>,
indices: Box::new([]), <span class="comment">// as a ZST, this doesn&#39;t actually allocate anything
</span>entries: Vec::new(),
extra_values: Vec::new(),
danger: Danger::Green,
}
} <span class="kw">else </span>{
<span class="kw">let </span>raw_cap = to_raw_capacity(capacity).next_power_of_two();
<span class="macro">assert!</span>(raw_cap &lt;= MAX_SIZE, <span class="string">&quot;requested capacity too large&quot;</span>);
<span class="macro">debug_assert!</span>(raw_cap &gt; <span class="number">0</span>);
HeaderMap {
mask: (raw_cap - <span class="number">1</span>) <span class="kw">as </span>Size,
indices: <span class="macro">vec!</span>[Pos::none(); raw_cap].into_boxed_slice(),
entries: Vec::with_capacity(raw_cap),
extra_values: Vec::new(),
danger: Danger::Green,
}
}
}
<span class="doccomment">/// Returns the number of headers stored in the map.
///
/// This number represents the total number of **values** stored in the map.
/// This number can be greater than or equal to the number of **keys**
/// stored given that a single key may have more than one associated value.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{ACCEPT, HOST};
/// let mut map = HeaderMap::new();
///
/// assert_eq!(0, map.len());
///
/// map.insert(ACCEPT, &quot;text/plain&quot;.parse().unwrap());
/// map.insert(HOST, &quot;localhost&quot;.parse().unwrap());
///
/// assert_eq!(2, map.len());
///
/// map.append(ACCEPT, &quot;text/html&quot;.parse().unwrap());
///
/// assert_eq!(3, map.len());
/// ```
</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>.entries.len() + <span class="self">self</span>.extra_values.len()
}
<span class="doccomment">/// Returns the number of keys stored in the map.
///
/// This number will be less than or equal to `len()` as each key may have
/// more than one associated value.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{ACCEPT, HOST};
/// let mut map = HeaderMap::new();
///
/// assert_eq!(0, map.keys_len());
///
/// map.insert(ACCEPT, &quot;text/plain&quot;.parse().unwrap());
/// map.insert(HOST, &quot;localhost&quot;.parse().unwrap());
///
/// assert_eq!(2, map.keys_len());
///
/// map.insert(ACCEPT, &quot;text/html&quot;.parse().unwrap());
///
/// assert_eq!(2, map.keys_len());
/// ```
</span><span class="kw">pub fn </span>keys_len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.entries.len()
}
<span class="doccomment">/// Returns true if the map contains no elements.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
///
/// assert!(map.is_empty());
///
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
///
/// assert!(!map.is_empty());
/// ```
</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>.entries.len() == <span class="number">0
</span>}
<span class="doccomment">/// Clears the map, removing all key-value pairs. Keeps the allocated memory
/// for reuse.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
///
/// map.clear();
/// assert!(map.is_empty());
/// assert!(map.capacity() &gt; 0);
/// ```
</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>.entries.clear();
<span class="self">self</span>.extra_values.clear();
<span class="self">self</span>.danger = Danger::Green;
<span class="kw">for </span>e <span class="kw">in </span><span class="self">self</span>.indices.iter_mut() {
<span class="kw-2">*</span>e = Pos::none();
}
}
<span class="doccomment">/// Returns the number of headers the map can hold without reallocating.
///
/// This number is an approximation as certain usage patterns could cause
/// additional allocations before the returned capacity is filled.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
///
/// assert_eq!(0, map.capacity());
///
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
/// assert_eq!(6, map.capacity());
/// ```
</span><span class="kw">pub fn </span>capacity(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
usable_capacity(<span class="self">self</span>.indices.len())
}
<span class="doccomment">/// Reserves capacity for at least `additional` more headers to be inserted
/// into the `HeaderMap`.
///
/// The header map may reserve more space to avoid frequent reallocations.
/// Like with `with_capacity`, this will be a &quot;best effort&quot; to avoid
/// allocations until `additional` more headers are inserted. Certain usage
/// patterns could cause additional allocations before the number is
/// reached.
///
/// # Panics
///
/// Panics if the new allocation size overflows `usize`.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// map.reserve(10);
/// # map.insert(HOST, &quot;bar&quot;.parse().unwrap());
/// ```
</span><span class="kw">pub fn </span>reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) {
<span class="comment">// TODO: This can&#39;t overflow if done properly... since the max # of
// elements is u16::MAX.
</span><span class="kw">let </span>cap = <span class="self">self
</span>.entries
.len()
.checked_add(additional)
.expect(<span class="string">&quot;reserve overflow&quot;</span>);
<span class="kw">if </span>cap &gt; <span class="self">self</span>.indices.len() {
<span class="kw">let </span>cap = cap.next_power_of_two();
<span class="macro">assert!</span>(cap &lt;= MAX_SIZE, <span class="string">&quot;header map reserve over max capacity&quot;</span>);
<span class="macro">assert!</span>(cap != <span class="number">0</span>, <span class="string">&quot;header map reserve overflowed&quot;</span>);
<span class="kw">if </span><span class="self">self</span>.entries.len() == <span class="number">0 </span>{
<span class="self">self</span>.mask = cap <span class="kw">as </span>Size - <span class="number">1</span>;
<span class="self">self</span>.indices = <span class="macro">vec!</span>[Pos::none(); cap].into_boxed_slice();
<span class="self">self</span>.entries = Vec::with_capacity(usable_capacity(cap));
} <span class="kw">else </span>{
<span class="self">self</span>.grow(cap);
}
}
}
<span class="doccomment">/// Returns a reference to the value associated with the key.
///
/// If there are multiple values associated with the key, then the first one
/// is returned. Use `get_all` to get all values associated with a given
/// key. Returns `None` if there are no values associated with the key.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// assert!(map.get(&quot;host&quot;).is_none());
///
/// map.insert(HOST, &quot;hello&quot;.parse().unwrap());
/// assert_eq!(map.get(HOST).unwrap(), &amp;&quot;hello&quot;);
/// assert_eq!(map.get(&quot;host&quot;).unwrap(), &amp;&quot;hello&quot;);
///
/// map.append(HOST, &quot;world&quot;.parse().unwrap());
/// assert_eq!(map.get(&quot;host&quot;).unwrap(), &amp;&quot;hello&quot;);
/// ```
</span><span class="kw">pub fn </span>get&lt;K&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, key: K) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>T&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
<span class="self">self</span>.get2(<span class="kw-2">&amp;</span>key)
}
<span class="kw">fn </span>get2&lt;K&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>K) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>T&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
<span class="kw">match </span>key.find(<span class="self">self</span>) {
<span class="prelude-val">Some</span>((<span class="kw">_</span>, found)) =&gt; {
<span class="kw">let </span>entry = <span class="kw-2">&amp;</span><span class="self">self</span>.entries[found];
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>entry.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Returns a mutable reference to the value associated with the key.
///
/// If there are multiple values associated with the key, then the first one
/// is returned. Use `entry` to get all values associated with a given
/// key. Returns `None` if there are no values associated with the key.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::default();
/// map.insert(HOST, &quot;hello&quot;.to_string());
/// map.get_mut(&quot;host&quot;).unwrap().push_str(&quot;-world&quot;);
///
/// assert_eq!(map.get(HOST).unwrap(), &amp;&quot;hello-world&quot;);
/// ```
</span><span class="kw">pub fn </span>get_mut&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;mut </span>T&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
<span class="kw">match </span>key.find(<span class="self">self</span>) {
<span class="prelude-val">Some</span>((<span class="kw">_</span>, found)) =&gt; {
<span class="kw">let </span>entry = <span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[found];
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>entry.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Returns a view of all values associated with a key.
///
/// The returned view does not incur any allocations and allows iterating
/// the values associated with the key. See [`GetAll`] for more details.
/// Returns `None` if there are no values associated with the key.
///
/// [`GetAll`]: struct.GetAll.html
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
///
/// map.insert(HOST, &quot;hello&quot;.parse().unwrap());
/// map.append(HOST, &quot;goodbye&quot;.parse().unwrap());
///
/// let view = map.get_all(&quot;host&quot;);
///
/// let mut iter = view.iter();
/// assert_eq!(&amp;&quot;hello&quot;, iter.next().unwrap());
/// assert_eq!(&amp;&quot;goodbye&quot;, iter.next().unwrap());
/// assert!(iter.next().is_none());
/// ```
</span><span class="kw">pub fn </span>get_all&lt;K&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, key: K) -&gt; GetAll&lt;<span class="lifetime">&#39;_</span>, T&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
GetAll {
map: <span class="self">self</span>,
index: key.find(<span class="self">self</span>).map(|(<span class="kw">_</span>, i)| i),
}
}
<span class="doccomment">/// Returns true if the map contains a value for the specified key.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// assert!(!map.contains_key(HOST));
///
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
/// assert!(map.contains_key(&quot;host&quot;));
/// ```
</span><span class="kw">pub fn </span>contains_key&lt;K&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, key: K) -&gt; bool
<span class="kw">where
</span>K: AsHeaderName,
{
key.find(<span class="self">self</span>).is_some()
}
<span class="doccomment">/// An iterator visiting all key-value pairs.
///
/// The iteration order is arbitrary, but consistent across platforms for
/// the same crate version. Each key will be yielded once per associated
/// value. So, if a key has 3 associated values, it will be yielded 3 times.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST};
/// let mut map = HeaderMap::new();
///
/// map.insert(HOST, &quot;hello&quot;.parse().unwrap());
/// map.append(HOST, &quot;goodbye&quot;.parse().unwrap());
/// map.insert(CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
///
/// for (key, value) in map.iter() {
/// println!(&quot;{:?}: {:?}&quot;, key, value);
/// }
/// ```
</span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;_</span>, T&gt; {
Iter {
inner: IterMut {
map: <span class="self">self </span><span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_ as </span><span class="kw-2">*mut </span><span class="kw">_</span>,
entry: <span class="number">0</span>,
cursor: <span class="self">self</span>.entries.first().map(|<span class="kw">_</span>| Cursor::Head),
lt: PhantomData,
},
}
}
<span class="doccomment">/// An iterator visiting all key-value pairs, with mutable value references.
///
/// The iterator order is arbitrary, but consistent across platforms for the
/// same crate version. Each key will be yielded once per associated value,
/// so if a key has 3 associated values, it will be yielded 3 times.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST};
/// let mut map = HeaderMap::default();
///
/// map.insert(HOST, &quot;hello&quot;.to_string());
/// map.append(HOST, &quot;goodbye&quot;.to_string());
/// map.insert(CONTENT_LENGTH, &quot;123&quot;.to_string());
///
/// for (key, value) in map.iter_mut() {
/// value.push_str(&quot;-boop&quot;);
/// }
/// ```
</span><span class="kw">pub fn </span>iter_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; IterMut&lt;<span class="lifetime">&#39;_</span>, T&gt; {
IterMut {
map: <span class="self">self </span><span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>,
entry: <span class="number">0</span>,
cursor: <span class="self">self</span>.entries.first().map(|<span class="kw">_</span>| Cursor::Head),
lt: PhantomData,
}
}
<span class="doccomment">/// An iterator visiting all keys.
///
/// The iteration order is arbitrary, but consistent across platforms for
/// the same crate version. Each key will be yielded only once even if it
/// has multiple associated values.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST};
/// let mut map = HeaderMap::new();
///
/// map.insert(HOST, &quot;hello&quot;.parse().unwrap());
/// map.append(HOST, &quot;goodbye&quot;.parse().unwrap());
/// map.insert(CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
///
/// for key in map.keys() {
/// println!(&quot;{:?}&quot;, key);
/// }
/// ```
</span><span class="kw">pub fn </span>keys(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Keys&lt;<span class="lifetime">&#39;_</span>, T&gt; {
Keys {
inner: <span class="self">self</span>.entries.iter(),
}
}
<span class="doccomment">/// An iterator visiting all values.
///
/// The iteration order is arbitrary, but consistent across platforms for
/// the same crate version.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST};
/// let mut map = HeaderMap::new();
///
/// map.insert(HOST, &quot;hello&quot;.parse().unwrap());
/// map.append(HOST, &quot;goodbye&quot;.parse().unwrap());
/// map.insert(CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
///
/// for value in map.values() {
/// println!(&quot;{:?}&quot;, value);
/// }
/// ```
</span><span class="kw">pub fn </span>values(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Values&lt;<span class="lifetime">&#39;_</span>, T&gt; {
Values { inner: <span class="self">self</span>.iter() }
}
<span class="doccomment">/// An iterator visiting all values mutably.
///
/// The iteration order is arbitrary, but consistent across platforms for
/// the same crate version.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST};
/// let mut map = HeaderMap::default();
///
/// map.insert(HOST, &quot;hello&quot;.to_string());
/// map.append(HOST, &quot;goodbye&quot;.to_string());
/// map.insert(CONTENT_LENGTH, &quot;123&quot;.to_string());
///
/// for value in map.values_mut() {
/// value.push_str(&quot;-boop&quot;);
/// }
/// ```
</span><span class="kw">pub fn </span>values_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; ValuesMut&lt;<span class="lifetime">&#39;_</span>, T&gt; {
ValuesMut {
inner: <span class="self">self</span>.iter_mut(),
}
}
<span class="doccomment">/// Clears the map, returning all entries as an iterator.
///
/// The internal memory is kept for reuse.
///
/// For each yielded item that has `None` provided for the `HeaderName`,
/// then the associated header name is the same as that of the previously
/// yielded item. The first yielded item will have `HeaderName` set.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::{CONTENT_LENGTH, HOST};
/// let mut map = HeaderMap::new();
///
/// map.insert(HOST, &quot;hello&quot;.parse().unwrap());
/// map.append(HOST, &quot;goodbye&quot;.parse().unwrap());
/// map.insert(CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
///
/// let mut drain = map.drain();
///
///
/// assert_eq!(drain.next(), Some((Some(HOST), &quot;hello&quot;.parse().unwrap())));
/// assert_eq!(drain.next(), Some((None, &quot;goodbye&quot;.parse().unwrap())));
///
/// assert_eq!(drain.next(), Some((Some(CONTENT_LENGTH), &quot;123&quot;.parse().unwrap())));
///
/// assert_eq!(drain.next(), None);
/// ```
</span><span class="kw">pub fn </span>drain(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; Drain&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="kw">for </span>i <span class="kw">in </span><span class="self">self</span>.indices.iter_mut() {
<span class="kw-2">*</span>i = Pos::none();
}
<span class="comment">// Memory safety
//
// When the Drain is first created, it shortens the length of
// the source vector to make sure no uninitialized or moved-from
// elements are accessible at all if the Drain&#39;s destructor never
// gets to run.
</span><span class="kw">let </span>entries = <span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[..] <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>;
<span class="kw">let </span>extra_values = <span class="kw-2">&amp;mut </span><span class="self">self</span>.extra_values <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>;
<span class="kw">let </span>len = <span class="self">self</span>.entries.len();
<span class="kw">unsafe </span>{ <span class="self">self</span>.entries.set_len(<span class="number">0</span>); }
Drain {
idx: <span class="number">0</span>,
len,
entries,
extra_values,
next: <span class="prelude-val">None</span>,
lt: PhantomData,
}
}
<span class="kw">fn </span>value_iter(<span class="kw-2">&amp;</span><span class="self">self</span>, idx: <span class="prelude-ty">Option</span>&lt;usize&gt;) -&gt; ValueIter&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">if let </span><span class="prelude-val">Some</span>(idx) = idx {
<span class="kw">let </span>back = {
<span class="kw">let </span>entry = <span class="kw-2">&amp;</span><span class="self">self</span>.entries[idx];
entry.links.map(|l| Values(l.tail)).unwrap_or(Head)
};
ValueIter {
map: <span class="self">self</span>,
index: idx,
front: <span class="prelude-val">Some</span>(Head),
back: <span class="prelude-val">Some</span>(back),
}
} <span class="kw">else </span>{
ValueIter {
map: <span class="self">self</span>,
index: ::std::usize::MAX,
front: <span class="prelude-val">None</span>,
back: <span class="prelude-val">None</span>,
}
}
}
<span class="kw">fn </span>value_iter_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, idx: usize) -&gt; ValueIterMut&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">let </span>back = {
<span class="kw">let </span>entry = <span class="kw-2">&amp;</span><span class="self">self</span>.entries[idx];
entry.links.map(|l| Values(l.tail)).unwrap_or(Head)
};
ValueIterMut {
map: <span class="self">self </span><span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>,
index: idx,
front: <span class="prelude-val">Some</span>(Head),
back: <span class="prelude-val">Some</span>(back),
lt: PhantomData,
}
}
<span class="doccomment">/// Gets the given key&#39;s corresponding entry in the map for in-place
/// manipulation.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// let mut map: HeaderMap&lt;u32&gt; = HeaderMap::default();
///
/// let headers = &amp;[
/// &quot;content-length&quot;,
/// &quot;x-hello&quot;,
/// &quot;Content-Length&quot;,
/// &quot;x-world&quot;,
/// ];
///
/// for &amp;header in headers {
/// let counter = map.entry(header).or_insert(0);
/// *counter += 1;
/// }
///
/// assert_eq!(map[&quot;content-length&quot;], 2);
/// assert_eq!(map[&quot;x-hello&quot;], 1);
/// ```
</span><span class="kw">pub fn </span>entry&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;
<span class="kw">where
</span>K: IntoHeaderName,
{
key.entry(<span class="self">self</span>)
}
<span class="doccomment">/// Gets the given key&#39;s corresponding entry in the map for in-place
/// manipulation.
///
/// # Errors
///
/// This method differs from `entry` by allowing types that may not be
/// valid `HeaderName`s to passed as the key (such as `String`). If they
/// do not parse as a valid `HeaderName`, this returns an
/// `InvalidHeaderName` error.
</span><span class="kw">pub fn </span>try_entry&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
key.try_entry(<span class="self">self</span>)
}
<span class="kw">fn </span>entry2&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;
<span class="kw">where
</span>K: Hash + Into&lt;HeaderName&gt;,
HeaderName: PartialEq&lt;K&gt;,
{
<span class="comment">// Ensure that there is space in the map
</span><span class="self">self</span>.reserve_one();
<span class="macro">insert_phase_one!</span>(
<span class="self">self</span>,
key,
probe,
pos,
hash,
danger,
Entry::Vacant(VacantEntry {
map: <span class="self">self</span>,
hash: hash,
key: key.into(),
probe: probe,
danger: danger,
}),
Entry::Occupied(OccupiedEntry {
map: <span class="self">self</span>,
index: pos,
probe: probe,
}),
Entry::Vacant(VacantEntry {
map: <span class="self">self</span>,
hash: hash,
key: key.into(),
probe: probe,
danger: danger,
})
)
}
<span class="doccomment">/// Inserts a key-value pair into the map.
///
/// If the map did not previously have this key present, then `None` is
/// returned.
///
/// If the map did have this key present, the new value is associated with
/// the key and all previous values are removed. **Note** that only a single
/// one of the previous values is returned. If there are multiple values
/// that have been previously associated with the key, then the first one is
/// returned. See `insert_mult` on `OccupiedEntry` for an API that returns
/// all values.
///
/// The key is not updated, though; this matters for types that can be `==`
/// without being identical.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// assert!(map.insert(HOST, &quot;world&quot;.parse().unwrap()).is_none());
/// assert!(!map.is_empty());
///
/// let mut prev = map.insert(HOST, &quot;earth&quot;.parse().unwrap()).unwrap();
/// assert_eq!(&quot;world&quot;, prev);
/// ```
</span><span class="kw">pub fn </span>insert&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K, val: T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt;
<span class="kw">where
</span>K: IntoHeaderName,
{
key.insert(<span class="self">self</span>, val)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>insert2&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K, value: T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt;
<span class="kw">where
</span>K: Hash + Into&lt;HeaderName&gt;,
HeaderName: PartialEq&lt;K&gt;,
{
<span class="self">self</span>.reserve_one();
<span class="macro">insert_phase_one!</span>(
<span class="self">self</span>,
key,
probe,
pos,
hash,
danger,
<span class="comment">// Vacant
</span>{
drop(danger); <span class="comment">// Make lint happy
</span><span class="kw">let </span>index = <span class="self">self</span>.entries.len();
<span class="self">self</span>.insert_entry(hash, key.into(), value);
<span class="self">self</span>.indices[probe] = Pos::new(index, hash);
<span class="prelude-val">None
</span>},
<span class="comment">// Occupied
</span><span class="prelude-val">Some</span>(<span class="self">self</span>.insert_occupied(pos, value)),
<span class="comment">// Robinhood
</span>{
<span class="self">self</span>.insert_phase_two(key.into(), value, hash, probe, danger);
<span class="prelude-val">None
</span>}
)
}
<span class="doccomment">/// Set an occupied bucket to the given value
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>insert_occupied(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize, value: T) -&gt; T {
<span class="kw">if let </span><span class="prelude-val">Some</span>(links) = <span class="self">self</span>.entries[index].links {
<span class="self">self</span>.remove_all_extra_values(links.next);
}
<span class="kw">let </span>entry = <span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[index];
mem::replace(<span class="kw-2">&amp;mut </span>entry.value, value)
}
<span class="kw">fn </span>insert_occupied_mult(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize, value: T) -&gt; ValueDrain&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="kw">let </span>old;
<span class="kw">let </span>links;
{
<span class="kw">let </span>entry = <span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[index];
old = mem::replace(<span class="kw-2">&amp;mut </span>entry.value, value);
links = entry.links.take();
}
<span class="kw">let </span>raw_links = <span class="self">self</span>.raw_links();
<span class="kw">let </span>extra_values = <span class="kw-2">&amp;mut </span><span class="self">self</span>.extra_values;
<span class="kw">let </span>next = links.map(|l| {
drain_all_extra_values(raw_links, extra_values, l.next)
.into_iter()
});
ValueDrain {
first: <span class="prelude-val">Some</span>(old),
next: next,
lt: PhantomData,
}
}
<span class="doccomment">/// Inserts a key-value pair into the map.
///
/// If the map did not previously have this key present, then `false` is
/// returned.
///
/// If the map did have this key present, the new value is pushed to the end
/// of the list of values currently associated with the key. The key is not
/// updated, though; this matters for types that can be `==` without being
/// identical.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// assert!(map.insert(HOST, &quot;world&quot;.parse().unwrap()).is_none());
/// assert!(!map.is_empty());
///
/// map.append(HOST, &quot;earth&quot;.parse().unwrap());
///
/// let values = map.get_all(&quot;host&quot;);
/// let mut i = values.iter();
/// assert_eq!(&quot;world&quot;, *i.next().unwrap());
/// assert_eq!(&quot;earth&quot;, *i.next().unwrap());
/// ```
</span><span class="kw">pub fn </span>append&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K, value: T) -&gt; bool
<span class="kw">where
</span>K: IntoHeaderName,
{
key.append(<span class="self">self</span>, value)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>append2&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K, value: T) -&gt; bool
<span class="kw">where
</span>K: Hash + Into&lt;HeaderName&gt;,
HeaderName: PartialEq&lt;K&gt;,
{
<span class="self">self</span>.reserve_one();
<span class="macro">insert_phase_one!</span>(
<span class="self">self</span>,
key,
probe,
pos,
hash,
danger,
<span class="comment">// Vacant
</span>{
drop(danger);
<span class="kw">let </span>index = <span class="self">self</span>.entries.len();
<span class="self">self</span>.insert_entry(hash, key.into(), value);
<span class="self">self</span>.indices[probe] = Pos::new(index, hash);
<span class="bool-val">false
</span>},
<span class="comment">// Occupied
</span>{
append_value(pos, <span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[pos], <span class="kw-2">&amp;mut </span><span class="self">self</span>.extra_values, value);
<span class="bool-val">true
</span>},
<span class="comment">// Robinhood
</span>{
<span class="self">self</span>.insert_phase_two(key.into(), value, hash, probe, danger);
<span class="bool-val">false
</span>}
)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>find&lt;K: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>K) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt;
<span class="kw">where
</span>K: Hash + Into&lt;HeaderName&gt;,
HeaderName: PartialEq&lt;K&gt;,
{
<span class="kw">if </span><span class="self">self</span>.entries.is_empty() {
<span class="kw">return </span><span class="prelude-val">None</span>;
}
<span class="kw">let </span>hash = hash_elem_using(<span class="kw-2">&amp;</span><span class="self">self</span>.danger, key);
<span class="kw">let </span>mask = <span class="self">self</span>.mask;
<span class="kw">let </span><span class="kw-2">mut </span>probe = desired_pos(mask, hash);
<span class="kw">let </span><span class="kw-2">mut </span>dist = <span class="number">0</span>;
<span class="macro">probe_loop!</span>(probe &lt; <span class="self">self</span>.indices.len(), {
<span class="kw">if let </span><span class="prelude-val">Some</span>((i, entry_hash)) = <span class="self">self</span>.indices[probe].resolve() {
<span class="kw">if </span>dist &gt; probe_distance(mask, entry_hash, probe) {
<span class="comment">// give up when probe distance is too long
</span><span class="kw">return </span><span class="prelude-val">None</span>;
} <span class="kw">else if </span>entry_hash == hash &amp;&amp; <span class="self">self</span>.entries[i].key == <span class="kw-2">*</span>key {
<span class="kw">return </span><span class="prelude-val">Some</span>((probe, i));
}
} <span class="kw">else </span>{
<span class="kw">return </span><span class="prelude-val">None</span>;
}
dist += <span class="number">1</span>;
});
}
<span class="doccomment">/// phase 2 is post-insert where we forward-shift `Pos` in the indices.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>insert_phase_two(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
key: HeaderName,
value: T,
hash: HashValue,
probe: usize,
danger: bool,
) -&gt; usize {
<span class="comment">// Push the value and get the index
</span><span class="kw">let </span>index = <span class="self">self</span>.entries.len();
<span class="self">self</span>.insert_entry(hash, key, value);
<span class="kw">let </span>num_displaced = do_insert_phase_two(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, probe, Pos::new(index, hash));
<span class="kw">if </span>danger || num_displaced &gt;= DISPLACEMENT_THRESHOLD {
<span class="comment">// Increase danger level
</span><span class="self">self</span>.danger.to_yellow();
}
index
}
<span class="doccomment">/// Removes a key from the map, returning the value associated with the key.
///
/// Returns `None` if the map does not contain the key. If there are
/// multiple values associated with the key, then the first one is returned.
/// See `remove_entry_mult` on `OccupiedEntry` for an API that yields all
/// values.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
///
/// let prev = map.remove(HOST).unwrap();
/// assert_eq!(&quot;hello.world&quot;, prev);
///
/// assert!(map.remove(HOST).is_none());
/// ```
</span><span class="kw">pub fn </span>remove&lt;K&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
<span class="kw">match </span>key.find(<span class="self">self</span>) {
<span class="prelude-val">Some</span>((probe, idx)) =&gt; {
<span class="kw">if let </span><span class="prelude-val">Some</span>(links) = <span class="self">self</span>.entries[idx].links {
<span class="self">self</span>.remove_all_extra_values(links.next);
}
<span class="kw">let </span>entry = <span class="self">self</span>.remove_found(probe, idx);
<span class="prelude-val">Some</span>(entry.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Remove an entry from the map.
///
/// Warning: To avoid inconsistent state, extra values _must_ be removed
/// for the `found` index (via `remove_all_extra_values` or similar)
/// _before_ this method is called.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>remove_found(<span class="kw-2">&amp;mut </span><span class="self">self</span>, probe: usize, found: usize) -&gt; Bucket&lt;T&gt; {
<span class="comment">// index `probe` and entry `found` is to be removed
// use swap_remove, but then we need to update the index that points
// to the other entry that has to move
</span><span class="self">self</span>.indices[probe] = Pos::none();
<span class="kw">let </span>entry = <span class="self">self</span>.entries.swap_remove(found);
<span class="comment">// correct index that points to the entry that had to swap places
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(entry) = <span class="self">self</span>.entries.get(found) {
<span class="comment">// was not last element
// examine new element in `found` and find it in indices
</span><span class="kw">let </span><span class="kw-2">mut </span>probe = desired_pos(<span class="self">self</span>.mask, entry.hash);
<span class="macro">probe_loop!</span>(probe &lt; <span class="self">self</span>.indices.len(), {
<span class="kw">if let </span><span class="prelude-val">Some</span>((i, <span class="kw">_</span>)) = <span class="self">self</span>.indices[probe].resolve() {
<span class="kw">if </span>i &gt;= <span class="self">self</span>.entries.len() {
<span class="comment">// found it
</span><span class="self">self</span>.indices[probe] = Pos::new(found, entry.hash);
<span class="kw">break</span>;
}
}
});
<span class="comment">// Update links
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(links) = entry.links {
<span class="self">self</span>.extra_values[links.next].prev = Link::Entry(found);
<span class="self">self</span>.extra_values[links.tail].next = Link::Entry(found);
}
}
<span class="comment">// backward shift deletion in self.indices
// after probe, shift all non-ideally placed indices backward
</span><span class="kw">if </span><span class="self">self</span>.entries.len() &gt; <span class="number">0 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>last_probe = probe;
<span class="kw">let </span><span class="kw-2">mut </span>probe = probe + <span class="number">1</span>;
<span class="macro">probe_loop!</span>(probe &lt; <span class="self">self</span>.indices.len(), {
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, entry_hash)) = <span class="self">self</span>.indices[probe].resolve() {
<span class="kw">if </span>probe_distance(<span class="self">self</span>.mask, entry_hash, probe) &gt; <span class="number">0 </span>{
<span class="self">self</span>.indices[last_probe] = <span class="self">self</span>.indices[probe];
<span class="self">self</span>.indices[probe] = Pos::none();
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
last_probe = probe;
});
}
entry
}
<span class="doccomment">/// Removes the `ExtraValue` at the given index.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>remove_extra_value(<span class="kw-2">&amp;mut </span><span class="self">self</span>, idx: usize) -&gt; ExtraValue&lt;T&gt; {
<span class="kw">let </span>raw_links = <span class="self">self</span>.raw_links();
remove_extra_value(raw_links, <span class="kw-2">&amp;mut </span><span class="self">self</span>.extra_values, idx)
}
<span class="kw">fn </span>remove_all_extra_values(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>head: usize) {
<span class="kw">loop </span>{
<span class="kw">let </span>extra = <span class="self">self</span>.remove_extra_value(head);
<span class="kw">if let </span>Link::Extra(idx) = extra.next {
head = idx;
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>insert_entry(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: HashValue, key: HeaderName, value: T) {
<span class="macro">assert!</span>(<span class="self">self</span>.entries.len() &lt; MAX_SIZE, <span class="string">&quot;header map at capacity&quot;</span>);
<span class="self">self</span>.entries.push(Bucket {
hash: hash,
key: key,
value: value,
links: <span class="prelude-val">None</span>,
});
}
<span class="kw">fn </span>rebuild(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="comment">// Loop over all entries and re-insert them into the map
</span><span class="lifetime">&#39;outer</span>: <span class="kw">for </span>(index, entry) <span class="kw">in </span><span class="self">self</span>.entries.iter_mut().enumerate() {
<span class="kw">let </span>hash = hash_elem_using(<span class="kw-2">&amp;</span><span class="self">self</span>.danger, <span class="kw-2">&amp;</span>entry.key);
<span class="kw">let </span><span class="kw-2">mut </span>probe = desired_pos(<span class="self">self</span>.mask, hash);
<span class="kw">let </span><span class="kw-2">mut </span>dist = <span class="number">0</span>;
<span class="comment">// Update the entry&#39;s hash code
</span>entry.hash = hash;
<span class="macro">probe_loop!</span>(probe &lt; <span class="self">self</span>.indices.len(), {
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, entry_hash)) = <span class="self">self</span>.indices[probe].resolve() {
<span class="comment">// if existing element probed less than us, swap
</span><span class="kw">let </span>their_dist = probe_distance(<span class="self">self</span>.mask, entry_hash, probe);
<span class="kw">if </span>their_dist &lt; dist {
<span class="comment">// Robinhood
</span><span class="kw">break</span>;
}
} <span class="kw">else </span>{
<span class="comment">// Vacant slot
</span><span class="self">self</span>.indices[probe] = Pos::new(index, hash);
<span class="kw">continue </span><span class="lifetime">&#39;outer</span>;
}
dist += <span class="number">1</span>;
});
do_insert_phase_two(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, probe, Pos::new(index, hash));
}
}
<span class="kw">fn </span>reinsert_entry_in_order(<span class="kw-2">&amp;mut </span><span class="self">self</span>, pos: Pos) {
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, entry_hash)) = pos.resolve() {
<span class="comment">// Find first empty bucket and insert there
</span><span class="kw">let </span><span class="kw-2">mut </span>probe = desired_pos(<span class="self">self</span>.mask, entry_hash);
<span class="macro">probe_loop!</span>(probe &lt; <span class="self">self</span>.indices.len(), {
<span class="kw">if </span><span class="self">self</span>.indices[probe].resolve().is_none() {
<span class="comment">// empty bucket, insert here
</span><span class="self">self</span>.indices[probe] = pos;
<span class="kw">return</span>;
}
});
}
}
<span class="kw">fn </span>reserve_one(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">let </span>len = <span class="self">self</span>.entries.len();
<span class="kw">if </span><span class="self">self</span>.danger.is_yellow() {
<span class="kw">let </span>load_factor = <span class="self">self</span>.entries.len() <span class="kw">as </span>f32 / <span class="self">self</span>.indices.len() <span class="kw">as </span>f32;
<span class="kw">if </span>load_factor &gt;= LOAD_FACTOR_THRESHOLD {
<span class="comment">// Transition back to green danger level
</span><span class="self">self</span>.danger.to_green();
<span class="comment">// Double the capacity
</span><span class="kw">let </span>new_cap = <span class="self">self</span>.indices.len() * <span class="number">2</span>;
<span class="comment">// Grow the capacity
</span><span class="self">self</span>.grow(new_cap);
} <span class="kw">else </span>{
<span class="self">self</span>.danger.to_red();
<span class="comment">// Rebuild hash table
</span><span class="kw">for </span>index <span class="kw">in </span><span class="self">self</span>.indices.iter_mut() {
<span class="kw-2">*</span>index = Pos::none();
}
<span class="self">self</span>.rebuild();
}
} <span class="kw">else if </span>len == <span class="self">self</span>.capacity() {
<span class="kw">if </span>len == <span class="number">0 </span>{
<span class="kw">let </span>new_raw_cap = <span class="number">8</span>;
<span class="self">self</span>.mask = <span class="number">8 </span>- <span class="number">1</span>;
<span class="self">self</span>.indices = <span class="macro">vec!</span>[Pos::none(); new_raw_cap].into_boxed_slice();
<span class="self">self</span>.entries = Vec::with_capacity(usable_capacity(new_raw_cap));
} <span class="kw">else </span>{
<span class="kw">let </span>raw_cap = <span class="self">self</span>.indices.len();
<span class="self">self</span>.grow(raw_cap &lt;&lt; <span class="number">1</span>);
}
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>, new_raw_cap: usize) {
<span class="macro">assert!</span>(new_raw_cap &lt;= MAX_SIZE, <span class="string">&quot;requested capacity too large&quot;</span>);
<span class="comment">// This path can never be reached when handling the first allocation in
// the map.
// find first ideally placed element -- start of cluster
</span><span class="kw">let </span><span class="kw-2">mut </span>first_ideal = <span class="number">0</span>;
<span class="kw">for </span>(i, pos) <span class="kw">in </span><span class="self">self</span>.indices.iter().enumerate() {
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, entry_hash)) = pos.resolve() {
<span class="kw">if </span><span class="number">0 </span>== probe_distance(<span class="self">self</span>.mask, entry_hash, i) {
first_ideal = i;
<span class="kw">break</span>;
}
}
}
<span class="comment">// visit the entries in an order where we can simply reinsert them
// into self.indices without any bucket stealing.
</span><span class="kw">let </span>old_indices = mem::replace(
<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices,
<span class="macro">vec!</span>[Pos::none(); new_raw_cap].into_boxed_slice(),
);
<span class="self">self</span>.mask = new_raw_cap.wrapping_sub(<span class="number">1</span>) <span class="kw">as </span>Size;
<span class="kw">for </span><span class="kw-2">&amp;</span>pos <span class="kw">in </span><span class="kw-2">&amp;</span>old_indices[first_ideal..] {
<span class="self">self</span>.reinsert_entry_in_order(pos);
}
<span class="kw">for </span><span class="kw-2">&amp;</span>pos <span class="kw">in </span><span class="kw-2">&amp;</span>old_indices[..first_ideal] {
<span class="self">self</span>.reinsert_entry_in_order(pos);
}
<span class="comment">// Reserve additional entry slots
</span><span class="kw">let </span>more = <span class="self">self</span>.capacity() - <span class="self">self</span>.entries.len();
<span class="self">self</span>.entries.reserve_exact(more);
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>raw_links(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; RawLinks&lt;T&gt; {
RawLinks(<span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[..] <span class="kw">as </span><span class="kw-2">*mut </span><span class="kw">_</span>)
}
}
<span class="doccomment">/// Removes the `ExtraValue` at the given index.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>remove_extra_value&lt;T&gt;(
<span class="kw-2">mut </span>raw_links: RawLinks&lt;T&gt;,
extra_values: <span class="kw-2">&amp;mut </span>Vec&lt;ExtraValue&lt;T&gt;&gt;,
idx: usize)
-&gt; ExtraValue&lt;T&gt;
{
<span class="kw">let </span>prev;
<span class="kw">let </span>next;
{
<span class="macro">debug_assert!</span>(extra_values.len() &gt; idx);
<span class="kw">let </span>extra = <span class="kw-2">&amp;</span>extra_values[idx];
prev = extra.prev;
next = extra.next;
}
<span class="comment">// First unlink the extra value
</span><span class="kw">match </span>(prev, next) {
(Link::Entry(prev), Link::Entry(next)) =&gt; {
<span class="macro">debug_assert_eq!</span>(prev, next);
raw_links[prev] = <span class="prelude-val">None</span>;
}
(Link::Entry(prev), Link::Extra(next)) =&gt; {
<span class="macro">debug_assert!</span>(raw_links[prev].is_some());
raw_links[prev].as_mut().unwrap()
.next = next;
<span class="macro">debug_assert!</span>(extra_values.len() &gt; next);
extra_values[next].prev = Link::Entry(prev);
}
(Link::Extra(prev), Link::Entry(next)) =&gt; {
<span class="macro">debug_assert!</span>(raw_links[next].is_some());
raw_links[next].as_mut().unwrap()
.tail = prev;
<span class="macro">debug_assert!</span>(extra_values.len() &gt; prev);
extra_values[prev].next = Link::Entry(next);
}
(Link::Extra(prev), Link::Extra(next)) =&gt; {
<span class="macro">debug_assert!</span>(extra_values.len() &gt; next);
<span class="macro">debug_assert!</span>(extra_values.len() &gt; prev);
extra_values[prev].next = Link::Extra(next);
extra_values[next].prev = Link::Extra(prev);
}
}
<span class="comment">// Remove the extra value
</span><span class="kw">let </span><span class="kw-2">mut </span>extra = extra_values.swap_remove(idx);
<span class="comment">// This is the index of the value that was moved (possibly `extra`)
</span><span class="kw">let </span>old_idx = extra_values.len();
<span class="comment">// Update the links
</span><span class="kw">if </span>extra.prev == Link::Extra(old_idx) {
extra.prev = Link::Extra(idx);
}
<span class="kw">if </span>extra.next == Link::Extra(old_idx) {
extra.next = Link::Extra(idx);
}
<span class="comment">// Check if another entry was displaced. If it was, then the links
// need to be fixed.
</span><span class="kw">if </span>idx != old_idx {
<span class="kw">let </span>next;
<span class="kw">let </span>prev;
{
<span class="macro">debug_assert!</span>(extra_values.len() &gt; idx);
<span class="kw">let </span>moved = <span class="kw-2">&amp;</span>extra_values[idx];
next = moved.next;
prev = moved.prev;
}
<span class="comment">// An entry was moved, we have to the links
</span><span class="kw">match </span>prev {
Link::Entry(entry_idx) =&gt; {
<span class="comment">// It is critical that we do not attempt to read the
// header name or value as that memory may have been
// &quot;released&quot; already.
</span><span class="macro">debug_assert!</span>(raw_links[entry_idx].is_some());
<span class="kw">let </span>links = raw_links[entry_idx].as_mut().unwrap();
links.next = idx;
}
Link::Extra(extra_idx) =&gt; {
<span class="macro">debug_assert!</span>(extra_values.len() &gt; extra_idx);
extra_values[extra_idx].next = Link::Extra(idx);
}
}
<span class="kw">match </span>next {
Link::Entry(entry_idx) =&gt; {
<span class="macro">debug_assert!</span>(raw_links[entry_idx].is_some());
<span class="kw">let </span>links = raw_links[entry_idx].as_mut().unwrap();
links.tail = idx;
}
Link::Extra(extra_idx) =&gt; {
<span class="macro">debug_assert!</span>(extra_values.len() &gt; extra_idx);
extra_values[extra_idx].prev = Link::Extra(idx);
}
}
}
<span class="macro">debug_assert!</span>({
<span class="kw">for </span>v <span class="kw">in </span><span class="kw-2">&amp;*</span>extra_values {
<span class="macro">assert!</span>(v.next != Link::Extra(old_idx));
<span class="macro">assert!</span>(v.prev != Link::Extra(old_idx));
}
<span class="bool-val">true
</span>});
extra
}
<span class="kw">fn </span>drain_all_extra_values&lt;T&gt;(
raw_links: RawLinks&lt;T&gt;,
extra_values: <span class="kw-2">&amp;mut </span>Vec&lt;ExtraValue&lt;T&gt;&gt;,
<span class="kw-2">mut </span>head: usize)
-&gt; Vec&lt;T&gt;
{
<span class="kw">let </span><span class="kw-2">mut </span>vec = Vec::new();
<span class="kw">loop </span>{
<span class="kw">let </span>extra = remove_extra_value(raw_links, extra_values, head);
vec.push(extra.value);
<span class="kw">if let </span>Link::Extra(idx) = extra.next {
head = idx;
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
vec
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderMap&lt;T&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T);
<span class="kw">type </span>IntoIter = Iter&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.iter()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HeaderMap&lt;T&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T);
<span class="kw">type </span>IntoIter = IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.iter_mut()
}
}
<span class="kw">impl</span>&lt;T&gt; IntoIterator <span class="kw">for </span>HeaderMap&lt;T&gt; {
<span class="kw">type </span>Item = (<span class="prelude-ty">Option</span>&lt;HeaderName&gt;, T);
<span class="kw">type </span>IntoIter = IntoIter&lt;T&gt;;
<span class="doccomment">/// Creates a consuming iterator, that is, one that moves keys and values
/// out of the map in arbitrary order. The map cannot be used after calling
/// this.
///
/// For each yielded item that has `None` provided for the `HeaderName`,
/// then the associated header name is the same as that of the previously
/// yielded item. The first yielded item will have `HeaderName` set.
///
/// # Examples
///
/// Basic usage.
///
/// ```
/// # use http::header;
/// # use http::header::*;
/// let mut map = HeaderMap::new();
/// map.insert(header::CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
/// map.insert(header::CONTENT_TYPE, &quot;json&quot;.parse().unwrap());
///
/// let mut iter = map.into_iter();
/// assert_eq!(iter.next(), Some((Some(header::CONTENT_LENGTH), &quot;123&quot;.parse().unwrap())));
/// assert_eq!(iter.next(), Some((Some(header::CONTENT_TYPE), &quot;json&quot;.parse().unwrap())));
/// assert!(iter.next().is_none());
/// ```
///
/// Multiple values per key.
///
/// ```
/// # use http::header;
/// # use http::header::*;
/// let mut map = HeaderMap::new();
///
/// map.append(header::CONTENT_LENGTH, &quot;123&quot;.parse().unwrap());
/// map.append(header::CONTENT_LENGTH, &quot;456&quot;.parse().unwrap());
///
/// map.append(header::CONTENT_TYPE, &quot;json&quot;.parse().unwrap());
/// map.append(header::CONTENT_TYPE, &quot;html&quot;.parse().unwrap());
/// map.append(header::CONTENT_TYPE, &quot;xml&quot;.parse().unwrap());
///
/// let mut iter = map.into_iter();
///
/// assert_eq!(iter.next(), Some((Some(header::CONTENT_LENGTH), &quot;123&quot;.parse().unwrap())));
/// assert_eq!(iter.next(), Some((None, &quot;456&quot;.parse().unwrap())));
///
/// assert_eq!(iter.next(), Some((Some(header::CONTENT_TYPE), &quot;json&quot;.parse().unwrap())));
/// assert_eq!(iter.next(), Some((None, &quot;html&quot;.parse().unwrap())));
/// assert_eq!(iter.next(), Some((None, &quot;xml&quot;.parse().unwrap())));
/// assert!(iter.next().is_none());
/// ```
</span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; IntoIter&lt;T&gt; {
IntoIter {
next: <span class="prelude-val">None</span>,
entries: <span class="self">self</span>.entries.into_iter(),
extra_values: <span class="self">self</span>.extra_values,
}
}
}
<span class="kw">impl</span>&lt;T&gt; FromIterator&lt;(HeaderName, T)&gt; <span class="kw">for </span>HeaderMap&lt;T&gt; {
<span class="kw">fn </span>from_iter&lt;I&gt;(iter: I) -&gt; <span class="self">Self
</span><span class="kw">where
</span>I: IntoIterator&lt;Item = (HeaderName, T)&gt;,
{
<span class="kw">let </span><span class="kw-2">mut </span>map = HeaderMap::default();
map.extend(iter);
map
}
}
<span class="doccomment">/// Try to convert a `HashMap` into a `HeaderMap`.
///
/// # Examples
///
/// ```
/// use std::collections::HashMap;
/// use std::convert::TryInto;
/// use http::HeaderMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;X-Custom-Header&quot;.to_string(), &quot;my value&quot;.to_string());
///
/// let headers: HeaderMap = (&amp;map).try_into().expect(&quot;valid headers&quot;);
/// assert_eq!(headers[&quot;X-Custom-Header&quot;], &quot;my value&quot;);
/// ```
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, T&gt; TryFrom&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HashMap&lt;K, V&gt;&gt; <span class="kw">for </span>HeaderMap&lt;T&gt;
<span class="kw">where
</span>K: Eq + Hash,
HeaderName: TryFrom&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K&gt;,
&lt;HeaderName <span class="kw">as </span>TryFrom&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K&gt;&gt;::Error: Into&lt;<span class="kw">crate</span>::Error&gt;,
T: TryFrom&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V&gt;,
T::Error: Into&lt;<span class="kw">crate</span>::Error&gt;,
{
<span class="kw">type </span>Error = Error;
<span class="kw">fn </span>try_from(c: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HashMap&lt;K, V&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, <span class="self">Self</span>::Error&gt; {
c.into_iter()
.map(|(k, v)| -&gt; <span class="kw">crate</span>::Result&lt;(HeaderName, T)&gt; {
<span class="kw">let </span>name = TryFrom::try_from(k).map_err(Into::into)<span class="question-mark">?</span>;
<span class="kw">let </span>value = TryFrom::try_from(v).map_err(Into::into)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>((name, value))
})
.collect()
}
}
<span class="kw">impl</span>&lt;T&gt; Extend&lt;(<span class="prelude-ty">Option</span>&lt;HeaderName&gt;, T)&gt; <span class="kw">for </span>HeaderMap&lt;T&gt; {
<span class="doccomment">/// Extend a `HeaderMap` with the contents of another `HeaderMap`.
///
/// This function expects the yielded items to follow the same structure as
/// `IntoIter`.
///
/// # Panics
///
/// This panics if the first yielded item does not have a `HeaderName`.
///
/// # Examples
///
/// ```
/// # use http::header::*;
/// let mut map = HeaderMap::new();
///
/// map.insert(ACCEPT, &quot;text/plain&quot;.parse().unwrap());
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
///
/// let mut extra = HeaderMap::new();
///
/// extra.insert(HOST, &quot;foo.bar&quot;.parse().unwrap());
/// extra.insert(COOKIE, &quot;hello&quot;.parse().unwrap());
/// extra.append(COOKIE, &quot;world&quot;.parse().unwrap());
///
/// map.extend(extra);
///
/// assert_eq!(map[&quot;host&quot;], &quot;foo.bar&quot;);
/// assert_eq!(map[&quot;accept&quot;], &quot;text/plain&quot;);
/// assert_eq!(map[&quot;cookie&quot;], &quot;hello&quot;);
///
/// let v = map.get_all(&quot;host&quot;);
/// assert_eq!(1, v.iter().count());
///
/// let v = map.get_all(&quot;cookie&quot;);
/// assert_eq!(2, v.iter().count());
/// ```
</span><span class="kw">fn </span>extend&lt;I: IntoIterator&lt;Item = (<span class="prelude-ty">Option</span>&lt;HeaderName&gt;, T)&gt;&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: I) {
<span class="kw">let </span><span class="kw-2">mut </span>iter = iter.into_iter();
<span class="comment">// The structure of this is a bit weird, but it is mostly to make the
// borrow checker happy.
</span><span class="kw">let </span>(<span class="kw-2">mut </span>key, <span class="kw-2">mut </span>val) = <span class="kw">match </span>iter.next() {
<span class="prelude-val">Some</span>((<span class="prelude-val">Some</span>(key), val)) =&gt; (key, val),
<span class="prelude-val">Some</span>((<span class="prelude-val">None</span>, <span class="kw">_</span>)) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;expected a header name, but got None&quot;</span>),
<span class="prelude-val">None </span>=&gt; <span class="kw">return</span>,
};
<span class="lifetime">&#39;outer</span>: <span class="kw">loop </span>{
<span class="kw">let </span><span class="kw-2">mut </span>entry = <span class="kw">match </span><span class="self">self</span>.entry2(key) {
Entry::Occupied(<span class="kw-2">mut </span>e) =&gt; {
<span class="comment">// Replace all previous values while maintaining a handle to
// the entry.
</span>e.insert(val);
e
}
Entry::Vacant(e) =&gt; e.insert_entry(val),
};
<span class="comment">// As long as `HeaderName` is none, keep inserting the value into
// the current entry
</span><span class="kw">loop </span>{
<span class="kw">match </span>iter.next() {
<span class="prelude-val">Some</span>((<span class="prelude-val">Some</span>(k), v)) =&gt; {
key = k;
val = v;
<span class="kw">continue </span><span class="lifetime">&#39;outer</span>;
}
<span class="prelude-val">Some</span>((<span class="prelude-val">None</span>, v)) =&gt; {
entry.append(v);
}
<span class="prelude-val">None </span>=&gt; {
<span class="kw">return</span>;
}
}
}
}
}
}
<span class="kw">impl</span>&lt;T&gt; Extend&lt;(HeaderName, T)&gt; <span class="kw">for </span>HeaderMap&lt;T&gt; {
<span class="kw">fn </span>extend&lt;I: IntoIterator&lt;Item = (HeaderName, T)&gt;&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: I) {
<span class="comment">// Keys may be already present or show multiple times in the iterator.
// Reserve the entire hint lower bound if the map is empty.
// Otherwise reserve half the hint (rounded up), so the map
// will only resize twice in the worst case.
</span><span class="kw">let </span>iter = iter.into_iter();
<span class="kw">let </span>reserve = <span class="kw">if </span><span class="self">self</span>.is_empty() {
iter.size_hint().<span class="number">0
</span>} <span class="kw">else </span>{
(iter.size_hint().<span class="number">0 </span>+ <span class="number">1</span>) / <span class="number">2
</span>};
<span class="self">self</span>.reserve(reserve);
<span class="kw">for </span>(k, v) <span class="kw">in </span>iter {
<span class="self">self</span>.append(k, v);
}
}
}
<span class="kw">impl</span>&lt;T: PartialEq&gt; PartialEq <span class="kw">for </span>HeaderMap&lt;T&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>HeaderMap&lt;T&gt;) -&gt; bool {
<span class="kw">if </span><span class="self">self</span>.len() != other.len() {
<span class="kw">return </span><span class="bool-val">false</span>;
}
<span class="self">self</span>.keys()
.all(|key| <span class="self">self</span>.get_all(key) == other.get_all(key))
}
}
<span class="kw">impl</span>&lt;T: Eq&gt; Eq <span class="kw">for </span>HeaderMap&lt;T&gt; {}
<span class="kw">impl</span>&lt;T: fmt::Debug&gt; fmt::Debug <span class="kw">for </span>HeaderMap&lt;T&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_map().entries(<span class="self">self</span>.iter()).finish()
}
}
<span class="kw">impl</span>&lt;T&gt; Default <span class="kw">for </span>HeaderMap&lt;T&gt; {
<span class="kw">fn </span>default() -&gt; <span class="self">Self </span>{
HeaderMap::with_capacity(<span class="number">0</span>)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, T&gt; ops::Index&lt;K&gt; <span class="kw">for </span>HeaderMap&lt;T&gt;
<span class="kw">where
</span>K: AsHeaderName,
{
<span class="kw">type </span>Output = T;
<span class="doccomment">/// # Panics
/// Using the index operator will cause a panic if the header you&#39;re querying isn&#39;t set.
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>index(<span class="kw-2">&amp;</span><span class="self">self</span>, index: K) -&gt; <span class="kw-2">&amp;</span>T {
<span class="kw">match </span><span class="self">self</span>.get2(<span class="kw-2">&amp;</span>index) {
<span class="prelude-val">Some</span>(val) =&gt; val,
<span class="prelude-val">None </span>=&gt; <span class="macro">panic!</span>(<span class="string">&quot;no entry found for key {:?}&quot;</span>, index.as_str()),
}
}
}
<span class="doccomment">/// phase 2 is post-insert where we forward-shift `Pos` in the indices.
///
/// returns the number of displaced elements
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>do_insert_phase_two(indices: <span class="kw-2">&amp;mut </span>[Pos], <span class="kw-2">mut </span>probe: usize, <span class="kw-2">mut </span>old_pos: Pos) -&gt; usize {
<span class="kw">let </span><span class="kw-2">mut </span>num_displaced = <span class="number">0</span>;
<span class="macro">probe_loop!</span>(probe &lt; indices.len(), {
<span class="kw">let </span>pos = <span class="kw-2">&amp;mut </span>indices[probe];
<span class="kw">if </span>pos.is_none() {
<span class="kw-2">*</span>pos = old_pos;
<span class="kw">break</span>;
} <span class="kw">else </span>{
num_displaced += <span class="number">1</span>;
old_pos = mem::replace(pos, old_pos);
}
});
num_displaced
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>append_value&lt;T&gt;(
entry_idx: usize,
entry: <span class="kw-2">&amp;mut </span>Bucket&lt;T&gt;,
extra: <span class="kw-2">&amp;mut </span>Vec&lt;ExtraValue&lt;T&gt;&gt;,
value: T,
) {
<span class="kw">match </span>entry.links {
<span class="prelude-val">Some</span>(links) =&gt; {
<span class="kw">let </span>idx = extra.len();
extra.push(ExtraValue {
value: value,
prev: Link::Extra(links.tail),
next: Link::Entry(entry_idx),
});
extra[links.tail].next = Link::Extra(idx);
entry.links = <span class="prelude-val">Some</span>(Links { tail: idx, ..links });
}
<span class="prelude-val">None </span>=&gt; {
<span class="kw">let </span>idx = extra.len();
extra.push(ExtraValue {
value: value,
prev: Link::Entry(entry_idx),
next: Link::Entry(entry_idx),
});
entry.links = <span class="prelude-val">Some</span>(Links {
next: idx,
tail: idx,
});
}
}
}
<span class="comment">// ===== impl Iter =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T);
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="self">self</span>.inner
.next_unsafe()
.map(|(key, ptr)| (key, <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span>ptr }))
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Sync&gt; Sync <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Sync&gt; Send <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl IterMut =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">fn </span>next_unsafe(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName, <span class="kw-2">*mut </span>T)&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">if </span><span class="self">self</span>.cursor.is_none() {
<span class="kw">if </span>(<span class="self">self</span>.entry + <span class="number">1</span>) &gt;= <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span><span class="self">self</span>.map }.entries.len() {
<span class="kw">return </span><span class="prelude-val">None</span>;
}
<span class="self">self</span>.entry += <span class="number">1</span>;
<span class="self">self</span>.cursor = <span class="prelude-val">Some</span>(Cursor::Head);
}
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.map).entries[<span class="self">self</span>.entry] };
<span class="kw">match </span><span class="self">self</span>.cursor.unwrap() {
Head =&gt; {
<span class="self">self</span>.cursor = entry.links.map(|l| Values(l.next));
<span class="prelude-val">Some</span>((<span class="kw-2">&amp;</span>entry.key, <span class="kw-2">&amp;</span>entry.value <span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_ as </span><span class="kw-2">*mut </span><span class="kw">_</span>))
}
Values(idx) =&gt; {
<span class="kw">let </span>extra = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.map).extra_values[idx] };
<span class="kw">match </span>extra.next {
Link::Entry(<span class="kw">_</span>) =&gt; <span class="self">self</span>.cursor = <span class="prelude-val">None</span>,
Link::Extra(i) =&gt; <span class="self">self</span>.cursor = <span class="prelude-val">Some</span>(Values(i)),
}
<span class="prelude-val">Some</span>((<span class="kw-2">&amp;</span>entry.key, <span class="kw-2">&amp;</span>extra.value <span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_ as </span><span class="kw-2">*mut </span><span class="kw">_</span>))
}
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T);
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="self">self</span>.next_unsafe()
.map(|(key, ptr)| (key, <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut *</span>ptr }))
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="kw">let </span>map = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;*</span><span class="self">self</span>.map };
<span class="macro">debug_assert!</span>(map.entries.len() &gt;= <span class="self">self</span>.entry);
<span class="kw">let </span>lower = map.entries.len() - <span class="self">self</span>.entry;
<span class="comment">// We could pessimistically guess at the upper bound, saying
// that its lower + map.extra_values.len(). That could be
// way over though, such as if we&#39;re near the end, and have
// already gone through several extra values...
</span>(lower, <span class="prelude-val">None</span>)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Sync&gt; Sync <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Send&gt; Send <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl Keys =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="self">self</span>.inner.next().map(|b| <span class="kw-2">&amp;</span>b.key)
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; ExactSizeIterator <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl Values ====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="self">self</span>.inner.next().map(|(<span class="kw">_</span>, v)| v)
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl ValuesMut ====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>ValuesMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="self">self</span>.inner.next().map(|(<span class="kw">_</span>, v)| v)
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>ValuesMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl Drain =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = (<span class="prelude-ty">Option</span>&lt;HeaderName&gt;, T);
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="kw">if let </span><span class="prelude-val">Some</span>(next) = <span class="self">self</span>.next {
<span class="comment">// Remove the extra value
</span><span class="kw">let </span>raw_links = RawLinks(<span class="self">self</span>.entries);
<span class="kw">let </span>extra = <span class="kw">unsafe </span>{
remove_extra_value(raw_links, <span class="kw-2">&amp;mut *</span><span class="self">self</span>.extra_values, next)
};
<span class="kw">match </span>extra.next {
Link::Extra(idx) =&gt; <span class="self">self</span>.next = <span class="prelude-val">Some</span>(idx),
Link::Entry(<span class="kw">_</span>) =&gt; <span class="self">self</span>.next = <span class="prelude-val">None</span>,
}
<span class="kw">return </span><span class="prelude-val">Some</span>((<span class="prelude-val">None</span>, extra.value));
}
<span class="kw">let </span>idx = <span class="self">self</span>.idx;
<span class="kw">if </span>idx == <span class="self">self</span>.len {
<span class="kw">return </span><span class="prelude-val">None</span>;
}
<span class="self">self</span>.idx += <span class="number">1</span>;
<span class="kw">unsafe </span>{
<span class="kw">let </span>entry = <span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.entries)[idx];
<span class="comment">// Read the header name
</span><span class="kw">let </span>key = ptr::read(<span class="kw-2">&amp;</span>entry.key <span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_</span>);
<span class="kw">let </span>value = ptr::read(<span class="kw-2">&amp;</span>entry.value <span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_</span>);
<span class="self">self</span>.next = entry.links.map(|l| l.next);
<span class="prelude-val">Some</span>((<span class="prelude-val">Some</span>(key), value))
}
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="comment">// At least this many names... It&#39;s unknown if the user wants
// to count the extra_values on top.
//
// For instance, extending a new `HeaderMap` wouldn&#39;t need to
// reserve the upper-bound in `entries`, only the lower-bound.
</span><span class="kw">let </span>lower = <span class="self">self</span>.len - <span class="self">self</span>.idx;
<span class="kw">let </span>upper = <span class="kw">unsafe </span>{ (<span class="kw-2">*</span><span class="self">self</span>.extra_values).len() } + lower;
(lower, <span class="prelude-val">Some</span>(upper))
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Drop <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">for _ in </span><span class="self">self </span>{}
}
}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Sync&gt; Sync <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Send&gt; Send <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl Entry =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Entry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="doccomment">/// Ensures a value is in the entry by inserting the default if empty.
///
/// Returns a mutable reference to the **first** value in the entry.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// let mut map: HeaderMap&lt;u32&gt; = HeaderMap::default();
///
/// let headers = &amp;[
/// &quot;content-length&quot;,
/// &quot;x-hello&quot;,
/// &quot;Content-Length&quot;,
/// &quot;x-world&quot;,
/// ];
///
/// for &amp;header in headers {
/// let counter = map.entry(header)
/// .or_insert(0);
/// *counter += 1;
/// }
///
/// assert_eq!(map[&quot;content-length&quot;], 2);
/// assert_eq!(map[&quot;x-hello&quot;], 1);
/// ```
</span><span class="kw">pub fn </span>or_insert(<span class="self">self</span>, default: T) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T {
<span class="kw">use </span><span class="self">self</span>::Entry::<span class="kw-2">*</span>;
<span class="kw">match </span><span class="self">self </span>{
Occupied(e) =&gt; e.into_mut(),
Vacant(e) =&gt; e.insert(default),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the result of the default
/// function if empty.
///
/// The default function is not called if the entry exists in the map.
/// Returns a mutable reference to the **first** value in the entry.
///
/// # Examples
///
/// Basic usage.
///
/// ```
/// # use http::HeaderMap;
/// let mut map = HeaderMap::new();
///
/// let res = map.entry(&quot;x-hello&quot;)
/// .or_insert_with(|| &quot;world&quot;.parse().unwrap());
///
/// assert_eq!(res, &quot;world&quot;);
/// ```
///
/// The default function is not called if the entry exists in the map.
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
///
/// let res = map.entry(&quot;host&quot;)
/// .or_insert_with(|| unreachable!());
///
///
/// assert_eq!(res, &quot;world&quot;);
/// ```
</span><span class="kw">pub fn </span>or_insert_with&lt;F: FnOnce() -&gt; T&gt;(<span class="self">self</span>, default: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T {
<span class="kw">use </span><span class="self">self</span>::Entry::<span class="kw-2">*</span>;
<span class="kw">match </span><span class="self">self </span>{
Occupied(e) =&gt; e.into_mut(),
Vacant(e) =&gt; e.insert(default()),
}
}
<span class="doccomment">/// Returns a reference to the entry&#39;s key
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// let mut map = HeaderMap::new();
///
/// assert_eq!(map.entry(&quot;x-hello&quot;).key(), &quot;x-hello&quot;);
/// ```
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>HeaderName {
<span class="kw">use </span><span class="self">self</span>::Entry::<span class="kw-2">*</span>;
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Vacant(<span class="kw-2">ref </span>e) =&gt; e.key(),
Occupied(<span class="kw-2">ref </span>e) =&gt; e.key(),
}
}
}
<span class="comment">// ===== impl VacantEntry =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; VacantEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="doccomment">/// Returns a reference to the entry&#39;s key
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// let mut map = HeaderMap::new();
///
/// assert_eq!(map.entry(&quot;x-hello&quot;).key().as_str(), &quot;x-hello&quot;);
/// ```
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>HeaderName {
<span class="kw-2">&amp;</span><span class="self">self</span>.key
}
<span class="doccomment">/// Take ownership of the key
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry};
/// let mut map = HeaderMap::new();
///
/// if let Entry::Vacant(v) = map.entry(&quot;x-hello&quot;) {
/// assert_eq!(v.into_key().as_str(), &quot;x-hello&quot;);
/// }
/// ```
</span><span class="kw">pub fn </span>into_key(<span class="self">self</span>) -&gt; HeaderName {
<span class="self">self</span>.key
}
<span class="doccomment">/// Insert the value into the entry.
///
/// The value will be associated with this entry&#39;s key. A mutable reference
/// to the inserted value will be returned.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry};
/// let mut map = HeaderMap::new();
///
/// if let Entry::Vacant(v) = map.entry(&quot;x-hello&quot;) {
/// v.insert(&quot;world&quot;.parse().unwrap());
/// }
///
/// assert_eq!(map[&quot;x-hello&quot;], &quot;world&quot;);
/// ```
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, value: T) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T {
<span class="comment">// Ensure that there is space in the map
</span><span class="kw">let </span>index =
<span class="self">self</span>.map
.insert_phase_two(<span class="self">self</span>.key, value.into(), <span class="self">self</span>.hash, <span class="self">self</span>.probe, <span class="self">self</span>.danger);
<span class="kw-2">&amp;mut </span><span class="self">self</span>.map.entries[index].value
}
<span class="doccomment">/// Insert the value into the entry.
///
/// The value will be associated with this entry&#39;s key. The new
/// `OccupiedEntry` is returned, allowing for further manipulation.
///
/// # Examples
///
/// ```
/// # use http::header::*;
/// let mut map = HeaderMap::new();
///
/// if let Entry::Vacant(v) = map.entry(&quot;x-hello&quot;) {
/// let mut e = v.insert_entry(&quot;world&quot;.parse().unwrap());
/// e.insert(&quot;world2&quot;.parse().unwrap());
/// }
///
/// assert_eq!(map[&quot;x-hello&quot;], &quot;world2&quot;);
/// ```
</span><span class="kw">pub fn </span>insert_entry(<span class="self">self</span>, value: T) -&gt; OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="comment">// Ensure that there is space in the map
</span><span class="kw">let </span>index =
<span class="self">self</span>.map
.insert_phase_two(<span class="self">self</span>.key, value.into(), <span class="self">self</span>.hash, <span class="self">self</span>.probe, <span class="self">self</span>.danger);
OccupiedEntry {
map: <span class="self">self</span>.map,
index: index,
probe: <span class="self">self</span>.probe,
}
}
}
<span class="comment">// ===== impl GetAll =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; GetAll&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="doccomment">/// Returns an iterator visiting all values associated with the entry.
///
/// Values are iterated in insertion order.
///
/// # Examples
///
/// ```
/// # use http::HeaderMap;
/// # use http::header::HOST;
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
/// map.append(HOST, &quot;hello.earth&quot;.parse().unwrap());
///
/// let values = map.get_all(&quot;host&quot;);
/// let mut iter = values.iter();
/// assert_eq!(&amp;&quot;hello.world&quot;, iter.next().unwrap());
/// assert_eq!(&amp;&quot;hello.earth&quot;, iter.next().unwrap());
/// assert!(iter.next().is_none());
/// ```
</span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="comment">// This creates a new GetAll struct so that the lifetime
// isn&#39;t bound to &amp;self.
</span>GetAll {
map: <span class="self">self</span>.map,
index: <span class="self">self</span>.index,
}
.into_iter()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: PartialEq&gt; PartialEq <span class="kw">for </span>GetAll&lt;<span class="lifetime">&#39;a</span>, T&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><span class="self">Self</span>) -&gt; bool {
<span class="self">self</span>.iter().eq(other.iter())
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span>GetAll&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T;
<span class="kw">type </span>IntoIter = ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.map.value_iter(<span class="self">self</span>.index)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>: <span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>GetAll&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T;
<span class="kw">type </span>IntoIter = ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.map.value_iter(<span class="self">self</span>.index)
}
}
<span class="comment">// ===== impl ValueIter =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; Iterator <span class="kw">for </span>ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">match </span><span class="self">self</span>.front {
<span class="prelude-val">Some</span>(Head) =&gt; {
<span class="kw">let </span>entry = <span class="kw-2">&amp;</span><span class="self">self</span>.map.entries[<span class="self">self</span>.index];
<span class="kw">if </span><span class="self">self</span>.back == <span class="prelude-val">Some</span>(Head) {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="comment">// Update the iterator state
</span><span class="kw">match </span>entry.links {
<span class="prelude-val">Some</span>(links) =&gt; {
<span class="self">self</span>.front = <span class="prelude-val">Some</span>(Values(links.next));
}
<span class="prelude-val">None </span>=&gt; <span class="macro">unreachable!</span>(),
}
}
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>entry.value)
}
<span class="prelude-val">Some</span>(Values(idx)) =&gt; {
<span class="kw">let </span>extra = <span class="kw-2">&amp;</span><span class="self">self</span>.map.extra_values[idx];
<span class="kw">if </span><span class="self">self</span>.front == <span class="self">self</span>.back {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="kw">match </span>extra.next {
Link::Entry(<span class="kw">_</span>) =&gt; <span class="self">self</span>.front = <span class="prelude-val">None</span>,
Link::Extra(i) =&gt; <span class="self">self</span>.front = <span class="prelude-val">Some</span>(Values(i)),
}
}
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>extra.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="kw">match </span>(<span class="self">self</span>.front, <span class="self">self</span>.back) {
<span class="comment">// Exactly 1 value...
</span>(<span class="prelude-val">Some</span>(Cursor::Head), <span class="prelude-val">Some</span>(Cursor::Head)) =&gt; (<span class="number">1</span>, <span class="prelude-val">Some</span>(<span class="number">1</span>)),
<span class="comment">// At least 1...
</span>(<span class="prelude-val">Some</span>(<span class="kw">_</span>), <span class="kw">_</span>) =&gt; (<span class="number">1</span>, <span class="prelude-val">None</span>),
<span class="comment">// No more values...
</span>(<span class="prelude-val">None</span>, <span class="kw">_</span>) =&gt; (<span class="number">0</span>, <span class="prelude-val">Some</span>(<span class="number">0</span>)),
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; DoubleEndedIterator <span class="kw">for </span>ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">fn </span>next_back(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">match </span><span class="self">self</span>.back {
<span class="prelude-val">Some</span>(Head) =&gt; {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span><span class="self">self</span>.map.entries[<span class="self">self</span>.index].value)
}
<span class="prelude-val">Some</span>(Values(idx)) =&gt; {
<span class="kw">let </span>extra = <span class="kw-2">&amp;</span><span class="self">self</span>.map.extra_values[idx];
<span class="kw">if </span><span class="self">self</span>.front == <span class="self">self</span>.back {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="kw">match </span>extra.prev {
Link::Entry(<span class="kw">_</span>) =&gt; <span class="self">self</span>.back = <span class="prelude-val">Some</span>(Head),
Link::Extra(idx) =&gt; <span class="self">self</span>.back = <span class="prelude-val">Some</span>(Values(idx)),
}
}
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>extra.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl ValueIterMut =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; Iterator <span class="kw">for </span>ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span><span class="self">self</span>.map).entries[<span class="self">self</span>.index] };
<span class="kw">match </span><span class="self">self</span>.front {
<span class="prelude-val">Some</span>(Head) =&gt; {
<span class="kw">if </span><span class="self">self</span>.back == <span class="prelude-val">Some</span>(Head) {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="comment">// Update the iterator state
</span><span class="kw">match </span>entry.links {
<span class="prelude-val">Some</span>(links) =&gt; {
<span class="self">self</span>.front = <span class="prelude-val">Some</span>(Values(links.next));
}
<span class="prelude-val">None </span>=&gt; <span class="macro">unreachable!</span>(),
}
}
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>entry.value)
}
<span class="prelude-val">Some</span>(Values(idx)) =&gt; {
<span class="kw">let </span>extra = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span><span class="self">self</span>.map).extra_values[idx] };
<span class="kw">if </span><span class="self">self</span>.front == <span class="self">self</span>.back {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="kw">match </span>extra.next {
Link::Entry(<span class="kw">_</span>) =&gt; <span class="self">self</span>.front = <span class="prelude-val">None</span>,
Link::Extra(i) =&gt; <span class="self">self</span>.front = <span class="prelude-val">Some</span>(Values(i)),
}
}
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>extra.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T: <span class="lifetime">&#39;a</span>&gt; DoubleEndedIterator <span class="kw">for </span>ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">fn </span>next_back(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="kw">use </span><span class="self">self</span>::Cursor::<span class="kw-2">*</span>;
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span><span class="self">self</span>.map).entries[<span class="self">self</span>.index] };
<span class="kw">match </span><span class="self">self</span>.back {
<span class="prelude-val">Some</span>(Head) =&gt; {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>entry.value)
}
<span class="prelude-val">Some</span>(Values(idx)) =&gt; {
<span class="kw">let </span>extra = <span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span><span class="self">self</span>.map).extra_values[idx] };
<span class="kw">if </span><span class="self">self</span>.front == <span class="self">self</span>.back {
<span class="self">self</span>.front = <span class="prelude-val">None</span>;
<span class="self">self</span>.back = <span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="kw">match </span>extra.prev {
Link::Entry(<span class="kw">_</span>) =&gt; <span class="self">self</span>.back = <span class="prelude-val">Some</span>(Head),
Link::Extra(idx) =&gt; <span class="self">self</span>.back = <span class="prelude-val">Some</span>(Values(idx)),
}
}
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>extra.value)
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Sync&gt; Sync <span class="kw">for </span>ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Send&gt; Send <span class="kw">for </span>ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl IntoIter =====
</span><span class="kw">impl</span>&lt;T&gt; Iterator <span class="kw">for </span>IntoIter&lt;T&gt; {
<span class="kw">type </span>Item = (<span class="prelude-ty">Option</span>&lt;HeaderName&gt;, T);
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="kw">if let </span><span class="prelude-val">Some</span>(next) = <span class="self">self</span>.next {
<span class="self">self</span>.next = <span class="kw">match </span><span class="self">self</span>.extra_values[next].next {
Link::Entry(<span class="kw">_</span>) =&gt; <span class="prelude-val">None</span>,
Link::Extra(v) =&gt; <span class="prelude-val">Some</span>(v),
};
<span class="kw">let </span>value = <span class="kw">unsafe </span>{ ptr::read(<span class="kw-2">&amp;</span><span class="self">self</span>.extra_values[next].value) };
<span class="kw">return </span><span class="prelude-val">Some</span>((<span class="prelude-val">None</span>, value));
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(bucket) = <span class="self">self</span>.entries.next() {
<span class="self">self</span>.next = bucket.links.map(|l| l.next);
<span class="kw">let </span>name = <span class="prelude-val">Some</span>(bucket.key);
<span class="kw">let </span>value = bucket.value;
<span class="kw">return </span><span class="prelude-val">Some</span>((name, value));
}
<span class="prelude-val">None
</span>}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="kw">let </span>(lower, <span class="kw">_</span>) = <span class="self">self</span>.entries.size_hint();
<span class="comment">// There could be more than just the entries upper, as there
// could be items in the `extra_values`. We could guess, saying
// `upper + extra_values.len()`, but that could overestimate by a lot.
</span>(lower, <span class="prelude-val">None</span>)
}
}
<span class="kw">impl</span>&lt;T&gt; FusedIterator <span class="kw">for </span>IntoIter&lt;T&gt; {}
<span class="kw">impl</span>&lt;T&gt; Drop <span class="kw">for </span>IntoIter&lt;T&gt; {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="comment">// Ensure the iterator is consumed
</span><span class="kw">for _ in </span><span class="self">self</span>.by_ref() {}
<span class="comment">// All the values have already been yielded out.
</span><span class="kw">unsafe </span>{
<span class="self">self</span>.extra_values.set_len(<span class="number">0</span>);
}
}
}
<span class="comment">// ===== impl OccupiedEntry =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="doccomment">/// Returns a reference to the entry&#39;s key.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
///
/// if let Entry::Occupied(e) = map.entry(&quot;host&quot;) {
/// assert_eq!(&quot;host&quot;, e.key());
/// }
/// ```
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>HeaderName {
<span class="kw-2">&amp;</span><span class="self">self</span>.map.entries[<span class="self">self</span>.index].key
}
<span class="doccomment">/// Get a reference to the first value in the entry.
///
/// Values are stored in insertion order.
///
/// # Panics
///
/// `get` panics if there are no values associated with the entry.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
///
/// if let Entry::Occupied(mut e) = map.entry(&quot;host&quot;) {
/// assert_eq!(e.get(), &amp;&quot;hello.world&quot;);
///
/// e.append(&quot;hello.earth&quot;.parse().unwrap());
///
/// assert_eq!(e.get(), &amp;&quot;hello.world&quot;);
/// }
/// ```
</span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>T {
<span class="kw-2">&amp;</span><span class="self">self</span>.map.entries[<span class="self">self</span>.index].value
}
<span class="doccomment">/// Get a mutable reference to the first value in the entry.
///
/// Values are stored in insertion order.
///
/// # Panics
///
/// `get_mut` panics if there are no values associated with the entry.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::default();
/// map.insert(HOST, &quot;hello.world&quot;.to_string());
///
/// if let Entry::Occupied(mut e) = map.entry(&quot;host&quot;) {
/// e.get_mut().push_str(&quot;-2&quot;);
/// assert_eq!(e.get(), &amp;&quot;hello.world-2&quot;);
/// }
/// ```
</span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>T {
<span class="kw-2">&amp;mut </span><span class="self">self</span>.map.entries[<span class="self">self</span>.index].value
}
<span class="doccomment">/// Converts the `OccupiedEntry` into a mutable reference to the **first**
/// value.
///
/// The lifetime of the returned reference is bound to the original map.
///
/// # Panics
///
/// `into_mut` panics if there are no values associated with the entry.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::default();
/// map.insert(HOST, &quot;hello.world&quot;.to_string());
/// map.append(HOST, &quot;hello.earth&quot;.to_string());
///
/// if let Entry::Occupied(e) = map.entry(&quot;host&quot;) {
/// e.into_mut().push_str(&quot;-2&quot;);
/// }
///
/// assert_eq!(&quot;hello.world-2&quot;, map[&quot;host&quot;]);
/// ```
</span><span class="kw">pub fn </span>into_mut(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T {
<span class="kw-2">&amp;mut </span><span class="self">self</span>.map.entries[<span class="self">self</span>.index].value
}
<span class="doccomment">/// Sets the value of the entry.
///
/// All previous values associated with the entry are removed and the first
/// one is returned. See `insert_mult` for an API that returns all values.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;hello.world&quot;.parse().unwrap());
///
/// if let Entry::Occupied(mut e) = map.entry(&quot;host&quot;) {
/// let mut prev = e.insert(&quot;earth&quot;.parse().unwrap());
/// assert_eq!(&quot;hello.world&quot;, prev);
/// }
///
/// assert_eq!(&quot;earth&quot;, map[&quot;host&quot;]);
/// ```
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: T) -&gt; T {
<span class="self">self</span>.map.insert_occupied(<span class="self">self</span>.index, value.into())
}
<span class="doccomment">/// Sets the value of the entry.
///
/// This function does the same as `insert` except it returns an iterator
/// that yields all values previously associated with the key.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
/// map.append(HOST, &quot;world2&quot;.parse().unwrap());
///
/// if let Entry::Occupied(mut e) = map.entry(&quot;host&quot;) {
/// let mut prev = e.insert_mult(&quot;earth&quot;.parse().unwrap());
/// assert_eq!(&quot;world&quot;, prev.next().unwrap());
/// assert_eq!(&quot;world2&quot;, prev.next().unwrap());
/// assert!(prev.next().is_none());
/// }
///
/// assert_eq!(&quot;earth&quot;, map[&quot;host&quot;]);
/// ```
</span><span class="kw">pub fn </span>insert_mult(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: T) -&gt; ValueDrain&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="self">self</span>.map.insert_occupied_mult(<span class="self">self</span>.index, value.into())
}
<span class="doccomment">/// Insert the value into the entry.
///
/// The new value is appended to the end of the entry&#39;s value list. All
/// previous values associated with the entry are retained.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
///
/// if let Entry::Occupied(mut e) = map.entry(&quot;host&quot;) {
/// e.append(&quot;earth&quot;.parse().unwrap());
/// }
///
/// let values = map.get_all(&quot;host&quot;);
/// let mut i = values.iter();
/// assert_eq!(&quot;world&quot;, *i.next().unwrap());
/// assert_eq!(&quot;earth&quot;, *i.next().unwrap());
/// ```
</span><span class="kw">pub fn </span>append(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: T) {
<span class="kw">let </span>idx = <span class="self">self</span>.index;
<span class="kw">let </span>entry = <span class="kw-2">&amp;mut </span><span class="self">self</span>.map.entries[idx];
append_value(idx, entry, <span class="kw-2">&amp;mut </span><span class="self">self</span>.map.extra_values, value.into());
}
<span class="doccomment">/// Remove the entry from the map.
///
/// All values associated with the entry are removed and the first one is
/// returned. See `remove_entry_mult` for an API that returns all values.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
///
/// if let Entry::Occupied(e) = map.entry(&quot;host&quot;) {
/// let mut prev = e.remove();
/// assert_eq!(&quot;world&quot;, prev);
/// }
///
/// assert!(!map.contains_key(&quot;host&quot;));
/// ```
</span><span class="kw">pub fn </span>remove(<span class="self">self</span>) -&gt; T {
<span class="self">self</span>.remove_entry().<span class="number">1
</span>}
<span class="doccomment">/// Remove the entry from the map.
///
/// The key and all values associated with the entry are removed and the
/// first one is returned. See `remove_entry_mult` for an API that returns
/// all values.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
///
/// if let Entry::Occupied(e) = map.entry(&quot;host&quot;) {
/// let (key, mut prev) = e.remove_entry();
/// assert_eq!(&quot;host&quot;, key.as_str());
/// assert_eq!(&quot;world&quot;, prev);
/// }
///
/// assert!(!map.contains_key(&quot;host&quot;));
/// ```
</span><span class="kw">pub fn </span>remove_entry(<span class="self">self</span>) -&gt; (HeaderName, T) {
<span class="kw">if let </span><span class="prelude-val">Some</span>(links) = <span class="self">self</span>.map.entries[<span class="self">self</span>.index].links {
<span class="self">self</span>.map.remove_all_extra_values(links.next);
}
<span class="kw">let </span>entry = <span class="self">self</span>.map.remove_found(<span class="self">self</span>.probe, <span class="self">self</span>.index);
(entry.key, entry.value)
}
<span class="doccomment">/// Remove the entry from the map.
///
/// The key and all values associated with the entry are removed and
/// returned.
</span><span class="kw">pub fn </span>remove_entry_mult(<span class="self">self</span>) -&gt; (HeaderName, ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt;) {
<span class="kw">let </span>raw_links = <span class="self">self</span>.map.raw_links();
<span class="kw">let </span>extra_values = <span class="kw-2">&amp;mut </span><span class="self">self</span>.map.extra_values;
<span class="kw">let </span>next = <span class="self">self</span>.map.entries[<span class="self">self</span>.index].links.map(|l| {
drain_all_extra_values(raw_links, extra_values, l.next)
.into_iter()
});
<span class="kw">let </span>entry = <span class="self">self</span>.map.remove_found(<span class="self">self</span>.probe, <span class="self">self</span>.index);
<span class="kw">let </span>drain = ValueDrain {
first: <span class="prelude-val">Some</span>(entry.value),
next,
lt: PhantomData,
};
(entry.key, drain)
}
<span class="doccomment">/// Returns an iterator visiting all values associated with the entry.
///
/// Values are iterated in insertion order.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::new();
/// map.insert(HOST, &quot;world&quot;.parse().unwrap());
/// map.append(HOST, &quot;earth&quot;.parse().unwrap());
///
/// if let Entry::Occupied(e) = map.entry(&quot;host&quot;) {
/// let mut iter = e.iter();
/// assert_eq!(&amp;&quot;world&quot;, iter.next().unwrap());
/// assert_eq!(&amp;&quot;earth&quot;, iter.next().unwrap());
/// assert!(iter.next().is_none());
/// }
/// ```
</span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; ValueIter&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="self">self</span>.map.value_iter(<span class="prelude-val">Some</span>(<span class="self">self</span>.index))
}
<span class="doccomment">/// Returns an iterator mutably visiting all values associated with the
/// entry.
///
/// Values are iterated in insertion order.
///
/// # Examples
///
/// ```
/// # use http::header::{HeaderMap, Entry, HOST};
/// let mut map = HeaderMap::default();
/// map.insert(HOST, &quot;world&quot;.to_string());
/// map.append(HOST, &quot;earth&quot;.to_string());
///
/// if let Entry::Occupied(mut e) = map.entry(&quot;host&quot;) {
/// for e in e.iter_mut() {
/// e.push_str(&quot;-boop&quot;);
/// }
/// }
///
/// let mut values = map.get_all(&quot;host&quot;);
/// let mut i = values.iter();
/// assert_eq!(&amp;&quot;world-boop&quot;, i.next().unwrap());
/// assert_eq!(&amp;&quot;earth-boop&quot;, i.next().unwrap());
/// ```
</span><span class="kw">pub fn </span>iter_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; ValueIterMut&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="self">self</span>.map.value_iter_mut(<span class="self">self</span>.index)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span>OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T;
<span class="kw">type </span>IntoIter = ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.map.value_iter_mut(<span class="self">self</span>.index)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>: <span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T;
<span class="kw">type </span>IntoIter = ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; ValueIter&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.iter()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>: <span class="lifetime">&#39;a</span>, T&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span><span class="kw-2">mut </span>OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T;
<span class="kw">type </span>IntoIter = ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt;;
<span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; ValueIterMut&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="self">self</span>.iter_mut()
}
}
<span class="comment">// ===== impl ValueDrain =====
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Iterator <span class="kw">for </span>ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">type </span>Item = T;
<span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
<span class="kw">if </span><span class="self">self</span>.first.is_some() {
<span class="self">self</span>.first.take()
} <span class="kw">else if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref mut </span>extras) = <span class="self">self</span>.next {
extras.next()
} <span class="kw">else </span>{
<span class="prelude-val">None
</span>}
}
<span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="kw">match </span>(<span class="kw-2">&amp;</span><span class="self">self</span>.first, <span class="kw-2">&amp;</span><span class="self">self</span>.next) {
<span class="comment">// Exactly 1
</span>(<span class="kw-2">&amp;</span><span class="prelude-val">Some</span>(<span class="kw">_</span>), <span class="kw-2">&amp;</span><span class="prelude-val">None</span>) =&gt; (<span class="number">1</span>, <span class="prelude-val">Some</span>(<span class="number">1</span>)),
<span class="comment">// 1 + extras
</span>(<span class="kw-2">&amp;</span><span class="prelude-val">Some</span>(<span class="kw">_</span>), <span class="kw-2">&amp;</span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>extras)) =&gt; {
<span class="kw">let </span>(l, u) = extras.size_hint();
(l + <span class="number">1</span>, u.map(|u| u + <span class="number">1</span>))
},
<span class="comment">// Extras only
</span>(<span class="kw-2">&amp;</span><span class="prelude-val">None</span>, <span class="kw-2">&amp;</span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>extras)) =&gt; extras.size_hint(),
<span class="comment">// No more
</span>(<span class="kw-2">&amp;</span><span class="prelude-val">None</span>, <span class="kw-2">&amp;</span><span class="prelude-val">None</span>) =&gt; (<span class="number">0</span>, <span class="prelude-val">Some</span>(<span class="number">0</span>)),
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; FusedIterator <span class="kw">for </span>ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T&gt; Drop <span class="kw">for </span>ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt; {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">while let </span><span class="prelude-val">Some</span>(<span class="kw">_</span>) = <span class="self">self</span>.next() {}
}
}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Sync&gt; Sync <span class="kw">for </span>ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, T: Send&gt; Send <span class="kw">for </span>ValueDrain&lt;<span class="lifetime">&#39;a</span>, T&gt; {}
<span class="comment">// ===== impl RawLinks =====
</span><span class="kw">impl</span>&lt;T&gt; Clone <span class="kw">for </span>RawLinks&lt;T&gt; {
<span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; RawLinks&lt;T&gt; {
<span class="kw-2">*</span><span class="self">self
</span>}
}
<span class="kw">impl</span>&lt;T&gt; Copy <span class="kw">for </span>RawLinks&lt;T&gt; {}
<span class="kw">impl</span>&lt;T&gt; ops::Index&lt;usize&gt; <span class="kw">for </span>RawLinks&lt;T&gt; {
<span class="kw">type </span>Output = <span class="prelude-ty">Option</span>&lt;Links&gt;;
<span class="kw">fn </span>index(<span class="kw-2">&amp;</span><span class="self">self</span>, idx: usize) -&gt; <span class="kw-2">&amp;</span><span class="self">Self</span>::Output {
<span class="kw">unsafe </span>{
<span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.<span class="number">0</span>)[idx].links
}
}
}
<span class="kw">impl</span>&lt;T&gt; ops::IndexMut&lt;usize&gt; <span class="kw">for </span>RawLinks&lt;T&gt; {
<span class="kw">fn </span>index_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, idx: usize) -&gt; <span class="kw-2">&amp;mut </span><span class="self">Self</span>::Output {
<span class="kw">unsafe </span>{
<span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span><span class="self">self</span>.<span class="number">0</span>)[idx].links
}
}
}
<span class="comment">// ===== impl Pos =====
</span><span class="kw">impl </span>Pos {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>new(index: usize, hash: HashValue) -&gt; <span class="self">Self </span>{
<span class="macro">debug_assert!</span>(index &lt; MAX_SIZE);
Pos {
index: index <span class="kw">as </span>Size,
hash: hash,
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>none() -&gt; <span class="self">Self </span>{
Pos {
index: !<span class="number">0</span>,
hash: HashValue(<span class="number">0</span>),
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>is_some(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
!<span class="self">self</span>.is_none()
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>is_none(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="self">self</span>.index == !<span class="number">0
</span>}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>resolve(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, HashValue)&gt; {
<span class="kw">if </span><span class="self">self</span>.is_some() {
<span class="prelude-val">Some</span>((<span class="self">self</span>.index <span class="kw">as </span>usize, <span class="self">self</span>.hash))
} <span class="kw">else </span>{
<span class="prelude-val">None
</span>}
}
}
<span class="kw">impl </span>Danger {
<span class="kw">fn </span>is_red(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Danger::Red(<span class="kw">_</span>) =&gt; <span class="bool-val">true</span>,
<span class="kw">_ </span>=&gt; <span class="bool-val">false</span>,
}
}
<span class="kw">fn </span>to_red(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="macro">debug_assert!</span>(<span class="self">self</span>.is_yellow());
<span class="kw-2">*</span><span class="self">self </span>= Danger::Red(RandomState::new());
}
<span class="kw">fn </span>is_yellow(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Danger::Yellow =&gt; <span class="bool-val">true</span>,
<span class="kw">_ </span>=&gt; <span class="bool-val">false</span>,
}
}
<span class="kw">fn </span>to_yellow(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Danger::Green =&gt; {
<span class="kw-2">*</span><span class="self">self </span>= Danger::Yellow;
}
<span class="kw">_ </span>=&gt; {}
}
}
<span class="kw">fn </span>to_green(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="macro">debug_assert!</span>(<span class="self">self</span>.is_yellow());
<span class="kw-2">*</span><span class="self">self </span>= Danger::Green;
}
}
<span class="comment">// ===== impl Utils =====
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>usable_capacity(cap: usize) -&gt; usize {
cap - cap / <span class="number">4
</span>}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>to_raw_capacity(n: usize) -&gt; usize {
n + n / <span class="number">3
</span>}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>desired_pos(mask: Size, hash: HashValue) -&gt; usize {
(hash.<span class="number">0 </span>&amp; mask) <span class="kw">as </span>usize
}
<span class="doccomment">/// The number of steps that `current` is forward of the desired position for hash
</span><span class="attribute">#[inline]
</span><span class="kw">fn </span>probe_distance(mask: Size, hash: HashValue, current: usize) -&gt; usize {
current.wrapping_sub(desired_pos(mask, hash)) &amp; mask <span class="kw">as </span>usize
}
<span class="kw">fn </span>hash_elem_using&lt;K: <span class="question-mark">?</span>Sized&gt;(danger: <span class="kw-2">&amp;</span>Danger, k: <span class="kw-2">&amp;</span>K) -&gt; HashValue
<span class="kw">where
</span>K: Hash,
{
<span class="kw">use </span>fnv::FnvHasher;
<span class="kw">const </span>MASK: u64 = (MAX_SIZE <span class="kw">as </span>u64) - <span class="number">1</span>;
<span class="kw">let </span>hash = <span class="kw">match </span><span class="kw-2">*</span>danger {
<span class="comment">// Safe hash
</span>Danger::Red(<span class="kw-2">ref </span>hasher) =&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>h = hasher.build_hasher();
k.hash(<span class="kw-2">&amp;mut </span>h);
h.finish()
}
<span class="comment">// Fast hash
</span><span class="kw">_ </span>=&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>h = FnvHasher::default();
k.hash(<span class="kw-2">&amp;mut </span>h);
h.finish()
}
};
HashValue((hash &amp; MASK) <span class="kw">as </span>u16)
}
<span class="comment">/*
*
* ===== impl IntoHeaderName / AsHeaderName =====
*
*/
</span><span class="kw">mod </span>into_header_name {
<span class="kw">use super</span>::{Entry, HdrName, HeaderMap, HeaderName};
<span class="doccomment">/// A marker trait used to identify values that can be used as insert keys
/// to a `HeaderMap`.
</span><span class="kw">pub trait </span>IntoHeaderName: Sealed {}
<span class="comment">// All methods are on this pub(super) trait, instead of `IntoHeaderName`,
// so that they aren&#39;t publicly exposed to the world.
//
// Being on the `IntoHeaderName` trait would mean users could call
// `&quot;host&quot;.insert(&amp;mut map, &quot;localhost&quot;)`.
//
// Ultimately, this allows us to adjust the signatures of these methods
// without breaking any external crate.
</span><span class="kw">pub trait </span>Sealed {
<span class="attribute">#[doc(hidden)]
</span><span class="kw">fn </span>insert&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt;;
<span class="attribute">#[doc(hidden)]
</span><span class="kw">fn </span>append&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; bool;
<span class="attribute">#[doc(hidden)]
</span><span class="kw">fn </span>entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;;
}
<span class="comment">// ==== impls ====
</span><span class="kw">impl </span>Sealed <span class="kw">for </span>HeaderName {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>insert&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
map.insert2(<span class="self">self</span>, val)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>append&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; bool {
map.append2(<span class="self">self</span>, val)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, T&gt; {
map.entry2(<span class="self">self</span>)
}
}
<span class="kw">impl </span>IntoHeaderName <span class="kw">for </span>HeaderName {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; Sealed <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>insert&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
map.insert2(<span class="self">self</span>, val)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>append&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; bool {
map.append2(<span class="self">self</span>, val)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, T&gt; {
map.entry2(<span class="self">self</span>)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; IntoHeaderName <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName {}
<span class="kw">impl </span>Sealed <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>insert&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
HdrName::from_static(<span class="self">self</span>, <span class="kw">move </span>|hdr| map.insert2(hdr, val))
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>append&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;, val: T) -&gt; bool {
HdrName::from_static(<span class="self">self</span>, <span class="kw">move </span>|hdr| map.append2(hdr, val))
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, T&gt; {
HdrName::from_static(<span class="self">self</span>, <span class="kw">move </span>|hdr| map.entry2(hdr))
}
}
<span class="kw">impl </span>IntoHeaderName <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {}
}
<span class="kw">mod </span>as_header_name {
<span class="kw">use super</span>::{Entry, HdrName, HeaderMap, HeaderName, InvalidHeaderName};
<span class="doccomment">/// A marker trait used to identify values that can be used as search keys
/// to a `HeaderMap`.
</span><span class="kw">pub trait </span>AsHeaderName: Sealed {}
<span class="comment">// All methods are on this pub(super) trait, instead of `AsHeaderName`,
// so that they aren&#39;t publicly exposed to the world.
//
// Being on the `AsHeaderName` trait would mean users could call
// `&quot;host&quot;.find(&amp;map)`.
//
// Ultimately, this allows us to adjust the signatures of these methods
// without breaking any external crate.
</span><span class="kw">pub trait </span>Sealed {
<span class="attribute">#[doc(hidden)]
</span><span class="kw">fn </span>try_entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt;;
<span class="attribute">#[doc(hidden)]
</span><span class="kw">fn </span>find&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, map: <span class="kw-2">&amp;</span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt;;
<span class="attribute">#[doc(hidden)]
</span><span class="kw">fn </span>as_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str;
}
<span class="comment">// ==== impls ====
</span><span class="kw">impl </span>Sealed <span class="kw">for </span>HeaderName {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt; {
<span class="prelude-val">Ok</span>(map.entry2(<span class="self">self</span>))
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>find&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, map: <span class="kw-2">&amp;</span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
map.find(<span class="self">self</span>)
}
<span class="kw">fn </span>as_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str {
&lt;HeaderName&gt;::as_str(<span class="self">self</span>)
}
}
<span class="kw">impl </span>AsHeaderName <span class="kw">for </span>HeaderName {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; Sealed <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt; {
<span class="prelude-val">Ok</span>(map.entry2(<span class="self">self</span>))
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>find&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, map: <span class="kw-2">&amp;</span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
map.find(<span class="kw-2">*</span><span class="self">self</span>)
}
<span class="kw">fn </span>as_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str {
&lt;HeaderName&gt;::as_str(<span class="kw-2">*</span><span class="self">self</span>)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; AsHeaderName <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HeaderName {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; Sealed <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>str {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt; {
HdrName::from_bytes(<span class="self">self</span>.as_bytes(), <span class="kw">move </span>|hdr| map.entry2(hdr))
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>find&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, map: <span class="kw-2">&amp;</span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
HdrName::from_bytes(<span class="self">self</span>.as_bytes(), <span class="kw">move </span>|hdr| map.find(<span class="kw-2">&amp;</span>hdr)).unwrap_or(<span class="prelude-val">None</span>)
}
<span class="kw">fn </span>as_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str {
<span class="self">self
</span>}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; AsHeaderName <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>str {}
<span class="kw">impl </span>Sealed <span class="kw">for </span>String {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt; {
<span class="self">self</span>.as_str().try_entry(map)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>find&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, map: <span class="kw-2">&amp;</span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
Sealed::find(<span class="kw-2">&amp;</span><span class="self">self</span>.as_str(), map)
}
<span class="kw">fn </span>as_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str {
<span class="self">self
</span>}
}
<span class="kw">impl </span>AsHeaderName <span class="kw">for </span>String {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; Sealed <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>String {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>try_entry&lt;T&gt;(<span class="self">self</span>, map: <span class="kw-2">&amp;mut </span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;Entry&lt;<span class="lifetime">&#39;_</span>, T&gt;, InvalidHeaderName&gt; {
<span class="self">self</span>.as_str().try_entry(map)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>find&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, map: <span class="kw-2">&amp;</span>HeaderMap&lt;T&gt;) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, usize)&gt; {
Sealed::find(<span class="kw-2">*</span><span class="self">self</span>, map)
}
<span class="kw">fn </span>as_str(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>str {
<span class="kw-2">*</span><span class="self">self
</span>}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; AsHeaderName <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>String {}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_bounds() {
<span class="kw">fn </span>check_bounds&lt;T: Send + Send&gt;() {}
check_bounds::&lt;HeaderMap&lt;()&gt;&gt;();
check_bounds::&lt;Iter&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;IterMut&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;Keys&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;Values&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;ValuesMut&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;Drain&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;GetAll&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;Entry&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;VacantEntry&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;OccupiedEntry&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;ValueIter&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;ValueIterMut&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
check_bounds::&lt;ValueDrain&lt;<span class="lifetime">&#39;static</span>, ()&gt;&gt;();
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>skip_duplicates_during_key_iteration() {
<span class="kw">let </span><span class="kw-2">mut </span>map = HeaderMap::new();
map.append(<span class="string">&quot;a&quot;</span>, HeaderValue::from_static(<span class="string">&quot;a&quot;</span>));
map.append(<span class="string">&quot;a&quot;</span>, HeaderValue::from_static(<span class="string">&quot;b&quot;</span>));
<span class="macro">assert_eq!</span>(map.keys().count(), map.keys_len());
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="http" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>