yfNSSKJr "SS\5r"SS5r"SS5rg) )Errorc,^\rSrSrSrU4SjrSrU=r$) StableDictz,A dict subclass with stable items() orderingc2>[[TU] 55$N)sortedsuperitems)self __class__s 9/usr/lib/python3/dist-packages/borg/helpers/datastruct.pyr StableDict.itemssegmo&&)__name__ __module__ __qualname____firstlineno____doc__r __static_attributes__ __classcell__)r s@rrrs6''rrcT\rSrSrSr"SS\\5rS SjrSr S Sjr S S jr S r g)Buffer z' Provides a managed, resizable buffer. c\rSrSrSrSrg)Buffer.MemoryLimitExceededz2Requested buffer size {} is above the limit of {}.rNrrrrrrrrrMemoryLimitExceededrs@rr Nc[U5(dS5eUb X#::dS5eXlX0lURUSS9 g)z~ Initialize the buffer: use allocator(size) call to allocate a buffer. Optionally, set the upper for the buffer size. z-must give alloc(size) function as first paramNzinitial size must be <= limitT)init)callable allocatorlimitresize)r r$sizer%s r__init__Buffer.__init__sJ  ""S$SS"} N/NN-"  Dt $rc,[UR5$r)lenbufferr s r__len__Buffer.__len__s4;;rc[U5nURb.XR:a[RXR5eU(d[ U5U:aUR U5Ulgg)a resize the buffer - to avoid frequent reallocation, we usually always grow (if needed). giving init=True it is possible to first-time initialize or shrink the buffer. if a buffer size beyond the limit is requested, raise Buffer.MemoryLimitExceeded (OSError). N)intr%rr r+r$r,r r'r"s rr& Buffer.resize sX 4y :: !dZZ&7,,T::> > 3t9t#...DK$rcBUbURX5 UR$)z return a buffer of at least the requested size (None: any current size). init=True can be given to trigger shrinking of the buffer to the given size. )r&r,r2s rget Buffer.get,s   KK #{{r)r$r,r%)iN)F)NF) rrrrrrOSErrorr r(r.r&r5rrrrrr s+AeWA %  /rrcR\rSrSrSr"SS\5rSrSrSr Sr S r S r S r g ) EfficientCollectionQueue6zD An efficient FIFO queue that splits received elements into chunks. c\rSrSrSrSrg)&EfficientCollectionQueue.SizeUnderflow;zHCould not pop_front first {} elements, collection only has {} elements..rNrrrr SizeUnderflowr<;sVrr>c8/UlSUlXlX lg)z Initializes empty queue. Requires split_size to define maximum chunk size. Requires member_type to be type defining what base collection looks like. N)buffersr' split_size member_type)r rBrCs rr(!EfficientCollectionQueue.__init__>s   $&rcfUR(dUR5$URSnU$)z Returns first chunk from queue without removing it. Returned collection will have between 1 and split_size length. Returns empty collection when nothing is queued. r@)rArC)r r,s r peek_front#EfficientCollectionQueue.peek_frontIs, ||##% %a rcFXR:a[RXR5eUS:amURSn[ U[ U55nX#SnU(aX RS'O URS X-nU=RU-slUS:aMlgg)zf Removes first size elements from queue. Throws if requested removal size is larger than whole queue. r@N)r'r9r>rAminr+)r r'r, to_removes r pop_front"EfficientCollectionQueue.pop_frontTs )) *88yyI IQh\\!_FD#f+.IJ'F"( QLLO  D II "IQhrcUR(dUR5/UlU(aURSn[U5UR:a+UR5nURR U5 [ [U5UR[U5- 5nX!SU- nXSnX RS'U=R U- slU(aMgg)zU Adds data at end of queue. Takes care to chunk data into split_size sized elements. N)rArCr+rBappendrIr')r datar,to_adds r push_back"EfficientCollectionQueue.push_backfs || ,,./DL\\"%F6{doo-))+ ##F+TDOOc&k$ABF 7Fm #F=D%LL  II IdrcUR$)z6 Current queue length for all elements in all chunks. r'r-s rr. EfficientCollectionQueue.__len__ysyyrc URS:g$)z$ Returns true if queue isn't empty. r@rUr-s r__bool__!EfficientCollectionQueue.__bool__syyA~r)rArCr'rBN)rrrrrrr>r(rFrKrRr.rXrrrrr9r96s3WW ' #$ & rr9N)errorsrdictrrr9rrrr\s+'' ))XMMr