- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 104 for chancap (0.33 sec)
-
src/crypto/tls/handshake_server_tls13.go
// support. See RFC 7507, which however does not specify the interaction // with supported_versions. The only difference is that with // supported_versions a client has a chance to attempt a [TLS 1.2, TLS 1.4] // handshake in case TLS 1.3 is broken but 1.2 is not. Alas, in that case, // it will have to drop the TLS_FALLBACK_SCSV protection if it falls back to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 17:23:54 UTC 2024 - 30.5K bytes - Viewed (0) -
src/runtime/cgocall.go
mp := acquirem() sched := &mp.g0.sched sched.sp = *(*uintptr)(unsafe.Pointer(sched.sp + alignUp(sys.MinFrameSize, sys.StackAlign))) // Do the accounting that cgocall will not have a chance to do // during an unwind. // // In the case where a Go call originates from C, ncgo is 0 // and there is no matching cgocall to end. if mp.ncgo > 0 { mp.incgo = false mp.ncgo--
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:47 UTC 2024 - 24.2K bytes - Viewed (0) -
src/runtime/mgc.go
// Careful: another GC cycle may start now. releasem(mp) mp = nil // now that gc is done, kick off finalizer thread if needed if !concurrentSweep { // give the queued finalizers, if any, a chance to run Gosched() } } // gcBgMarkStartWorkers prepares background mark worker goroutines. These // goroutines will not run until the mark phase, but they must be started while
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/cmd/go/internal/work/buildid.go
// The second half of the build ID here is a placeholder for the content hash. // It's important that the overall buildID be unlikely verging on impossible // to appear in the output by chance, but that should be taken care of by // the actionID half; if it also appeared in the input that would be like an // engineered 120-bit partial SHA256 collision. a.actionID = actionHash
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:31:25 UTC 2024 - 26.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* This is useful if the given service uses daemon threads, and we want to keep the JVM from * exiting immediately on shutdown, instead giving these daemon threads a chance to terminate * normally. * * @param service ExecutorService which uses daemon threads * @param terminationTimeout how long to wait for the executor to finish before terminating the * JVM
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 15 10:40:05 UTC 2024 - 39K bytes - Viewed (0) -
src/runtime/malloc.go
// ~258MB, so this isn't too bad. (We could reserve a // smaller amount of space up front if this is a // problem.) // // 2. We hint the heap to start right above the end of // the binary so we have the best chance of keeping it // contiguous. // // 3. We try to stake out a reasonably large initial // heap reservation. const arenaMetaSize = (1 << arenaBits) * unsafe.Sizeof(heapArena{})
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/replace_cast_hacks_with_tf_xla_ops.cc
// reshapes in many cases. More precisely, this function creates 1s matrix // with appropriate shape to match with the shape of XlaDotV2 result. // We didn't apply XlaEinsum or XlaDotV2 for this work, since it would loose // the chance for constant folding later. We could try to add some // postprocessing passes later to further optimize the graph after constant // folding. Value CreateZeroPointPartialOffsetXlaDotV2(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 47.1K bytes - Viewed (0) -
src/runtime/map_test.go
for i := 0; i < 1000; i++ { m[i] = true } for i := 20; i < 1000; i++ { delete(m, i) } var first []int for i := range m { first = append(first, i) } // 800 chances to get a different iteration order. // See bug 8736 for why we need so many tries. for n := 0; n < 800; n++ { idx := 0 for i := range m { if i != first[idx] { // iteration order changed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 33.5K bytes - Viewed (0) -
src/runtime/os_windows.go
s = _SIGTERM default: return 0 } if sigsend(s) { if s == _SIGTERM { // Windows terminates the process after this handler returns. // Block indefinitely to give signal handlers a chance to clean up, // but make sure to be properly parked first, so the rest of the // program can continue executing. block() } return 1 } return 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 22:55:25 UTC 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* .onResultOf(getBarFunction) * .nullsLast(); * }</pre> * * Note that each chaining method returns a new ordering instance which is backed by the previous * instance, but has the chance to act on values <i>before</i> handing off to that backing instance. * As a result, it usually helps to read chained ordering expressions <i>backwards</i>. For example, * when {@code compare} is called on the above ordering: *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 39.4K bytes - Viewed (0)