🚀 go-pugleaf

I posted the following suggestion for a ``packed array'' of bits yesterday:

|> If you are interested in space, one suggestion is
|> 
|> 	# include	<limits.h>
|> 	
|> 	# define	UNSIGNED_BIT	(CHAR_BIT * sizeof (unsigned))
|> 
|> 	struct {
|> 		unsigned the_bits [UNSIGNED_BIT]: 1;
|> 	} the_array [800][(800 + UNSIGNED_BIT - 1) / UNSIGNED_BIT];
|> 
|> 	# define	BIT(X, Y)\
|> 		the_array [Y][(X) / UNSIGNED_BIT].the_bits [(X) % UNSIGNED_BIT]

Upon further reflection, I now am more inclined toward the following:

	struct {
		unsigned b [800][800]:1;
	} the_array;

Furthermore, in yesterdays posting making the size of the cell sizeof (unsigned)
is arbitrary; in particular, it has nothing to do with the fact that the
type of the bitfield is unsigned.  In the environment I am currently
computing in, a cell size of sizeof (void *) would be more likely to make
the cell size equal to the machine word length.  I doubt that either choice
will make much of a difference speed wise.

Konrad Schwarz