- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 150 for conservative (0.5 sec)
-
src/runtime/runtime-gdb_unix_test.go
var lim syscall.Rlimit err := syscall.Getrlimit(syscall.RLIMIT_CORE, &lim) if err != nil { t.Fatalf("error getting rlimit: %v", err) } // Minimum RLIMIT_CORE max to allow. This is a conservative estimate. // Most systems allow infinity. const minRlimitCore = 100 << 20 // 100 MB if lim.Max < minRlimitCore { t.Skipf("RLIMIT_CORE max too low: %#+v", lim) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 17 19:05:30 UTC 2024 - 9.4K bytes - Viewed (0) -
src/cmd/go/internal/work/security.go
// as meaning "read more flags from the file foo", so we must // guard against any command-line argument beginning with @, // even things like "-I @foo". // We use load.SafeArg (which is even more conservative) // to reject these. // // Even worse, gcc -I@foo (one arg) turns into cc1 -I @foo (two args), // so although gcc doesn't expand the @foo, cc1 will. // So out of paranoia, we reject @ at the beginning of every
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:47:34 UTC 2024 - 10K bytes - Viewed (0) -
docs/en/data/github_sponsors.yml
url: https://github.com/hgalytoby - login: conservative-dude avatarUrl: https://avatars.githubusercontent.com/u/55538308?u=f250c44942ea6e73a6bd90739b381c470c192c11&v=4 url: https://github.com/conservative-dude - login: Joaopcamposs avatarUrl: https://avatars.githubusercontent.com/u/57376574?u=699d5ba5ee66af1d089df6b5e532b97169e73650&v=4
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Mon Jun 03 01:09:53 UTC 2024 - 27K bytes - Viewed (0) -
src/internal/abi/type.go
TraceArgsMaxDepth = 5 // no more than 5 layers of nesting // maxLen is a (conservative) upper bound of the byte stream length. For // each arg/component, it has no more than 2 bytes of data (size, offset), // and no more than one {, }, ... at each level (it cannot have both the // data and ... unless it is the last one, just be conservative). Plus 1 // for _endSeq. TraceArgsMaxLen = (TraceArgsMaxDepth*3+2)*TraceArgsLimit + 1 )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 17 21:09:59 UTC 2024 - 21.8K bytes - Viewed (0) -
cmd/metacache-walk.go
} // Process in sort order. sort.Strings(entries) dirStack := make([]string, 0, 5) prefix = "" // Remove prefix after first level as we have already filtered the list. if len(forward) > 0 { // Conservative forwarding. Entries may be either objects or prefixes. for i, entry := range entries { if entry >= forward || strings.HasPrefix(forward, entry) { entries = entries[i:] break } } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat Jun 01 05:17:37 UTC 2024 - 12.4K bytes - Viewed (0) -
src/cmd/cgo/internal/testplugin/plugin_test.go
} // escape converts a string to something suitable for a shell command line. func escape(s string) string { s = strings.Replace(s, "\\", "\\\\", -1) s = strings.Replace(s, "'", "\\'", -1) // Conservative guess at characters that will force quoting if s == "" || strings.ContainsAny(s, "\\ ;#*&$~?!|[]()<>{}`") { s = "'" + s + "'" } return s }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:32:53 UTC 2024 - 12.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
new RegularImmutableMap<>((Entry<Object, Object>[]) ImmutableMap.EMPTY_ENTRY_ARRAY, null, 0); /** * Closed addressing tends to perform well even with high load factors. Being conservative here * ensures that the table is still likely to be relatively sparse (hence it misses fast) while * saving space. */ @VisibleForTesting static final double MAX_LOAD_FACTOR = 1.2; /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 16.2K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_tpu_device.cc
// The input must remain alive until the transfer completes, so we keep a // reference. We also wait until the transfer completes before calling // done(). // The latter may be too conservative, but given the host is involved in // waiting for the transfer to complete anyway there is probably little // downside. If we were to add the ability for computations to wait directly
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 22:53:47 UTC 2024 - 20.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/builtins.go
} } toFloat(x) toFloat(y) } else { check.convertUntyped(x, Typ[Float64]) check.convertUntyped(y, Typ[Float64]) // x and y should be invalid now, but be conservative // and check below } } if x.mode == invalid || y.mode == invalid { return } // both argument types must be identical if !Identical(x.typ, y.typ) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 27.1K bytes - Viewed (0) -
src/runtime/preempt.go
// 2. Synchronous safe-points occur when a running goroutine checks // for a preemption request. // // 3. Asynchronous safe-points occur at any instruction in user code // where the goroutine can be safely paused and a conservative // stack and register scan can find stack roots. The runtime can // stop a goroutine at an async safe-point using a signal. // // At both blocked and synchronous safe-points, a goroutine's CPU
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:41:45 UTC 2024 - 15.1K bytes - Viewed (0)