Implements a lock-free sliding window using a single linked list, represented by a head and a tail reference.

The idea is to initialize the list to the window size, where node N represents the stats for the N-th entry. Besides the stats for the N-th entry, it also contains the stats for the whole window, which are carried over on each new added entry.

When a new record is added, the size of the window is maintained:

1. A new node is added at the tail of the list.
2. The head of the list is moved to the next node.
3. The tail of the list is moved to the next node.

As these operations need to happen atomically, we use the VarHandle API to perform CAS operations on the head, tail and next references. However, these updates are not atomically happening across these references, so we can end up that each reference is updated by a different thread.

The algorithm is based on the following conditions:

• if there is no next node -> try to add one
• else, if the head and tail represent the same N-th stats -> advance the head
• else -> advance the tail

All these operations are done via compare-and-swap operations.