B 't\T @s\ddlmZddlmZddlmZdddgZGdddeZGddde Z d d dZ d S) )unicode_literals)deque)wraps SimpleCache FastDictCachememoizedc@s*eZdZdZd ddZddZddZd S) rz Very simple cache that discards the oldest item when the cache size is exceeded. :param maxsize: Maximum size of the cache. (Don't make it too big.) cCs.t|tr|dksti|_t|_||_dS)Nr) isinstanceintAssertionError_datar_keysmaxsize)selfrr3lib/python3.7/site-packages/prompt_toolkit/cache.py__init__szSimpleCache.__init__cCsly |j|Stk rf|}||j|<|j|t|j|jkrb|j}||jkrb|j|=|SXdS)z Get object from the cache. If not found, call `getter_func` to resolve it, and put that on the top of the cache instead. N)r KeyErrorr appendlenrpopleft)rkeyZ getter_funcvalue key_to_removerrrgets     zSimpleCache.getcCsi|_t|_dS)z Clear cache. N)r rr )rrrrclear1szSimpleCache.clearN)r)__name__ __module__ __qualname____doc__rrrrrrrr s c@s"eZdZdZdddZddZdS) ra Fast, lightweight cache which keeps at most `size` items. It will discard the oldest items in the cache first. The cache is a dictionary, which doesn't keep track of access counts. It is perfect to cache little immutable objects which are not expensive to create, but where a dictionary lookup is still much faster than an object instantiation. :param get_value: Callable that's called in case of a missing key. N@BcCs:t|s tt|tr|dks"tt|_||_||_dS)Nr)callabler r r rr get_valuesize)rr"r#rrrrKs  zFastDictCache.__init__cCsHt||jkr&|j}||kr&||=|j|}|||<|j||S)N)rr#r rr"r)rrrresultrrr __missing__Ss   zFastDictCache.__missing__)Nr )rrrrrr%rrrrr7s  csfdd}|S)zI Memoization decorator for immutable classes and pure functions. cs$tdtfdd}|S)N)rcs0fdd}ttf}||S)Ncs S)Nrr)akwobjrr create_newiszEmemoized..decorator..new_callable..create_new)tuplesorteditemsr)r'r(r*r)cacher))r'r(r new_callablegsz1memoized..decorator..new_callable)rr)r)r/)r)r.r)r decoratords zmemoized..decoratorr)rr0r)rrr`s N)r&) Z __future__r collectionsr functoolsr__all__objectrdictrrrrrrs   +)