InPlace.BitSet (inplace v0.7.1)

Copy Markdown

BitSet is close in functionality to MapSet with integer values as members. The main difference is that BitSet has lower and upper bounds for set values that have to be defined at the time of creation (see new/2).

Summary

Functions

compute_offset(lower_bound)

delete(set, element)

difference(set1, set2)

disjoint?(set1, set2)

disjoint_v1?(set1, set2)

disjoint_v2?(set1, set2)

empty?(set)

empty_set()

equal?(set1, set2)

filter(set, filter_fun)

get_matching_value(set, block_idx, int, bit_shift)

intersection(set1, set2)

intersection_v1(set1, set2)

intersection_v2(set1, set2)

iterate(set, acc, reducer)

max(set)

member?(set, element)

min(set)

new(list)

new(lower_bound, upper_bound)

next(set, element)

put(set, element)

reduce(set, acc, reducer)

size(set)

subset?(set1, set2)

symmetric_difference(set1, set2)

to_list(set)

union(set1, set2)

union_v1(set1, set2)

union_v2(set1, set2)

update_block(intersection_set, block_idx, content, min_value_set?)

value_address(value)

value_address(set, value)

value_at_position(set, arg)

value_at_position(set, block_idx, block_offset)

value_to_offset(offset, value)