- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 230 for BarTest (0.12 sec)
-
staging/src/k8s.io/api/storage/v1alpha1/types_swagger_doc_generated.go
"maximumVolumeSize": "maximumVolumeSize is the value reported by the CSI driver in its GetCapacityResponse for a GetCapacityRequest with topology and parameters that match the previous fields.\n\nThis 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 API is ResourceRequirements.Requests in a volume...
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 03:26:35 UTC 2023 - 10.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
* range [0, k) and ignore the remaining elements. */ private final @Nullable T[] buffer; private int bufferSize; /** * The largest of the lowest k elements we've seen so far relative to this comparator. If * bufferSize ≥ k, then we can ignore any elements greater than this value. */ @CheckForNull private T threshold;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/unix/README.md
is fed though mkpost.go to format the code correctly and remove any hidden or private identifiers. This cleaned-up code is written to `ztypes_${GOOS}_${GOARCH}.go`. The hardest part about preparing this file is figuring out which headers to include and which symbols need to be `#define`d to get the actual data structures that pass through to the kernel system calls. Some C libraries
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 06 14:32:58 UTC 2021 - 8.5K bytes - Viewed (0) -
src/compress/flate/huffman_code.go
if h.freqcache == nil { // Allocate a reusable buffer with the longest possible frequency table. // Possible lengths are codegenCodeCount, offsetCodeCount and maxNumLit. // The largest of these is maxNumLit, so we allocate for that case. h.freqcache = make([]literalNode, maxNumLit+1) } list := h.freqcache[:len(freq)+1] // Number of non-zero literals count := 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 9.7K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1alpha1/generated.proto
// 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: Thu Mar 28 15:34:11 UTC 2024 - 11.3K bytes - Viewed (0) -
src/cmd/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: Wed Jan 24 13:01:26 UTC 2024 - 21.7K bytes - Viewed (0) -
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)