default:
			p.queueMRFSave(ri.ToMRFEntry())
			p.mu.RLock()
			maxLWorkers := p.maxLWorkers
			existing := len(p.lrgworkers)
			p.mu.RUnlock()
			maxLWorkers = min(maxLWorkers, LargeWorkerCount)
			if p.ActiveLrgWorkers() < maxLWorkers {
				workers := min(existing+1, maxLWorkers)
				p.ResizeLrgWorkers(workers, existing)
			}
		}
		return
	}

	var ch, healCh chan<- ReplicationWorkerOperation

	}{
		// Test case - 1.
		// Abort existing upload ID.
		{
			bucket:             bucketName,
			object:             objectName,
			uploadID:           uploadIDs[0],
			accessKey:          credentials.AccessKey,
			secretKey:          credentials.SecretKey,
			expectedRespStatus: http.StatusNoContent,
		},
		// Test case - 2.
		// Abort non-existing upload ID.
		{

    - [Client Binaries](#client-binaries-8)
    - [Server Binaries](#server-binaries-8)
  - [Major Themes](#major-themes)
  - [Features](#features)
  - [Known Issues](#known-issues)
  - [Notable Changes to Existing Behavior](#notable-changes-to-existing-behavior)
  - [Deprecations](#deprecations)
  - [Action Required Before Upgrading](#action-required-before-upgrading)
  - [External Dependency Version Information](#external-dependency-version-information)

        ReferenceEntry<K, V> first = table.get(index);

        // Look for an existing entry.
        for (e = first; e != null; e = e.getNext()) {
          K entryKey = e.getKey();
          if (e.getHash() == hash
              && entryKey != null
              && map.keyEquivalence.equivalent(key, entryKey)) {
            // We found an existing entry.

            ValueReference<K, V> valueReference = e.getValueReference();

        ReferenceEntry<K, V> first = table.get(index);

        // Look for an existing entry.
        for (e = first; e != null; e = e.getNext()) {
          K entryKey = e.getKey();
          if (e.getHash() == hash
              && entryKey != null
              && map.keyEquivalence.equivalent(key, entryKey)) {
            // We found an existing entry.

            ValueReference<K, V> valueReference = e.getValueReference();

		// sites. Latest changes would get applied but merge only the non transition details
		if existingRl, ok := rMap[id]; ok {
			clonedRl := rl.CloneNonTransition()
			clonedRl.Transition = existingRl.Transition
			clonedRl.NoncurrentVersionTransition = existingRl.NoncurrentVersionTransition
			rMap[id] = clonedRl
		} else {
			rMap[id] = rl
		}
	}

- Add admission plugin that validates PodGroup resources reference an existing Workload and match the declared PodGroupTemplate spec. ([#137464](https://github.com/kubernetes/kubernetes/pull/137464), [@helayoty](https://github.com/helayoty)) [SIG API Machinery, Apps, Auth, CLI, Cloud Provider, Etcd, Node, Scheduling and Testing]...

- [v1.4.0](#v140)
  - [Downloads](#downloads-5)
  - [Major Themes](#major-themes)
  - [Features](#features)
  - [Known Issues](#known-issues)
  - [Notable Changes to Existing Behavior](#notable-changes-to-existing-behavior)
    - [Deployments](#deployments)
    - [kubectl rolling-update: < v1.4.0 client vs >=v1.4.0 cluster](#kubectl-rolling-update--v140-client-vs-v140-cluster)

   * put()} and {@code putAll()} methods throw an {@link IllegalArgumentException}. Similarly, the
   * map's entries have a {@link Entry#setValue} method that throws an {@link
   * IllegalArgumentException} when the existing key and the provided value don't satisfy the
   * predicate.
   *
   * <p>When methods such as {@code removeAll()} and {@code clear()} are called on the filtered map

   * put()} and {@code putAll()} methods throw an {@link IllegalArgumentException}. Similarly, the
   * map's entries have a {@link Entry#setValue} method that throws an {@link
   * IllegalArgumentException} when the existing key and the provided value don't satisfy the
   * predicate.
   *
   * <p>When methods such as {@code removeAll()} and {@code clear()} are called on the filtered map