bend-collections

Releases (1)

• 1.0.0.0 indexed

Definitions (4,483)

src/containers/bitset.bend

• def assign_read
• def assign_if
• def assign
• def setSet bit i to 1.
• def clearSet bit i to 0.
• def bv8Sum of the populations of words q, q+1, ...
• def word_count_8
• def count_wordA zero word contributes nothing and is skipped.
• def count_add
• def count_go
• def count_fin
• def count
• def word_descIndices of set bits, ascending.
• def members_wordA zero word has no members and is skipped.
• def members_cons
• def members_go
• def members_fin
• def to_list
• def zip_write
• def zip_step
• def zip_go
• def burn_listDiscard a linear array (`dispose` below is the public form).
• def burnReleasing the word array is dropping it: `Base.Array` is linear, so the runtime frees the block when the last reference is erased.
• def disposeRelease a bitset.
• def clone_finTwo independent bitsets with the same contents (the linear form of sharing).
• def clone
• def dispose2_goRelease two bitsets.
• def dispose2
• def zip_fin
• def combine_if
• def combine_b
• def combineThe operands are given back unchanged apart from the result written into the left one: a linear API has to return what it borrowed.
• def union
• def intersection
• def difference
• def xor
• def fill_drop
• def fill_set
• def fill_pick
• def fill
• def bool_count
• def from_boolsBitset whose logical bits are exactly bs (bit 0 first).
• def drop_right_go
• def drop_right
• def comb_go
• def comb_bits
• def obs_unit
• def obs_pair_done
• def obs_pairThe trace runner owns the operand it built from the operation, so it releases it once the combination has been applied.
• def obs_bit
• def obs_nat
• def obs_list
• def step
• def record
• def step_acc
• def run_acc
• def finish
• def run

src/containers/deque.bend

• type DequeTwo-list deque: logical order is front ++ reverse(back).
• def new
• def length
• def push_front
• def push_back
• def split_consOne split traversal; keep the near half, reverse the far half.
• def split
• def front_split
• def back_split
• def move_front
• def move_back
• def ready_front
• def ready_back
• def pop_front_ready
• def pop_back_ready
• def peek_front_ready
• def peek_back_ready
• def pop_front
• def pop_back
• def peek_front
• def peek_back
• def to_list
• def obs_nat
• def obs_item
• def obs_list
• def step
• def record
• def step_acc
• def run_accRuns ops left to right; observations are accumulated newest-first.
• def finish
• def runFinal state and the observation of every operation, in order.

src/containers/dlist_iterator.bend

• def choose
• type ErrorOwning, bidirectional gap cursor.
• type Iterator
• def endpointCursor links are arena indices plus one; zero is the gap past the end.
• def first_result
• def iter_first
• def last_result
• def iter_last
• def finish
• def present
• def has_next