bend-osdev-algo
Search uses release 0.1.0.0 · 367 definitions
Definitions (367)
- law popcount_le
- law popcount_not
- law first_set_is_set
- law first_set_lowest
- law first_set_none
- law last_set_is_set
- law last_set_highest
- law last_set_none
- law ctz_first_set
- law clz_last_set
- law first_le_last
- law ctz_clz
- law popcount64_le
- law first_set64_is_set
- law first_set64_lowest
- law first_set64_none
- law last_set64_is_set
- law last_set64_highest
- law ctz64_first_set
- law clz64_last_set
- law ctz_clz64
- law next_set_le_size
- law next_set_is_set
- law next_set_at_least
- law next_set_none_before
- law next_clear_le_size
- law next_clear_is_clear
- law next_clear_at_least
- law next_clear_none_before
- law lower_bound_le_length
- law lower_bound_below
- law lower_bound_above
- law find_some
- law find_none
- def algo_index_nat
- law array_lower_bound_list
- law array_lower_bound_same
- law array_find_list
- law array_find_same
- law vec_popcount
- law vec_zero
- law vec_forty
- law vec_top
- law vec64_halves
- law vec64_zero
- law vec_next_set
- law vec_next_set_none
- law vec_next_clear
- law vec_next_past_size
- law vec_lower_bound
- law vec_array_lower_boundthe array [1, 3, 3, 7, 9, 0, 0, 0], searched in its first 5 slots
- law vec_array_lower_bound_end
- law vec_array_find
- law vec_array_find_none
- law wit_first_lastfirst_set and last_set answer Some (40 = 0b101000: bits 3 and 5), with a j below and above; and None for zero
- law wit_first_last64
- law wit_nextan answer below the size, and a j with start <= j < answer
- law wit_bsearcha sorted list; an element before the lower bound of 7 (index 1) and one from it on (index 4); find answering Some and None
- law wit_array_bsearchthe array [1, 3, 3, 7, 9, 0, 0, 0] (depth 3), searched in its first 5 slots: perfect, of depth below 32, 5 <= 2^3, and those slots sorted