- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 101 for underflow (0.12 sec)
-
guava/src/com/google/common/collect/DiscreteDomain.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/internal/upload/reports.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 14:52:56 UTC 2024 - 10.3K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/queueset.go
continue } oldNextDispatchR := queue.nextDispatchR queue.nextDispatchR -= rDecrement if queue.nextDispatchR > oldNextDispatchR { klog.ErrorS(errors.New("queue::nextDispatchR underflow"), "Underflow", "QS", qs.qCfg.Name, "queue", qIdx, "oldNextDispatchR", oldNextDispatchR, "newNextDispatchR", queue.nextDispatchR, "incrR", incrR) success = false } queue.requestsWaiting.Walk(func(req *request) bool {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 04 16:59:21 UTC 2024 - 42.4K bytes - Viewed (0) -
src/cmd/internal/obj/ppc64/obj9.go
if framesize > abi.StackBig { // Such a large stack we need to protect against underflow. // The runtime guarantees SP > objabi.StackBig, but // framesize is large enough that SP-framesize may // underflow, causing a direct comparison with the // stack guard to incorrectly succeed. We explicitly // guard against underflow. // // CMPU SP, $(framesize-StackSmall) // BLT label-of-call-to-morestack
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 40.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DiscreteDomain.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.3K bytes - Viewed (0) -
src/math/big/nat.go
n := len(y) switch { case m < n: panic("underflow") case m == 0: // n == 0 because m >= n; result is 0 return z[:0] case n == 0: // result is x return z.set(x) } // m > 0 z = z.make(m) c := subVV(z[0:n], x, y) if m > n { c = subVW(z[n:], x[n:], c) } if c != 0 { panic("underflow") } return z.norm() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/strconv/eisel_lemire.go
return 0, false } // From 54 to 53 Bits. retMantissa += retMantissa & 1 retMantissa >>= 1 if retMantissa>>53 > 0 { retMantissa >>= 1 retExp2 += 1 } // retExp2 is a uint64. Zero or underflow means that we're in subnormal // float64 space. 0x7FF or above means that we're in Inf/NaN float64 space. // // The if block is equivalent to (but has fewer branches than): // if retExp2 <= 0 || retExp2 >= 0x7FF { etc }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 41.4K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/plugins/posix/posix_filesystem.cc
static_cast<off_t>(offset))}; if (r > 0) { dst += r; offset += static_cast<uint64_t>(r); n -= r; // safe as 0 < r <= n so n will never underflow read += r; } else if (r == 0) { TF_SetStatus(status, TF_OUT_OF_RANGE, "Read fewer bytes than requested"); break; } else if (errno == EINTR || errno == EAGAIN) { // Retry } else {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sun Mar 24 20:08:23 UTC 2024 - 15.8K bytes - Viewed (0) -
src/math/big/float.go
// as the corresponding float32 or float64 IEEE 754 arithmetic for operands // that correspond to normal (i.e., not denormal) float32 or float64 numbers. // Exponent underflow and overflow lead to a 0 or an Infinity for different // values than IEEE 754 because Float exponents have a much larger range. // // The zero (uninitialized) value for a Float is ready to use and represents
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
// propagation. return v.carryPropagateGeneric() } // Subtract sets v = a - b, and returns v. func (v *Element) Subtract(a, b *Element) *Element { // We first add 2 * p, to guarantee the subtraction won't underflow, and // then subtract b (which can be up to 2^255 + 2^13 * 19). v.l0 = (a.l0 + 0xFFFFFFFFFFFDA) - b.l0 v.l1 = (a.l1 + 0xFFFFFFFFFFFFE) - b.l1 v.l2 = (a.l2 + 0xFFFFFFFFFFFFE) - b.l2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0)