Bits.Huff.from_codes: def of bend-kit-bits@0.1.0.1
Import: import bend-kit-bits@0.1.0.1/bits.bend as Bits
Lines 279-284 of bend-kit-bits@0.1.0.1/bits.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-bits@0.1.0.1/bits.bend&start_line=279&end_line=284

import Base

# A table from codes. Codes go shortest first, ties in list order; length 0 means no code.
# None when a length exceeds 16 or the lengths over-subscribe. An incomplete set is allowed,
# and decode answers None for its unused codes. Symbols must be below 2^27.
def Huff.from_codes(+msb: Bool, +xs: List<&2, Code>) -> Maybe<&1, Huff>:
  +max = lens.max(xs, 0)
  build.short(U32.is_le(max, 16), msb, max, xs)

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_le
  https://jend.leeeet.dev/definition.txt?path=bend-kit-bits@0.1.0.1/bits.bend&name=Code
  https://jend.leeeet.dev/definition.txt?path=bend-kit-bits@0.1.0.1/bits.bend&name=Huff
  https://jend.leeeet.dev/definition.txt?path=bend-kit-bits@0.1.0.1/bits.bend&name=build.short
  https://jend.leeeet.dev/definition.txt?path=bend-kit-bits@0.1.0.1/bits.bend&name=lens.max