Hash table

Is it ever possible to have a Hash table that can do get,put,remove @ O(1) for Strings?

calculating the hash for the String alone is O(n), is it not? [that's if you want to produce a good hash that won't collide all over the place]

>>38
Yes it will you stupid piece of shit, you don't even know what a subset is.

Does "every subset of a countable set is also countable" ring a bell?