- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 468 for heapUp (0.18 sec)
-
src/packaging/common/packaging.properties
# Environment file packaging.env.file= # Default configuration directory and file to use in bin/plugin script # Default values for min/max heap memory allocated to fess java process packaging.fess.heap.min=256m packaging.fess.heap.max=1g # Specifies the maximum file descriptor number packaging.os.max.open.files=65535 # Maximum number of VMA (Virtual Memory Areas) a process can own
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Dec 10 01:24:02 UTC 2015 - 797 bytes - Viewed (0) -
src/main/assemblies/files/fess.in.sh
FESS_JAVA_OPTS="$FESS_JAVA_OPTS -Dlog4j.skipJansi=true" # Causes the JVM to dump its heap on OutOfMemory. #FESS_JAVA_OPTS="$FESS_JAVA_OPTS -XX:+HeapDumpOnOutOfMemoryError" # The path to the heap dump location, note directory must exists and have enough # space for a full heap dump. #FESS_JAVA_OPTS="$FESS_JAVA_OPTS -XX:HeapDumpPath=$FESS_HOME/logs/heapdump.hprof" # Disables explicit GC
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sun Jan 15 06:32:15 UTC 2023 - 4.7K bytes - Viewed (0) -
platforms/core-runtime/launcher/src/integTest/groovy/org/gradle/launcher/daemon/DaemonJvmSettingsIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 06 13:00:39 UTC 2024 - 4.3K bytes - Viewed (0) -
src/runtime/traceallocfree.go
traceAllocFreeInfoBatch // Contains info for interpreting events. [min heap addr, page size, min heap align, min stack align] ) // traceSnapshotMemory takes a snapshot of all runtime memory that there are events for // (heap spans, heap objects, goroutine stacks, etc.) and writes out events for them. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:32:51 UTC 2024 - 5.9K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
} } // sysGrow performs architecture-dependent operations on heap // growth for the page allocator, such as mapping in new memory // for summaries. It also updates the length of the slices in // p.summary. // // base is the base of the newly-added heap memory and limit is // the first address past the end of the newly-added heap memory. // Both must be aligned to pallocChunkBytes. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
test/fixedbugs/issue17318.go
return fmt.Sprintf("%d", int(e)) // ERROR "... argument does not escape$" "int\(e\) escapes to heap$" } //go:noinline func foo(ops closure, j int) (err fmt.Stringer) { // ERROR "ops does not escape" enqueue := func(i int) fmt.Stringer { // ERROR "func literal does not escape" return ops(i, j) // ERROR "ops\(i, j\) escapes to heap$" } err = enqueue(4) if err != nil { return err }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 16 15:30:51 UTC 2019 - 1.4K bytes - Viewed (0) -
src/internal/trace/reader.go
// (3) Group each event batch by M, sorted by timestamp. (batchCursor contains the groups.) // (4) Organize batchCursors in a min-heap, ordered by the timestamp of the next event for each M. // (5) Try to advance the next event for the M at the top of the min-heap. // (a) On success, select that M. // (b) On failure, sort the min-heap and try to advance other Ms. Select the first M that advances. // (c) If there's nothing left to advance, goto (1).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 6.7K bytes - Viewed (0) -
pkg/controller/nodelifecycle/scheduler/rate_limited_queue.go
func (q *UniqueQueue) Replace(value TimedValue) bool { q.lock.Lock() defer q.lock.Unlock() for i := range q.queue { if q.queue[i].Value != value.Value { continue } heap.Remove(&q.queue, i) heap.Push(&q.queue, &value) return true } return false } // RemoveFromQueue the value from the queue, but keeps it in the set, // so it won't be added second time. Returns true if something was // removed.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Mar 07 07:50:01 UTC 2023 - 8.2K bytes - Viewed (0) -
test/fixedbugs/issue27518b.go
} } } type StackObj struct { h *HeapObj } func gc(shouldFinalize bool) { runtime.GC() runtime.GC() runtime.GC() if shouldFinalize != finalized { err = "heap object finalized at the wrong time" } } func main() { var s StackObj s.h = new(HeapObj) s.h.init() runtime.SetFinalizer(s.h, func(h *HeapObj) { finalized = true }) gc(false) h := g(&s)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 03 19:54:23 UTC 2018 - 1.2K bytes - Viewed (0) -
pkg/queue/delay_test.go
sorted := []*delayTask{t1, t2, t3, t4} // fill in an unsorted order unsorted := []*delayTask{t4, t2, t3, t1} for _, task := range unsorted { heap.Push(pq, task) } // dequeue should be in order for i, task := range sorted { peeked := pq.Peek() popped := heap.Pop(pq) if task != popped { t.Fatalf("pop %d was not in order", i) } if peeked != popped {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 06:27:31 UTC 2023 - 4.3K bytes - Viewed (0)