- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 230 for BarTest (0.11 sec)
-
tensorflow/compiler/mlir/quantization/tensorflow/calibrator/calibration_algorithm.py
A "percentile" is a statistical concept that represents the value below which a given percentage of data falls in a dataset. It involves sorting the data from smallest to largest and then finding the value at a specified percentage position. For example, the 0.01 percentile represents the value in a given data set that corresponds to the lowest 0.01% of the data.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 11 19:29:56 UTC 2024 - 14.7K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/css/base.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 - 30.5K bytes - Viewed (0) -
pilot/pkg/status/distribution/reporter.go
r.mu.RLock() defer r.mu.RUnlock() return r.status[key] } // Register that a dataplane has acknowledged a new version of the config. // Theoretically, we could use the ads connections themselves to harvest this data, // but the mutex there is pretty hot, and it seems best to trade memory for time. func (r *Reporter) RegisterEvent(conID string, distributionType xds.EventType, nonce string) { if nonce == "" { return }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Jan 30 17:25:17 UTC 2024 - 11.5K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/optimizing-performance/build-cache/build_cache_performance.adoc
Gradle's build cache can be very useful in reducing CI infrastructure cost and feedback time, but it usually has the biggest impact when developers can reuse cached results in their local builds. This is also the hardest to quantify for a number of reasons: * developers run different builds * developers can have different hardware, or have different settings * developers run all kinds of other things on their machines that can slow them down
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 14 09:28:20 UTC 2024 - 9.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopbce.go
// This function returns true if the increment will never overflow/underflow. ok := func() bool { if step > 0 { if limit.isGenericIntConst() { // Figure out the actual largest value. v := limit.AuxInt if !inclusive { if v == minSignedValue(limit.Type) { return false // < minint is never satisfiable. } v-- }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 17:37:47 UTC 2023 - 11.8K bytes - Viewed (0) -
pkg/registry/core/service/ipallocator/cidrallocator.go
func (c *MetaAllocator) getAllocator(ip net.IP) (*Allocator, error) { c.muTree.Lock() defer c.muTree.Unlock() address := ipToAddr(ip) prefix := netip.PrefixFrom(address, address.BitLen()) // Use the largest subnet to allocate addresses because // all the other subnets will be contained. _, allocator, ok := c.tree.ShortestPrefixMatch(prefix) if !ok { klog.V(2).Infof("Could not get allocator for IP %s", ip.String())
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 13.2K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1alpha1/types.go
// for a GetCapacityRequest with topology and parameters that match the // previous fields. // // This is defined since CSI spec 1.4.0 as the largest size // that may be used in a // CreateVolumeRequest.capacity_range.required_bytes field to // create a volume with the same parameters as those in // GetCapacityRequest. The corresponding value in the Kubernetes
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Nov 27 20:06:32 UTC 2023 - 13.4K bytes - Viewed (0) -
src/sort/zsortinterface.go
first := a lo := 0 hi := b - a // Build heap with greatest element at top. for i := (hi - 1) / 2; i >= 0; i-- { siftDown(data, i, hi, first) } // Pop elements, largest first, into end of data. for i := hi - 1; i >= 0; i-- { data.Swap(first, first+i) siftDown(data, lo, i, first) } } // pdqsort sorts data[a:b].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.2K bytes - Viewed (0) -
pkg/kubelet/eviction/helpers.go
// prioritize evicting the pod which exceeds its requests return cmpBool(p1ExceedsRequests, p2ExceedsRequests) } } // memory compares pods by largest consumer of memory relative to request. func memory(stats statsFunc) cmpFunc { return func(p1, p2 *v1.Pod) int { p1Stats, p1Found := stats(p1) p2Stats, p2Found := stats(p2) if !p1Found || !p2Found {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 01 18:46:33 UTC 2023 - 53.6K bytes - Viewed (0) -
src/vendor/golang.org/x/text/transform/transform.go
type SpanningTransformer interface { Transformer // Span returns a position in src such that transforming src[:n] results in // identical output src[:n] for these bytes. It does not necessarily return // the largest such n. The atEOF argument tells whether src represents the // last bytes of the input. // // Callers should always account for the n bytes consumed before // considering the error err. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 21 22:10:00 UTC 2020 - 21.7K bytes - Viewed (0)