🚀 go-pugleaf

Hmmm, perhaps the BitSet should be defined to be a word size, and uses
exclusively for bit twiddeling and implementation specific things.  Then,
I think we would rather need a more abstract set construct.  I still think
the compiler should allocate as many words as necessary to hold the range
which should be expected in the set ( boy, that made a lot of sense ), and
the limit should be infinity, or at least a rather large approximation of
infinity.  The maximum cardinal value supported by the implementation might
be a reasonable approximation to infinity.  If a cardinal is 16 bits, then
such a set, SET OF CARDINAL would only take up 8k bytes, which isn't too
extreme, not even for my old 8 bit system.

I hope the forthcomming standard says something reasonable about sets.

                                                    Tom Ruby
                                                 MSRS002@ECNCDC