T8XSr\"5r"SS\5r"SS\5r"SS\5rg)z)A simple least-recently-used (LRU) cache.c2\rSrSrSrSrS SjrSrSrSr g) _LRUNodez:This maintains the linked-list which is the lru internals.)prevnext_keykeyvaluecleanupsizeNcZSUl[UlXlX lX0lSUlgN)r _null_keyrrrr r )selfrrr s $lib/third_party/dulwich/lru_cache.py__init___LRUNode.__init__s( !    cURcSnOURRnURR<SUR<SUR<SU<S3$)N(z n:z p:))rr __class____name__r)rprev_keys r__repr___LRUNode.__repr__*sF 99 Hyy}}H NN # # HH MM    rcURb&URURUR5 SUlSUlgr )r rrrs r run_cleanup_LRUNode.run_cleanup6s0 << # LL4:: .  r)r rrrr rr ) r __module__ __qualname____firstlineno____doc__ __slots__rrr__static_attributes__rrrrsDGI   rrc\rSrSrSrSSjrSrSrSrSr SS jr S r SS jr S r S rSrSrSrSrSrSrSSjrSSjrSrg)LRUCache>z?A class which manages a cache of entries, removing unused ones.NcP0UlSUlSUlURX5 gr )_cache_most_recently_used_least_recently_used_update_max_cacher max_cacheafter_cleanup_counts rrLRUCache.__init__As' #' $(! y>rcXR;$r )r*)rrs r __contains__LRUCache.__contains__Iskk!!rc*URnX!nURnX4La UR$URnURnU[ LaXPlO X&nXWlXelURUlX4lX0lSUlUR$r )r*r+rrrr r,r)rrcachenodemru node_prevr node_nexts r __getitem__LRUCache.__getitem__Ls z && ;:: II == y )2 %I&N% #'  zzrc,[UR5$r )lenr*rs r__len__LRUCache.__len__ks4;;rc## URnUbURb[SU<35eUbUR[La XR La[SU<35eSnO7UR URnURULa[SU<35eURcXRLa[SU<35eO3URRUR:wa[SU<35eUv UnUbMgg7f)z2Walk the LRU list, only meant to be used in tests.NzGthe _most_recently_used entry is not supposed to have a previous entry z.only the last node should have no next value: z-inconsistency found, node.next.prev != node: z>only the _most_recently_used should not have a previous node: z-inconsistency found, node.prev.next != node: )r+rAssertionErrorrr r,r*rrr7r:s r _walk_lruLRUCache._walk_lruns''  yy$$"$ }} )888(QUW!  KK 6 >>-(PTVyy 777(;?B8 99%%1(PTVJD3s DDDc\U[La [S5eXR;a,URUnUR5 X$lX4lO[ XUS9nX@RU'URU5 [UR5UR:aUR 5 gg)Add a new value to the cache. Also, if the entry is ever removed from the cache, call cleanup(key, value). Args: key: The key to store it under value: The object to store cleanup: None or a function taking (key, value) to indicate 'value' should be cleaned up. cannot use _null_key as a keyr N) r ValueErrorr*rrr r_record_accessr> _max_cache)rrrr r7s radd LRUCache.adds ) <= = ++ ;;s#D    J"LC8D#KK  D! t{{ doo - LLN .rcUR$)z(Get the number of entries we will cache.)rLrs r cache_sizeLRUCache.cache_sizes rc~URRUS5nUcU$URU5 UR$r )r*getrKr)rrdefaultr7s rrS LRUCache.gets8{{sD) <N D!zzrc6URR5$)zGet 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. Returns: An unordered list of keys that are currently cached. )r*keysrs rrW LRUCache.keyss{{!!rcV[SURR555$)z"Get the key:value pairs as a dict.c3@# UHupXR4v M g7fr )r).0kns r !LRUCache.items..sA-@TQQL-@s)dictr*itemsrs rraLRUCache.itemss AT[[->->-@AAArc[UR5UR:a6UR5 [UR5UR:aM5gg)zClear 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*_after_cleanup_count _remove_lrurs rr LRUCache.cleanups@$++!:!::    $++!:!::rc$URXSS9 g)z#  &(,!(;b(@D %(+,?(QD % r)rdr*r,rLr+)dNr )rrr r!r"rr3r;r?rDrMrPrSrWrar rhrKrnrersrvr-r$r%rrr'r'>sbI?"> #J8 "B+4"$5 Srr'cN\rSrSrSrS SjrS SjrSrSrS Sjr S S jr S r g) LRUSizeCacheiaAAn 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. Nc SUlX0lUc [UlURXS9 [R U[ [US- 5S5S9 g)aDCreate a new LRUSizeCache. Args: max_size: The max number of bytes to store before we start clearing out entries. after_cleanup_size: After cleaning up, shrink everything to this size. 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()' Nafter_cleanup_size)r/) _value_size _compute_sizer>_update_max_sizer'rmaxint)rmax_sizer compute_sizes rrLRUSizeCache.__init__(sT")  !$D  hN$#c(S..A1*EFrcU[La [S5eURRUS5nUR U5nXPR :a UbUR U5 UbU"X5 gUc[XUS9nX@RU'OU=RUR-slXTl U=RU- slURU5 URUR:aUR5 gg)rGrHNrI) r rJr*rSr_after_cleanup_sizernrrr rK _max_sizer )rrrr r7 value_lens rrMLRUSizeCache.add@s ) <= ={{sD)&&u- 00 0!!$'"#  <C8D#KK     )   I% D!   dnn , LLN -rcURUR:a-UR5 URUR:aM,gg)zClear 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)rrrers rr LRUSizeCache.cleanupfs:!9!99    !9!99rclU=RUR-sl[RX5 gr )rr r'rn)rr7s rrnLRUSizeCache._remove_nodeps% DII%d)rctURXS9 [[US- 5S5nURU5 g)z/Change the number of bytes that will be cached.rrrN)rrrr-)rrrr/s rrvLRUSizeCache.resizets6 hNHsN+Q/  y)rczXlUcURS-S-Ulg[X R5Ulgry)rrr|)rrrs rrLRUSizeCache._update_max_sizezs5!  %'+~~'9R'?D $'*+=~~'ND $r)rrrr)iNNr ) rrr r!r"rrMr rnrvrr$r%rrrrs/KOG0$L** OrrN)r"objectr rr'rr%rrrs=*0 H !v!H]v]@aO8aOr