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]

>>22
Here's a non trivial example. Consider 'boolean' operations in C. I can think of a few cases where the set same of integers would map to *both* 'true' and 'false'. In such a case, this wouldn't be a function. Now shut your hole you non programming bitch.