My perfect idea is to have a Hashmap that would increase size each Key & value added, it's almost like a self-increasing array. I mean I could just create a very large Hashmap for me to add objects to anytime I want with a key to be able to find the object. Is this the most efficient way, because I'm trying to make my Object Library compatible with any amount of Objects, however, I know there's a limit to how many values you can have in an array, but it's larger than I'll ever need. I may not be setting my question out clearly, but it's generally a question like Should I create a very large array for me to use eventhough I sometimes may not use all the possible placeholders?
Let's say I'm making a number storage program, and I may need from 3 to 8 numbers to be stored with a key to find them easily using a Hashmap, rarely I may need below 3 or above 8. So is it efficient for me to create a Hashmap that has 10 placeholders? Or can I make this more efficient. Note, my Library is static. I don't know how to explain this too well because I have a feeling this my question is hard to understand or you'll get the wrong idea. P:
Regards
Augustas
No comments:
Post a Comment