debruijn_t provides a mechanism for doing lookups of the set bits in a bitfield. More...

Detailed Description

debruijn_t provides a mechanism for doing lookups of the set bits in a bitfield.

A de Bruijn sequence can be used to quickly find the index of the least significant set bit ("right-most 1") or the most significant set bit ("left-most 1") in a word using bitwise operations.

Note: This implementation is based on the example given in http://supertech.csail.mit.edu/papers/debruijn.pdf

The documentation for this class was generated from the following file:

/home/bergen/devel/tuxfan/flecsi/flecsi/util/debruijn.hh