if (key == null) {
      return null;
    }
    int hash = hash(key);
    return segmentFor(hash).getEntry(key, hash);
  }

  @Override
  public boolean containsKey(@Nullable Object key) {
    if (key == null) {
      return false;
    }
    int hash = hash(key);
    return segmentFor(hash).containsKey(key, hash);
  }

  @Override

# v1.3.2

[Documentation](http://kubernetes.github.io) & [Examples](http://releases.k8s.io/release-1.3/examples)

## Downloads

binary | sha1 hash | md5 hash
------ | --------- | --------
[kubernetes.tar.gz](https://storage.googleapis.com/kubernetes-release/release/v1.3.2/kubernetes.tar.gz) | `f46664d04dc2966c77d8727bba57f57b5f917572` | `1a5b0639941054585d0432dd5ce3abc7`

        adjust = ~~adjust;
        // in GWT, we have to deal with integer overflow carefully
      }
      int hash = 1;
      for (Set<E> axis : axes) {
        hash = 31 * hash + (size() / axis.size() * axis.hashCode());

        hash = ~~hash;
      }
      hash += adjust;
      return ~~hash;
    }
  }

  /**
   * Returns the set of all possible subsets of {@code set}. For example, {@code

                log.error("Failed to update pre-auth integrity hash", e);
                // Reset hash on error to maintain integrity
                resetPreauthHash();
                throw new CIFSException("Pre-authentication integrity hash update failed", e);
            }
        }
    }

    /**
     * Reset the pre-authentication integrity hash to initial state.

labels.crawler=Rastreador
labels.crudMode=Modo
labels.errorCountMax=Número máximo de errores
labels.errorCountMin=Número mínimo de errores
labels.facet=Faceta
labels.geo=Geo
labels.groups=Grupos
labels.hash=Hash
labels.maxSize=Tamaño máximo
labels.order=Orden
labels.purgeSuggestSearchLogDay=Eliminar información de sugerencias anterior
labels.q=Consulta
labels.roles=Roles

  }

  /**
   * Sets the minimum total size for the internal hash tables. For example, if the initial capacity
   * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
   * having a hash table of size eight. Providing a large enough estimate at construction time

        this.preauthIntegrityHash = preauthIntegrity ? trans.getPreauthIntegrityHash() : null;

        if (this.preauthIntegrityHash != null && log.isDebugEnabled()) {
            log.debug("Initial session preauth hash " + Hexdump.toHexString(this.preauthIntegrityHash));
        }

        while (true) {
            Subject s = this.credentials.getSubject();
            if (ctx == null) {

labels.confirmPassword=पुष्टि करें
labels.crawler=क्रॉलर
labels.crudMode=मोड
labels.errorCountMax=अधिकतम त्रुटि गणना
labels.errorCountMin=न्यूनतम त्रुटि गणना
labels.facet=फ़ेसेट
labels.geo=भू
labels.groups=समूह
labels.hash=हैश
labels.maxSize=अधिकतम आकार
labels.order=क्रम
labels.purgeSuggestSearchLogDay=पुरानी सुझाव जानकारी हटाएं
labels.q=क्वेरी
labels.roles=भूमिकाएं
labels.suggestSearchLog=सुझाव खोज लॉग

  }

  /**
   * Sets the minimum total size for the internal hash tables. For example, if the initial capacity
   * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
   * having a hash table of size eight. Providing a large enough estimate at construction time

    assertEquals(original, map);
  }

  public void testCapacityForNegativeSizeFails() {
    assertThrows(IllegalArgumentException.class, () -> Maps.capacity(-1));
  }

  /**
   * Tests that nHMWES makes hash maps large enough that adding the expected number of elements
   * won't cause a rehash.
   *
   * <p>As of jdk7u40, HashMap has an empty-map optimization. The argument to new HashMap(int) is