*   <li>If you override {@link #tearDown}, make sure to invoke {@code super.tearDown} within it.
 *       This method is used to clear and check for thread assertion failures.
 *   <li>All threads generated must be joined inside each test case method (or {@code fail} to do
 *       so) before returning from the method. The {@code joinPool} method can be used to do this
 *       when using Executors.
 * </ol>
 *
 * <p><b>Other notes</b>
 *
 * <ul>

 * available online).
 * <p>
 * Direct ACEs are evaluated first in order. The SID of the user performing
 * the operation and the desired access bits are compared to the SID
 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access

    @Mock
    private CommonServerMessageBlockRequest splitRequest;

    @Mock
    private CommonServerMessageBlockRequest cancelRequest;

    @BeforeEach
    void setUp() {
        // Reset mocks before each test
        reset(request, nextRequest, splitRequest, cancelRequest);
    }

    @Test
    @DisplayName("Test isResponseAsync returns true when response is async")
    void testIsResponseAsyncTrue() {
        // Given

            // When
            for (int i = 0; i < threadCount; i++) {
                final int index = i;
                threads[i] = new Thread(() -> {
                    // Each thread performs multiple operations
                    for (int j = 0; j < 100; j++) {
                        boolean hasNext = sharedIterator.hasNext();
                        SmbResource next = sharedIterator.next();

	BLAKE2b512
)

// DefaultBitrotAlgorithm is the default algorithm used for bitrot protection.
const (
	DefaultBitrotAlgorithm = HighwayHash256S
)

// ObjectPartInfo Info of each part kept in the multipart metadata
// file after CompleteMultipartUpload() is called.
type ObjectPartInfo struct {
	ETag       string            `json:"etag,omitempty" msg:"e"`

                characteristics,
                estimatedSize),
            isParallel)
        .onClose(() -> closeAll(streams));
  }

  /**
   * Returns a stream in which each element is the result of passing the corresponding element of
   * each of {@code streamA} and {@code streamB} to {@code function}.
   *
   * <p>For example:
   *
   * {@snippet :
   * Streams.zip(
   *     Stream.of("foo1", "foo2", "foo3"),

   * index.
   *
   * <p>Its size must be a power of two.
   */
  private transient int[] table;

  /**
   * Contains the logical entries, in the range of [0, size()). The high 32 bits of each long is the
   * smeared hash of the element, whereas the low 32 bits is the "next" pointer (pointing to the
   * next entry in the bucket chain). The pointers in [size(), entries.length) are all "null"
   * (UNSET).
   */

                    WitnessAsyncNotifyMessage.WitnessNotificationResponse response = rpcClient.getAsyncNotifications(contextHandle);

                    if (response != null) {
                        // Process each notification message
                        for (WitnessAsyncNotifyMessage.WitnessNotificationMessage message : response.getMessages()) {
                            processAsyncNotificationMessage(registration, message);

    }

    @Test
    @DisplayName("Should handle all capability flags")
    void testAllCapabilityFlags() throws SMBProtocolDecodingException {
        // Test each capability flag individually
        int[] capabilityFlags = { Smb2TreeConnectResponse.SMB2_SHARE_CAP_DFS,
                Smb2TreeConnectResponse.SMB2_SHARE_CAP_CONTINUOUS_AVAILABILITY, Smb2TreeConnectResponse.SMB2_SHARE_CAP_SCALEOUT,

func (rl ReplicationLatency) merge(other ReplicationLatency) (newReplLatency ReplicationLatency) {
	newReplLatency.UploadHistogram = rl.UploadHistogram.Merge(other.UploadHistogram)
	return newReplLatency
}

// Get upload latency of each object size range
func (rl ReplicationLatency) getUploadLatency() (ret map[string]uint64) {
	ret = make(map[string]uint64)
	avg := rl.UploadHistogram.GetAvgData()
	for k, v := range avg {