/**
     * Gets the number of shards for the queue index.
     *
     * @return the number of queue shards
     */
    @Override
    public int getQueueShards() {
        return ComponentUtil.getFessConfig().getIndexDocumentCrawlerQueueNumberOfShardsAsInteger();
    }

    /**
     * Gets the number of shards for the data index.
     *
     * @return the number of data shards
     */
    @Override

        this.filterIndex = filterIndex;
    }

    /**
     * Returns the number of queue shards.
     * @return The number of queue shards.
     */
    public int getQueueShards() {
        return queueShards;
    }

    /**
     * Sets the number of queue shards.
     * @param queueShards The number of queue shards.
     */
    public void setQueueShards(final int queueShards) {

code is a mathematical algorithm to reconstruct missing or corrupted data. MinIO uses Reed-Solomon code to shard objects into variable data and parity blocks. For example, in a 12 drive setup, an object can be sharded to a variable number of data and parity blocks across all the drives - ranging from six data and six parity blocks to ten data and two parity blocks.

By default, MinIO shards the objects across N/2 data and N/2 parity drives. Though, you can use [storage classes](https://github...

- We limited the number of drives to 16 for erasure set because, erasure code shards more than 16 can become chatty and do not have any performance advantages. Additionally since 16 drive erasure set gives you tolerance of 8 drives per object by default which is plenty in any practical scenario.

    @Size(max = 10)
    public String replaceAliases;

    /**
     * The flag to reset dictionaries.
     */
    @Size(max = 10)
    public String resetDictionaries;

    /**
     * The number of shards for doc.
     */
    @Size(max = 10)
    public String numberOfShardsForDoc = ComponentUtil.getFessConfig().getIndexNumberOfShards();

    /**
     * The auto expand replicas for doc.
     */
    @Size(max = 10)

    /**
     * Share type constant for disk shares (file shares).
     */
    public static final byte SMB2_SHARE_TYPE_DISK = 0x1;
    /**
     * Share type constant for named pipe shares (IPC).
     */
    public static final byte SMB2_SHARE_TYPE_PIPE = 0x2;
    /**
     * Share type constant for printer shares.
     */
    public static final byte SMB2_SHARE_TYPE_PRINT = 0x3;

    /**

        /**
         * Default constructor for ShareInfoCtr0.
         */
        public ShareInfoCtr0() {
        }

        /**
         * The number of shares in the array.
         */
        /**
         * The number of shares in the array.
         */
        public int count;
        /**
         * Array of ShareInfo0 structures containing share information.
         */

import jcifs.Configuration;
import jcifs.internal.smb1.trans.SmbComTransaction;
import jcifs.internal.util.SMBUtil;

/**
 * SMB1 NetShareEnum request message for enumerating network shares on a server.
 * This class implements the SMB1 transaction to retrieve a list of available shares
 * from the target server, including share names, types, and descriptions.
 */
public class NetShareEnum extends SmbComTransaction {

     * <li> all browseable shares of a server including printers, IPC
     * services, or disk volumes if this resource is a server URL in the form
     * <code>smb1://server/</code>,
     * <li> or <code>null</code> if the resource cannot be resolved.
     * </ul>
     *
     * @return A <code>String[]</code> array of files and directories,
     * workgroups, servers, or shares depending on the context of the

import jcifs.internal.smb1.trans.SmbComTransactionResponse;
import jcifs.internal.util.SMBUtil;

/**
 * SMB1 NetShareEnum response message for enumerating network shares on a server.
 * This class handles the response data from a NetShareEnum RPC call, which returns
 * information about all available shares on the target server.
 */
public class NetShareEnumResponse extends SmbComTransactionResponse {