http://phildawesstuff.disqus.com/enFri, 12 Sep 2008 09:21:58 -0000http://www.phildawes.net/blog/2008/09/11/searching-arrays-in-x86-assembler-with-a-bloom-filter-pt-2/#comment-2753774Thanks for the tip Asm. It seems pretty quick but I'll try the ANDing and SHRing approach to see how it comparesPhil DawesFri, 12 Sep 2008 09:21:58 -0000http://www.phildawes.net/blog/2008/09/11/searching-arrays-in-x86-assembler-with-a-bloom-filter-pt-2/#comment-2753773BT is slow for m, r operands. 12 uops on a P4. 10 uops on a Core2. Avoid.AsmFri, 12 Sep 2008 07:55:07 -0000http://www.phildawes.net/blog/2008/09/11/searching-arrays-in-x86-assembler-with-a-bloom-filter-pt-2/#comment-2753772Hi Kieran! I'm expecting thousands occasionally. Hundreds commonly.Phil DawesFri, 12 Sep 2008 06:33:13 -0000http://www.phildawes.net/blog/2008/09/11/searching-arrays-in-x86-assembler-with-a-bloom-filter-pt-2/#comment-2753771Hello, you've said there are around 12M elements in the array, but how many are you expecting in the set? Tens? Hundreds? Thousands?KieranFri, 12 Sep 2008 06:26:57 -0000