Re: [Jprogramming] K-sets - bitmap representation of sets. WAS: Partitions

[Erling Hellenäs]

We get a difference in the space needed. When represented as a bitmap, 
each set member takes 1 bit. When represented as boolean each set member 
takes 1 byte. When represented as integer each set member takes 8 bytes, 
64 times more than in the bitmap representation. Much of the time/space 
differences between these three otherwise nearly identical programs is 
probably due to this difference. /Erling

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