BeTddlmZddlmZmZddlmZddlmZGddeeZ y)) annotations)IterableIterator) MutableSet)TcveZdZUdZded<dZdddZddZddZddZ dd Z dd Z dd Z dd Z dd ZeZddZy)InsertionSortedSetzA set-like that retains insertion order, like a dict. Thread-safe. Equality does not compare order or class, but only compares against the contents of any other set-like, coherently with dict and the AbstractSet design. z dict[T, None]_dr c8tj||_yN)dictfromkeysr )selfothers *lib/python3.12/site-packages/zict/utils.py__init__zInsertionSortedSet.__init__s--&c||jvSr r )ritems r __contains__zInsertionSortedSet.__contains__stwwrc,t|jSr )iterr rs r__iter__zInsertionSortedSet.__iter__sDGG}rc,t|jSr )lenr rs r__len__zInsertionSortedSet.__len__s477|rc"d|j|<y)zoAdd element to the set. If the element is already in the set, retain original insertion order. Nr rvalues raddzInsertionSortedSet.addsrc> |j|=y#t$rYywxYwr )r KeyErrorr s rdiscardzInsertionSortedSet.discard%s$    s  c|j|=yr r r s rremovezInsertionSortedSet.remove,s GGENrc tt|j}|j|=|S#t$r t dtt f$rYSwxYw)z(Pop the oldest-inserted key from the setzpop from an empty set)nextrr StopIterationr$ RuntimeErrorr s rpopleftzInsertionSortedSet.popleft/sW T$'']+GGEN   8677l+  s,0"AAc<|jjdS)z(Pop the latest-inserted key from the setr)r popitemrs rpoprightzInsertionSortedSet.popright<sww ##rc8|jjyr )r clearrs rr1zInsertionSortedSet.clearBs  rN))rz Iterable[T]returnNone)robjectr3bool)r3z Iterator[T])r3int)r!rr3r4)r3r)r3r4)__name__ __module__ __qualname____doc____annotations__ __slots__rrrrr"r%r'r,r/popr1r2rrr r sM I'  $ Crr N) __future__rcollections.abcrrtypingr zict.commonrr r2rrrCs!".:A:r