In the recent post by Rob Pike, specifically in the garbage collection
I'm having trouble understanding this sectio:
*"As a more direct example, in Go it is easy and efficient to provide
second-order allocators, for instance an arena allocator that allocates a
large array of structs and links them together with a free list. Libraries
that repeatedly use many small structures like this can, with modest
prearrangement, generate no garbage yet be efficient and responsive."*
Can anyone give an example / explanation of this?