Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 121 - 130 of 238 for lower (0.03 seconds)

  1. CHANGELOG/CHANGELOG-1.5.md

    * NodeController waits for informer sync before doing anything ([#34809](https://github.com/kubernetes/kubernetes/pull/34809), [@gmarek](https://github.com/gmarek))
    * azure: lower log priority for skipped nic update message ([#34730](https://github.com/kubernetes/kubernetes/pull/34730), [@colemickens](https://github.com/colemickens))
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Thu Dec 24 02:28:26 GMT 2020
    - 136.4K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/collect/Maps.java

          // meant that sometimes a too-large threshold is calculated. However, this new threshold is
          // independent of the initial capacity, except that it won't be lower than the threshold
          // computed from that capacity. Because the internal table is only allocated on the first
          // write, we won't see copying because of the new threshold. So it is always OK to use the
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Sep 23 17:50:58 GMT 2025
    - 157.6K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/Maps.java

          // meant that sometimes a too-large threshold is calculated. However, this new threshold is
          // independent of the initial capacity, except that it won't be lower than the threshold
          // computed from that capacity. Because the internal table is only allocated on the first
          // write, we won't see copying because of the new threshold. So it is always OK to use the
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Nov 17 22:50:48 GMT 2025
    - 163.5K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

      /**
       * Applies a supplemental hash function to a given hash code, which defends against poor quality
       * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
       * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
       * bits.
       *
       * @param h hash code
       */
      static int rehash(int h) {
        // Spread bits to regularize both segment and index locations,
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 89.9K bytes
    - Click Count (0)
  5. cmd/erasure-object.go

    			markDelete = false
    		}
    		if opts.VersionPurgeStatus() == replication.VersionPurgeComplete {
    			markDelete = false
    		}
    		// now, since VersionPurgeStatus() is already set, we can let the
    		// lower layers decide this. This fixes a regression that was introduced
    		// in PR #14555 where !VersionPurgeStatus.Empty() is automatically
    		// considered as Delete marker true to avoid listing such objects by
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 24 04:05:31 GMT 2025
    - 80.4K bytes
    - Click Count (0)
  6. cmd/iam-store.go

    			mu.Lock()
    			policies = append(policies, policy.toSlice()...)
    			mu.Unlock()
    			return nil
    		}, index)
    	}
    
    	err := errors.Join(g.Wait()...)
    	return policies, err
    }
    
    // policyDBGet - lower-level helper; does not take locks.
    //
    // If a group is passed, it returns policies associated with the group.
    //
    // If a user is passed, it returns policies of the user along with any groups
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 87.1K bytes
    - Click Count (0)
  7. RELEASE.md

    *   `tf.data`
    
        * `tf.data` now has an `autotune_options.initial_parallelism` option to
          control the initial parallelism setting used by autotune before the data
          pipeline has started running. The default is 16. A lower value reduces
          initial memory usage, while a higher value improves startup time.
    
    ## Keras
    
    *  `keras.layers.experimental.DynamicEmbedding`
        * Added `DynamicEmbedding` Keras layer
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  8. cmd/object-handlers.go

    		return
    	}
    
    	if r.ContentLength <= 0 {
    		writeErrorResponse(ctx, w, errorCodes.ToAPIErr(ErrEmptyRequestBody), r.URL)
    		return
    	}
    
    	// Take read lock on object, here so subsequent lower-level
    	// calls do not need to.
    	lock := objectAPI.NewNSLock(bucket, object)
    	lkctx, err := lock.GetRLock(ctx, globalOperationTimeout)
    	if err != nil {
    		writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL)
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 120.6K bytes
    - Click Count (0)
  9. CHANGELOG/CHANGELOG-1.21.md

    - The `controller.kubernetes.io/pod-deletion-cost` annotation can be set to offer a hint on the cost of deleting a `Pod` compared to other pods belonging to the same ReplicaSet. Pods with lower deletion cost are deleted first. This is an alpha feature. ([#99163](https://github.com/kubernetes/kubernetes/pull/99163), [@ahg-g](https://github.com/ahg-g))
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Fri Oct 14 07:03:14 GMT 2022
    - 367.3K bytes
    - Click Count (0)
  10. cmd/xl-storage.go

    	// Small file threshold below which data accompanies metadata from storage layer.
    	smallFileThreshold = 128 * humanize.KiByte // Optimized for NVMe/SSDs
    
    	// For hardrives it is possible to set this to a lower value to avoid any
    	// spike in latency. But currently we are simply keeping it optimal for SSDs.
    
    	// bigFileThreshold is the point where we add readahead to put operations.
    	bigFileThreshold = 128 * humanize.MiByte
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 91.7K bytes
    - Click Count (0)
Back to Top