Method Winner

loser/loser.go:49–51 · view source on GitHub ↗

()

Source from the content-addressed store, hash-verified

47	}
48
49	func (t *Tree[E]) Winner() E {
50	return t.nodes[t.nodes[0].index].value
51	}
52
53	func (t *Tree[E]) Next() bool {
54	if len(t.nodes) == 0 {

MergeTokensFunction · 0.80

checkTreeEqualFunction · 0.80

no outgoing calls

checkTreeEqualFunction · 0.64