len -= write_andx_resp.count;
            off += write_andx_resp.count;
        } while (len > 0);
    }

    /**
     * Returns the current position of the file pointer.
     *
     * @return the current file pointer position
     * @throws SmbException if an I/O error occurs
     */
    public long getFilePointer() throws SmbException {
        return fp;
    }

    /**

         *
         * @return the page size
         */
        public int getPageSize() {
            return pageSize;
        }

        /**
         * Returns the current page number (1-based).
         *
         * @return the current page number
         */
        public int getCurrentPageNumber() {
            return currentPageNumber;
        }

        /**

     *
     * @return the next sequence number
     */
    public long getNextSequenceNumber() {
        return sequenceNumber.incrementAndGet();
    }

    /**
     * Updates the heartbeat timestamp to current time and resets failure count.
     */
    public void updateHeartbeat() {
        this.lastHeartbeat = System.currentTimeMillis();
        this.heartbeatFailures = 0;
    }

    /**

    NullPointerTester tester = new NullPointerTester();

    tester.testConstructors(PatternFilenameFilter.class, Visibility.PACKAGE);
    tester.testStaticMethods(PatternFilenameFilter.class, Visibility.PACKAGE); // currently none

    // The reason that we skip this method is discussed in a comment on the method.
    tester.ignore(PatternFilenameFilter.class.getMethod("accept", File.class, String.class));

    int dummy = 0;
    AtomicReferenceArray<ReferenceEntry<Object, Object>> oldTable = segment.table;
    for (int i = 0; i < reps; i++) {
      // TODO(b/145386688): This access should be guarded by 'this.segment', which is not currently
      // held
      segment.expand();
      segment.table = oldTable;
      dummy += segment.count;
    }
    return dummy;
  }

    return (SortedSet<String>) super.create(elements);
  }

  @Override
  protected abstract SortedSet<String> create(String[] elements);

  /** Sorts the elements by their natural ordering. */
  /*
   * While the current implementation returns `this`, that's not something we mean to guarantee.
   * Callers of TestContainerGenerator.order need to be prepared for implementations to return a new
   * collection.
   */

 * @param <T> the type of array elements
 */
public class ArrayIterator<T> implements Iterator<T> {

    /** The array of elements to iterate over */
    protected final T[] items;

    /** The index of the currently referenced element */
    protected int index = 0;

    /**
     * Returns an {@link Iterable} that wraps the array for use in a for-each statement.
     *
     * @param <T> the type of elements

			set.CreateStringSet("dep1", "dep2", "dep3"),
			set.CreateStringSet("dep1", "dep2", "dep3", "dep4"),
			[]string{},
		},
		// Test3: not currently under site replication.
		{
			[]madmin.PeerInfo{},
			set.CreateStringSet(),
			set.CreateStringSet("dep1", "dep2", "dep3", "dep4"),
			[]string{},
		},
	}

	for i, tc := range testCases {

	ttfbHist := prometheus.NewHistogramVec(
		prometheus.HistogramOpts{
			Name:    "s3_ttfb_seconds",
			Help:    "Time taken by requests served by current MinIO server instance",
			Buckets: histBuckets,
		},
		[]string{"api"},
	)
	observations := []struct {
		val   float64
		label string
	}{
		{
			val:   0.02,
			label: labels[0],
		},
		{

        throw IOException("Failed ${it.code} ${it.message}")
      }
      it.body
        .string()
        .lines()
        .mapNotNull { parseIanaCsvRow(it) }
    }

  return IanaSuites("current", suites)