- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 72 for growing (0.21 sec)
-
src/runtime/map_fast32.go
// If we hit the max load factor or we have too many overflow buckets, // and we're not already in the middle of growing, start growing. if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) { hashGrow(t, h) goto again // Growing the table invalidates everything, so try again } if insertb == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
src/runtime/map_fast64.go
// If we hit the max load factor or we have too many overflow buckets, // and we're not already in the middle of growing, start growing. if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) { hashGrow(t, h) goto again // Growing the table invalidates everything, so try again } if insertb == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/map_faststr.go
// If we hit the max load factor or we have too many overflow buckets, // and we're not already in the middle of growing, start growing. if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) { hashGrow(t, h) goto again // Growing the table invalidates everything, so try again } if insertb == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 15.3K bytes - Viewed (0) -
src/runtime/slice.go
doublecap := newcap + newcap if newLen > doublecap { return newLen } const threshold = 256 if oldCap < threshold { return doublecap } for { // Transition from growing 2x for small slices // to growing 1.25x for large slices. This formula // gives a smooth-ish transition between the two. newcap += (newcap + 3*threshold) >> 2 // We need to check `newcap >= newLen` and whether `newcap` overflowed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 12.2K bytes - Viewed (0) -
src/runtime/mspanset.go
type spanSet struct { // A spanSet is a two-level data structure consisting of a // growable spine that points to fixed-sized blocks. The spine // can be accessed without locks, but adding a block or // growing it requires taking the spine lock. // // Because each mspan covers at least 8K of heap and takes at // most 8 bytes in the spanSet, the growth of the spine is // quite limited. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
* than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache. * This avoids out-of-control memory consumption, and it keeps the cache from growing so * large that doing the lookup is noticeably slower than redoing the work would be. * * Ideally we'd have a real eviction policy, but until we see a problem in practice, I hope
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:40:56 UTC 2024 - 11.9K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/authoring-builds/tutorial/partr3_multi_project_builds.adoc
<2> The `app` subproject <3> The `app` source code <4> The `app` build script <5> The optional settings file ===== == Step 2. Add another Subproject to the Build Imagine that our project is growing and requires a custom library to function. Let's create this imaginary `lib`. First, create a `lib` folder: [source,text] ---- mkdir lib ---- [source,text] ---- cd lib ----
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 29 17:16:27 UTC 2024 - 13.9K bytes - Viewed (0) -
src/runtime/debug/garbage.go
func FreeOSMemory() { freeOSMemory() } // SetMaxStack sets the maximum amount of memory that // can be used by a single goroutine stack. // If any goroutine exceeds this limit while growing its stack, // the program crashes. // SetMaxStack returns the previous setting. // The initial setting is 1 GB on 64-bit systems, 250 MB on 32-bit systems. // There may be a system-imposed maximum stack limit regardless
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.9K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
cleanup := setBits(bits) defer cleanup() b.StopTimer() x := New(data) size := testSaveRestore(nil, nil, x) // verify correctness buf := bytes.NewBuffer(make([]byte, size)) // avoid growing b.SetBytes(int64(size)) b.StartTimer() b.ReportAllocs() for i := 0; i < b.N; i++ { buf.Reset() if err := x.Write(buf); err != nil { b.Fatal(err) } var y Index
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
pilot/pkg/model/jwks_resolver.go
secureHTTPClient *http.Client httpClient *http.Client refreshTicker *time.Ticker // Cached key will be removed from cache if (time.now - cachedItem.lastUsedTime >= evictionDuration), this prevents key cache growing indefinitely. evictionDuration time.Duration // Refresher job running interval. refreshInterval time.Duration // Refresher job running interval on failure. refreshIntervalOnFailure time.Duration
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Feb 23 09:47:21 UTC 2024 - 20.3K bytes - Viewed (0)