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]

>>121
That's kind of irrelevant.

When you say not in the set, you mean not in the domain of the function? That can't happen. By definition, any valid input is a member of the domain. If you mean not in the subset (Y, as I defined earlier), the value of the function will be "false". I don't see what not having a boolean type has to do with it. As long as you can represent "true" and "false", it's fine.