H
Hendrik Maryns
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
NotDashEscaped: You need GnuPG to verify this message
Hi,
I am using sets intensively, and have to do a lot of mathematical
manipulations with them, that are not part of the standard API, such as
set intersection, cartesian product (with itself, for arbitrary n, or
with other), and so forth. Now I am wondering whether the best way
would be to extend HashSet, or to keep a reference to a HashSet to store
the elements. In other words, I am not so sure about When Not To Use
Inheritance. This seems like a border case to me.
Related question: is there a nice API which already has this sort of
stuff implemented, open source?
TIA, H.
--
Hendrik Maryns
==================
www.lieverleven.be
http://aouw.org
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.2 (GNU/Linux)
iD8DBQFD81oue+7xMGD3itQRAkD3AJ9UoyA4CKCQ939a26GDz5oKirx8WACfSWx5
qp+hOStCjDTo4blIocyb6aM=
=WFnX
-----END PGP SIGNATURE-----
Hash: SHA1
NotDashEscaped: You need GnuPG to verify this message
Hi,
I am using sets intensively, and have to do a lot of mathematical
manipulations with them, that are not part of the standard API, such as
set intersection, cartesian product (with itself, for arbitrary n, or
with other), and so forth. Now I am wondering whether the best way
would be to extend HashSet, or to keep a reference to a HashSet to store
the elements. In other words, I am not so sure about When Not To Use
Inheritance. This seems like a border case to me.
Related question: is there a nice API which already has this sort of
stuff implemented, open source?
TIA, H.
--
Hendrik Maryns
==================
www.lieverleven.be
http://aouw.org
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.2 (GNU/Linux)
iD8DBQFD81oue+7xMGD3itQRAkD3AJ9UoyA4CKCQ939a26GDz5oKirx8WACfSWx5
qp+hOStCjDTo4blIocyb6aM=
=WFnX
-----END PGP SIGNATURE-----