<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Hashing on Nalar</title>
    <link>https://nalar.dev/tags/hashing/</link>
    <description>Recent content in Hashing on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Thu, 03 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/hashing/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Design Hashable Python Objects Correctly</title>
      <link>https://nalar.dev/design-hashable-python-objects-correctly/</link>
      <pubDate>Thu, 03 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/design-hashable-python-objects-correctly/</guid>
      <description>&lt;p&gt;Python dictionaries and sets make lookups feel simple: give them a key or value, and they can usually find it quickly. That convenience depends on a contract that becomes important as soon as you create your own value-like classes.&lt;/p&gt;&#xA;&lt;p&gt;A dictionary key is not located by equality alone. Python first uses the object&amp;rsquo;s &lt;strong&gt;hash value&lt;/strong&gt; to narrow the search, then uses equality to distinguish candidates that land in the same area of the hash table.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
