C
Christian Bongiorno
So, what I would like to do is have a mapping between a range of keys
and a value
so, min < key < max = true;
I am not sure that hasmap can do this cleanly. I believe the problem
lies in hashCode(). What do I return for hashcodes??
Perhaps HashXXX is not the way. Perhaps I need a sorted list and then
sort by
objA.max - objB.min??
Thoughs?
Christian
and a value
so, min < key < max = true;
I am not sure that hasmap can do this cleanly. I believe the problem
lies in hashCode(). What do I return for hashcodes??
Perhaps HashXXX is not the way. Perhaps I need a sorted list and then
sort by
objA.max - objB.min??
Thoughs?
Christian