- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 124 for Precompute (0.21 sec)
-
pkg/kube/krt/README.md
In the above example, the provided function will be called (at least) every time there is a change to a configmap. The `ConfigMapCount` collection will produce events only when the count changes. The framework will use generic Equals on the underlying object to determine whether or not to recompute collections. ### Picking a collection type
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Dec 18 17:21:50 UTC 2023 - 11.8K bytes - Viewed (0) -
src/internal/trace/mud.go
if r < thresh { d.trackSum += area } else { d.trackSum += area * (thresh - l) / (r - l) } if d.trackSum >= d.trackMass { // The tracked mass now falls in a different // bucket. Recompute the inverse cumulative sum. d.setTrackMass(d.trackMass) } } } // setTrackMass sets the mass to track the inverse cumulative sum for. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.7K bytes - Viewed (0) -
src/crypto/rsa/boring.go
for i, p := range k.Primes { dst.Primes[i] = new(big.Int).Set(p) } if x := k.Precomputed.Dp; x != nil { dst.Precomputed.Dp = new(big.Int).Set(x) } if x := k.Precomputed.Dq; x != nil { dst.Precomputed.Dq = new(big.Int).Set(x) } if x := k.Precomputed.Qinv; x != nil { dst.Precomputed.Qinv = new(big.Int).Set(x) } return dst
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 18 00:30:19 UTC 2022 - 3.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/flagalloc.go
if !f.Config.splitLoad(v) { f.Fatalf("can't split flag generator: %s", v.LongString()) } } // Make sure any flag arg of v is in the flags register. // If not, recompute it. for i, a := range v.Args { if !a.Type.IsFlags() { continue } if a == flag { continue } // Recalculate a c := copyFlags(a, b) // Update v.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 6.7K bytes - Viewed (0) -
src/crypto/internal/edwards25519/tables.go
type projLookupTable struct { points [8]projCached } // A precomputed lookup table for fixed-base, constant-time scalar muls. type affineLookupTable struct { points [8]affineCached } // A dynamic lookup table for variable-base, variable-time scalar muls. type nafLookupTable5 struct { points [8]projCached } // A precomputed lookup table for fixed-base, variable-time scalar muls. type nafLookupTable8 struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Nov 05 21:02:45 UTC 2022 - 3.7K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/base/super/com/google/common/base/Platform.java
/** @author Jesse Wilson */ final class Platform { static CharMatcher precomputeCharMatcher(CharMatcher matcher) { // CharMatcher.precomputed() produces CharMatchers that are maybe a little // faster (and that's debatable), but definitely more memory-hungry. We're // choosing to turn .precomputed() into a no-op in GWT, because it doesn't // seem to be a worthwhile tradeoff in a browser. return matcher; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon May 27 13:56:56 UTC 2024 - 2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/lca.go
if p1 > p2 { p1, p2 = p2, p1 } // The lowest common ancestor is the minimum depth block // on the tour from p1 to p2. We've precomputed minimum // depth blocks for powers-of-two subsequences of the tour. // Combine the right two precomputed values to get the answer. logS := uint(log64(int64(p2 - p1))) bid1 := lca.rangeMin[logS][p1] bid2 := lca.rangeMin[logS][p2-1<<logS+1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
architecture/networking/pilot.md
First, we have a concept of a `Full` push. Only `Full` pushes will recompute `PushContext` on change; otherwise this is skipped and the last `PushContext` is re-used. Note: even when `Full`, we try to copy as much from the previous `PushContext` as possible. For example, if only a `WasmPlugin` changed, we would not recompute services indexes.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Feb 07 17:53:24 UTC 2024 - 19.1K bytes - Viewed (0) -
src/crypto/rsa/boring_test.go
if err != nil { t.Fatal(err) } // Non-Boring GenerateKey always sets CRTValues to a non-nil (possibly empty) slice. if k.Precomputed.CRTValues == nil { t.Fatalf("GenerateKey: Precomputed.CRTValues = nil") } } func TestBoringFinalizers(t *testing.T) { if runtime.GOOS == "nacl" || runtime.GOOS == "js" { // Times out on nacl and js/wasm (without BoringCrypto)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 15 00:16:30 UTC 2022 - 4.5K bytes - Viewed (0) -
src/encoding/json/example_test.go
} fmt.Println(c.Space, dst) } // Output: // YCbCr &{255 0 -10} // RGB &{98 218 255} } // This example uses RawMessage to use a precomputed JSON during marshal. func ExampleRawMessage_marshal() { h := json.RawMessage(`{"precomputed": true}`) c := struct { Header *json.RawMessage `json:"header"` Body string `json:"body"` }{Header: &h, Body: "Hello Gophers!"}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 13 18:45:54 UTC 2021 - 6.1K bytes - Viewed (0)