- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 75 for VarLive (0.13 sec)
-
pkg/scheduler/framework/plugins/podtopologyspread/plugin.go
// NodeAdd QueueingHint isn't always called because of the internal feature called preCheck. // As a common problematic scenario, // when a node is added but not ready, NodeAdd event is filtered out by preCheck and doesn't arrive. // In such cases, this plugin may miss some events that actually make pods schedulable. // As a workaround, we add UpdateNodeTaint event to catch the case.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Mar 16 14:13:06 UTC 2024 - 12.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cse.go
for { changed := false // partition can grow in the loop. By not using a range loop here, // we process new additions as they arrive, avoiding O(n^2) behavior. for i := 0; i < len(partition); i++ { e := partition[i] if opcodeTable[e[0].Op].commutative { // Order the first two args before comparison. for _, v := range e {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 9.6K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/volumebinding/volume_binding.go
// NodeAdd QueueingHint isn't always called because of the internal feature called preCheck. // As a common problematic scenario, // when a node is added but not ready, NodeAdd event is filtered out by preCheck and doesn't arrive. // In such cases, this plugin may miss some events that actually make pods schedulable. // As a workaround, we add UpdateNodeTaint event to catch the case.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Mar 16 14:13:06 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/compile/internal/walk/compare.go
// eq algs take pointers; cmpl and cmpr must be addressable if !ir.IsAddressable(cmpl) || !ir.IsAddressable(cmpr) { base.Fatalf("arguments of comparison must be lvalues - %v %v", cmpl, cmpr) } // Should only arrive here with large memory or // a struct/array containing a non-memory field/element. // Small memory is handled inline, and single non-memory // is handled by walkCompare. fn, needsLength := reflectdata.EqFor(t)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 21:55:14 UTC 2023 - 16.2K bytes - Viewed (0) -
src/runtime/syscall_windows.go
} func callbackasm() // callbackasmAddr returns address of runtime.callbackasm // function adjusted by i. // On x86 and amd64, runtime.callbackasm is a series of CALL instructions, // and we want callback to arrive at // correspondent call instruction instead of start of // runtime.callbackasm. // On ARM, runtime.callbackasm is a series of mov and branch instructions.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:12:46 UTC 2024 - 16.6K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_device.cc
} host_to_device_stream = host_to_device_stream_; device_to_device_streams = device_to_device_streams_; // The data transfer requests from device to host could arrive out of order, // so a single stream would cause deadlock. For this case, // xla_device_context would borrow a stream for each transfer request. device_to_host_stream = nullptr; } else {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon May 20 21:05:42 UTC 2024 - 24.3K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/internal/http2/Http2ConnectionTest.kt
assertThat(connection.isHealthy(System.nanoTime())).isTrue() // But if the ping doesn't arrive, the connection goes unhealthy. Thread.sleep(TimeUnit.NANOSECONDS.toMillis(Http2Connection.DEGRADED_PONG_TIMEOUT_NS.toLong())) assertThat(connection.isHealthy(System.nanoTime())).isFalse() // When a pong does arrive, the connection becomes healthy again. connection.writePingAndAwaitPong()
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sat Apr 20 17:03:43 UTC 2024 - 75.4K bytes - Viewed (0) -
src/math/big/natdiv.go
3-by-2 guess is off by at most 1, it can be convenient to perform the final u < q̂·v as part of the computation of the remainder r = u - q̂·v. If the subtraction underflows, decremeting q̂ and adding one v back to r is enough to arrive at the final q, r. That's the entirety of long division: scale the inputs, and then loop over each output position, guessing, checking, and correcting the next output digit.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
pilot/pkg/networking/core/tracing.go
var sampling float64 if useCustomSampler { // If the TracingProvider has a custom sampler (OTel Sampler) // the sampling percentage is set to 100% so all spans arrive at the sampler for its decision. sampling = 100 } else if spec.RandomSamplingPercentage != nil { sampling = *spec.RandomSamplingPercentage } else {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 16 17:05:28 UTC 2024 - 24.2K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/proxy/streamtunnel_test.go
actual, err = io.ReadAll(serverStream) require.NoError(t, err) defer serverStream.Close() //nolint:errcheck case <-time.After(wait.ForeverTestTimeout): t.Fatalf("timeout waiting for spdy stream to arrive on channel.") } assert.Equal(t, randomData, actual, "error validating tunneled random data") } func TestTunnelingResponseWriter_Hijack(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 02:21:50 UTC 2024 - 22.7K bytes - Viewed (0)