*
   * <p><b>{@code Stream} equivalent:</b> {@link Stream#limit}
   *
   * @param iterable the iterable to limit
   * @param limitSize the maximum number of elements in the returned iterable
   * @throws IllegalArgumentException if {@code limitSize} is negative
   * @since 3.0
   */
  public static <T extends @Nullable Object> Iterable<T> limit(
      Iterable<T> iterable, int limitSize) {
    checkNotNull(iterable);

     * and the arithmetic mean is always higher than the geometric mean.
     *
     * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles
     * with each iteration, so this algorithm takes O(log(digits)) iterations.
     *
     * We start out with a double-precision approximation, which may be higher or lower than the

   * @param expectedCount the expected number of roundtrippable permutations
   * @param start the starting bytes encoded as a long as big-endian
   * @param lim the limit of bytes to process encoded as a long as big-endian, or -1 to mean the max
   *     limit for numBytes
   */
  @GwtIncompatible // java.nio.charset.Charset
  private static void testBytes(int numBytes, long expectedCount, long start, long lim) {

	"github.com/minio/minio/internal/once"
	"github.com/minio/minio/internal/store"
	xnet "github.com/minio/pkg/v3/net"
)

const (
	mysqlTableExists = `SELECT 1 FROM %s;`
	// Some MySQL has a 3072 byte limit on key sizes.
	mysqlCreateNamespaceTable = `CREATE TABLE %s (
             key_name VARCHAR(3072) NOT NULL,
             key_hash CHAR(64) GENERATED ALWAYS AS (SHA2(key_name, 256)) STORED NOT NULL PRIMARY KEY,

        assertTrue(result.contains("maxRawSize=8192"));
        assertTrue(result.contains("sessionKey=0x00ABCDEF"));
        // CAP_UNICODE is 0x0004, when formatted as 8 hex digits = 0x00000004
        assertTrue(result.contains("capabilities=0x00000004"));
        assertTrue(result.contains("serverTime=" + new Date(serverData.serverTime)));
        assertTrue(result.contains("serverTimeZone=300"));

  }

  private fun loggerTag(loggerName: String): String {
    // We need to handle long logger names before they hit Log.
    // java.lang.IllegalArgumentException: Log tag "okhttp3.mockwebserver.MockWebServer" exceeds limit of 23 characters
    return knownLoggers[loggerName] ?: loggerName.take(23)
  }

  fun enable() {
    try {
      for ((logger, tag) in knownLoggers) {
        enableLogging(logger, tag)
      }

  protected void update(ByteBuffer b) {
    if (b.hasArray()) {
      update(b.array(), b.arrayOffset() + b.position(), b.remaining());
      Java8Compatibility.position(b, b.limit());
    } else {
      for (int remaining = b.remaining(); remaining > 0; remaining--) {
        update(b.get());
      }
    }
  }

  /** Updates the sink with the given number of bytes from the buffer. */

 * or both.
 *
 * ## Authentication Retries
 *
 * If your authentication may be flaky and requires retries you should apply some policy
 * to limit the retries by the class of errors and number of attempts.  To get the number of
 * attempts to the current point use this function.
 *
 * ```java
 * private int responseCount(Response response) {
 *   int result = 1;

    }

    @Test
    @DisplayName("Test getBatchLimit method")
    void testGetBatchLimit() {
        // Test default batch limit
        assertEquals(0, config.getBatchLimit("TreeConnectAndX.QueryInformation"));

        // Test unspecified batch limit
        assertEquals(1, config.getBatchLimit("UnknownCommand"));

        // Test caching behavior

     */
    private void flagIfReversed(File file, Map<File, List<Error>> errors, List<Snippet> snippets) {
        List<Snippet> pair = snippets.stream()
            .filter(s -> s.lang != Language.UNKNOWN)
            .limit(2)
            .toList();

        if (pair.size() == 2 &&
            pair.get(0).lang == Language.GROOVY &&
            pair.get(1).lang == Language.KOTLIN) {