Returns true if this map contains a mapping for the specified string key.
Returns true if this map contains a mapping for the specified string key.More formally, returns true if and only if this map contains a mapping for a key k such that (key==null ? k==null : memcmp( key, k, keyLength ) == 0. (There can be at most one such mapping.)
For hash maps his method has a time complexity of O(1). For tree maps this method has a time complexity of O(Log N).