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

      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);

import org.junit.jupiter.api.BeforeEach
import org.junit.jupiter.api.Tag
import org.junit.jupiter.api.Test
import org.junit.jupiter.api.Timeout
import org.junit.jupiter.api.io.TempDir

@Timeout(60)
@Tag("Slow")
@Burst
class DiskLruCacheTest(
  subject: Subject = Subject.System,
) {
  private val baseFilesystem: FileSystem = subject.create()
  private val filesystem = FaultyFileSystem(baseFilesystem)

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

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...

- github.com/rubiojr/go-vhd: [0bfd3b3 → 02e2102](https://github.com/rubiojr/go-vhd/compare/0bfd3b3...02e2102)
- github.com/sirupsen/logrus: [v1.4.2 → v1.6.0](https://github.com/sirupsen/logrus/compare/v1.4.2...v1.6.0)
- github.com/spf13/cobra: [v0.0.5 → v1.0.0](https://github.com/spf13/cobra/compare/v0.0.5...v1.0.0)
- github.com/spf13/viper: [v1.3.2 → v1.4.0](https://github.com/spf13/viper/compare/v1.3.2...v1.4.0)

- github.com/dustin/go-humanize: [v1.0.0](https://github.com/dustin/go-humanize/tree/v1.0.0)
- github.com/fatih/color: [v1.6.0](https://github.com/fatih/color/tree/v1.6.0)
- github.com/flynn/go-shlex: [3f9db97](https://github.com/flynn/go-shlex/tree/3f9db97)
- github.com/go-acme/lego: [v2.5.0+incompatible](https://github.com/go-acme/lego/tree/v2.5.0)

pkg syscall (netbsd-arm64-cgo), const ETHER_VLAN_ENCAP_LEN = 4
pkg syscall (netbsd-arm64-cgo), const ETHER_VLAN_ENCAP_LEN ideal-int
pkg syscall (netbsd-arm64-cgo), const ETIME = 92
pkg syscall (netbsd-arm64-cgo), const ETIMEDOUT = 60
pkg syscall (netbsd-arm64-cgo), const ETIME Errno
pkg syscall (netbsd-arm64-cgo), const ETOOMANYREFS = 59
pkg syscall (netbsd-arm64-cgo), const ETXTBSY = 26
pkg syscall (netbsd-arm64-cgo), const EUSERS = 68

    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