// before the cancelled future completes, it will synchronously complete both the newFuture
      // from the cancelled operation and its own. This can cause one runnable to queue two tasks,
      // breaking the invariant this method relies on to iteratively run the next task after the
      // previous one completes.
      if (get() == RunningState.CANCELLED) {
        delegate = null;
        sequencer = null;
        return;
      }

     */
    @Override
    public boolean equals(final Object obj) {
        if (obj instanceof final NtlmPasswordAuthentication ntlm) {

    }

    public void test_highlightedFields_withNull() {
        queryFieldConfig.highlightedFields = null;

        // When highlightedFields is null, the method should handle it gracefully
        // or throw an exception. Test the actual behavior.
        queryFieldConfig.highlightedFields(stream -> {
            // If it doesn't throw NPE, it should provide an empty stream

        .addHeader("h2", "v2")
        .socketHandler(body)
        .build(),
    )
    val request =
      Request
        .Builder()
        .url(server.url("/"))
        .method("POST", AsyncRequestBody())
        .build()
    val call = client.newCall(request)
    call.execute().use { response ->
      val sink = (request.body as AsyncRequestBody?)!!.takeSink()
      sink.writeUtf8("hey\n")

      for (Object e : elements) {
        array[i++] = (Double) e;
      }
      return create(array);
    }

    /**
     * Creates a new collection containing the given elements; implement this method instead of
     * {@link #create(Object...)}.
     */
    protected abstract List<Double> create(Double[] elements);

    @Override
    public Double[] createArray(int length) {
      return new Double[length];

            log.error("Failed to rotate key for session: {}", sessionId, e);
            throw new GeneralSecurityException("Key rotation failed", e);
        }
    }

    /**
     * Internal method to store key without updating rotation metadata
     */
    private void storeSessionKeyInternal(String sessionId, byte[] key, String algorithm) {
        if (key == null || sessionId == null) {

	public final fun header (Ljava/lang/String;)Ljava/lang/String;
	public final fun headers ()Lokhttp3/Headers;
	public final fun headers (Ljava/lang/String;)Ljava/util/List;
	public final fun isHttps ()Z
	public final fun method ()Ljava/lang/String;
	public final fun newBuilder ()Lokhttp3/Request$Builder;
	public final fun tag ()Ljava/lang/Object;
	public final fun tag (Ljava/lang/Class;)Ljava/lang/Object;

   * such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link
   * Collections#frequency}) can cause major performance problems.
   *
   * <p>The returned set's {@link Object#toString} method returns a shorthand form of the set's
   * contents, such as {@code "[1..100]}"}.
   *
   * @throws IllegalArgumentException if neither this range nor the domain has a lower bound, or if
   *     neither has an upper bound

   * the key is moved, deleted, or reinserted, it will account for that -- while not doing any extra
   * work if the key has not moved. One quirk: The {@link #getValue()} method can return {@code
   * null} even for a map which supposedly does not contain null elements, if the key is not present
   * when {@code getValue()} is called.
   */
  final class EntryForKey extends AbstractMapEntry<K, V> {

                } else if (s.equalsIgnoreCase("DNS")) {
                    this.resolverOrder.add(ResolverType.RESOLVER_DNS);
                } else {
                    log.error("unknown resolver method: " + s);
                }
            }
        }
    }

    /**
     * Initializes the minimum and maximum protocol versions from string values.
     *