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]

>>27
In C, it's possible to have boolean mappings that aren't one to one, and hence, not a function. Man, learn how languages like C work you no talent programming bitch.