assertEquals("http://192.168.1.1/path/file", HcHttpClient.constructRedirectLocation("http://192.168.1.1/path/", "file"));
        assertEquals("http://[2001:db8::1]/path/file", HcHttpClient.constructRedirectLocation("http://[2001:db8::1]/path/", "file"));
        assertEquals("http://example.com:8080/path/file", HcHttpClient.constructRedirectLocation("http://example.com:8080/path/", "file"));

minio-2.0.0.tar minio/Chart.yaml apiVersion: v1 appVersion: RELEASE.2021-08-25T00-41-18Z description: Multi-Cloud Object Storage home: https://min.io icon: https://min.io/resources/img/logo/MINIO_wordmark.png keywords: - storage - object-storage - S3 maintainers: - email: ******@****.*** name: MinIO, Inc name: minio sources: - https://github.com/minio/minio version: 2.0.0 minio/values.yaml ## Provide a name in place of minio for `app:` labels ## nameOverride: "" ## Provide a name to substitute for...

        setFlags2(config.getFlags2());

        if (config.getMinimumVersion().isSMB2()) {
            this.dialects = new String[] { "SMB 2.???", "SMB 2.002" };
        } else if (config.getMaximumVersion().isSMB2()) {
            this.dialects = new String[] { "NT LM 0.12", "SMB 2.???", "SMB 2.002" };
        } else {
            this.dialects = new String[] { "NT LM 0.12" };
        }
    }

    /**
     * {@inheritDoc}
     *

        long delay2 = policy.getDelayMs(2);
        long delay3 = policy.getDelayMs(3);

        // Then - All delays should be the same
        assertEquals(2000, delay1);
        assertEquals(2000, delay2);
        assertEquals(2000, delay3);
    }

    @Test
    @DisplayName("Should provide meaningful toString output")
    void testToString() {
        // Given

    assertThat(parse("http://[2001:db8::1]/").host).isEqualTo("2001:db8::1")
    assertThat(parse("http://[2001:db8:0:0:0:0:2:1]/").host).isEqualTo("2001:db8::2:1")
    assertThat(parse("http://[2001:db8:0:1:1:1:1:1]/").host).isEqualTo("2001:db8:0:1:1:1:1:1")
    assertThat(parse("http://[2001:db8:0:0:1:0:0:1]/").host).isEqualTo("2001:db8::1:0:0:1")

        assertEquals(0, channelInfo.getErrors());

        channelInfo.addBytesSent(1000);
        channelInfo.addBytesReceived(2000);
        channelInfo.incrementRequestsSent();
        channelInfo.incrementErrors();

        assertEquals(1000, channelInfo.getBytesSent());
        assertEquals(2000, channelInfo.getBytesReceived());
        assertEquals(1, channelInfo.getRequestsSent());
        assertEquals(1, channelInfo.getErrors());

        byte[] payload = new byte[] { 1, 2, 3, 4 };

        w.start();

        // Wait until writer thread signals readiness
        synchronized (w) {
            long deadline = System.currentTimeMillis() + 2000;
            while (!w.isReady() && System.currentTimeMillis() < deadline) {
                w.wait(10);
            }
            assertTrue(w.isReady(), "WriterThread should be ready to accept work");

T1 V5 #define PL V30 #define PH V31 #define Z3L V23 #define Z3H V24 #define ZER V26 #define SEL1 V27 #define CAR1 V28 #define CAR2 V29 /* * http://www.hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2004-hmv * Cost: 4M + 4S + 1*half + 5add + 2*2 + 1*3. * Source: 2004 Hankerson–Menezes–Vanstone, page 91. * A = 3(X₁-Z₁²)×(X₁+Z₁²) * B = 2Y₁ * Z₃ = B×Z₁ * C = B² * D = C×X₁ * X₃ = A²-2D * Y₃ = (D-X₃)×A-C²/2 * * Three-operand formula: * T1 = Z1² * T2 = X1-T1 * T1 = X1+T1 * T2 = T2*T1 *...

    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // #1
    }
    stopwatch.sleepMillis(200); // #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(200); // #5: to repay for the last acquire

    for (int i = 0; i < 8; i++) {
      limiter.acquire(); // #1
    }
    stopwatch.sleepMillis(200); // #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(200); // #5: to repay for the last acquire