}
    }

    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

                "color": "red",
                "value": 80
              }
            ]
          },
          "unit": "none"
        },
        "overrides": [
          {
            "matcher": {
              "id": "byName",
              "options": "S3 Errors"
            },
            "properties": [
              {
                "id": "color",
                "value": {

		if !isEqual(test.ExpectedHeader, test.Header) {
			t.Errorf("Test %d: filtered headers do not match expected headers - got: %v , want: %v", i, test.Header, test.ExpectedHeader)
		}
		RemoveSensitiveEntries(metadata)
		if !areKeysEqual(test.ExpectedHeader, metadata) {
			t.Errorf("Test %d: filtered headers do not match expected headers - got: %v , want: %v", i, test.Header, test.ExpectedHeader)
		}
	}

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

import javassist.CtClass
import javassist.CtField

/**
 * Matches Kotlin <code>internal</code> members.
 */
class KotlinInternalFilter implements ClassFilter, FieldFilter, BehaviorFilter {

    @Override
    boolean matches(CtClass ctClass) {
        return KotlinMetadataQueries.INSTANCE.isKotlinInternal(ctClass)
    }

    @Override
    boolean matches(CtField ctField) {

 * 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');

        // Act & Assert
        // Due to implementation, iteration uses this.b.length and ignores extra bytes in argument
        assertTrue(shorter.equals(longer), "Shorter equals longer when prefix matches (implementation behavior)");

        // In the opposite direction, an out-of-bounds occurs internally and is caught as false
        assertFalse(longer.equals(shorter), "Longer does not equal shorter (implementation behavior)");

            if (hasProjectExpression(s)) {
                String path = pathSupplier.get();
                Matcher matcher = EXPRESSION_PROJECT_NAME_PATTERN.matcher(s);
                while (matcher.find()) {
                    String propertyName = matcher.group(0);

                    if (path.startsWith("activation.file.") && "${project.basedir}".equals(propertyName)) {
                        continue;