buffer = new DfsReferralRequestBuffer(path, 3);

            byte[] dst = new byte[buffer.size()];

            // Perform many rapid encodes
            for (int i = 0; i < 10000; i++) {
                int bytesEncoded = buffer.encode(dst, 0);
                assertEquals(buffer.size(), bytesEncoded);
            }
        }

        @Test

  }

  public void testByteArrayRoundTrips() {
    Random r = new Random(5);
    byte[] b = new byte[Ints.BYTES];

    // total overkill, but, it takes 0.1 sec so why not...
    for (int i = 0; i < 10000; i++) {
      int num = r.nextInt();
      assertThat(Ints.fromByteArray(Ints.toByteArray(num))).isEqualTo(num);

      r.nextBytes(b);
      assertThat(Ints.toByteArray(Ints.fromByteArray(b))).isEqualTo(b);
    }

        file.setLastModified(testTime);

        long retrievedTime = file.lastModified();
        // Allow for reasonable precision differences
        assertTrue(Math.abs(retrievedTime - testTime) < 10000, "Set timestamp should be approximately correct");
    }

    // ========== Path and URL Operations ==========

    @Test
    void testPathOperations() throws Exception {

        System.gc();
        Thread.sleep(1000L);
        long current = MemoryUtil.getUsedMemory();
        for (int i = 0; i < 10000; i++) {
            if (i % 1000 == 0) {
                logger.info("count:" + i + ", " + MemoryUtil.getMemoryUsageLog());
            }
            ResponseData responseData = new ResponseData();

    protected long userCheckInterval = 10 * 60 * 1000L; // 10 min

    /** Maximum size of the user information cache. */
    protected int userInfoCacheSize = 10000;

    /** Queue for storing search logs. */
    protected Queue<SearchLog> searchLogQueue = new ConcurrentLinkedQueue<>();

    /** Queue for storing click logs. */

                doc.put("score", 1.0f / (i + 1));
                builder.addDocument(doc);
            }
            builder.allRecordCount(allRecordCount);
            if (allRecordCount < 10000) {
                builder.allRecordCountRelation(Relation.EQUAL_TO.toString());
            }
            return builder.build();
        }
    }

    static class TestSubSearcher extends RankFusionSearcher {

  public void testRemovalNotification_get_basher() throws InterruptedException {
    int nTasks = 1000;
    int nThreads = 100;
    int getsPerTask = 1000;
    int nUniqueKeys = 10000;
    Random random = new Random(); // Randoms.insecureRandom();

    QueuingRemovalListener<String, String> removalListener = queuingRemovalListener();
    AtomicInteger computeCount = new AtomicInteger();

  public void testRemovalNotification_get_basher() throws InterruptedException {
    int nTasks = 1000;
    int nThreads = 100;
    int getsPerTask = 1000;
    int nUniqueKeys = 10000;
    Random random = new Random(); // Randoms.insecureRandom();

    QueuingRemovalListener<String, String> removalListener = queuingRemovalListener();
    AtomicInteger computeCount = new AtomicInteger();

  /**
   * How long to wait when determining that a thread is blocked if we DON'T expect it to be blocked.
   */
  private static final long UNEXPECTED_HANG_DELAY_MILLIS = 10000;

  /**
   * Various scenarios to be generated for each method under test. The actual scenario generation
   * (determining which scenarios are applicable to which methods and what the outcome should be)

    
    // Add test channels
    ChannelInfo channel1 = createTestChannel("channel1", 1000);  // 1Gbps
    ChannelInfo channel2 = createTestChannel("channel2", 10000); // 10Gbps
    
    manager.addChannel(channel1);
    manager.addChannel(channel2);
    
    // Test load balancer selection
    ChannelLoadBalancer balancer = new ChannelLoadBalancer(manager);