- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 230 for BarTest (0.12 sec)
-
src/image/geom_test.go
got := r.Eq(s) want := in(r, s) == nil && in(s, r) == nil if got != want { t.Errorf("Eq: r=%s, s=%s: got %t, want %t", r, s, got, want) } } } // The intersection should be the largest rectangle a such that every point // in a is both in r and in s. for _, r := range rects { for _, s := range rects { a := r.Intersect(s) if err := in(a, r); err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 05:05:59 UTC 2017 - 3K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/admission/plugin/policy/validating/metrics/metrics.go
// the lowest bucket was based around the 180ns/op figure for BenchmarkAccess, // plus some additional leeway to account for the apiserver doing other things // the largest bucket was chosen based on the fact that benchmarks indicate the // same Xeon running a CEL expression close to the estimated cost limit takes // around 760ms, so that bucket should only ever have the slowest CEL expressions
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Feb 12 18:58:24 UTC 2024 - 5.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding.go
// For example, for deckSize=128 and handSize=4 this function might call pick(14); pick(73); pick(119); pick(26). func (d *Dealer) Deal(hashValue uint64, pick func(int)) { // 15 is the largest possible value of handSize var remainders [15]int for i := 0; i < d.handSize; i++ { hashValueNext := hashValue / uint64(d.deckSize-i) remainders[i] = int(hashValue - uint64(d.deckSize-i)*hashValueNext)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Oct 23 08:38:03 UTC 2019 - 4K bytes - Viewed (0) -
src/runtime/defs_freebsd.go
#include <sys/cpuset.h> #include <sys/param.h> #include <sys/vdso.h> */ import "C" // Local consts. const ( _NBBY = C.NBBY // Number of bits in a byte. _CTL_MAXNAME = C.CTL_MAXNAME // Largest number of components supported. _CPU_LEVEL_WHICH = C.CPU_LEVEL_WHICH // Actual mask/id for which. _CPU_WHICH_PID = C.CPU_WHICH_PID // Specifies a process id. ) const ( EINTR = C.EINTR EFAULT = C.EFAULT
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 12 21:17:22 UTC 2024 - 4.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/plan9/mkall.sh
# # * types_${GOOS}.c # # This hand-written C file includes standard C headers and then # creates typedef or enum names beginning with a dollar sign # (use of $ in variable names is a gcc extension). The hardest # part about preparing this file is figuring out which headers to # include and which symbols need to be #defined to get the # actual data structures that pass through to the kernel system calls.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 15 19:02:39 UTC 2021 - 4.4K bytes - Viewed (0) -
src/math/pow.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package math func isOddInt(x float64) bool { if Abs(x) >= (1 << 53) { // 1 << 53 is the largest exact integer in the float64 format. // Any number outside this range will be truncated before the decimal point and therefore will always be // an even integer.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 24 19:10:58 UTC 2023 - 3.6K bytes - Viewed (0) -
docs/erasure/README.md
divides the drives you provide into erasure-coding sets of *2 to 16* drives. Therefore, the number of drives you present must be a multiple of one of these numbers. Each object is written to a single erasure-coding set. Minio uses the largest possible EC set size which divides into the number of drives given. For example, *18 drives* are configured as *2 sets of 9 drives*, and *24 drives* are configured as *2 sets of 12 drives*. This is true for scenarios when running MinIO as a standalone...
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/errors.go
var tooLargeResourceVersionCauseMsg = "Too large resource version" // NewTooLargeResourceVersionError returns a timeout error with the given retrySeconds for a request for // a minimum resource version that is larger than the largest currently available resource version for a requested resource. func NewTooLargeResourceVersionError(minimumResourceVersion, currentRevision uint64, retrySeconds int) error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 08 15:39:10 UTC 2023 - 5.9K bytes - Viewed (0) -
src/html/template/transition.go
k = i + 1 } } // tError is the context transition function for the error state. func tError(c context, s []byte) (context, int) { return c, len(s) } // eatAttrName returns the largest j such that s[i:j] is an attribute name. // It returns an error if s[i:] does not look like it begins with an // attribute name, such as encountering a quote mark without a preceding // equals sign.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 19:54:31 UTC 2024 - 18.2K bytes - Viewed (0) -
src/go/types/gcsizes.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 - 4.4K bytes - Viewed (0)