Package-level declarations

Provides a basic implementation of an intrusive circular doubly linked non-thread safe list. Allows for efficient insertion or removal of elements from any position in the list, as the nodes are not stored contiguously in memory (unlike an array).

A ring buffer implementation that allows for a fixed-size buffer to be used as a sliding window. The buffer is circular and will overwrite the oldest elements when full.