<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <meta name="generator" content="rustdoc"> <meta name="description" content="Source to the Rust file `/home/travis/.cargo/registry/src/github.com-1ecc6299db9ec823/hpack-0.2.0/src/lib.rs`."> <meta name="keywords" content="rust, rustlang, rust-lang"> <title>lib.rs.html -- source</title> <link rel="stylesheet" type="text/css" href="../../rustdoc.css"> <link rel="stylesheet" type="text/css" href="../../main.css"> </head> <body class="rustdoc"> <!--[if lte IE 8]> <div class="warning"> This old browser is unsupported and will most likely display funky things. </div> <![endif]--> <nav class="sidebar"> </nav> <nav class="sub"> <form class="search-form js-only"> <div class="search-container"> <input class="search-input" name="search" autocomplete="off" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"> </div> </form> </nav> <section id='main' class="content source"><pre class="line-numbers"><span id="1"> 1</span> <span id="2"> 2</span> <span id="3"> 3</span> <span id="4"> 4</span> <span id="5"> 5</span> <span id="6"> 6</span> <span id="7"> 7</span> <span id="8"> 8</span> <span id="9"> 9</span> <span id="10"> 10</span> <span id="11"> 11</span> <span id="12"> 12</span> <span id="13"> 13</span> <span id="14"> 14</span> <span id="15"> 15</span> <span id="16"> 16</span> <span id="17"> 17</span> <span id="18"> 18</span> <span id="19"> 19</span> <span id="20"> 20</span> <span id="21"> 21</span> <span id="22"> 22</span> <span id="23"> 23</span> <span id="24"> 24</span> <span id="25"> 25</span> <span id="26"> 26</span> <span id="27"> 27</span> <span id="28"> 28</span> <span id="29"> 29</span> <span id="30"> 30</span> <span id="31"> 31</span> <span id="32"> 32</span> <span id="33"> 33</span> <span id="34"> 34</span> <span id="35"> 35</span> <span id="36"> 36</span> <span id="37"> 37</span> <span id="38"> 38</span> <span id="39"> 39</span> <span id="40"> 40</span> <span id="41"> 41</span> <span id="42"> 42</span> <span id="43"> 43</span> <span id="44"> 44</span> <span id="45"> 45</span> <span id="46"> 46</span> <span id="47"> 47</span> <span id="48"> 48</span> <span id="49"> 49</span> <span id="50"> 50</span> <span id="51"> 51</span> <span id="52"> 52</span> <span id="53"> 53</span> <span id="54"> 54</span> <span id="55"> 55</span> <span id="56"> 56</span> <span id="57"> 57</span> <span id="58"> 58</span> <span id="59"> 59</span> <span id="60"> 60</span> <span id="61"> 61</span> <span id="62"> 62</span> <span id="63"> 63</span> <span id="64"> 64</span> <span id="65"> 65</span> <span id="66"> 66</span> <span id="67"> 67</span> <span id="68"> 68</span> <span id="69"> 69</span> <span id="70"> 70</span> <span id="71"> 71</span> <span id="72"> 72</span> <span id="73"> 73</span> <span id="74"> 74</span> <span id="75"> 75</span> <span id="76"> 76</span> <span id="77"> 77</span> <span id="78"> 78</span> <span id="79"> 79</span> <span id="80"> 80</span> <span id="81"> 81</span> <span id="82"> 82</span> <span id="83"> 83</span> <span id="84"> 84</span> <span id="85"> 85</span> <span id="86"> 86</span> <span id="87"> 87</span> <span id="88"> 88</span> <span id="89"> 89</span> <span id="90"> 90</span> <span id="91"> 91</span> <span id="92"> 92</span> <span id="93"> 93</span> <span id="94"> 94</span> <span id="95"> 95</span> <span id="96"> 96</span> <span id="97"> 97</span> <span id="98"> 98</span> <span id="99"> 99</span> <span id="100">100</span> <span id="101">101</span> <span id="102">102</span> <span id="103">103</span> <span id="104">104</span> <span id="105">105</span> <span id="106">106</span> <span id="107">107</span> <span id="108">108</span> <span id="109">109</span> <span id="110">110</span> <span id="111">111</span> <span id="112">112</span> <span id="113">113</span> <span id="114">114</span> <span id="115">115</span> <span id="116">116</span> <span id="117">117</span> <span id="118">118</span> <span id="119">119</span> <span id="120">120</span> <span id="121">121</span> <span id="122">122</span> <span id="123">123</span> <span id="124">124</span> <span id="125">125</span> <span id="126">126</span> <span id="127">127</span> <span id="128">128</span> <span id="129">129</span> <span id="130">130</span> <span id="131">131</span> <span id="132">132</span> <span id="133">133</span> <span id="134">134</span> <span id="135">135</span> <span id="136">136</span> <span id="137">137</span> <span id="138">138</span> <span id="139">139</span> <span id="140">140</span> <span id="141">141</span> <span id="142">142</span> <span id="143">143</span> <span id="144">144</span> <span id="145">145</span> <span id="146">146</span> <span id="147">147</span> <span id="148">148</span> <span id="149">149</span> <span id="150">150</span> <span id="151">151</span> <span id="152">152</span> <span id="153">153</span> <span id="154">154</span> <span id="155">155</span> <span id="156">156</span> <span id="157">157</span> <span id="158">158</span> <span id="159">159</span> <span id="160">160</span> <span id="161">161</span> <span id="162">162</span> <span id="163">163</span> <span id="164">164</span> <span id="165">165</span> <span id="166">166</span> <span id="167">167</span> <span id="168">168</span> <span id="169">169</span> <span id="170">170</span> <span id="171">171</span> <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> </pre><pre class='rust '> <span class='doccomment'>//! A module implementing HPACK functionality. Exposes a simple API for</span> <span class='doccomment'>//! performing the encoding and decoding of header sets, according to the</span> <span class='doccomment'>//! HPACK spec.</span> <span class='attribute'>#[<span class='ident'>macro_use</span>]</span> <span class='kw'>extern</span> <span class='kw'>crate</span> <span class='ident'>log</span>; <span class='attribute'>#[<span class='ident'>cfg</span>(<span class='ident'>feature</span><span class='op'>=</span><span class='string'>"interop_tests"</span>)]</span> <span class='kw'>extern</span> <span class='kw'>crate</span> <span class='ident'>rustc_serialize</span>; <span class='kw'>use</span> <span class='ident'>std</span>::<span class='ident'>fmt</span>; <span class='kw'>use</span> <span class='ident'>std</span>::<span class='ident'>iter</span>; <span class='kw'>use</span> <span class='ident'>std</span>::<span class='ident'>slice</span>; <span class='kw'>use</span> <span class='ident'>std</span>::<span class='ident'>collections</span>::<span class='ident'>VecDeque</span>; <span class='kw'>use</span> <span class='ident'>std</span>::<span class='ident'>collections</span>::<span class='ident'>vec_deque</span>; <span class='comment'>// Re-export the main HPACK API entry points.</span> <span class='kw'>pub</span> <span class='kw'>use</span> <span class='self'>self</span>::<span class='ident'>decoder</span>::<span class='ident'>Decoder</span>; <span class='kw'>pub</span> <span class='kw'>use</span> <span class='self'>self</span>::<span class='ident'>encoder</span>::<span class='ident'>Encoder</span>; <span class='kw'>pub</span> <span class='kw'>mod</span> <span class='ident'>encoder</span>; <span class='kw'>pub</span> <span class='kw'>mod</span> <span class='ident'>decoder</span>; <span class='kw'>pub</span> <span class='kw'>mod</span> <span class='ident'>huffman</span>; <span class='doccomment'>/// An `Iterator` through elements of the `DynamicTable`.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The implementation of the iterator itself is very tightly coupled</span> <span class='doccomment'>/// to the implementation of the `DynamicTable`.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// This iterator returns tuples of slices. The tuples themselves are</span> <span class='doccomment'>/// constructed as new instances, containing a borrow from the `Vec`s</span> <span class='doccomment'>/// representing the underlying Headers.</span> <span class='kw'>struct</span> <span class='ident'>DynamicTableIter</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='doccomment'>/// Stores an iterator through the underlying structure that the</span> <span class='doccomment'>/// `DynamicTable` uses</span> <span class='ident'>inner</span>: <span class='ident'>vec_deque</span>::<span class='ident'>Iter</span><span class='op'><</span><span class='lifetime'>'a</span>, (<span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>)<span class='op'>></span>, } <span class='kw'>impl</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> <span class='ident'>Iterator</span> <span class='kw'>for</span> <span class='ident'>DynamicTableIter</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='kw'>type</span> <span class='ident'>Item</span> <span class='op'>=</span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>]); <span class='kw'>fn</span> <span class='ident'>next</span>(<span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='self'>self</span>) <span class='op'>-></span> <span class='prelude-ty'>Option</span><span class='op'><</span>(<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])<span class='op'>></span> { <span class='kw'>match</span> <span class='self'>self</span>.<span class='ident'>inner</span>.<span class='ident'>next</span>() { <span class='prelude-val'>Some</span>(<span class='kw-2'>ref</span> <span class='ident'>header</span>) <span class='op'>=></span> <span class='prelude-val'>Some</span>((<span class='kw-2'>&</span><span class='ident'>header</span>.<span class='number'>0</span>, <span class='kw-2'>&</span><span class='ident'>header</span>.<span class='number'>1</span>)), <span class='prelude-val'>None</span> <span class='op'>=></span> <span class='prelude-val'>None</span>, } } } <span class='doccomment'>/// A struct representing the dynamic table that needs to be maintained by the</span> <span class='doccomment'>/// coder.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The dynamic table contains a number of recently used headers. The size of</span> <span class='doccomment'>/// the table is constrained to a certain number of octets. If on insertion of</span> <span class='doccomment'>/// a new header into the table, the table would exceed the maximum size,</span> <span class='doccomment'>/// headers are evicted in a FIFO fashion until there is enough room for the</span> <span class='doccomment'>/// new header to be inserted. (Therefore, it is possible that though all</span> <span class='doccomment'>/// elements end up being evicted, there is still not enough space for the new</span> <span class='doccomment'>/// header: when the size of this individual header exceeds the maximum size of</span> <span class='doccomment'>/// the table.)</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The current size of the table is calculated, based on the IETF definition,</span> <span class='doccomment'>/// as the sum of sizes of each header stored within the table, where the size</span> <span class='doccomment'>/// of an individual header is</span> <span class='doccomment'>/// `len_in_octets(header_name) + len_in_octets(header_value) + 32`.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// Note: the maximum size of the dynamic table does not have to be equal to</span> <span class='doccomment'>/// the maximum header table size as defined by a "higher level" protocol</span> <span class='doccomment'>/// (such as the `SETTINGS_HEADER_TABLE_SIZE` setting in HTTP/2), since HPACK</span> <span class='doccomment'>/// can choose to modify the dynamic table size on the fly (as long as it keeps</span> <span class='doccomment'>/// it below the maximum value set by the protocol). So, the `DynamicTable`</span> <span class='doccomment'>/// only cares about the maximum size as set by the HPACK {en,de}coder and lets</span> <span class='doccomment'>/// *it* worry about making certain that the changes are valid according to</span> <span class='doccomment'>/// the (current) constraints of the protocol.</span> <span class='kw'>struct</span> <span class='ident'>DynamicTable</span> { <span class='ident'>table</span>: <span class='ident'>VecDeque</span><span class='op'><</span>(<span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>)<span class='op'>></span>, <span class='ident'>size</span>: <span class='ident'>usize</span>, <span class='ident'>max_size</span>: <span class='ident'>usize</span>, } <span class='kw'>impl</span> <span class='ident'>DynamicTable</span> { <span class='doccomment'>/// Creates a new empty dynamic table with a default size.</span> <span class='kw'>fn</span> <span class='ident'>new</span>() <span class='op'>-></span> <span class='ident'>DynamicTable</span> { <span class='comment'>// The default maximum size corresponds to the default HTTP/2</span> <span class='comment'>// setting</span> <span class='ident'>DynamicTable</span>::<span class='ident'>with_size</span>(<span class='number'>4096</span>) } <span class='doccomment'>/// Creates a new empty dynamic table with the given maximum size.</span> <span class='kw'>fn</span> <span class='ident'>with_size</span>(<span class='ident'>max_size</span>: <span class='ident'>usize</span>) <span class='op'>-></span> <span class='ident'>DynamicTable</span> { <span class='ident'>DynamicTable</span> { <span class='ident'>table</span>: <span class='ident'>VecDeque</span>::<span class='ident'>new</span>(), <span class='ident'>size</span>: <span class='number'>0</span>, <span class='ident'>max_size</span>: <span class='ident'>max_size</span>, } } <span class='doccomment'>/// Returns the current size of the table in octets, as defined by the IETF</span> <span class='doccomment'>/// HPACK spec.</span> <span class='kw'>fn</span> <span class='ident'>get_size</span>(<span class='kw-2'>&</span><span class='self'>self</span>) <span class='op'>-></span> <span class='ident'>usize</span> { <span class='self'>self</span>.<span class='ident'>size</span> } <span class='doccomment'>/// Returns an `Iterator` through the headers stored in the `DynamicTable`.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The iterator will yield elements of type `(&[u8], &[u8])`,</span> <span class='doccomment'>/// corresponding to a single header name and value. The name and value</span> <span class='doccomment'>/// slices are borrowed from their representations in the `DynamicTable`</span> <span class='doccomment'>/// internal implementation, which means that it is possible only to</span> <span class='doccomment'>/// iterate through the headers, not mutate them.</span> <span class='kw'>fn</span> <span class='ident'>iter</span>(<span class='kw-2'>&</span><span class='self'>self</span>) <span class='op'>-></span> <span class='ident'>DynamicTableIter</span> { <span class='ident'>DynamicTableIter</span> { <span class='ident'>inner</span>: <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>iter</span>(), } } <span class='doccomment'>/// Sets the new maximum table size.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// If the current size of the table is larger than the new maximum size,</span> <span class='doccomment'>/// existing headers are evicted in a FIFO fashion until the size drops</span> <span class='doccomment'>/// below the new maximum.</span> <span class='kw'>fn</span> <span class='ident'>set_max_table_size</span>(<span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='self'>self</span>, <span class='ident'>new_max_size</span>: <span class='ident'>usize</span>) { <span class='self'>self</span>.<span class='ident'>max_size</span> <span class='op'>=</span> <span class='ident'>new_max_size</span>; <span class='comment'>// Make the table size fit within the new constraints.</span> <span class='self'>self</span>.<span class='ident'>consolidate_table</span>(); } <span class='doccomment'>/// Returns the maximum size of the table in octets.</span> <span class='kw'>fn</span> <span class='ident'>get_max_table_size</span>(<span class='kw-2'>&</span><span class='self'>self</span>) <span class='op'>-></span> <span class='ident'>usize</span> { <span class='self'>self</span>.<span class='ident'>max_size</span> } <span class='doccomment'>/// Add a new header to the dynamic table.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The table automatically gets resized, if necessary.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// Do note that, under the HPACK rules, it is possible the given header</span> <span class='doccomment'>/// is not found in the dynamic table after this operation finishes, in</span> <span class='doccomment'>/// case the total size of the given header exceeds the maximum size of the</span> <span class='doccomment'>/// dynamic table.</span> <span class='kw'>fn</span> <span class='ident'>add_header</span>(<span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='self'>self</span>, <span class='ident'>name</span>: <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>value</span>: <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>) { <span class='comment'>// This is how the HPACK spec makes us calculate the size. The 32 is</span> <span class='comment'>// a magic number determined by them (under reasonable assumptions of</span> <span class='comment'>// how the table is stored).</span> <span class='self'>self</span>.<span class='ident'>size</span> <span class='op'>+=</span> <span class='ident'>name</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='ident'>value</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='number'>32</span>; <span class='macro'>debug</span><span class='macro'>!</span>(<span class='string'>"New dynamic table size {}"</span>, <span class='self'>self</span>.<span class='ident'>size</span>); <span class='comment'>// Now add it to the internal buffer</span> <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>push_front</span>((<span class='ident'>name</span>, <span class='ident'>value</span>)); <span class='comment'>// ...and make sure we're not over the maximum size.</span> <span class='self'>self</span>.<span class='ident'>consolidate_table</span>(); <span class='macro'>debug</span><span class='macro'>!</span>(<span class='string'>"After consolidation dynamic table size {}"</span>, <span class='self'>self</span>.<span class='ident'>size</span>); } <span class='doccomment'>/// Consolidates the table entries so that the table size is below the</span> <span class='doccomment'>/// maximum allowed size, by evicting headers from the table in a FIFO</span> <span class='doccomment'>/// fashion.</span> <span class='kw'>fn</span> <span class='ident'>consolidate_table</span>(<span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='self'>self</span>) { <span class='kw'>while</span> <span class='self'>self</span>.<span class='ident'>size</span> <span class='op'>></span> <span class='self'>self</span>.<span class='ident'>max_size</span> { { <span class='kw'>let</span> <span class='ident'>last_header</span> <span class='op'>=</span> <span class='kw'>match</span> <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>back</span>() { <span class='prelude-val'>Some</span>(<span class='ident'>x</span>) <span class='op'>=></span> <span class='ident'>x</span>, <span class='prelude-val'>None</span> <span class='op'>=></span> { <span class='comment'>// Can never happen as the size of the table must reach</span> <span class='comment'>// 0 by the time we've exhausted all elements.</span> <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"Size of table != 0, but no headers left!"</span>); } }; <span class='self'>self</span>.<span class='ident'>size</span> <span class='op'>-=</span> <span class='ident'>last_header</span>.<span class='number'>0</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='ident'>last_header</span>.<span class='number'>1</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='number'>32</span>; } <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>pop_back</span>(); } } <span class='doccomment'>/// Returns the number of headers in the dynamic table.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// This is different than the size of the dynamic table.</span> <span class='kw'>fn</span> <span class='ident'>len</span>(<span class='kw-2'>&</span><span class='self'>self</span>) <span class='op'>-></span> <span class='ident'>usize</span> { <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>len</span>() } <span class='doccomment'>/// Converts the current state of the table to a `Vec`</span> <span class='kw'>fn</span> <span class='ident'>to_vec</span>(<span class='kw-2'>&</span><span class='self'>self</span>) <span class='op'>-></span> <span class='ident'>Vec</span><span class='op'><</span>(<span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>)<span class='op'>></span> { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>ret</span>: <span class='ident'>Vec</span><span class='op'><</span>(<span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>)<span class='op'>></span> <span class='op'>=</span> <span class='ident'>Vec</span>::<span class='ident'>new</span>(); <span class='kw'>for</span> <span class='ident'>elem</span> <span class='kw'>in</span> <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>iter</span>() { <span class='ident'>ret</span>.<span class='ident'>push</span>(<span class='ident'>elem</span>.<span class='ident'>clone</span>()); } <span class='ident'>ret</span> } <span class='doccomment'>/// Returns a reference to the header at the given index, if found in the</span> <span class='doccomment'>/// dynamic table.</span> <span class='kw'>fn</span> <span class='ident'>get</span>(<span class='kw-2'>&</span><span class='self'>self</span>, <span class='ident'>index</span>: <span class='ident'>usize</span>) <span class='op'>-></span> <span class='prelude-ty'>Option</span><span class='op'><</span><span class='kw-2'>&</span>(<span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>)<span class='op'>></span> { <span class='self'>self</span>.<span class='ident'>table</span>.<span class='ident'>get</span>(<span class='ident'>index</span>) } } <span class='kw'>impl</span> <span class='ident'>fmt</span>::<span class='ident'>Debug</span> <span class='kw'>for</span> <span class='ident'>DynamicTable</span> { <span class='kw'>fn</span> <span class='ident'>fmt</span>(<span class='kw-2'>&</span><span class='self'>self</span>, <span class='ident'>formatter</span>: <span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='ident'>fmt</span>::<span class='ident'>Formatter</span>) <span class='op'>-></span> <span class='ident'>fmt</span>::<span class='prelude-ty'>Result</span> { <span class='macro'>write</span><span class='macro'>!</span>(<span class='ident'>formatter</span>, <span class='string'>"{:?}"</span>, <span class='self'>self</span>.<span class='ident'>table</span>) } } <span class='doccomment'>/// Represents the type of the static table, as defined by the HPACK spec.</span> <span class='kw'>type</span> <span class='ident'>StaticTable</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> <span class='op'>=</span> <span class='kw-2'>&</span><span class='lifetime'>'a</span> [(<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])]; <span class='doccomment'>/// Implements an iterator through the entire `HeaderTable`.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// Yields first the elements from the static table, followed by elements from</span> <span class='doccomment'>/// the dynamic table, with each element being of type `(&[u8], &[u8])`.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// This struct is tightly coupled to the implementation of the `HeaderTable`,</span> <span class='doccomment'>/// but its clients are shielded from all that and have a convenient (and</span> <span class='doccomment'>/// standardized) interface to iterate through all headers of the table.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The declaration of the inner iterator that is wrapped by this struct is a</span> <span class='doccomment'>/// monstrosity, that is required because "abstract return types" don't exist</span> <span class='doccomment'>/// yet ([https://github.com/rust-lang/rfcs/pull/105]).</span> <span class='kw'>struct</span> <span class='ident'>HeaderTableIter</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='comment'>// Represents a chain of static-table -> dynamic-table elements.</span> <span class='comment'>// The mapper is required to transform the elements yielded from the static</span> <span class='comment'>// table to a type that matches the elements yielded from the dynamic table.</span> <span class='ident'>inner</span>: <span class='ident'>iter</span>::<span class='ident'>Chain</span><span class='op'><</span> <span class='ident'>iter</span>::<span class='ident'>Map</span><span class='op'><</span> <span class='ident'>slice</span>::<span class='ident'>Iter</span><span class='op'><</span><span class='lifetime'>'a</span>, (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])<span class='op'>></span>, <span class='kw'>fn</span>((<span class='kw-2'>&</span><span class='lifetime'>'a</span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>]))) <span class='op'>-></span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])<span class='op'>></span>, <span class='ident'>DynamicTableIter</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>>></span>, } <span class='kw'>impl</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> <span class='ident'>Iterator</span> <span class='kw'>for</span> <span class='ident'>HeaderTableIter</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='kw'>type</span> <span class='ident'>Item</span> <span class='op'>=</span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>]); <span class='kw'>fn</span> <span class='ident'>next</span>(<span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='self'>self</span>) <span class='op'>-></span> <span class='prelude-ty'>Option</span><span class='op'><</span>(<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])<span class='op'>></span> { <span class='comment'>// Simply delegates to the wrapped iterator that is constructed by the</span> <span class='comment'>// `HeaderTable` and passed into the `HeaderTableIter`.</span> <span class='self'>self</span>.<span class='ident'>inner</span>.<span class='ident'>next</span>() } } <span class='doccomment'>/// A helper function that maps a borrowed tuple containing two borrowed slices</span> <span class='doccomment'>/// to just a tuple of two borrowed slices.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// This helper function is needed because in order to define the type</span> <span class='doccomment'>/// `HeaderTableIter` we need to be able to refer to a real type for the Fn</span> <span class='doccomment'>/// template parameter, which means that when instantiating an instance, a</span> <span class='doccomment'>/// closure cannot be passed, since it cannot be named.</span> <span class='kw'>fn</span> <span class='ident'>static_table_mapper</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span>(<span class='ident'>h</span>: <span class='kw-2'>&</span><span class='lifetime'>'a</span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])) <span class='op'>-></span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>]) { <span class='op'>*</span><span class='ident'>h</span> } <span class='doccomment'>/// The struct represents the header table obtained by merging the static and</span> <span class='doccomment'>/// dynamic tables into a single index address space, as described in section</span> <span class='doccomment'>/// `2.3.3.` of the HPACK spec.</span> <span class='kw'>struct</span> <span class='ident'>HeaderTable</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='ident'>static_table</span>: <span class='ident'>StaticTable</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span>, <span class='ident'>dynamic_table</span>: <span class='ident'>DynamicTable</span>, } <span class='kw'>impl</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> <span class='ident'>HeaderTable</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='doccomment'>/// Creates a new header table where the static part is initialized with</span> <span class='doccomment'>/// the given static table.</span> <span class='kw'>pub</span> <span class='kw'>fn</span> <span class='ident'>with_static_table</span>(<span class='ident'>static_table</span>: <span class='ident'>StaticTable</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span>) <span class='op'>-></span> <span class='ident'>HeaderTable</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='ident'>HeaderTable</span> { <span class='ident'>static_table</span>: <span class='ident'>static_table</span>, <span class='ident'>dynamic_table</span>: <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(), } } <span class='doccomment'>/// Returns an iterator through *all* headers stored in the header table,</span> <span class='doccomment'>/// i.e. it includes both the ones found in the static table and the</span> <span class='doccomment'>/// dynamic table, in the order of their indices in the single address</span> <span class='doccomment'>/// space (first the headers in the static table, followed by headers in</span> <span class='doccomment'>/// the dynamic table).</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The type yielded by the iterator is `(&[u8], &[u8])`, where the tuple</span> <span class='doccomment'>/// corresponds to the header name, value pairs in the described order.</span> <span class='kw'>pub</span> <span class='kw'>fn</span> <span class='ident'>iter</span>(<span class='kw-2'>&</span><span class='lifetime'>'a</span> <span class='self'>self</span>) <span class='op'>-></span> <span class='ident'>HeaderTableIter</span><span class='op'><</span><span class='lifetime'>'a</span><span class='op'>></span> { <span class='ident'>HeaderTableIter</span> { <span class='ident'>inner</span>: <span class='self'>self</span>.<span class='ident'>static_table</span>.<span class='ident'>iter</span>() .<span class='ident'>map</span>(<span class='ident'>static_table_mapper</span> <span class='kw'>as</span> <span class='kw'>fn</span>((<span class='kw-2'>&</span><span class='lifetime'>'a</span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>]))) <span class='op'>-></span> (<span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'a</span> [<span class='ident'>u8</span>])) .<span class='ident'>chain</span>(<span class='self'>self</span>.<span class='ident'>dynamic_table</span>.<span class='ident'>iter</span>()), } } <span class='doccomment'>/// Adds the given header to the table. Of course, this means that the new</span> <span class='doccomment'>/// header is added to the dynamic part of the table.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// If the size of the new header is larger than the current maximum table</span> <span class='doccomment'>/// size of the dynamic table, the effect will be that the dynamic table</span> <span class='doccomment'>/// gets emptied and the new header does *not* get inserted into it.</span> <span class='attribute'>#[<span class='ident'>inline</span>]</span> <span class='kw'>pub</span> <span class='kw'>fn</span> <span class='ident'>add_header</span>(<span class='kw-2'>&</span><span class='kw-2'>mut</span> <span class='self'>self</span>, <span class='ident'>name</span>: <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>, <span class='ident'>value</span>: <span class='ident'>Vec</span><span class='op'><</span><span class='ident'>u8</span><span class='op'>></span>) { <span class='self'>self</span>.<span class='ident'>dynamic_table</span>.<span class='ident'>add_header</span>(<span class='ident'>name</span>, <span class='ident'>value</span>); } <span class='doccomment'>/// Returns a reference to the header (a `(name, value)` pair) with the</span> <span class='doccomment'>/// given index in the table.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// The table is 1-indexed and constructed in such a way that the first</span> <span class='doccomment'>/// entries belong to the static table, followed by entries in the dynamic</span> <span class='doccomment'>/// table. They are merged into a single index address space, though.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// This is according to the [HPACK spec, section 2.3.3.]</span> <span class='doccomment'>/// (http://http2.github.io/http2-spec/compression.html#index.address.space)</span> <span class='kw'>pub</span> <span class='kw'>fn</span> <span class='ident'>get_from_table</span>(<span class='kw-2'>&</span><span class='self'>self</span>, <span class='ident'>index</span>: <span class='ident'>usize</span>) <span class='op'>-></span> <span class='prelude-ty'>Option</span><span class='op'><</span>(<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>])<span class='op'>></span> { <span class='comment'>// The IETF defined table indexing as 1-based.</span> <span class='comment'>// So, before starting, make sure the given index is within the proper</span> <span class='comment'>// bounds.</span> <span class='kw'>let</span> <span class='ident'>real_index</span> <span class='op'>=</span> <span class='kw'>if</span> <span class='ident'>index</span> <span class='op'>></span> <span class='number'>0</span> { <span class='ident'>index</span> <span class='op'>-</span> <span class='number'>1</span> } <span class='kw'>else</span> { <span class='kw'>return</span> <span class='prelude-val'>None</span> }; <span class='kw'>if</span> <span class='ident'>real_index</span> <span class='op'><</span> <span class='self'>self</span>.<span class='ident'>static_table</span>.<span class='ident'>len</span>() { <span class='comment'>// It is in the static table so just return that...</span> <span class='prelude-val'>Some</span>(<span class='self'>self</span>.<span class='ident'>static_table</span>[<span class='ident'>real_index</span>]) } <span class='kw'>else</span> { <span class='comment'>// Maybe it's in the dynamic table then?</span> <span class='kw'>let</span> <span class='ident'>dynamic_index</span> <span class='op'>=</span> <span class='ident'>real_index</span> <span class='op'>-</span> <span class='self'>self</span>.<span class='ident'>static_table</span>.<span class='ident'>len</span>(); <span class='kw'>if</span> <span class='ident'>dynamic_index</span> <span class='op'><</span> <span class='self'>self</span>.<span class='ident'>dynamic_table</span>.<span class='ident'>len</span>() { <span class='kw'>match</span> <span class='self'>self</span>.<span class='ident'>dynamic_table</span>.<span class='ident'>get</span>(<span class='ident'>dynamic_index</span>) { <span class='prelude-val'>Some</span>(<span class='kw-2'>&</span>(<span class='kw-2'>ref</span> <span class='ident'>name</span>, <span class='kw-2'>ref</span> <span class='ident'>value</span>)) <span class='op'>=></span> { <span class='prelude-val'>Some</span>((<span class='ident'>name</span>, <span class='ident'>value</span>)) }, <span class='prelude-val'>None</span> <span class='op'>=></span> <span class='prelude-val'>None</span> } } <span class='kw'>else</span> { <span class='comment'>// Index out of bounds!</span> <span class='prelude-val'>None</span> } } } <span class='doccomment'>/// Finds the given header in the header table. Tries to match both the</span> <span class='doccomment'>/// header name and value to one of the headers in the table. If no such</span> <span class='doccomment'>/// header exists, then falls back to returning one that matched only the</span> <span class='doccomment'>/// name.</span> <span class='doccomment'>///</span> <span class='doccomment'>/// # Returns</span> <span class='doccomment'>///</span> <span class='doccomment'>/// An `Option`, where `Some` corresponds to a tuple representing the index</span> <span class='doccomment'>/// of the header in the header tables (the 1-based index that HPACK uses)</span> <span class='doccomment'>/// and a `bool` indicating whether the value of the header also matched.</span> <span class='kw'>pub</span> <span class='kw'>fn</span> <span class='ident'>find_header</span>(<span class='kw-2'>&</span><span class='self'>self</span>, <span class='ident'>header</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>])) <span class='op'>-></span> <span class='prelude-ty'>Option</span><span class='op'><</span>(<span class='ident'>usize</span>, <span class='ident'>bool</span>)<span class='op'>></span> { <span class='comment'>// Just does a simple scan of the entire table, searching for a header</span> <span class='comment'>// that matches both the name and the value of the given header.</span> <span class='comment'>// If no such header is found, then any one of the headers that had a</span> <span class='comment'>// matching name is returned, with the appropriate return flag set.</span> <span class='comment'>//</span> <span class='comment'>// The tables are so small that it is unlikely that the linear scan</span> <span class='comment'>// would be a major performance bottlneck. If it does prove to be,</span> <span class='comment'>// though, a more efficient lookup/header representation method could</span> <span class='comment'>// be devised.</span> <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>matching_name</span>: <span class='prelude-ty'>Option</span><span class='op'><</span><span class='ident'>usize</span><span class='op'>></span> <span class='op'>=</span> <span class='prelude-val'>None</span>; <span class='kw'>for</span> (<span class='ident'>i</span>, <span class='ident'>h</span>) <span class='kw'>in</span> <span class='self'>self</span>.<span class='ident'>iter</span>().<span class='ident'>enumerate</span>() { <span class='kw'>if</span> <span class='ident'>header</span>.<span class='number'>0</span> <span class='op'>==</span> <span class='ident'>h</span>.<span class='number'>0</span> { <span class='kw'>if</span> <span class='ident'>header</span>.<span class='number'>1</span> <span class='op'>==</span> <span class='ident'>h</span>.<span class='number'>1</span> { <span class='comment'>// Both name and value matched: returns it immediately</span> <span class='kw'>return</span> <span class='prelude-val'>Some</span>((<span class='ident'>i</span> <span class='op'>+</span> <span class='number'>1</span>, <span class='bool-val'>true</span>)); } <span class='comment'>// If only the name was valid, we continue scanning, hoping to</span> <span class='comment'>// find one where both the name and value match. We remember</span> <span class='comment'>// this one, in case such a header isn't found after all.</span> <span class='ident'>matching_name</span> <span class='op'>=</span> <span class='prelude-val'>Some</span>(<span class='ident'>i</span> <span class='op'>+</span> <span class='number'>1</span>); } } <span class='comment'>// Finally, if there's no header with a matching name and value,</span> <span class='comment'>// return one that matched only the name, if that *was* found.</span> <span class='kw'>match</span> <span class='ident'>matching_name</span> { <span class='prelude-val'>Some</span>(<span class='ident'>i</span>) <span class='op'>=></span> <span class='prelude-val'>Some</span>((<span class='ident'>i</span>, <span class='bool-val'>false</span>)), <span class='prelude-val'>None</span> <span class='op'>=></span> <span class='prelude-val'>None</span>, } } } <span class='doccomment'>/// The table represents the static header table defined by the HPACK spec.</span> <span class='doccomment'>/// (HPACK, Appendix A)</span> <span class='kw'>static</span> <span class='ident'>STATIC_TABLE</span>: <span class='kw-2'>&</span><span class='lifetime'>'static</span> [(<span class='kw-2'>&</span><span class='lifetime'>'static</span> [<span class='ident'>u8</span>], <span class='kw-2'>&</span><span class='lifetime'>'static</span> [<span class='ident'>u8</span>])] <span class='op'>=</span> <span class='kw-2'>&</span>[ (<span class='string'>b":authority"</span>, <span class='string'>b""</span>), (<span class='string'>b":method"</span>, <span class='string'>b"GET"</span>), (<span class='string'>b":method"</span>, <span class='string'>b"POST"</span>), (<span class='string'>b":path"</span>, <span class='string'>b"/"</span>), (<span class='string'>b":path"</span>, <span class='string'>b"/index.html"</span>), (<span class='string'>b":scheme"</span>, <span class='string'>b"http"</span>), (<span class='string'>b":scheme"</span>, <span class='string'>b"https"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"200"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"204"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"206"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"304"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"400"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"404"</span>), (<span class='string'>b":status"</span>, <span class='string'>b"500"</span>), (<span class='string'>b"accept-"</span>, <span class='string'>b""</span>), (<span class='string'>b"accept-encoding"</span>, <span class='string'>b"gzip, deflate"</span>), (<span class='string'>b"accept-language"</span>, <span class='string'>b""</span>), (<span class='string'>b"accept-ranges"</span>, <span class='string'>b""</span>), (<span class='string'>b"accept"</span>, <span class='string'>b""</span>), (<span class='string'>b"access-control-allow-origin"</span>, <span class='string'>b""</span>), (<span class='string'>b"age"</span>, <span class='string'>b""</span>), (<span class='string'>b"allow"</span>, <span class='string'>b""</span>), (<span class='string'>b"authorization"</span>, <span class='string'>b""</span>), (<span class='string'>b"cache-control"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-disposition"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-encoding"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-language"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-length"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-location"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-range"</span>, <span class='string'>b""</span>), (<span class='string'>b"content-type"</span>, <span class='string'>b""</span>), (<span class='string'>b"cookie"</span>, <span class='string'>b""</span>), (<span class='string'>b"date"</span>, <span class='string'>b""</span>), (<span class='string'>b"etag"</span>, <span class='string'>b""</span>), (<span class='string'>b"expect"</span>, <span class='string'>b""</span>), (<span class='string'>b"expires"</span>, <span class='string'>b""</span>), (<span class='string'>b"from"</span>, <span class='string'>b""</span>), (<span class='string'>b"host"</span>, <span class='string'>b""</span>), (<span class='string'>b"if-match"</span>, <span class='string'>b""</span>), (<span class='string'>b"if-modified-since"</span>, <span class='string'>b""</span>), (<span class='string'>b"if-none-match"</span>, <span class='string'>b""</span>), (<span class='string'>b"if-range"</span>, <span class='string'>b""</span>), (<span class='string'>b"if-unmodified-since"</span>, <span class='string'>b""</span>), (<span class='string'>b"last-modified"</span>, <span class='string'>b""</span>), (<span class='string'>b"link"</span>, <span class='string'>b""</span>), (<span class='string'>b"location"</span>, <span class='string'>b""</span>), (<span class='string'>b"max-forwards"</span>, <span class='string'>b""</span>), (<span class='string'>b"proxy-authenticate"</span>, <span class='string'>b""</span>), (<span class='string'>b"proxy-authorization"</span>, <span class='string'>b""</span>), (<span class='string'>b"range"</span>, <span class='string'>b""</span>), (<span class='string'>b"referer"</span>, <span class='string'>b""</span>), (<span class='string'>b"refresh"</span>, <span class='string'>b""</span>), (<span class='string'>b"retry-after"</span>, <span class='string'>b""</span>), (<span class='string'>b"server"</span>, <span class='string'>b""</span>), (<span class='string'>b"set-cookie"</span>, <span class='string'>b""</span>), (<span class='string'>b"strict-transport-security"</span>, <span class='string'>b""</span>), (<span class='string'>b"transfer-encoding"</span>, <span class='string'>b""</span>), (<span class='string'>b"user-agent"</span>, <span class='string'>b""</span>), (<span class='string'>b"vary"</span>, <span class='string'>b""</span>), (<span class='string'>b"via"</span>, <span class='string'>b""</span>), (<span class='string'>b"www-authenticate"</span>, <span class='string'>b""</span>), ]; <span class='attribute'>#[<span class='ident'>cfg</span>(<span class='ident'>test</span>)]</span> <span class='kw'>mod</span> <span class='ident'>tests</span> { <span class='kw'>use</span> <span class='kw'>super</span>::<span class='ident'>DynamicTable</span>; <span class='kw'>use</span> <span class='kw'>super</span>::<span class='ident'>HeaderTable</span>; <span class='kw'>use</span> <span class='kw'>super</span>::<span class='ident'>STATIC_TABLE</span>; <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_size_calculation_simple</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(); <span class='comment'>// Sanity check</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); } <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_size_calculation</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"456"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>3</span> <span class='op'>*</span> <span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span> <span class='op'>+</span> <span class='number'>6</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); } <span class='doccomment'>/// Tests that the `DynamicTable` gets correctly resized (by evicting old</span> <span class='doccomment'>/// headers) if it exceeds the maximum size on an insertion.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_auto_resize</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>with_size</span>(<span class='number'>38</span>); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"456"</span>.<span class='ident'>to_vec</span>()); <span class='comment'>// Resized?</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>32</span> <span class='op'>+</span> <span class='number'>6</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='comment'>// Only has the second header?</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>to_vec</span>(), <span class='macro'>vec</span><span class='macro'>!</span>[ (<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"456"</span>.<span class='ident'>to_vec</span>())]); } <span class='doccomment'>/// Tests that when inserting a new header whose size is larger than the</span> <span class='doccomment'>/// size of the entire table, the table is fully emptied.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_auto_resize_into_empty</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>with_size</span>(<span class='number'>38</span>); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"4567"</span>.<span class='ident'>to_vec</span>()); <span class='comment'>// Resized and empty?</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>to_vec</span>().<span class='ident'>len</span>()); } <span class='doccomment'>/// Tests that when changing the maximum size of the `DynamicTable`, the</span> <span class='doccomment'>/// headers are correctly evicted in order to keep its size below the new</span> <span class='doccomment'>/// max.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_change_max_size</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"456"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"c"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"d"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>3</span> <span class='op'>*</span> <span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span> <span class='op'>+</span> <span class='number'>6</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='ident'>table</span>.<span class='ident'>set_max_table_size</span>(<span class='number'>38</span>); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>to_vec</span>(), <span class='macro'>vec</span><span class='macro'>!</span>[ (<span class='string'>b"c"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"d"</span>.<span class='ident'>to_vec</span>())]); } <span class='doccomment'>/// Tests that setting the maximum table size to 0 clears the dynamic</span> <span class='doccomment'>/// table.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_clear</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"456"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"c"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"d"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>3</span> <span class='op'>*</span> <span class='number'>32</span> <span class='op'>+</span> <span class='number'>2</span> <span class='op'>+</span> <span class='number'>6</span> <span class='op'>+</span> <span class='number'>2</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='ident'>table</span>.<span class='ident'>set_max_table_size</span>(<span class='number'>0</span>); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>len</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>to_vec</span>().<span class='ident'>len</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>get_max_table_size</span>()); } <span class='doccomment'>/// Tests that when the initial max size of the table is 0, nothing</span> <span class='doccomment'>/// can be added to the table.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_max_size_zero</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>with_size</span>(<span class='number'>0</span>); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>len</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>to_vec</span>().<span class='ident'>len</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>get_size</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>0</span>, <span class='ident'>table</span>.<span class='ident'>get_max_table_size</span>()); } <span class='doccomment'>/// Tests that the iterator through the `DynamicTable` works when there are</span> <span class='doccomment'>/// some elements in the dynamic table.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_iter_with_elems</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"123"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"456"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='string'>b"c"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"d"</span>.<span class='ident'>to_vec</span>()); <span class='kw'>let</span> <span class='ident'>iter_res</span>: <span class='ident'>Vec</span><span class='op'><</span>(<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>])<span class='op'>></span> <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>iter</span>().<span class='ident'>collect</span>(); <span class='kw'>let</span> <span class='ident'>expected</span>: <span class='ident'>Vec</span><span class='op'><</span>(<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>])<span class='op'>></span> <span class='op'>=</span> <span class='macro'>vec</span><span class='macro'>!</span>[ (<span class='string'>b"c"</span>, <span class='string'>b"d"</span>), (<span class='string'>b"123"</span>, <span class='string'>b"456"</span>), (<span class='string'>b"a"</span>, <span class='string'>b"b"</span>), ]; <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>iter_res</span>, <span class='ident'>expected</span>); } <span class='doccomment'>/// Tests that the iterator through the `DynamicTable` works when there are</span> <span class='doccomment'>/// no elements in the dynamic table.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_dynamic_table_iter_no_elems</span>() { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>DynamicTable</span>::<span class='ident'>new</span>(); <span class='kw'>let</span> <span class='ident'>iter_res</span>: <span class='ident'>Vec</span><span class='op'><</span>(<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>])<span class='op'>></span> <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>iter</span>().<span class='ident'>collect</span>(); <span class='kw'>let</span> <span class='ident'>expected</span> <span class='op'>=</span> <span class='macro'>vec</span><span class='macro'>!</span>[]; <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>iter_res</span>, <span class='ident'>expected</span>); } <span class='doccomment'>/// Tests that indexing the header table with indices that correspond to</span> <span class='doccomment'>/// entries found in the static table works.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_header_table_index_static</span>() { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>for</span> (<span class='ident'>index</span>, <span class='ident'>entry</span>) <span class='kw'>in</span> <span class='ident'>STATIC_TABLE</span>.<span class='ident'>iter</span>().<span class='ident'>enumerate</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>get_from_table</span>(<span class='ident'>index</span> <span class='op'>+</span> <span class='number'>1</span>).<span class='ident'>unwrap</span>(), <span class='op'>*</span><span class='ident'>entry</span>); } } <span class='doccomment'>/// Tests that when the given index is out of bounds, the `HeaderTable`</span> <span class='doccomment'>/// returns a `None`</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_header_table_index_out_of_bounds</span>() { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='macro'>assert</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>get_from_table</span>(<span class='number'>0</span>).<span class='ident'>is_none</span>()); <span class='macro'>assert</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>get_from_table</span>(<span class='ident'>STATIC_TABLE</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='number'>1</span>).<span class='ident'>is_none</span>()); } <span class='doccomment'>/// Tests that adding entries to the dynamic table through the</span> <span class='doccomment'>/// `HeaderTable` interface works.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_header_table_add_to_dynamic</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>header</span> <span class='op'>=</span> (<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='ident'>header</span>.<span class='number'>0</span>.<span class='ident'>clone</span>(), <span class='ident'>header</span>.<span class='number'>1</span>.<span class='ident'>clone</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>dynamic_table</span>.<span class='ident'>to_vec</span>(), <span class='macro'>vec</span><span class='macro'>!</span>[<span class='ident'>header</span>]); } <span class='doccomment'>/// Tests that indexing the header table with indices that correspond to</span> <span class='doccomment'>/// entries found in the dynamic table works.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_header_table_index_dynamic</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>header</span> <span class='op'>=</span> (<span class='string'>b"a"</span>.<span class='ident'>to_vec</span>(), <span class='string'>b"b"</span>.<span class='ident'>to_vec</span>()); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='ident'>header</span>.<span class='number'>0</span>.<span class='ident'>clone</span>(), <span class='ident'>header</span>.<span class='number'>1</span>.<span class='ident'>clone</span>()); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>get_from_table</span>(<span class='ident'>STATIC_TABLE</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='number'>1</span>).<span class='ident'>unwrap</span>(), ((<span class='kw-2'>&</span><span class='ident'>header</span>.<span class='number'>0</span>[..], <span class='kw-2'>&</span><span class='ident'>header</span>.<span class='number'>1</span>[..]))); } <span class='doccomment'>/// Tests that the `iter` method of the `HeaderTable` returns an iterator</span> <span class='doccomment'>/// through *all* the headers found in the header table (static and dynamic</span> <span class='doccomment'>/// tables both included)</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_header_table_iter</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>headers</span>: [(<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]); <span class='number'>2</span>] <span class='op'>=</span> [ (<span class='string'>b"a"</span>, <span class='string'>b"b"</span>), (<span class='string'>b"c"</span>, <span class='string'>b"d"</span>), ]; <span class='kw'>for</span> <span class='ident'>header</span> <span class='kw'>in</span> <span class='ident'>headers</span>.<span class='ident'>iter</span>() { <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='ident'>header</span>.<span class='number'>0</span>.<span class='ident'>to_vec</span>(), <span class='ident'>header</span>.<span class='number'>1</span>.<span class='ident'>to_vec</span>()); } <span class='kw'>let</span> <span class='ident'>iterated</span>: <span class='ident'>Vec</span><span class='op'><</span>(<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>])<span class='op'>></span> <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>iter</span>().<span class='ident'>collect</span>(); <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>iterated</span>.<span class='ident'>len</span>(), <span class='ident'>headers</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='ident'>STATIC_TABLE</span>.<span class='ident'>len</span>()); <span class='comment'>// Part of the static table correctly iterated through</span> <span class='kw'>for</span> (<span class='ident'>h1</span>, <span class='ident'>h2</span>) <span class='kw'>in</span> <span class='ident'>iterated</span>.<span class='ident'>iter</span>().<span class='ident'>zip</span>(<span class='ident'>STATIC_TABLE</span>.<span class='ident'>iter</span>()) { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>h1</span>, <span class='ident'>h2</span>); } <span class='comment'>// Part of the dynamic table correctly iterated through: the elements</span> <span class='comment'>// are in reversed order of insertion in the dynamic table.</span> <span class='kw'>for</span> (<span class='ident'>h1</span>, <span class='ident'>h2</span>) <span class='kw'>in</span> <span class='ident'>iterated</span>.<span class='ident'>iter</span>().<span class='ident'>skip</span>(<span class='ident'>STATIC_TABLE</span>.<span class='ident'>len</span>()) .<span class='ident'>zip</span>(<span class='ident'>headers</span>.<span class='ident'>iter</span>().<span class='ident'>rev</span>()) { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>h1</span>, <span class='ident'>h2</span>); } } <span class='doccomment'>/// Tests that searching for an entry in the header table, which should be</span> <span class='doccomment'>/// fully in the static table (both name and value), works correctly.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_find_header_static_full</span>() { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>for</span> (<span class='ident'>i</span>, <span class='ident'>h</span>) <span class='kw'>in</span> <span class='ident'>STATIC_TABLE</span>.<span class='ident'>iter</span>().<span class='ident'>enumerate</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='op'>*</span><span class='ident'>h</span>).<span class='ident'>unwrap</span>(), (<span class='ident'>i</span> <span class='op'>+</span> <span class='number'>1</span>, <span class='bool-val'>true</span>)); } } <span class='doccomment'>/// Tests that searching for an entry in the header table, which should be</span> <span class='doccomment'>/// only partially in the static table (only the name), works correctly.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_find_header_static_partial</span>() { { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>h</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]) <span class='op'>=</span> (<span class='string'>b":method"</span>, <span class='string'>b"PUT"</span>); <span class='kw'>if</span> <span class='kw'>let</span> (<span class='ident'>index</span>, <span class='bool-val'>false</span>) <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='ident'>h</span>).<span class='ident'>unwrap</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>h</span>.<span class='number'>0</span>, <span class='ident'>STATIC_TABLE</span>[<span class='ident'>index</span> <span class='op'>-</span> <span class='number'>1</span>].<span class='number'>0</span>); <span class='comment'>// The index is the last one with the corresponding name</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>3</span>, <span class='ident'>index</span>); } <span class='kw'>else</span> { <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"The header should have matched only partially"</span>); } } { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>h</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]) <span class='op'>=</span> (<span class='string'>b":status"</span>, <span class='string'>b"333"</span>); <span class='kw'>if</span> <span class='kw'>let</span> (<span class='ident'>index</span>, <span class='bool-val'>false</span>) <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='ident'>h</span>).<span class='ident'>unwrap</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>h</span>.<span class='number'>0</span>, <span class='ident'>STATIC_TABLE</span>[<span class='ident'>index</span> <span class='op'>-</span> <span class='number'>1</span>].<span class='number'>0</span>); <span class='comment'>// The index is the last one with the corresponding name</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='number'>14</span>, <span class='ident'>index</span>); } <span class='kw'>else</span> { <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"The header should have matched only partially"</span>); } } { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>h</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]) <span class='op'>=</span> (<span class='string'>b":authority"</span>, <span class='string'>b"example.com"</span>); <span class='kw'>if</span> <span class='kw'>let</span> (<span class='ident'>index</span>, <span class='bool-val'>false</span>) <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='ident'>h</span>).<span class='ident'>unwrap</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>h</span>.<span class='number'>0</span>, <span class='ident'>STATIC_TABLE</span>[<span class='ident'>index</span> <span class='op'>-</span> <span class='number'>1</span>].<span class='number'>0</span>); } <span class='kw'>else</span> { <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"The header should have matched only partially"</span>); } } { <span class='kw'>let</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>h</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]) <span class='op'>=</span> (<span class='string'>b"www-authenticate"</span>, <span class='string'>b"asdf"</span>); <span class='kw'>if</span> <span class='kw'>let</span> (<span class='ident'>index</span>, <span class='bool-val'>false</span>) <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='ident'>h</span>).<span class='ident'>unwrap</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>h</span>.<span class='number'>0</span>, <span class='ident'>STATIC_TABLE</span>[<span class='ident'>index</span> <span class='op'>-</span> <span class='number'>1</span>].<span class='number'>0</span>); } <span class='kw'>else</span> { <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"The header should have matched only partially"</span>); } } } <span class='doccomment'>/// Tests that searching for an entry in the header table, which should be</span> <span class='doccomment'>/// fully in the dynamic table (both name and value), works correctly.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_find_header_dynamic_full</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='kw'>let</span> <span class='ident'>h</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]) <span class='op'>=</span> (<span class='string'>b":method"</span>, <span class='string'>b"PUT"</span>); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='ident'>h</span>.<span class='number'>0</span>.<span class='ident'>to_vec</span>(), <span class='ident'>h</span>.<span class='number'>1</span>.<span class='ident'>to_vec</span>()); <span class='kw'>if</span> <span class='kw'>let</span> (<span class='ident'>index</span>, <span class='bool-val'>true</span>) <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='ident'>h</span>).<span class='ident'>unwrap</span>() { <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>index</span>, <span class='ident'>STATIC_TABLE</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='number'>1</span>); } <span class='kw'>else</span> { <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"The header should have matched fully"</span>); } } <span class='doccomment'>/// Tests that searching for an entry in the header table, which should be</span> <span class='doccomment'>/// only partially in the dynamic table (only the name), works correctly.</span> <span class='attribute'>#[<span class='ident'>test</span>]</span> <span class='kw'>fn</span> <span class='ident'>test_find_header_dynamic_partial</span>() { <span class='kw'>let</span> <span class='kw-2'>mut</span> <span class='ident'>table</span> <span class='op'>=</span> <span class='ident'>HeaderTable</span>::<span class='ident'>with_static_table</span>(<span class='ident'>STATIC_TABLE</span>); <span class='comment'>// First add it to the dynamic table</span> { <span class='kw'>let</span> <span class='ident'>h</span> <span class='op'>=</span> (<span class='string'>b"X-Custom-Header"</span>, <span class='string'>b"stuff"</span>); <span class='ident'>table</span>.<span class='ident'>add_header</span>(<span class='ident'>h</span>.<span class='number'>0</span>.<span class='ident'>to_vec</span>(), <span class='ident'>h</span>.<span class='number'>1</span>.<span class='ident'>to_vec</span>()); } <span class='comment'>// Prepare a search</span> <span class='kw'>let</span> <span class='ident'>h</span>: (<span class='kw-2'>&</span>[<span class='ident'>u8</span>], <span class='kw-2'>&</span>[<span class='ident'>u8</span>]) <span class='op'>=</span> (<span class='string'>b"X-Custom-Header"</span>, <span class='string'>b"different-stuff"</span>); <span class='comment'>// It must match only partially</span> <span class='kw'>if</span> <span class='kw'>let</span> (<span class='ident'>index</span>, <span class='bool-val'>false</span>) <span class='op'>=</span> <span class='ident'>table</span>.<span class='ident'>find_header</span>(<span class='ident'>h</span>).<span class='ident'>unwrap</span>() { <span class='comment'>// The index must be the first one in the dynamic table</span> <span class='comment'>// segment of the header table.</span> <span class='macro'>assert_eq</span><span class='macro'>!</span>(<span class='ident'>index</span>, <span class='ident'>STATIC_TABLE</span>.<span class='ident'>len</span>() <span class='op'>+</span> <span class='number'>1</span>); } <span class='kw'>else</span> { <span class='macro'>panic</span><span class='macro'>!</span>(<span class='string'>"The header should have matched only partially"</span>); } } } </pre> </section> <section id='search' class="content hidden"></section> <section class="footer"></section> <aside id="help" class="hidden"> <div> <h1 class="hidden">Help</h1> <div class="shortcuts"> <h2>Keyboard Shortcuts</h2> <dl> <dt>?</dt> <dd>Show this help dialog</dd> <dt>S</dt> <dd>Focus the search field</dd> <dt>⇤</dt> <dd>Move up in search results</dd> <dt>⇥</dt> <dd>Move down in search results</dd> <dt>⏎</dt> <dd>Go to active search result</dd> <dt>+</dt> <dd>Collapse/expand all sections</dd> </dl> </div> <div class="infos"> <h2>Search Tricks</h2> <p> Prefix searches with a type followed by a colon (e.g. <code>fn:</code>) to restrict the search to a given type. </p> <p> Accepted types are: <code>fn</code>, <code>mod</code>, <code>struct</code>, <code>enum</code>, <code>trait</code>, <code>type</code>, <code>macro</code>, and <code>const</code>. </p> <p> Search functions by type signature (e.g. <code>vec -> usize</code> or <code>* -> vec</code>) </p> </div> </div> </aside> <script> window.rootPath = "../../"; window.currentCrate = "hpack"; window.playgroundUrl = ""; </script> <script src="../../jquery.js"></script> <script src="../../main.js"></script> <script defer src="../../search-index.js"></script> </body> </html>