Originally posted by Gurpreet Saini:
... Lakhs corresponds to : 1,00000. Hope any experienced personal might tell the optimization issues regarding hashmap table
I still don't understand, why you not write a small test-class which uses
150.000 elements.
a) you know how big they are
b) you know how they look like
c) you know the environment where the program will run
at least better than we know.
Perhaps you may generate 150 000 elements with a randomizer.
To tell about alternatives, we would need much more information. But if your test shows, that hashmap is fine and faster as expected and smaller than feared - why bother?
If it is too big/ to small you know what to ask for.
And we might know which problem to solve.
But there are many collections (m) and topics to think of (n) which leads to too much speculation (n*m). Perhaps someone can point to a article about collections in general and java-collections in special.