This package naively implements the data structure described in Invertible Bloom Lookup Tables by Goodrich & Mitzenmacher.
The examples in this file are run as the package's test suite.
Initialization
var IBLT = var m = 10 var table = m: m hashes: single double triple var murmur = v3 { return % m} { return % m} { return % m}
Insert, Get, Delete
tabletabletable var assert = assertassertassert table assert
Clone and List Entries
var clone = table var entries = table // destructive
Cells
var cells = cloneT