bend-collections

Releases (1)

• 1.0.0.0 indexed

Definitions (4,483)

src/containers/balanced_search_tree.bend

• def delete_sibling_right_2
• def insert_fix_step_1
• def delete_sibling_left_1
• def delete_sibling_right_1
• def insert_fix_step
• def delete_sibling_left
• def delete_sibling_right
• def insert_fix_loop
• def delete_red_sibling_left
• def delete_red_sibling_right
• def insert_fixed
• def delete_side_left_1
• def delete_side_right_1
• def put_allocated
• def delete_side_left
• def delete_side_right
• def put_found
• def delete_side
• def put_absent_found
• def put
• def delete_stop
• def put_if_absent
• def delete_fix_step_3
• def view_put_checked
• def delete_fix_step_2
• def view_put
• def delete_fix_step_1
• def delete_fix_step
• def delete_fix_loop
• def delete_repair
• def unlink_2
• def unlink_1
• def unlink
• def unlink_target
• def remove_present_1
• def remove_present
• def remove_id
• def remove_found
• def remove_entry_id_1
• def iterator_delete_1
• def remove_if_apply
• def remove
• def remove_entry_id
• def iterator_delete
• def remove_if_value
• def poll_ready
• def view_remove_checked
• def iterator_remove
• def remove_if_found
• def poll_first_entry
• def poll_last_entry
• def view_remove
• def remove_if_equal
• def view_clear_loop
• def view_clear

src/containers/binary_heap.bend

• type Heap
• def max_depth
• def le
• def empty_slots
• def new
• def length
• def slot_orThe slot value, with a default that a well-formed heap never needs (every index a sift loop reads is inside [0, size), where the slot is Some).
• def item_of
• type Up
• def parentThe parent index of i (i > 0).
• def up_dec
• def up_mb
• def up_slot
• def up_root
• def up_probeWhere the value x, currently destined for slot i, must go next.
• def up_go
• def sift_upPlace x at slot i and restore heap order upwards (fuel bounds the climb).
• type Down
• def down_dec
• def down_two
• def down_rmb
• def down_rslot
• def down_lmb
• def down_lslot
• def down_has
• def down_probeWhere the value x, currently destined for slot i of a heap of `size` elements, must go next.
• def down_go
• def sift_downPlace x at slot i of a heap of `size` elements and restore heap order down.
• def grownDoubling: the old block becomes the lower half of a block one level deeper, so every element keeps its index.
• def push_room
• def push
• def peek_found
• def peek_go
• def peek
• def pop_moveThe last element has been taken out of slot m = n - 1; put it at the root and sift it down over the remaining m elements.
• def pop_last
• def pop_withThe last element is READ, not cleared: the invariant says nothing about the slots above the size, so clearing it would be one array write per pop that the algorithm does not need (the C reference does not do it either).
• def pop_root
• def pop_go
• def pop
• def from_list_go
• def from_list
• type Drain
• def burnDropping the (linear) block is O(1): the runtime erases it.
• def burn_cons