Documentation ¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Tree ¶
type Tree[E constraints.Ordered] struct { // contains filtered or unexported fields }
A loser tree is a binary tree laid out such that nodes N and N+1 have parent N/2. We store M leaf nodes in positions M...2M-1, and M-1 internal nodes in positions 1..M-1. Node 0 is a special node, containing the winner of the contest.
func New ¶
func New[E constraints.Ordered](lists [][]E, maxVal E) *Tree[E]
Click to show internal directories.
Click to hide internal directories.