MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives.  Therefore, the number of drives you present must be a multiple of one of these numbers.  Each object is written to a single erasure-coding set.

     *
     * @return the sortPrefix
     */
    public String getSortPrefix() {
        return sortPrefix;
    }

    /**
     * Sets the sort prefix used for identifying sort parameters in search queries.
     *
     * @param sortPrefix the sortPrefix to set
     */
    public void setSortPrefix(final String sortPrefix) {
        this.sortPrefix = sortPrefix;
    }

    /**

import com.google.common.annotations.GwtCompatible;
import java.util.Collection;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A set which forwards all its method calls to another set. Subclasses should override one or more
 * methods to modify the behavior of the backing set as desired per the <a
 * href="http://en.wikipedia.org/wiki/Decorator_pattern">decorator pattern</a>.
 *

                Arguments.of(0x00001234, NtStatus.NT_STATUS_UNSUCCESSFUL));
    }

    @ParameterizedTest
    @MethodSource("intErrorCodes")
    @DisplayName("int ctor: sets message and NT status as expected")
    void intConstructor_populatesMessageAndStatus(int errCode, int expectedStatus) {
        // Arrange & Act: create exception with error code

  }

  @CollectionSize.Require(SEVERAL)
  @MapFeature.Require(SUPPORTS_REMOVE)
  /*
   * SetMultimap.asMap essentially returns a Map<K, Set<V>>; we just can't declare it that way.
   * Thus, calls like asMap().values().remove(someSet) are safe because they are comparing a set to
   * a collection of other sets.
   */
  @SuppressWarnings("CollectionUndefinedEquality")
  public void testValuesRemove() {

        });
        return parser;
    }

    /**
     * Sets the default field to search in when no field is specified in the query.
     *
     * @param defaultField the default field name
     */
    public void setDefaultField(final String defaultField) {
        this.defaultField = defaultField;
    }

    /**
     * Sets the analyzer used to analyze query terms.
     *

import com.google.common.collect.AbstractIterator;
import com.google.common.collect.ImmutableSet;
import com.google.common.collect.Sets;
import java.util.Iterator;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A class to facilitate the set returned by {@link Graph#edges()}.
 *
 * @author James Sexton
 */
abstract class EndpointPairIterator<N> extends AbstractIterator<EndpointPair<N>> {

    }

    /**
     * Returns the algorithm.
     *
     * @return the algorithm
     */
    public String getAlgorithm() {
        return algorithm;
    }

    /**
     * Sets the algorithm.
     *
     * @param algorithm
     *            the algorithm
     */
    public void setAlgorithm(final String algorithm) {
        this.algorithm = algorithm;
    }

    /**

        }

        /**
         * Sets the text content of the XML node.
         *
         * @param value the text content of the XML node
         * @return this builder instance
         */
        public Builder value(String value) {
            this.value = value;
            return this;
        }

        /**
         * Sets the namespace URI of the XML node.
         *

        return arguments != null;
    }

    @SuppressWarnings("unchecked")
    @Override
    public <T> Class<T> getRawClass() {
        return (Class<T>) rawClass;
    }

    /**
     * Sets the raw class.
     *
     * @param rawClass
     *            The raw class. Must not be {@literal null}.
     */
    public void setRawClass(final Class<?> rawClass) {
        assertArgumentNotNull("rawClass", rawClass);