Challenge-specific implementations of the same abstract base class.
Binary heap with destructive and non-destructive iterators.
Trivial Map wrappers.
Fast circular array.
Advent of Code does seem to like them.
Map wrappers. Both require a hasher function. Hash is stored in the Map's key. Original key is stored in the Map's value. HashedSet reimplements all of Sets functionality but it can be slower.
Double linked list with low overhead inserts and deletes.
You will never guess.
Simple mutex based on the functionality of async-mutex. Semaphore is a trivial Mutex wrapper.
Fast Map and Set wrappers. Both require packer and accept an optional unpacker function in order to retreive the original keys.
Also Advent of Code favourites. Class and type-only variants.