HashMap uses array of Bucket objects, which in turn are just wrappers
around pointer to Node instance. If I understand this scheme correctly,
than for every object put into list, both Bucket instance and Node
instance is created, with additional Node for every conflicting
hashcode.
Would not it be better to use directly array of Nodes ? Saving
allocation of one object for each value put in should be a major benefit
both in performance and memory for HashMap/Hashtable (and sets which are
based on this classes).
If nobody have anything against the idea, I'll try to implement the
change.
Artur
