package heap
Import Path
container/heap (on golang.org and go.dev)
Dependency Relation
imports one package, and imported by 2 packages
Involved Source Files
d-> heap.go
Exported Type Names
Exported Values
func
Fix(h
Interface, i
int)
Fix re-establishes the heap ordering after the element at index i has changed its value.
Changing the value of the element at index i and then calling Fix is equivalent to,
but less expensive than, calling Remove(h, i) followed by a Push of the new value.
The complexity is O(log n) where n = h.Len().
func
Init(h
Interface)
Init establishes the heap invariants required by the other routines in this package.
Init is idempotent with respect to the heap invariants
and may be called whenever the heap invariants may have been invalidated.
The complexity is O(n) where n = h.Len().
func
Pop(h
Interface) interface{}
Pop removes and returns the minimum element (according to Less) from the heap.
The complexity is O(log n) where n = h.Len().
Pop is equivalent to Remove(h, 0).
func
Push(h
Interface, x interface{})
Push pushes the element x onto the heap.
The complexity is O(log n) where n = h.Len().
func
Remove(h
Interface, i
int) interface{}
Remove removes and returns the element at index i from the heap.
The complexity is O(log n) where n = h.Len().
 |
The pages are generated with Golds v0.1.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project and developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |