- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 79 for shards (0.04 sec)
-
docs/debugging/xl-meta/main.go
valid := 0 for shardIdx, shard := range splitFilled[:k] { shardConfig[shardIdx] = shard[offset] valid += int(shard[offset]) if shard[offset] == 0 { shards[shardIdx] = shards[shardIdx][:0] } else { shards[shardIdx] = append(shards[shardIdx][:0], splitData[shardIdx][offset]) } }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 40.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/admin/maintenance/AdminMaintenanceAction.java
} /** * Starts a reindex operation with the specified parameters. * * @param replaceAliases whether to replace aliases after reindexing * @param resetDictionaries whether to reset dictionaries during reindexing * @param numberOfShards the number of shards for the new index
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 18K bytes - Viewed (0) -
docs/erasure/README.md
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...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
fess-crawler-opensearch/src/main/java/org/codelibs/fess/crawler/service/impl/AbstractCrawlerService.java
*/ 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; } /**
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Thu Aug 07 02:55:08 UTC 2025 - 34.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/suggest/request/popularwords/PopularWordsRequest.java
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
Registered: Fri Sep 19 09:08:11 UTC 2025 - Last Modified: Thu Aug 07 02:41:28 UTC 2025 - 9.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/suggest/request/suggest/SuggestRequest.java
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
Registered: Fri Sep 19 09:08:11 UTC 2025 - Last Modified: Thu Aug 07 02:41:28 UTC 2025 - 17.8K bytes - Viewed (0) -
cmd/erasure-metadata.go
// 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 }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 21.3K bytes - Viewed (0) -
cmd/notification.go
// 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
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 45.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/opensearch/client/SearchEngineClient.java
* * @param index the index configuration name * @param indexName the actual index name to create * @param numberOfShards the number of primary shards * @param autoExpandReplicas the auto expand replicas setting * @param uploadConfig whether to upload configuration files * @return true if the index was created successfully, false otherwise */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sun Aug 31 08:19:00 UTC 2025 - 121.9K bytes - Viewed (0) -
RELEASE.md
tensors will be split into shards when the saver writes the checkpoint shards to disk. `tf.train.experimental.ShardByTaskPolicy` is the default sharding behavior, but `tf.train.experimental.MaxShardSizePolicy` can be used to shard the checkpoint with a maximum shard file size. Users with advanced use cases can also write their own custom
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2)