- Sort Score
- Result 10 results
- Languages All
Results 21 - 28 of 28 for proximate (0.14 sec)
-
src/math/exp.go
// the interval [0,0.34658]: // Write // R(r**2) = r*(exp(r)+1)/(exp(r)-1) = 2 + r*r/6 - r**4/360 + ... // We use a special Remez algorithm on [0,0.34658] to generate // a polynomial of degree 5 to approximate R. The maximum error // of this polynomial approximation is bounded by 2**-59. In // other words, // R(z) ~ 2.0 + P1*z + P2*z**2 + P3*z**3 + P4*z**4 + P5*z**5
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 5.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/proxy/websocket.go
// ingest these resize events. return } } } // createChannels returns the standard channel types for a shell connection (STDIN 0, STDOUT 1, STDERR 2) // along with the approximate duplex value. It also creates the error (3) and resize (4) channels. func createChannels(opts Options) []wsstream.ChannelType { // open the requested channels, and always open the error channel
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Mar 26 16:28:45 UTC 2024 - 6.2K bytes - Viewed (0) -
pilot/pkg/xds/xdsgen.go
util.ByteCount(ResourceSize(res)), info, debug) } return nil } func ResourceSize(r model.Resources) int { // Approximate size by looking at the Any marshaled size. This avoids high cost // proto.Size, at the expense of slightly under counting. size := 0 for _, r := range r { size += len(r.Resource.Value) } return size
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon May 13 20:55:20 UTC 2024 - 6.3K bytes - Viewed (0) -
src/math/log1p.go
// = 2s + 2/3 s**3 + 2/5 s**5 + ....., // = 2s + s*R // We use a special Reme algorithm on [0,0.1716] to generate // a polynomial of degree 14 to approximate R The maximum error // of this polynomial approximation is bounded by 2**-58.45. In // other words, // 2 4 6 8 10 12 14
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 6.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/inspector/inspector.go
} stack = stack[:len(stack)-1] } i++ } } // traverse builds the table of events representing a traversal. func traverse(files []*ast.File) []event { // Preallocate approximate number of events // based on source file extent. // This makes traverse faster by 4x (!). var extent int for _, f := range files { extent += int(f.End() - f.Pos()) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 6.6K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/positions.go
if n.Lhs != nil { m = n.Lhs continue } m = n.X // case *CaseClause: // case *CommClause: default: return n.Pos() } } } // EndPos returns the approximate end position of n in the source. // For some nodes (*Name, *BasicLit) it returns the position immediately // following the node; for others (*BlockStmt, *SwitchStmt, etc.) it
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 17:49:19 UTC 2024 - 6.5K bytes - Viewed (0) -
src/math/expm1.go
// = 1 - r**2/60 + r**4/2520 - r**6/100800 + ... // We use a special Reme algorithm on [0,0.347] to generate // a polynomial of degree 5 in r*r to approximate R1. The // maximum error of this polynomial approximation is bounded // by 2**-61. In other words, // R1(z) ~ 1.0 + Q1*z + Q2*z**2 + Q3*z**3 + Q4*z**4 + Q5*z**5
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 7.9K bytes - Viewed (0) -
src/runtime/mksizeclasses.go
// can compute n / d as ⌊n * c / 2^F⌋, where c is ⌈2^F / d⌉ and F is // computed with: // // Algorithm 2: Algorithm to select the number of fractional bits // and the scaled approximate reciprocal in the case of unsigned // integers. // // if d is a power of two then // Let F ← log₂(d) and c = 1. // else // Let F ← N + L where L is the smallest integer
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:31:27 UTC 2024 - 9.6K bytes - Viewed (0)