,juSrSSKJrJrJr SSKJr SSKJrJ r J r SSK J r SSK Jr SSKrSSKrSr"S S \\\\5rg) z/Module containing a database to deal with packs) FileDBBase ObjectDBR CachingDB) LazyMixin) BadObjectUnsupportedOperationAmbiguousObjectName) PackEntity)reduceN)PackedDBc|^\rSrSrSrSrU4SjrSrSrSr Sr S r S r S r S rS rSSjrSrSrSrU=r$)r z-A database operating on a set of object packsic@>[TU]U5 SUlSUlgNr)super__init__ _hit_count _st_mtime)self root_path __class__s ڛC:\Users\johnn\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.13_qbz5n2kfra8p0\LocalCache\local-packages\Python313\site-packages\gitdb/db/pack.pyrPackedDB.__init__)s  # cNUS:Xa[5UlURSS9 gg)N _entitiesT)force)listr update_cache)rattrs r _set_cache_PackedDB._set_cache_3s) ; !VDN   D  ) rc:URRSSS9 g)Nc US$r)ls r)PackedDB._sort_entities..:s!A$rT)keyreverse)rsort)rs r_sort_entitiesPackedDB._sort_entities9s =rc URUR-S:XaUR5 URH<nUS"U5nUcMUS==S- ss'U=RS- slUSU4s $ [ U5e)ay:return: tuple(entity, index) for an item at the given sha :param sha: 20 or 40 byte sha :raise BadObject: **Note:** This method is not thread-safe, but may be hit in multi-threaded operation. The worst thing that can happen though is a counter that was not incremented, or the list being in wrong order. So we safe the time for locking here, lets see how that goesr)r_sort_intervalr,rr)rshaitemindexs r _pack_infoPackedDB._pack_info<s ??T00 0A 5    !NNDGCLE Q1 1$Q'' #nrcHURU5 g![a gf=f)NTF)r5r)rr2s r has_objectPackedDB.has_objectYs(  OOC   s  !!cJURU5up#URU5$N)r5 info_at_indexrr2entityr4s rinfo PackedDB.infoas#, ##E**rcJURU5up#URU5$r;)r5stream_at_indexr=s rstreamPackedDB.streames#, %%e,,rc## UR5HInUR5nURn[UR 55H nU"U5v M MK g7fr;)entitiesr4r2rangesize)rr>r4 sha_by_indexs rsha_iterPackedDB.sha_iterisImmoFLLNE 99Luzz|,"5))-&sAA!cURVs/sH#oSR5R5PM% nn[SUS5$s snf)Nr0c X-$r;r%)xys rr'PackedDB.size..ts15rr)rr4rHr )rr3sizess rrH PackedDB.sizersA48NNCNDa%%'NC(%33Ds*A c[5e)zStoring individual objects is not feasible as a pack is designed to hold multiple objects. Writing or rewriting packs for single objects is inefficient)r)ristreams rstorePackedDB.storezs #$$rc[R"UR55nU(dURUR::agURUl[ [ R "[RRUR5S555nURVs1sH#oDSR5R5iM% nnX5- H_n[U5nURRUR5R5XwR5R/5 Ma XS- HanSn[!UR5H.upUSR5R5U:XdM,U n O US:wdeURU Mc UR#5 gs snf)a Update our cache with the actually existing packs on disk. Add new ones, and remove deleted ones. We keep the unchanged ones :param force: If True, the cache will be updated even though the directory does not appear to have changed according to its modification timestamp. :return: True if the packs have been updated so there is new information, False if there was no change to the pack databaseFz pack-*.packr0T)osstatrst_mtimersetglobpathjoinrpackr appendrHr4 sha_to_index enumerater,) rrrZ pack_filesr3our_pack_files pack_filer> del_indexis rrPackedDB.update_cachesWwwt~~'($..8277<<0@-#PQR <@NNKNDq',,.--/NK%5I *F NN ! !6;;=#5#5#7A\A\"] ^ 6)5II$T^^47<<>&&(I5 !I5 ? "?y)6 3Ls1*F>cJURVs/sHoSPM sn$s snf)z=:return: list of pack entities operated upon by this databaser0)r)rr3s rrFPackedDB.entitiess $(NN3NDQN333s cSnURHenUSR5RX5nUcM*USR5RU5nU(aX6:wa [ U5eUnMg U(aU$[ U5e)as:return: 20 byte sha as inferred by the given partial binary sha :param partial_binsha: binary sha with less than 20 bytes :param canonical_length: length of the corresponding canonical representation. It is required as binary sha's cannot display whether the original hex sha had an odd or even number of characters :raise AmbiguousObjectName: :raise BadObject: Nr0)rr4partial_sha_to_indexr2r r)rpartial_binshacanonical_length candidater3 item_indexr2s rpartial_to_complete_sha PackedDB.partial_to_complete_shas NNDa==n_J%1gmmo))*5!1-n== #  ''r)rrr)F)__name__ __module__ __qualname____firstlineno____doc__r1rr!r,r5r8r?rCrJrHrUrrFrr__static_attributes__ __classcell__)rs@rr r sT7 N* >:+-*4%+Z4((rr )rx gitdb.db.baserrr gitdb.utilr gitdb.excrrr gitdb.packr functoolsr rYr]__all__r r%rrrsJ 6 ! "  l(z9il(r