Creating a circular buffer with overwrite on FIFO principle

It is necessary to develop a data structure — a fixed-size circular buffer operating on the FIFO (First In, First Out) principle. Main properties:

• Has a predefined capacity that cannot be changed after creation;
• When full, new elements replace the oldest ones, maintaining the queue order.