- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 367 for xBuckets (0.13 sec)
-
cmd/metacache-manager.go
// It should never be used directly since buckets are // distributed deterministically. // Therefore no cluster locks are required. var localMetacacheMgr = &metacacheManager{ buckets: make(map[string]*bucketMetacache), trash: make(map[string]metacache), } type metacacheManager struct { mu sync.RWMutex init sync.Once buckets map[string]*bucketMetacache
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Oct 25 00:44:15 UTC 2022 - 5.2K bytes - Viewed (0) -
src/internal/trace/traceviewer/histogram.go
h.Buckets = h.Buckets[:cap(h.Buckets)] } h.Buckets[bucket]++ if bucket < h.MinBucket || h.MaxBucket == 0 { h.MinBucket = bucket } if bucket > h.MaxBucket { h.MaxBucket = bucket } h.Count++ } // BucketMin returns the minimum duration value for a provided bucket. func (h *TimeHistogram) BucketMin(bucket int) time.Duration { return time.Duration(math.Exp(float64(bucket) * logDiv)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 21:28:58 UTC 2023 - 2.3K bytes - Viewed (0) -
cmd/bucket-metadata-sys.go
sys.Unlock() // Initialize the failed buckets if _, ok := failedBuckets[buckets[i].Name]; ok { globalEventNotifier.set(buckets[i], meta) globalBucketTargetSys.set(buckets[i], meta) delete(failedBuckets, buckets[i].Name) } wait() // wait to proceed to next entry. } } t.Reset(bucketMetadataRefresh) } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 19.8K bytes - Viewed (0) -
.teamcity/src/main/kotlin/model/FunctionalTestBucketProvider.kt
testCoverage to buckets } else { testCoverage to mergeUnknownSubprojectsIntoFirstAvailableBucket(buckets, model.subprojects.subprojects.filter { subprojectsInModelButNotInBucketJson.contains(it.name) }) } } }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jan 18 05:14:09 UTC 2024 - 9K bytes - Viewed (0) -
src/runtime/histogram.go
// Values are placed in buckets based solely on the most // significant set bit. Thus, buckets are power-of-2 sized. // Values are then placed into sub-buckets based on the value of // the next timeHistSubBucketBits most significant bits. Thus, // sub-buckets are linear within a bucket. // // Therefore, the number of sub-buckets (timeHistNumSubBuckets) // defines the error. This error may be computed as
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 7.3K bytes - Viewed (0) -
cmd/peer-s3-server.go
if vi, ok := deletedBuckets[v.Name]; ok { bi.Deleted = vi.Created } buckets = append(buckets, bi) } for _, v := range deletedBuckets { if _, ok := healBuckets[v.Name]; !ok { buckets = append(buckets, BucketInfo{ Name: v.Name, Deleted: v.Created, }) } } return buckets, nil } func cloneDrives(drives []StorageAPI) []StorageAPI {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 8.4K bytes - Viewed (0) -
test/fixedbugs/issue62203.go
func main() { m := map[string]struct{}{} // Fill m up to the max for 4 buckets = 48 entries. for i := 0; i < 48; i++ { m[fmt.Sprintf("%d", i)] = struct{}{} } // Add a 49th entry, to start a grow to 8 buckets. m["foo"] = struct{}{} // Remove that 49th entry. m is still growing to 8 buckets, // but a clone of m will only have 4 buckets because it // only needs to fit 48 entries. delete(m, "foo")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 25 16:10:03 UTC 2023 - 688 bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/metrics/timing_ratio_histogram_test.go
testHistogramName := "vec_element_simple" t0 := time.Now() clk := testclock.NewFakePassiveClock(t0) buckets := []float64{0, 1} vec := NewTestableTimingRatioHistogramVec(clk.Now, &compbasemetrics.TimingHistogramOpts{Name: testHistogramName, Buckets: buckets}, "alabel", ) toRegister := vec.metrics() registry := compbasemetrics.NewKubeRegistry() for _, reg := range toRegister {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 13 16:03:06 UTC 2022 - 8.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/SearchLogService.java
}); final Terms agg = list.getAggregations().get(SearchLogPager.LOG_TYPE_CLICK_COUNT); final List<? extends Terms.Bucket> buckets = agg.getBuckets(); updatePagerByAgg(pager, buckets.size()); return buckets.stream().map(e -> { final Map<String, Object> map = new HashMap<>();
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 28.4K bytes - Viewed (0) -
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)