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]

>>108
>>18 is describing a surjective function (domain is some set X, and the value of the function is true if the parameter is a member of X, and false otherwise) yet >>20 is claiming it's not a function. To be fair, it was horribly worded by >>18, but you're still a fucking retard.