- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 468 for heapUp (0.1 sec)
-
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
Heap heap; if (crossOver == index) { heap = this; } else { index = crossOver; heap = otherHeap; } heap.bubbleUpAlternatingLevels(index, x); } /** * Bubbles a value from {@code index} up the levels of this heap, and returns the index the * element ended up at. */ @CanIgnoreReturnValue
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K 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/metrics/doc.go
Cumulative count of heap allocations whose storage was freed by the garbage collector. Note that this does not include tiny objects as defined by /gc/heap/tiny/allocs:objects, only tiny blocks. /gc/heap/goal:bytes Heap size target for the end of the GC cycle. /gc/heap/live:bytes Heap memory occupied by live objects that were marked by the previous GC. /gc/heap/objects:objects
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:43 UTC 2024 - 20K bytes - Viewed (0) -
test/fixedbugs/issue14999.go
package p func f(x int) func(int) int { return func(y int) int { return x + y } // ERROR "heap-allocated closure f\.func1, not allowed in runtime" } func g(x int) func(int) int { // ERROR "x escapes to heap, not allowed in runtime" return func(y int) int { // ERROR "heap-allocated closure g\.func1, not allowed in runtime" x += y return x + y }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 04 17:00:19 UTC 2021 - 535 bytes - Viewed (0) -
test/chan/sieve2.go
for min < head { composites <- min minchan := heap.Pop(&h).(*PeekCh) min = minchan.head minchan.head = <-minchan.ch heap.Push(&h, minchan) } for min == head { minchan := heap.Pop(&h).(*PeekCh) min = minchan.head minchan.head = <-minchan.ch heap.Push(&h, minchan) } composites <- head heap.Push(&h, &PeekCh{<-m, m}) } }()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 3.9K bytes - Viewed (0) -
src/cmd/link/internal/ld/outbuf_windows.go
bufHdr.Data = unsafe.Pointer(ptr) bufHdr.Len = int(filesize) bufHdr.Cap = int(filesize) // copy heap to new mapping if uint64(oldlen+len(out.heap)) > filesize { panic("mmap size too small") } copy(out.buf[oldlen:], out.heap) out.heap = out.heap[:0] return nil } func (out *OutBuf) munmap() { if out.buf == nil { return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 01:59:25 UTC 2022 - 2.3K bytes - Viewed (0) -
src/cmd/compile/internal/base/base.go
) // Assumptions and observations of Go's garbage collector, as of Go 1.17-1.20: // - the initial heap goal is 4M, by fiat. It is possible for Go to start // with a heap as small as 512k, so this may change in the future. // - except for the first heap goal, heap goal is a function of // observed-live at the previous GC and current GOGC. After the first // GC, adjusting GOGC immediately updates GOGC; before the first GC,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 19:18:34 UTC 2023 - 8K bytes - Viewed (0) -
platforms/core-execution/persistent-cache/src/main/java/org/gradle/cache/internal/FileContentCacheFactory.java
* @param normalizedCacheSize The maximum number of entries to cache in-heap, given a 'typical' heap size. The actual size may vary based on the actual heap available. * @param calculator The calculator to use to compute the value for a given file. * @param serializer The serializer to use to write values to persistent cache. */
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:08:47 UTC 2023 - 1.8K bytes - Viewed (0) -
src/runtime/testdata/testprog/gc.go
} fmt.Println("OK") } func GCPhys() { // This test ensures that heap-growth scavenging is working as intended. // // It attempts to construct a sizeable "swiss cheese" heap, with many // allocChunk-sized holes. Then, it triggers a heap growth by trying to // allocate as much memory as would fit in those holes. // // The heap growth should cause a large number of those holes to be // returned to the OS.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Oct 02 02:28:27 UTC 2022 - 12.1K bytes - Viewed (0) -
test/escape5.go
p := leaktoret(&x) _ = p } func f3() { var x int // ERROR "moved to heap: x" p := leaktoret(&x) gp = p } func f4() { var x int // ERROR "moved to heap: x" p, q := leaktoret2(&x) gp = p gp = q } func f5() { var x int leaktoret22(leaktoret2(&x)) } func f6() { var x int // ERROR "moved to heap: x" px1, px2 := leaktoret22(leaktoret2(&x)) gp = px1 _ = px2 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 18:50:24 UTC 2023 - 5.3K bytes - Viewed (0)