- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 93 for clocks (0.24 sec)
-
src/time/time.go
// no leap seconds. // // # Monotonic Clocks // // Operating systems provide both a “wall clock,” which is subject to // changes for clock synchronization, and a “monotonic clock,” which is // not. The general rule is that the wall clock is for telling time and // the monotonic clock is for measuring time. Rather than split the API,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 50.7K bytes - Viewed (0) -
src/time/time_test.go
{"ISOWeek", func(t1, t2 Time) bool { a1, b1 := t1.ISOWeek() a2, b2 := t2.ISOWeek() return a1 == a2 && b1 == b2 }}, {"Clock", func(t1, t2 Time) bool { a1, b1, c1 := t1.Clock() a2, b2, c2 := t2.Clock() return a1 == a2 && b1 == b2 && c1 == c2 }}, {"Hour", func(t1, t2 Time) bool { return t1.Hour() == t2.Hour() }},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:13:47 UTC 2024 - 56.5K bytes - Viewed (0) -
kotlin-js-store/yarn.lock
Yuri Schimke <******@****.***> 1690028931 +0100
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sat Jul 22 12:28:51 UTC 2023 - 87.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher.go
startBucketID int64 clock clock.Clock bookmarkFrequency time.Duration } func newTimeBucketWatchers(clock clock.Clock, bookmarkFrequency time.Duration) *watcherBookmarkTimeBuckets { return &watcherBookmarkTimeBuckets{ watchersBuckets: make(map[int64][]*cacheWatcher), createTime: clock.Now(), startBucketID: 0, clock: clock, bookmarkFrequency: bookmarkFrequency,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 10:12:02 UTC 2024 - 51.8K bytes - Viewed (0) -
src/runtime/mgc.go
var work workType type workType struct { full lfstack // lock-free list of full blocks workbuf _ cpu.CacheLinePad // prevents false-sharing between full and empty empty lfstack // lock-free list of empty blocks workbuf _ cpu.CacheLinePad // prevents false-sharing between empty and nproc/nwait wbufSpans struct { lock mutex // free is a list of spans dedicated to workbufs, but
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
pkg/controller/job/job_controller.go
orphanQueue: workqueue.NewTypedRateLimitingQueueWithConfig(workqueue.NewTypedItemExponentialFailureRateLimiter[string](DefaultJobApiBackOff, MaxJobApiBackOff), workqueue.TypedRateLimitingQueueConfig[string]{Name: "job_orphan_pod", Clock: clock}), broadcaster: eventBroadcaster,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jun 10 23:56:37 UTC 2024 - 77.6K bytes - Viewed (0) -
pkg/kubelet/pod_workers_test.go
} } func (w *timeIncrementingWorkers) tick() { w.lock.Lock() defer w.lock.Unlock() w.w.clock.(*clocktesting.FakePassiveClock).SetTime(w.w.clock.Now().Add(time.Second)) } // createTimeIncrementingPodWorkers will guarantee that each call to UpdatePod and each worker goroutine invocation advances the clock by one second, // although multiple workers will advance the clock in an unpredictable order. Use to observe
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 04 06:25:43 UTC 2024 - 75.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// components as single blocks, duplicated calculated liveness information // out to all of them. po := f.postorder() s.loopnest = f.loopnest() s.loopnest.calculateDepths() for { changed := false for _, b := range po { // Start with known live values at the end of the block. // Add len(b.Values) to adjust from end-of-block distance // to beginning-of-block distance. live.clear()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
pkg/controller/disruption/disruption_test.go
} if condition == nil { t.Fatalf("Expected ExistingTestCondition condition, but didn't find it") } } // waitForCacheCount blocks until the given cache store has the desired number // of items in it. This will return an error if the condition is not met after a // 10 second timeout. func waitForCacheCount(store cache.Store, n int) error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 50K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
// using its result. func (state *debugState) mergePredecessors(b *Block, blockLocs []*BlockDebug, previousBlock *Block, forLocationLists bool) (abt.T, bool) { // Filter out back branches. var predsBuf [10]*Block preds := predsBuf[:0] locs := blockLocs[b.ID] blockChanged := !locs.everProcessed // the first time it always changes. updating := locs.everProcessed
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0)