lawful-bytes
Search uses release 0.1.1.0 · 578 definitions
Definitions (578)
- def FG
- law fg_eq
- def M0The mask of the first word.
- law fast_eqfast find on the mirror: the same Bytes, and the min of the loop's answer with to.
- law drop_append_l
- law drop_unpack
- law drop_wordByte 4q + o onwards: the rest of word q, then the words after it.
- def hd_eqWhether the head of a list is c.
- law run_hitA hit inside xs: the first c of take(xs ++ ys, n) is at min(run, n).
- law run_skipNo c in xs, and n reaches past it: the search goes on in ys.
- law run_noneNo c in xs, and n stays within it.
- law run_le
- law min_shift
- law le_cancel
- law lt_cancel
- law sub_sub
- law mul4s
- law wltWord index bounds: the words searched lie inside the block.
- law wb4
- law not0The loop's "no hit" answer 4294967295 is above every length.
- law min_r
- def gtop.go
- law gtopWith the bound m abstract (m stands for 2^32).
- law top_nat
- law is_lt_top
- law min_top
- def UBAll the block's bytes, the start of a search inside word wi (o bytes in), the rest of that word, and the bytes from the next word on.
- def SS
- def AW
- def BW
- law shl2
- law dw
- law awl
- law fhitThe flagged word: the answer is the first c from the start, or to.
- law nohit_runAn unflagged word has no c from the start on.
- law pow_le4
- law fnone0The last word, unflagged: the answer is to.
- law fskipAn unflagged word that is not the last: the search goes on at the next word.
- law hv0The first byte of the next word starts a fresh search.
- law fiThe loop invariant, for 1 + k words left (wi's included): the answer, capped at to, is the first c from the start o bytes into word wi.
- law slice_take
- law le_antisym
- law lt_add_l
- law div_le4
- law last_ltThe last word holds byte to - 1: 4E < to <= 4E + 4 for E = (to - 1) / 4.
- law last_le
- law lt_sub1
- law div_self_le
- law sub1_lt
- law fview_ltfrom < to: the loop runs 1 + k0 words, from word from >> 2 to word (to - 1) >> 2.
- law fview_goThe answer as a number, split on to <= from (no words: the answer is to = from).
- law fast_find_tfast find equals the reference find, Bytes included.
- law wand_assoc
- law uand_assoc
- law zb_eqfast.bend's zb is lawful-words' zb.
- law zbk_byteWith no borrow in and the byte's flag kept by the mask, the masked flags are all clear exactly when the byte is not zero and the rest are clear.
- law tkw1The flags of the low 1 byte(s), as words of four bytes.
- law tkw2The flags of the low 2 byte(s), as words of four bytes.
- law tkw3The flags of the low 3 byte(s), as words of four bytes.
- law tk1
- law tk2
- law tk3