- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 3,861 for Largest (0.15 sec)
-
src/cmd/compile/internal/ssa/fuse.go
} } // move all of bx's values to c (note containing loop excludes c) for _, v := range bx.Values { v.Block = c } } // Compute the total number of values and find the largest value slice in the run, to maximize chance of storage reuse. total := 0 totalBeforeMax := 0 // number of elements preceding the maximum block (i.e. its position in the result). max_b := b // block with maximum capacity
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 9K bytes - Viewed (0) -
src/go/types/sizes.go
// // This logic is equivalent to the logic in // cmd/compile/internal/types/size.go:calcStructOffset return 8 } // spec: "For a variable x of struct type: unsafe.Alignof(x) // is the largest of the values unsafe.Alignof(x.f) for each // field f of x, but at least 1." max := int64(1) for _, f := range t.fields { if a := s.Alignof(f.typ); a > max { max = a } } return max
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 8.9K bytes - Viewed (0) -
src/net/addrselect.go
Precedence: 40, Label: 1, }, } // Classify returns the policyTableEntry of the entry with the longest // matching prefix that contains ip. // The table t must be sorted from largest mask size to smallest. func (t policyTable) Classify(ip netip.Addr) policyTableEntry { // Prefix.Contains() will not match an IPv6 prefix for an IPv4 address. if ip.Is4() { ip = netip.AddrFrom16(ip.As16()) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 00:24:06 UTC 2024 - 9.7K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe_generic.go
// by 51, and add it to the limb above it. The top carry is multiplied by 19 // according to the reduction identity and added to the lowest limb. // // The largest coefficient (r0) will be at most 111 bits, which guarantees // that all carries are at most 111 - 51 = 60 bits, which fits in a uint64. // // r0 = a0×b0 + 19×(a1×b4 + a2×b3 + a3×b2 + a4×b1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 27 01:16:19 UTC 2023 - 8.5K bytes - Viewed (0) -
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) -
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/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) -
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)