Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 61 for shards (0.04 sec)

  1. docs/debugging/hash-set/main.go

    	flag.StringVar(&deploymentID, "deployment-id", "", "MinIO deployment ID, obtained from 'format.json'")
    	flag.IntVar(&setCount, "set-count", 0, "Total set count")
    	flag.IntVar(&shards, "shards", 0, "Total shards count")
    	flag.BoolVar(&verbose, "v", false, "Display all objects")
    
    	flag.Parse()
    
    	if deploymentID == "" {
    		log.Fatalln("deployment ID is mandatory")
    	}
    
    	if setCount == 0 {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 3.7K bytes
    - Viewed (0)
  2. fess-crawler-opensearch/src/main/java/org/codelibs/fess/crawler/util/OpenSearchCrawlerConfig.java

            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) {
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sun Jul 06 02:13:03 UTC 2025
    - 5.4K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/crawler/util/FessCrawlerConfig.java

        /**
         * 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
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/app/web/admin/maintenance/ActionForm.java

        @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)
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 1.5K bytes
    - Viewed (0)
  5. docs/distributed/SIZING.md

    This will allow normal write operations to take place on systems that exceed the write tolerance.
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 15 23:04:20 UTC 2023
    - 3.9K bytes
    - Viewed (0)
  6. 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)
  7. 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)
  8. docs/distributed/DESIGN.md

    Erasure coding used by MinIO is [Reed-Solomon](https://github.com/klauspost/reedsolomon) erasure coding scheme, which has a total shard maximum of 256 i.e 128 data and 128 parity. MinIO design goes beyond this limitation by doing some practical architecture choices.
    
    - Erasure set is a single erasure coding unit within a MinIO deployment. An object is sharded within an erasure set. Erasure set size is automatically calculated based on the number of drives. MinIO supports unlimited number...
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 26 09:25:50 UTC 2025
    - 8K bytes
    - Viewed (2)
  9. cmd/erasure-decode.go

    				// 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)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 29 01:40:52 UTC 2024
    - 9.5K bytes
    - Viewed (0)
  10. src/test/java/jcifs/dcerpc/msrpc/MsrpcShareEnumTest.java

            shareInfo1.netname = "Share1";
            shareInfo1.type = 0;
            shareInfo1.remark = "Remark for Share1";
    
            srvsvc.ShareInfo1 shareInfo2 = new srvsvc.ShareInfo1();
            shareInfo2.netname = "Share2";
            shareInfo2.type = 1;
            shareInfo2.remark = "Remark for Share2";
    
            // Create ShareInfoCtr1 with the shares
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 8.1K bytes
    - Viewed (0)
Back to top