I read in the python time complexity page(https://wiki.python.org/moin/TimeComplexity) and I quote it -"A deque (double-ended queue) is represented internally as a doubly linked list. (Well, a list of arrays rather than objects, for greater efficiency.) Both ends are accessible, but even looking at the middle is slow, and adding to or removing from the middle is slower still". I don't understand the meaning of, 'list of arrays rather than objects', how it is related to doubly linked list? Is the implementation of deque exactly like doubly linked list, it will be useful if any more detail can be provided on it's implementation.

I read in the Python time complexity page:

A deque (double-ended queue) is represented internally as a doubly linked list. (Well, a list of arrays rather than objects, for greater efficiency.) Both ends are accessible, but even looking at the middle is slow, and adding to or removing from the middle is slower still.

I don't understand the meaning of, 'list of arrays rather than objects', how it is related to a doubly linked list? Is the implementation of deque exactly like a doubly linked list, it will be useful if any more detail can be provided on its implementation.