-=[ Mr. Bumblebee ]=-
_Indonesia_
ó
î:ïNc @@ s{ d Z d d l m Z d d l m Z m Z e ƒ Z d e f d „ ƒ YZ d e f d „ ƒ YZ d e f d „ ƒ YZ
d
S( s) A simple least-recently-used (LRU) cache.i ( t absolute_import( t symbol_versioningt tracet _LRUNodec B@ s& e Z d Z d Z d „ Z d „ Z RS( s: This maintains the linked-list which is the lru internals.t prevt next_keyt keyt valuec C@ s( d | _ t | _ | | _ | | _ d S( N( t NoneR t _null_keyR R R ( t selfR R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt __init__! s c C@ sD | j d k r d } n | j j } d | j j | j | j | f S( Ns %s(%r n:%r p:%r)( R R R t __class__t __name__R ( R
t prev_key( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt __repr__' s
( s prevs next_keys keys value( R
t
__module__t __doc__t __slots__R R ( ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR s t LRUCachec B@ sï e Z d Z d d d „ Z d „ Z d „ Z d „ Z e j e j
d ƒ ƒ d d „ ƒ Z d
„ Z d „ Z
d d „ Z d
„ Z d „ Z e j e j
d ƒ ƒ e ƒ Z d „ Z d „ Z d „ Z d „ Z d „ Z d d „ Z d d „ Z RS( s? A class which manages a cache of entries, removing unused ones.id c C@ s/ i | _ d | _ d | _ | j | | ƒ d S( N( t _cacheR t _most_recently_usedt _least_recently_usedt _update_max_cache( R
t max_cachet after_cleanup_count( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR 3 s c C@ s
| | j k S( N( R ( R
R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt __contains__; s c C@ s£ | j } | | } | j } | | k r/ | j S| j } | j } | t k rY | | _ n | | } | | _ | | _ | j | _ | | _ | | _ d | _ | j S( N( R R R R R R R R R ( R
R t cachet nodet mrut node_prevR t node_next( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt __getitem__> s"
c C@ s
t | j ƒ S( N( t lenR ( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt __len__] s i i i c C@ s+ | d k r t d ƒ ‚ n | j | | ƒ S( Ns. Per-node cleanup functions no longer supported( R t
ValueErrort __setitem__( R
R R t cleanup( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt add` s c C@ s¢ | t k r t d ƒ ‚ n | | j k rP | j | } | | _ | j | ƒ n) t | | ƒ } | | j | <| j | ƒ t | j ƒ | j k rž | j ƒ n d S( s Add a new value to the caches cannot use _null_key as a keyN( R R# R R t _record_accessR R! t
_max_cacheR% ( R
R R R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR$ g s
c C@ s | j S( s( Get the number of entries we will cache.( R( ( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt
cache_sizex s c C@ s9 | j j | d ƒ } | d k r% | S| j | ƒ | j S( N( R t getR R' R ( R
R t defaultR ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR* | s
c C@ s
| j j ƒ S( s Get the list of keys currently cached.
Note that values returned here may not be available by the time you
request them later. This is simply meant as a peak into the current
state.
:return: An unordered list of keys that are currently cached.
( R t keys( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR, ƒ s c C@ s t d „ | j j ƒ Dƒ ƒ S( s9 Get a new dict with the same key:value pairs as the cachec s@ s$ | ] \ } } | | j f Vq d S( N( R ( t .0t kt n( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pys <genexpr> s ( t dictR t iteritems( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt as_dictŽ s c C@ s- x& t | j ƒ | j k r( | j ƒ q Wd S( s¯ Clear the cache until it shrinks to the requested size.
This does not completely wipe the cache, just makes sure it is under
the after_cleanup_count.
N( R! R t _after_cleanup_countt _remove_lru( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR% • s c C@ sÖ | j d k r% | | _ | | _ d S| | j k r8 d S| | j k rV | j | _ n | j d k rw | j | j _ n | j t k r¥ | j | j } | j | _ n | j j | _ | | j _ | | _ d | _ d S( s Record that key was accessed.N( R R R R R R R R ( R
R R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR' Ÿ s" c C@ s± | | j k r | j | _ n | j j | j ƒ | j d k rL d | _ n | j d k rm | j | j _ n | j t k r› | j | j } | j | _ n d | _ t | _ d S( N( R R R t popR R R R R ( R
R R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt _remove_node¹ s c C@ s | j | j ƒ d S( s¯ Remove one entry from the lru, and handle consequences.
If there are no more references to the lru, then this entry should be
removed from the cache.
N( R6 R ( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR4 É s c C@ s x | j r | j ƒ q Wd S( s Clear out all of the cache.N( R R4 ( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt clearÑ s c C@ s | j | d | ƒd S( s1 Change the number of entries that will be cached.R N( R ( R
R R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt resize× s c C@ sO | | _ | d k r, | j d d | _ n t | | j ƒ | _ | j ƒ d S( Ni i
( R( R R3 t minR% ( R
R R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR Ü s N( i i i ( i i i ( R
R R R R R R R" R t deprecated_methodt
deprecated_inR& R$ R) R* R, R2 t itemsR% R' R6 R4 R7 R8 R ( ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR 0 s,
t LRUSizeCachec B@ sS e Z d Z d d d d „ Z d „ Z d „ Z d „ Z d d „ Z d d „ Z RS(
sU An LRUCache that removes things based on the size of the values.
This differs in that it doesn't care how many actual items there are,
it just restricts the cache to be cleaned up after so much data is stored.
The size of items added will be computed using compute_size(value), which
defaults to len() if not supplied.
i c C@ sg d | _ | | _ | d k r* t | _ n | j | d | ƒt j | d t t | d ƒ d ƒ ƒd S( s¥ Create a new LRUSizeCache.
:param max_size: The max number of bytes to store before we start
clearing out entries.
:param after_cleanup_size: After cleaning up, shrink everything to this
size.
:param compute_size: A function to compute the size of the values. We
use a function here, so that you can pass 'len' if you are just
using simple strings, or a more complex function if you are using
something like a list of strings, or even a custom object.
The function should take the form "compute_size(value) => integer".
If not supplied, it defaults to 'len()'
i t after_cleanup_sizeR i i N( t _value_sizet
_compute_sizeR R! t _update_max_sizeR R t maxt int( R
t max_sizeR> t compute_size( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR ð s c C@ s | t k r t d ƒ ‚ n | j j | d ƒ } | j | ƒ } | | j k r t j d | | | j | j ƒ | d k r‰ | j
| ƒ n d S| d k r¸ t | | ƒ } | | j | <n | j | j | j
ƒ 8_ | j | 7_ | j | ƒ | j | j k r| j ƒ n d S( s Add a new value to the caches cannot use _null_key as a keysf Adding the key %r to an LRUSizeCache failed. value %d is too big to fit in a the cache with size %d %dN( R R# R R* R R@ t _after_cleanup_sizeR t muttert _max_sizeR6 R R? R R' R% ( R
R R R t value_len( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR$ s&
c C@ s' x | j | j k r" | j ƒ q Wd S( s® Clear the cache until it shrinks to the requested size.
This does not completely wipe the cache, just makes sure it is under
the after_cleanup_size.
N( R? RF R4 ( R
( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR% # s c C@ s/ | j | j | j ƒ 8_ t j | | ƒ d S( N( R? R@ R R R6 ( R
R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR6 - s c C@ s= | j | d | ƒt t | d ƒ d ƒ } | j | ƒ d S( s/ Change the number of bytes that will be cached.R> i i N( RA RB RC R ( R
RD R> R ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR8 1 s c C@ sE | | _ | d k r, | j d d | _ n t | | j ƒ | _ d S( Ni i
( RH R RF R9 ( R
RD R> ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyRA 7 s i N(
R
R R R R R$ R% R6 R8 RA ( ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyR= æ s
N( R t
__future__R t bzrlibR R t objectR R R R= ( ( ( s4 /usr/lib/python2.7/dist-packages/bzrlib/lru_cache.pyt <module> s ¶
Copyright © 2017 || Recoded By Mr.Bumblebee