- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 71 for Approximates (0.35 sec)
-
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) -
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) -
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) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
} } // Optimization - use signed division if dividend < 2^63 if (dividend >= 0) { return dividend / divisor; } /* * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is * guaranteed to be either exact or one less than the correct value. This follows from fact that
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
src/runtime/metrics/doc.go
math.MaxInt64. This value is set by the GOMEMLIMIT environment variable, and the runtime/debug.SetMemoryLimit function. /gc/heap/allocs-by-size:bytes Distribution of heap allocations by approximate size. Bucket counts increase monotonically. Note that this does not include tiny objects as defined by /gc/heap/tiny/allocs:objects, only tiny blocks. /gc/heap/allocs:bytes
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:43 UTC 2024 - 20K 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) -
CREDITS
If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 15:34:20 UTC 2024 - 1.7M bytes - Viewed (0) -
src/cmd/gofmt/gofmt.go
// it from rlimit on platforms that support that system call. // // File descriptors opened from outside of this package are not tracked, // so this limit may be approximate. var fdSem = make(chan bool, 200) var ( rewrite func(*token.FileSet, *ast.File) *ast.File parserMode parser.Mode ) func usage() { fmt.Fprintf(os.Stderr, "usage: gofmt [flags] [path ...]\n")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 15.1K 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/internal/trace/traceviewer/mmu.go
// // Render plot progressively so rough outline is visible quickly even // for very complex MUTs. Start by computing just a few window sizes // and then add more window sizes. // // Consider using sampling to compute an approximate MUT. This would // work by sampling the mutator utilization at randomly selected // points in time in the trace to build an empirical distribution. We // could potentially put confidence intervals on these estimates and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 21:29:53 UTC 2023 - 13K bytes - Viewed (0)