Thank you all
Really smart to use random key from the start.
I have a few questions for you @jstimps just to confirm my assumption about your gist
You get random keys in 2 steps, the first time you start from a random key as mentioned by @garrison and the second time(keys2), you use first, if not enough keys have been found
i.e
start = :crypto.strong_rand_bytes(32)
keyed_items = first_n(state.t, start, n, [])
...
case :ets.next(t, key) do
Sample from a random index in the uniform space and just scan until you hit the quota
This would not really be efficient, especially if there’s less keys in the table so at some point it’s better to start from first, right ?
i.e
keyed_items2 = if(length(keyed_items) < n, do: first_n(state.t, nil, n-length(keyed_items), []), else: [])
...
case :ets.first(t) do
