}

  @Test fun successfulFindMatchingPins() {
    val certificatePinner =
      CertificatePinner
        .Builder()
        .add("first.com", certA1Sha256Pin, certB1Sha256Pin)
        .add("second.com", certC1Sha256Pin)
        .build()

    val expectedPins =
      listOf(
        Pin("first.com", certA1Sha256Pin),
        Pin("first.com", certB1Sha256Pin),
      )

        // Then
        assertEquals(2, written, "Should write 2 bytes");
        assertEquals(SmbComTransaction.TRANS2_FIND_NEXT2, dst[0], "First byte must be subCommand");
        assertEquals((byte) 0x00, dst[1], "Second byte must be 0");
    }

    /**
     * Validates writeParametersWireFormat encodes values in the correct order and endianness.
     */
    @Test
    void testWriteParametersWireFormat() {
        // Given

#### A "professional" attack { #a-professional-attack }

Of course, the attackers would not try all this by hand, they would write a program to do it, possibly with thousands or millions of tests per second. And they would get just one extra correct letter at a time.

## Événements envoyés par le serveur (SSE) { #server-sent-events-sse }

func (m *metacacheManager) initManager() {
	// Add a transient bucket.
	// Start saver when object layer is ready.
	go func() {
		objAPI := newObjectLayerFn()
		for objAPI == nil {
			time.Sleep(time.Second)
			objAPI = newObjectLayerFn()
		}

		t := time.NewTicker(time.Minute)
		defer t.Stop()

		var exit bool
		for !exit {
			select {
			case <-t.C:
			case <-GlobalContext.Done():
				exit = true

		return
	}

	durationStr := r.Form.Get(peerRESTDuration)
	duration, err := time.ParseDuration(durationStr)
	if err != nil || duration.Seconds() == 0 {
		duration = time.Second * 10
	}
	result := netperf(r.Context(), duration.Round(time.Second))
	peersLogIf(r.Context(), gob.NewEncoder(w).Encode(result))
}

    @Override
    public void clear() {
      backingMap.clear();
    }
  }

  /**
   * {@inheritDoc}
   *
   * <p>The set's iterator traverses the mappings for the first row, the mappings for the second
   * row, and so on.
   *
   * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the
   * time the cell is returned by a method call to the set or its iterator.
   */

                return 50;
            }
        });

        RescorerBuilder<?> result1 = ltrQueryRescorer.evaluate(params);
        assertNotNull(result1);

        // Second call without model name
        ComponentUtil.setFessConfig(new FessConfig.SimpleImpl() {
            @Override
            public String getLtrModelName() {
                return "";
            }

     * simple approach would be for each caller CAS it from null to a Set populated with its
     * exception. But there's another race: If the first thread fails with an exception and a second
     * thread immediately fails with the same exception:
     *
     * Thread1: calls setException(), which returns true, context switch before it can CAS
     * seenExceptionsField to its exception
     *

     *
     * @param primary true if primary
     */
    public void setPrimary(boolean primary) {
        this.isPrimary = primary;
    }

    /**
     * Get number of bytes sent
     *
     * @return bytes sent
     */
    public long getBytesSent() {
        return bytesSent.get();
    }

    /**
     * Get number of bytes received
     *
     * @return bytes received
     */