If I have the value \"foo\", and a HashMap for which ftw.containsValue(\"foo\") returns true, how can I
I think your choices are
entrySet() and to find the keys which match the value. This is the slowest method, since it requires iterating through the entire collection, while the other two methods don't require that.