wip-442: Token aware writes

Add the following facts to the comment:
1. The design is based on a cyclic-buffer (this one is particularly important to understand the implementation)
2. The capacity of the queue is constant (growing not possible). Adding more elements than capacity will cause IllegalStateException.
3. The queue is *not* thread safe.
4. Appending an element to the end of the queue is O(1) operation, as long as it is smaller than all the elements already in the queue.
5. Updating an element is O(k), where k is the number of positions changed.
6. Adding/updating an element is O(n) worst-case.