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]

>>53
No it isn't. Consider the following case you bitch.

int true = 3;
int false = 2;

And use that in an expression that tests for "true" or "false".