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]

>>52
Okay since you're obviously mentally challenged I will spoon feed you the information.

It's always a function since it outputs "true" only if the element in the set and "false" otherwise, since a set either contains an element or it doesn't it always has a value. Whether it is one to one doesn't matter, it's not a requirement to be a function.