<!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 `src/liballoc/binary_heap.rs`.">
<meta name="keywords" content="rust, rustlang, rust-lang">
<title>binary_heap.rs.html -- source</title>
<link rel="stylesheet" type="text/css" href="../../normalize.css">
<link rel="stylesheet" type="text/css" href="../../rustdoc.css">
<link rel="stylesheet" type="text/css" href="../../main.css">
<link rel="shortcut icon" href="https://doc.rust-lang.org/favicon.ico">
</head>
<body class="rustdoc source">
<!--[if lte IE 8]>
<div class="warning">
This old browser is unsupported and will most likely display funky
things.
</div>
<![endif]-->
<nav class="sidebar">
<a href='../../alloc/index.html'><img src='https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png' alt='logo' width='100'></a>
</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"><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>
<span id="762"> 762</span>
<span id="763"> 763</span>
<span id="764"> 764</span>
<span id="765"> 765</span>
<span id="766"> 766</span>
<span id="767"> 767</span>
<span id="768"> 768</span>
<span id="769"> 769</span>
<span id="770"> 770</span>
<span id="771"> 771</span>
<span id="772"> 772</span>
<span id="773"> 773</span>
<span id="774"> 774</span>
<span id="775"> 775</span>
<span id="776"> 776</span>
<span id="777"> 777</span>
<span id="778"> 778</span>
<span id="779"> 779</span>
<span id="780"> 780</span>
<span id="781"> 781</span>
<span id="782"> 782</span>
<span id="783"> 783</span>
<span id="784"> 784</span>
<span id="785"> 785</span>
<span id="786"> 786</span>
<span id="787"> 787</span>
<span id="788"> 788</span>
<span id="789"> 789</span>
<span id="790"> 790</span>
<span id="791"> 791</span>
<span id="792"> 792</span>
<span id="793"> 793</span>
<span id="794"> 794</span>
<span id="795"> 795</span>
<span id="796"> 796</span>
<span id="797"> 797</span>
<span id="798"> 798</span>
<span id="799"> 799</span>
<span id="800"> 800</span>
<span id="801"> 801</span>
<span id="802"> 802</span>
<span id="803"> 803</span>
<span id="804"> 804</span>
<span id="805"> 805</span>
<span id="806"> 806</span>
<span id="807"> 807</span>
<span id="808"> 808</span>
<span id="809"> 809</span>
<span id="810"> 810</span>
<span id="811"> 811</span>
<span id="812"> 812</span>
<span id="813"> 813</span>
<span id="814"> 814</span>
<span id="815"> 815</span>
<span id="816"> 816</span>
<span id="817"> 817</span>
<span id="818"> 818</span>
<span id="819"> 819</span>
<span id="820"> 820</span>
<span id="821"> 821</span>
<span id="822"> 822</span>
<span id="823"> 823</span>
<span id="824"> 824</span>
<span id="825"> 825</span>
<span id="826"> 826</span>
<span id="827"> 827</span>
<span id="828"> 828</span>
<span id="829"> 829</span>
<span id="830"> 830</span>
<span id="831"> 831</span>
<span id="832"> 832</span>
<span id="833"> 833</span>
<span id="834"> 834</span>
<span id="835"> 835</span>
<span id="836"> 836</span>
<span id="837"> 837</span>
<span id="838"> 838</span>
<span id="839"> 839</span>
<span id="840"> 840</span>
<span id="841"> 841</span>
<span id="842"> 842</span>
<span id="843"> 843</span>
<span id="844"> 844</span>
<span id="845"> 845</span>
<span id="846"> 846</span>
<span id="847"> 847</span>
<span id="848"> 848</span>
<span id="849"> 849</span>
<span id="850"> 850</span>
<span id="851"> 851</span>
<span id="852"> 852</span>
<span id="853"> 853</span>
<span id="854"> 854</span>
<span id="855"> 855</span>
<span id="856"> 856</span>
<span id="857"> 857</span>
<span id="858"> 858</span>
<span id="859"> 859</span>
<span id="860"> 860</span>
<span id="861"> 861</span>
<span id="862"> 862</span>
<span id="863"> 863</span>
<span id="864"> 864</span>
<span id="865"> 865</span>
<span id="866"> 866</span>
<span id="867"> 867</span>
<span id="868"> 868</span>
<span id="869"> 869</span>
<span id="870"> 870</span>
<span id="871"> 871</span>
<span id="872"> 872</span>
<span id="873"> 873</span>
<span id="874"> 874</span>
<span id="875"> 875</span>
<span id="876"> 876</span>
<span id="877"> 877</span>
<span id="878"> 878</span>
<span id="879"> 879</span>
<span id="880"> 880</span>
<span id="881"> 881</span>
<span id="882"> 882</span>
<span id="883"> 883</span>
<span id="884"> 884</span>
<span id="885"> 885</span>
<span id="886"> 886</span>
<span id="887"> 887</span>
<span id="888"> 888</span>
<span id="889"> 889</span>
<span id="890"> 890</span>
<span id="891"> 891</span>
<span id="892"> 892</span>
<span id="893"> 893</span>
<span id="894"> 894</span>
<span id="895"> 895</span>
<span id="896"> 896</span>
<span id="897"> 897</span>
<span id="898"> 898</span>
<span id="899"> 899</span>
<span id="900"> 900</span>
<span id="901"> 901</span>
<span id="902"> 902</span>
<span id="903"> 903</span>
<span id="904"> 904</span>
<span id="905"> 905</span>
<span id="906"> 906</span>
<span id="907"> 907</span>
<span id="908"> 908</span>
<span id="909"> 909</span>
<span id="910"> 910</span>
<span id="911"> 911</span>
<span id="912"> 912</span>
<span id="913"> 913</span>
<span id="914"> 914</span>
<span id="915"> 915</span>
<span id="916"> 916</span>
<span id="917"> 917</span>
<span id="918"> 918</span>
<span id="919"> 919</span>
<span id="920"> 920</span>
<span id="921"> 921</span>
<span id="922"> 922</span>
<span id="923"> 923</span>
<span id="924"> 924</span>
<span id="925"> 925</span>
<span id="926"> 926</span>
<span id="927"> 927</span>
<span id="928"> 928</span>
<span id="929"> 929</span>
<span id="930"> 930</span>
<span id="931"> 931</span>
<span id="932"> 932</span>
<span id="933"> 933</span>
<span id="934"> 934</span>
<span id="935"> 935</span>
<span id="936"> 936</span>
<span id="937"> 937</span>
<span id="938"> 938</span>
<span id="939"> 939</span>
<span id="940"> 940</span>
<span id="941"> 941</span>
<span id="942"> 942</span>
<span id="943"> 943</span>
<span id="944"> 944</span>
<span id="945"> 945</span>
<span id="946"> 946</span>
<span id="947"> 947</span>
<span id="948"> 948</span>
<span id="949"> 949</span>
<span id="950"> 950</span>
<span id="951"> 951</span>
<span id="952"> 952</span>
<span id="953"> 953</span>
<span id="954"> 954</span>
<span id="955"> 955</span>
<span id="956"> 956</span>
<span id="957"> 957</span>
<span id="958"> 958</span>
<span id="959"> 959</span>
<span id="960"> 960</span>
<span id="961"> 961</span>
<span id="962"> 962</span>
<span id="963"> 963</span>
<span id="964"> 964</span>
<span id="965"> 965</span>
<span id="966"> 966</span>
<span id="967"> 967</span>
<span id="968"> 968</span>
<span id="969"> 969</span>
<span id="970"> 970</span>
<span id="971"> 971</span>
<span id="972"> 972</span>
<span id="973"> 973</span>
<span id="974"> 974</span>
<span id="975"> 975</span>
<span id="976"> 976</span>
<span id="977"> 977</span>
<span id="978"> 978</span>
<span id="979"> 979</span>
<span id="980"> 980</span>
<span id="981"> 981</span>
<span id="982"> 982</span>
<span id="983"> 983</span>
<span id="984"> 984</span>
<span id="985"> 985</span>
<span id="986"> 986</span>
<span id="987"> 987</span>
<span id="988"> 988</span>
<span id="989"> 989</span>
<span id="990"> 990</span>
<span id="991"> 991</span>
<span id="992"> 992</span>
<span id="993"> 993</span>
<span id="994"> 994</span>
<span id="995"> 995</span>
<span id="996"> 996</span>
<span id="997"> 997</span>
<span id="998"> 998</span>
<span id="999"> 999</span>
<span id="1000">1000</span>
<span id="1001">1001</span>
<span id="1002">1002</span>
<span id="1003">1003</span>
<span id="1004">1004</span>
<span id="1005">1005</span>
<span id="1006">1006</span>
<span id="1007">1007</span>
<span id="1008">1008</span>
<span id="1009">1009</span>
<span id="1010">1010</span>
<span id="1011">1011</span>
<span id="1012">1012</span>
<span id="1013">1013</span>
<span id="1014">1014</span>
<span id="1015">1015</span>
<span id="1016">1016</span>
<span id="1017">1017</span>
<span id="1018">1018</span>
<span id="1019">1019</span>
<span id="1020">1020</span>
<span id="1021">1021</span>
<span id="1022">1022</span>
<span id="1023">1023</span>
<span id="1024">1024</span>
<span id="1025">1025</span>
<span id="1026">1026</span>
<span id="1027">1027</span>
<span id="1028">1028</span>
<span id="1029">1029</span>
<span id="1030">1030</span>
<span id="1031">1031</span>
<span id="1032">1032</span>
<span id="1033">1033</span>
<span id="1034">1034</span>
<span id="1035">1035</span>
<span id="1036">1036</span>
<span id="1037">1037</span>
<span id="1038">1038</span>
<span id="1039">1039</span>
<span id="1040">1040</span>
<span id="1041">1041</span>
<span id="1042">1042</span>
<span id="1043">1043</span>
<span id="1044">1044</span>
<span id="1045">1045</span>
<span id="1046">1046</span>
<span id="1047">1047</span>
<span id="1048">1048</span>
<span id="1049">1049</span>
<span id="1050">1050</span>
<span id="1051">1051</span>
<span id="1052">1052</span>
<span id="1053">1053</span>
<span id="1054">1054</span>
<span id="1055">1055</span>
<span id="1056">1056</span>
<span id="1057">1057</span>
<span id="1058">1058</span>
<span id="1059">1059</span>
<span id="1060">1060</span>
<span id="1061">1061</span>
<span id="1062">1062</span>
<span id="1063">1063</span>
<span id="1064">1064</span>
<span id="1065">1065</span>
<span id="1066">1066</span>
<span id="1067">1067</span>
<span id="1068">1068</span>
<span id="1069">1069</span>
<span id="1070">1070</span>
<span id="1071">1071</span>
<span id="1072">1072</span>
<span id="1073">1073</span>
<span id="1074">1074</span>
<span id="1075">1075</span>
<span id="1076">1076</span>
<span id="1077">1077</span>
<span id="1078">1078</span>
<span id="1079">1079</span>
<span id="1080">1080</span>
<span id="1081">1081</span>
<span id="1082">1082</span>
<span id="1083">1083</span>
<span id="1084">1084</span>
<span id="1085">1085</span>
<span id="1086">1086</span>
<span id="1087">1087</span>
<span id="1088">1088</span>
<span id="1089">1089</span>
<span id="1090">1090</span>
<span id="1091">1091</span>
<span id="1092">1092</span>
<span id="1093">1093</span>
<span id="1094">1094</span>
<span id="1095">1095</span>
<span id="1096">1096</span>
<span id="1097">1097</span>
<span id="1098">1098</span>
<span id="1099">1099</span>
<span id="1100">1100</span>
<span id="1101">1101</span>
<span id="1102">1102</span>
<span id="1103">1103</span>
<span id="1104">1104</span>
<span id="1105">1105</span>
<span id="1106">1106</span>
<span id="1107">1107</span>
<span id="1108">1108</span>
<span id="1109">1109</span>
<span id="1110">1110</span>
<span id="1111">1111</span>
<span id="1112">1112</span>
<span id="1113">1113</span>
<span id="1114">1114</span>
<span id="1115">1115</span>
<span id="1116">1116</span>
<span id="1117">1117</span>
<span id="1118">1118</span>
<span id="1119">1119</span>
<span id="1120">1120</span>
<span id="1121">1121</span>
<span id="1122">1122</span>
<span id="1123">1123</span>
<span id="1124">1124</span>
<span id="1125">1125</span>
<span id="1126">1126</span>
<span id="1127">1127</span>
<span id="1128">1128</span>
<span id="1129">1129</span>
<span id="1130">1130</span>
<span id="1131">1131</span>
<span id="1132">1132</span>
<span id="1133">1133</span>
<span id="1134">1134</span>
<span id="1135">1135</span>
<span id="1136">1136</span>
<span id="1137">1137</span>
<span id="1138">1138</span>
<span id="1139">1139</span>
<span id="1140">1140</span>
<span id="1141">1141</span>
<span id="1142">1142</span>
<span id="1143">1143</span>
<span id="1144">1144</span>
<span id="1145">1145</span>
<span id="1146">1146</span>
<span id="1147">1147</span>
<span id="1148">1148</span>
<span id="1149">1149</span>
<span id="1150">1150</span>
<span id="1151">1151</span>
<span id="1152">1152</span>
<span id="1153">1153</span>
<span id="1154">1154</span>
<span id="1155">1155</span>
<span id="1156">1156</span>
<span id="1157">1157</span>
<span id="1158">1158</span>
<span id="1159">1159</span>
<span id="1160">1160</span>
<span id="1161">1161</span>
<span id="1162">1162</span>
<span id="1163">1163</span>
<span id="1164">1164</span>
<span id="1165">1165</span>
<span id="1166">1166</span>
<span id="1167">1167</span>
<span id="1168">1168</span>
<span id="1169">1169</span>
<span id="1170">1170</span>
<span id="1171">1171</span>
<span id="1172">1172</span>
<span id="1173">1173</span>
<span id="1174">1174</span>
<span id="1175">1175</span>
<span id="1176">1176</span>
<span id="1177">1177</span>
<span id="1178">1178</span>
<span id="1179">1179</span>
<span id="1180">1180</span>
<span id="1181">1181</span>
<span id="1182">1182</span>
<span id="1183">1183</span>
<span id="1184">1184</span>
<span id="1185">1185</span>
<span id="1186">1186</span>
<span id="1187">1187</span>
<span id="1188">1188</span>
<span id="1189">1189</span>
<span id="1190">1190</span>
<span id="1191">1191</span>
<span id="1192">1192</span>
<span id="1193">1193</span>
<span id="1194">1194</span>
<span id="1195">1195</span>
<span id="1196">1196</span>
<span id="1197">1197</span>
<span id="1198">1198</span>
<span id="1199">1199</span>
<span id="1200">1200</span>
<span id="1201">1201</span>
<span id="1202">1202</span>
<span id="1203">1203</span>
<span id="1204">1204</span>
<span id="1205">1205</span>
<span id="1206">1206</span>
<span id="1207">1207</span>
<span id="1208">1208</span>
<span id="1209">1209</span>
<span id="1210">1210</span>
<span id="1211">1211</span>
<span id="1212">1212</span>
<span id="1213">1213</span>
<span id="1214">1214</span>
<span id="1215">1215</span>
<span id="1216">1216</span>
<span id="1217">1217</span>
<span id="1218">1218</span>
<span id="1219">1219</span>
<span id="1220">1220</span>
<span id="1221">1221</span>
<span id="1222">1222</span>
<span id="1223">1223</span>
<span id="1224">1224</span>
<span id="1225">1225</span>
<span id="1226">1226</span>
<span id="1227">1227</span>
<span id="1228">1228</span>
<span id="1229">1229</span>
<span id="1230">1230</span>
<span id="1231">1231</span>
<span id="1232">1232</span>
<span id="1233">1233</span>
<span id="1234">1234</span>
<span id="1235">1235</span>
<span id="1236">1236</span>
</pre><pre class="rust ">
<span class="comment">// Copyright 2013-2014 The Rust Project Developers. See the COPYRIGHT</span>
<span class="comment">// file at the top-level directory of this distribution and at</span>
<span class="comment">// http://rust-lang.org/COPYRIGHT.</span>
<span class="comment">//</span>
<span class="comment">// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or</span>
<span class="comment">// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license</span>
<span class="comment">// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your</span>
<span class="comment">// option. This file may not be copied, modified, or distributed</span>
<span class="comment">// except according to those terms.</span>
<span class="doccomment">//! A priority queue implemented with a binary heap.</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! Insertion and popping the largest element have `O(log n)` time complexity.</span>
<span class="doccomment">//! Checking the largest element is `O(1)`. Converting a vector to a binary heap</span>
<span class="doccomment">//! can be done in-place, and has `O(n)` complexity. A binary heap can also be</span>
<span class="doccomment">//! converted to a sorted vector in-place, allowing it to be used for an `O(n</span>
<span class="doccomment">//! log n)` in-place heapsort.</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! # Examples</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! This is a larger example that implements [Dijkstra's algorithm][dijkstra]</span>
<span class="doccomment">//! to solve the [shortest path problem][sssp] on a [directed graph][dir_graph].</span>
<span class="doccomment">//! It shows how to use [`BinaryHeap`] with custom types.</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! [dijkstra]: http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</span>
<span class="doccomment">//! [sssp]: http://en.wikipedia.org/wiki/Shortest_path_problem</span>
<span class="doccomment">//! [dir_graph]: http://en.wikipedia.org/wiki/Directed_graph</span>
<span class="doccomment">//! [`BinaryHeap`]: struct.BinaryHeap.html</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! ```</span>
<span class="doccomment">//! use std::cmp::Ordering;</span>
<span class="doccomment">//! use std::collections::BinaryHeap;</span>
<span class="doccomment">//! use std::usize;</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! #[derive(Copy, Clone, Eq, PartialEq)]</span>
<span class="doccomment">//! struct State {</span>
<span class="doccomment">//! cost: usize,</span>
<span class="doccomment">//! position: usize,</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // The priority queue depends on `Ord`.</span>
<span class="doccomment">//! // Explicitly implement the trait so the queue becomes a min-heap</span>
<span class="doccomment">//! // instead of a max-heap.</span>
<span class="doccomment">//! impl Ord for State {</span>
<span class="doccomment">//! fn cmp(&self, other: &State) -> Ordering {</span>
<span class="doccomment">//! // Notice that the we flip the ordering on costs.</span>
<span class="doccomment">//! // In case of a tie we compare positions - this step is necessary</span>
<span class="doccomment">//! // to make implementations of `PartialEq` and `Ord` consistent.</span>
<span class="doccomment">//! other.cost.cmp(&self.cost)</span>
<span class="doccomment">//! .then_with(|| self.position.cmp(&other.position))</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // `PartialOrd` needs to be implemented as well.</span>
<span class="doccomment">//! impl PartialOrd for State {</span>
<span class="doccomment">//! fn partial_cmp(&self, other: &State) -> Option<Ordering> {</span>
<span class="doccomment">//! Some(self.cmp(other))</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // Each node is represented as an `usize`, for a shorter implementation.</span>
<span class="doccomment">//! struct Edge {</span>
<span class="doccomment">//! node: usize,</span>
<span class="doccomment">//! cost: usize,</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // Dijkstra's shortest path algorithm.</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // Start at `start` and use `dist` to track the current shortest distance</span>
<span class="doccomment">//! // to each node. This implementation isn't memory-efficient as it may leave duplicate</span>
<span class="doccomment">//! // nodes in the queue. It also uses `usize::MAX` as a sentinel value,</span>
<span class="doccomment">//! // for a simpler implementation.</span>
<span class="doccomment">//! fn shortest_path(adj_list: &Vec<Vec<Edge>>, start: usize, goal: usize) -> Option<usize> {</span>
<span class="doccomment">//! // dist[node] = current shortest distance from `start` to `node`</span>
<span class="doccomment">//! let mut dist: Vec<_> = (0..adj_list.len()).map(|_| usize::MAX).collect();</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! let mut heap = BinaryHeap::new();</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // We're at `start`, with a zero cost</span>
<span class="doccomment">//! dist[start] = 0;</span>
<span class="doccomment">//! heap.push(State { cost: 0, position: start });</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // Examine the frontier with lower cost nodes first (min-heap)</span>
<span class="doccomment">//! while let Some(State { cost, position }) = heap.pop() {</span>
<span class="doccomment">//! // Alternatively we could have continued to find all shortest paths</span>
<span class="doccomment">//! if position == goal { return Some(cost); }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // Important as we may have already found a better way</span>
<span class="doccomment">//! if cost > dist[position] { continue; }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // For each node we can reach, see if we can find a way with</span>
<span class="doccomment">//! // a lower cost going through this node</span>
<span class="doccomment">//! for edge in &adj_list[position] {</span>
<span class="doccomment">//! let next = State { cost: cost + edge.cost, position: edge.node };</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // If so, add it to the frontier and continue</span>
<span class="doccomment">//! if next.cost < dist[next.position] {</span>
<span class="doccomment">//! heap.push(next);</span>
<span class="doccomment">//! // Relaxation, we have now found a better way</span>
<span class="doccomment">//! dist[next.position] = next.cost;</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! // Goal not reachable</span>
<span class="doccomment">//! None</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! fn main() {</span>
<span class="doccomment">//! // This is the directed graph we're going to use.</span>
<span class="doccomment">//! // The node numbers correspond to the different states,</span>
<span class="doccomment">//! // and the edge weights symbolize the cost of moving</span>
<span class="doccomment">//! // from one node to another.</span>
<span class="doccomment">//! // Note that the edges are one-way.</span>
<span class="doccomment">//! //</span>
<span class="doccomment">//! // 7</span>
<span class="doccomment">//! // +-----------------+</span>
<span class="doccomment">//! // | |</span>
<span class="doccomment">//! // v 1 2 | 2</span>
<span class="doccomment">//! // 0 -----> 1 -----> 3 ---> 4</span>
<span class="doccomment">//! // | ^ ^ ^</span>
<span class="doccomment">//! // | | 1 | |</span>
<span class="doccomment">//! // | | | 3 | 1</span>
<span class="doccomment">//! // +------> 2 -------+ |</span>
<span class="doccomment">//! // 10 | |</span>
<span class="doccomment">//! // +---------------+</span>
<span class="doccomment">//! //</span>
<span class="doccomment">//! // The graph is represented as an adjacency list where each index,</span>
<span class="doccomment">//! // corresponding to a node value, has a list of outgoing edges.</span>
<span class="doccomment">//! // Chosen for its efficiency.</span>
<span class="doccomment">//! let graph = vec![</span>
<span class="doccomment">//! // Node 0</span>
<span class="doccomment">//! vec![Edge { node: 2, cost: 10 },</span>
<span class="doccomment">//! Edge { node: 1, cost: 1 }],</span>
<span class="doccomment">//! // Node 1</span>
<span class="doccomment">//! vec![Edge { node: 3, cost: 2 }],</span>
<span class="doccomment">//! // Node 2</span>
<span class="doccomment">//! vec![Edge { node: 1, cost: 1 },</span>
<span class="doccomment">//! Edge { node: 3, cost: 3 },</span>
<span class="doccomment">//! Edge { node: 4, cost: 1 }],</span>
<span class="doccomment">//! // Node 3</span>
<span class="doccomment">//! vec![Edge { node: 0, cost: 7 },</span>
<span class="doccomment">//! Edge { node: 4, cost: 2 }],</span>
<span class="doccomment">//! // Node 4</span>
<span class="doccomment">//! vec![]];</span>
<span class="doccomment">//!</span>
<span class="doccomment">//! assert_eq!(shortest_path(&graph, 0, 1), Some(1));</span>
<span class="doccomment">//! assert_eq!(shortest_path(&graph, 0, 3), Some(3));</span>
<span class="doccomment">//! assert_eq!(shortest_path(&graph, 3, 0), Some(7));</span>
<span class="doccomment">//! assert_eq!(shortest_path(&graph, 0, 4), Some(5));</span>
<span class="doccomment">//! assert_eq!(shortest_path(&graph, 4, 0), None);</span>
<span class="doccomment">//! }</span>
<span class="doccomment">//! ```</span>
<span class="attribute">#<span class="op">!</span>[<span class="ident">allow</span>(<span class="ident">missing_docs</span>)]</span>
<span class="attribute">#<span class="op">!</span>[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">ops</span>::{<span class="ident">Deref</span>, <span class="ident">DerefMut</span>, <span class="ident">Place</span>, <span class="ident">Placer</span>, <span class="ident">InPlace</span>};
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">iter</span>::{<span class="ident">FromIterator</span>, <span class="ident">FusedIterator</span>};
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">mem</span>::{<span class="ident">swap</span>, <span class="ident">size_of</span>};
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">ptr</span>;
<span class="kw">use</span> <span class="ident">core</span>::<span class="ident">fmt</span>;
<span class="kw">use</span> <span class="ident">slice</span>;
<span class="kw">use</span> <span class="ident">vec</span>::{<span class="self">self</span>, <span class="ident">Vec</span>};
<span class="kw">use</span> <span class="kw">super</span>::<span class="ident">SpecExtend</span>;
<span class="doccomment">/// A priority queue implemented with a binary heap.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This will be a max-heap.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// It is a logic error for an item to be modified in such a way that the</span>
<span class="doccomment">/// item's ordering relative to any other item, as determined by the `Ord`</span>
<span class="doccomment">/// trait, changes while it is in the heap. This is normally only possible</span>
<span class="doccomment">/// through `Cell`, `RefCell`, global state, I/O, or unsafe code.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // Type inference lets us omit an explicit type signature (which</span>
<span class="doccomment">/// // would be `BinaryHeap<i32>` in this example).</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // We can use peek to look at the next item in the heap. In this case,</span>
<span class="doccomment">/// // there's no items in there yet so we get None.</span>
<span class="doccomment">/// assert_eq!(heap.peek(), None);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // Let's add some scores...</span>
<span class="doccomment">/// heap.push(1);</span>
<span class="doccomment">/// heap.push(5);</span>
<span class="doccomment">/// heap.push(2);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // Now peek shows the most important item in the heap.</span>
<span class="doccomment">/// assert_eq!(heap.peek(), Some(&5));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // We can check the length of a heap.</span>
<span class="doccomment">/// assert_eq!(heap.len(), 3);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // We can iterate over the items in the heap, although they are returned in</span>
<span class="doccomment">/// // a random order.</span>
<span class="doccomment">/// for x in &heap {</span>
<span class="doccomment">/// println!("{}", x);</span>
<span class="doccomment">/// }</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // If we instead pop these scores, they should come back in order.</span>
<span class="doccomment">/// assert_eq!(heap.pop(), Some(5));</span>
<span class="doccomment">/// assert_eq!(heap.pop(), Some(2));</span>
<span class="doccomment">/// assert_eq!(heap.pop(), Some(1));</span>
<span class="doccomment">/// assert_eq!(heap.pop(), None);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // We can clear the heap of any remaining items.</span>
<span class="doccomment">/// heap.clear();</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // The heap should now be empty.</span>
<span class="doccomment">/// assert!(heap.is_empty())</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">data</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
}
<span class="doccomment">/// Structure wrapping a mutable reference to the greatest item on a</span>
<span class="doccomment">/// `BinaryHeap`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This `struct` is created by the [`peek_mut`] method on [`BinaryHeap`]. See</span>
<span class="doccomment">/// its documentation for more.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// [`peek_mut`]: struct.BinaryHeap.html#method.peek_mut</span>
<span class="doccomment">/// [`BinaryHeap`]: struct.BinaryHeap.html</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_peek_mut"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.12.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span> <span class="op">+</span> <span class="ident">Ord</span><span class="op">></span> {
<span class="ident">heap</span>: <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="kw-2">mut</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
<span class="ident">sift</span>: <span class="ident">bool</span>,
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_debug"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.17.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">fmt</span>::<span class="ident">Debug</span><span class="op">></span> <span class="ident">fmt</span>::<span class="ident">Debug</span> <span class="kw">for</span> <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">fmt</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">f</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="ident">f</span>.<span class="ident">debug_tuple</span>(<span class="string">"PeekMut"</span>)
.<span class="ident">field</span>(<span class="kw-2">&</span><span class="self">self</span>.<span class="ident">heap</span>.<span class="ident">data</span>[<span class="number">0</span>])
.<span class="ident">finish</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_peek_mut"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.12.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">Drop</span> <span class="kw">for</span> <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">drop</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) {
<span class="kw">if</span> <span class="self">self</span>.<span class="ident">sift</span> {
<span class="self">self</span>.<span class="ident">heap</span>.<span class="ident">sift_down</span>(<span class="number">0</span>);
}
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_peek_mut"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.12.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">Deref</span> <span class="kw">for</span> <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">type</span> <span class="ident">Target</span> <span class="op">=</span> <span class="ident">T</span>;
<span class="kw">fn</span> <span class="ident">deref</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="ident">T</span> {
<span class="kw-2">&</span><span class="self">self</span>.<span class="ident">heap</span>.<span class="ident">data</span>[<span class="number">0</span>]
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_peek_mut"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.12.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">DerefMut</span> <span class="kw">for</span> <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">deref_mut</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">T</span> {
<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>.<span class="ident">heap</span>.<span class="ident">data</span>[<span class="number">0</span>]
}
}
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="doccomment">/// Removes the peeked value from the heap and returns it.</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_peek_mut_pop"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.18.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">pop</span>(<span class="kw-2">mut</span> <span class="ident">this</span>: <span class="ident">PeekMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>) <span class="op">-></span> <span class="ident">T</span> {
<span class="kw">let</span> <span class="ident">value</span> <span class="op">=</span> <span class="ident">this</span>.<span class="ident">heap</span>.<span class="ident">pop</span>().<span class="ident">unwrap</span>();
<span class="ident">this</span>.<span class="ident">sift</span> <span class="op">=</span> <span class="bool-val">false</span>;
<span class="ident">value</span>
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Clone</span><span class="op">></span> <span class="ident">Clone</span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">clone</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="self">Self</span> {
<span class="ident">BinaryHeap</span> { <span class="ident">data</span>: <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">clone</span>() }
}
<span class="kw">fn</span> <span class="ident">clone_from</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">source</span>: <span class="kw-2">&</span><span class="self">Self</span>) {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">clone_from</span>(<span class="kw-2">&</span><span class="ident">source</span>.<span class="ident">data</span>);
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">Default</span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="doccomment">/// Creates an empty `BinaryHeap<T>`.</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">default</span>() <span class="op">-></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">BinaryHeap</span>::<span class="ident">new</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binaryheap_debug"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.4.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">fmt</span>::<span class="ident">Debug</span> <span class="op">+</span> <span class="ident">Ord</span><span class="op">></span> <span class="ident">fmt</span>::<span class="ident">Debug</span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">fmt</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">f</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="ident">f</span>.<span class="ident">debug_list</span>().<span class="ident">entries</span>(<span class="self">self</span>.<span class="ident">iter</span>()).<span class="ident">finish</span>()
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="doccomment">/// Creates an empty `BinaryHeap` as a max-heap.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">/// heap.push(4);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">new</span>() <span class="op">-></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">BinaryHeap</span> { <span class="ident">data</span>: <span class="macro">vec</span><span class="macro">!</span>[] }
}
<span class="doccomment">/// Creates an empty `BinaryHeap` with a specific capacity.</span>
<span class="doccomment">/// This preallocates enough memory for `capacity` elements,</span>
<span class="doccomment">/// so that the `BinaryHeap` does not have to be reallocated</span>
<span class="doccomment">/// until it contains at least that many values.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::with_capacity(10);</span>
<span class="doccomment">/// heap.push(4);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">with_capacity</span>(<span class="ident">capacity</span>: <span class="ident">usize</span>) <span class="op">-></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">BinaryHeap</span> { <span class="ident">data</span>: <span class="ident">Vec</span>::<span class="ident">with_capacity</span>(<span class="ident">capacity</span>) }
}
<span class="doccomment">/// Returns an iterator visiting all values in the underlying vector, in</span>
<span class="doccomment">/// arbitrary order.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let heap = BinaryHeap::from(vec![1, 2, 3, 4]);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // Print 1, 2, 3, 4 in arbitrary order</span>
<span class="doccomment">/// for x in heap.iter() {</span>
<span class="doccomment">/// println!("{}", x);</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</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">Iter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">Iter</span> { <span class="ident">iter</span>: <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">iter</span>() }
}
<span class="doccomment">/// Returns the greatest item in the binary heap, or `None` if it is empty.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">/// assert_eq!(heap.peek(), None);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// heap.push(1);</span>
<span class="doccomment">/// heap.push(5);</span>
<span class="doccomment">/// heap.push(2);</span>
<span class="doccomment">/// assert_eq!(heap.peek(), Some(&5));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">peek</span>(<span class="kw-2">&</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="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">get</span>(<span class="number">0</span>)
}
<span class="doccomment">/// Returns a mutable reference to the greatest item in the binary heap, or</span>
<span class="doccomment">/// `None` if it is empty.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Note: If the `PeekMut` value is leaked, the heap may be in an</span>
<span class="doccomment">/// inconsistent state.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">/// assert!(heap.peek_mut().is_none());</span>
<span class="doccomment">///</span>
<span class="doccomment">/// heap.push(1);</span>
<span class="doccomment">/// heap.push(5);</span>
<span class="doccomment">/// heap.push(2);</span>
<span class="doccomment">/// {</span>
<span class="doccomment">/// let mut val = heap.peek_mut().unwrap();</span>
<span class="doccomment">/// *val = 0;</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// assert_eq!(heap.peek(), Some(&2));</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_peek_mut"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.12.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">peek_mut</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="ident">PeekMut</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span> {
<span class="kw">if</span> <span class="self">self</span>.<span class="ident">is_empty</span>() {
<span class="prelude-val">None</span>
} <span class="kw">else</span> {
<span class="prelude-val">Some</span>(<span class="ident">PeekMut</span> {
<span class="ident">heap</span>: <span class="self">self</span>,
<span class="ident">sift</span>: <span class="bool-val">true</span>,
})
}
}
<span class="doccomment">/// Returns the number of elements the binary heap can hold without reallocating.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::with_capacity(100);</span>
<span class="doccomment">/// assert!(heap.capacity() >= 100);</span>
<span class="doccomment">/// heap.push(4);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">capacity</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">data</span>.<span class="ident">capacity</span>()
}
<span class="doccomment">/// Reserves the minimum capacity for exactly `additional` more elements to be inserted in the</span>
<span class="doccomment">/// given `BinaryHeap`. Does nothing if the capacity is already sufficient.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Note that the allocator may give the collection more space than it requests. Therefore</span>
<span class="doccomment">/// capacity can not be relied upon to be precisely minimal. Prefer [`reserve`] if future</span>
<span class="doccomment">/// insertions are expected.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Panics</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Panics if the new capacity overflows `usize`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">/// heap.reserve_exact(100);</span>
<span class="doccomment">/// assert!(heap.capacity() >= 100);</span>
<span class="doccomment">/// heap.push(4);</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">///</span>
<span class="doccomment">/// [`reserve`]: #method.reserve</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">reserve_exact</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">additional</span>: <span class="ident">usize</span>) {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">reserve_exact</span>(<span class="ident">additional</span>);
}
<span class="doccomment">/// Reserves capacity for at least `additional` more elements to be inserted in the</span>
<span class="doccomment">/// `BinaryHeap`. The collection may reserve more space to avoid frequent reallocations.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Panics</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Panics if the new capacity overflows `usize`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">/// heap.reserve(100);</span>
<span class="doccomment">/// assert!(heap.capacity() >= 100);</span>
<span class="doccomment">/// heap.push(4);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">reserve</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">additional</span>: <span class="ident">usize</span>) {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">reserve</span>(<span class="ident">additional</span>);
}
<span class="doccomment">/// Discards as much additional capacity as possible.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap: BinaryHeap<i32> = BinaryHeap::with_capacity(100);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(heap.capacity() >= 100);</span>
<span class="doccomment">/// heap.shrink_to_fit();</span>
<span class="doccomment">/// assert!(heap.capacity() == 0);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">shrink_to_fit</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">shrink_to_fit</span>();
}
<span class="doccomment">/// Removes the greatest item from the binary heap and returns it, or `None` if it</span>
<span class="doccomment">/// is empty.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::from(vec![1, 3]);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert_eq!(heap.pop(), Some(3));</span>
<span class="doccomment">/// assert_eq!(heap.pop(), Some(1));</span>
<span class="doccomment">/// assert_eq!(heap.pop(), None);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">pop</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="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">pop</span>().<span class="ident">map</span>(<span class="op">|</span><span class="kw-2">mut</span> <span class="ident">item</span><span class="op">|</span> {
<span class="kw">if</span> <span class="op">!</span><span class="self">self</span>.<span class="ident">is_empty</span>() {
<span class="ident">swap</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">item</span>, <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>.<span class="ident">data</span>[<span class="number">0</span>]);
<span class="self">self</span>.<span class="ident">sift_down_to_bottom</span>(<span class="number">0</span>);
}
<span class="ident">item</span>
})
}
<span class="doccomment">/// Pushes an item onto the binary heap.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">/// heap.push(3);</span>
<span class="doccomment">/// heap.push(5);</span>
<span class="doccomment">/// heap.push(1);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert_eq!(heap.len(), 3);</span>
<span class="doccomment">/// assert_eq!(heap.peek(), Some(&5));</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">push</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">item</span>: <span class="ident">T</span>) {
<span class="kw">let</span> <span class="ident">old_len</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">len</span>();
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">push</span>(<span class="ident">item</span>);
<span class="self">self</span>.<span class="ident">sift_up</span>(<span class="number">0</span>, <span class="ident">old_len</span>);
}
<span class="doccomment">/// Consumes the `BinaryHeap` and returns the underlying vector</span>
<span class="doccomment">/// in arbitrary order.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let heap = BinaryHeap::from(vec![1, 2, 3, 4, 5, 6, 7]);</span>
<span class="doccomment">/// let vec = heap.into_vec();</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // Will print in some order</span>
<span class="doccomment">/// for x in vec {</span>
<span class="doccomment">/// println!("{}", x);</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_extras_15"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.5.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">into_vec</span>(<span class="self">self</span>) <span class="op">-></span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">into</span>()
}
<span class="doccomment">/// Consumes the `BinaryHeap` and returns a vector in sorted</span>
<span class="doccomment">/// (ascending) order.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let mut heap = BinaryHeap::from(vec![1, 2, 4, 5, 7]);</span>
<span class="doccomment">/// heap.push(6);</span>
<span class="doccomment">/// heap.push(3);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let vec = heap.into_sorted_vec();</span>
<span class="doccomment">/// assert_eq!(vec, [1, 2, 3, 4, 5, 6, 7]);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_extras_15"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.5.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">into_sorted_vec</span>(<span class="kw-2">mut</span> <span class="self">self</span>) <span class="op">-></span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">end</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">len</span>();
<span class="kw">while</span> <span class="ident">end</span> <span class="op">></span> <span class="number">1</span> {
<span class="ident">end</span> <span class="op">-=</span> <span class="number">1</span>;
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">swap</span>(<span class="number">0</span>, <span class="ident">end</span>);
<span class="self">self</span>.<span class="ident">sift_down_range</span>(<span class="number">0</span>, <span class="ident">end</span>);
}
<span class="self">self</span>.<span class="ident">into_vec</span>()
}
<span class="comment">// The implementations of sift_up and sift_down use unsafe blocks in</span>
<span class="comment">// order to move an element out of the vector (leaving behind a</span>
<span class="comment">// hole), shift along the others and move the removed element back into the</span>
<span class="comment">// vector at the final location of the hole.</span>
<span class="comment">// The `Hole` type is used to represent this, and make sure</span>
<span class="comment">// the hole is filled back at the end of its scope, even on panic.</span>
<span class="comment">// Using a hole reduces the constant factor compared to using swaps,</span>
<span class="comment">// which involves twice as many moves.</span>
<span class="kw">fn</span> <span class="ident">sift_up</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">start</span>: <span class="ident">usize</span>, <span class="ident">pos</span>: <span class="ident">usize</span>) <span class="op">-></span> <span class="ident">usize</span> {
<span class="kw">unsafe</span> {
<span class="comment">// Take out the value at `pos` and create a hole.</span>
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">hole</span> <span class="op">=</span> <span class="ident">Hole</span>::<span class="ident">new</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>.<span class="ident">data</span>, <span class="ident">pos</span>);
<span class="kw">while</span> <span class="ident">hole</span>.<span class="ident">pos</span>() <span class="op">></span> <span class="ident">start</span> {
<span class="kw">let</span> <span class="ident">parent</span> <span class="op">=</span> (<span class="ident">hole</span>.<span class="ident">pos</span>() <span class="op">-</span> <span class="number">1</span>) <span class="op">/</span> <span class="number">2</span>;
<span class="kw">if</span> <span class="ident">hole</span>.<span class="ident">element</span>() <span class="op"><=</span> <span class="ident">hole</span>.<span class="ident">get</span>(<span class="ident">parent</span>) {
<span class="kw">break</span>;
}
<span class="ident">hole</span>.<span class="ident">move_to</span>(<span class="ident">parent</span>);
}
<span class="ident">hole</span>.<span class="ident">pos</span>()
}
}
<span class="doccomment">/// Take an element at `pos` and move it down the heap,</span>
<span class="doccomment">/// while its children are larger.</span>
<span class="kw">fn</span> <span class="ident">sift_down_range</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">pos</span>: <span class="ident">usize</span>, <span class="ident">end</span>: <span class="ident">usize</span>) {
<span class="kw">unsafe</span> {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">hole</span> <span class="op">=</span> <span class="ident">Hole</span>::<span class="ident">new</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>.<span class="ident">data</span>, <span class="ident">pos</span>);
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">child</span> <span class="op">=</span> <span class="number">2</span> <span class="op">*</span> <span class="ident">pos</span> <span class="op">+</span> <span class="number">1</span>;
<span class="kw">while</span> <span class="ident">child</span> <span class="op"><</span> <span class="ident">end</span> {
<span class="kw">let</span> <span class="ident">right</span> <span class="op">=</span> <span class="ident">child</span> <span class="op">+</span> <span class="number">1</span>;
<span class="comment">// compare with the greater of the two children</span>
<span class="kw">if</span> <span class="ident">right</span> <span class="op"><</span> <span class="ident">end</span> <span class="op">&&</span> <span class="op">!</span>(<span class="ident">hole</span>.<span class="ident">get</span>(<span class="ident">child</span>) <span class="op">></span> <span class="ident">hole</span>.<span class="ident">get</span>(<span class="ident">right</span>)) {
<span class="ident">child</span> <span class="op">=</span> <span class="ident">right</span>;
}
<span class="comment">// if we are already in order, stop.</span>
<span class="kw">if</span> <span class="ident">hole</span>.<span class="ident">element</span>() <span class="op">>=</span> <span class="ident">hole</span>.<span class="ident">get</span>(<span class="ident">child</span>) {
<span class="kw">break</span>;
}
<span class="ident">hole</span>.<span class="ident">move_to</span>(<span class="ident">child</span>);
<span class="ident">child</span> <span class="op">=</span> <span class="number">2</span> <span class="op">*</span> <span class="ident">hole</span>.<span class="ident">pos</span>() <span class="op">+</span> <span class="number">1</span>;
}
}
}
<span class="kw">fn</span> <span class="ident">sift_down</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">pos</span>: <span class="ident">usize</span>) {
<span class="kw">let</span> <span class="ident">len</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">len</span>();
<span class="self">self</span>.<span class="ident">sift_down_range</span>(<span class="ident">pos</span>, <span class="ident">len</span>);
}
<span class="doccomment">/// Take an element at `pos` and move it all the way down the heap,</span>
<span class="doccomment">/// then sift it up to its position.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Note: This is faster when the element is known to be large / should</span>
<span class="doccomment">/// be closer to the bottom.</span>
<span class="kw">fn</span> <span class="ident">sift_down_to_bottom</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="kw-2">mut</span> <span class="ident">pos</span>: <span class="ident">usize</span>) {
<span class="kw">let</span> <span class="ident">end</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">len</span>();
<span class="kw">let</span> <span class="ident">start</span> <span class="op">=</span> <span class="ident">pos</span>;
<span class="kw">unsafe</span> {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">hole</span> <span class="op">=</span> <span class="ident">Hole</span>::<span class="ident">new</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>.<span class="ident">data</span>, <span class="ident">pos</span>);
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">child</span> <span class="op">=</span> <span class="number">2</span> <span class="op">*</span> <span class="ident">pos</span> <span class="op">+</span> <span class="number">1</span>;
<span class="kw">while</span> <span class="ident">child</span> <span class="op"><</span> <span class="ident">end</span> {
<span class="kw">let</span> <span class="ident">right</span> <span class="op">=</span> <span class="ident">child</span> <span class="op">+</span> <span class="number">1</span>;
<span class="comment">// compare with the greater of the two children</span>
<span class="kw">if</span> <span class="ident">right</span> <span class="op"><</span> <span class="ident">end</span> <span class="op">&&</span> <span class="op">!</span>(<span class="ident">hole</span>.<span class="ident">get</span>(<span class="ident">child</span>) <span class="op">></span> <span class="ident">hole</span>.<span class="ident">get</span>(<span class="ident">right</span>)) {
<span class="ident">child</span> <span class="op">=</span> <span class="ident">right</span>;
}
<span class="ident">hole</span>.<span class="ident">move_to</span>(<span class="ident">child</span>);
<span class="ident">child</span> <span class="op">=</span> <span class="number">2</span> <span class="op">*</span> <span class="ident">hole</span>.<span class="ident">pos</span>() <span class="op">+</span> <span class="number">1</span>;
}
<span class="ident">pos</span> <span class="op">=</span> <span class="ident">hole</span>.<span class="ident">pos</span>;
}
<span class="self">self</span>.<span class="ident">sift_up</span>(<span class="ident">start</span>, <span class="ident">pos</span>);
}
<span class="doccomment">/// Returns the length of the binary heap.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let heap = BinaryHeap::from(vec![1, 3]);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert_eq!(heap.len(), 2);</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</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">data</span>.<span class="ident">len</span>()
}
<span class="doccomment">/// Checks if the binary heap is empty.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::new();</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(heap.is_empty());</span>
<span class="doccomment">///</span>
<span class="doccomment">/// heap.push(3);</span>
<span class="doccomment">/// heap.push(5);</span>
<span class="doccomment">/// heap.push(1);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(!heap.is_empty());</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">is_empty</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">bool</span> {
<span class="self">self</span>.<span class="ident">len</span>() <span class="op">==</span> <span class="number">0</span>
}
<span class="doccomment">/// Clears the binary heap, returning an iterator over the removed elements.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// The elements are removed in arbitrary order.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::from(vec![1, 3]);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(!heap.is_empty());</span>
<span class="doccomment">///</span>
<span class="doccomment">/// for x in heap.drain() {</span>
<span class="doccomment">/// println!("{}", x);</span>
<span class="doccomment">/// }</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(heap.is_empty());</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"drain"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.6.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">drain</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) <span class="op">-></span> <span class="ident">Drain</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">Drain</span> { <span class="ident">iter</span>: <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">drain</span>(..) }
}
<span class="doccomment">/// Drops all items from the binary heap.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let mut heap = BinaryHeap::from(vec![1, 3]);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(!heap.is_empty());</span>
<span class="doccomment">///</span>
<span class="doccomment">/// heap.clear();</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert!(heap.is_empty());</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">clear</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) {
<span class="self">self</span>.<span class="ident">drain</span>();
}
<span class="kw">fn</span> <span class="ident">rebuild</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">n</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">len</span>() <span class="op">/</span> <span class="number">2</span>;
<span class="kw">while</span> <span class="ident">n</span> <span class="op">></span> <span class="number">0</span> {
<span class="ident">n</span> <span class="op">-=</span> <span class="number">1</span>;
<span class="self">self</span>.<span class="ident">sift_down</span>(<span class="ident">n</span>);
}
}
<span class="doccomment">/// Moves all the elements of `other` into `self`, leaving `other` empty.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let v = vec![-10, 1, 2, 3, 3];</span>
<span class="doccomment">/// let mut a = BinaryHeap::from(v);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let v = vec![-20, 5, 43];</span>
<span class="doccomment">/// let mut b = BinaryHeap::from(v);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// a.append(&mut b);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert_eq!(a.into_sorted_vec(), [-20, -10, 1, 2, 3, 3, 5, 43]);</span>
<span class="doccomment">/// assert!(b.is_empty());</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_append"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.11.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">append</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">other</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">Self</span>) {
<span class="kw">if</span> <span class="self">self</span>.<span class="ident">len</span>() <span class="op"><</span> <span class="ident">other</span>.<span class="ident">len</span>() {
<span class="ident">swap</span>(<span class="self">self</span>, <span class="ident">other</span>);
}
<span class="kw">if</span> <span class="ident">other</span>.<span class="ident">is_empty</span>() {
<span class="kw">return</span>;
}
<span class="attribute">#[<span class="ident">inline</span>(<span class="ident">always</span>)]</span>
<span class="kw">fn</span> <span class="ident">log2_fast</span>(<span class="ident">x</span>: <span class="ident">usize</span>) <span class="op">-></span> <span class="ident">usize</span> {
<span class="number">8</span> <span class="op">*</span> <span class="ident">size_of</span>::<span class="op"><</span><span class="ident">usize</span><span class="op">></span>() <span class="op">-</span> (<span class="ident">x</span>.<span class="ident">leading_zeros</span>() <span class="kw">as</span> <span class="ident">usize</span>) <span class="op">-</span> <span class="number">1</span>
}
<span class="comment">// `rebuild` takes O(len1 + len2) operations</span>
<span class="comment">// and about 2 * (len1 + len2) comparisons in the worst case</span>
<span class="comment">// while `extend` takes O(len2 * log_2(len1)) operations</span>
<span class="comment">// and about 1 * len2 * log_2(len1) comparisons in the worst case,</span>
<span class="comment">// assuming len1 >= len2.</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">better_to_rebuild</span>(<span class="ident">len1</span>: <span class="ident">usize</span>, <span class="ident">len2</span>: <span class="ident">usize</span>) <span class="op">-></span> <span class="ident">bool</span> {
<span class="number">2</span> <span class="op">*</span> (<span class="ident">len1</span> <span class="op">+</span> <span class="ident">len2</span>) <span class="op"><</span> <span class="ident">len2</span> <span class="op">*</span> <span class="ident">log2_fast</span>(<span class="ident">len1</span>)
}
<span class="kw">if</span> <span class="ident">better_to_rebuild</span>(<span class="self">self</span>.<span class="ident">len</span>(), <span class="ident">other</span>.<span class="ident">len</span>()) {
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">append</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">other</span>.<span class="ident">data</span>);
<span class="self">self</span>.<span class="ident">rebuild</span>();
} <span class="kw">else</span> {
<span class="self">self</span>.<span class="ident">extend</span>(<span class="ident">other</span>.<span class="ident">drain</span>());
}
}
}
<span class="doccomment">/// Hole represents a hole in a slice i.e. an index without valid value</span>
<span class="doccomment">/// (because it was moved from or duplicated).</span>
<span class="doccomment">/// In drop, `Hole` will restore the slice by filling the hole</span>
<span class="doccomment">/// position with the value that was originally removed.</span>
<span class="kw">struct</span> <span class="ident">Hole</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> {
<span class="ident">data</span>: <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="kw-2">mut</span> [<span class="ident">T</span>],
<span class="doccomment">/// `elt` is always `Some` from new until drop.</span>
<span class="ident">elt</span>: <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
<span class="ident">pos</span>: <span class="ident">usize</span>,
}
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">Hole</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="doccomment">/// Create a new Hole at index `pos`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Unsafe because pos must be within the data slice.</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">unsafe</span> <span class="kw">fn</span> <span class="ident">new</span>(<span class="ident">data</span>: <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="kw-2">mut</span> [<span class="ident">T</span>], <span class="ident">pos</span>: <span class="ident">usize</span>) <span class="op">-></span> <span class="self">Self</span> {
<span class="macro">debug_assert</span><span class="macro">!</span>(<span class="ident">pos</span> <span class="op"><</span> <span class="ident">data</span>.<span class="ident">len</span>());
<span class="kw">let</span> <span class="ident">elt</span> <span class="op">=</span> <span class="ident">ptr</span>::<span class="ident">read</span>(<span class="kw-2">&</span><span class="ident">data</span>[<span class="ident">pos</span>]);
<span class="ident">Hole</span> {
<span class="ident">data</span>,
<span class="ident">elt</span>: <span class="prelude-val">Some</span>(<span class="ident">elt</span>),
<span class="ident">pos</span>,
}
}
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">pos</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">pos</span>
}
<span class="doccomment">/// Returns a reference to the element removed.</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">element</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="ident">T</span> {
<span class="self">self</span>.<span class="ident">elt</span>.<span class="ident">as_ref</span>().<span class="ident">unwrap</span>()
}
<span class="doccomment">/// Returns a reference to the element at `index`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Unsafe because index must be within the data slice and not equal to pos.</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">unsafe</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="kw-2">&</span><span class="ident">T</span> {
<span class="macro">debug_assert</span><span class="macro">!</span>(<span class="ident">index</span> <span class="op">!=</span> <span class="self">self</span>.<span class="ident">pos</span>);
<span class="macro">debug_assert</span><span class="macro">!</span>(<span class="ident">index</span> <span class="op"><</span> <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">len</span>());
<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">get_unchecked</span>(<span class="ident">index</span>)
}
<span class="doccomment">/// Move hole to new location</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Unsafe because index must be within the data slice and not equal to pos.</span>
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">unsafe</span> <span class="kw">fn</span> <span class="ident">move_to</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">index</span>: <span class="ident">usize</span>) {
<span class="macro">debug_assert</span><span class="macro">!</span>(<span class="ident">index</span> <span class="op">!=</span> <span class="self">self</span>.<span class="ident">pos</span>);
<span class="macro">debug_assert</span><span class="macro">!</span>(<span class="ident">index</span> <span class="op"><</span> <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">len</span>());
<span class="kw">let</span> <span class="ident">index_ptr</span>: <span class="kw-2">*</span><span class="kw">const</span> _ <span class="op">=</span> <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">get_unchecked</span>(<span class="ident">index</span>);
<span class="kw">let</span> <span class="ident">hole_ptr</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">get_unchecked_mut</span>(<span class="self">self</span>.<span class="ident">pos</span>);
<span class="ident">ptr</span>::<span class="ident">copy_nonoverlapping</span>(<span class="ident">index_ptr</span>, <span class="ident">hole_ptr</span>, <span class="number">1</span>);
<span class="self">self</span>.<span class="ident">pos</span> <span class="op">=</span> <span class="ident">index</span>;
}
}
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">Drop</span> <span class="kw">for</span> <span class="ident">Hole</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">drop</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) {
<span class="comment">// fill the hole again</span>
<span class="kw">unsafe</span> {
<span class="kw">let</span> <span class="ident">pos</span> <span class="op">=</span> <span class="self">self</span>.<span class="ident">pos</span>;
<span class="ident">ptr</span>::<span class="ident">write</span>(<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">get_unchecked_mut</span>(<span class="ident">pos</span>), <span class="self">self</span>.<span class="ident">elt</span>.<span class="ident">take</span>().<span class="ident">unwrap</span>());
}
}
}
<span class="doccomment">/// An iterator over the elements of a `BinaryHeap`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This `struct` is created by the [`iter`] method on [`BinaryHeap`]. See its</span>
<span class="doccomment">/// documentation for more.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// [`iter`]: struct.BinaryHeap.html#method.iter</span>
<span class="doccomment">/// [`BinaryHeap`]: struct.BinaryHeap.html</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> {
<span class="ident">iter</span>: <span class="ident">slice</span>::<span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>,
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_debug"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.17.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span> <span class="op">+</span> <span class="ident">fmt</span>::<span class="ident">Debug</span><span class="op">></span> <span class="ident">fmt</span>::<span class="ident">Debug</span> <span class="kw">for</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">fmt</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">f</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="ident">f</span>.<span class="ident">debug_tuple</span>(<span class="string">"Iter"</span>)
.<span class="ident">field</span>(<span class="kw-2">&</span><span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">as_slice</span>())
.<span class="ident">finish</span>()
}
}
<span class="comment">// FIXME(#19839) Remove in favor of `#[derive(Clone)]`</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">Clone</span> <span class="kw">for</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">clone</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="ident">Iter</span> { <span class="ident">iter</span>: <span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">clone</span>() }
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">Iterator</span> <span class="kw">for</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</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">T</span>;
<span class="attribute">#[<span class="ident">inline</span>]</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">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">next</span>()
}
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">size_hint</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> (<span class="ident">usize</span>, <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span>) {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">size_hint</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">DoubleEndedIterator</span> <span class="kw">for</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">next_back</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">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">next_back</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">ExactSizeIterator</span> <span class="kw">for</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">is_empty</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">bool</span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">is_empty</span>()
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"fused"</span>, <span class="ident">issue</span> <span class="op">=</span> <span class="string">"35602"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">FusedIterator</span> <span class="kw">for</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {}
<span class="doccomment">/// An owning iterator over the elements of a `BinaryHeap`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This `struct` is created by the [`into_iter`] method on [`BinaryHeap`][`BinaryHeap`]</span>
<span class="doccomment">/// (provided by the `IntoIterator` trait). See its documentation for more.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// [`into_iter`]: struct.BinaryHeap.html#method.into_iter</span>
<span class="doccomment">/// [`BinaryHeap`]: struct.BinaryHeap.html</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Clone</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">iter</span>: <span class="ident">vec</span>::<span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_debug"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.17.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">fmt</span>::<span class="ident">Debug</span><span class="op">></span> <span class="ident">fmt</span>::<span class="ident">Debug</span> <span class="kw">for</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">fmt</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">f</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="ident">f</span>.<span class="ident">debug_tuple</span>(<span class="string">"IntoIter"</span>)
.<span class="ident">field</span>(<span class="kw-2">&</span><span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">as_slice</span>())
.<span class="ident">finish</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">Iterator</span> <span class="kw">for</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">type</span> <span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span>;
<span class="attribute">#[<span class="ident">inline</span>]</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="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">next</span>()
}
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">size_hint</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> (<span class="ident">usize</span>, <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span>) {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">size_hint</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">DoubleEndedIterator</span> <span class="kw">for</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">next_back</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="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">next_back</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">ExactSizeIterator</span> <span class="kw">for</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">is_empty</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">bool</span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">is_empty</span>()
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"fused"</span>, <span class="ident">issue</span> <span class="op">=</span> <span class="string">"35602"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">FusedIterator</span> <span class="kw">for</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {}
<span class="doccomment">/// A draining iterator over the elements of a `BinaryHeap`.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// This `struct` is created by the [`drain`] method on [`BinaryHeap`]. See its</span>
<span class="doccomment">/// documentation for more.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// [`drain`]: struct.BinaryHeap.html#method.drain</span>
<span class="doccomment">/// [`BinaryHeap`]: struct.BinaryHeap.html</span>
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"drain"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.6.0"</span>)]</span>
<span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Debug</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">Drain</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> {
<span class="ident">iter</span>: <span class="ident">vec</span>::<span class="ident">Drain</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>,
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"drain"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.6.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> <span class="ident">Iterator</span> <span class="kw">for</span> <span class="ident">Drain</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">type</span> <span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span>;
<span class="attribute">#[<span class="ident">inline</span>]</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="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">next</span>()
}
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">size_hint</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> (<span class="ident">usize</span>, <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span>) {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">size_hint</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"drain"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.6.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> <span class="ident">DoubleEndedIterator</span> <span class="kw">for</span> <span class="ident">Drain</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">next_back</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="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">next_back</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"drain"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.6.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> <span class="ident">ExactSizeIterator</span> <span class="kw">for</span> <span class="ident">Drain</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">is_empty</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">bool</span> {
<span class="self">self</span>.<span class="ident">iter</span>.<span class="ident">is_empty</span>()
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"fused"</span>, <span class="ident">issue</span> <span class="op">=</span> <span class="string">"35602"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> <span class="ident">FusedIterator</span> <span class="kw">for</span> <span class="ident">Drain</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_extras_15"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.5.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">From</span><span class="op"><</span><span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">from</span>(<span class="ident">vec</span>: <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>) <span class="op">-></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">heap</span> <span class="op">=</span> <span class="ident">BinaryHeap</span> { <span class="ident">data</span>: <span class="ident">vec</span> };
<span class="ident">heap</span>.<span class="ident">rebuild</span>();
<span class="ident">heap</span>
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"binary_heap_extras_15"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.5.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="ident">From</span><span class="op"><</span><span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span> <span class="kw">for</span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">from</span>(<span class="ident">heap</span>: <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>) <span class="op">-></span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">heap</span>.<span class="ident">data</span>
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">FromIterator</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">from_iter</span><span class="op"><</span><span class="ident">I</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">>></span>(<span class="ident">iter</span>: <span class="ident">I</span>) <span class="op">-></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">BinaryHeap</span>::<span class="ident">from</span>(<span class="ident">iter</span>.<span class="ident">into_iter</span>().<span class="ident">collect</span>::<span class="op"><</span><span class="ident">Vec</span><span class="op"><</span>_<span class="op">>></span>())
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">IntoIterator</span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">type</span> <span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span>;
<span class="kw">type</span> <span class="ident">IntoIter</span> <span class="op">=</span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>;
<span class="doccomment">/// Creates a consuming iterator, that is, one that moves each value out of</span>
<span class="doccomment">/// the binary heap in arbitrary order. The binary heap cannot be used</span>
<span class="doccomment">/// after calling this.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">///</span>
<span class="doccomment">/// Basic usage:</span>
<span class="doccomment">///</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::collections::BinaryHeap;</span>
<span class="doccomment">/// let heap = BinaryHeap::from(vec![1, 2, 3, 4]);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// // Print 1, 2, 3, 4 in arbitrary order</span>
<span class="doccomment">/// for x in heap.into_iter() {</span>
<span class="doccomment">/// // x has type i32, not &i32</span>
<span class="doccomment">/// println!("{}", x);</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// ```</span>
<span class="kw">fn</span> <span class="ident">into_iter</span>(<span class="self">self</span>) <span class="op">-></span> <span class="ident">IntoIter</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">IntoIter</span> { <span class="ident">iter</span>: <span class="self">self</span>.<span class="ident">data</span>.<span class="ident">into_iter</span>() }
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">IntoIterator</span> <span class="kw">for</span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>
<span class="kw">where</span> <span class="ident">T</span>: <span class="ident">Ord</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">T</span>;
<span class="kw">type</span> <span class="ident">IntoIter</span> <span class="op">=</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>;
<span class="kw">fn</span> <span class="ident">into_iter</span>(<span class="self">self</span>) <span class="op">-></span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="self">self</span>.<span class="ident">iter</span>()
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"rust1"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.0.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">Extend</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="attribute">#[<span class="ident">inline</span>]</span>
<span class="kw">fn</span> <span class="ident">extend</span><span class="op"><</span><span class="ident">I</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">>></span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">iter</span>: <span class="ident">I</span>) {
<span class="op"><</span><span class="self">Self</span> <span class="kw">as</span> <span class="ident">SpecExtend</span><span class="op"><</span><span class="ident">I</span><span class="op">>></span>::<span class="ident">spec_extend</span>(<span class="self">self</span>, <span class="ident">iter</span>);
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span>, <span class="ident">I</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">>></span> <span class="ident">SpecExtend</span><span class="op"><</span><span class="ident">I</span><span class="op">></span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="ident">default</span> <span class="kw">fn</span> <span class="ident">spec_extend</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">iter</span>: <span class="ident">I</span>) {
<span class="self">self</span>.<span class="ident">extend_desugared</span>(<span class="ident">iter</span>.<span class="ident">into_iter</span>());
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">SpecExtend</span><span class="op"><</span><span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">>></span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">spec_extend</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="kw-2">ref</span> <span class="kw-2">mut</span> <span class="ident">other</span>: <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>) {
<span class="self">self</span>.<span class="ident">append</span>(<span class="ident">other</span>);
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">Ord</span><span class="op">></span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">extend_desugared</span><span class="op"><</span><span class="ident">I</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="ident">T</span><span class="op">>></span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">iter</span>: <span class="ident">I</span>) {
<span class="kw">let</span> <span class="ident">iterator</span> <span class="op">=</span> <span class="ident">iter</span>.<span class="ident">into_iter</span>();
<span class="kw">let</span> (<span class="ident">lower</span>, _) <span class="op">=</span> <span class="ident">iterator</span>.<span class="ident">size_hint</span>();
<span class="self">self</span>.<span class="ident">reserve</span>(<span class="ident">lower</span>);
<span class="kw">for</span> <span class="ident">elem</span> <span class="kw">in</span> <span class="ident">iterator</span> {
<span class="self">self</span>.<span class="ident">push</span>(<span class="ident">elem</span>);
}
}
}
<span class="attribute">#[<span class="ident">stable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"extend_ref"</span>, <span class="ident">since</span> <span class="op">=</span> <span class="string">"1.2.0"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Copy</span><span class="op">></span> <span class="ident">Extend</span><span class="op"><</span><span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">extend</span><span class="op"><</span><span class="ident">I</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">T</span><span class="op">>></span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>, <span class="ident">iter</span>: <span class="ident">I</span>) {
<span class="self">self</span>.<span class="ident">extend</span>(<span class="ident">iter</span>.<span class="ident">into_iter</span>().<span class="ident">cloned</span>());
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_placement"</span>,
<span class="ident">reason</span> <span class="op">=</span> <span class="string">"placement protocol is subject to change"</span>,
<span class="ident">issue</span> <span class="op">=</span> <span class="string">"30172"</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">BinaryHeapPlace</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span>
<span class="kw">where</span> <span class="ident">T</span>: <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Ord</span> {
<span class="ident">heap</span>: <span class="kw-2">*</span><span class="kw-2">mut</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>,
<span class="ident">place</span>: <span class="ident">vec</span>::<span class="ident">PlaceBack</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>,
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_placement"</span>,
<span class="ident">reason</span> <span class="op">=</span> <span class="string">"placement protocol is subject to change"</span>,
<span class="ident">issue</span> <span class="op">=</span> <span class="string">"30172"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">fmt</span>::<span class="ident">Debug</span><span class="op">></span> <span class="ident">fmt</span>::<span class="ident">Debug</span> <span class="kw">for</span> <span class="ident">BinaryHeapPlace</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> {
<span class="kw">fn</span> <span class="ident">fmt</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">f</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="ident">f</span>.<span class="ident">debug_tuple</span>(<span class="string">"BinaryHeapPlace"</span>)
.<span class="ident">field</span>(<span class="kw-2">&</span><span class="self">self</span>.<span class="ident">place</span>)
.<span class="ident">finish</span>()
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_placement"</span>,
<span class="ident">reason</span> <span class="op">=</span> <span class="string">"placement protocol is subject to change"</span>,
<span class="ident">issue</span> <span class="op">=</span> <span class="string">"30172"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span>: <span class="lifetime">'a</span><span class="op">></span> <span class="ident">Placer</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="kw-2">mut</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>
<span class="kw">where</span> <span class="ident">T</span>: <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Ord</span> {
<span class="kw">type</span> <span class="ident">Place</span> <span class="op">=</span> <span class="ident">BinaryHeapPlace</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>;
<span class="kw">fn</span> <span class="ident">make_place</span>(<span class="self">self</span>) <span class="op">-></span> <span class="self">Self</span>::<span class="ident">Place</span> {
<span class="kw">let</span> <span class="ident">ptr</span> <span class="op">=</span> <span class="self">self</span> <span class="kw">as</span> <span class="kw-2">*</span><span class="kw-2">mut</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span>;
<span class="kw">let</span> <span class="ident">place</span> <span class="op">=</span> <span class="ident">Placer</span>::<span class="ident">make_place</span>(<span class="self">self</span>.<span class="ident">data</span>.<span class="ident">place_back</span>());
<span class="ident">BinaryHeapPlace</span> {
<span class="ident">heap</span>: <span class="ident">ptr</span>,
<span class="ident">place</span>,
}
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_placement"</span>,
<span class="ident">reason</span> <span class="op">=</span> <span class="string">"placement protocol is subject to change"</span>,
<span class="ident">issue</span> <span class="op">=</span> <span class="string">"30172"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">Place</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="ident">BinaryHeapPlace</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>
<span class="kw">where</span> <span class="ident">T</span>: <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Ord</span> {
<span class="kw">fn</span> <span class="ident">pointer</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="self">self</span>) <span class="op">-></span> <span class="kw-2">*</span><span class="kw-2">mut</span> <span class="ident">T</span> {
<span class="self">self</span>.<span class="ident">place</span>.<span class="ident">pointer</span>()
}
}
<span class="attribute">#[<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"collection_placement"</span>,
<span class="ident">reason</span> <span class="op">=</span> <span class="string">"placement protocol is subject to change"</span>,
<span class="ident">issue</span> <span class="op">=</span> <span class="string">"30172"</span>)]</span>
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span> <span class="ident">InPlace</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="kw">for</span> <span class="ident">BinaryHeapPlace</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">T</span><span class="op">></span>
<span class="kw">where</span> <span class="ident">T</span>: <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Ord</span> {
<span class="kw">type</span> <span class="ident">Owner</span> <span class="op">=</span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">T</span>;
<span class="kw">unsafe</span> <span class="kw">fn</span> <span class="ident">finalize</span>(<span class="self">self</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">T</span> {
<span class="self">self</span>.<span class="ident">place</span>.<span class="ident">finalize</span>();
<span class="kw">let</span> <span class="ident">heap</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">BinaryHeap</span><span class="op"><</span><span class="ident">T</span><span class="op">></span> <span class="op">=</span> <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="kw-2">*</span><span class="self">self</span>.<span class="ident">heap</span>;
<span class="kw">let</span> <span class="ident">len</span> <span class="op">=</span> <span class="ident">heap</span>.<span class="ident">len</span>();
<span class="kw">let</span> <span class="ident">i</span> <span class="op">=</span> <span class="ident">heap</span>.<span class="ident">sift_up</span>(<span class="number">0</span>, <span class="ident">len</span> <span class="op">-</span> <span class="number">1</span>);
<span class="ident">heap</span>.<span class="ident">data</span>.<span class="ident">get_unchecked</span>(<span class="ident">i</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 = "alloc";
</script>
<script src="../../main.js"></script>
<script defer src="../../search-index.js"></script>
</body>
</html>
distrib
>
Mageia
>
6
>
x86_64
>
media
>
core-updates
>
by-pkgid
>
f9731dfa50015223ad228047cd6e9424
>
files
>
3078
