@Test
  public void sizeConstraint() {
    Cache<Integer, Integer> cache = CacheBuilder.newBuilder().maximumSize(4).build();

    cache.put(1, 10);
    cache.put(2, 20);
    cache.put(3, 30);
    cache.put(4, 40);
    cache.put(5, 50);

    assertThat(cache.getIfPresent(10)).isNull();
    // Order required to remove dependence on access order / write order constraint.
    assertThat(cache.getIfPresent(2)).isEqualTo(20);

- github.com/prometheus/client_model: [v0.4.0 → v0.6.1](https://github.com/prometheus/client_model/compare/v0.4.0...v0.6.1)
- github.com/prometheus/common: [v0.44.0 → v0.55.0](https://github.com/prometheus/common/compare/v0.44.0...v0.55.0)
- github.com/prometheus/procfs: [v0.10.1 → v0.15.1](https://github.com/prometheus/procfs/compare/v0.10.1...v0.15.1)

- go.etcd.io/etcd/pkg/v3: v3.5.21 → v3.6.4
- go.etcd.io/etcd/server/v3: v3.5.21 → v3.6.4
- go.etcd.io/gofail: v0.1.0 → v0.2.0
- go.opentelemetry.io/contrib/instrumentation/github.com/emicklei/go-restful/otelrestful: v0.42.0 → v0.44.0
- go.opentelemetry.io/contrib/instrumentation/google.golang.org/grpc/otelgrpc: v0.58.0 → v0.60.0
- go.opentelemetry.io/contrib/propagators/b3: v1.17.0 → v1.19.0

highBits88 implements HighBits from FIPS 204 for γ2 = (q - 1) / 88. func highBits88(x uint32) byte { // Like highBits32, this is exhaustively tested in TestDecompose. r1 := (x + 127) >> 7 r1 = (r1*11275 + (1 << 23)) >> 24 r1 = constantTimeSelectEq(r1, 44, 0, r1) return byte(r1) } // decompose88 implements Decompose from FIPS 204 for γ2 = (q - 1) / 88. // // r1 is in [0, 43]. func decompose88(r fieldElement) (r1 byte, r0 int32) { x := fieldFromMontgomery(r) r1 = highBits88(x) // r - r1 * (2 * γ2) mod±...