- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 304 for integers (0.13 sec)
-
staging/src/k8s.io/apiextensions-apiserver/pkg/apiserver/schema/listtype/validation_test.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 20:13:14 UTC 2024 - 24.2K bytes - Viewed (0) -
platforms/jvm/language-java/src/main/java/org/gradle/api/internal/tasks/compile/incremental/deps/ClassSetAnalysisData.java
* Gets the accessible, inlineable constants of the given class. */ public IntSet getConstants(String className) { IntSet integers = classesToConstants.get(className); if (integers == null) { return IntSets.EMPTY_SET; } return integers; } public static class Serializer extends AbstractSerializer<ClassSetAnalysisData> {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 26 15:22:57 UTC 2024 - 15.9K bytes - Viewed (0) -
src/math/rand/v2/rand.go
// There are exactly 1<<24 float32s in [0,1). Use Intn(1<<24) / (1<<24). return float32(r.Uint32()<<8>>8) / (1 << 24) } // Perm returns, as a slice of n ints, a pseudo-random permutation of the integers // in the half-open interval [0,n). func (r *Rand) Perm(n int) []int { p := make([]int, n) for i := range p { p[i] = i } r.Shuffle(len(p), func(i, j int) { p[i], p[j] = p[j], p[i] }) return p
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:25:49 UTC 2024 - 12.8K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedBytes.java
for (int i = fromIndex; i < toIndex; i++) { array[i] = flip(array[i]); } } /** * Sorts the elements of {@code array} in descending order, interpreting them as unsigned 8-bit * integers. * * @since 23.1 */ public static void sortDescending(byte[] array) { checkNotNull(array); sortDescending(array, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
for (int i = fromIndex; i < toIndex; i++) { array[i] = flip(array[i]); } } /** * Sorts the elements of {@code array} in descending order, interpreting them as unsigned 8-bit * integers. * * @since 23.1 */ public static void sortDescending(byte[] array) { checkNotNull(array); sortDescending(array, 0, array.length); } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
CanonicalLocalSplits: make(map[LocalSlotSplitKey]*LocalSlot), } } // NumBlocks returns an integer larger than the id of any Block in the Func. func (f *Func) NumBlocks() int { return f.bid.num() } // NumValues returns an integer larger than the id of any Value in the Func. func (f *Func) NumValues() int { return f.vid.num() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
staging/src/k8s.io/api/resource/v1alpha2/generated.proto
// // +listType=atomic // +optional repeated NamedResourcesAttribute attributes = 2; } // NamedResourcesIntSlice contains a slice of 64-bit integers. message NamedResourcesIntSlice { // Ints is the slice of 64-bit integers. // // +listType=atomic repeated int64 ints = 1; } // NamedResourcesRequest is used in ResourceRequestModel. message NamedResourcesRequest {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 23 22:07:50 UTC 2024 - 26.2K bytes - Viewed (0) -
src/runtime/string.go
n := int64(un) if neg { n = -n } return n, true } // atoi is like atoi64 but for integers // that fit into an int. func atoi(s string) (int, bool) { if n, ok := atoi64(s); n == int64(int(n)) { return int(n), ok } return 0, false } // atoi32 is like atoi but for integers // that fit into an int32. func atoi32(s string) (int32, bool) { if n, ok := atoi64(s); n == int64(int32(n)) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.4K bytes - Viewed (0) -
staging/src/k8s.io/api/batch/v1/types_swagger_doc_generated.go
the Job. The list of indexes must be within 0 to \".spec.completions-1\" and must not contain duplicates. At least one element is required. The indexes are represented as intervals separated by commas. The intervals can be a decimal integer or a pair of decimal integers separated by a hyphen. The number are listed in represented by the first and last element of the series, separated by a hyphen. For example, if the completed indexes are 1, 3, 4, 5 and 7, they are represented as \"1,3-5,7\". When this...
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 12:01:28 UTC 2024 - 27.5K bytes - Viewed (0) -
src/math/rand/rand.go
again: f := float32(r.Float64()) if f == 1 { goto again // resample; this branch is taken O(very rarely) } return f } // Perm returns, as a slice of n ints, a pseudo-random permutation of the integers // in the half-open interval [0,n). func (r *Rand) Perm(n int) []int { m := make([]int, n) // In the following loop, the iteration when i=0 always swaps m[0] with m[0].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:09:08 UTC 2024 - 16.9K bytes - Viewed (0)