<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hashset on rustbites</title><link>https://www.rustbites.com/tags/hashset/</link><description>Recent content in Hashset on rustbites</description><generator>Hugo</generator><language>en</language><lastBuildDate>Fri, 26 Jun 2026 15:31:17 +0200</lastBuildDate><atom:link href="https://www.rustbites.com/tags/hashset/index.xml" rel="self" type="application/rss+xml"/><item><title>222. HashSet::intersection / union / difference — Set Math Without the Manual Loops</title><link>https://www.rustbites.com/posts/bite-222/</link><pubDate>Thu, 25 Jun 2026 17:00:00 +0100</pubDate><guid>https://www.rustbites.com/posts/bite-222/</guid><description>&lt;p&gt;Need the items two collections have in common, or the ones only in one of them? Don&amp;rsquo;t write a &lt;code&gt;for&lt;/code&gt; loop with &lt;code&gt;.contains()&lt;/code&gt; inside. &lt;code&gt;HashSet&lt;/code&gt; has set algebra built in.&lt;/p&gt;</description></item></channel></rss>