Search Options

Results per page
Sort
Preferred Languages
Advance

Results 571 - 580 of 638 for Scaled (0.12 sec)

  1. CHANGELOG/CHANGELOG-1.17.md

     - Fixes a bug defining a default value for a replicas field in a custom resource definition that has the scale subresource enabled ([#90020](https://github.com/kubernetes/kubernetes/pull/90020), [@liggitt](https://github.com/liggitt)) [SIG API Machinery, CLI, Cloud Provider, Cluster Lifecycle and Instrumentation]
    Registered: Fri Nov 01 09:05:11 UTC 2024
    - Last Modified: Thu Jan 28 10:44:33 UTC 2021
    - 346.2K bytes
    - Viewed (1)
  2. cmd/erasure-object.go

    				errFileCorrupt,
    			) {
    				missingBlocks++
    			}
    		}
    
    		// if missing metadata can be reconstructed, attempt to reconstruct.
    		// additionally do not heal delete markers inline, let them be
    		// healed upon regular heal process.
    		if missingBlocks > 0 && missingBlocks < fi.Erasure.DataBlocks {
    			globalMRFState.addPartialOp(PartialOperation{
    				Bucket:    fi.Volume,
    				Object:    fi.Name,
    				VersionID: fi.VersionID,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Oct 31 22:10:24 UTC 2024
    - 78.8K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/hash/BloomFilter.java

       *     been added to the filter. Note that {@code put(t)} always returns the <i>opposite</i>
       *     result to what {@code mightContain(t)} would have returned at the time it is called.
       * @since 12.0 (present in 11.0 with {@code void} return type})
       */
      @CanIgnoreReturnValue
      public boolean put(@ParametricNullness T object) {
        return strategy.put(object, funnel, numHashFunctions, bits);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 23 16:45:30 UTC 2024
    - 26.6K bytes
    - Viewed (0)
  4. migrator/migrator.go

    			if length > 0 && field.Size > 0 {
    				alterColumn = true
    			} else {
    				// has size in data type and not equal
    				// Since the following code is frequently called in the for loop, reg optimization is needed here
    				matches2 := regFullDataType.FindAllStringSubmatch(fullDataType, -1)
    				if !field.PrimaryKey &&
    					(len(matches2) == 1 && matches2[0][1] != fmt.Sprint(length) && ok) {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Fri Apr 26 07:15:49 UTC 2024
    - 29K bytes
    - Viewed (0)
  5. cmd/site-replication.go

    	replicateIAMItem        = "SRPeerReplicateIAMItem"
    	replicateBucketMetadata = "SRPeerReplicateBucketMeta"
    	siteReplicationEdit     = "SiteReplicationEdit"
    )
    
    // MakeBucketHook - called during a regular make bucket call when cluster
    // replication is enabled. It is responsible for the creation of the same bucket
    // on remote clusters, and creating replication rules on local and peer
    // clusters.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 15 12:04:40 UTC 2024
    - 185.1K bytes
    - Viewed (0)
  6. src/main/java/jcifs/SmbResource.java

         * <p>
         * Initially, the SIDs within each ACE will not be resolved however when
         * <tt>getType()</tt>, <tt>getDomainName()</tt>, <tt>getAccountName()</tt>,
         * or <tt>toString()</tt> is called, the names will attempt to be
         * resolved. If the names cannot be resolved (e.g. due to temporary
         * network failure), the said methods will return default values (usually
         * <tt>S-X-Y-Z</tt> strings of fragments of).
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Dec 20 14:09:34 UTC 2020
    - 26K bytes
    - Viewed (0)
  7. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

         */
        int crossOver(int index, E x) {
          int minChildIndex = findMinChild(index);
          // TODO(kevinb): split the && into two if's and move crossOverUp so it's
          // only called when there's no child.
          if ((minChildIndex > 0) && (ordering.compare(elementData(minChildIndex), x) < 0)) {
            queue[index] = elementData(minChildIndex);
            queue[minChildIndex] = x;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  8. cmd/object-multipart-handlers.go

    		}
    
    		_, sourceReplReq := r.Header[xhttp.MinIOSourceReplicationRequest]
    		ssecRepHeaders := []string{
    			"X-Minio-Replication-Server-Side-Encryption-Seal-Algorithm",
    			"X-Minio-Replication-Server-Side-Encryption-Sealed-Key",
    			"X-Minio-Replication-Server-Side-Encryption-Iv",
    		}
    		ssecRep := false
    		for _, header := range ssecRepHeaders {
    			if val := r.Header.Get(header); val != "" {
    				ssecRep = true
    				break
    			}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Aug 31 18:25:48 UTC 2024
    - 39.2K bytes
    - Viewed (0)
  9. cmd/data-usage-cache.go

    	Entry  dataUsageEntry
    }
    
    type dataUsageCacheInfo struct {
    	// Name of the bucket. Also root element.
    	Name       string
    	NextCycle  uint32
    	LastUpdate time.Time
    	// indicates if the disk is being healed and scanner
    	// should skip healing the disk
    	SkipHealing bool
    
    	// Active lifecycle, if any on the bucket
    	lifeCycle *lifecycle.Lifecycle `msg:"-"`
    
    	// optional updates channel.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 34.7K bytes
    - Viewed (0)
  10. src/archive/tar/writer_test.go

    			t.Errorf("%v: w.WriteHeader() = %v, want ErrFieldTooLong", test.name, err)
    		}
    	}
    }
    
    // testNonEmptyWriter wraps an io.Writer and ensures that
    // Write is never called with an empty buffer.
    type testNonEmptyWriter struct{ io.Writer }
    
    func (w testNonEmptyWriter) Write(b []byte) (int, error) {
    	if len(b) == 0 {
    		return 0, errors.New("unexpected empty Write call")
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Sep 23 14:32:33 UTC 2024
    - 39.4K bytes
    - Viewed (0)
Back to top