Hi.
If I have 10000 strings, for example, and I want to read a file to see if each
string I come across is in my 10000 strings, is HashMap the best way to store my list of 10000 as keys (assigning a null value to each) and use the containsKey() method the quickest method to see if they are in there or is there a quicker way of doing this? Note I am more interested in speed rather than memory usage here (assume I have infinite memory!).
Thanks.
Sam