InPlace.BitSet (inplace v0.6.5)

Copy Markdown

BitSet is close in functionality to MapSet with integer values a s 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

delete(set, element)
difference(set1, set2)
disjoint?(set1, set2)
empty?(set)
equal?(set1, set2)
filter(set, filter_fun)
intersection(set1, set2)
iterate(set, acc, reducer)
max(set)
member?(set, element)
min(set)
new(lower_bound, upper_bound)
next(set, element)
next_position(set, value_position)

Find next position for {block_idx, block_offset}

next_position(set, block_idx, block_offset)
next_position(set, block_idx, block_offset, block_value)
next_position_impl(set, block_idx, block_offset, block_value)
put(set, element)
reduce(set, acc, reducer)
size(set)
subset?(set1, set2)
symmetric_difference(set1, set2)
to_list(set)
union(set1, set2)
value_address(value)
value_at_position(set, arg)
value_at_position(set, block_idx, block_offset)

Functions

delete(set, element)

difference(set1, set2)

disjoint?(set1, set2)

empty?(set)

equal?(set1, set2)

filter(set, filter_fun)

intersection(set1, set2)

iterate(set, acc, reducer)

max(set)

member?(set, element)

min(set)

new(lower_bound, upper_bound)

next(set, element)

next_position(set, value_position)

Find next position for {block_idx, block_offset}

next_position(set, block_idx, block_offset)

next_position(set, block_idx, block_offset, block_value)

next_position_impl(set, block_idx, block_offset, block_value)

put(set, element)

reduce(set, acc, reducer)

size(set)

subset?(set1, set2)

symmetric_difference(set1, set2)

to_list(set)

union(set1, set2)

value_address(value)

value_at_position(set, arg)

value_at_position(set, block_idx, block_offset)