H `ddlmZddlmZddlmZdZGddeZGdde Z d d Z y ) )unicode_literals)dequewraps) SimpleCache FastDictCachememoizedc$eZdZdZddZdZdZy)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.) clt|tr|dkDsJi|_t|_||_yNr) isinstanceint_datar_keysmaxsize)selfrs 'lib/third_party/prompt_toolkit/cache.py__init__zSimpleCache.__init__s/'3'GaK77 W  cT |j|S#t$r|}||j|<|jj|t |j|j kDr5|jj }||jvr |j|=|cYSwxYw)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. )rKeyErrorrappendlenrpopleft)rkey getter_funcvalue key_to_removes rgetzSimpleCache.gets ::c? " ME#DJJsO JJ  c "4::- $ 2 2 4  DJJ. =1L sBB'&B'c0i|_t|_y)z Clear cache. N)rrr)rs rclearzSimpleCache.clear1s W rN))__name__ __module__ __qualname____doc__rrr!rrrr s .rrceZdZdZddZdZy)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. Nct|sJt|tr|dkDsJt|_||_||_yr )callabler rrr get_valuesize)rr+r,s rrzFastDictCache.__init__Ks= """$$11W " rct||jkDr!|jj}||vr||=|j|}|||<|jj ||SN)rr,rrr+r)rrrresults r __missing__zFastDictCache.__missing__Ssd t9tyy  JJ..0M$'%S  # r)Ni@B)r#r$r%r&rr0r'rrrr7s & rrc*t|fd}|S)zI Momoization decorator for immutable classes and pure functions. )rc2tfd}|S)Ncpfd}tjf}j||S)NciSr.r')akwobjsr create_newzEmemoized..decorator..new_callable..create_newisA}}$r)tupleitemsr)r5r6r8rcacher7s`` r new_callablez1memoized..decorator..new_callablegs0 %eBHHJ'(C99S*- -rr)r7r<r;s` r decoratorzmemoized..decoratorfs! s .  . r)r)rr=r;s @rr r `s  (E rN)i) __future__r collectionsr functoolsr__all__objectrdictrr r'rrrDs4' (&(V&D&Rr