Hash.adler.of: def of bend-kit-hash@0.3.0.2
Import: import bend-kit-hash@0.3.0.2/hash.bend as Hash
Lines 429-432 of bend-kit-hash@0.3.0.2/hash.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-hash@0.3.0.2/hash.bend&start_line=429&end_line=432

import Base

# Adler-32 (RFC 1950 §9). The state is the checksum itself: s2 << 16 | s1.
# A word takes mod 65521 once, after four bytes; no sum reaches 2^32 first.
def adler.of(+s1: U32, +s2: U32) -> U32:
  (((s2 % 65521) << 16n) .|. (s1 % 65521) : U32)

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.mod
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.or
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.shln