... In a bit vector implementation, each set is allocated (ideally) as the same
number of bits as the size of the universal set. The universal set will have
a natural or imposed order, each 1 or 0 will represent the presence or
absence of that member of the universal set. Some languages, such as
PL/1 su ...