#iRdZddlZddlZddlZddlZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZmZmZmZmZmZmZmZmZmZmZmZmZmZmZmZmZgdZ ddZ!ddZ"ddZ#Gd d Z$dd Z%dd Z&dd Z'ddZ(dZ)ddZ*ddZ+dZ,ddZ-dZ.y)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_huffmanrc`ttjt||}||d=|S)zdurandom(n, /, endian=None) -> bitarray Return random bitarray of length `n` (uses `os.urandom()`). N)rosrr)__lengthendianas >/var/www/br/venv/lib/python3.12/site-packages/bitarray/util.pyrr+s, Jx016:A () Hct||}t|ts!tdt |j z|j |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.rr5sC VA a 0473C3CCDD ::a=r/c~tjdddkr tdt||}|j |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.rrEsE g%!#:; ;VA ::a=r/cDeZdZdZdezZdZd dZdZdZdZ d Z d Z y) r2g{Gz?Nc@||_t||_||_yN)nrnbytesr,)selfrHr,s r.__init__z_Random.__init__js m  r/c|j}tjd|zj|d}t ||j }||j d=|S)zV Return bitarray with each bit having probability p = 1/2 of being 1. rDlittleN)rIrandom getrandbitsto_bytesrr,rH)rJrIbr-s r. random_halfz_Random.random_halfosP   q6z * 3 3FH E Q $ dffgJr/cd|cxkr|jksntd|j|fzt|jddd}||j ddz|j S)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<rM byteorderrE)K ValueErrorrrPindexM)rJir-s r.op_seqz_Random.op_seqzsd1~tvv~5 CD D QZZXZ6 Aa$&&))r/c|j}|D]+}|r||jz}||jz}-|S)zm Combine random bitarrays with probability 1/2 according to given operator sequence. )rR)rJseqr-r9s r. combine_halfz_Random.combine_halfsQ     (AT%%''T%%''  ( r/cp|j}|dks||k\rD|dk(rt||jS||k(rt||jSt d|z||dzkDr&|j ||z }|j |S|dks||jzd|zkrd}nA||z }|dd|zz tj|z z}t||jdzz}|dkrt||j}| }n3|j|j|}|j|z }tj}|dkr3t!| D]"}||}||r||}||rd||<$|S|dkDr0t!|D]"}||}||s||}||sd||<$|S) Nrz&k must be in range 0 <= k <= n, got %sr<r=g?g?rE)rHrr,rrWrinvertrVmathsqrtr4r^r[countrN randrangerange) rJr9rHr-rZrBdiffre_s r.rz_Random.random_ks FF 6Q!VAvQ ,,AvAt{{++EIJ J qAv: a!e$A HHJH r6QZ!a%'AAA #a-499Q</ /AA!$%A q5a%A2D!!$++a.1A779q=D$$ !8D5\ aLd!! Ad!  AX4[ aLA$!! AA$!   r/c~dks dk(sdk\rmdk(r t|j|jSdk(r|jSdk(r t |j|jSt dz|jdkr2t fdt|jD|jSdkDr&|jdz }|j|S|jkr/|jtj|jSt|jz}|jdzz|dzkDr|dz }|j!|}||jz }|jdkr\|j"t%|d t'|k7zzkr2t fd t|jD|jS|j)|}|kr!|z d|z z }||j|z}|S|kDr|z }||j|z}|S) Ng??z*p must be in range 0.0 <= p <= 1.0, got %sr`c3LK|]}tjkywrGrN.0rhrBs r. z#_Random.random_p..HQV]]_q0H!$rEdr=c3LK|]}tjkywrGrmrns r.rpz#_Random.random_p..rqrr)rrHr,rRrrWrrfrraSMALL_PrrNbinomialvariater4rVr[rIlenboolr^)rJrBr-rZr]qxs ` r.rz_Random.random_ps  8qCx18CxTVVT[[11Cx''))CxDFFDKK00IAMN N 66B;H%-H KK) ) s7 cAg&A HHJH t|| ==!7!7!BC C DFF O  a!e # FAkk!n J 66C 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 >= 0irENr=r<01110110)r<r=rr00110101rDrk )r4rWrrwrsearchrbrc)r8r,oddrHr-frZjs r.r r s{ CA1u788 f !$Q$!$Q$!$Q$  f  AAccF  !c!f*q.SV ##A Q AbqE !" !QDIIa1f$5$; <= %AA A#$Aq1ula  % H!RTYYq\C%7!89 "A !Aa!enq1un  " Hr/cr|dvrtd|zd}t||kr t||S|dz}||dz zdz}|d|zdz zdz}t||zdz |z}|j}d}t |D]} t || |z| dz|z} t d |j| } |r%| |dz k(r| jr t | } d| | d | j} | sl|| z} | |k(r|n t| }|dk(r || | z|zz }| |k(r|n t| 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. )rEr<zunexpected mode %rirDrEr<r=rN)buffer) rWrwr padbitsrf memoryviewrr,readonlyrd)__amoderHmo1o2nblocksrsmrZvblockr9yz1z2s r.r#r# s} 6-455 A 3x1}S$ QA a!e B q1uqy Q B3x!|aA%GkkG B 7^0 sOAEQUaK 0szz!4 qGaK'~~  E7()  KKM AAAv5= 1zindent must be >= 0zwidth must be > %d (indent)r<z''''(z %s  z%s) )r?stdoutr3rr!r4rWr6r7rwwrite enumeratestrflush) rrgrouprr_pprintgplepl type_name multilinequotesrZrQs r.r!r!Ms~ c8 $ s6&F JE qy-.. [F z.// JE 6?@@ 6>uqy )C #+C axfnq S ""II"SX-CE0AAUJI  LLIv./#1 SA LL6C<0 1 u9>a#gl LL  SV  T LL6!" LLNr/ct|ts!tdt|jz|dvrt d|z|dk(rdn|j d}|dk(r|ddS|d k(rdn|j 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')leftrightbothz.mode must be 'left', 'right' or 'both', got %rrNrErrr)r3rr5r6r7rWfind)rrstartstops r.r"r"s dC 9S **+, , ,,I GOD!E {2Aw6>4sxxx';a'?D uT?r/c#K |d}t|}d}||kr0|} |j| |}t |||f| }||kr/yy#t$rYywxYw#t$r|}Y7wxYww)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) IndexErrorrwrXrWr4)rvaluerHrrs r.r$r$sA CA D ( 99Y.D%j%%%  (  D sOA,A A,AA, A, AA,AA, A)&A,(A))A,ct|ts!tdt|jzt |}|dk(r t d|jr9t|j|j}|jdk(r||zn||z}tj|j|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 expectedrMrTrE) r3rr5r6r7rwrWrrr,r4 from_bytestobytes)rsignedlengthpadress r.r%r%s c8 $5S 8J8JJKK XF {677 {{CKK,::1cCisSy ..#**. =C #!# qF{ Jr/c(t|ts!tdt|jz|+t|ts td|dkr t d|rC| tdd|dz z}| |cxkr|ksnt d| ||fz|dkr#|d|zz }n|r||z rt d d|z|fztd|}|jt|j|j }|j||jd k(}||rt||rd Sd S|dzSt||kDr |r|d|S|| dSt||k(r|St|t|z |j}|r||zS||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'rEz+signed integer not in range(%d, %d), got %dz,unsigned integer not in range(0, %d), got %drTrMrr0)r3r4r5r6r7rW OverflowErrorrrPr bit_lengthr, frombytesr"rwr) __irr,rrr-rQlers r.r&r&s c3 0493E3EEFF &#&@A A Q;12 2 >?@ @ !Oc A !)-.B3<!89 9 7 1; C cVm!),-K+=!>? ? FA Z 01QXX FAKKN X B ~67uQ22D62DQWD 1vq&z0Qwx[0 1v Q *C1s7%cAg%r/cddlm}m}Gddt}g}|j D]#\}}|}||_||_|||%t|dkDrl|}||||f|_|jdj |jdj z|_|||t|dkDrl|dS)z_huffman_tree(dict, /) -> Node Given a dict mapping symbols to their frequency, construct a Huffman tree and return its root node. r)heappushheappopceZdZdZdZy)_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) c4|j|jkSrG)freq)rJothers r.__lt__z"_huffman_tree..Node.__lt__s99uzz) )r/N)r7r{r|__doc__rr}r/r.Noders   *r/rrE) heapqrrobjectitemssymbolrrwchild) __freq_maprrrminheapsymrleafparents r. _huffman_treers (*v*G""$ Qv  $   g, w')99 ll1o**V\\!_-A-AA &! g,  1:r/c<t|ts!tdt|jzt |dkr5t |dk(r t 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<y#t$r5|jd|dz|jd|dzYywxYw)NrrrE1rAttributeErrorr)ndprefixresulttraverses r.rzhuffman_code..traverse9sQ 0 &F299  0 RXXa[&3, / RXXa[&3, / 0;AA) r3dictr5r6r7rwrWlistrr)rr,rrrs @@r.r'r' s j$ '1D4D4M4MMNN : z?a IJ J:q!Xc6*++ F$Q/0 ]: &' Mr/c| t|ts!tdt|jzt |dkr;t |dk(r t dt|d}|tddiddg|gfSi d fd  t|t jd }|d d}i}|dzdgz}d}t|D]M\}\}}t||d||<||xxdz cc<|dzt |ks8|dz }|||dzd|z z}O|||D cgc]} | d c} fScc} w) 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<rrrbigrEc ||j<y#t$r5|jd|dz|jd|dzYywxYw)NrrEr)rr code_lengthrs r.rz#canonical_huffman..traverse\sQ .%+K " . RXXa[&1* - RXXa[&1* - .rc |dS)NrEr})items r.z#canonical_huffman..js ar/)keyr)r)r3rr5r6r7rwrWrrrsortedrrr&) rrtablemaxbitscodedictrdcoderZrrrrs @@r.r(r(Dsg j$ '1D4D4M4MMNN : z?a IJ J:q!Xc5)*QFSE99K. ]: &' ;$$&,@ AEBilGH q[QC E D%e,.=CtVU3  f  q53u:  AID U1q5\!_v- -D . U7T!W7 777s) D9rG)rjN)NF)rE)NrDrPr)F)NNF)/rr*r?rbrNrrbitarray._utilrrrrr r r r r rrrrrrrrrrrrrrr__all__rrrr2r r#r!r"r$r%r&rr'r(r}r/r.rs  )            ([[|& R*Z3l(20-&b$N!H48r/