bend-osdev-bytes

Releases (3)

• 0.1.1.1 invalid

  expected a package named bend-osdev-word64@0.1.1.1 on https://hub.bend-lang.com

  at LAWS.bend:5, PROOF.bend:2, bytes.bend:12, check.bend:2

  5 files do not load

  • LAWS.bend
  • PROOF.bend
  • bytes.bend
  • check.bend
  • package.bend
• 0.1.1.0 indexed
• 0.1.0.0 unindexed

Definitions (396)

bytes.bend

• def le16_at
• def be16_at
• def le32_at
• def be32_at
• def le64_at
• def be64_at
• def of_string
• def to_string
• def hex.digit.pick
• def hex.digit
• def hextwo lower-case hex digits per byte
• def rev_onto
• def rev
• def len.go
• def len.fast
• def take.go
• def take.fast
• def append.fast
• def zeros.go
• def zeros.fast
• def of_string.go
• def of_string.fast
• def to_string.catthe string of xs's bytes in front of acc (structural; the laws' form)
• def to_string.go
• def to_string.fast
• def hex.cat
• def hex.go
• def hex.fast
• type Octets
• def maskmasking every element of a list to 8 bits (the list layer's view)
• def list_eq
• def mask.go
• def mask.fastmask, tail-recursive (LAWS.bend: mask_fast)
• def list_eq.go
• def list_eq.fastlist_eq, tail-recursive; every element is compared (LAWS.bend: list_eq_fast)
• def w8s.of_list
• def w8s.to_list
• def w8s.take
• def w8s.drop
• def w8s.zeros
• def w8s.at
• def w8s.rev_onto
• def w8s.of_list.go
• def w8s.of_list.fast
• def w8s.to_list.go
• def w8s.to_list.fast
• def w8s.take.go
• def w8s.take.fast
• def w8s.append.fast
• def w8s.len.go
• def w8s.len.fast
• def w8s.zeros.go
• def w8s.zeros.fast
• def w8s.eqwhether two word lists are equal; every word is compared (no early exit)
• def w8s.text.gotext and hex, built from the last byte back (rs is the string reversed)
• def w8s.hex.go
• def Octets.of_list
• def Octets.to_list
• def Octets.of_string
• def Octets.to_string
• def Octets.hex
• def Octets.empty
• def Octets.zeros
• def Octets.consa byte (the low 8 bits of b) in front of o
• def Octets.append
• def Octets.concat.refconcat as the laws state it: each piece in front of the rest
• def w8s.concat.goevery piece's words pushed, reversed, onto acc
• def Octets.concatthe pieces joined in order, tail-recursive (LAWS.bend: octets_concat_*)
• def Octets.wordsthe words of an Octets (internal; for the proofs)
• def Octets.len
• def Octets.take
• def Octets.drop
• def Octets.slicethe n bytes at offset i (fewer if o ends first)
• type OctetsSplita byte string cut in two
• def Octets.split_at.pick
• def Octets.split_atthe first n bytes and the rest, or None if o has fewer than n bytes
• def Octets.is_eq
• def Octets.at
• def Octets.le16
• def Octets.be16
• def Octets.le32
• def Octets.be32
• def Octets.le64
• def Octets.be64
• def Octets.field
• def Octets.le16_at
• def Octets.be16_at
• def Octets.le32_at
• def Octets.be32_at
• def Octets.le64_at
• def Octets.be64_at

check.bend

• def show_u32
• def show_w64
• def rampn bytes 0, 1, 2, ...
• def same_as_listthe fast Octets forms against the list layer, on a string short enough for the structural list functions
• def main