askDisks = getListQuorum("strict", er.setDriveCount)
		}
	}

	var fallbackDisks []StorageAPI

	// Special case: ask all disks if the drive count is 4
	if er.setDriveCount == 4 || askDisks > len(disks) {
		askDisks = len(disks) // use all available drives
	}

	// However many we ask, versions must exist on ~50%
	listingQuorum := (askDisks + 1) / 2

	for i, c := range b {
		if 148 <= i && i < 156 {
			c = ' ' // Treat the checksum field itself as all spaces.
		}
		unsigned += int64(c)
		signed += int64(int8(c))
	}
	return unsigned, signed
}

// reset clears the block with all zeros.
func (b *block) reset() {
	*b = block{}
}

type headerV7 [blockSize]byte

    @Override public void proxySelectStart(Call call, HttpUrl url) {
      printEvent("proxySelectStart");
    }

    @Override public void proxySelectEnd(Call call, HttpUrl url, List<Proxy> proxies) {
      printEvent("proxySelectEnd");
    }

    @Override public void callStart(Call call) {
      printEvent("callStart");
    }

    @Override public void dnsStart(Call call, String domainName) {

    }

    /**
     * Release all leases
     */
    public void releaseAll() {
        lock.writeLock().lock();
        try {
            log.info("Releasing all {} leases", leases.size());
            leases.clear();
            pathToLease.clear();
        } finally {
            lock.writeLock().unlock();
        }
    }

    /**
     * Get all active leases
     *

   *
   * <p>Instead of throwing {@link ArithmeticException}, this method silently saturates to either
   * {@link Long#MAX_VALUE} or {@link Long#MIN_VALUE}. This behavior can be useful when decomposing
   * a duration in order to call a legacy API which requires a {@code long, TimeUnit} pair.
   */
  // We use this method only for cases in which we need to decompose to primitives.

   * Precondition tester for {@code Iterator.remove()} that throws an exception with a consistent
   * error message.
   */
  static void checkRemove(boolean canRemove) {
    checkState(canRemove, "no calls to next() since the last call to remove()");
  }

  private CollectPreconditions() {}

            "No mapping between account names and security IDs was done.", "The security ID structure is invalid.",
            "The file system is full.", "All pipe instances are busy.", "All pipe instances are busy.", "The pipe state is invalid.",
            "All pipe instances are busy.", "No process is on the other end of the pipe.", "The pipe is being closed.",

 * iterators that don't support {@code remove()}. Otherwise, all optional operations are supported.
 * Null row keys, columns keys, and values are not supported.
 *
 * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in
 * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs

        }

    }

    @Override
    protected void doConnect() throws IOException {
        try {
            // Use circuit breaker for connection attempts
            circuitBreaker.call(() -> {
                try {
                    doConnectInternal();
                    return null;
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }

        assertThrows(NullPointerException.class, () -> hyper.decode(null));
    }

    /**
     * Verify that the encode method forwards the value to NdrBuffer.
     */
    @Test
    @DisplayName("Encode should call NdrBuffer.enc_ndr_hyper with correct value")
    public void testEncodeInteraction() throws NdrException {
        NdrBuffer buf = mock(NdrBuffer.class);
        NdrHyper hyper = new NdrHyper(12345L);
        hyper.encode(buf);