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]

>>55
It's always a function since it outputs "true" only if the element in the set and "false" otherwise,

I have a set of unsigned integers. I make true = 3 and false equal = 2. Now I compare a set of data for equality. In this case your statement breaks down.