BitMap vs VectorSet?

[Liu, Xin]

hi,

Recently, I extended VectorSet(libadt/vectset.hpp) to support
intersection. Then I found that there is yet another "vector set" called
'BitMap'. From my reading, the data structure of BitMap is same as
VectorSet. BitMap has already supported intersection/union/difference
and it even owns corresponding gtests.

Given that, why does HotSpot still need to maintain both VectorSet and
BitMap? I grep VectorSet and there are still many references. Is that
too troublesome to replace VectorSet with BitMap or there are other
reasons?

I modified VectorSet because Unique_Node_List(node.hpp) uses it. I
hesitate now. Should I invest a new gtest for the new code or I just use
BitMap instead?

thanks,
--lx
-------------- next part --------------
A non-text attachment was scrubbed...
Name: OpenPGP_0xB9D934C61E047B0D.asc
Type: application/pgp-keys
Size: 3675 bytes
Desc: OpenPGP public key
URL: <https://mail.openjdk.org/pipermail/hotspot-runtime-dev/attachments/20221027/06c4f354/OpenPGP_0xB9D934C61E047B0D-0001.asc>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: OpenPGP_signature
Type: application/pgp-signature
Size: 665 bytes
Desc: OpenPGP digital signature
URL: <https://mail.openjdk.org/pipermail/hotspot-runtime-dev/attachments/20221027/06c4f354/OpenPGP_signature-0001.sig>