merger

Documentation

Index

• func Merge(lists ...[]*internalpb.Entry) []*internalpb.Entry
• type Element
• type Heap
  • func (h *Heap) Len() int
  • func (h *Heap) Less(i, j int) bool
  • func (h *Heap) Pop() any
  • func (h *Heap) Push(x any)
  • func (h *Heap) Swap(i, j int)

Functions

func Merge

func Merge(lists ...[]*internalpb.Entry) []*internalpb.Entry

Types

type Element

type Element struct {
	*internalpb.Entry
	// sorted sequence
	SortedSeq int
}

type Heap

type Heap []Element

Heap min heap

func (*Heap) Len

func (h *Heap) Len() int

func (*Heap) Less

func (h *Heap) Less(i, j int) bool

func (*Heap) Pop

func (h *Heap) Pop() any

Pop the minimum element in heap 1. move the minimum element to the end of slice 2. pop it (what this method does) 3. heapify

func (*Heap) Push

func (h *Heap) Push(x any)

func (*Heap) Swap

func (h *Heap) Swap(i, j int)