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]

>>44
You're right, C doesn't change the defintion of a subset. However, C's handling of booleans doesn impact the math defintion of a function.