- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 809 for heaps (0.05 sec)
-
platforms/core-runtime/launcher/src/test/groovy/org/gradle/launcher/daemon/server/health/gc/GarbageCollectionStatsTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:29:13 UTC 2023 - 3.4K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/process/internal/JvmOptions.java
.addAll(getJvmArgs()) .addAll(getManagedJvmArgs()).build(); } /** * @return the list of jvm args we manage explicitly, for example, max heaps size or file encoding. * The result is a subset of options returned by {@link #getAllImmutableJvmArgs()} */ protected List<String> getManagedJvmArgs() { List<String> args = new ArrayList<>();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 26 09:45:59 UTC 2024 - 14.8K bytes - Viewed (0) -
src/runtime/mgcpacer.go
} // For small heaps, set the max trigger point at maxTriggerRatio of the way // from the live heap to the heap goal. This ensures we always have *some* // headroom when the GC actually starts. For larger heaps, set the max trigger // point at the goal, minus the minimum heap size. // // This choice follows from the fact that the minimum heap size is chosen
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/runtime/malloc.go
// be very high if they were to be backed by huge pages (e.g. a few MiB makes // a huge difference for an 8 MiB heap, but barely any difference for a 1 GiB // heap). The benefit of huge pages is also not worth it for small heaps, // because only a very, very small part of the metadata is used for small heaps. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/mpagealloc.go
// // A note on latency: for sufficiently small heaps (<10s of GiB) this function will take constant // time, but may take time proportional to the size of the mapped heap beyond that. // // The heap lock must not be held over this operation, since it will briefly acquire // the heap lock. // // Must be called on the system stack because it acquires the heap lock. // //go:systemstack
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0) -
src/runtime/mranges.go
// structure is meant to represent the Go heap. At worst, copying this // would take ~160µs assuming a conservative copying rate of 25 GiB/s (the // copy will almost never trigger a page fault) for a 1 TiB heap with 4 MiB // arenas which is completely discontiguous. ~160µs is still a lot, but in // practice most platforms have 64 MiB arenas (which cuts this by a factor // of 16) and Go heaps are usually mostly contiguous, so the chance that
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
src/runtime/mgc.go
// when stopping began (just before trying to stop Ps) and just after the // world started again. pauseNS int64 // debug.gctrace heap sizes for this cycle. heap0, heap1, heap2 uint64 // Cumulative estimated CPU usage. cpuStats } // GC runs a garbage collection and blocks the caller until the // garbage collection is complete. It may also block the entire
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/runtime/time.go
} if heap[i].timer != tw.timer { heap[i] = tw } } // siftDown puts the timer at position i in the right place // in the heap by moving it down toward the bottom of the heap. func (ts *timers) siftDown(i int) { heap := ts.heap n := len(heap) if i >= n { badTimer() } if i*timerHeapN+1 >= n { return } tw := heap[i] when := tw.when if when <= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 14:36:24 UTC 2024 - 37.5K bytes - Viewed (0) -
src/container/heap/heap.go
// Package heap provides heap operations for any type that implements // heap.Interface. A heap is a tree with the property that each node is the // minimum-valued node in its subtree. // // The minimum element in the tree is the root, at index 0. // // A heap is a common way to implement a priority queue. To build a priority // queue, implement the Heap interface with the (negative) priority as the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 14:39:10 UTC 2023 - 3.3K bytes - Viewed (0) -
pkg/scheduler/internal/heap/heap.go
return h.data.Peek() } // Pop returns the head of the heap and removes it. func (h *Heap) Pop() (interface{}, error) { obj := heap.Pop(h.data) if obj != nil { if h.metricRecorder != nil { h.metricRecorder.Dec() } return obj, nil } return nil, fmt.Errorf("object was removed from heap data") } // Get returns the requested item, or sets exists=false.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 29 18:37:35 UTC 2022 - 6.7K bytes - Viewed (0)