bend-collections

Releases (1)

• 1.0.0.0 indexed

Definitions (4,483)

src/containers/binary_heap.bend

• def drain_mb
• def drain_last
• def drain_root
• def drain_take
• def drain_take_goTake the root out of a copy holding `n` elements.
• def drain_probe
• def drain_go
• def sorted_of
• def to_sorted_list
• def obs_nat
• def obs_item
• def obs_list
• def drop_heap
• def replaceFromList replaces the heap: the old block is dropped (O(1) erasure).
• def step
• def record
• def step_acc
• def run_acc
• def finish
• def run
• def run_u32
• def run_string

src/containers/bitlist.bend

• type Bitlist
• def new
• def with_limit
• def belowRoom for one more bit under the limit.
• def length
• def limit
• def get_word
• def get_if
• def get
• def assign_set
• def assign_wordRewrite bit i of its word (the word read is r); the list gets length n.
• def assign_if
• def assign
• def set
• def unset
• def push_new
• def push_inBit n already lies in a stored word, where it is zero (masked tail).
• def push_where
• def push_room
• def push_if
• def push
• def pop_set
• def pop_bitThe last bit b of word x: a set bit is cleared so the tail stays zero.
• def pop_word
• def pop_at
• def pop
• def clear
• def count_add
• def count_go
• def count_fin
• def count_len
• def count
• def word_bitsThe low m bits of x, bit 0 first, in front of rest.
• def bits_addWord q holds bits 32q ..
• def bits_goThe first n bits, emitted from the last stored word down to word 0.
• def to_list_fin
• def to_list_len
• def to_list
• def from_push
• def from_go
• def from_boolsThe bits of bs, in order, in an unbounded bitlist.
• def obs_nat
• def obs_bit
• def obs_unit
• def obs_limit
• def obs_bits
• def step
• def record
• def run_acc
• def finish
• def run

src/containers/bitset.bend

• type Wd
• type Bitset
• def wval
• type WordOp
• def low
• def word_get
• def word_put
• def word_op
• def bit_value
• def word_countNumber of set bits among the low m bits of w.
• def member_pick
• def word_membersIndices (from off) of set bits among the low m bits of w, then rest.
• def wordixThe word index of bit i and the bit position inside that word.
• def bitix
• def pow22^d.
• def max_depth2^31 words = 2^36 bits: the capacity of the packed representation (the constant is never materialised as a value; `depth_for` simply stops at this depth).
• def depth_goThe smallest depth whose 2^depth words hold n bits, capped at max_depth.
• def depth_for
• def read_fin
• def readWord q of the array (q < 2^depth).
• def writeReplace word q.
• def new_atAll-zero bitset of logical size n (see the capacity note).
• def new
• def length
• def get_read
• def get_if
• def get