on 16 drive MinIO deployment. If you use eight data and eight parity drives, the file space usage will be approximately twice, i.e. 100 MiB
file will take 200 MiB space. But, if you use ten data and six parity drives, same 100 MiB file takes around 160 MiB. If you use 14 data and
two parity drives, 100 MiB file takes only approximately 114 MiB.

        assertArrayEquals(new byte[] { 10, 20, 30, 40, 50 }, buffer);
        // Note: There appears to be a bug in the implementation where readFully
        // incorrectly updates the file pointer twice
        assertEquals(10, smbRandomAccessFile.getFilePointer());
    }

        // Act: call methods, some multiple times
        String name = mockEntry.getName();
        int type1 = mockEntry.getType();
        int type2 = mockEntry.getType(); // called twice for interaction verification
        int attributes = mockEntry.getAttributes();
        long createTime = mockEntry.createTime();
        long lastModified = mockEntry.lastModified();

        assertTrue(ex.getMessage().contains("Server does not support NTLM authentication"));

        // Verify the decision consulted the configuration
        // getConfig() is called twice: once in Kerb5Authenticator and once in NtlmPasswordAuthenticator
        verify(tc, times(2)).getConfig();
        verify(config, times(1)).isAllowNTLMFallback();
        verify(config, times(1)).isUseRawNTLM();
    }

    }

    if (failedConnection != null) {
      val retryRoute = retryRoute(failedConnection)
      if (retryRoute != null) {
        // Lock in the route because retryRoute() is racy and we don't want to call it twice.
        nextRouteToTry = retryRoute
        return true
      }
    }

    // If we have a routes left, use 'em.
    if (routeSelection?.hasNext() == true) return true

    .header("User-Agent", "OkHttp Example")
    .build();

Response response = client.newCall(request).execute();
response.body().close();
```

When we run this code, the interceptor runs twice. Once for the initial request to `http://www.publicobject.com/helloworld.txt`, and another for the redirect to `https://publicobject.com/helloworld.txt`.

```

        shareInfo1.encode(mockNdrBuffer);

        // Verify the encode operations
        verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer, times(2)).enc_ndr_referent(null, 1); // Called twice for netname and remark
        verify(mockNdrBuffer).enc_ndr_long(0);
        // Should not encode strings if fields are null
        verify(mockDeferredBuffer, never()).enc_ndr_string(anyString());
    }

    @Test

   * @throws IllegalArgumentException if {@code node} is not an element of this graph
   */
  @Override
  Set<N> successors(N node);

  /**
   * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
   * the number of times an edge touches {@code node}).
   *
   * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
   *

   */
  protected long edgeCount() {
    long degreeSum = 0L;
    for (N node : nodes()) {
      degreeSum += degree(node);
    }
    // According to the degree sum formula, this is equal to twice the number of edges.
    checkState((degreeSum & 1) == 0);
    return degreeSum >>> 1;
  }

  /**
   * An implementation of {@link BaseGraph#edges()} defined in terms of {@link Graph#nodes()} and

func (w *Writer) Close() error {
	if w.last != nil && !w.last.closed {
		if err := w.last.close(); err != nil {
			return err
		}
		w.last = nil
	}
	if w.closed {
		return errors.New("zip: writer closed twice")
	}
	w.closed = true

	// write central directory
	start := w.cw.count
	for _, h := range w.dir {
		var buf [directoryHeaderLen]byte
		b := writeBuf(buf[:])
		b.uint32(uint32(directoryHeaderSignature))