U ®ª/e‡ã@sLddlmZddlmZmZddlmZddlmZGdd„deeƒZ dS)é)Úannotations)ÚIterableÚIterator)Ú MutableSet)ÚTc@sºeZdZUdZded<dZd&dddœd d „Zddd œdd„Zddœdd„Zddœdd„Z dddœdd„Z dddœdd„Zdddœdd„Zddœdd „Z ddœd!d"„ZeZddœd#d$„Zd%S)'Ú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©zIterable[T]ÚNone)ÚotherÚreturncCst |¡|_dS©N)ÚdictÚfromkeysr)Úselfrr r ú./tmp/pip-unpacked-wheel-z3s6s24u/zict/utils.pyÚ__init__szInsertionSortedSet.__init__ÚobjectÚbool)Úitemr cCs ||jkSrr )rrr r rÚ__contains__szInsertionSortedSet.__contains__zIterator[T])r cCs t|jƒSr)Úiterr©rr r rÚ__iter__szInsertionSortedSet.__iter__ÚintcCs t|jƒSr)Úlenrrr r rÚ__len__szInsertionSortedSet.__len__r)Úvaluer cCsd|j|<dS)zoAdd element to the set. If the element is already in the set, retain original insertion order. Nr ©rrr r rÚaddszInsertionSortedSet.addcCs&z|j|=Wntk r YnXdSr)rÚKeyErrorrr r rÚdiscard%szInsertionSortedSet.discardcCs|j|=dSrr rr r rÚremove,szInsertionSortedSet.removec CsZztt|jƒƒ}|j|=|WStk r8tdƒ‚Yqttfk rRYqYqXqdS)z(Pop the oldest-inserted key from the setzpop from an empty setN)ÚnextrrÚ StopIterationr!ÚRuntimeErrorrr r rÚpopleft/szInsertionSortedSet.popleftcCs|j ¡dS)z(Pop the latest-inserted key from the setr)rÚpopitemrr r rÚpopright<szInsertionSortedSet.poprightcCs|j ¡dSr)rÚclearrr r rr*BszInsertionSortedSet.clearN)r )Ú__name__Ú __module__Ú__qualname__Ú__doc__Ú__annotations__Ú __slots__rrrrr r"r#r'r)Úpopr*r r r rr s rN) Ú __future__rÚcollections.abcrrÚtypingrZzict.commonrrr r r rÚs