- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 230 for BarTest (0.47 sec)
-
src/runtime/mgcsweep.go
// sweepone, which looks at all the mcentral lists. // // * The span reclaimer looks for spans that contain no marked objects // and frees whole spans. This is a separate algorithm because // freeing whole spans is the hardest task for the object reclaimer, // but is critical when allocating new spans. The entry point for // this is mheap_.reclaim and it's driven by a sequential scan of // the page marks bitmap in the heap arenas. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
return a.sortAvailableCPUs() } // Sorts the provided list of NUMA nodes/sockets/cores/cpus referenced in 'ids' // by the number of available CPUs contained within them (smallest to largest). // The 'getCPU()' parameter defines the function that should be called to // retrieve the list of available CPUs for the type being referenced. If two // NUMA nodes/sockets/cores/cpus have the same number of available CPUs, they
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/css/manual.css
justify-content: space-between; max-width: 75rem; margin-left: auto; margin-right: auto; font-size: 0.875rem; padding: 0.5rem 0.75rem; } /* * 1. Value is the largest computed width among 'site-footer__copy' and 'site-footer__links'. */ .site-footer__copy, .site-footer__secondary-links { flex-grow: 0; flex-basis: 280px; /* 1. */ } /*
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat May 25 05:15:02 UTC 2024 - 72.6K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/optimizing-performance/performance.adoc
=== Optimize repository order When Gradle resolves dependencies, it searches through each repository in the declared order. To reduce the time spent searching for dependencies, declare the repository hosting the largest number of your dependencies first. This minimizes the number of network requests required to resolve all dependencies. === Minimize repository count
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Feb 23 03:39:56 UTC 2024 - 33.4K bytes - Viewed (0) -
src/runtime/mpagealloc.go
// into memory as needed. The leaf summaries of the tree correspond to a bitmap chunk. // // The root level (referred to as L0 and index 0 in pageAlloc.summary) has each // summary represent the largest section of address space (16 GiB on 64-bit systems), // with each subsequent level representing successively smaller subsections until we // reach the finest granularity at the leaves, a chunk. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
src/math/big/nat.go
addVW(z[j:], z[j:], c) } } } } // karatsubaLen computes an approximation to the maximum k <= n such that // k = p<<i for a number p <= threshold and an i >= 0. Thus, the // result is the largest number that can be divided repeatedly by 2 before // becoming about the value of threshold. func karatsubaLen(n, threshold int) int { i := uint(0) for n > threshold { n >>= 1 i++ } return n << i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/apf_controller.go
// Changes to either Spec or Status are relevant. The // concern is that we might, in some future release, want // different behavior than is implemented now. One of the // hardest questions is how does an operator roll out the // new release in a cluster with multiple kube-apiservers // --- in a way that works no matter what servers crash // and restart when. If this handler reacts only to
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 48.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/ir/tfl_ops.td
} def TFL_ArgMaxOp : TFL_Op<"arg_max", [ QuantizableResult, Pure]> { let summary = "ArgMax operator"; let description = [{ Returns the index with the largest value across dimensions of a tensor. }]; let arguments = ( ins TFL_TensorOf<[I1, F32, I32, I8, UI8, QI8, QUI8]>:$input, TFL_I32OrI64Tensor:$dim ); let results = (outs
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 19:09:08 UTC 2024 - 186K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/optimize_patterns.td
"$0.cast<DenseElementsAttr>().getNumElements() == 1 && " "std::abs(*$0.cast<DenseElementsAttr>().getValues<float>().begin()) < " # n>>; // Constraint that the attribute value is negative infinity or negative largest. // We use both -inf & flt_min due to the forward compatibility. def ConstAPFloatNegLargestOrNegInfinity : Constraint<CPred< "$0.isa<DenseElementsAttr>() && " "$0.cast<DenseElementsAttr>().getNumElements() == 1 && "
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 16 20:31:41 UTC 2024 - 66.4K bytes - Viewed (0) -
src/math/big/int.go
z.neg = false return z } // ^x == -x-1 == -(x+1) z.abs = z.abs.add(x.abs, natOne) z.neg = true // z cannot be zero if x is positive return z } // Sqrt sets z to ⌊√x⌋, the largest integer such that z² ≤ x, and returns z. // It panics if x is negative. func (z *Int) Sqrt(x *Int) *Int { if x.neg { panic("square root of negative number") } z.neg = false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0)