bend-collections

Releases (1)

• 1.0.0.0 indexed

Definitions (4,483)

src/containers/dynamic_array.bend

• def clear_owned
• def cons_owned
• def drain_go_owned
• def drain_len_owned
• def into_list_ownedConsumes the container; values move into the returned list, in order.
• def swap_checked_atCopyable-element exchange, used by indexed collection storage.
• def swap_at

src/containers/hash_table.bend

• type HashMap
• def size
• def tag
• def bnext
• def link
• def slot
• def short_word
• def long_word
• def is_short
• def rev_onto
• def hash_acc
• def eq_acc
• def eqString equality, handing both strings back.
• def copy_acc
• def str_copyA deep copy (sharing a String with `+` would refcount every String).
• def lw_fin
• def key_long
• type Found
• type StepLong keys: a matching word is confirmed against the slot's stored String.
• def sk_pick
• def sk_fin
• def sk_cmp
• def sk_same
• def sk_l
• def sk_empty
• def sk_w
• def step
• def find
• def probe_lw
• def probe_long
• type QStepOne-character keys: the bucket words alone decide.
• def qs_l
• def qs_same
• def qs_if
• def qs_w
• def qstep
• type QFound
• def qfind
• def q_fin
• def probe_short
• def probe_c
• def probeThe bucket holding key (link != 0) or the empty bucket ending its probe, the key as it would be stored (SNil for a one-character key), and its word.
• def put_bucket
• type RStep
• def rs_if
• def rs_w
• def rstep
• def ins_go
• def ins_rawPut (w, l) in the first empty bucket of w's probe.
• type Mv
• def mv_l
• def mv_if
• def mv_w
• def mv_step
• def mv_go
• def mv_fin
• def clear_bucket
• type Sh
• def sh_mv
• def sh_l
• def sh_if
• def sh_w
• def sh_step
• def shift
• def del_atEmpty bucket i, closing the gap behind it.
• def vacA value array of 2^d vacant cells (Array.new needs Data values).
• def new
• def grow_tabTwice the buckets, every (word, link) pair re-placed.
• type Arena
• def store
• def ins_fin
• def ins_slotThe new entry's slot s is chosen; its bucket is at (or, after growth, found anew).
• def ins_free
• def ins_fresh
• def ins_new
• def set_hit
• def set_f
• def setInsert key -> x, replacing any value already stored under key.
• def get_v
• def get_fin
• def get_hit
• def get_f
• def getThe value stored under key, or dflt (values are copied out, so V: Data).
• def has_f
• def has
• def drop_key
• def pop_v
• def pop_hit
• def pop_f
• def popRemove key, answering its value.
• def del_drop
• def del
• type Walk