MerkleMap (merkle_map v0.2.2)

MerkleMap is a drop-in replacement for Map that optimizes certain operations, making heavy use of Merkle Trees.

Summary

Types

t()

Functions

continue_partial_diff(mm, partial, depth)
delete(mm, k)
diff_keys(mm1, mm2)
drop(mm, keys)
equal?(mm1, mm2)
fetch(mm, key)
fetch!(mm, key)
from_struct(struct)
get(mm, key, default \\ nil)
get_and_update(mm, key, fun)
get_and_update!(mm, key, fun)
get_lazy(mm, key, fun)
has_key?(merkle_map, k)
keys(mm)
merge(mm1, mm2)
merge(mm1, mm2, update_fun)
new()
new(enum)
new(enum, tform)
pop(mm, key)
pop_lazy(mm, key, fun)
prepare_partial_diff(mm, depth)
put(mm, k, v)
put_new(mm, key, value)
put_new_lazy(mm, key, fun)
replace!(mm, key, value)
split(mm1, keys)
take(mm, keys)
to_list(mm)
truncate_diff(diff, amount)

See MerkleMap.MerkleTree.Diff.truncate_diff/2.

update(mm, key, initial, fun)
update!(mm, key, fun)
update_hashes(mm)
values(mm)

Types

t()

@opaque t()

Functions

continue_partial_diff(mm, partial, depth)

delete(mm, k)

diff_keys(mm1, mm2)

drop(mm, keys)

equal?(mm1, mm2)

fetch(mm, key)

fetch!(mm, key)

from_struct(struct)

get(mm, key, default \\ nil)

get_and_update(mm, key, fun)

get_and_update!(mm, key, fun)

get_lazy(mm, key, fun)

has_key?(merkle_map, k)

keys(mm)

merge(mm1, mm2)

merge(mm1, mm2, update_fun)

new()

new(enum)

new(enum, tform)

pop(mm, key)

pop_lazy(mm, key, fun)

prepare_partial_diff(mm, depth)

put(mm, k, v)

put_new(mm, key, value)

put_new_lazy(mm, key, fun)

replace!(mm, key, value)

split(mm1, keys)

take(mm, keys)

to_list(mm)

truncate_diff(diff, amount)

See MerkleMap.MerkleTree.Diff.truncate_diff/2.

update(mm, key, initial, fun)

update!(mm, key, fun)

update_hashes(mm)

values(mm)