pub fn for_the_data<T>(f: impl FnOnce() -> T) -> TExpand description
Run f, which is a collection getting bigger because more was put in it.
allow with a name on it, and the name is the claim. The rule is that
nothing is proportional to the number of commands served, not that nothing
ever calls the allocator: an intset that has taken its ten thousandth member
has to have grown nine times along the way, and there is no arrangement of
that code which stores ten thousand integers in the room it had for eight.
The test is whether a workload that stops adding data stops allocating.
first_touch is the same argument for a key that was not there at all,
and this is the argument for the key that was.