latch.countDown();

    exec.shutdown();
    exec.awaitTermination(100, MILLISECONDS);
  }

  /**
   * Tests that all listeners complete, even if they were added before or after the future was
   * finishing. Also acts as a concurrency test to make sure the locking is done correctly when a
   * future is finishing so that no listeners can be lost.
   */

func (initialSnapShot LeakDetect) CompareCurrentSnapshot() []string {
	var stackDiff []string
	for _, g := range pickRelevantGoroutines() {
		// Identify the Go routines those were not present in the initial snapshot.
		// In other words a stack diff.
		if !initialSnapShot.relevantRoutines[g] {
			stackDiff = append(stackDiff, g)
		}
	}
	return stackDiff
}

        macAddressField.setAccessible(true);
        byte[] parsedMac = (byte[]) macAddressField.get(response);
        assertArrayEquals(testMac, parsedMac);

        // Verify stats were parsed
        // Stats length = rDataLength - (numberOfNames * 18) - 1 = 67 - 54 - 1 = 12
        // But MAC address takes 6 bytes, so actual stats length = 12 - 6 = 6

   * {@linkplain Object#equals equal} to the original, nor is it required to return even an object
   * of the same class. For example, if sublists of {@code MyList} instances were serializable,
   * those sublists might implement a private {@code MySubList} type but serialize as a plain {@code
   * MyList} to save space. So long as {@code MyList} has all the public supertypes of {@code

        @Test
        @DisplayName("Should handle partial copy operations")
        void testPartialCopyOperation() throws SMBProtocolDecodingException {
            // Simulate partial copy where not all requested bytes were copied
            byte[] buffer = createValidCopyChunkResponse(3, // Only 3 chunks written (maybe less than requested)
                    65536, // 64KB per chunk
                    196608 // 192KB total (3 * 64KB)

      if (!skipCommasAndWhitespace() && !exhausted()) return // Expected ',' or EOF.
    }
    result.add(Challenge(schemeName, parameters))
  }
}

/** Returns true if any commas were skipped. */
private fun Buffer.skipCommasAndWhitespace(): Boolean {
  var commaFound = false
  loop@ while (!exhausted()) {
    when (this[0]) {
      ','.code.toByte() -> {
        // Consume ','.

 *
 * <p>When iterating through the collections supplied by this class, the ordering of values for a
 * given key agrees with the order in which the values were added.
 *
 * <p>This multimap allows duplicate key-value pairs. After adding a new key-value pair equal to an
 * existing key-value pair, the {@code ArrayListMultimap} will contain entries for both the new

     * This cache is refreshed periodically based on the lastLoadedTime.
     */
    protected String[] dataStoreNames = StringUtil.EMPTY_STRINGS;

    /**
     * Timestamp of the last time data store names were loaded from plugin files.
     * Used to implement a time-based cache refresh mechanism.
     */
    protected long lastLoadedTime = 0;

    /**
     * Creates a new instance of DataStoreFactory.

Und natürlich wird das gleiche unterstützt:

* Validierung der Daten
* Serialisierung der Daten
* Dokumentation der Daten, usw.

Das funktioniert genauso wie mit Pydantic-Modellen. Und tatsächlich wird es unter der Haube mittels Pydantic auf die gleiche Weise bewerkstelligt.

/// info

        return partialResults;
    }

    /**
     * Gets the facet response containing aggregated facet information.
     *
     * @return The facet response, or null if no facets were requested
     */
    public FacetResponse getFacetResponse() {
        return facetResponse;
    }

    /**
     * Creates a new SearchResultBuilder for constructing SearchResult instances.
     *