- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 372 for simulation (0.44 sec)
-
staging/src/k8s.io/apiserver/pkg/admission/plugin/resourcequota/resource_access_test.go
} for _, q := range quotas { if q.Namespace != testNamespace1 { t.Errorf("Expected %s namespace, got %s", testNamespace1, q.Namespace) } } }() // simulation of different namespaces is a call for a different group key, but not shared with the first namespace go func() { defer wg.Done() quotas, err := accessor.GetQuotas(testNamespace2) if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 10 13:54:56 UTC 2024 - 7.2K bytes - Viewed (0) -
pkg/controller/volume/persistentvolume/recycle_test.go
// call appropriate syncVolume/syncClaim (simulating "volume/claim changed" // events). Go to 2. if these calls change anything. // 3. When all changes are processed and no new changes were made, call // syncVolume/syncClaim on all volumes/claims (simulating "periodic sync"). // 4. If some changes were done by step 3., go to 2. (simulation of // "volume/claim updated" events, eventually performing step 3. again)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Mar 14 00:37:30 UTC 2023 - 14.2K bytes - Viewed (0) -
pkg/controller/volume/persistentvolume/delete_test.go
// call appropriate syncVolume/syncClaim (simulating "volume/claim changed" // events). Go to 2. if these calls change anything. // 3. When all changes are processed and no new changes were made, call // syncVolume/syncClaim on all volumes/claims (simulating "periodic sync"). // 4. If some changes were done by step 3., go to 2. (simulation of // "volume/claim updated" events, eventually performing step 3. again)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 15.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/experimental/remat/rematerializer.h
#include <cinttypes> #include <tuple> #include <vector> namespace mlir { namespace TFL { // A class that // (1) Encodes in concise form the memory requirements of a computational graph // (2) Allows for the fast simulation of changes to the peak memory requirement // under rematerialization of intermediate results in the graph // (3) Implements a greedy algorithm for finding rematerializations of
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 14 20:57:44 UTC 2023 - 12K bytes - Viewed (0) -
src/regexp/exec.go
// an instruction and a corresponding capture array. // See https://swtch.com/~rsc/regexp/regexp2.html type thread struct { inst *syntax.Inst cap []int } // A machine holds all the state during an NFA simulation for p. type machine struct { re *Regexp // corresponding Regexp p *syntax.Prog // compiled program q0, q1 queue // two queues for runq, nextq pool []*thread // pool of available threads
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jun 04 20:10:54 UTC 2022 - 12.3K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
[]string{ "Now", "the time", "to come the aid", "is the time for all good men to come to the aid of their", "to (come|the)?", }, }, { "godoc simulation", "package main\n\nimport(\n \"rand\"\n ", []string{}, }, } // find all occurrences of s in source; report at most n occurrences func find(src, s string, n int) []int { var res []int
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
src/math/rand/v2/rand.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Package rand implements pseudo-random number generators suitable for tasks // such as simulation, but it should not be used for security-sensitive work. // // Random numbers are generated by a [Source], usually wrapped in a [Rand]. // Both types should be used by a single goroutine at a time: sharing among
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/runtime/mgcpacer_test.go
heapLive uint64 heapTrigger uint64 heapGoal uint64 heapPeak uint64 // These are produced by the simulation, so int64 and // float64 are more appropriate, so that we can check for // bad states in the simulation. heapScannable int64 gcUtilization float64 } func (r *gcCycleResult) goalRatio() float64 { return float64(r.heapPeak) / float64(r.heapGoal) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 19 13:53:21 UTC 2023 - 39.3K bytes - Viewed (0) -
src/math/rand/rand.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Package rand implements pseudo-random number generators suitable for tasks // such as simulation, but it should not be used for security-sensitive work. // // Random numbers are generated by a [Source], usually wrapped in a [Rand]. // Both types should be used by a single goroutine at a time: sharing among
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:09:08 UTC 2024 - 16.9K bytes - Viewed (0) -
pkg/controller/volume/persistentvolume/provision_test.go
// call appropriate syncVolume/syncClaim (simulating "volume/claim changed" // events). Go to 2. if these calls change anything. // 3. When all changes are processed and no new changes were made, call // syncVolume/syncClaim on all volumes/claims (simulating "periodic sync"). // 4. If some changes were done by step 3., go to 2. (simulation of // "volume/claim updated" events, eventually performing step 3. again)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 35.3K bytes - Viewed (0)