return emptyMap();
              }
            })
        .named("emptyMap")
        .withFeatures(CollectionFeature.SERIALIZABLE, CollectionSize.ZERO)
        .suppressing(suppressForEmptyMap())
        .createTestSuite();
  }

  public Test testsForEmptyNavigableMap() {
    return MapTestSuiteBuilder.using(
            new TestStringSortedMapGenerator() {

        }

        RequestWithFileId request = new Smb2CloseRequest(mockConfig, emptyFileId);

        // All patterns should be accepted
        assertDoesNotThrow(() -> request.setFileId(allZeros), "Should handle all-zeros file ID");
        assertDoesNotThrow(() -> request.setFileId(allOnes), "Should handle all-ones file ID");
        assertDoesNotThrow(() -> request.setFileId(alternating), "Should handle alternating pattern file ID");
    }

   * For example, the cache may evict an entry because it hasn't been used recently or very often.
   *
   * <p>If {@code maximumSize} is zero, elements will be evicted immediately after being loaded into
   * cache. This can be useful in testing, or to disable caching temporarily.
   *
   * <p>This feature cannot be used in conjunction with {@link #maximumWeight}.

        TransWaitNamedPipe pipe = new TransWaitNamedPipe("\\\\pipe\\testPipe");
        byte[] dst = new byte[10];

        // writeSetupWireFormat writes 4 bytes:
        // - subCommand byte
        // - 3 zero bytes (padding and no FID)
        int written = pipe.writeSetupWireFormat(dst, 0);

        assertEquals(4, written, "Setup should write 4 bytes");

    }

    // Supplies a range of normal and edge case values.
    private static Stream<Arguments> valueProvider() {
        return Stream.of(Arguments.of(0, 0L, 0L, 0L, 0L), // all zeros
                Arguments.of(1, 1L, 1L, 1L, 1L), // ones
                Arguments.of(123, 456L, 789L, 101112L, 131415L), // arbitrary positives

### Request metrics

Metrics about requests served by the current node.

| Path            | Description                                   |
|-----------------|-----------------------------------------------|
| `/api/requests` | Metrics over all requests.                    |

	}

	if err := DB.Delete(&user).Error; err != nil {
		t.Fatalf("No error should happen when soft delete user, but got %v", err)
	}

	if sql.NullTime(user.DeletedAt).Time.IsZero() {
		t.Fatalf("user's deleted at is zero")
	}

	sql := DB.Session(&gorm.Session{DryRun: true}).Delete(&user).Statement.SQL.String()
	if !regexp.MustCompile(`UPDATE .users. SET .deleted_at.=.* WHERE .users.\..id. = .* AND .users.\..deleted_at. IS NULL`).MatchString(sql) {

  static int log10Floor(long x) {
    /*
     * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
     *
     * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
     * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
     * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
     */

    for (int a : TEST_INTS) {
      assertThrows(
          ArithmeticException.class,
          () -> {
            UnsignedInteger unused = UnsignedInteger.fromIntBits(a).dividedBy(UnsignedInteger.ZERO);
          });
    }
  }

  public void testMod() {
    for (int a : TEST_INTS) {
      for (int b : TEST_INTS) {
        if (b != 0) {

* Intégration Python facile avec **Jupyter Kernels** pour le développement à distance ou intra-Docker avec des extensions comme...