- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 101 for underflow (0.32 sec)
-
src/cmd/compile/internal/types2/expr.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 51.7K bytes - Viewed (0) -
src/time/time.go
func (t Time) Sub(u Time) Duration { if t.wall&u.wall&hasMonotonic != 0 { return subMono(t.ext, u.ext) } d := Duration(t.sec()-u.sec())*Second + Duration(t.nsec()-u.nsec()) // Check for overflow or underflow. switch { case u.Add(d).Equal(t): return d // d is correct case t.Before(u): return minDuration // t - u is negative out of range default: return maxDuration // t - u is positive out of range }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 50.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
return fc&2 != 0 } // C reports whether an unsigned add overflowed (carry), or an // unsigned subtract did not underflow (borrow). func (fc flagConstant) C() bool { return fc&4 != 0 } // V reports whether a signed operation overflowed or underflowed. func (fc flagConstant) V() bool { return fc&8 != 0 } func (fc flagConstant) eq() bool { return fc.Z() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/net/http/transport.go
if n == 0 { // Shouldn't happen, but if it does, the counting is buggy and could // easily lead to a silent deadlock, so report the problem loudly. panic("net/http: internal error: connCount underflow") } // Can we hand this count to a goroutine still waiting to dial? // (Some goroutines on the wait list may have timed out or // gotten a connection another way. If they're all gone,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 21:59:21 UTC 2024 - 91K bytes - Viewed (0) -
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/maven/MavenDependencyManagementImportOrderTest.groovy
} } task verifyUndertowVersion { def files = configurations.test doLast { def fileNames = files.collect { it.name } assert fileNames.contains('undertow-servlet-1.4.11.Final.jar') assert !fileNames.contains('undertow-servlet-1.2.9.Final.jar') } } """ then: succeeds 'verifyUndertowVersion' } @Issue("https://github.com/gradle/gradle/issues/2212")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 5.6K bytes - Viewed (0) -
maven-model-builder/src/test/resources/dag.txt
quarkus/independent-projects/resteasy-reactive/server/runtime/pom.xml quarkus/extensions/undertow/deployment/pom.xml quarkus/core/deployment/pom.xml quarkus/extensions/arc/deployment/pom.xml quarkus/extensions/undertow/spi/pom.xml quarkus/extensions/undertow/runtime/pom.xml quarkus/extensions/vertx-http/deployment/pom.xml quarkus/extensions/kubernetes/spi/pom.xml
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Jan 15 16:49:26 UTC 2024 - 224K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
// 2¹³⁰ - 5, but will be less than 2 * (2¹³⁰ - 5). To complete the reduction // in constant time, we compute t = h - (2¹³⁰ - 5), and select h as the // result if the subtraction underflows, and t otherwise. hMinusP0, b := bits.Sub64(h0, p0, 0) hMinusP1, b := bits.Sub64(h1, p1, b) _, b = bits.Sub64(h2, p2, b) // h = h if h < p else h - p h0 = select64(b, h0, hMinusP0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0) -
guava/src/com/google/common/math/PairedStatsAccumulator.java
checkState(xSumOfSquaresOfDeltas > 0.0); checkState(ySumOfSquaresOfDeltas > 0.0); // The product of two positive numbers can be zero if the multiplication underflowed. We // force a positive value by effectively rounding up to MIN_VALUE. double productOfSumsOfSquaresOfDeltas = ensurePositive(xSumOfSquaresOfDeltas * ySumOfSquaresOfDeltas);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 10.3K bytes - Viewed (0) -
src/math/big/natdiv.go
3-by-2 guess is off by at most 1, it can be convenient to perform the final u < q̂·v as part of the computation of the remainder r = u - q̂·v. If the subtraction underflows, decremeting q̂ and adding one v back to r is enough to arrive at the final q, r. That's the entirety of long division: scale the inputs, and then loop over
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStatsAccumulator.java
checkState(xSumOfSquaresOfDeltas > 0.0); checkState(ySumOfSquaresOfDeltas > 0.0); // The product of two positive numbers can be zero if the multiplication underflowed. We // force a positive value by effectively rounding up to MIN_VALUE. double productOfSumsOfSquaresOfDeltas = ensurePositive(xSumOfSquaresOfDeltas * ySumOfSquaresOfDeltas);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 10.3K bytes - Viewed (0)