doTestGeneral(inRange('p', 'x'), 'q', 'z');
  }

  private void doTestGeneral(CharMatcher matcher, char match, char noMatch) {
    doTestOneCharMatch(matcher, "" + match);
    doTestOneCharNoMatch(matcher, "" + noMatch);
    doTestMatchThenNoMatch(matcher, "" + match + noMatch);
    doTestNoMatchThenMatch(matcher, "" + noMatch + match);
  }

  private void doTestOneCharMatch(CharMatcher matcher, String s) {

 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access
 * mask of the ACE, the whole access check fails. If the ACE is an "allow"
 * ACE and <i>all</i> of the bits in the desired access bits match bits in
 * the access mask of the ACE, the access check is successful. Otherwise,
 * more ACEs are evaluated until all desired access bits (combined)

	strict bool   // Versions must match exactly, including all metadata.

	// Reusable slice for resolution
	candidates [][]xlMetaV2ShallowVersion
}

// resolve multiple entries.
// entries are resolved by majority, then if tied by mod-time and versions.
// Names must match on all entries in m.

        int readLen = response.readParameterWordsWireFormat(bytes, 0);
        long expectedOffset = expectedInt; // Sign extension happens here for negative values
        assertEquals(expectedOffset, response.getOffset(), "Offset should match decoded value");
        assertEquals(4, readLen, "Byte count returned should be 4");
    }

    @Test
    @DisplayName("readParameterWordsWireFormat with a too-short buffer - throws exception")

        }
    }

    /**
     * Extracts the value from a line using the given pattern.
     * @param pattern the pattern to match against
     * @param line the line to extract the value from
     * @return the extracted value, or null if no match
     */
    protected String getValue(final Pattern pattern, final String line) {
        final Matcher m = pattern.matcher(line);

    /** Pattern used to match file paths that this creator can handle. */
    protected Pattern pattern;

    /** Manager for dictionary operations and lifecycle. */
    @Resource
    protected DictionaryManager dictionaryManager;

    /**
     * Creates a new DictionaryCreator with the specified pattern.
     *
     * @param pattern the regular expression pattern to match file paths
     */

if %ERRORLEVEL% equ 0 goto execute

echo. 1>&2
echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 1>&2
echo. 1>&2
echo Please set the JAVA_HOME variable in your environment to match the 1>&2
echo location of your Java installation. 1>&2

goto fail

:findJavaFromJavaHome
set JAVA_HOME=%JAVA_HOME:"=%
set JAVA_EXE=%JAVA_HOME%/bin/java.exe

if exist "%JAVA_EXE%" goto execute

            Instant start = MonotonicClock.start();

            assertTrue(now.isAfter(start), "Current time should be after start time");
        }

        @Test
        @DisplayName("Elapsed time should match time difference")
        void testElapsedTimeConsistency() {
            MonotonicClock clock = MonotonicClock.get();
            Instant now = clock.instant();
            Duration elapsed = clock.elapsedTime();

        String testMessage = "This is a test message for NdrException.";
        NdrException exception = new NdrException(testMessage);
        assertEquals(testMessage, exception.getMessage(), "The exception message should match the input message.");
    }

    /**
     * Test the NO_NULL_REF static field.
     * Ensures that the static field holds the expected string value.
     */
    @Test
    void testNoNullRefConstant() {

/**
 * An extremely generic binary search that doesn't know what data it's searching over. The caller
 * provides indexes and a comparison function, and this calls that function iteratively.
 *
 * @return the index of the match. If no match is found this is `(-1 - insertionPoint)`, where the
 *     inserting the element at `insertionPoint` will retain sorted order.
 */
inline fun binarySearch(
  position: Int,
  limit: Int,