<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>qnighy</author_name>
  <author_url>https://blog.hatena.ne.jp/qnighy/</author_url>
  <blog_title>簡潔なQ</blog_title>
  <blog_url>https://qnighy.hatenablog.com/</blog_url>
  <categories>
    <anon>Programming</anon>
    <anon>C</anon>
  </categories>
  <description>ビットを数える・探すアルゴリズムのpopcountをちょっと改変すればいいだけやんけ。 #include &lt;stdio.h&gt; unsigned int bitreverse(unsigned int x) { x = (x &amp; 0x55555555)&lt;&lt;1 | (x &amp; 0xaaaaaaaa)&gt;&gt;1; x = (x &amp; 0x33333333)&lt;&lt;2 | (x &amp; 0xcccccccc)&gt;&gt;2; x = (x &amp; 0x0f0f0f0f)&lt;&lt;4 | (x &amp; 0xf0f0f0f0)&gt;&gt;4; x = (x &amp; 0x00ff00ff)&lt;&lt;8 | (x &amp; 0xff00ff00)&gt;&gt;8; x = (x …</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fqnighy.hatenablog.com%2Fentry%2F20091006%2F1254832950&quot; title=&quot;ビットリバース - 簡潔なQ&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2009-10-06 21:42:30</published>
  <title>ビットリバース</title>
  <type>rich</type>
  <url>https://qnighy.hatenablog.com/entry/20091006/1254832950</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
