{+1, +1e9 - 1e6, "1.999"},
		{+1, +0e0 - 0e0, "1"},
		{+1, +1e6 - 0e0, "1.001"},
		{+1, +1e3 - 0e0, "1.000001"},
		{+1, +1e0 - 0e0, "1.000000001"},
		{0, 1e9 - 1e0, "0.999999999"},
		{0, 1e9 - 1e3, "0.999999"},
		{0, 1e9 - 1e6, "0.999"},
		{0, 0e0, "0"},
		{0, 1e6 + 0e0, "0.001"},
		{0, 1e3 + 0e0, "0.000001"},
		{0, 1e0 + 0e0, "0.000000001"},
		{-1, -1e9 + 1e0, "-1.999999999"},
		{-1, -1e9 + 1e3, "-1.999999"},

    assertThat(parse("http://[2001:db8:0000:0:1::1]").host).isEqualTo(a3)
    assertThat(parse("http://[2001:DB8:0:0:1::1]").host).isEqualTo(a3)
  }

  @Test
  fun hostIpv6AddressLeadingCompression() {
    assertThat(parse("http://[::0001]").host).isEqualTo("::1")
    assertThat(parse("http://[0000::0001]").host).isEqualTo("::1")

            b[off + 6] = 0x00;
            b[off + 7] = 0x00;
            return 8;
        }).when(raf).read(any(byte[].class), anyInt(), eq(8));
        assertEquals(1.0d, raf.readDouble(), 0.0000001);
    }

    @Test
    @DisplayName("readLine(): reads until newline and handles CRLF")
    void readLine_reads() throws Exception {
        SmbRandomAccessFile raf = spy(newInstance("r", false, false, false));

        // Owner SID at offset 20
        buffer.position(20);
        buffer.put((byte) 0x01); // Revision
        buffer.put((byte) 0x01); // SubAuthorityCount
        buffer.put(new byte[] { 0, 0, 0, 0, 0, 1 }); // IdentifierAuthority
        buffer.putInt(0); // SubAuthority

        // Group SID at offset 40
        buffer.position(40);
        buffer.put((byte) 0x01); // Revision

```

A response similar to this one should be displayed:

```
Generating RSA private key, 2048 bit long modulus
............................................+++
...........+++
e is 65537 (0x10001)
```

Alternatively, use the following command to generate a private RSA key protected by a password:

```sh
openssl genrsa -aes256 -passout pass:PASSWORD -out private.key 2048
```

  }

  /** Sanity checking with many combinations of false positive rates and expected insertions */
  public void testBasic() {
    for (double fpr = 0.0000001; fpr < 0.1; fpr *= 10) {
      for (int expectedInsertions = 1; expectedInsertions <= 10000; expectedInsertions *= 10) {
        checkSanity(BloomFilter.create(HashTestUtils.BAD_FUNNEL, expectedInsertions, fpr));
      }

    private final AtomicInteger consecutiveSuccesses = new AtomicInteger(0);

    // Hystrix-style windowed statistics
    private final RollingWindow rollingWindow = new RollingWindow(10, 1000); // 10 buckets, 1 second each

    /**
     * Create a circuit breaker with default settings
     *
     * @param name circuit breaker name for logging
     */
    public SmbCircuitBreaker(String name) {

    }

    @Test
    @DisplayName("Should check capability correctly")
    void testHaveCapability() throws Exception {
        // Given
        setPrivateField(response, "commonCapabilities", 0x2F); // 0010 1111

        // Then
        assertTrue(response.haveCapabilitiy(0x01)); // Has this bit
        assertTrue(response.haveCapabilitiy(0x0F)); // Has all these bits

        // P-node (01)
        System.arraycopy("PNODE           ".getBytes("US-ASCII"), 0, src, srcIndex + 19, 16);
        src[srcIndex + 34] = 0x00;
        src[srcIndex + 35] = 0x24; // 00100100 - P-node, active

        // M-node (10)
        System.arraycopy("MNODE           ".getBytes("US-ASCII"), 0, src, srcIndex + 37, 16);
        src[srcIndex + 52] = 0x00;

   * This method was written by Doug Lea with assistance from members of JCP JSR-166 Expert Group
   * and released to the public domain, as explained at
   * http://creativecommons.org/licenses/publicdomain
   *
   * As of 2010/06/11, this method is identical to the (package private) hash method in OpenJDK 7's
   * java.util.HashMap class.
   */
  // Copied from java/com/google/common/collect/Hashing.java
  private static int smear(int hashCode) {