Changes for version 0.04 - 2026-09-11
- Add Shared::Arena::HyperLogLog, how many distinct keys in a few kilobytes: an add is a lock-free max, so a pool shares one sketch with nothing to contend on, and two sketches merge into their union.
- ABI version 3.
- FIXES two smoker FAILs on a two-processor box. t/22-cache.t let children churn while a sibling was still reading; they now wait until every read is reported. t/08-mpsc.t asserted the READER saw several children, which needs the parent scheduled mid-storm; it now asserts the children's sequence ranges overlapped.
Modules
memory two processes can both read, without a syscall
a shared set that answers "no" exactly and "yes" probably
a shared cache that evicts instead of refusing
how often a key has been seen, in fixed space
a shared set that answers "no" exactly, "yes" probably, and can forget
one structure, published once and read in place by every process
read a published block without copying it
a distribution every process adds to at once
how many distinct, in a few kilobytes
one holder at a time, and a successor when it dies
a fixed-capacity map several processes share
a token bucket per key, shared by every worker
a record queue several processes can write at once
one reader's position in a ring
one record to one member of the pool
one row per worker, published live