RFR 8170159 Improve the performance of BitSet traversal

[Paul Sandoz]

> On Jun 15, 2018, at 2:24 PM, Martin Buchholz <martinrb at google.com> wrote:
> 
> Still looks correct, but I might keep looking for something  more elegant.
> What bothers me a little now is
> 
> 1290                         long word = words[u] & (WORD_MASK << i);
> 
> which is part of the initial setup and is not necessary on each iteration. 
> 

I was looking at this too. From a performance perspective i am not very concerned. Aesthetically it bothers me, but at this point i am willing to declare victory and patch later if there is a better way.

Paul.