.addEqualityGroup(BloomFilter.create(byteArrayFunnel(), 100, 0.01))
        .addEqualityGroup(BloomFilter.create(byteArrayFunnel(), 100, 0.02))
        .addEqualityGroup(BloomFilter.create(byteArrayFunnel(), 200, 0.01))
        .addEqualityGroup(BloomFilter.create(byteArrayFunnel(), 200, 0.02))
        .addEqualityGroup(BloomFilter.create(unencodedCharsFunnel(), 100, 0.01))

# ADR-0001 - Use Architectural Decision Records

## Status

- ACCEPTED on 2023-12-01

## Context

In a distributed team with many subteams, the best solution to communicate decisions is to use a format accessible by everyone in charge of development.

We use *Specification* and *Discovery* documents stored in Google Drive, but they present some downsides:

    return PlainTextResponse("x" * 4000, status_code=200)


client = TestClient(app)


def test_middleware():
    response = client.get("/large", headers={"accept-encoding": "gzip"})
    assert response.status_code == 200, response.text
    assert response.text == "x" * 4000
    assert response.headers["Content-Encoding"] == "gzip"
    assert int(response.headers["Content-Length"]) < 4000
    response = client.get("/")

        setLastEventCheckTime(helper, 4000L);

        final List<EventInfo> events = helper.fetchNewEvents();

        assertTrue(events.isEmpty());
        assertEquals(4000L, getLastEventCheckTime(helper));
    }

    // ===================================================================================

0.591 responseHeadersStart
0.675 responseHeadersEnd
0.676 responseBodyStart
0.679 responseBodyEnd
0.679 connectionReleased
0.680 callEnd
REQUEST 2 (pooled connection)
0.000 callStart
0.001 connectionAcquired
0.001 requestHeadersStart
0.001 requestHeadersEnd
0.002 responseHeadersStart
0.082 responseHeadersEnd
0.082 responseBodyStart
0.082 responseBodyEnd
0.083 connectionReleased
0.083 callEnd
```

    for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
      int x = 1 << exponent;
      intValues.add(x, x + 1, x - 1);
    }
    intValues.add(9999).add(10000).add(10001).add(1000000); // near powers of 10
    intValues.add(5792).add(5793); // sqrt(2^25) rounded up and down
    POSITIVE_INTEGER_CANDIDATES = intValues.build();
    NEGATIVE_INTEGER_CANDIDATES =
        ImmutableList.copyOf(

    cache.put(654, 2675);
    fakeTicker.advance(10000, MILLISECONDS);
    cache.put(2456, 56);
    cache.put(2, 15);

    fakeTicker.advance(10001, MILLISECONDS);

    assertThat(cache.asMap().containsValue(15)).isTrue();
    assertThat(cache.asMap().containsValue(56)).isTrue();
    assertThat(cache.asMap().containsValue(2675)).isFalse();
  }

    cache.put(654, 2675);
    fakeTicker.advance(10000, MILLISECONDS);
    cache.put(2456, 56);
    cache.put(2, 15);

    fakeTicker.advance(10001, MILLISECONDS);

    assertThat(cache.asMap().containsValue(15)).isTrue();
    assertThat(cache.asMap().containsValue(56)).isTrue();
    assertThat(cache.asMap().containsValue(2675)).isFalse();
  }

    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // #1
    }
    stopwatch.sleepMillis(500); // #2: to repay for the last acquire
    stopwatch.sleepMillis(4000); // #3: becomes cold again
    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // // #4
    }
    stopwatch.sleepMillis(500); // #5: to repay for the last acquire

    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // #1
    }
    stopwatch.sleepMillis(500); // #2: to repay for the last acquire
    stopwatch.sleepMillis(4000); // #3: becomes cold again
    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // // #4
    }
    stopwatch.sleepMillis(500); // #5: to repay for the last acquire