<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>HashMap on tl;dr</title><link>http://blog.alextldr.com/tags/hashmap/</link><description>Recent content in HashMap on tl;dr</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 06 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="http://blog.alextldr.com/tags/hashmap/index.xml" rel="self" type="application/rss+xml"/><item><title>Advanced collections</title><link>http://blog.alextldr.com/rust-zettels/8-advanced-collections/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>http://blog.alextldr.com/rust-zettels/8-advanced-collections/</guid><description>&lt;p>Go prides on simplicity. For almost every data problem, the answer is mostly the two reliable tools, the &lt;code>Slice&lt;/code> and the &lt;code>Map&lt;/code>. This Swiss Army knife style makes Go code easy to read, but it sometimes forces developers to build custom logic when they need ordered maps or double-ended queues.&lt;/p>
&lt;p>Rust follows a different philosophy. Rust is more like a &lt;strong>specialized toolbox&lt;/strong>. While most of the time we use &lt;code>Vec&lt;/code> (slices) and &lt;code>HashMap&lt;/code> (maps), Rust offers some &lt;strong>precision tools&lt;/strong> for specific performance or sorting needs.&lt;/p></description></item></channel></rss>