- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 121 for xBuckets (0.13 sec)
-
src/runtime/map_fast64.go
var b *bmap if h.B == 0 { // One-bucket table. No need to hash. b = (*bmap)(h.buckets) } else { hash := t.Hasher(noescape(unsafe.Pointer(&key)), uintptr(h.hash0)) m := bucketMask(h.B) b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize))) if c := h.oldbuckets; c != nil { if !h.sameSizeGrow() { // There used to be half as many buckets; mask down one more power of two. m >>= 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
cmd/metrics-v3-handler.go
// For Bucket metrics we need to set the buckets argument inside the // metric group, so that it will affect collection. If no buckets // are provided, we will not return bucket metrics. if bmg, ok := h.metricsData.bucketMGMap[collectorPath]; ok { if len(buckets) == 0 { continue } unLocker := bmg.LockAndSetBuckets(buckets) defer unLocker() }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed May 15 16:06:35 UTC 2024 - 7.6K bytes - Viewed (0) -
src/runtime/map_fast32.go
var b *bmap if h.B == 0 { // One-bucket table. No need to hash. b = (*bmap)(h.buckets) } else { hash := t.Hasher(noescape(unsafe.Pointer(&key)), uintptr(h.hash0)) m := bucketMask(h.B) b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize))) if c := h.oldbuckets; c != nil { if !h.sameSizeGrow() { // There used to be half as many buckets; mask down one more power of two. m >>= 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
cmd/metrics-v3-types.go
mg.ExtraLabels) for _, metric := range promMetrics { ch <- metric } } // LockAndSetBuckets - locks the buckets and sets the given buckets. It returns // a function to unlock the buckets. func (mg *MetricsGroup) LockAndSetBuckets(buckets []string) func() { mg.bucketsLock.Lock() mg.buckets = buckets return func() { mg.bucketsLock.Unlock() } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu May 23 07:41:18 UTC 2024 - 15.1K bytes - Viewed (0) -
src/runtime/map_faststr.go
// Set hashWriting after calling t.hasher for consistency with mapassign. h.flags ^= hashWriting if h.buckets == nil { h.buckets = newobject(t.Bucket) // newarray(t.bucket, 1) } again: bucket := hash & bucketMask(h.B) if h.growing() { growWork_faststr(t, h, bucket) } b := (*bmap)(add(h.buckets, bucket*uintptr(t.BucketSize))) top := tophash(hash) var insertb *bmap var inserti uintptr
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 15.3K bytes - Viewed (0) -
cmd/peer-s3-client.go
resultMap[bi.Name] = bi } } } // loop through buckets and see if some with lost quorum // these could be stale buckets lying around, queue a heal // of such a bucket. This is needed here as we identify such // buckets here while listing buckets. As part of regular // globalBucketMetadataSys.Init() call would get a valid // buckets only and not the quourum lost ones like this, so // explicit call
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 15.3K bytes - Viewed (0) -
cmd/background-newdisks-heal-ops.go
buckets, _ := z.ListBuckets(ctx, BucketOptions{}) // Buckets data are dispersed in multiple pools/sets, make // sure to heal all bucket metadata configuration. buckets = append(buckets, BucketInfo{ Name: pathJoin(minioMetaBucket, minioConfigPrefix), }, BucketInfo{ Name: pathJoin(minioMetaBucket, bucketMetaPrefix), }) // Heal latest buckets first.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jun 04 15:12:32 UTC 2024 - 14.5K bytes - Viewed (0) -
cmd/erasure.go
Cache: make(map[string]dataUsageEntry, len(oldCache.Cache)), } // Put all buckets into channel. bucketCh := make(chan BucketInfo, len(buckets)) // Shuffle buckets to ensure total randomness of buckets, being scanned. // Otherwise same set of buckets get scanned across erasure sets always. // at any given point in time. This allows different buckets to be scanned // in different order per erasure set, this wider spread is needed when
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 16K bytes - Viewed (0) -
pkg/scheduler/metrics/metrics.go
&metrics.HistogramOpts{ Subsystem: SchedulerSubsystem, Name: "scheduling_attempt_duration_seconds", Help: "Scheduling attempt latency in seconds (scheduling algorithm + binding)", Buckets: metrics.ExponentialBuckets(0.001, 2, 15), StabilityLevel: metrics.STABLE, }, []string{"result", "profile"}) SchedulingAlgorithmLatency = metrics.NewHistogram( &metrics.HistogramOpts{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Apr 27 08:22:53 UTC 2024 - 11.1K bytes - Viewed (0) -
src/internal/trace/internal/oldtrace/parser_test.go
} } func TestBuckets(t *testing.T) { var evs Events const N = eventsBucketSize*3 + 123 for i := 0; i < N; i++ { evs.append(Event{Ts: Timestamp(i)}) } if n := len(evs.buckets); n != 4 { t.Fatalf("got %d buckets, want %d", n, 4) } if n := evs.Len(); n != N { t.Fatalf("got %d events, want %d", n, N) } var n int evs.All()(func(ev *Event) bool { n++ return true })
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 3.4K bytes - Viewed (0)