return (totalLoadCount == 0) ? 0.0 : (double) loadExceptionCount / totalLoadCount;
  }

  /**
   * Returns the total number of nanoseconds the cache has spent loading new values. This can be
   * used to calculate the miss penalty. This value is increased every time {@code loadSuccessCount}
   * or {@code loadExceptionCount} is incremented.
   */
  @SuppressWarnings("GoodTime") // should return a java.time.Duration

    return (totalLoadCount == 0) ? 0.0 : (double) loadExceptionCount / totalLoadCount;
  }

  /**
   * Returns the total number of nanoseconds the cache has spent loading new values. This can be
   * used to calculate the miss penalty. This value is increased every time {@code loadSuccessCount}
   * or {@code loadExceptionCount} is incremented.
   */
  @SuppressWarnings("GoodTime") // should return a java.time.Duration

        // Given - large buffer with many notifications
        byte[] buffer = new byte[65536];
        int offset = 0;

        setHeaderStart(response, 64);

        // Calculate space for notifications
        int notificationSize = 32; // Each notification
        int notificationCount = 100;
        int totalSize = notificationSize * notificationCount;

        // Write structure

        // MS-SMB2 3.2.4.1.6: Alternative Channel Creation
        // Channel binding requires SMB2_SESSION_FLAG_BINDING (0x01) in session setup

        // Calculate channel binding hash per MS-SMB2 3.2.5.3.1
        byte[] bindingInfo = calculateBindingInfo(channel);
        byte[] bindingHash = calculateBindingHash(bindingInfo);
        channel.setBindingHash(bindingHash);

        // Add some elements
        for (int i = 0; i < expectedInsertions / 2; i++) {
          bf.put("element" + i);
        }

        // Calculate expected size based on bitSize()
        // Header: 1 byte (strategy) + 1 byte (hash functions) + 4 bytes (array length) = 6 bytes
        // Data: bitSize / 8 bytes
        long predictedSize = bf.bitSize() / 8 + 6;

			}
		}

		// Add the current part.
		fi.AddObjectPart(part.Number, part.ETag, part.Size, part.ActualSize, part.ModTime, part.Index, part.Checksums)
	}

	// Calculate full object size.
	var objectSize int64

	// Calculate consolidated actual size.
	var objectActualSize int64

	// Order online disks in accordance with distribution order.
	// Order parts metadata in accordance with distribution order.

   * reason that this is warmupPeriod/2 is to maintain the behavior of the original implementation
   * where coldFactor was hard coded as 3.)
   *
   * <p>It remains to calculate thresholdsPermits and maxPermits.
   *
   * <ul>
   *   <li>The time to go from thresholdPermits to 0 is equal to the integral of the function

	// was requested, fetch content without decrypting.
	if opts.Transition.RestoreRequest != nil || opts.NoDecryption {
		isEncrypted = false
		isCompressed = false
	}

	// Calculate range to read (different for encrypted/compressed objects)
	switch {
	case isCompressed:
		var firstPart int
		if opts.PartNumber > 0 {
			// firstPart is an index to Parts slice,

        // When
        boolean valid = response.isValid(mockContext, mockRequest);

        // Then
        assertTrue(valid);
    }

    @Test
    @DisplayName("Should calculate buffer sizes correctly")
    void testBufferSizeCalculations() throws Exception {
        // Given
        setResponseAsReceived(response);
        setPrivateField(response, "dialectRevision", 0x0300);

    FailedService(Service service) {
      super(
          service.toString(),
          service.failureCause(),
          false /* don't enable suppression */,
          false /* don't calculate a stack trace. */);
    }
  }