import java.util.concurrent.RejectedExecutionException;
import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * A {@link Future} that accepts completion listeners. Each listener has an associated executor, and
 * it is invoked using this executor once the future's computation is {@linkplain Future#isDone()

        subscriberIterators.add(eventSubscribers.iterator());
      }
    }

    return Iterators.concat(subscriberIterators.iterator());
  }

  /**
   * A thread-safe cache that contains the mapping from each class to all methods in that class and
   * all super-classes, that are annotated with {@code @Subscribe}. The cache is shared across all
   * instances of this class; this greatly improves performance if multiple EventBus instances are

            return builder.recordStats().build(identityLoader());
          }
        });
  }

  private CacheBuilderFactory cacheFactory() {
    // This is trickier than expected. We plan to put 15 values in each of these (WARMUP_MIN to
    // WARMUP_MAX), but the tests assume no values get evicted. Even with a maximumSize of 100, one
    // of the values gets evicted. With weak keys, we use identity equality, which means using

                    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
}

// 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 {

   * plus the given elements, according to {@link #expectContents(java.util.Collection)}. In other
   * words, for the default {@code expectContents()} implementation, the number of occurrences of
   * each given element has increased by one since the test collection was created, and the number
   * of occurrences of all other elements has not changed.
   *

        // FileBasicInfo typically contains creation time, last access time, last write time, change time, and attributes
        byte[] buffer = new byte[40];

        // Mock times (8 bytes each)
        for (int i = 0; i < 32; i++) {
            buffer[i] = (byte) (i % 256);
        }

        // Mock attributes (4 bytes)
        buffer[32] = 0x01;
        buffer[33] = 0x00;

	envs := env.List("MINIO_")
	envValues := make(map[string]string, len(envs))
	for _, envK := range envs {
		// skip certain environment variables as part
		// of the whitelist and could be configured
		// differently on each nodes, update skipEnvs()
		// map if there are such environment values
		if _, ok := skipEnvs[envK]; ok {
			continue
		}
		envValues[envK] = logger.HashString(env.Get(envK, ""))
	}

        return immutableRangeSet;
      }
    }
    return new ImmutableRangeSet<>(ImmutableList.copyOf(rangeSet.asRanges()));
  }

  /**
   * Returns an {@code ImmutableRangeSet} containing each of the specified disjoint ranges.
   * Overlapping ranges and empty ranges are forbidden, though adjacent ranges are permitted and
   * will be merged.
   *