bits += signifRounded;
    /*
     * If signifRounded == 2^53, we'd need to set all of the significand bits to zero and add 1 to
     * the exponent. This is exactly the behavior we get from just adding signifRounded to bits
     * directly. If the exponent is MAX_DOUBLE_EXPONENT, we round up (correctly) to
     * Double.POSITIVE_INFINITY.
     */
    bits |= x.signum() & SIGN_MASK;

    subscriber.invokeSubscriberMethod(FIXTURE_ARGUMENT);

    assertTrue("Subscriber must call provided method", methodCalled);
    assertTrue(
        "Subscriber argument must be exactly the provided object.",
        methodArgument == FIXTURE_ARGUMENT);
  }

  public void testInvokeSubscriberMethod_exceptionWrapping() throws Throwable {
    Method method = getTestSubscriberMethod("exceptionThrowingMethod");

        it.close();

        // Assert
        assertFalse(it.hasNext());
        verify(tree, times(1)).release();
    }

    @Test
    @DisplayName("doCloseInternal throwing still releases exactly once and next() recovers")
    void closeInternalThrowsButReleases() throws Exception {
        // Arrange
        stubAcquireReturnsSelf();
        FileEntry initial = entry("first");

        format.formatRate(builder, 0.0);
        assertEquals("0.0 B/s", builder.build());

        // Test rate at exactly 1000 (1 kB/s)
        builder = new DefaultMessageBuilder();
        format.formatRate(builder, 1000.0);
        assertEquals("1.0 kB/s", builder.build());

        // Test rate at exactly 1000000 (1 MB/s)
        builder = new DefaultMessageBuilder();
        format.formatRate(builder, 1000000.0);

    for (int i = 1; i < 900; i += 2) {
      if (!falsePositives.contains(i)) {
        assertFalse("BF should not contain " + i, bf.mightContain(Integer.toString(i)));
      }
    }

    // Check that there are exactly 29824 false positives for this BF.
    int knownNumberOfFalsePositives = 29824;
    int numFpp = 0;
    for (int i = 1; i < numInsertions * 2; i += 2) {
      if (bf.mightContain(Integer.toString(i))) {
        numFpp++;

      try {
        return unbox(countMap.remove(element));
      } catch (NullPointerException | ClassCastException e) {
        return 0;
      }
    }

    /**
     * Removes exactly the specified number of occurrences of {@code element}, or makes no change if
     * this is not possible.
     *
     * <p>This method, in contrast to {@link #remove(Object, int)}, has no effect when the element

        for (int i = 0; i < WinError.WINERR_CODES.length; i++) {
            handler.handle(WinError.WINERR_CODES[i], WinError.WINERR_MESSAGES[i]);
        }

        // Verify the collaborator is invoked exactly N times
        verify(handler, times(WinError.WINERR_CODES.length)).handle(anyInt(), anyString());

        // Capture one known interaction to verify argument integrity

@NullUnmarked
public class AbstractPackageSanityTestsTest extends TestCase {
  /*
   * This is a public type so that the Android test runner can create an instance directly as it
   * insists upon doing. It then runs the test, which behaves exactly like this package's existing
   * PackageSanityTests. (The test would run on the JVM, too, if not for the suppression below, and
   * that would be a problem because it violates small-test rules. Note that we strip the

                .filter(f -> Modifier.isStatic(f.getModifiers()))
                .filter(f -> Modifier.isFinal(f.getModifiers()))
                .count();

        assertEquals(8, constantCount, "Should have exactly 8 constant fields");
    }

    @Test
    @DisplayName("Test constant naming convention")
    void testConstantNamingConvention() {
        Field[] fields = SecurityInfo.class.getDeclaredFields();

    @NullAndEmptySource
    @ValueSource(strings = { " \t\n" })
    void handlesNullAndEmptyNames(String name) throws Exception {
        // Filter accepts only when name is exactly null, otherwise false
        SmbFilenameFilter filter = (dir, n) -> n == null;

        boolean result = filter.accept(mockDir, name);

        if (name == null) {