MCPcopy Create free account
hub / github.com/TheAlgorithms/Go / SymbolFreq

Struct SymbolFreq

compression/huffmancoding.go:27–30  ·  view source on GitHub ↗

A SymbolFreq is a pair of a symbol and its associated frequency.

Source from the content-addressed store, hash-verified

25
26// A SymbolFreq is a pair of a symbol and its associated frequency.
27type SymbolFreq struct {
28 Symbol rune
29 Freq int
30}
31
32// HuffTree returns the root Node of the Huffman tree by compressing listfreq.
33// The compression produces the most optimal code lengths, provided listfreq is ordered,

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected