```

In response, the self-contained JWT id_token will be returned as shown below.

```
{

import java.util.function.Predicate;
import org.jspecify.annotations.Nullable;

/**
 * A {@link Collection} whose contents will never change, and which offers a few additional
 * guarantees detailed below.
 *
 * <p><b>Warning:</b> avoid <i>direct</i> usage of {@link ImmutableCollection} as a type (just as
 * with {@link Collection} itself). Prefer subtypes such as {@link ImmutableSet} or {@link

      return standardFirstEntry();
    }

    /*
     * We can't override lastEntry to delegate to standardLastEntry, as it would create an infinite
     * loop. Instead, we test standardLastEntry manually below.
     */

    @Override
    public @Nullable Entry<K, V> pollFirstEntry() {
      return standardPollFirstEntry();
    }

    @Override
    public @Nullable Entry<K, V> pollLastEntry() {

	newtierfi.TransitionStatus = ""
	newtierfi.SetTierFreeVersionID(fvIDs[1])
	report()
	_, err = xl.DeleteVersion(newtierfi)
	report()
	fatalErr(err)

	// At this point the version stack must look as below,
	// v3 --> free version      00000000-0000-0000-0000-0000000000f2 (from removal of null version)
	// v2 --> free version      00000000-0000-0000-0000-0000000000f1 (from overwriting of null version )

      char c = sequence.charAt(i);
      if (c < 0x800) {
        utf8Length += (0x7f - c) >>> 31; // branch free!
      } else {
        utf8Length += 2;
        // We can't use Character.isSurrogate(c) here and below because of GWT.
        if (MIN_SURROGATE <= c && c <= MAX_SURROGATE) {
          // Check that we have a well-formed surrogate pair.
          if (Character.codePointAt(sequence, i) == c) {

     * AggregateFutureStateFallbackAtomicHelperTest, as discussed in a comment in
     * AggregateFutureState.
     *
     * Here, we check that we're able to force AbstractFutureState to select SynchronizedHelper, and
     * below, we actually run the AbstractFutureTest methods under that scenario.
     */
    checkHelperVersion(NO_ATOMIC_REFERENCE_FIELD_UPDATER, "SynchronizedHelper");

                    return mapEntry("-- a", (Collection<String>) ImmutableSortedSet.of("--below"));
                  }

                  @Override
                  public Entry<String, Collection<String>> belowSamplesGreater() {
                    return mapEntry("-- b", (Collection<String>) ImmutableSortedSet.of("--below"));
                  }

                  @Override

			wantOk:       true,
		},
		{
			name:         "one zero, below quorum",
			m:            metaCacheEntries{inputSerialized[0], inputSerialized[0], inputSerialized[0], metaCacheEntry{}},
			r:            metadataResolutionParams{dirQuorum: 4, objQuorum: 4, strict: false},
			wantSelected: nil,
			wantOk:       false,
		},
		{
			name:         "one zero, below quorum, strict",

import org.jspecify.annotations.Nullable;

/**
 * A utility for performing a chained comparison statement. <b>Note:</b> Java 8+ users should
 * generally prefer the methods in {@link Comparator}; see <a href="#java8">below</a>.
 *
 * <p>Example usage of {@code ComparisonChain}:
 *
 * {@snippet :
 * public int compareTo(Foo that) {
 *   return ComparisonChain.start()
 *       .compare(this.aString, that.aString)

   */
  public static <R, C, V> TreeBasedTable<R, C, V> create(TreeBasedTable<R, C, ? extends V> table) {
    TreeBasedTable<R, C, V> result =
        // requireNonNull is safe, as discussed in rowComparator() below.
        new TreeBasedTable<>(
            requireNonNull(table.rowKeySet().comparator()), table.columnComparator());
    result.putAll(table);
    return result;
  }