* - Both request discover no existing connection. They both make a connection.
   * - The first request "wins the race".
   * - The second request discovers it "lost the race" and closes the connection it just opened.
   * - The second request uses the coalesced connection from request1.
   * - The coalesced connection is violently closed after servicing the first request.

    @ParameterizedTest(name = "SMB2 param: recursive={0}, filter={1}")
    @CsvSource({ "true, 0", "false, -1" })
    @DisplayName("watch() SMB2 parameterized branches execute without error")
    void watch_smb2_parameterized(boolean recursive, int filter) throws Exception {
        NotifyResponse resp = mock(NotifyResponse.class);
        when(resp.isReceived()).thenReturn(true);

 * @since 2.0
 */
@GwtCompatible
public abstract class ForwardingMap<K extends @Nullable Object, V extends @Nullable Object>
    extends ForwardingObject implements Map<K, V> {
  // TODO(lowasser): identify places where thread safety is actually lost

  /** Constructor for use by subclasses. */
  protected ForwardingMap() {}

  @Override
  protected abstract Map<K, V> delegate();

  @Override
  public int size() {

        || (stimuli.length >= 5 && removes > 2)) {
      // removes are the most expensive thing to test, since they often throw exceptions with stack
      // traces, so we test them a bit less aggressively
      return;
    }

    MultiExceptionListIterator reference = new MultiExceptionListIterator(expectedElements);
    I target = newTargetIterator();

FE38          ; disallowed_STD3_mapped ; 007D          # 1.1  PRESENTATION FORM FOR VERTICAL RIGHT CURLY BRACKET
FE39          ; mapped                 ; 3014          # 1.1  PRESENTATION FORM FOR VERTICAL LEFT TORTOISE SHELL BRACKET
FE3A          ; mapped                 ; 3015          # 1.1  PRESENTATION FORM FOR VERTICAL RIGHT TORTOISE SHELL BRACKET

 * amortized since some operations can trigger a hash table resize.
 *
 * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or
 * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like
 * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior.
 *
 * <p>This class should not be assumed to be universally superior to {@code

 * amortized since some operations can trigger a hash table resize.
 *
 * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or
 * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like
 * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior.
 *
 * <p>This class should not be assumed to be universally superior to {@code

    /**
     * Test for close() idempotency.
     * Verifies that calling close multiple times has the same effect as calling it once.
     */
    @Test
    void testClose_idempotency() {
        // Mock a tree that tracks close state
        SmbTree idempotentTree = mock(SmbTree.class);
        doNothing().when(idempotentTree).close();

        // Close multiple times
        idempotentTree.close();
        idempotentTree.close();

        this.skipMaskingForDebugLevel = enable;
        log.info("Skip masking for debug level {}", enable ? "enabled" : "disabled");
    }

    /**
     * Enable or disable stack trace inclusion
     *
     * @param enable true to include stack traces
     */
    public void setIncludeStackTrace(boolean enable) {
        this.includeStackTrace = enable;
    }

    /**
     * Set minimum log level
     *

# Hibernate Validator
# -------------------
constraints.CreditCardNumber.message = {item} est un numéro de carte de crédit non valide.
constraints.EAN.message = {item} est un code-barres {type} non valide.
constraints.Email.message = {item} n'est pas une adresse e-mail valide.
constraints.Length.message = La longueur de {item} doit être comprise entre {min} et {max}.