Pastable version of Find the Intersection of Arrays with a Hash

<div style="overflow:auto;border:solid 1px #ccc;background:#000;color:#F8F8F8">
          <div class="section">
            
            <pre style="float:left;margin:0 10px;border-right:0;color:#666;">1
2
3
4
5
6
7
8
9</pre>
            <pre class="sunburst">pools <span style="color:#E28964;">=</span> {<span style="color:#3387CC;">1</span> =&gt; [<span style="color:#3387CC;">1</span>,<span style="color:#3387CC;">2</span>,<span style="color:#3387CC;">3</span>], <span style="color:#3387CC;">2</span>=&gt; [<span style="color:#3387CC;">3</span>,<span style="color:#3387CC;">4</span>,<span style="color:#3387CC;">5</span>], <span style="color:#3387CC;">3</span>=&gt; [<span style="color:#3387CC;">5</span>,<span style="color:#3387CC;">6</span>,<span style="color:#3387CC;">7</span>]}
intersection <span style="color:#E28964;">=</span> []
pools.<span style="color:#89BDFF;">each</span> <span style="color:#E28964;">do </span>|<span style="color:#3E87E3;">k</span>,<span style="color:#3E87E3;">v</span>|
  not_k <span style="color:#E28964;">=</span> pools.<span style="color:#89BDFF;">dup</span>
  not_k.<span style="color:#89BDFF;">delete_if</span>{|<span style="color:#3E87E3;">nk</span>,<span style="color:#3E87E3;">nv</span>| nk <span style="color:#E28964;">==</span> k }
  inter <span style="color:#E28964;">&lt;&lt;</span> (v <span style="color:#E28964;">&amp;</span> not_k.<span style="color:#89BDFF;">values</span>.<span style="color:#89BDFF;">flatten</span>)
<span style="color:#E28964;">end</span>
intersection.<span style="color:#89BDFF;">flatten</span>.<span style="color:#89BDFF;">uniq</span>

</pre>
          </div>
        </div>

<a href="http://refactormycode.com/codes/413-find-the-intersection-of-arrays-with-a-hash" style="color:#fff" title="As seen on RefactorMyCode.com"><img alt="Small_logo" src="http://refactormycode.com/images/small_logo.gif" style="border:0" /></a>

counter free hit invisible