bendtorch-core

Releases (1)

• 0.1.0.0 indexed

Definitions (5,204)

src/storage/api.bend

• def finish_value
• def get_checked_hit
• def read_hit
• def get_checked_miss
• def set_checked_miss
• def set_checked_hit
• def finish_owner
• def get_checked_keep
• def get_checked_stay
• def finish_pair
• def to_result
• def le_refl
• def le_add_left
• def le_add_right
• def lt_add_left
• def eq_add_cancel
• def ne_low
• def ne_high
• def offset_lt
• def same_eq
• def depth_of
• def slot_of
• def route_same
• type Effect
• def grow
• def arr
• def current
• def Valid
• def grow_balanced
• def bal
• def observe_new
• def select_pick
• def modelEvery in-bounds index has its own route, so the array after the effects answers each read with the last value written there, or the fill.
• def hit_of
• def replay_read
• def replay_size_owned
• def replay_size_empty
• def status_hit
• def replay_status
• def bounds_from
• def seek_depth
• def seek_full
• def seek_room
• def seek_fit
• def seek_double
• def seek_left
• def seek_bounds
• def limit_word
• def cap_from
• def seek
• def alloc_read
• def meta_read
• def new_read
• def alloc_size
• def meta_size
• def new_size
• def positive_of
• def new_refused
• def over_nat
• def alloc_status
• def meta_status
• def new_status
• def alloc_fits
• def meta_fits
• def new_fits

src/storage/arith.bend

• def falsity
• def clash
• def bit
• def borrow
• def add_succ
• def double_add
• def double_self
• def eq_refl
• def eq_true
• def cmp_bits
• def word_bit
• def word_cmp
• def u32_lt
• def u32_le
• def le_zero
• def le_dd
• def le_sd
• def le_ds
• def sub_wordWord.sub(a, b) is Word.adc(a, b, True, True): it adds the complement of b with an incoming carry, so a cleared carry is a borrow of one.
• def lt_le_trans
• def lt_succ

src/storage/LAWS.bend

• def second
• type Op
• def step
• def replay
• def latest
• def expected
• law new_too_large
• law new_fits
• law new_empty
• law get_outside
• law set_outside
• law replay_size
• law replay_get
• law replay_set