Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 15 for FITS (0.02 sec)

  1. guava/src/com/google/common/collect/ObjectArrays.java

       * of the returned array is that of the specified array. If the collection fits in the specified
       * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
       * specified array and the size of the specified collection.
       *
       * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 9K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/ObjectArrays.java

       * of the returned array is that of the specified array. If the collection fits in the specified
       * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
       * specified array and the size of the specified collection.
       *
       * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 9K bytes
    - Viewed (0)
  3. istioctl/pkg/dashboard/dashboard.go

    				}
    
    				if len(pl.Items) < 1 {
    					return errors.New("no pods found")
    				}
    
    				if len(pl.Items) > 1 {
    					log.Warnf("more than 1 pods fits selector: %s; will use pod: %s", labelSelector, pl.Items[0].Name)
    				}
    
    				// only use the first pod in the list
    				podName = pl.Items[0].Name
    				ns = pl.Items[0].Namespace
    			} else {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Apr 15 01:29:35 UTC 2024
    - 20.5K bytes
    - Viewed (0)
  4. android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java

       * array is that of the specified array. The returned array elements are in no particular order.
       * If the queue fits in the specified array, it is returned therein. Otherwise, a new array is
       * allocated with the runtime type of the specified array and the size of this queue.
       *
       * <p>If this queue fits in the specified array with room to spare (i.e., the array has more
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jun 07 21:36:32 UTC 2024
    - 19K bytes
    - Viewed (0)
  5. common-protos/k8s.io/apimachinery/pkg/apis/testapigroup/v1/generated.proto

      // +optional
      optional string serviceAccount = 9;
    
      // NodeName is a request to schedule this carp onto a specific node. If it is non-empty,
      // the scheduler simply schedules this carp onto that node, assuming that it fits resource
      // requirements.
      // +optional
      optional string nodeName = 10;
    
      // Host networking requested for this carp. Use the host's network namespace.
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 7.7K bytes
    - Viewed (0)
  6. istioctl/pkg/admin/istiodconfig.go

    				}
    
    				if len(pl.Items) < 1 {
    					return errors.New("no pods found")
    				}
    
    				if len(pl.Items) > 1 {
    					log.Warnf("more than 1 pods fits selector: %s; will use pod: %s", istiodLabelSelector, pl.Items[0].Name)
    				}
    
    				// only use the first pod in the list
    				podName = pl.Items[0].Name
    				ns = pl.Items[0].Namespace
    			} else if len(args) == 1 {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Apr 13 05:23:38 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/LongMath.java

      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/math/LongMath.java

      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  9. common-protos/k8s.io/api/resource/v1alpha2/generated.proto

      // ResourceClaimSpec.
      // +optional
      optional ResourceClassParametersReference parametersRef = 3;
    
      // Only nodes matching the selector will be considered by the scheduler
      // when trying to find a Node that fits a Pod when that Pod uses
      // a ResourceClaim that has not been allocated yet.
      //
      // Setting this field is optional. If null, all nodes are candidates.
      // +optional
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 14.4K bytes
    - Viewed (0)
  10. src/archive/zip/zip_test.go

    	if testing.Short() {
    		t.Skip("slow test; skipping")
    	}
    	t.Parallel()
    	// Test a zip file with uncompressed size 0xFFFFFFFF.
    	// That's the magic marker for a 64-bit file, so even though
    	// it fits in a 32-bit field we must use the 64-bit field.
    	// Go 1.5 and earlier got this wrong,
    	// writing an invalid zip file.
    	const size = 1<<32 - 1 - int64(len("END\n")) // before the "END\n" part
    	buf := testZip64(t, size)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 19.6K bytes
    - Viewed (0)
Back to top