// When & Then
            assertEquals(Long.MIN_VALUE, allocInfo.getCapacity());
            assertEquals(Long.MIN_VALUE, allocInfo.getFree());
        }

        @Test
        @DisplayName("Should calculate used space correctly")
        void shouldCalculateUsedSpaceCorrectly() {
            // Given
            long capacity = 1024L * 1024L * 1024L * 100L; // 100GB
            long free = 1024L * 1024L * 1024L * 40L; // 40GB

        // Then
        assertNotNull(response);
        assertTrue(response instanceof Smb2TreeConnectResponse);
        verify(mockContext, times(1)).getConfig();
    }

    @Test
    @DisplayName("Should calculate correct message size for different paths")
    void testSize() {
        // Given
        String shortPath = "\\\\a\\b";
        String longPath = "\\\\server.domain.com\\very_long_share_name_here";

     * @return the quantile value
     */
    public double computeInPlace(double... dataset) {
      checkArgument(dataset.length > 0, "Cannot calculate quantiles of an empty dataset");
      if (containsNaN(dataset)) {
        return NaN;
      }

      // Calculate the quotient and remainder in the integer division x = k * (N-1) / q, i.e.

        final long totalBytes = runtime.totalMemory();
        return totalBytes - freeBytes;
    }

    /**
     * Estimates the size of an object in bytes.
     *
     * @param obj the object to calculate size for
     * @return estimated size in bytes
     */
    public static long sizeOf(final Object obj) {
        if (obj == null) {
            return 0L;
        }
        if (obj instanceof String) {

    void testWriteBytesWireFormatHappy() throws UnsupportedEncodingException {
        byte[] buffer = new byte[50];
        int used = cmd.writeBytesWireFormat(buffer, 0);
        // Calculate expected size: 1 byte for command + string bytes + 1 null terminator
        byte[] expectedString = "testfile.txt".getBytes("windows-1252");

        // Prepare test data
        String shareName = "SHARE1";
        int shareType = 0x00000000; // Disk share
        String remark = "Test share";

        // Calculate buffer size
        int shareNameSize = 14; // 13 bytes + null terminator (fixed field)
        int typeSize = 2;
        int offsetSize = 4;
        int remarkSize = remark.length() + 1;

	maxPartsCount             = 10000
	maxPartSize               = 1024 * 1024 * 1024 * 5
	minPartSize               = 1024 * 1024 * 128 // chosen by us to be optimal for HDDs
)

// optimalPartInfo - calculate the optimal part info for a given
// object size.
//
// NOTE: Assumption here is that for any object to be uploaded to any S3 compatible
// object storage it will have the following parameters as constants.
//

 *
 * @author James Sexton
 * @param <N> Node parameter type
 */
abstract class AbstractBaseGraph<N> implements BaseGraph<N> {

  /**
   * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}.
   * This implementation requires O(|N|) time. Classes extending this one may manually keep track of
   * the number of edges as the graph is updated, and override this method for better performance.

    }

    /**
     * Clear all pending operations
     */
    public void clearPendingOperations() {
        pendingOperations.clear();
    }

    /**
     * Calculate channel score for load balancing (higher is better)
     *
     * @return channel score
     */
    public int getScore() {
        int score = 100;

        // Adjust based on state

        String.format("expected: %08x, actual: %08x", expectedCrc, actualCrc),
        expectedCrc,
        actualCrcHasher);
  }

  // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41.
  // We calculate the constant below by:
  //   1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41
  //   2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78