Add an array-based bounded queue

[mwermelinger]

A bounded queue has a fixed capacity (maximum number of members). When the capacity is reached, the queue is full and no further items can be enqueued. A bounded queue can be implemented with a .

In file queue.py:

• Create a class StaticArrayQueue as a copy of LinkedListQueue.
• Add the new class to the __all__ list.
• Update the docstring of the new class, including the doctest.
• In method __init__, add an integer parameter capacity. Raise ValueError if capacity is negative or smaller than the length of parameter sequence. Update the class's doctest to use this parameter.
• Change the implementation of all methods to use a static array (fixed-length Python list) as circular buffer instead of a linked list.
• Add a new method capacity that returns the fixed length of the array. Use this method in the doctest.
• Change method enqueue to raise ValueError when the stack is full. Update the docstring accordingly.

In file tests/test_queue.py:

• Add StaticArrayQueue to the import statement (line 7), the type definition (line 11) and the Queue fixture (line 27)
• Betweentest_enqueue and test_dequeue, add a function test_enqueue_full(sequence: Sequence) that tests that enqueuing doesn't change the queue's capacity and that ValueError is raised when enqueuing on a full queue. (See the check_is_empty function for how to do that.)