bend-collections

Releases (1)

• 1.0.0.0 indexed

Definitions (4,483)

src/containers/internal/intrusive_list.bend

• def foreach_remove_convert_filter
• def visit_true
• def foreach_remove_convert_as
• def foreach_remove_convert
• def last_fold
• def last
• def mapped_cons
• def map_step_4
• def map_step_3
• def map_step_2
• def map_step_1
• def map_step
• def map_loop
• def map_last
• def flat_map_to_list
• def map_some_result
• def map_to_list
• def to_list
• def append_node
• def build_step_1
• def build_step
• def build_loop
• def from_values
• def from_nodes
• def mapped_factory_1
• def mapped_factory
• def map_from_values
• def map_from_nodes
• def pool_free
• def pool_take_1
• def pool_take
• def pool_fresh_1
• def pool_fresh
• def pool_next
• def pool_grow_step_1
• def pool_grow_step
• def pool_grow
• def pool_new_1
• def pool_new
• def new_node

src/containers/intrusive_doubly_linked_list.bend

• def nextRead the next identity without changing membership.
• def prevRead the previous identity without changing membership.
• def valueObserve a Data value (often the entity identity); payload ownership stays in S.
• def get_headRead a root; requires no writer context.
• def removeDetach a known member in O(1).
• def prepend_asPrepend a detached node in O(1), using separate read/write contexts.
• def prependPrepend with the same context used to read and write the root.
• def is_emptyO(1) empty-root query.
• def non_emptyO(1) nonempty-root query.
• def at_least_twoO(1) query: head exists and has a successor.
• def fold_leftForward fold, saving next before each callback.
• def foreachForward visit, saving next before each callback; removing current is supported.
• def findReturn the first matching node identity; next is read after a failed predicate.
• def find_some_thisCompatibility alias of find; Bend needs no preallocated Option wrapper.
• def existsShort-circuit on the first true predicate; False for an empty list.
• def forallShort-circuit on the first false predicate; True for an empty list.
• def countCount matching values; read next after each predicate.
• def lengthCount members in O(n); no cached count is required in the root.
• def find_convertConvert once per visited value, skip failed conversions, return the original node.
• def find_valueFind with eq(wanted, observed_value), returning the node identity.
• def find_value_convertFind with eq(converted_value, wanted), returning the original node.
• def clear_list_asPreflight the bound, publish an empty root, detach suffix then original head.
• def clear_listClear using one root context; see clear_list_as for callback order.
• def clear_list_with_pool_asClear using a callback that returns each detached node to an application pool.
• def clear_list_with_poolClear to a pool using one root context.
• def foreach_remove_filter_asKeep true values, detach false values, then call post_remove on the removed node.
• def foreach_remove_filterRemoval filter with one root context.
• def foreach_remove_convert_filter_asRemove failed conversions and false predicates; convert each visited value once.
• def foreach_remove_convert_filterConversion/removal filter with one root context.
• def foreach_remove_convert_asVisit successfully converted values, remove failed conversions.
• def foreach_remove_convertConversion/removal visitor with one root context.
• def flat_map_to_listOption filter-map: zero or one output per input.
• def map_to_listAllocate a result list in forward order; evaluate callbacks tail to head.
• def to_listAllocate an owning list of observed values in forward order.
• def from_valuesBuild from values in forward order using an application factory; return the head.
• def from_nodesLink distinct detached nodes in input order; return the head without allocating nodes.
• def map_from_valuesConvert then construct each node, both in forward order; return the head.
• def map_from_nodesMap each input to a detached node in forward order; return the head.
• def pool_freePush a detached node onto the LIFO pool; leave its payload unchanged.
• def pool_nextPop and clear the next link, or call make only when empty.
• def pool_newConstruct max(size, 1) nodes in a LIFO pool, using the application factory.
• def new_nodeOptional detached value wrapper.

src/containers/intrusive_links.bend

• type LinksA ready-made link table for the intrusive list: entity ids are U32 values 1 ..
• def new
• def decode_pick
• def decode
• def encode
• def next_got
• def prev_got
• def head_got
• def next
• def prev
• def get_head
• def set_next
• def set_prev
• def set_head
• def set_head_nonempty
• def removeDetach member n of root r in O(1).
• def prependLink detached entity n at the front of root r in O(1).

src/containers/lru.bend

• def pick