return MoreObjects.firstNonNull(valueEquivalence, getValueStrength().defaultEquivalence());
  }

  /**
   * Sets the minimum total size for the internal hash tables. For example, if the initial capacity
   * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
   * having a hash table of size eight. Providing a large enough estimate at construction time

pkg syscall (freebsd-arm64), const ESPIPE = 29
pkg syscall (freebsd-arm64), const ESRCH = 3
pkg syscall (freebsd-arm64), const ESTALE = 70
pkg syscall (freebsd-arm64), const ETIMEDOUT = 60
pkg syscall (freebsd-arm64), const ETOOMANYREFS = 59
pkg syscall (freebsd-arm64), const ETXTBSY = 26
pkg syscall (freebsd-arm64), const EUSERS = 68
pkg syscall (freebsd-arm64), const EV_ADD = 1

      headerEntries(":method", "GET"),
    )
  }

  @Test
  fun readLiteralHeaderWithIncrementalIndexingStaticName() {
    bytesIn.writeByte(0x7d) // == Literal indexed ==
    // Indexed name (idx = 60) -> "www-authenticate"
    bytesIn.writeByte(0x05) // Literal value (len = 5)
    bytesIn.writeUtf8("Basic")
    hpackReader!!.readHeaders()
    assertThat(hpackReader!!.getAndResetHeaderList())

- github.com/Azure/go-autorest/logger: [v0.1.0 → v0.2.0](https://github.com/Azure/go-autorest/compare/logger/v0.1.0...logger/v0.2.0)
- github.com/Azure/go-autorest/tracing: [v0.5.0 → v0.6.0](https://github.com/Azure/go-autorest/compare/tracing/v0.5.0...tracing/v0.6.0)
- github.com/Microsoft/go-winio: [fc70bd9 → v0.4.15](https://github.com/Microsoft/go-winio/compare/fc70bd9...v0.4.15)

  @Test
  fun cacheHit() {
    server.enqueue(
      MockResponse(
        headers =
          headersOf(
            "ETag",
            "v1",
            "Cache-Control",
            "max-age=60",
            "Vary",
            "Accept-Charset",
          ),
        body = "A",
      ),
    )
    client =
      client
        .newBuilder()
        .cache(cache)

      return b;
    } else if (b == 0) {
      return a; // similar logic
    }
    /*
     * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm. This is
     * >60% faster than the Euclidean algorithm in benchmarks.
     */
    int aTwos = Long.numberOfTrailingZeros(a);
    a >>= aTwos; // divide out all 2s
    int bTwos = Long.numberOfTrailingZeros(b);

    /** Connection check interval in seconds */
    protected int connectionCheckInterval = 5; // sec

    /** Idle connection timeout in milliseconds */
    protected long idleConnectionTimeout = 60 * 1000L; // 1min

    /** Pattern for matching HTTP redirect status codes */
    protected Pattern redirectHttpStatusPattern = Pattern.compile("[3][0-9][0-9]");

    /** Whether to use robots.txt disallow rules */

pkg syscall (darwin-arm64), const ESRCH = 3
pkg syscall (darwin-arm64), const ESTALE = 70
pkg syscall (darwin-arm64), const ETIME = 101
pkg syscall (darwin-arm64), const ETIME Errno
pkg syscall (darwin-arm64), const ETIMEDOUT = 60
pkg syscall (darwin-arm64), const ETOOMANYREFS = 59
pkg syscall (darwin-arm64), const ETXTBSY = 26
pkg syscall (darwin-arm64), const EUSERS = 68
pkg syscall (darwin-arm64), const EVFILT_AIO = -3

ft:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",J.appendChild(u).appendChild(l);var e=ie.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),J.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=C.c...

                }
              }
            ]
          }
        ]
      },
      "gridPos": {
        "h": 6,
        "w": 6,
        "x": 12,
        "y": 6
      },
      "id": 60,
      "options": {
        "legend": {
          "calcs": [],
          "displayMode": "list",
          "placement": "bottom",
          "showLegend": true
        },
        "tooltip": {