Replace binary search with de Bruijn lookup for bit-finding

[dougm]

Summary

The use of a de Bruijn sequence lets the single set bit in a word be found with a multiply, a shift, and a table-lookup. In this case, the current implementation uses binary search, and de Bruijn ought to be faster.

[dougm]

Fix stale comment.