checkConsistentHashCorrectness(r.nextLong());
    }
  }

  private void checkConsistentHashCorrectness(long hashCode) {
    int last = 0;
    for (int shards = 1; shards <= 100000; shards++) {
      int b = Hashing.consistentHash(hashCode, shards);
      if (b != last) {
        assertEquals(shards - 1, b);
        last = b;
      }
    }
  }

		Mode:             0,
		Metadata:         nil,
		Parts:            nil,
		Erasure: ErasureInfo{
			Algorithm:    ReedSolomon.String(),
			DataBlocks:   4,
			ParityBlocks: 2,
			BlockSize:    10000,
			Index:        1,
			Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8},
			Checksums: []ChecksumInfo{{
				PartNumber: 1,
				Algorithm:  HighwayHash256S,
				Hash:       nil,
			}},
		},

        assertEquals(2, conservativePolicy.getMaxAttempts());
        assertEquals(2000, conservativePolicy.getInitialDelayMs());
        assertEquals(10000, conservativePolicy.getMaxDelayMs());
        assertEquals(3.0, conservativePolicy.getBackoffMultiplier());
        assertTrue(conservativePolicy.isExponentialBackoff());

        // NO_RETRY policy

	CMP	$0xffffffffffa0, R3             // CMP	$281474976710560, R3              // fb0b80921b00e0f27f001beb
	CMP	$0xf4240, R1                    // CMP	$1000000, R1                      // 1b4888d2fb01a0f23f001beb
	CMP     $3343198598084851058, R3        // 5bae8ed2db8daef23badcdf2bbcce5f27f001beb
	CMP	$3, R2
	CMP	R1, R2
	CMP	R1->11, R2
	CMP	R1>>22, R2
	CMP	R1<<33, R2

        }
        assertTrue(foundTestMethod);
    }

    public void test_throwAndCatch() {
        // Test throwing and catching the exception
        String expectedMessage = "Offset limit exceeded: 10000";

        try {
            throw new ResultOffsetExceededException(expectedMessage);
        } catch (ResultOffsetExceededException e) {
            assertEquals(expectedMessage, e.getMessage());

        }

        @Test
        @DisplayName("Should decode efficiently for large buffers")
        void testLargeBufferDecoding() throws SMBProtocolDecodingException {
            byte[] largeBuffer = new byte[10000];
            FileFsSizeInformation info = new FileFsSizeInformation();

            long startTime = System.nanoTime();
            info.decode(largeBuffer, 0, 24);
            long endTime = System.nanoTime();

  public void testSetFuture_stackOverflow() {
    SettableFuture<String> orig = SettableFuture.create();
    SettableFuture<String> prev = orig;
    for (int i = 0; i < 100000; i++) {
      SettableFuture<String> curr = SettableFuture.create();
      prev.setFuture(curr);
      prev = curr;
    }
    // prev represents the 'innermost' future
    prev.set("done");

    client.setSocketTimeout(60000);         // Read timeout
});
```

### Memory Management

```java
// Configure memory usage
crawler.crawlerContext.setMaxAccessCount(10000);     // Limit crawled URLs
crawler.crawlerContext.setMaxDepth(5);               // Limit crawl depth

// Use streaming for large files
container.singleton("fileTransformer", FileTransformer.class, transformer -> {

        @Test
        @DisplayName("Should manage expiration time")
        void testExpiration() {
            assertNull(echoResponse.getExpiration());

            Long expiration = System.currentTimeMillis() + 10000L;
            echoResponse.setExpiration(expiration);

            assertEquals(expiration, echoResponse.getExpiration());
        }

        @Test
        @DisplayName("Should handle null expiration")

			sum := int64(0)
			for _, i := range oi.Parts {
				sum += i.Size
			}
			return sum
		}
	)

	s1 := []int64{5487701, 5487799, 3}
	s2 := repeat(5487701, 5)
	s3 := repeat(maxPartSz, 10000)
	testMPs := []struct {
		decSizes []int64
		oi       ObjectInfo
	}{
		{s1, mkMPObj(s1)},
		{s2, mkMPObj(s2)},
		{s3, mkMPObj(s3)},
	}

	// This function is a reference (re-)implementation of