// value will then be replaced by null, signaling that later entries with the same key should
    // be deleted.
    Map<K, @Nullable V> duplicates = null;
    int dupCount = 0;
    for (int i = 0; i < n; i++) {
      // requireNonNull is safe because the first `n` elements have been filled in.
      entryArray[i] = makeImmutable(requireNonNull(entryArray[i]));
      K key = entryArray[i].getKey();

    }

    private final String proto;
    private Map<String, Object> options = null;
    private final String server;
    private String endpoint = null;
    private UUID uuid = null;
    private int major;
    private int minor;

    DcerpcBinding(final String proto, final String server) {
        this.proto = proto;
        this.server = server;
    }

    /**
     * Get the protocol for this binding.

     */
    private static class TestInfo implements SmbBasicFileInfo {
        private final int attributes;
        private final long createTime;
        private final long lastWriteTime;
        private final long lastAccessTime;
        private final long size;

        TestInfo(int attributes, long createTime, long lastWriteTime, long lastAccessTime, long size) {
            this.attributes = attributes;

		XMLName                 xml.Name       `xml:"NoncurrentVersionExpiration"`
		NoncurrentDays          ExpirationDays `xml:"NoncurrentDays,omitempty"`
		NewerNoncurrentVersions int            `xml:"NewerNoncurrentVersions,omitempty"`
		MaxNoncurrentVersions   int            `xml:"MaxNoncurrentVersions,omitempty"`
	}

	var val noncurrentExpiration
	err := d.DecodeElement(&val, &startElement)
	if err != nil {
		return err
	}

    private final AtomicLong totalSuccesses = new AtomicLong(0);
    private final AtomicLong rejectedCalls = new AtomicLong(0);

    // Configuration
    private final int failureThreshold;
    private final int successThreshold;
    private final long timeoutMillis;

    /**
     * Creates a simple circuit breaker with default settings
     *
     * @param name the circuit breaker name
     */

        // Test with max value
        SMBUtil.writeInt8(0xFFFFFFFFFFFFFFFFL, dst, 8);
        for (int i = 8; i < 16; i++) {
            assertEquals((byte) 0xFF, dst[i]);
        }

        // Test with zero
        SMBUtil.writeInt8(0L, dst, 16);
        for (int i = 16; i < 24; i++) {
            assertEquals((byte) 0x00, dst[i]);
        }
    }

    @Test

        final int threadCount = 10;
        final Thread[] threads = new Thread[threadCount];
        final InvertibleCryptographer[] invertibles = new InvertibleCryptographer[threadCount];
        final OneWayCryptographer[] oneWays = new OneWayCryptographer[threadCount];

        for (int i = 0; i < threadCount; i++) {
            final int index = i;
            threads[i] = new Thread(() -> {

		// a size of 16 is encoded as `10` while a size of 64 KB
		// is `10000`.
		switch {
		case b >= '0' && b <= '9':
			size = size<<4 | int(b-'0')
		case b >= 'a' && b <= 'f':
			size = size<<4 | int(b-('a'-10))
		case b >= 'A' && b <= 'F':
			size = size<<4 | int(b-('A'-10))
		default:
			if cr.debug {
				fmt.Printf("err size: %v\n", string(b))
			}
			cr.err = errMalformedEncoding
			return n, cr.err

   *     zero instead.
   */
  @CanIgnoreReturnValue
  int setCount(@ParametricNullness E element, int count);

  /**
   * Conditionally sets the count of an element to a new value, as described in {@link
   * #setCount(Object, int)}, provided that the element has the expected current count. If the
   * current count is not {@code oldCount}, no change is made.
   *

    boolean supportsValuesHashCode = supportsValuesHashCode(map);
    if (supportsValuesHashCode) {
      int expectedEntrySetHash = 0;
      for (Entry<K, V> entry : entrySet) {
        assertTrue(map.containsKey(entry.getKey()));
        assertTrue(map.containsValue(entry.getValue()));
        int expectedHash =
            (entry.getKey() == null ? 0 : entry.getKey().hashCode())