OG(f6.dZddlmZddlZddlZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZmZmZmZmZmZmZmZmZmZmZmZmZmZgdZeejddkZ ddZ!d dej"fd Z#ddZ$dZ%ddZ&dZ'ddZ(ddZ)dZ*ddZ+dZ,dS)z. Useful utilities for working with bitarrays. )absolute_importN)bitarray bits2bytes)zerosonescount_nparity count_andcount_or count_xorany_andsubset_correspond_all serialize deserializeba2hexhex2baba2basebase2ba sc_encode sc_decode vl_encode vl_decodecanonical_decode)rrurandompprint make_endianrindexstriprr r r r r r intervalsrrrrba2intint2barrrrrr huffman_codecanonical_huffmanrctd|}|tjt |||d=|S)zlurandom(length, /, endian=None) -> bitarray Return a bitarray of `length` random bits (uses `os.urandom`). rN)r frombytesosrr)__lengthendianas Y/home/gothic/public_html/test_impala/venv/lib64/python3.11/site-packages/bitarray/util.pyrr-sG FAKK :h//00111 ()) Hcddlm}|dtdt|ts$t dt |jz||||dS) a!rindex(bitarray, sub_bitarray=1, start=0, stop=, /) -> int Return rightmost (highest) index where sub_bitarray (or item - defaults to 1) is found in bitarray (`a`), such that sub_bitarray is contained within `a[start:stop]`. Raises `ValueError` when the sub_bitarray is not present. rwarnzhrindex() is deprecated and will be removed in bitarray 3.0 - use .index(..., right=True) method instead.r. stacklevelbitarray expected, got '%s'Tright) warningsr1DeprecationWarning isinstancer TypeErrortype__name__index)__a__sub_bitarray__start__stopr1s r,rr8sD 7 ++++ c8 $ $L5S 8JJKKK 99^WfD9 A AAr-Pc| tj}t|tsddl}|||||dSt |}|dkrt dt |}|dkrt dt |}||krt d|z||z |dzz}||z}|dkr||z dz }t|j}t|d zt|zt||zz|k} | rd } n|rd } nd } | |d | t|D]t\} } | r$| |zdkr| d|dzz| |zdkr| |zdkr| d| t| u| r| d| d| z| dS)aMpprint(bitarray, /, stream=None, group=8, indent=4, width=80) Prints the formatted representation of object on `stream` (which defaults to `sys.stdout`). By default, elements are grouped in bytes (8 elements), and 8 bytes (64 elements) per line. Non-bitarray objects are printed by the standard library function `pprint.pprint()`. Nr)streamindentwidthr.zgroup must be >= 1zindent must be >= 0zwidth must be > %d (indent)r%rCz''''(z %s  z%s) )sysstdoutr9rrint ValueErrorr;r<lenwrite enumeratestrflush) r>rFgrouprGrH_pprintgplepl type_name multilinequotesibs r,rrLs;~ c8 $ $    s6&FFF JJE qyy-... [[F zz./// JJE 6?@@@ 6>uqy )C #+C axxfnq S "II"SXX-CE0AAUJI  LLIIIvv.///#1  2SA LL6C<0 1 1 1 u9>>a#gll LL    SVV T LL6!""" LLNNNNNr-cddlm}|dtdt|ts$t dt |jz||kr|St ||S)a,make_endian(bitarray, /, endian) -> bitarray When the endianness of the given bitarray is different from `endian`, return a new bitarray, with endianness `endian` and the same elements as the original bitarray. Otherwise (endianness is already `endian`) the original bitarray is returned unchanged. rr0zgmake_endian() is deprecated and will be removed in bitarray 3.0 - use bitarray(..., endian=...) insteadr.r2r4) r7r1r8r9rr:r;r<r*)r>r*r1s r,rrsD 1 ++++ c8 $ $L5S 8JJKKK zz||v C  r-r6cRt|ts$tdt|jz|dvrt d|z|dkrdn|d}|dkr |ddS|d krdn|dd dz}|||S) zstrip(bitarray, /, mode='right') -> bitarray Return a new bitarray with zeros stripped from left, right or both ends. Allowed values for mode are the strings: `left`, `right`, `both` zstr expected for mode, got '%s')leftr6bothz.mode must be 'left', 'right' or 'both', got %rr6Nr.rrbr5)r9rUr:r;r<rQfind)r>modestartstops r,rrs dC P9DII>44sxxx';';a'?D uTz?r-c#K |d}n#t$rYdSwxYwt|}d}||krL|} || |}n#t$r|}YnwxYwt |||fV| }||kJdSdS)zintervals(bitarray, /) -> iterator Compute all uninterrupted intervals of 1s and 0s, and return an iterator over tuples `(value, start, stop)`. The intervals are guaranteed to be in order, and their size is always non-zero (`stop - start > 0`). rN) IndexErrorrRr=rQrP)r>valuenrhrgs r,r r sA  CA D (( 99Y..DD   DDD %jj%%%%%  ((((((s A AAFct|ts$tdt|jzt |}|dkrt dt|dk}|j r3t|j |}|r||zn||z}trDt|d}|r| tt|d}n@t||}|r|d|dz zkr|d|zz}|S) zba2int(bitarray, /, signed=False) -> int Convert the given bitarray to an integer. The bit-endianness of the bitarray is respected. `signed` indicates whether two's complement is used to represent the integer. r4rznon-empty bitarray expectedlittlebig byteorderr.)r9rr:r;r<rRrQboolr*padbitsr_is_py2reverserPr from_bytestobytes)r>signedlengthlepadr+ress r,r!r!sA c8 $ $L5S 8JJKKK XXF {{6777 cjjllh& ' 'B {-CK..,cCii39D S%    IIKKK&))R  nnS[[]]cjjllnCC #vz*** qF{ Jr-cvt|trttfnts$t dt |jz|9t|tst d|dkrtd|r|t d|dkrt|pd|S|r=d|dz z}| |cxkr|ksntd| ||fz|dkr|d|zz }n:|dkrtd |z|r |d|zkrtd d|z|fztd|}t| d k}trdt|d dd }|t!|d|r|n]|t'|| }|||t-||rdndSt/|} | |kr|r |d|n || d}| |kr1t|| z | } |r|| zn| |z}t/||ksJ|S)aint2ba(int, /, length=None, endian=None, signed=False) -> bitarray Convert the given integer to a bitarray (with given endianness, and no leading (big-endian) / trailing (little-endian) zeros), unless the `length` of the bitarray is provided. An `OverflowError` is raised if the integer is not representable with the given number of bits. `signed` determines whether two's complement is used to represent the integer, and requires `length` to be provided. zint expected, got '%s'Nzint expected for lengthrzlength must be > 0zsigned requires lengthr.z+signed integer not in range(%d, %d), got %dz%unsigned integer not positive, got %dz,unsigned integer not in range(0, %d), got %drnr%Lrorqr6rb)r9rurPlongr:r;r<rQr OverflowErrorrrsr*hexrstripextendrrvto_bytesr bit_lengthr'rrR) __irzr*rymr+r{sr_lar|s r,r"r"s c':C;;s ; ;G04993EEFFF &#&& 7566 6 Q;;122 2 2&.0111 axxV[q&))) ? &1* c A !)-.B3<!899 9 77 1; C 77 G# MNN N  ?ca6k**!),-K+=!>?? ? FA ahhjjH$ % %B HHQRRL   $ $ 5!!"""   IIKKK LLCNN$4$455L L L A ~Q216222 QB F{{ -AgvgJJ!VGHH+ F{{FRK,, &AGGsQw q66V     Hr-cddlm}m}Gddt}g}|D])\}}|}||_||_|||*t|dkrn|}||||f|_|jdj|jdjz|_|||t|dkn|dS)z_huffman_tree(dict, /) -> Node Given a dict mapping symbols to their frequency, construct a Huffman tree and return its root node. r)heappushheappopceZdZdZdZdS)_huffman_tree..Nodez A Node instance will either have a 'symbol' (leaf node) or a 'child' (a tuple with both children) attribute. The 'freq' attribute will always be present. c"|j|jkSN)freq)selfothers r,__lt__z"_huffman_tree..Node.__lt__4s9uz) )r-N)r< __module__ __qualname____doc__rr-r,Noder.s-   * * * * *r-rr.) heapqrrobjectitemssymbolrrRchild) __freq_maprrrminheapsymfleafparents r, _huffman_treer&s) ('''''''*****v***G""$$  Qtvv  $ g,,  ww'')9)99 l1o*V\!_-AA &!!! g,,   1:r-ct|ts$tdt|jzt d|t d|t |dkr9t |dkrtdt|diSit d|ffd t|S)aKhuffman_code(dict, /, endian=None) -> dict Given a frequency map, a dictionary mapping symbols to their frequency, calculate the Huffman code, i.e. a dict mapping those symbols to bitarrays (with given endianness). Note that the symbols are not limited to being strings. Symbols may may be any hashable object (such as `None`). dict expected, got '%s'01r%r*cannot create Huffman code with no symbolsc ||j<dS#t$r8|jd|z|jd|zYdSwxYwNrr.rAttributeErrorr)ndprefixb0b1resulttraverses r,rzhuffman_code..traversehsv / &F29    / / / HRXa[&2+ . . . HRXa[&2+ . . . . . . / >AA) r9dictr:r;r<rrRrQlistr)rr*rrrrs @@@@r,r#r#Ms j$ ' 'O1D4D4D4MMNNN #v  B #v  B : z??a  IJJ JZ  #R(( F$Q/////////// H]: & &''' Mr-c  t|ts$tdt|jzt |dkrOt |dkrt dt|d}|tddiddg|gfSi d fd  t|t d }td |D}i}|dzdgz}d}t|D]^\}\}}t||d||<||xxdz cc<|dzt |kr|dz }|||dzd|z z}_||d |DfS)acanonical_huffman(dict, /) -> tuple Given a frequency map, a dictionary mapping symbols to their frequency, calculate the canonical Huffman code. Returns a tuple containing: 0. the canonical Huffman code as a dict mapping symbols to bitarrays 1. a list containing the number of symbols of each code length 2. a list of symbols in canonical order Note: the two lists may be used as input for `canonical_decode()`. rr%rrrror.c ||j<dS#t$r8|jd|dz|jd|dzYdSwxYwrr)rrz code_lengthrs r,rz#canonical_huffman..traversesv .%+K " " " . . . HRXa[&1* - - - HRXa[&1* - - - - - - .rc"|d|dfS)Nr.rr)items r,z#canonical_huffman..s$q'479Kr-)keyc3&K|] }|dV dS)r.Nr.0rs r, z$canonical_huffman..s&,,d$q',,,,,,r-cg|] }|d Srrrs r, z%canonical_huffman..s777T!W777r-r)r9rr:r;r<rRrQrrrsortedrmaxrTr") rrtablemaxbitscodedictcountcoder^rzrrs @@r,r$r$ss j$ ' 'O1D4D4D4MMNNN : z??a  IJJ J:q!Xc5))*QFSE99K....... H]: & &''' ;$$&&,K,K L L LE,,e,,,,,GH q[QC E D%e,,..=CtVU33  f  q53u::   AID U1q5\!_v- -D U77777 77r-r)NrBrCrDr5)F)NNF)-r __future__rr(rNrrbitarray._utilrrrr r r r r rrrrrrrrrrrrr__all__rs version_inforurmaxsizerrrrr r!r"rr#r$rr-r,rsG '&&&&& ))))))))                                                  $s"a' ( (     !!CKBBBB(5555p!!!0&2>; ; ; ; ~$$$N####L4848484848r-