- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 81 for Underflow (0.36 sec)
-
src/math/exp_arm64.s
TEXT ·archExp(SB),$0-16 FMOVD x+0(FP), F0 // F0 = x FCMPD F0, F0 BNE isNaN // x = NaN, return NaN FMOVD $Overflow, F1 FCMPD F1, F0 BGT overflow // x > Overflow, return PosInf FMOVD $Underflow, F1 FCMPD F1, F0 BLT underflow // x < Underflow, return 0 MOVD $NearZero, R0 FMOVD R0, F2 FABSD F0, F3 FMOVD $1.0, F1 // F1 = 1.0 FCMPD F2, F3 BLT nearzero // fabs(x) < NearZero, return 1 + x
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 15 15:48:19 UTC 2021 - 5.4K bytes - Viewed (0) -
src/math/exp.go
Log2e = 1.44269504088896338700e+00 Overflow = 7.09782712893383973096e+02 Underflow = -7.45133219101941108420e+02 NearZero = 1.0 / (1 << 28) // 2**-28 ) // special cases switch { case IsNaN(x) || IsInf(x, 1): return x case IsInf(x, -1): return 0 case x > Overflow: return Inf(1) case x < Underflow: return 0 case -NearZero < x && x < NearZero: return 1 + x }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 5.4K bytes - Viewed (0) -
src/runtime/histogram.go
counts [timeHistNumBuckets * timeHistNumSubBuckets]atomic.Uint64 // underflow counts all the times we got a negative duration // sample. Because of how time works on some platforms, it's // possible to measure negative durations. We could ignore them, // but we record them anyway because it's better to have some // signal that it's happening than just missing samples. underflow atomic.Uint64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 7.3K bytes - Viewed (0) -
src/runtime/histogram_test.go
for k := 0; k < (i+1-TimeHistMinBucketBits)*TimeHistNumSubBuckets+j; k++ { // Record a number of times equal to the bucket index. h.Record(base + v) } } } // Hit the underflow and overflow buckets. h.Record(int64(-1)) h.Record(math.MaxInt64) h.Record(math.MaxInt64) // Check to make sure there's exactly one count in each // bucket. for i := 0; i < TimeHistNumBuckets; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 16 16:32:01 UTC 2022 - 3.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopbce.go
continue } // Check for overflow/underflow. We need to make sure that inc never causes // the induction variable to wrap around. // We use a function wrapper here for easy return true / return false / keep going logic. // This function returns true if the increment will never overflow/underflow. ok := func() bool { if step > 0 { if limit.isGenericIntConst() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 17:37:47 UTC 2023 - 11.8K bytes - Viewed (0) -
src/debug/dwarf/buf.go
return buf{d, d.order, format, name, off, data, nil} } func (b *buf) uint8() uint8 { if len(b.data) < 1 { b.error("underflow") return 0 } val := b.data[0] b.data = b.data[1:] b.off++ return val } func (b *buf) bytes(n int) []byte { if n < 0 || len(b.data) < n { b.error("underflow") return nil } data := b.data[0:n] b.data = b.data[n:] b.off += Offset(n) return data }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 21 17:14:08 UTC 2022 - 3.7K bytes - Viewed (0) -
src/math/exp_amd64.s
MOVQ $NegInf, AX CMPQ AX, BX JNE notNegInf // -Inf, return 0 underflow: // return 0 MOVQ $0, ret+8(FP) RET overflow: // return +Inf MOVQ $PosInf, BX notNegInf: // NaN or +Inf, return x MOVQ BX, ret+8(FP) RET denormal: CMPL BX, $-52 JL underflow ADDL $0x3FE, BX // add bias - 1 SHLQ $52, BX MOVQ BX, X1 MULSD X1, X0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 15 15:48:19 UTC 2021 - 4.2K bytes - Viewed (0) -
src/math/jn.go
} else { b = J1(x) for i, a := 1, J0(x); i < n; i++ { a, b = b, b*(float64(i+i)/x)-a // avoid underflow } } } else { if x < TwoM29 { // x < 2**-29 // x is tiny, return the first Taylor expansion of J(n,x) // J(n,x) = 1/n!*(x/2)**n - ... if n > 33 { // underflow b = 0 } else { temp := x * 0.5 b = temp a := 1.0 for i := 2; i <= n; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 7.2K bytes - Viewed (0) -
src/math/hypot.go
package math /* Hypot -- sqrt(p*p + q*q), but overflows only if the result does. */ // Hypot returns [Sqrt](p*p + q*q), taking care to avoid // unnecessary overflow and underflow. // // Special cases are: // // Hypot(±Inf, q) = +Inf // Hypot(p, ±Inf) = +Inf // Hypot(NaN, q) = NaN // Hypot(p, NaN) = NaN func Hypot(p, q float64) float64 { if haveArchHypot { return archHypot(p, q)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 850 bytes - Viewed (0) -
platforms/core-runtime/io/src/main/java/org/gradle/internal/io/StreamByteBuffer.java
if (hasRemaining(buf)) { // handle decoding underflow, multi-byte unicode character at buffer chunk boundary if (!wasUnderflow) { throw new IllegalStateException("Unexpected state. Buffer has remaining bytes without underflow in decoding."); } if (!hasRemaining(nextBuf) && prepareRead() != -1) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 12 08:51:14 UTC 2024 - 16.6K bytes - Viewed (0)