docs: private int getHashForExistingEntry(long key)
  	{
  		if (tc.isEntryEnabled()) Tr.entry(tc, "getHashForExistingEntry", new Object[]{new Long(key), this});
  		
  		int hash = getHashForKey(key);
  
          int i;
  
          for (i = 1; i < _mapSize && (_values[hash] == DELETED || (_values[hash] != null && _keys[hash] != key)); i++)
          {
              hash = (hash + i) % _mapSize;
          }
  
          if (i == _mapSize)
          {
              hash = -1;
          }
  		
  		if (tc.isEntryEnabled()) Tr.exit(tc, "getHashForExistingEntry", new Integer(hash));		
  		return hash;
  	}