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]

>>56
Let me try to understand this Kodak, you define true to be 3 and false to be 2, your complaint is now that every comparison in C will fall outside of true and false?

In that case the function defined in >>18 applied on the comparisons would return false, since the results are outside of {true, false}, so it's still a function.