<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Posts on Hussyvel Ribeiro | Tech Blog</title><link>https://hussyvel.com/posts/</link><description>Recent content in Posts on Hussyvel Ribeiro | Tech Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 22 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://hussyvel.com/posts/index.xml" rel="self" type="application/rss+xml"/><item><title>Bitwise Operators in Java: What They Are, Where They Came From, and When to Use Them</title><link>https://hussyvel.com/posts/bitwise-operators-java/</link><pubDate>Thu, 22 Oct 2026 00:00:00 +0000</pubDate><guid>https://hussyvel.com/posts/bitwise-operators-java/</guid><description>&lt;p>&lt;strong>In short:&lt;/strong> use bitwise operators in Java when the problem is genuinely binary. That means compact permissions and flags (hand-written bit masks, as in hardware registers; in everyday application code, prefer &lt;code>EnumSet&lt;/code>, which stores the flags as bits for you, without any bitwise operators in your code), binary protocols and formats (parsing headers, RGB/ARGB colors with &lt;code>&amp;lt;&amp;lt;&lt;/code>, &lt;code>&amp;gt;&amp;gt;&lt;/code> and &lt;code>&amp;amp;&lt;/code>), hashes and checksums (&lt;code>hashCode()&lt;/code>, CRC, MurmurHash), and low-level algorithms where the bit operation &lt;em>is&lt;/em> the algorithm (counting bits, detecting a power of two with &lt;code>(n &amp;amp; (n - 1)) == 0&lt;/code>, or swapping without a temporary variable in specific embedded-systems contexts).&lt;/p></description></item></channel></rss>