t; 99999989       11       20       30
</code></pre>

<h2>bitwhich type</h2>

<p>Since we have a very skewed distribution we may coerce to an even sparser representation</p>

<pre><code class="r">w1 &lt;- as.bitwhich(b1) 
w2 &lt;- as.bitwhich(b2)
object.size(w1)/n
#&gt; 0 bytes
</code></pre>

<p>and everything </p>

<pre><code class="r">w1 &amp; w2
#&gt; bitwhich: 11/100000000 occupying only 11 int32 in 1 representation
#&gt;         1         2         3         4         5         6         7         8 
#