o ╡+keлу@s<ddlmZGddДdeГZGddДdГZGddДdГZdS) щ)┌Errorcs eZdZdZЗfddДZЗZS)┌ StableDictz,A dict subclass with stable items() orderingcsttГабГSйN)┌sorted┌super┌itemsй┌selfй┌ __class__й·;usr/lib/python3.10/site-packages/borg/helpers/datastruct.pyrszStableDict.items)┌__name__┌ __module__┌__qualname__┌__doc__r┌ __classcell__rrr r rsrc@sHeZdZdZGddДdeeГZdddДZdd ДZdddДZ dd dДZ dS)┌Bufferz/ Provides a managed, resizable buffer. c@єeZdZdZdS)zBuffer.MemoryLimitExceededz2Requested buffer size {} is above the limit of {}.Nйrrrrrrrr ┌MemoryLimitExceededєrщNcCsFt|ГsJdГВ|dus||ksJdГВ||_||_|j|ddНdS)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┌ allocator┌limit┌resize)r r┌sizerrrr ┌__init__s zBuffer.__init__cCs t|jГSr)┌len┌bufferrrrr ┌__len__s zBuffer.__len__FcCsNt|Г}|jdur||jkrtа||jбВ|st|Г|kr%|а|б|_dSdS)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)┌intrrrr rr!йr rrrrr r s z Buffer.resizecCs|dur |а||б|jS)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. N)rr!r$rrr ┌get,sz Buffer.get)rN)F)NF)rrrrr┌OSErrorrrr"rr%rrrr r s rc@sPeZdZdZGddДdeГZddДZddДZdd ДZd dДZ dd ДZ ddДZdS)┌EfficientCollectionQueuezL An efficient FIFO queue that splits received elements into chunks. c@r)z&EfficientCollectionQueue.SizeUnderflowzHCould not pop_front first {} elements, collection only has {} elements..Nrrrrr ┌ SizeUnderflow;rr(cCsg|_d|_||_||_dS)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 r+r,rrr r>s z!EfficientCollectionQueue.__init__cCs|js|абS|jd}|S)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))r*r,)r r!rrr ┌ peek_frontIs z#EfficientCollectionQueue.peek_frontcCsВ||jkrtа||jбВ|dkr?|jd}t|t|ГГ}||dЕ}|r*||jd<n|jd=||8}|j|8_|dksdSdS)z~ Removes first size elements from queue. Throws if requested removal size is larger than whole queue. r)N)rr'r(r*┌minr )r rr!┌ to_removerrr ┌ pop_frontTs ўz"EfficientCollectionQueue.pop_frontcCsЪ|js |абg|_|rK|jd}t|Г|jkr!|аб}|jа|бtt|Г|jt|ГГ}||d|Е7}||dЕ}||jd<|j|7_|sdSdS)zm Adds data at end of queue. Takes care to chunk data into split_size sized elements. щ N)r*r,r r+┌appendr.r)r ┌datar!Zto_addrrr ┌ push_backfs Ўz"EfficientCollectionQueue.push_backcCs|jS)zF Current queue length for all elements in all chunks. йrrrrr r"ysz EfficientCollectionQueue.__len__cCs |jdkS)z4 Returns true if queue isn't empty. r)r5rrrr ┌__bool__s z!EfficientCollectionQueue.__bool__N)rrrrrr(rr-r0r4r"r6rrrr r'6sr'N)┌errorsr┌dictrrr'rrrr ┌s,