* and access mask of each ACE. If the SID matches, the allow/deny flags
 * 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,

        // Should be valid base64
        assertTrue(encryptedStr.matches("^[A-Za-z0-9+/]*={0,2}$"), "Should be valid Base64 format");

        // Decrypt from string
        char[] decrypted = storage.decryptFromString(encryptedStr);
        assertArrayEquals(plaintext, decrypted, "Decrypted string should match original");

        // Clean up
        Arrays.fill(plaintext, '\0');

        verifyNoInteractions(mocked);
    }

    // Reflection-based check: ensure serialVersionUID remains the declared constant
    @Test
    @DisplayName("serialVersionUID matches declared constant")
    void serialVersionUID_hasExpectedValue() throws Exception {
        // Arrange
        Field f = SMBSignatureValidationException.class.getDeclaredField("serialVersionUID");
        f.setAccessible(true);

	f.buf.Write(data)
	// Flush to w until a potential match of exitRe
	b := f.buf.Bytes()
	match := f.exitRe.FindIndex(b)
	if match == nil {
		// Flush all of the buffer.
		_, err := f.w.Write(b)
		f.buf.Reset()
		if err != nil {
			return n, err
		}
	} else {
		// Flush up to the beginning of the (potential) match.
		_, err := f.w.Write(b[:match[0]])
		f.buf.Next(match[0])
		if err != nil {
			return n, err
		}

        }
    }

    private static String parseSourceLang(String lineTrimmed) {
        var m = SOURCE_LANG_PATTERN.matcher(lineTrimmed);
        if (m.matches()) {
            return m.group(1).toLowerCase(Locale.ROOT);
        }
        return null;
    }

    private static Language deduceLanguage(String sourceLang) {

            String line = currentColor + lines[i];

            // look for last ANSI escape sequence to check if nextColor
            Matcher matcher = LAST_ANSI_SEQUENCE.matcher(line);
            String nextColor = "";
            if (matcher.find()) {
                nextColor = matcher.group(1);
                if (ANSI_RESET.equals(nextColor)) {
                    // last ANSI escape code is reset: no next color

/**
 * 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,

        factory.addClient(regexList, client);
    }

    /**
     * Retrieves a client from the wrapped factory that matches the given URL.
     * @param url The URL to match.
     * @return The matching CrawlerClient instance.
     */
    @Override
    public CrawlerClient getClient(final String url) {
        return factory.getClient(url);
    }

      checkState(position != startPosition);
      return token;
    }

    char consumeCharacter(CharMatcher matcher) {
      checkState(hasMore());
      char c = previewChar();
      checkState(matcher.matches(c));
      position++;
      return c;
    }

    @CanIgnoreReturnValue
    char consumeCharacter(char c) {
      checkState(hasMore());

     *
     * @param field the field value
     * @return the unquoted field value
     */
    protected String unquoteField(final String field) {
        if (QUOTED_FIELD_PATTERN.matcher(field).matches()) {
            return field.substring(1, field.length() - 1).replace("\"\"", "\"");
        }
        return field;
    }

    /**
     * Builds the extract data from headers and rows.
     *