- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 60 for sounds (0.19 sec)
-
guava/src/com/google/common/reflect/TypeToken.java
} private static Bounds every(Type[] bounds) { // Every bound must match. On any false, result is false. return new Bounds(bounds, false); } private static Bounds any(Type[] bounds) { // Any bound matches. On any true, result is true. return new Bounds(bounds, true); } private static class Bounds { private final Type[] bounds;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:02:13 UTC 2023 - 53.6K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeToken.java
} private static Bounds every(Type[] bounds) { // Every bound must match. On any false, result is false. return new Bounds(bounds, false); } private static Bounds any(Type[] bounds) { // Any bound matches. On any true, result is true. return new Bounds(bounds, true); } private static class Bounds { private final Type[] bounds;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:02:13 UTC 2023 - 53.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
// // By far, the most common redundant pair are generated by bounds checking. // For example for the code: // // a[i] = 4 // foo(a[i]) // // The compiler will generate the following code: // // if i >= len(a) { // panic("not in bounds") // } // a[i] = 4 // if i >= len(a) { // panic("not in bounds") // } // foo(a[i]) //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
if x > 0 { x-- saX = sa[x] // TODO bounds check c = text[saX] b = bucket[c] - 1 bucket[c] = b } } } func induceL_8_64(text []byte, sa, freq, bucket []int64) { // Initialize positions for left side of character buckets. bucketMin_8_64(text, freq, bucket) bucket = bucket[:256] // eliminate bounds check for bucket[cB] below
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/groovy/scripts/internal/GradleResolveVisitor.java
ClassNode classNode = type.getType(); String name = type.getName(); ClassNode[] bounds = type.getUpperBounds(); if (bounds != null) { boolean nameAdded = false; for (ClassNode upperBound : bounds) { if (!nameAdded && upperBound != null || !resolve(classNode)) { genericParameterNames.put(name, type);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jan 26 14:58:23 UTC 2024 - 67.6K bytes - Viewed (0) -
src/runtime/mheap.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/crypto/internal/nistec/fiat/p384_fiat64.go
// // Bounds: [[0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff]] type p384MontgomeryDomainFieldElement [6]uint64 // The type p384NonMontgomeryDomainFieldElement is a field element NOT in the Montgomery domain. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:03 UTC 2022 - 90.8K bytes - Viewed (0) -
src/runtime/pprof/pprof_test.go
// loop-i goroutine should be present in the profile too. counts := make(map[string]int) for _, s := range p.Sample { label := s.Label[t.Name()+"-loop-i"] if len(label) > 0 { counts[label[0]]++ } } for j, max := 0, len(counts)-1; j <= max; j++ { n := counts[fmt.Sprint(j)] if n == 1 || (n == 2 && j == max) { continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 68.8K bytes - Viewed (0) -
src/time/time.go
} // Round returns the result of rounding d to the nearest multiple of m. // The rounding behavior for halfway values is to round away from zero. // If the result exceeds the maximum (or minimum) // value that can be stored in a [Duration], // Round returns the maximum (or minimum) duration. // If m <= 0, Round returns d unchanged. func (d Duration) Round(m Duration) Duration { if m <= 0 { return d
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 50.7K bytes - Viewed (0) -
tensorflow/c/c_api.h
// // If index is out of bounds, an error code will be set in the status object, // and -1 will be returned. TF_CAPI_EXPORT extern int64_t TF_DeviceListMemoryBytes( const TF_DeviceList* list, int index, TF_Status* status); // Retrieve the incarnation number of a given device. // // If index is out of bounds, an error code will be set in the status object, // and 0 will be returned.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Oct 26 21:08:15 UTC 2023 - 82.3K bytes - Viewed (0)