}

public abstract interface class okhttp3/sse/EventSource$Factory {
	public static final field Companion Lokhttp3/sse/EventSource$Factory$Companion;
	public static fun create (Lokhttp3/Call$Factory;)Lokhttp3/sse/EventSource$Factory;
	public abstract fun newEventSource (Lokhttp3/Request;Lokhttp3/sse/EventSourceListener;)Lokhttp3/sse/EventSource;
}

public final class okhttp3/sse/EventSource$Factory$Companion {

      listener: EventSourceListener,
    ): EventSource

    companion object {
      /**
       * Wraps a [Call.Factory] into [EventSource.Factory].
       */
      @JvmStatic
      @JvmName("create")
      fun Call.Factory.asEventSourceFactory(): Factory =
        Factory { request, listener ->
          val actualRequest =
            if (request.header("Accept") == null) {

    replaceWith =
      ReplaceWith(
        expression = "callFactory.asEventSourceFactory()",
        imports = ["okhttp3.sse.EventSource.Factory.Companion.asEventSourceFactory"],
      ),
    level = DeprecationLevel.WARNING,
  )
  @JvmStatic
  fun createFactory(callFactory: Call.Factory): EventSource.Factory = callFactory.asEventSourceFactory()

  @Deprecated(
    message = "Moved to extension function.",
    replaceWith =

  @StartStop
  private final MockWebServer server = new MockWebServer();

  @Test
  public void testEventSourceFactory() throws Exception {
    OkHttpClient client = new OkHttpClient();
    EventSource.Factory factory = EventSource.Factory.create(client);
    server.enqueue(
      new MockResponse.Builder()
        .body("data: hello\n\n")
        .setHeader("content-type", "text/event-stream")
        .build()
    );

      Request
        .Builder()
        .url(server.url("/"))
    if (accept != null) {
      builder.header("Accept", accept)
    }
    val request = builder.build()
    val factory = client.asEventSourceFactory()
    return factory.newEventSource(request, listener)
  }

import org.jspecify.annotations.Nullable;

/**
 * An accumulator that selects the "top" {@code k} elements added to it, relative to a provided
 * comparator. "Top" can mean the greatest or the lowest elements, specified in the factory used to
 * create the {@code TopKSelector} instance.
 *
 * <p>If your input data is available as a {@link Stream}, prefer passing {@link

```

### Gradle Dependency
```gradle
implementation 'org.codelibs:corelib:0.7.0'
```

## 📖 Usage Examples

### Bean Utilities
```java
import org.codelibs.core.beans.*;
import org.codelibs.core.beans.factory.BeanDescFactory;
import org.codelibs.core.beans.util.BeanUtil;
import org.codelibs.core.beans.util.CopyOptions;

// Bean metadata introspection
BeanDesc beanDesc = BeanDescFactory.getBeanDesc(MyBean.class);

            for (i in 2..997) {
              sink.writeUtf8(String.format(" * $i = ${factor(i)}\n"))
            }
          }

          private fun factor(n: Int): String {
            for (i in 2 until n) {
              val x = n / i
              if (x * i == n) return "${factor(x)} × $i"
            }
            return n.toString()
          }
        }

   */
  public long approximateElementCount() {
    long bitSize = bits.bitSize();
    long bitCount = bits.bitCount();

    /*
     * Each insertion is expected to reduce the # of clear bits by a factor of
     * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 -
     * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x