- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for exercise (0.14 sec)
-
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/queueset_test.go
evalExecutingMetrics: true, clk: clk, counter: counter, seatDemandIntegratorSubject: seatDemandIntegratorSubject, }.exercise(t) } // TestWindup exercises a scenario with the windup problem. // That is, a flow that can not use all the seats that it is allocated // for a while. During that time, the queues that serve that flow
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Sep 26 12:55:23 UTC 2023 - 58.4K bytes - Viewed (0) -
tensorflow/c/kernels_test.cc
s->created = true; s->compute_called = false; // Exercise attribute reads. TF_DataType type; TF_Status* status = TF_NewStatus(); TF_OpKernelConstruction_GetAttrType(ctx, "SomeDataTypeAttr", &type, status); EXPECT_EQ(TF_OK, TF_GetCode(status)); EXPECT_EQ(TF_FLOAT, type); TF_DeleteStatus(status); // Exercise kernel NodeDef name read
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 50.4K bytes - Viewed (0) -
plugin/pkg/admission/limitranger/admission_test.go
value.ResourceVersion = fmt.Sprintf("%d", index) value.Namespace = action.GetNamespace() limitRangeList.Items = append(limitRangeList.Items, value) } // make the handler slow so concurrent calls exercise the singleflight time.Sleep(time.Second) return true, limitRangeList, nil }) handler, _, err := newHandlerForTest(mockClient) if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Mar 06 00:00:21 UTC 2024 - 51.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
import java.util.concurrent.RejectedExecutionException; import java.util.concurrent.atomic.AtomicReference; import junit.framework.TestCase; import org.mockito.Mockito; /** * Tests for {@link ClosingFuture}. Subclasses exercise either the {@link * ClosingFuture#finishToFuture()} or {@link * ClosingFuture#finishToValueAndCloser(ValueAndCloserConsumer, Executor)} paths to complete a * {@link ClosingFuture} pipeline. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 07 12:37:15 UTC 2024 - 75.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
import java.util.concurrent.RejectedExecutionException; import java.util.concurrent.atomic.AtomicReference; import junit.framework.TestCase; import org.mockito.Mockito; /** * Tests for {@link ClosingFuture}. Subclasses exercise either the {@link * ClosingFuture#finishToFuture()} or {@link * ClosingFuture#finishToValueAndCloser(ValueAndCloserConsumer, Executor)} paths to complete a * {@link ClosingFuture} pipeline. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 07 12:37:15 UTC 2024 - 75.3K bytes - Viewed (0) -
src/math/big/int_test.go
t.Errorf("#%d got (%s, %s) want (%s, %s)", i, q, r, expectedQ, expectedR) } } } func TestQuoStepD6(t *testing.T) { // See Knuth, Volume 2, section 4.3.1, exercise 21. This code exercises // a code path which only triggers 1 in 10^{-19} cases. u := &Int{false, nat{0, 0, 1 + 1<<(_W-1), _M ^ (1 << (_W - 1))}} v := &Int{false, nat{5, 2 + 1<<(_W-1), 1 << (_W - 1)}} r := new(Int)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K bytes - Viewed (0) -
src/runtime/mprof.go
prof.cyclesLost += cycles return } else { prof.cyclesLost += prev } } // Saving the *mutex as a uintptr is safe because: // - lockrank_on.go does this too, which gives it regular exercise // - the lock would only move if it's stack allocated, which means it // cannot experience multi-M contention prof.pending = uintptr(unsafe.Pointer(l)) prof.cycles = cycles }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 53.3K bytes - Viewed (0) -
gradle/verification-metadata.xml
You should then edit the origin to be "Verified". Note that editing those entries means you verified that the checksum matches. If the generation above did not resolve your issue, a task might be missing that exercise the dependency but is not covered by the current resolveAllDependencies. Edit the task definition to add the required task dependency.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 21 22:30:36 UTC 2024 - 90.1K bytes - Viewed (0) -
src/runtime/mgc.go
// // The algorithm's intellectual heritage includes Dijkstra's on-the-fly algorithm, see // Edsger W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. 1978. // On-the-fly garbage collection: an exercise in cooperation. Commun. ACM 21, 11 (November 1978), // 966-975. // For journal quality proofs that these steps are complete, correct, and terminate see
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/runtime/mbitmap.go
} // Write out the header. *header = gctyp scanSize = span.elemsize } if doubleCheck { doubleCheckHeapPointers(x, dataSize, gctyp, header, span) // To exercise the less common path more often, generate // a random interior pointer and make sure iterating from // that point works correctly too. maxIterBytes := span.elemsize if header == nil { maxIterBytes = dataSize
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0)