*/
    public void setBulkBufferSize(final int bulkBufferSize) {
        this.bulkBufferSize = bulkBufferSize;
    }

    /**
     * Sets the number of shards for the OpenSearch index.
     *
     * @param numberOfShards The number of shards.
     */
    public void setNumberOfShards(final int numberOfShards) {
        this.numberOfShards = numberOfShards;
    }

    /**

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...

            public void onResponse(final SearchResponse searchResponse) {
                if (searchResponse.getFailedShards() > 0) {
                    deferred.reject(new SuggesterException("Search failure. Failed shards num:" + searchResponse.getFailedShards()));
                } else {
                    deferred.resolve(createResponse(searchResponse));
                }
            }

            @Override

     */
    protected QueryParser getQueryParser() {
        return ComponentUtil.getQueryParser();
    }

    /**
     * Processes and sets search preferences for routing search requests to appropriate OpenSearch shards.
     * This method determines the preference value based on user roles, session information, or request parameters.
     *
     * @param searchRequestBuilder the search request builder to configure

				// Reading first time on this disk, hence the buffer needs to be allocated.
				// Subsequent reads will reuse this buffer.
				p.buf[bufIdx] = make([]byte, p.shardSize)
			}
			// For the last shard, the shardsize might be less than previous shard sizes.
			// Hence the following statement ensures that the buffer size is reset to the right size.
			p.buf[bufIdx] = p.buf[bufIdx][:p.shardSize]
			n, err := rr.ReadAt(p.buf[bufIdx], p.offset)

index.document.suggest.index=fess
# Index name for crawler documents.
index.document.crawler.index=fess_crawler
# Number of primary shards for crawler queue index.
index.document.crawler.queue.number_of_shards=10
# Number of primary shards for crawler data index.
index.document.crawler.data.number_of_shards=10
# Number of primary shards for crawler filter index.
index.document.crawler.filter.number_of_shards=10
# Number of replicas for crawler queue index.

			// In this case, parity == 0 implies that this object version is a
			// delete marker
			readQuorum = N/2 + 1
		}
		if occ < readQuorum {
			// Ignore this parity since we don't have enough shards for read quorum
			continue
		}

		if occ > maxOcc {
			maxOcc = occ
			cparity = parity
		}
	}

	if maxOcc == 0 {
		// Did not found anything useful
		return -1
	}

labels.searchlog_usersessionid=User ID
labels.searchlog_requestedtime=Time
labels.searchlog_accesstype=Access Type
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=Number of Shards
labels.auto_expand_replicas_for_doc=Auto-expand Replicas
labels.clear_crawler_index=Crawler Index
labels.clear_crawler_index_button=Delete Crawler Index
labels.diagnostic_logs=Diagnostics

	// To avoid these problems we must split the work at scale. With 1000 node
	// setup becoming a reality we must try to shard the work properly such as
	// pick 10 nodes that precisely can send those 100 requests the first node
	// in the 10 node shard would coordinate between other 9 shards to get the
	// rest of the `99*9` requests.
	//
	// This essentially splits the workload properly and also allows for network

labels.searchlog_usersessionid=User ID
labels.searchlog_requestedtime=Time
labels.searchlog_accesstype=Access Type
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=Number of Shards
labels.auto_expand_replicas_for_doc=Auto-expand Replicas
labels.clear_crawler_index=Crawler Index
labels.clear_crawler_index_button=Delete Crawler Index
labels.diagnostic_logs=Diagnostics