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]

>>122
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.

Having a boolean type gets around having a number outside of a set map to either 'true' or false'.

Hmm...ya know, I think I just lost all the minimum wage taco pushers who like to say "learn basic mathematics".