// Calculate 95th percentile
            long[] sortedTimes = responseTimeHistory.stream().mapToLong(Long::longValue).sorted().toArray();
            int p95Index = (int) Math.ceil(0.95 * sortedTimes.length) - 1;
            p95Index = Math.max(0, Math.min(p95Index, sortedTimes.length - 1));
            p95ResponseTime.set(sortedTimes[p95Index]);
        }
    }

    /**
     * Exception thrown when circuit breaker is open

        response.setStatus(0); // Success
        response.setSelectedVersion(request.getMaxVersion());
        response.setCreditsGranted(request.getCreditsRequested());
        response.setMaxReceiveSize(Math.min(request.getMaxReceiveSize(), 65536));
        response.setMaxReadWriteSize(0); // No RDMA read/write support
        response.setMaxFragmentedSize(request.getMaxFragmentedSize());

import jsinterop.annotations.JsPackage;

/** Web specializations for {@link Ints} methods. */
public abstract class IntsMethodsForWeb {

  @JsMethod(name = "Math.min", namespace = JsPackage.GLOBAL)
  public static native int min(int... array);

  @JsMethod(name = "Math.max", namespace = JsPackage.GLOBAL)
  public static native int max(int... array);

  @BeforeExperiment
  void setUp() {
    // random integers will be generated in this range, then raised to the
    // power of (1/concentration) and floor()ed
    max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration));

    cache =
        CacheBuilder.newBuilder()
            .concurrencyLevel(segments)
            .maximumSize(maximumSize)
            .build(

        if (len == 0) {
            return 0;
        }
        int tot = 0;

        while (true) {
            while (bip > 0) {
                n = in.read(b, off, Math.min(len, bip));
                if (n == -1) {
                    return tot > 0 ? tot : -1;
                }
                tot += n;
                off += n;
                len -= n;
                bip -= n;

  @BeforeExperiment
  void setUp() {
    // random integers will be generated in this range, then raised to the
    // power of (1/concentration) and floor()ed
    max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration));

    cache =
        CacheBuilder.newBuilder()
            .concurrencyLevel(segments)
            .maximumSize(maximumSize)
            .build(

    createTermynals();
    loadVisibleTermynals();
}

function shuffle(array) {
    var currentIndex = array.length, temporaryValue, randomIndex;
    while (0 !== currentIndex) {
        randomIndex = Math.floor(Math.random() * currentIndex);
        currentIndex -= 1;
        temporaryValue = array[currentIndex];
        array[currentIndex] = array[randomIndex];
        array[randomIndex] = temporaryValue;
    }

 * the License.
 */

package com.google.common.math;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import java.math.BigDecimal;
import java.math.RoundingMode;

/**
 * A class for arithmetic on {@link BigDecimal} that is not covered by its built-in methods.
 *

 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.core.convert;

import java.math.BigDecimal;
import java.math.BigInteger;

import junit.framework.TestCase;

/**
 * @author koichik
 *
 */
public class BigDecimalConversionUtilTest extends TestCase {

//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package cmd

import (
	"math"
	"net/http"
	"os"
	"runtime"
	"runtime/debug"
	"sort"
	"strings"
	"time"

	"github.com/minio/madmin-go/v3"
	"github.com/minio/minio/internal/config"
	"github.com/minio/minio/internal/kms"