<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Btreemap on rustbites</title><link>https://www.rustbites.com/tags/btreemap/</link><description>Recent content in Btreemap on rustbites</description><generator>Hugo</generator><language>en</language><lastBuildDate>Wed, 06 May 2026 22:21:53 +0200</lastBuildDate><atom:link href="https://www.rustbites.com/tags/btreemap/index.xml" rel="self" type="application/rss+xml"/><item><title>123. BTreeMap::pop_first — A Sorted Map That Doubles as a Priority Queue</title><link>https://www.rustbites.com/posts/bite-123/</link><pubDate>Wed, 06 May 2026 17:00:00 +0100</pubDate><guid>https://www.rustbites.com/posts/bite-123/</guid><description>&lt;p&gt;&lt;code&gt;BinaryHeap&lt;/code&gt; only goes one way — biggest first. When you want to pull the smallest &lt;em&gt;or&lt;/em&gt; the largest from the same collection, reach for &lt;code&gt;BTreeMap&lt;/code&gt; and let &lt;code&gt;pop_first&lt;/code&gt; / &lt;code&gt;pop_last&lt;/code&gt; do the work.&lt;/p&gt;</description></item></channel></rss>