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]

>>84
What about something like

X = {1, 2, 3,....,2^n -1} and Y = ("true", "false"}

I can think some C code that would produce the following sequence...

1 -> "true"
2 -> "false"
1 -> "false"
2 -> "true'
3 -> value not in the set
value not in the set -> "true"