ph8SrSSKrSSKrSSKJrJrJr SSKrSSKrSSK J r J r \"S/SQ5r Sr "S S \5r\"54\\\\"S51\\\\4S jr0\ R2S 4S jr"SS5rSr\"\ R:S5rSr"SS5r Sr!"SS\ 5r""SS\5r#SSjr$"SS\5r%SSjr&g)z$ Memoization and caching utilities. N) namedtupleupdate_wrapperwraps)config constants CacheInfo)hitsmissescurrsizec[R"[R"55nUR 5[ R :$)z4Check if the memory is too full for further caching.)psutilProcessosgetpidmemory_percentrMAXIMUM_CACHE_MEMORY_PERCENTAGE)current_processs E/home/james-whalen/.local/lib/python3.13/site-packages/pyphi/cache.py memory_fullrs5nnRYY[1O  * * ,  2 2 34c<^\rSrSrSrSr\4U4SjjrSrSr U=r $) _HashedSeq!zThis class guarantees that ``hash()`` will be called no more than once per element. This is important because the ``lru_cache()`` will hash the key multiple times on a cache miss.  hashvaluecD>[TU]5 XSS&U"U5UlgN)super__init__r)selftuphash __class__s rr _HashedSeq.__init__)s  QcrcUR$rrr!s r__hash___HashedSeq.__hash__.s ~~r) __name__ __module__ __qualname____firstlineno____doc__ __slots__r#r r(__static_attributes__ __classcell__r$s@rrr!s! I!%# rrc (^Un U(a'U"UR55n X- n U Hn X- n M U(a0X"U4SjU55- n U(aX"U4SjW 55- n O U"U 5S:XaT"U S5U;aU S$[U 5$)ayMake a cache key from optionally typed positional and keyword arguments. The key is constructed in a way that is flat as possible rather than as a nested structure that would take more memory. If there is only a single argument and its data type is known to cache its hash value, then that argument is returned without a wrapper. This saves space and improves lookup speed. c34># UH nT"U5v M g7fr).0vtypes r _make_key..Fs+dT!WWdsc38># UHupT"U5v M g7frr5)r6kr7r8s rr9r:Hs:\TQa\srr)itemsr) argskwdstypedkwd_mark fasttypessortedtupler8lenkey sorted_itemsitems ` r _make_keyrI2s C djjl+   D KC!  u+d+++  5:\:: :C SQ4A<941v c?rFcH^^^^^[5m[mSUUUUU4SjjnU$)a<Memory-limited cache decorator. ``maxmem`` is a float between 0 and 100, inclusive, specifying the maximum percentage of physical memory that the cache can use. If ``typed`` is ``True``, arguments of different types will be cached separately. For example, f(3.0) and f(3) will be treated as distinct calls with distinct results. Arguments to the cached function must be hashable. View the cache statistics named tuple (hits, misses, currsize) with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. c >^^^^^SmTRmT (dUUUU UU U U4SjnOUUUUU U UU U4 SjnUUU4SjnUUUU4SjnXClXSl[UT5$)NFch>T"XT 5nT"UT 5nUT LaTS- mU$T "U0UD6nUTU'TS- mU$Nrr5) r>r?rFresultcache cache_getr make_keyr sentinelr@ user_functions rwrapper3cache..decorating_function..wrapperlsYt51"31)AID!M&55#c !  rc> T "XT 5nT"U5nUbTS- mU$T "U0UD6nT(dAUTU'[R"[R"55nUR 5T :mT S- m U$rM)rrrrr)r>r?rFrNrrOrPfullr rQmaxmemr r@rSs rrTrU{st51"3%AID!M&55!'E#J'-nnRYY[&AO*99;fDD!  rc0>[TT[T55$)zReport cache statistics.) _CacheInforErOr r sr cache_info6cache..decorating_function..cache_infosdFCJ7 7rc2>TR5 S=mmSmg)z%Clear the cache and cache statistics.rFN)clear)rOrWr r sr cache_clear7cache..decorating_function..cache_clears KKM D6Dr)getr\r`r) rSr r rTr\r`rPrWrOrQrXrRr@s ``` @@rdecorating_function"cache..decorating_functionesRII     $ 8  ()g}55r)rr)objectrI)rOrXr@rcrQrRs``` @@rrOrONs$&xHH5656n rcJ\rSrSrSrSrSrSrSrSr Sr S S .S jr S r g ) DictCachezcA generic dictionary-based cache. Intended to be used as an object-level cache of method results. c.0UlSUlSUlgNrr[r's rr DictCache.__init__   rc.0UlSUlSUlgrjr[r's rr_DictCache.clearrlrc,[UR5$)zNumber of items in cache)rErOr's rsizeDictCache.sizes4::rc`[URURUR55$)z.Return info about cache hits, misses, and size)rZr r rpr's rinfoDictCache.infos$))T[[$))+>>rcXR;a$U=RS- slURU$U=RS- slg)zfGet a value out of the cache. Returns None if the key is not in the cache. Updates cache statistics. rNr[)r!rFs rrb DictCache.gets: **  IINI::c? " q rc X RU'g)zSet a value in the cacheN)rOr!rFvalues rset DictCache.sets  3rN)_prefixcDU(a [S5eU4[U5-$)zdGet the cache key for the given function args. Kwargs: prefix: A constant to prefix to the key. z kwarg cache keys not implemented)NotImplementedErrorrD)r!r|r>kwargss rrF DictCache.keys( %24 4zE$K''rr[) r*r+r,r-r.r r_rprsrbrzrFr0r5rrrgrgs4   ?  "& ( (rrgcr[R"[RS[RSUS9$)Nhostport)rrdb)redis StrictRedisr REDIS_CONFIG)rs r redis_initrs4   &"5"5f"="("5"5f"=" FFrrct[R5$![RRa gf=f)z'Check if the Redis server is connected.F) redis_connpingr exceptionsConnectionErrorr5rrredis_availablers2     + +s 77cB\rSrSrSr\S5rSrSrSr Sr Sr g ) RedisCachecT[R5 [R5 g)zFlush the cache.N)rflushdbconfig_resetstatr's rr_RedisCache.clears##%rc*[R5$)zSSize of the Redis cache. .. note:: This is the size of the entire Redis database. )rdbsizer5rrrpRedisCache.sizes   ""rcl[R5n[USUSUR55$)z`Return cache information. .. note:: This is not the cache info for the entire Redis key space. keyspace_hitskeyspace_misses)rrsrZrp)r!rss rrsRedisCache.infos6  $/01))+' 'rcb[RU5nUb[R"U5nU$)zJGet a value from the cache. Returns None if the key is not in the cache. )rrbpickleloadsrxs rrbRedisCache.gets+ s#  LL'E rct[R"U[RS9n[R X5 g)zSet a value in the cache.)protocolN)rdumpsrPICKLE_PROTOCOLrrzrxs rrzRedisCache.sets$ UY-F-FGs"rc[e)zDelegate to subclasses.)r~r's rrFRedisCache.keys!!rr5N) r*r+r,r-r_ staticmethodrprsrbrzrFr0r5rrrrs/& ##' # "rrcPURR(a [S5eg)Nz,parent_cache must be from an uncut subsystem) subsystemis_cut ValueError parent_caches rvalidate_parent_cachers$$$GHH%rcR^\rSrSrSrSU4SjjrU4SjrU4SjrS SjrSr U=r $) RedisMICECachei"zRA Redis-backed cache for |Subsystem.find_mice()|. See |MICECache| for more info. c>[TU]5 Xl[U5UlUb[ U5 URUlgSUlgr)rr rr#subsystem_hashrparent_subsystem_hashr!rrr$s rr RedisMICECache.__init__(sE ""9o  # !, /*6)D)DD &)-D &rc*>[TU]U5nUbU$UR(amUR[ UR 5[ UR5S5n[TU]U5nUb"UR UR5(dU$g)zoGet a value from the cache. If the |MICE| cannot be found in this cache, try and find it in the parent cache. Nr)rrbrreplacestrrdamaged_by_cutr)r!rFmice parent_keyr$s rrbRedisMICECache.get8s w{3  K  % %S)<)<%=%()C)C%DaIJ7;z*D(;(;DNN(K(K rc\>URR(d[TU] X5 gg)z^Only need to set if the subsystem is uncut. Caches are only inherited from uncut subsystems. N)rrrrz)r!rFryr$s rrzRedisMICECache.setNs# ~~$$ GK #%rc<SRURXAX#5$)ACache key. This is the call signature of |Subsystem.find_mice()|.zsubsys:{}:{}:{}:{}:{})formatrr! direction mechanismpurviewsr|s rrFRedisMICECache.keyVs$&--   YJ Jr)rrrrFN) r*r+r,r-r.r rbrzrFr0r1r2s@rrr"s# . ,$JJrrcF^\rSrSrSrSU4SjjrSrSrS SjrSr U=r $) DictMICECachei\zLA subsystem-local cache for |MICE| objects. See |MICECache| for more info. cn>[TU]5 XlUb[U5 UR U5 ggr)rr rr_buildrs rr DictMICECache.__init__bs2 "  # !, / KK % $rcURR5H5up#URUR5(aM'X0RU'M7 g)zBuild the initial cache from the parent. Only include the |MICE| which are unaffected by the subsystem cut. A |MICE| is affected if either the cut splits the mechanism or splits the connections between the purview and mechanism N)rOr=rr)r!rrFrs rrDictMICECache._buildjs?&++113IC&&t~~66"& 34rcURR(d0URS:a[5(dX RU'gggg)aSet a value in the cache. Only cache if: - The subsystem is uncut (caches are only inherited from uncut subsystems so there is no reason to cache on cut subsystems.) - |small_phi| > 0. Ideally we would cache all mice, but the size of the cache grows way too large, making parallel computations incredibly inefficient because the caches have to be passed between process. This will be changed once global caches are implemented. - Memory is not too full. rN)rrphirrO)r!rFrs rrzDictMICECache.setus:%%$((Q,MM"JJsO"+7%rc XAX#4$)rr5rs rrFDictMICECache.keys I88r)rrr) r*r+r,r-r.r rrzrFr0r1r2s@rrr\s! & '#$99rrcR[R(a[nO[nU"XS9$)aConstruct a |MICE| cache. Uses either a Redis-backed cache or a local dict cache on the object. Args: subsystem (Subsystem): The subsystem that this is a cache for. Kwargs: parent_cache (MICECache): The cache generated by the uncut version of ``subsystem``. Any cached |MICE| which are unaffected by the cut are reused in this cache. If None, the cache is initialized empty. r)r REDIS_CACHErr)rrclss r MICECachers" y 44rc\rSrSrSrSrSrg) PurviewCacheiz,A network-level cache for possible purviews.cL[R(aX RU'gg)z&Only set if purview caching is enabledN)rCACHE_POTENTIAL_PURVIEWSrOrxs rrzPurviewCache.sets  * *#JJsO +rr5N)r*r+r,r-r.rzr0r5rrrrs 6$rrc^^UU4SjnU$)atCaching decorator for object-level method caches. Cache key generation is delegated to the cache. Args: cache_name (str): The name of the (already-instantiated) cache on the decorated object which should be used to store results of this method. *key_prefix: A constant to use as part of the cache key in addition to the method arguments. c>^TRS;a[R(dT$[T5UUU4Sj5nU$)N)cause_repertoireeffect_repertoirec>[UT5nUR"UST0UD6nURU5nUcT"U/UQ70UD6nURXE5 U$)Nr|)getattrrFrbrz) objr>rrOrFry cache_namefunc key_prefixs rrT*method..decorator..wrappersbC,E))T@:@@CIIcNE}S24262 #%Lr)r*rCACHE_REPERTOIRESr)rrTrrs` r decoratormethod..decorators; MMF F,,K t   rr5)rrrs`` rmethodrs( rr)'r.rr functoolsrrrrrrrrZrlistrreintr frozensetr8rCrDrErIrrOrgrrrrrrrrrrrr5rrrs  77   %C D 4${c9d4j95t86AANb3(3(lF++D1 2 ,","^I7JZ7Jt-9I-9`5*$9$ r