when (record.loggerName) {
            TaskRunner::class.java.name -> recordTaskRunner
            Http2::class.java.name -> recordFrames
            "javax.net.ssl" -> recordSslDebug && !sslExcludeFilter.matches(record.message)
            else -> false
          }

        if (recorded) {
          synchronized(clientEventsList) {
            clientEventsList.add(record.message)

    }

    @Test
    public void testDeleteByQueryWithNoMatches() {
        // Test delete with query that matches nothing
        boolean result = SuggestUtil.deleteByQuery(client, settings, TEST_INDEX, QueryBuilders.termQuery("nonexistent", "value"));
        assertTrue(result); // Should still return true even with no matches
    }

    @Test(expected = SuggesterException.class)
    public void testDeleteByQueryWithInvalidIndex() {

        byte[] buffer = new byte[request.size()];
        int encodedLength = request.encode(buffer, 0);

        // Verify encoded length matches size
        assertEquals(request.size(), encodedLength);

        // Verify capabilities (4 bytes)
        assertEquals(DEFAULT_CAPABILITIES, SMBUtil.readInt4(buffer, 0));

        // Verify client GUID (16 bytes)

    @Execute
    public JsonResponse<ApiResult> docs(final SearchBody body) {
        validateApi(body, messages -> {});

        if (StringUtil.isBlank(body.q)) {
            // query matches on all documents.
            body.q = Constants.MATCHES_ALL_QUERY;
        }

        final SearchRenderData renderData = new SearchRenderData();
        body.initialize();
        try {

        // 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)");

} TF_Output;

// TF_Function is a grouping of operations with defined inputs and outputs.
// Once created and added to graphs, functions can be invoked by creating an
// operation whose operation type matches the function name.
typedef struct TF_Function TF_Function;

// Function definition options. TODO(iga): Define and implement
typedef struct TF_FunctionOptions TF_FunctionOptions;

      }
      Alphabet lowerCase = new Alphabet(name + ".lowerCase()", lowerCased);
      return ignoreCase ? lowerCase.ignoreCase() : lowerCase;
    }

    public boolean matches(char c) {
      return c < decodabet.length && decodabet[c] != -1;
    }

    @Override
    public String toString() {
      return name;
    }

    @Override

        assertTrue(log.contains(", heap "));
        assertTrue(log.contains(", max "));
        assertTrue(log.endsWith("}"));

        // Verify format contains expected memory units
        assertTrue(log.matches(".*used [0-9.]+[a-zA-Z]+, heap [0-9.]+[a-zA-Z]+, max [0-9.]+[a-zA-Z]+.*"));
    }

    @Test
    public void test_byteCountToDisplaySize_edgeCases() {

---

### 🌱 **Contributing to Gradle**

- **Contribution Guide**: [Contribute](https://github.com/gradle/gradle/blob/master/CONTRIBUTING.md) to Gradle by submitting patches or pull requests for code or documentation improvements.
- **Code of Conduct**: Gradle enforces a [Code of Conduct](https://gradle.org/conduct/) to ensure a welcoming and supportive community for all contributors.

---

import java.util.Collections;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that
 * matches the insertion order. All optional operations (adding and removing) are supported. All
 * elements, including {@code null}, are permitted.
 *