- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for fiets (0.15 sec)
-
istioctl/pkg/dashboard/dashboard.go
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Apr 15 01:29:35 GMT 2024 - 20.5K bytes - Viewed (0) -
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
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
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
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
*/ public static boolean isPowerOfTwo(int x) { return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned integers, and 0 otherwise. Assumes that x - y fits into * a signed int. The implementation is branch-free, and benchmarks suggest it is measurably (if * narrowly) faster than the straightforward ternary expression. */ @VisibleForTesting
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* type of the returned array is that of the specified array. 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
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* type of the returned array is that of the specified array. 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
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
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 {
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Sat Apr 13 05:23:38 GMT 2024 - 13.5K bytes - Viewed (0) -
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
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 14.4K bytes - Viewed (0) -
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
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
/** * The largest power of two that can be represented as an unsigned {@code byte}. * * @since 10.0 */ public static final byte MAX_POWER_OF_TWO = (byte) 0x80; /** * The largest value that fits into an unsigned byte. * * @since 13.0 */ public static final byte MAX_VALUE = (byte) 0xFF; private static final int UNSIGNED_MASK = 0xFF; /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0)