wantInverted: []sparseEntry{{0, 0}},
	}, {
		in: []sparseEntry{}, size: 5000,
		wantValid:    true,
		wantInverted: []sparseEntry{{0, 5000}},
	}, {
		in: []sparseEntry{{0, 5000}}, size: 5000,
		wantValid:    true,
		wantAligned:  []sparseEntry{{0, 5000}},
		wantInverted: []sparseEntry{{5000, 0}},
	}, {
		in: []sparseEntry{{1000, 4000}}, size: 5000,
		wantValid:    true,
		wantAligned:  []sparseEntry{{1024, 3976}},

    public int getScore() {
        // Score interface for selection (higher is better)
        int score = linkSpeed;  // Base score is link speed
        
        if (rssCapable) score += 1000;   // Prefer RSS-capable
        if (rdmaCapable) score += 2000;  // Prefer RDMA-capable
        if (!ipv6) score += 100;         // Slight preference for IPv4
        
        return score;
    }
    
    private boolean checkRSSCapability() {

    // Backoff and timing constants (in ms)
    private static final long BASE_POLL_INTERVAL = 1000;
    private static final long MAX_POLL_INTERVAL = 30000;
    private static final long BASE_RETRY_DELAY = 1000;
    private static final long MAX_RETRY_DELAY = 30000;
    private static final int MAX_BACKOFF_SHIFT = 3; // Maximum 8 seconds (2^3 * 1000ms)

        for (int i = 0; i < 1000; i++) {
            longMessage.append("Error ").append(i).append(" ");
        }
        String message = longMessage.toString();

        DataStoreException exception = new DataStoreException(message);
        assertEquals(message, exception.getMessage());
        assertTrue(exception.getMessage().length() > 5000);
    }

    @Test

    assertThat(limiter.acquire()).isWithin(EPSILON).of(0.2);
  }

  public void testOneSecondBurst() {
    RateLimiter limiter = RateLimiter.create(5.0, stopwatch);
    stopwatch.sleepMillis(1000); // max capacity reached
    stopwatch.sleepMillis(1000); // this makes no difference
    limiter.acquire(1); // R0.00, since it's the first request

    limiter.acquire(1); // R0.00, from capacity
    limiter.acquire(3); // R0.00, from capacity

    assertThat(limiter.acquire()).isWithin(EPSILON).of(0.2);
  }

  public void testOneSecondBurst() {
    RateLimiter limiter = RateLimiter.create(5.0, stopwatch);
    stopwatch.sleepMillis(1000); // max capacity reached
    stopwatch.sleepMillis(1000); // this makes no difference
    limiter.acquire(1); // R0.00, since it's the first request

    limiter.acquire(1); // R0.00, from capacity
    limiter.acquire(3); // R0.00, from capacity

        SuggestAnalyzer analyzer = suggester.settings().analyzer().new DefaultContentsAnalyzer();
        // Create text larger than maxAnalyzedContentLength (1000 chars by default)
        StringBuilder largeText = new StringBuilder();
        for (int i = 0; i < 2000; i++) {
            largeText.append("テスト ");
        }

    assertTrue("Heap is not intact initially", mmHeap.isIntact());
    Iterator<Integer> it = mmHeap.iterator();
    assertEquals((Integer) 1, it.next());
    assertEquals((Integer) 20, it.next());
    assertEquals((Integer) 1000, it.next());
    assertEquals((Integer) 2, it.next());
    it.remove();
    // After this remove, 400 has moved up and 20 down past cursor
    assertTrue("Heap is not intact after remove", mmHeap.isIntact());

        offset += 4;
        SMBUtil.writeInt4(8, buffer2, offset); // sectPerAlloc
        offset += 4;
        SMBUtil.writeInt4(2000, buffer2, offset); // alloc
        offset += 4;
        SMBUtil.writeInt4(1000, buffer2, offset); // free
        offset += 4;
        SMBUtil.writeInt2(1024, buffer2, offset); // bytesPerSect

        smbInfoAllocation.decode(buffer2, 0, buffer2.length);

        assertTrue(overallTimeMs < 1000, "Operations should complete quickly without lock contention");

        pool.close();
    }

    /**
     * Test buffer cache performance with concurrent operations
     */
    @Test
    public void testBufferCachePerformance() throws Exception {
        int threadCount = 10;
        int operationsPerThread = 1000;