Twisting Pool Queue
by Leonard Ritter email@example.com, 2019-05-12
An implementation written in Scopes can be found here
We have the task of distributing IDs to objects in a pool that we can use to look up their contents. We want to ensure that:
- Insert, access, and remove are operations with O(1) complexity.
- The object array is compact, i.e. without any gaps, so we can parallelize work on it with full occupancy.