1048576
!
?a=JJj"T
߸ )F
Index of /FSS-BCZ/root/opt/alt/python-internal/lib64/python3.11/importlib
Index of /FSS-BCZ/root/opt/alt/python-internal/lib64/python3.11/importlib
$ laTX%^Tţ
@ÿ +J a
`]_/ @ sr d dl mZmZ d dlmZmZ d dlmZ d dlm Z G dd de
Z e e e e d
d d
Z
d d ZdS ) )SequenceHashable)islicechain)Integral)plistc s( e Zd ZdZdZd= fdd Zedd Zedd Ze d
d Z
d d
Z dd Z e Z
edd Zd>ddZd?ddZe dd Zdd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& Zd'd( Ze d)d* Zd+d, Zd-d. Z d/d0 Z d1d2 Z d3d4 Z d5d6 Z e Z!d7d8 Z"d9d: Z#d;d< Z$e%j&Z& Z'S )@PDequea
Persistent double ended queue (deque). Allows quick appends and pops in both ends. Implemented
using two persistent lists.
A maximum length can be specified to create a bounded queue.
Fully supports the Sequence and Hashable protocols including indexing and slicing but
if you need fast random access go for the PVector instead.
Do not instantiate directly, instead use the factory functions :py:func:`dq` or :py:func:`pdeque` to
crea