// Make many attempts to trigger global rate limit
        for (int i = 1; i <= 20; i++) {
            assertTrue(rateLimiter.checkAttempt("user" + i, "192.168.1." + i), "Attempt " + i + " should be allowed");
        }

        // 21st attempt should be blocked by global rate limit
        assertFalse(rateLimiter.checkAttempt("user21", "192.168.1.21"), "Should block after global rate limit");
    }

    @Test

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import jcifs.smb.SmbException;

/**
 * Rate limiter for authentication attempts to prevent brute force attacks.
 *
 * Features:
 * - Per-account rate limiting
 * - Per-IP rate limiting
 * - Global rate limiting
 * - Exponential backoff for repeated failures
 * - Account lockout after threshold
 * - Automatic cleanup of old entries
 */

   * we change the rate.
   */
  public void testWeNeverGetABurstMoreThanOneSec() {
    RateLimiter limiter = RateLimiter.create(1.0, stopwatch);
    int[] rates = {1000, 1, 10, 1000000, 10, 1};
    for (int rate : rates) {
      int oneSecWorthOfWork = rate;
      stopwatch.sleepMillis(rate * 1000);
      limiter.setRate(rate);

   * we change the rate.
   */
  public void testWeNeverGetABurstMoreThanOneSec() {
    RateLimiter limiter = RateLimiter.create(1.0, stopwatch);
    int[] rates = {1000, 1, 10, 1000000, 10, 1};
    for (int rate : rates) {
      int oneSecWorthOfWork = rate;
      stopwatch.sleepMillis(rate * 1000);
      limiter.setRate(rate);

        assertArrayEquals(largeTestData, decompressed);
    }

    @Test
    @DisplayName("Test compression ratio estimation")
    public void testCompressionRatioEstimation() {
        double ratio = compressionService.estimateCompressionRatio(testData, CompressionService.COMPRESSION_LZ77);
        assertTrue(ratio >= 0.0 && ratio <= 1.0);

package bandwidth

//go:generate msgp -file=$GOFILE -unexported

import (
	"context"
	"slices"
	"sync"
	"time"

	"golang.org/x/time/rate"
)

//msgp:ignore bucketThrottle Monitor

type bucketThrottle struct {
	*rate.Limiter
	NodeBandwidthPerSec int64
}

// Monitor holds the state of the global bucket monitor
type Monitor struct {
	tlock sync.RWMutex // mutex for bucket throttling

	for i := 0; i < 2*b.N; i++ {
		if i%2 == 0 {
			l.Add(trace[i], trace[i])
		} else {
			if _, ok := l.Get(trace[i]); ok {
				hit++
			} else {
				miss++
			}
		}
	}
	b.Logf("hit: %d miss: %d ratio: %f", hit, miss, float64(hit)/float64(hit+miss))
}

func BenchmarkLRU_Freq_NoExpire(b *testing.B) {
	l := lru.NewLRU[int64, int64](8192, nil, 0)

	trace := make([]int64, b.N*2)
	for i := 0; i < b.N*2; i++ {

     */
    int[] getSupportedAlgorithms();

    /**
     * Estimates the compression ratio for the given data and algorithm.
     * This can be used to decide whether compression is worthwhile.
     *
     * @param data the data to analyze
     * @param algorithm the compression algorithm
     * @return estimated compression ratio (0.0 to 1.0, where 0.5 means 50% size reduction)
     */

        cookey(kn, KnL);
    }

    private void cookey(final int[] raw, final int KnL[]) {
        int raw0, raw1;
        int rawi, KnLi;
        int i;

        for (i = 0, rawi = 0, KnLi = 0; i < 16; ++i) {
            raw0 = raw[rawi];
            rawi++;
            raw1 = raw[rawi++];
            KnL[KnLi] = (raw0 & 0x00fc0000) << 6;
            KnL[KnLi] |= (raw0 & 0x00000fc0) << 10;

            long avgResponseTime = metrics.getAverageResponseTime();

            // Adjust threshold based on failure rate and response time trends
            int currentThreshold = this.failureThreshold;
            int newThreshold = currentThreshold;

            // If failure rate is high but response time is normal, be more lenient
            if (failureRate > 0.5 && avgResponseTime < 5000) {