- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 279 for idioms (0.25 sec)
-
pkg/util/oom/oom_linux_test.go
} else if err != nil { return } // Check that OOM scores were applied to the right processes. if len(appliedPids) != len(pidOOMs) { t.Errorf("Applied OOM scores to incorrect number of processes - %+v vs %v", appliedPids, pidOOMs) return } for _, pid := range appliedPids { if !pidOOMs[pid] { t.Errorf("Failed to apply OOM scores to process %d", pid) } } } func TestOOMScoreAdjContainer(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Aug 24 19:47:49 UTC 2021 - 3.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/LazyLogger.java
LazyLogger(Class<?> ownerOfLogger) { this.loggerName = ownerOfLogger.getName(); } Logger get() { /* * We use double-checked locking. We could the try racy single-check idiom, but that would * depend on Logger not contain mutable state. * * We could use Suppliers.memoizingSupplier here, but I micro-optimized to this implementation
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Dec 13 19:45:20 UTC 2023 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/LazyLogger.java
LazyLogger(Class<?> ownerOfLogger) { this.loggerName = ownerOfLogger.getName(); } Logger get() { /* * We use double-checked locking. We could the try racy single-check idiom, but that would * depend on Logger not contain mutable state. * * We could use Suppliers.memoizingSupplier here, but I micro-optimized to this implementation
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Dec 13 19:45:20 UTC 2023 - 1.9K bytes - Viewed (0) -
src/sync/atomic/example_test.go
// Handle request r using config c. _, _ = r, c } }() } } // The following example shows how to maintain a scalable frequently read, // but infrequently updated data structure using copy-on-write idiom. func ExampleValue_readMostly() { type Map map[string]string var m atomic.Value m.Store(make(Map)) var mu sync.Mutex // used only by writers
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 18 23:58:54 UTC 2018 - 2.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Dec 03 17:08:51 UTC 2022 - 7.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/SingletonImmutableBiMap.java
@Override public ImmutableBiMap<V, K> inverse() { if (inverse != null) { return inverse; } else { // racy single-check idiom ImmutableBiMap<V, K> result = lazyInverse; if (result == null) { return lazyInverse = new SingletonImmutableBiMap<>(singleValue, singleKey, this); } else { return result; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 3.5K bytes - Viewed (0) -
tensorflow/c/eager/c_api_test_util.cc
constexpr int64_t dims[] = {100, 100}; constexpr int num_elements = dims[0] * dims[1]; float data[num_elements]; for (int i = 0; i < num_elements; ++i) { data[i] = 1.0f; } TF_Status* status = TF_NewStatus(); TF_Tensor* t = TFE_AllocateHostTensor(ctx, TF_FLOAT, &dims[0], sizeof(dims) / sizeof(int64_t), status);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 22:37:46 UTC 2024 - 23.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/tests/passes/fold_constant_transpose.mlir
%1 = stablehlo.transpose %0, dims = [1, 0] : (tensor<2x3xi32>) -> tensor<3x2xi32> return %1 : tensor<3x2xi32> } // CHECK: transpose // ----- // Tests that transposing an argument cannot be folded. // CHECK-LABEL: transpose_arg func.func @transpose_arg(%arg0: tensor<2x3xf32>) -> tensor<3x2xf32> { %0 = stablehlo.transpose %arg0, dims = [1, 0] : (tensor<2x3xf32>) -> tensor<3x2xf32>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 08:06:02 UTC 2024 - 2.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom_test.go
c := testConfig(t) fun := c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Exit("mem"))) doms := map[string]string{} CheckFunc(fun.f) verifyDominators(t, fun, dominators, doms) verifyDominators(t, fun, dominatorsSimple, doms) } func TestDominatorsSimple(t *testing.T) { c := testConfig(t) fun := c.Fun("entry", Bloc("entry",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 13.3K bytes - Viewed (0) -
test/codegen/maps.go
// amd64:-`.*runtime\.slicebytetostring\(` return m[[2]string{0: string(bytes)}] } // ------------------- // // Map Clear // // ------------------- // // Optimization of map clear idiom (Issue #20138). func MapClearReflexive(m map[int]int) { // amd64:`.*runtime\.mapclear` // amd64:-`.*runtime\.mapiterinit` for k := range m { delete(m, k) } } func MapClearIndirect(m map[int]int) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 23 15:51:32 UTC 2023 - 3.6K bytes - Viewed (0)