<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Pattern-Detection on Cedric Bail</title><link>http://bluebugs.github.io/tags/pattern-detection/</link><description>Recent content in Pattern-Detection on Cedric Bail</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 15 Apr 2026 10:04:00 -0700</lastBuildDate><atom:link href="http://bluebugs.github.io/tags/pattern-detection/index.xml" rel="self" type="application/rss+xml"/><item><title>Pattern Matching Outperformed Hand-Written SIMD</title><link>http://bluebugs.github.io/blogs/spmd-pattern-matching/</link><pubDate>Wed, 15 Apr 2026 10:04:00 -0700</pubDate><guid>http://bluebugs.github.io/blogs/spmd-pattern-matching/</guid><description>&lt;p>Our base64 decoder was implemented twice. Version 1 used explicit cross-lane operations &amp;mdash; shuffles, rotations, compact stores. It peaked at roughly 2x scalar performance. Version 2 used four plain &lt;code>go for&lt;/code> loops with no cross-lane operations at all. It hit approximately 17 GB/s on AVX2 &amp;mdash; about 77% of simdutf C++ and 9x faster than Go&amp;rsquo;s &lt;code>encoding/base64&lt;/code>. The simpler code outperformed the clever code by a wide margin.&lt;/p></description></item></channel></rss>