- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 131 for avoiding (0.12 sec)
-
pkg/api/v1/resource/helpers.go
} for key, value := range b { if _, found := result[key]; !found { result[key] = value.DeepCopy() } } return result } // reuseOrClearResourceList is a helper for avoiding excessive allocations of // resource lists within the inner loop of resource calculations. func reuseOrClearResourceList(reuse v1.ResourceList) v1.ResourceList { if reuse == nil { return make(v1.ResourceList, 4) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Oct 26 13:58:16 UTC 2023 - 16.3K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/reference/ci-systems/github-actions.adoc
directory in the built-in GitHub Actions cache. This will speed up your GitHub Actions build by avoiding the need to re-download Gradle versions and project dependencies, as well as re-using state from the previous workflow execution.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Apr 08 14:41:08 UTC 2024 - 11.3K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/dep-man/02-declaring-dependency-versions/dynamic_versions.adoc
==== [[sec:controlling_dependency_caching_command_line]] == Controlling dependency caching from the command line [[sec:offline-mode]] === Avoiding network access with offline mode
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Nov 29 17:38:38 UTC 2023 - 13.6K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
residual = true continue } // Add cum weight to all nodes in stack, avoiding double counting. if _, ok := seenNode[n]; !ok { seenNode[n] = true n.addSample(dw, w, labels, sample.NumLabel, sample.NumUnit, o.FormatTag, false) } // Update edge weights for all edges in stack, avoiding double counting. if _, ok := seenEdge[nodePair{n, parent}]; !ok && parent != nil && n != parent {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
src/embed/embed.go
n = count } list := make([]fs.DirEntry, n) for i := range list { list[i] = &d.files[d.offset+i] } d.offset += n return list, nil } // sortSearch is like sort.Search, avoiding an import. func sortSearch(n int, f func(int) bool) int { // Define f(-1) == false and f(n) == true. // Invariant: f(i-1) == false, f(j) == true. i, j := 0, n for i < j {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 19:42:51 UTC 2024 - 13.5K bytes - Viewed (0) -
cmd/kubeadm/app/cmd/phases/workflow/runner.go
runDataInitializer func(*cobra.Command, []string) (RunData, error) // runData is part of the internal state of the runner and it is used for implementing // a singleton in the InitData methods (thus avoiding to initialize data // more than one time) runData RunData // runCmd is part of the internal state of the runner and it is used to track the // command that will trigger the runner (only if the runner is BindToCommand).
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Sep 21 05:35:15 UTC 2022 - 16K bytes - Viewed (0) -
src/runtime/mbarrier.go
// result on most HW (including 386/amd64) can be r1==r2==0. This is a classic // example of what can happen when loads are allowed to be reordered with older // stores (avoiding such reorderings lies at the heart of the classic // Peterson/Dekker algorithms for mutual exclusion). Rather than require memory // barriers, which will slow down both the mutator and the GC, we always grey
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 15.7K bytes - Viewed (0) -
src/math/rand/v2/rand.go
// In terms of 32-bit halves, this is: // x1:x0 := r.Uint64() // 0:hi, lo1:lo0 := bits.Mul64(x1:x0, 0:n) // Writing out the multiplication in terms of bits.Mul32 allows // using direct hardware instructions and avoiding // the computations involving these zeros. x := r.Uint64() lo1a, lo0 := bits.Mul32(uint32(x), n) hi, lo1b := bits.Mul32(uint32(x>>32), n) lo1, c := bits.Add32(lo1a, lo1b, 0) hi += c
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:25:49 UTC 2024 - 12.8K bytes - Viewed (0) -
src/go/internal/gcimporter/ureader.go
r := pr.newReader(pkgbits.RelocMeta, pkgbits.PublicRootIdx, pkgbits.SyncPublic) pkg := r.pkg() r.Bool() // TODO(mdempsky): Remove; was "has init" for i, n := 0, r.Len(); i < n; i++ { // As if r.obj(), but avoiding the Scope.Lookup call, // to avoid eager loading of imports. r.Sync(pkgbits.SyncObject) assert(!r.Bool()) r.p.objIdx(r.Reloc(pkgbits.RelocObj)) assert(r.Len() == 0) } r.Sync(pkgbits.SyncEOF)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 16.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableCollection.java
* with {@link Collection} itself). Prefer subtypes such as {@link ImmutableSet} or {@link * ImmutableList}, which have well-defined {@link #equals} semantics, thus avoiding a common source * of bugs and confusion. * * <h3>About <i>all</i> {@code Immutable-} collections</h3> * * <p>The remainder of this documentation applies to every public {@code Immutable-} type in this
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 18.7K bytes - Viewed (0)