§ ¢[e‡مَb—ddlmZddlmZmZddlmZddlmZGd„dee¦«Z dS)é)عannotations)عIterableعIterator)ع MutableSet)عTcَx—eZdZUdZded<dZddd „Zdd„Zdd„Zd d„Z d!d„Z d!d„Zd!d„Zd"d„Z d"d„ZeZd#d„ZdS)$عInsertionSortedSetzéA 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]ع_d©r ©عotherْIterable[T]عreturnعNonecَD—t |¦«|_dS©N)عdictعfromkeysr )عselfr s ْ*lib/python3.11/site-packages/zict/utils.pyع__init__zInsertionSortedSet.__init__s€ف—-’- ر&ش&ˆŒˆˆَعitemعobjectعboolcَ—||jvSrr)rrs rع__contains__zInsertionSortedSet.__contains__s€طگt”wˆذrْIterator[T]cَ*—t|j¦«Sr)عiterr ©rs rع__iter__zInsertionSortedSet.__iter__s€فگD”G‰}Œ}ذrعintcَ*—t|j¦«Sr)عlenr r!s rع__len__zInsertionSortedSet.__len__s€فگ4”7‰|Œ|ذrعvaluercَ—d|j|<dS)zoAdd element to the set. If the element is already in the set, retain original insertion order. Nr©rr's rعaddzInsertionSortedSet.adds€ًˆŒگ‰ˆˆrcَ:— |j|=dS#t$rYdSwxYwr)r عKeyErrorr)s rعdiscardzInsertionSortedSet.discard%s6€ً ط”کگگگّفً ً ً طˆDˆDً ّّّs‚Œ ™cَ—|j|=dSrrr)s rعremovezInsertionSortedSet.remove,s€طŒGگEˆNˆNˆNrcَ؛— tt|j¦«¦«}|j|=|S#t$rt d¦«‚tt f$rYŒXwxYw)z(Pop the oldest-inserted key from the setTzpop from an empty set)عnextr r ع StopIterationr,عRuntimeErrorr)s rعpopleftzInsertionSortedSet.popleft/su€ً ً ف‌T $¤'™]œ]ر+ش+گط”GکEگNطگّف ً 8ً 8ً 8فذ6ر7ش7ذ7ف‌lذ+ً ً ً àگً ّّّsƒ*.®)AءAcَ@—|j ¦«dS)z(Pop the latest-inserted key from the setr)r عpopitemr!s rعpoprightzInsertionSortedSet.popright<s€àŒwڈٹر ش ش#ذ#rcَ8—|j ¦«dSr)r عclearr!s rr9zInsertionSortedSet.clearBs€طŒڈ ٹ ‰ŒˆˆˆrN)r)r rrr)rrrr)rr)rr#)r'rrr)rr)rr)ع__name__ع __module__ع__qualname__ع__doc__ع__annotations__ع __slots__rrr"r&r*r-r/r4r7عpopr9rrrr r s€€€€€€ًًًذذرط€Iً'ً'ً'ً'ً'ًًًًًًًًًًًًًًًًًًًًًًًًًًًًً$ً$ً$ً$ً€Cًًًًًًrr N) ع __future__rعcollections.abcrrعtypingrعzict.commonrr rrrْrEs‹ًط"ذ"ذ"ذ"ذ"ذ"à.ذ.ذ.ذ.ذ.ذ.ذ.ذ.طذذذذذàذذذذذً:ً:ً:ً:ً:ک Aœٌ:ô:ً:ً:ً:r