$)diR&dZddlZddlZddlZddlZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZmZmZmZmZmZmZmZmZmZmZmZmZmZmZmZmZgdZ ddZ!ddZ"dd Z#Gd d Z$dd Z%ddZ&d dZ'd!dZ(dZ)d"dZ*d#dZ+dZ,ddZ-dZ.dS)$z. Useful utilities for working with bitarrays. N)bitarray bits2bytes)zerosonescount_nparity_ssqi xor_indices count_andcount_or count_xorany_andsubsetcorrespond_allbyteswap serialize deserializeba2hexhex2baba2basebase2ba sc_encode sc_decode vl_encode vl_decodecanonical_decode)#rrurandomrandom_krandom_p gen_primespprintstriprr sum_indicesr r r r rrrr intervalsrrrrba2intint2barrrrrr huffman_codecanonical_huffmanrcnttjt||}||d=|S)zdurandom(n, /, endian=None) -> bitarray Return random bitarray of length `n` (uses `os.urandom()`). N)rosrr)__lengthendianas T/var/www/menimich/repos/protonApp/venv/lib/python3.11/site-packages/bitarray/util.pyrr+s5 Jx00116::A ()) Hct||}t|ts$tdt |jz||S)aXrandom_k(n, /, k, endian=None) -> bitarray Return (pseudo-) random bitarray of length `n` with `k` elements set to one. Mathematically equivalent to setting (in a bitarray of length `n`) all bits at indices `random.sample(range(n), k)` to one. The random bitarrays are reproducible when giving Python's `random.seed()` a specific seed value. int expected, got '%s')_Random isinstanceint TypeErrortype__name__r)__nkr,rs r.rr5sS VA a  E04773CCDDD ::a==r/?ctjdddkrtdt||}||S)aDrandom_p(n, /, p=0.5, endian=None) -> bitarray Return (pseudo-) random bitarray of length `n`, where each bit has probability `p` of being one (independent of any other bits). Mathematically equivalent to `bitarray((random() < p for _ in range(n)), endian)`, but much faster for large `n`. The random bitarrays are reproducible when giving Python's `random.seed()` with a specific seed value. This function requires Python 3.12 or higher, as it depends on the standard library function `random.binomialvariate()`. Raises `NotImplementedError` when Python version is too low. N) z7bitarray.util.random_p() requires Python 3.12 or higher)sys version_infoNotImplementedErrorr2r)r8pr,r:s r.rrEsQ g%%!#:;; ;VA ::a==r/cFeZdZdZdezZdZd dZdZdZd Z d Z d Z dS) r2g{Gz?rNcJ||_t||_||_dSN)nrnbytesr,)selfrIr,s r.__init__z_Random.__init__js! mm  r/c|j}tjd|z|d}t ||j}||jd=|S)zV Return bitarray with each bit having probability p = 1/2 of being 1. rElittleN)rJrandom getrandbitsto_bytesrr,rI)rKrJbr-s r. random_halfz_Random.random_halfosR  q6z * * 3 3FH E E Q $ $ dfggJr/cd|cxkr |jksntd|j|fzt|ddd}||ddz|jS)z Return bitarray containing operator sequence. Each item represents a bitwise operation: 0: AND 1: OR After applying the sequence (see .combine_half()), we obtain a bitarray with probability q = i / K rz0 < i < %d, got i = %dr=rN byteorderrF)K ValueErrorrrQindexM)rKir-s r.op_seqz_Random.op_seqzsx1~~~~tv~~~~5 CDD D QZZXZ66 A Aa$&())r/c|}|D]3}|r||z}||z}4|S)zm Combine random bitarrays with probability 1/2 according to given operator sequence. )rS)rKseqr-r9s r. combine_halfz_Random.combine_halfsa      ( (A (T%%'''T%%'''r/c|j}|dks||krH|dkrt||jS||krt||jSt d|z||dzkr.|||z }||S|dks||jzd|zkrd}n?||z }|dd|zz tj |z z}t||jdzz}|dkrt||j}| }n?| | |}| |z }tj}|dkr?t!| D]-}||}||r||}||d||<.nC|dkr=t!|D]-}||}||s||}||d||<.|S) Nrz&k must be in range 0 <= k <= n, got %sr=r>g?g?rF)rIrr,rrXrinvertrWmathsqrtr4r_r\countrO randrangerange) rKr9rIr-r[rCdiffrf_s r.rz_Random.random_ks# F 66Q!VVAvvQ ,,,AvvAt{+++EIJJ J qAv:: a!e$$A HHJJJH r66QZ!a%''AAAA #a-49Q<</ /AA!$%%A q55a%%A2DD!!$++a..11A7799q=D$ !88D5\\  IaLLd%! ! Ad%!   AXX4[[  IaLLA$%! ! AA$%!r/cdks dksdkrldkrt|j|jSdkr|Sdkrt |j|jSt dz|jdkr3t fdt|jD|jSdkr.|dz }| |S|j kr-| tj |jSt|jz}|jdzz|dzkr|dz }||}||jz }|jdkrb|jt%|d t'|kzzkr3t fd t|jD|jS||}|kr$|z d|z z }|||z}n#|kr|z }|||z}|S) Ngr;?z*p must be in range 0.0 <= p <= 1.0, got %srac3FK|]}tjkVdSrHrO.0rirCs r. z#_Random.random_p...HHQV]__q0HHHHHHr/rFdr>c3FK|]}tjkVdSrHrmrns r.rpz#_Random.random_p..rqr/)rrIr,rSrrXrrgrrbSMALL_PrrObinomialvariater4rWr\rJlenboolr_)rKrCr-r[r^qxs ` r.rz_Random.random_psX 88qCxx188CxxTVT[111Cxx'')))CxxDFDK000IAMNN N 6B;;HHHH%--HHH K)) ) s77 cAg&&A HHJJJH t|  ==!7!B!BCC C DF OO  a!e # # FAkk!nn J 6C< bitarray Generate a bitarray of length `n` in which active indices are prime numbers. By default (`odd=False`), active indices correspond to prime numbers directly. When `odd=True`, only odd prime numbers are represented in the resulting bitarray `a`, and `a[i]` corresponds to `2*i+1` being prime or not. rzbitarray length must be >= 0irFNr>r=01110110)r=r>rr00110101rErk )r4rXrrvrsearchrcrd)r8r,oddrIr-fr[js r.r r s CA1uu7888  f  !$Q$!$Q$!$Q$  f    AAcccFF !c!ff*q.SVV ##A Q  AbqbE !"" "!QDIa1f$5$5$; < <== % %AA A#$Aq1ula  % !RTYq\\C%7!8!899 " "A !Aa!enq1un   Hr/rFc|dvrtd|zd}t||krt||S|dz}||dz zdz}|d|zdz zdz}t||zdz |z}|j}d}t |D]} t || |z| dz|z} t d |j| } |r'| |dz kr| jrt | } d| | d <| } | rZ|| z} | |kr|nt| }|dkr || | z|zz }| |kr|nt| d}|| | zd|zz| z|zz }|S) zsum_indices(a, /, mode=1) -> int Return sum of indices of all active bits in bitarray `a`. Equivalent to `sum(i for i, v in enumerate(a) if v)`. `mode=2` sums square of indices. )rFr=zunexpected mode %rirErFr=r>rN)buffer) rXrvr padbitsrg memoryviewrr,readonlyre)__amoderImo1o2nblocksrsmr[vblockr9yz1z2s r.r#r# s 6-4555 A 3xx1}}S$ QA a!e B q1uqy Q B3xx!|aA%GkG B 7^^00 sOOAEQUaK/ 0sz!444  !qGaK''~ (  E7())  KKMM  0AAAvv5<= 1zindent must be >= 0zwidth must be > %d (indent)r=rz''''(z %s  z%s) )r@stdoutr3rr!r4rXr6r7rvwrite enumeratestrflush) rrgrouprr_pprintgplepl type_name multilinequotesr[rRs r.r!r!Ms;~ 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/rightcRt|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')leftrbothz.mode must be 'left', 'right' or 'both', got %rrNrFrrr)r3rr5r6r7rXfind)rrstartstops r.r"r"s dC ,9S *+,, , ,,,I GOODD!E {{2A2w6>>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) IndexErrorrvrYrXr4)rvaluerIrrs r.r$r$sA  CA D (( 99Y..DD   DDD %jj%%%%%  ((((((s A AAct|ts$tdt|jzt |}|dkrt d|jr/t|j|j }|j dkr||zn||z}t | |j }|r||dz z r|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. zbitarray expected, got '%s'rznon-empty bitarray expectedrNrUrF) r3rr5r6r7rvrXrrr,r4 from_bytestobytes)rsignedlengthpadress r.r%r%s c8 $ $L5S 8JJKKK XXF {{6777 {ACK,,:11cCiisSy ..#*. = =C #!# qF{ Jr/ct|ts$tdt|jz|9t|tstd|dkrt d|rN|tdd|dz z}| |cxkr|ksnt d| ||fz|dkr|d|zz }n|r||z rt d d|z|fztd|}|t| |j }| ||j d k}||rt||rd nd n|dzSt||kr|r |d|n || dSt||kr|St|t|z |j }|r||zn||zS)aint2ba(int, /, length=None, endian=None, signed=False) -> bitarray Convert the given integer to a bitarray (with given bit-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. r1Nz"int expected for argument 'length'rzlength must be > 0z!signed requires argument 'length'rFz+signed integer not in range(%d, %d), got %dz,unsigned integer not in range(0, %d), got %drUrNrr0)r3r4r5r6r7rX OverflowErrorrrQr bit_lengthr, frombytesr"rvr) __irr,rrr-rRlers r.r&r&s) c3  G04993EEFFF &#&& B@AA A Q;;122 2 ? >?@@ @ !Oc A !)-.B3<!899 9 77 1; C  ?cVm ?!),-K+=!>?? ? FA Z 0 011QX FFAKKNNN X B ~67DuQ216222QWD 1vv0q&zzQwxx[0 1vv Q * *C %1s77cAg%r/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 There are to tyes of Node instances (both have 'freq' attribute): * leaf node: has 'symbol' attribute * parent node: has 'child' attribute (tuple with both children) c"|j|jkSrH)freq)rKothers r.__lt__z"_huffman_tree..Node.__lt__s9uz) )r/N)r7rzr{__doc__rr|r/r.Noders-   * * * * *r/rrF) heapqrrobjectitemssymbolrrvchild) __freq_maprrrminheapsymrleafparents r. _huffman_treers) ('''''''*****v***G""$$  Qtvv  $ g,,  ww'')9)99 l1o*V\!_-AA &!!! g,,   1:r/ct|ts$tdt|jzt |dkrIt |dkrt dt|d}|td|iSitd|ffd t|S)a:huffman_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 bit-endianness). Note that the symbols are not limited to being strings. Symbols may be any hashable object. dict expected, got '%s'r=r*cannot create Huffman code with no symbolsrc ||j<dS#t$r8|jd|dz|jd|dzYdSwxYw)NrrrF1rAttributeErrorr)ndprefixresulttraverses r.rzhuffman_code..traverse9sv 0 &F29    0 0 0 HRXa[&3, / / / HRXa[&3, / / / / / / 0 >AA) r3dictr5r6r7rvrXlistrr)rr,rrrs @@r.r'r' s j$ ' 'O1D4D4D4MMNNN : z??a  IJJ J:q!Xc6**++ F$Q//0000000 H]: & &''' Mr/c t|ts$tdt|jzt |dkrOt |dkrt dt|d}|tddiddg|gfSi d fd  t|t d }|d 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=rrrbigrFc ||j<dS#t$r8|jd|dz|jd|dzYdSwxYw)NrrFr)rr code_lengthrs r.rz#canonical_huffman..traverse\sv .%+K " " " . . . HRXa[&1* - - - HRXa[&1* - - - - - - .rc|dS)NrFr|)items r.z#canonical_huffman..js ar/)keyrcg|] }|d Srr|)rors r. z%canonical_huffman..xs777T!W777r/r)r3rr5r6r7rvrXrrrsortedrrr&) rrtablemaxbitscodedictrecoder[rrrs @@r.r(r(Ds j$ ' 'O1D4D4D4MMNNN : z??a  IJJ J:q!Xc5))*QFSE99K....... H]: & &''' ;$$&&,@,@ A A AEBilGH q[QC E D%e,,..=CtVU33  f  q53u::   AID U1q5\!_v- -D U77777 77r/rH)r;N)NF)rF)NrErrr)F)NNF)/rr*r@rcrOrrbitarray._utilrrrrr r r r r rrrrrrrrrrrrrrr__all__rrrr2r r#r!r"r$r%r&rr'r(r|r/r.rs  ))))))))                                                                 ([[[[[[[[|& & & & R****Z3333l(20-&-&-&-&b$$$N!!!!H4848484848r/