charmappingpager.setAllPageCount(999);
        assertEquals(999, charmappingpager.getAllRecordCount());
        charmappingpager.setExistPrePage(true);
        assertTrue(charmappingpager.isExistPrePage());
        charmappingpager.setExistNextPage(true);
        assertTrue(charmappingpager.isExistNextPage());
        charmappingpager.setPageSize(0);
        assertEquals(25, charmappingpager.getPageSize());

import java.security.cert.CertificateException
import javax.net.ssl.SSLException
import javax.net.ssl.SSLHandshakeException
import javax.net.ssl.SSLPeerUnverifiedException
import okio.IOException

/** Returns true if a TLS connection should be retried after [e]. */
fun retryTlsHandshake(e: IOException): Boolean =
  when {
    // If there was a protocol problem, don't recover.
    e is ProtocolException -> false

    inputStreamOpened = true;
    return new RandomAmountInputStream(new In(), new Random());
  }

  private final class In extends TestInputStream {

    In() throws IOException {
      super(new ByteArrayInputStream(bytes), options);
    }

    @Override
    public void close() throws IOException {
      inputStreamClosed = true;
      super.close();
    }
  }

    inputStreamOpened = true;
    return new RandomAmountInputStream(new In(), new Random());
  }

  private final class In extends TestInputStream {

    In() throws IOException {
      super(new ByteArrayInputStream(bytes), options);
    }

    @Override
    public void close() throws IOException {
      inputStreamClosed = true;
      super.close();
    }
  }

/*
 * © 2025 CodeLibs, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

import org.jspecify.annotations.Nullable;

/**
 * A descriptor for a <i>discrete</i> {@code Comparable} domain such as all {@link Integer}
 * instances. A discrete domain is one that supports the three basic operations: {@link #next},
 * {@link #previous} and {@link #distance}, according to their specifications. The methods {@link
 * #minValue} and {@link #maxValue} should also be overridden for bounded types.
 *

   * returns the elements in the order they are returned by the collection's iterator. The returned
   * array is "safe" in that no references to it are maintained by the collection. The caller is
   * thus free to modify the returned array.
   *
   * <p>This method assumes that the collection size doesn't change while the method is running.
   *
   * <p>TODO(kevinb): support concurrently modified collections?
   *

   * the {@link Multimap} class documentation for clarification.
   */
  int size();

  /**
   * Returns {@code true} if this multimap contains no key-value pairs. Equivalent to {@code size()
   * == 0}, but can in some cases be more efficient.
   */
  boolean isEmpty();

  /**
   * Returns {@code true} if this multimap contains at least one key-value pair with the key {@code
   * key}.
   */

    /**
     * Flag indicating whether wildcard terms should be converted to lowercase.
     */
    protected boolean lowercaseWildcard = true;

    @Override
    protected String getQueryClassName() {
        return WildcardQuery.class.getSimpleName();
    }

    @Override