I need to create some dense sets which will contain
subsets of the integers  1..n where n is very large.
I don't want to use regular sets because they would use to much space.
Instead I want to map each set to an array of approximately size
n/8 bytes which, because my sets will be dense, will save space.
Containment of a number k  in a set is to be determined by testing
whether bit  k  is set or cleared.  Pretty standard stuff I think.

Is there code already that does this?

If not, I will create a class LargeDenseSet containing some instance
bitMap that holds the necessary space.
For  bitMap,  is it better for me to use an array of integers or a
LargePositiveInteger.
How about using a BltBit?

Is  LargeDenseSet a sufficiently used class to be part of Squeak or at
least part of
some standard package?

Regards,

Ralph Boland