if (now - previousTime < interval) {
                throw new IllegalStateException();
            }
            previousTime = now;

            count++;
            if (count <= exceptionCount) {
                throw new CrawlerSystemException("exception " + count);
            }

            final ResponseData responseData = new ResponseData();
            responseData.setUrl(request.getUrl());

        this.client = client;
    }

    /**
     * Returns the maximum retry count.
     * @return The maximum retry count.
     */
    public int getMaxRetryCount() {
        return maxRetryCount;
    }

    /**
     * Sets the maximum retry count.
     * @param maxRetryCount The maximum retry count.
     */
    public void setMaxRetryCount(final int maxRetryCount) {

internal fun checkOffsetAndCount(
  arrayLength: Long,
  offset: Long,
  count: Long,
) {
  if (offset or count < 0L || offset > arrayLength || arrayLength - offset < count) {
    throw ArrayIndexOutOfBoundsException("length=$arrayLength, offset=$offset, count=$offset")
  }
}

internal fun <T> interleave(
  a: Iterable<T>,
  b: Iterable<T>,
): List<T> {

     *
     * @return the total record count
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records available across all pages.
     *
     * @param allRecordCount the total record count to set
     */
    public void setAllRecordCount(final int allRecordCount) {

* Because some plugins mount volume on sub-directory of volume path, we need to distinguish between volume path and mount path to fix issue in reconstruction. ([#74653](https://github.com/kubernetes/kubernetes/pull/74653), [@cofyc](https://github.com/cofyc))

    void testGetEntries_largeNumberOfRoots() throws Exception {
        // Create array with many entries
        int count = 100;
        netdfs.DfsEnumArray200 largeArray = new netdfs.DfsEnumArray200();
        largeArray.count = count;
        largeArray.s = new netdfs.DfsInfo200[count];

        for (int i = 0; i < count; i++) {
            netdfs.DfsInfo200 entry = new netdfs.DfsInfo200();
            entry.dfs_name = "share_" + i;

    }

    /**
     * Test validation of excessive negotiate context count.
     */
    @Test
    public void testExcessiveNegotiateContextCount() {
        byte[] buffer = createBasicNegotiateResponseBuffer();
        // Set SMB 3.1.1 dialect
        SMBUtil.writeInt2(0x0311, buffer, 4);
        // Set excessive negotiate context count (should be limited to 100)
        SMBUtil.writeInt2(1000, buffer, 6);

     * Gets the total number of records in the search result set.
     *
     * @return the total record count
     */
    public long getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Gets the relation type for the total record count.
     *
     * @return the relation type (e.g., "eq" for exact count, "gte" for greater than or equal)
     */
    public String getAllRecordCountRelation() {

		uint32_t num_stores;
		[size_is(num_stores)] DfsStorageInfo *stores;
	} DfsInfo3;

	typedef struct {
		uint32_t count;
		[size_is(count)] DfsInfo3 *s;
	} DfsEnumArray3;

	typedef struct {
		[string] wchar_t *dfs_name;
	} DfsInfo200;

	typedef struct {
		uint32_t count;
		[size_is(count)] DfsInfo200 *s;
	} DfsEnumArray200;

	typedef struct {
		uint32_t flags;
		[string] wchar_t *dfs_name;

 *
 */
public class UUID extends rpc.uuid_t {

    private static int hex_to_bin(final char[] arr, final int offset, final int length) {
        int value = 0;
        int ai, count;

        count = 0;
        for (ai = offset; ai < arr.length && count < length; ai++) {
            value <<= 4;
            switch (arr[ai]) {
            case '0':
            case '1':
            case '2':
            case '3':