- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 191 for smallish (0.26 sec)
-
build-logic/performance-testing/src/main/groovy/gradlebuild/performance/generator/DependencyGenerator.groovy
* In order to generate realistic project dependencies, we split the projects to layers and generate * dependencies to projects in lower layers. The sizes of different layers are created so that * the first and last layers are the smallest and the layers in the middle are the largest. * * For example when numberOfProjects = 150, 10 layers will be created with sizes of * [1, 2, 6, 16, 50, 50, 16, 6, 2, 1] *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 5.2K bytes - Viewed (0) -
staging/src/k8s.io/api/scheduling/v1beta1/types.go
// Only one PriorityClass can be marked as `globalDefault`. However, if more than // one PriorityClasses exists with their `globalDefault` field set to true, // the smallest value of such global default PriorityClasses will be used as the default priority. // +optional GlobalDefault bool `json:"globalDefault,omitempty" protobuf:"bytes,3,opt,name=globalDefault"`
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Nov 13 13:16:35 UTC 2022 - 3.5K bytes - Viewed (0) -
src/math/big/float.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/cel/common/schemas.go
// `type(intOrStringField) == int ? intOrStringField < 5 : double(intOrStringField.replace('%', '')) < 0.5 // dyn := apiservercel.NewSimpleTypeWithMinSize("dyn", cel.DynType, nil, 1) // smallest value for a serialized x-kubernetes-int-or-string is 0 // handle x-kubernetes-int-or-string by returning the max length/min serialized size of the largest possible string dyn.MaxElements = maxRequestSizeBytes - 2 return dyn
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 09 18:00:45 UTC 2023 - 10.5K bytes - Viewed (0) -
src/internal/diff/diff.go
// the smallest number of lines inserted and removed, // which can in the worst case take time quadratic in the // number of lines in the texts. As a result, many implementations // either can be made to run for a long time or cut off the search // after a predetermined amount of work. // // In contrast, this implementation looks for a diff with the // smallest number of “unique” lines inserted and removed,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 14:13:04 UTC 2023 - 7.5K bytes - Viewed (0) -
src/crypto/internal/nistec/p224_sqrt.go
// // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([96]fiat.P224Element) for i := range p224GG { if i == 0 { p224GG[i].SetBytes([]byte{0x6a, 0x0f, 0xec, 0x67,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 3.1K bytes - Viewed (1) -
src/image/geom_test.go
} if in(b, r) == nil && in(b, s) == nil { t.Errorf("Intersect: r=%s, s=%s, a=%s, b=%s, i=%d: intersection could be larger", r, s, a, b, i) } } } } // The union should be the smallest rectangle a such that every point in r // is in a and every point in s is in a. for _, r := range rects { for _, s := range rects { a := r.Union(s) if err := in(r, a); 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) -
platforms/ide/ide/src/main/java/org/gradle/plugins/ide/internal/tooling/BuildInvocationsBuilder.java
// this way, for each task selector, its description will be the one from the selected task with the 'smallest' path if (!taskSelectors.containsKey(task.getName())) { LaunchableGradleTaskSelector taskSelector = new LaunchableGradleTaskSelector()
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 6.1K bytes - Viewed (0) -
src/runtime/mksizeclasses.go
// and the scaled approximate reciprocal in the case of unsigned // integers. // // if d is a power of two then // Let F ← log₂(d) and c = 1. // else // Let F ← N + L where L is the smallest integer // such that d ≤ (2^(N+L) mod d) + 2^L. // end if // // [1] "Faster Remainder by Direct Computation: Applications to // Compilers and Software Libraries" Daniel Lemire, Owen Kaser,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:31:27 UTC 2024 - 9.6K bytes - Viewed (0) -
src/unicode/letter.go
// SimpleFold iterates over Unicode code points equivalent under // the Unicode-defined simple case folding. Among the code points // equivalent to rune (including rune itself), SimpleFold returns the // smallest rune > r if one exists, or else the smallest rune >= 0. // If r is not a valid Unicode code point, SimpleFold(r) returns r. // // For example: // // SimpleFold('A') = 'a' // SimpleFold('a') = 'A' // // SimpleFold('K') = 'k'
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0)