-->
<super-source path="super"/>

<inherits name="com.google.common.annotations.Annotations" />
<inherits name="com.google.common.base.Base" />
<inherits name="com.google.common.collect.Collect" />
<inherits name="com.google.gwt.core.Core" />
<inherits name="com.google.gwt.user.User" />
<inherits name="com.google.thirdparty.publicsuffix.PublicSuffixType" />

   *
   * <p>Note, however, that although multiple locks can be created for a given Enum value, whether
   * it be through separate factory instances or through multiple calls to the same factory,
   * attempting to acquire multiple locks with the same Enum value (within the same thread) will
   * result in an IllegalStateException regardless of the factory's policy. For example:
   *
   * {@snippet :

   * in progress.
   *
   * <p><b>Warning:</b> This method will produce different output than most other languages do when
   * running the same hash function on the equivalent input. For cross-language compatibility, use
   * {@link #putString}, usually with a charset of UTF-8. For other use cases, use {@code
   * putUnencodedChars}.
   *

        assertNotNull(result, "Unwrapped tree should not be null");
        assertSame(customTree, result, "Should return the same custom tree instance");
        verify(smbTree).unwrap(CustomSmbTree.class);
    }

    /**
     * Test for unwrap() method with the same type.
     * Verifies that unwrap can return itself when the type matches.
     */
    @Test
    void testUnwrap_withSameType() {

          newEntries[outI++] = entries[inI];
        }
      }
      return newEntries;
    }
  }

  /**
   * Returns an immutable map containing the same entries as {@code map}. The returned map iterates
   * over entries in the same order as the {@code entrySet} of the original map. If {@code map}
   * somehow contains entries with duplicate keys (for example, if it is a {@code SortedMap} whose

   * exactly one entry for each distinct element in the multiset (thus it always has the same size
   * as the {@link #elementSet}). The order of the elements in the element set is unspecified.
   *
   * <p>The entry set is backed by the same data as the multiset, so any change to either is
   * immediately reflected in the other. However, multiset changes may or may not be reflected in

        assertTrue(toStringResult.contains(message));
    }

    public void test_getMessage_consistency() {
        // Test that getMessage returns the same value consistently
        String message = "Consistent message";
        UnsupportedSearchException exception = new UnsupportedSearchException(message);

        String firstCall = exception.getMessage();

   */
  @CanIgnoreReturnValue
  @Override
  public SortedSet<V> removeAll(@Nullable Object key) {
    return (SortedSet<V>) super.removeAll(key);
  }

  /**
   * Stores a collection of values with the same key, replacing any existing values for that key.
   * The returned collection is immutable.
   *
   * <p>Because a {@code SortedSetMultimap} has unique sorted values for a given key, this method

    assertFalse(completed);
    thread.start();
    thread.join();
    assertTrue(completed);

    // Creating a new thread from the same ThreadFactory will have the same
    // pool ID but a thread ID of 2.
    Thread thread2 = threadFactory.newThread(monitoredRunnable);
    checkThreadPoolName(thread2, 2);
    assertEquals(

      response("https://example.com/", EMPTY) {
        header("Content-Encoding", "zstd")
        code(204)
        message("NO CONTENT")
      }

    val same = zstdInterceptor.decompress(response)

    val responseString = same.body.string()
    assertThat(responseString).isEmpty()
  }

  private fun ByteString.zstdCompress(): ByteString {
    val result = Buffer()