Re: Can I compare references (in a sense of compareTo method)?
chucky wrote:
Thank you guys, seems you have answered my question indirectly --
there is no way to get the address of an object :-).
It isn't even guaranteed that an object has an address.
On Sep 20, 11:42 pm, Daniel Pitts <googlegrou...@coloraura.com> wrote:
Now, the questions remains, if they don't have inherent order, why use
them in a TreeSet or TreeMap? Why not a standard HashSet/HashMap?
The main benefit of Tree* is that it maintains the order for you.
I don't care about the actual ordering, but I wanted to use Tree*
since I thought it would have smaller memory overhead than Hash*. I
don't care much about logarithmic complexity (which is btw.
guaranteed, while Hash operations don't guarantee constant
complexity), since I want to use it for small collections (<20
elements).
Why is HashSet/HashMap more standard than TreeSet/TreeMap?
They are both completely standard, but they are different classes with
different purposes. The Tree structures are designed for ordered access,
and you are having to stretch to try to apply them to your unordered
objects.
For very small collections, I would also consider ArrayList.
Patricia