this.inputList = ImmutableList.sortedCopyOf(comparator, input);
      this.comparator = comparator;
      this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is

    checkNotNull(valueFunction);
    /*
     * We will always fail if there are duplicate keys, and the keys are always sorted by
     * the Comparator, so the entries can come in an arbitrary order -- so we report UNORDERED.
     */
    return Collector.of(
        () -> new ImmutableSortedMap.Builder<K, V>(comparator),
        (builder, input) -> builder.put(keyFunction.apply(input), valueFunction.apply(input)),

    checkNotNull(valueFunction);
    /*
     * We will always fail if there are duplicate keys, and the keys are always sorted by
     * the Comparator, so the entries can come in an arbitrary order -- so we report UNORDERED.
     */
    return Collector.of(
        () -> new ImmutableSortedMap.Builder<K, V>(comparator),
        (builder, input) -> builder.put(keyFunction.apply(input), valueFunction.apply(input)),

		if mv.ValueType == jstream.Object {
			// This is a JSON object type (that preserves key order)
			kvs, ok := mv.Value.(jstream.KVS)
			if ok {
				for _, kv := range kvs {
					if sset.Contains(kv.Key) {
						// Reject duplicate conditions or expiration.
						return nil, fmt.Errorf("input policy has multiple %s, please fix your client code", kv.Key)
					}
					sset.Add(kv.Key)
				}
			}
			e.Encode(kvs)
		}
	}

* Fixes issue where masquerade rules are flushed in GCE k8s clusters. ([#56728](https://github.com/kubernetes/kubernetes/pull/56728), [@dnardo](https://github.com/dnardo))
* kubelet: fix bug where `runAsUser: MustRunAsNonRoot` strategy didn't reject a pod with a non-numeric `USER`. ([#56711](https://github.com/kubernetes/kubernetes/pull/56711), [@php-coder](https://github.com/php-coder))

                }
              }
            });

    assertTrue(a.compareAndSet(0, 1.0, 2.0));
    awaitTermination(t);
    assertBitEquals(3.0, a.get(0));
  }

  /** repeated weakCompareAndSet succeeds in changing value when equal to expected */
  public void testWeakCompareAndSet() {
    AtomicDoubleArray aa = new AtomicDoubleArray(SIZE);
    for (int i : new int[] {0, SIZE - 1}) {

        File expiredFile = new File(dir1, "expired.png");
        expiredFile.createNewFile();
        expiredFile.setLastModified(System.currentTimeMillis() - 10000L);

        File recentFile = new File(dir1, "recent.png");
        recentFile.createNewFile();
        recentFile.setLastModified(System.currentTimeMillis());

        // Override purge to avoid client operations

Try to be as specific and objective as possible, avoid generalizations.

For conversations that are more difficult, for example to reject a PR, you can ask me (@tiangolo) to handle it directly.

## Edit PR Titles

* Edit the PR title to start with an emoji from [gitmoji](https://gitmoji.dev/).

{ return nil, nil, errors.New("extendedGCD: both a and m are even") } size := max(len(a.limbs), len(m.limbs)) u = NewNat().set(a).expand(size) v := NewNat().set(m).expand(size) A = NewNat().reset(len(m.limbs)) A.limbs[0] = 1 B := NewNat().reset(len(a.limbs)) C := NewNat().reset(len(m.limbs)) D := NewNat().reset(len(a.limbs)) D.limbs[0] = 1 // Before and after each loop iteration, the following hold: // // u = A*a - B*m // v = D*m - C*a // 0 < u <= a // 0 <= v <= m // 0 <= A < m // 0 <= B <= a // 0...

   * ForwardingNavigableMap#descendingMap} to forward to this implementation or a subclass thereof.
   *
   * <p>In particular, this map iterates over entries with repeated calls to {@link
   * NavigableMap#lowerEntry}. If a more efficient means of iteration is available, you may wish to
   * override the {@code entryIterator()} method of this class.
   *
   * @since 12.0
   */