- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 2,115 for heal (0.03 sec)
-
test/chan/sieve2.go
min := 15 for { m := multiples(<-primes) head := <-m 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
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/runtime/lfstack.go
} for { old := atomic.Load64((*uint64)(head)) node.next = old if atomic.Cas64((*uint64)(head), old, new) { break } } } func (head *lfstack) pop() unsafe.Pointer { for { old := atomic.Load64((*uint64)(head)) if old == 0 { return nil } node := lfstackUnpack(old) next := atomic.Load64(&node.next) if atomic.Cas64((*uint64)(head), old, next) { return unsafe.Pointer(node) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 2K bytes - Viewed (0) -
pkg/queue/delay.go
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 06:27:31 UTC 2023 - 6.7K bytes - Viewed (0) -
docs/en/docs/img/logo-margin/logo-teal.svg
logo-teal.svg...
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Feb 04 20:56:59 UTC 2024 - 6.4K bytes - Viewed (0) -
src/internal/trace/batchcursor_test.go
heap[len(heap)-1].ev.time = 21 heapUpdate(heap, len(heap)-1) checkHeap(t, heap) if heap[len(heap)-1].ev.time != 21 { t.Fatalf("heap update failed, expected %d as heap min: %s", 21, heapDebugString(heap)) } // Update the last element to be smaller. heap[len(heap)-1].ev.time = 7 heapUpdate(heap, len(heap)-1) checkHeap(t, heap) if heap[len(heap)-1].ev.time == 21 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 3K bytes - Viewed (0) -
src/runtime/gc_test.go
type X struct { buf [1]byte nextbuf []byte next *X } var head *X for i := 0; i < 10; i++ { p := &X{} p.buf[0] = 42 p.next = head if head != nil { p.nextbuf = head.buf[:] } head = p runtime.GC() } for p := head; p != nil; p = p.next { if p.buf[0] != 42 { t.Fatal("corrupted heap") } } } func TestGcRescan(t *testing.T) { type X struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 05 22:33:52 UTC 2024 - 17.6K 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) -
docs/en/docs/img/logo-margin/logo-teal.png
logo-teal.png...
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Feb 04 20:56:59 UTC 2024 - 19.4K bytes - Viewed (0) -
docs/en/docs/img/logo-teal.svg
logo-teal.svg...
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Feb 04 20:56:59 UTC 2024 - 2K bytes - Viewed (0) -
src/runtime/internal/sys/nih.go
// - Maps and channels contains no-in-heap types are disallowed. // // 4. Write barriers on pointers to not-in-heap types can be omitted. // // The last point is the real benefit of NotInHeap. The runtime uses // it for low-level internal structures to avoid memory barriers in the // scheduler and the memory allocator where they are illegal or simply
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 18:24:50 UTC 2022 - 1.7K bytes - Viewed (0)