getMap().inverse().values().remove(k0());
    expectMissing(e0());
  }

  @CollectionFeature.Require(SUPPORTS_ITERATOR_REMOVE)
  @CollectionSize.Require(absent = ZERO)
  public void testKeySetIteratorRemove() {
    int initialSize = getNumElements();
    Iterator<K> iterator = getMap().keySet().iterator();
    iterator.next();
    iterator.remove();
    assertEquals(initialSize - 1, getMap().size());

@SuppressWarnings("JUnit4ClassUsedInJUnit3")
public abstract class AbstractListIndexOfTester<E> extends AbstractListTester<E> {
  /** Override to call {@code indexOf()} or {@code lastIndexOf()}. */
  protected abstract int find(@Nullable Object o);

  /** Override to return "indexOf" or "lastIndexOf()" for use in failure messages. */
  protected abstract String getMethodName();

  @CollectionSize.Require(absent = ZERO)

     * @return an integer representing the exit code of the invocation (0 typically indicates success)
     * @throws InvokerException if an error occurs during the invocation process.
     */
    int invoke(@Nonnull InvokerRequest invokerRequest) throws InvokerException;

    /**
     * Closes and disposes of this {@link Invoker} instance, releasing any resources it may hold.

                "-PtestDistributionDogfoodingTag=alpine",
                "-PmaxTestDistributionLocalExecutors=0",
            ).joinToString(" ")
    }

    class TeamCityParallelTests(
        val numberOfBatches: Int,
    ) : ParallelizationMethod()

    companion object {
        private val objectMapper = ObjectMapper()

        fun fromJson(jsonObject: Map<String, Any>): ParallelizationMethod {
            val methodJsonNode =

 * master - 0:00
 * release - 1:00
 * release6x - 2:00
 * release7x - 3:00
 * ...
 * releaseNx - (N-4):00
 */
fun VersionedSettingsBranch.determineNightlyPromotionTriggerHour(): Int? {
    val oldReleasePattern = "release(\\d+)x".toRegex()
    return when (branchName) {
        "master" -> 0
        "release" -> 1
        else -> {
            val matchResult = oldReleasePattern.find(branchName)

    void releaseStoresAndZeroesBuffer() {
        BufferCacheImpl impl = new BufferCacheImpl(2, 10);

        byte[] b = new byte[10];
        // Fill with non-zero to verify zeroing on release
        for (int i = 0; i < b.length; i++) {
            b[i] = (byte) (i + 1);
        }

        // Act: release should zero immediately to avoid leaks
        impl.releaseBuffer(b);

        "toArray(overSizedE[]) should return the given array", array, collection.toArray(array));

    List<E> subArray = asList(array).subList(0, getNumElements());
    E[] expectedSubArray = createSamplesArray();
    for (int i = 0; i < getNumElements(); i++) {
      assertTrue(
          "toArray(overSizedE[]) should contain element " + expectedSubArray[i],
          subArray.contains(expectedSubArray[i]));
    }
    assertNull(

		cpuMetrics:          newCPUMetricsCache(),
		clusterDriveMetrics: newClusterStorageInfoCache(),
		nodesUpDown:         newNodesUpDownCache(),
	}
}

type nodesOnline struct {
	Online, Offline int
}

func newNodesUpDownCache() *cachevalue.Cache[nodesOnline] {
	loadNodesUpDown := func(ctx context.Context) (v nodesOnline, err error) {
		v.Online, v.Offline = globalNotificationSys.GetPeerOnlineCount()
		return v, err

	rng := rand.New(rand.NewSource(0))
	quorum := 0
	// Numbers of unique locks
	for _, locks := range []int{100, 1000, 1e6} {
		if testing.Short() && locks > 100 {
			continue
		}
		t.Run(fmt.Sprintf("%d-locks", locks), func(t *testing.T) {
			// Number of readers per lock...
			for _, readers := range []int{1, 10, 100} {
				if locks > 1000 && readers > 1 {
					continue
				}
				if testing.Short() && readers > 10 {

            }
            return cacheItem;
        }

        private static void evaluateArray(Object target, InterpolateObjectAction ctx) {
            int len = Array.getLength(target);
            for (int i = 0; i < len; i++) {
                Object value = Array.get(target, i);
                if (value != null) {
                    if (String.class == value.getClass()) {