lawful-bytes
Releases (2)
Definitions (578)
proof_fast_w2.bend
- law e_loA byte below the start: set to 0xFF, never zero.
- def R4run_len over the four byte tests of a word.
- law bt_none
- law bt_bidx
- law bt2_none
- law bt2_bidx
proof_fast_word.bend
- def P0The place of the first zero byte of v (4 when there is none).
- law tko1The k = 1 test of the or of two flag words.
- law tko2The k = 2 test of the or of two flag words.
- law tko3The k = 3 test of the or of two flag words.
- law zb_noneThe zero-byte flags are all clear exactly when no byte is zero.
- law zb_bidxbidx finds the first zero byte.
- law zb2_noneThe same for the flags of two words or-ed (find2).
- law zb2_bidx
- law p0_xorSearching w for c is searching w xor rep(c) for a zero byte.
- law plk0
- law plk1
- law plk2
- law plk3
- law plThe first word for a start place a (0 to 3, given as r).
- law p0_lowThe first word of a search: the bytes below i's place are set to 0xFF, so the first zero byte is the first c at or above that place.
proof_find.bend
- def is_some_t
- law none_ne_some
- law drop_zero
- law drop_consDropping j elements from a list with x at j leaves x in front.
- law slice_cons
- law lt_add_succ
- law add11(j + 1) + 1 is j + 2, for every word j (no range needed: through from_nat).
- law fgo_pair
- law find_pair_t
- law fgo2_pair
- law find2_pair_t
- law step_ltWith j + 1 + k = to <= len, byte j is in range.
- law step_lt4
- law step_get
- law step_n
- law fgo_viewhit says byte j is c, r holds byte j + 1, j + n = to.
- law le_ftfrom <= to as numbers.
- law find_view_t
- law fgo2_viewhit says byte j is c1 or c2, r holds byte j + 1, j + n = to.
- law find2_view_t
proof_grow.bend
- def tnewA new block as a tree.
- law tnew_eq
- law tnew_full
- law empty_eq
- law empty_view
- law empty_ok
- law append_nil
- law app_snoc
- law ol_roomRoom for one more byte when the rest of the list still fits.
- law ol_restThe rest still fits after the push.
- law ol_go_view
- law ol_go_ok
- law of_list_view
- law of_list_ok
- def gtreeThe tree grow.go builds from td: words i ..
- law ggo
- law grow_eq
- law gfull
- def mtag
- law take_succ_get
- law take_all
- law utOnly the first q words matter for the first m <= 4q bytes.
- law ginvWriting word i keeps the copied prefix and extends it by one word.
- law gtakeThe loop copies words i ..
- law grow_view_t
- law grow_ok_t
proof_list.bend
- law pl_ft
- law pl_tf
- law pl_lt0k < 0 is impossible.
- law pl_and_l
- law pl_and_r
- law pl_le0_and0 <= n, inside a conjunction.
- law pl_u32_eq_refl
- law pl_r_step_le
- law pl_r_leThe run is no longer than the prefix.
- law pl_r_hit_step
- law pl_r_hitShort of the end, the run stops at a c.
- law pl_r_miss_step
- law pl_r_missBefore the end of the run, no c.
- law first_range
- law first_hitBelow to, the answer holds c.
- law first_missNo index from from up to the answer holds c.
- law list_eq_true
- law list_eq_refl
- law pl_r2_le
- law pl_r2_hit_step
- law pl_r2_hit
- law pl_r2_miss_step
- law pl_r2_miss
- law first2_range
- law first2_hit
- law first2_miss
proof_ops.bend
- law ulenThe bytes in use fit in the block.
- law view_size_t
- law view_bytes_t
- law cap_ok_t
- law set_eq_t
- law set_view_t
- law set_ok_t