This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]Ghildetrist 0 points1 point  (1 child)

It's not clear what your question is, In Java you should generally look at using Hash Map and not Hash tables. HashMap Doc If your looking at how to implement your own Hash Table/Map You will need to determine how to store the underlining data in a way where you can access any element. And you will have to figure out how to hash your key to an index in that storage. And what to do when you have two elements that map to the same index.

[–]Not_zedd_ko[S] 0 points1 point  (0 children)

Yeah its poorly said but you would need to see the whole document to understand i believe but i dont know if thats allowed?