Hi all!
Now when we are in bitmap representation, anyone can find a trick to
generate the next combination in some way similar to what I describe here?
http://www.jsoftware.com/pipermail/programming/2017-November/049551.html
With real bitmaps I mean. By manipulating the bits in integers. Not with
booleans as in my post.
See also: "Bitwise reduction and scan" here:
http://code.jsoftware.com/wiki/Vocabulary/bslash
Ideally we would like to generate the next combination in one assembler
instruction, or even less, since there are wide registers that could
possibly hold many sets. You could also possibly operate on many such
registers with one assembler instruction.
Cheers,
Erling Hellenäs
On 2017-11-11 12:31, Raul Miller wrote:
No,
That would be comb, not combbool, nor combbit.
Thanks,
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
